Effective Energy Adaptive and Consumption in Wireless Sensor Network Using Distributed Source Coding and Sampling Techniques

Multimedia is the process of handling multiple medium of messages over network with high rate data services in wireless cellular area networks. Communication is the process of exchanging information form one service to another. In wireless networks are significantly growth of affecting network performance and energy consumption. The major problem is end to end delay in each node and meets the quality of services. The followings are considered for implementing wireless sensor network such as reduces the network delay, propagation delay and energy consumption. The senor node can sense the encoding value and reduce the network traffic delay using mitigation method. This paper propose a unique approach to provide simple routing services with reduced traffic delay, end to end delay network performance and to achieve better performance using Distributed Source Coding and Effective Energy Consumption methods. In this paper we use optimal early detection algorithm for improving network performance and energy consumption problem. An iterative Shannon fano and Tuker method is used for finding optimal solution of each node values. Network Simulator-3 is used for simulating network environments and setup the experiments. Our proposed method shows high data rate, good performance and low energy consumptions. The results compare with existing methodologies and performance is good.

     

基于群延迟和模糊函数的LFMICW对消分析

针对线性调频中断连续波(LFMICW)信号的隐身问题,根据LFMICW回波信号中目标信息处理方法,提出利用信号和匹配滤波器的群延迟特性设计LFMICW对消信号.定义了对消误差因子,并分析了信噪比为6dB且该因子不同取值时单目标的对消结果,利用模糊函数分析对消后的目标合成回波和未对消的干扰目标回波信号的模糊特性,并给出了...     

Efficient Spectrum Sensing with Minimum Transmission Delay in Cognitive Radio Networks

In cognitive radio (CR) networks, the secondary users (SUs) need to find idle channels via spectrum sensing for their transmission. In this paper, we study the problem of designing the sensing time to minimize the SU transmission delay under the condition of sufficient protection to primary users (PUs). Energy detection sensing scheme is used to prove that the formulated problem indeed has one optimal sensing time which yields the minimum SU transmission delay. Then, we propose a novel cooperative spectrum sensing (CSS) framework, in which one SU’s reporting time can be used for other SUs’ sensing. The analysis focuses on two fusion strategies: soft information fusion and hard information fusion. Under soft information fusion, it is proved that there exists one optimal sensing time that minimizes the SU transmission delay. Under hard information fusion, for time varying channels, the novel multi-slot CSS is derived. The performance of SU transmission delay is studied in both perfect and imperfect reporting channels. Some simple algorithms are derived to calculate the optimal sensing settings that minimize the SU transmission delay. Computer simulations show that fundamental improvement of delay performance can be obtained by the optimal sensing settings. In addition, the novel multi-slot CSS scheme shows a much lower transmission delay than CSS based on general frame structure.     

基于延迟共轭相乘的弹道目标平动补偿

弹道目标微动叠加在弹道高速平动基础上,为了获得目标的微多普勒信息,需要对平动进行补偿。该文提出了一种基于延迟共轭相乘的平动参数估计方法,该方法通过延迟共轭相乘保留平动信息而消除微动的影响,并将平动参数估计问题转换为多项式相位信号参数估计问题,实现了平动参数的估计。仿真结果表明,所提算法能够在较低信噪比下实现平动参数的高精度补偿。      

Dynamic Threshold Delay Characterization Model for Improved Static Timing Analysis

Transistors within a gate take a finite amount of time to switch and hence there is always a propagation delay associated with it. These delays are evaluated by standard cell characterization techniques using EDA tools. However, these standard measurement methods tend to fail when simulating the design with practical values of slope and load and gives rise to the problem of negative or non-monotonic delays. Negative/non-monotonic delays lead to false positives during static timing analysis, synthesis and simulation of circuits and are undesirable. Hence, there is a need to implement new methods for characterization of propagation delay that will lead to more realistic monotonic delay values, ultimately achieving early timing closures. One such method of delay measurement based on actual switching thresholds has been proposed in this work.     

Optimal Rate–Delay Tradeoffs and Delay Mitigating Codes for Multipath Routed and Network Coded Networks

Via multiterminal information theory, a framework is presented for deriving fundamental rate–delay tradeoffs that delay mitigating codes must have when utilized over multipath routed and random linear network coded networks. The rate–delay tradeoff is formulated as a calculus problem on a capacity region of a related abstracted broadcast channel. Given this general framework for studying such rate–delay tradeoffs, the extreme case of uniform networks, in which each possible received packet arrival order is equally likely, is considered. For these networks, the rate–delay calculus problem is simplified to an integer programming problem, which for small numbers of packets may be solved explicitly, or for larger numbers of packets, may be accurately approximated through the calculus of variations by appropriate relaxation of an integer constraint. Explicit expressions for the rate–delay tradeoff in uniform networks are presented in the special cases of i) constant packet inter-arrival times, and ii) exponential independent and identically distributed (i.i.d.) packet arrival times. Finally, the delay mitigating codes achieving these rate–delay tradeoffs are discussed.      

一种基于平均时延最小化的跨层自适应算法

该文研究了OFDM系统的跨层自适应问题。针对现有资源分配算法不能有效地兼顾频谱效率、公平性和QoS的问题,提出了一种综合考虑CSI和排队信息的基于平均时延最小化的跨层自适应资源分配算法。该算法利用经济学中的效用理论,将平均等待时间作为优化权重,充分保证了不同业务的QoS,通过效用函数保证了不同等待时间或者不同QoS的公平性。仿真结果显示,该算法的时延性能略好于LWDF算法,大大好于PF算法和EXP算法,并且很好地保证了时延的公平性,非常适合对时延敏感的通信。     

基于非参量累积和的合作频谱感知

针对认知无线电网络中频谱感知的检测时延降低问题,提出了基于非参量累积和的合作频谱感知算法。本地认知用户预处理频谱观测数据,获得观测数据相对于信念值的正向漂移和负向漂移。为了缩短检测延迟,认知用户只将数据的正向漂移同步传输至融合中心。融合中心融合正向漂移得到判决信息,采用非参量累积和算法依时间序列顺序累加判决信息,判断主用户是否正在使用授权频段。为了解决不传输负向漂移引起的虚警问题,改进算法提出融合中心可以保留首次判决,经过等待时间间隔后再作出最终判决。相对于传统的软融合算法,改进融合规则的合作频谱感知算法具有较低的检测延迟。     

Ergodic Sum Rate Maximization for Underlay Spectrum Sharing with Heterogeneous Traffic

A radio resource allocation framework is proposed for underlay spectrum sharing. The ergodic capacity maximization problem in orthogonal frequency division multiple access-based network on point to multi point transmission is formulated and solved. Heterogeneous traffic is also considered in which two types of traffic is assumed: streaming traffic which has strict delay requirements, and elastic traffic with flexible delay requirements. Considering the effect of channel state information (CSI) imperfection in the evaluation of the secondary users’ expected rate, we further assume that the estimated CSI between the secondary users and secondary base station (secondary channel) is not perfect. Moreover three different cases are considered depending on the availability of the CSI between the secondary base station and the primary receivers (interference channel). Using simulations, we evaluate the impact of streaming traffic and imperfect CSI on the sum capacity of the secondary elastic users for different values of parameter systems.     

基于Skip-LSTM的机场群延误预测模型

针对目前机场群发展不平衡，国际枢纽机场的延误率居高不下，航班时刻短缺，资源紧张，而区域枢纽机场却存在资源空闲的问题，提出一种基于跳过门的长短时记忆网络 (Skip-LSTM，Skip Long Short Term Memory)的机场群延误预测模型。该模型首先将机场群中各个机场的信息，机场群航班信息以及机场群地区的气象信息进行融合及处理，然后搭建Skip-LSTM网络对融合后的数据信息进行特征提取，最后利用Softmax分类器对机场群的延误状况进行分类预测。Skip-LSTM网络在传统的长短时记忆网络(LSTM， Long Short Term Memory)的基础上增加了Skip门，能更加充分地提取机场群数据信息的时间相关性，获得更高的准确率。实验结果表明，基于Skip-LSTM的机场群延误预测模型的准确率可达95.35%，预测性能优于传统的网络模型，能对机场群的延误状况进行有效的预测。      

基于CBAM-CondenseNet的航班延误波及预测模型

针对航班延误衍生的航班延误波及问题,该文提出一种基于CBAM-CondenseNet的航班延误波及预测模型。首先,通过分析航班延误在航空网络内产生的延误波及现象,确定会受前序延误航班影响的航班链;其次,对选定的航班链数据进行清洗,将航班信息与机场信息进行数据融合;最后,提出改进的CBAM-CondenseNet算法对融合后的数据进行特征提取,构建Softmax分类器对首班离港航班延误波及的后续离港航班延误等级进行预测。该文提出的CBAM-CondenseNet算法融合了CondenseNet和CBAM的优势,采用通道和空间注意力机制来加强网络结构深层信息的传递。实验结果表明,算法改进后有效提升网络性能,预测准确率可达97.55%。     

运用模糊数解决非确定环境下的路由问题

本文基于模糊数学的有关原理,论述了网络环境不确定的条件下路由问题的求解.本文假定网络链路延迟是模糊数,给出了路径延迟小于端到端延迟约束的可信度的定义,提出了路径可信度判定(Path Reliability Decision:PRD),最优可信度路由(Most Optimal Reliability Path:MORP),最优路径分解(Path Optimal Partition:POP),及最优分解路径(Most Optimal Partition Path:MOPP)等问题.本文证明,PRD是多项式可解的,POP可以用等可信度分解实现,一般情况下,MORP和MOPP是等价的.在所有链路延迟的宽度都相同时,MORP转化为约束为跳数的最短路径问题,因此是多项式可解的.最后我们给出了MORP的近似算法,算法的时间复杂度为O(log(ε)^-1(vlog(v)+e)).     

Multi-agent reinforcement learning for edge information sharing in vehicular networks

To guarantee the heterogeneous delay requirements of the diverse vehicular services, it is necessary to design a full cooperative policy for both Vehicle to Infrastructure (V2I) and Vehicle to Vehicle (V2V) links. This paper investigates the reduction of the delay in edge information sharing for V2V links while satisfying the delay requirements of the V2I links. Specifically, a mean delay minimization problem and a maximum individual delay minimization problem are formulated to improve the global network performance and ensure the fairness of a single user, respectively. A multi-agent reinforcement learning framework is designed to solve these two problems, where a new reward function is proposed to evaluate the utilities of the two optimization objectives in a unified framework. Thereafter, a proximal policy optimization approach is proposed to enable each V2V user to learn its policy using the shared global network reward. The effectiveness of the proposed approach is finally validated by comparing the obtained results with those of the other baseline approaches through extensive simulation experiments.     

QoS routing in networks with uncertain parameters

We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate. Such uncertainty about the actual state of a network component arises naturally in a number of different environments. The goal of the route selection process is then to identify a path that is most likely to satisfy the QoS requirements. For end-to-end delay guarantees, this problem is intractable. However, we show that by decomposing the end-to-end constraint into local delay constraints, efficient and tractable solutions can be established. Moreover, we argue that such decomposition better reflects the interoperability between the routing and reservation phases. We first consider the simpler problem of decomposing the end-to-end constraint into local constraints for a given path. We show that, for general distributions, this problem is also intractable. Nonetheless, by defining a certain class of probability distributions, which includes typical distributions, and restricting ourselves to that class, we are able to establish efficient and exact solutions. We then consider the general problem of combined path optimization and delay decomposition and present efficient solutions. Our findings are applicable also to a broader problem of finding a path that meets QoS requirements at minimal cost, where the cost of each link is some general increasing function of the QoS requirements from the link     

SSCOP信令传输时延分析与检测

SSCOP协议是ATM宽带网络信令系统数据链路层的一部分,SSCOP信令链路为ATM网络元素之间提供可靠的信令信息传输。信令链路传输时延是ATM网络传输质量的一个重要参数,SSCOP协议的很多重要参数的取值都依赖于传输时延的大小。介绍一种SSCOP信令链路传输时延的检测方法,通过构造一种特殊的SSCOP报文来测试信令网络的传输质量,并计算信令报文的传输时延。对提高ATM信令系统的网络质量和优化SSCOP协议参数具有一定的现实意义。     

Interference management using basestation coordination in broadband wireless access networks

This paper proposes a transmission‐scheduling algorithm for interference management in broadband wireless access networks. The algorithm aims to minimize the cochannel interference using basestation coordination while still maintaining the other quality of service (QoS) requirements such as packet delay, throughput and packet loss. The interference reduction is achieved by avoiding (or minimizing) concurrent transmission of potential dominant interferers. Dynamic slot allocation based on traffic information in other cells/sectors is employed. In order to implement the algorithm in a distributed manner, basestations (BSs) have to exchange traffic information. Both real‐time and non‐real‐time services are considered in this work. Results show that significant reduction in the packet error rate can be achieved without increasing the packet delay at low to medium loading values and with a higher but acceptable packet delay at high loading values. Since ARQ schemes can also be used for packet error rate reduction, we compare the performance of the proposed scheme with that of ARQ. Results indicate that although ARQ is more effective in reducing packet error rate, the proposed algorithm incurs much less packet delay particularly at medium to high loading. Copyright © 2006 John Wiley & Sons, Ltd.     

基于预译码的极化码最大似然简化连续消除译码算法

针对极化码译码串行输出造成较大译码时延的问题,该文提出一种基于预译码的最大似然简化连续消除译码算法。首先对译码树节点存储的似然值进行符号提取并分组处理,得到符号向量组;然后比较符号向量组与该节点的某些信息位的取值情况,发现向量组中储存的正负符号分布规律与该节点的中间信息位的取值具有一一对应的关系;在此基础上对组合码中间的1～2 bit进行预译码;最后结合最大似然译码方法估计组合码中的剩余信息位,从而得到最终的译码结果。仿真结果表明:在不影响误码性能的情况下,所提算法与已有的算法相比可有效降低译码时延。     

A novel scheme using the information of departure processes fordelay guarantees of distributed VBR traffic

In this paper, we consider the problem of providing delay guarantees in a distributed environment, e.g., a wireless network or a cable network. In a distributed environment, the information of the arrival process is, in general, not available to the network. Due to the lack of such information, traffic regulators and scheduling policies discussed in the literature cannot be directly applied. To cope with the problem, we propose a distributed traffic regulator (DTR) that uses the information of the departure process. Based on such DTRs, we propose the distributed earliest deadline first (DEDF) scheduling policy. For the DEDF scheme, we derive an admission-control criterion and show that the maximum delay can be guaranteed if the criterion is satisfied     

Node delay assignment strategies to support end-to-end delay requirements in heterogeneous networks

In a complex, heterogeneous network environment, such as the Internet, packets traversing different networks may be subjected to different treatments and may face different traffic loads across the routing path. This paper addresses the key issue of how to assign delay budgets to each network node along the routing path so that the end-to-end delay requirements of the supported applications are met. First, we describe a methodology to compute for a given flow a set of feasible per-node delays for the class of delay-based servers. We then formalize an optimal per-node delay assignment problem which takes into consideration the workload across the routing path. The solution, for homogeneous and heterogeneous networks, is provided. The resulting solution is optimal, but its implementation overhead is relatively high. To overcome this shortcoming, we propose two heuristics, EPH() and LBH(), to approximate the optimal strategy. EPH() uses the equi-partition concept to compute initial delay values and adjust these delay values to meet the end-to-end delay requirements. LBH() uses a relaxation factor to distribute the load proportionally across all nodes on the routing path. A simulation-based comparative analysis shows that the heuristics perform closely to the optimal schemes.     

Dynamic Scheduling Protocols for a Multiple-Access Channel

In this paper the multiple-access problem in a packet network is considered. A finite number of independent, packet transmitting users is assumed. Protocols are developed to allocate the channel resources among the users. Part of the channel capacity is assigned to control information. This information is used to make probabilistic inferences of the queue lengths and delay characteristics of the users. The probabilistic inferences are used to develop dynamic scheduling protocols for data transmission. Protocols are developed for two different levels of control information. An analysis of the relationship between amount of control information and system performance is carried out, and a study of the frequency of transmission of control information is also provided.