An Energy-Efficient Self-Adaptive Duty Cycle MAC Protocol for Traffic-Dynamic Wireless Sensor Networks

A plenty of Medium Access Control (MAC) protocols deal with static traffics with low traffic load. The performance of these protocols drops significantly when network traffic become dynamic or in high traffic load. In this paper, we propose a new MAC protocol called Self-Adaptive Duty Cycle MAC (SEA-MAC) by introducing dual adaptive mechanisms: (1) An Adaptive Scheduling (AS) mechanism which makes the nodes’ active duration adaptive to variable traffic load, thus enabling SEA-MAC to resiliently schedule data transmission for the Sleep period. The algorithm is designated to schedule more data transmission in bursty and high traffic load, thus enabling rapid dissemination of data and reduction of latency. While under the light traffic load, nodes enter the Sleep mode timely, mitigating idle listening and saving energy. (2) A Self-Adaptive duty cycle mechanism which further adjusts the duty cycle and makes SEA-MAC adaptive to the dynamic traffic loads. When network experience with very low or very high traffic load, the protocol further adjusts duty cycle dynamically based on the traffic load, thus reducing inefficient duty cycle or reduce end-to-end delay. Experiment results show that the SEA-MAC is a great advancement compared with AS-MAC and RI-MAC protocols on the performance for unicast scenarios, especially under heavy unicast traffic load. SEA-MAC can reduce average and max end-to-end delay up to 50.90 and 68.20% respectively, lower energy consumption up to about 16.28%, and increase PDR up to about 16% compared with AS-MAC. SEA-MAC superiors to RI-MAC in average end-to-end delay by up to 80% and in maximum end-to-end delay up to 90% for all the traffic load in question. SEA-MAC outperforms RI-MAC significantly in average duty cycle under medium and heavy traffic load.     

An efficient traffic control system using dynamic thresholding techniques in wireless mesh networks

Wireless mesh networks (WMNs) depend on a resilient and high‐performance infrastructure to provide users pervasive Internet access. In WMNs, all Internet traffic will be forwarded to the Internet gateways. Hence, these gateways are generally bottleneck nodes. This work proposes a traffic control technique to reduce the bottleneck problem and increase the utilization of network resources. Our approach provides a traffic control strategy that exploits dynamic techniques to adjust the threshold according to the traffic load of each gateway. The base threshold is defined in order to effectively control the traffic. When the current load exceeds the threshold of a gateway, the traffic redirection strategy is implemented by switching border nodes. The service regions can be adjusted for each gateway based on the traffic load. Furthermore, the proposed dynamic thresholding approaches can distribute the workloads of gateways and maintain the thresholds of any two gateways within a level range, making an in‐band balance of load. Thus, our proposed scheme can handle the unnecessary traffic redirection and reduce the traffic control overhead for various distributions of traffic. Experimental results demonstrate that our scheme outperforms other schemes in terms of packet delivery ratio and efficiency, especially in bursty traffic environments. Copyright © 2010 John Wiley & Sons, Ltd.     

Proportional fairness in MAC layer channel access of IEEE 802.11s EDCA based wireless mesh networks

Fairness provisioning in IEEE 802.11s EDCA based Wireless Mesh Networks (WMNs) is a very challenging task due to relayed traffic and traffic load variation among mesh routers. Because of bursty traffic in general purpose community wireless mesh networks, proportional fairness is more suited than max–min fairness, where mesh routers and clients should get channel access proportional to their traffic load. However, proportional fairness is hard to achieve by solving optimization function because of non-linearity and non-concave property of the objective function. In this paper, a probabilistic approach is proposed to provide proportional fairness without solving global non-linear and non-concave optimization. Every mesh node use a load estimation strategy to estimate total traffic load that it needs to forward. The required channel share of a mesh node should be proportional to its traffic load, whereas, the total normalized channel share for all the contending mesh nodes should be kept less than unity to satisfy the clique constraint. The network architecture and contention property in WMN are explored to deduce the required channel share of mesh nodes. A probabilistic approach is used to tune the contention window based on the difference between actual channel share and required channel share, so that the node with more traffic load gets more channel share. A discrete time Markov Chain based modeling is used to deduce the overall network throughput for the proposed scheme. Simulation result shows that the proposed scheme works better than the standard IEEE 802.11s based EDCA MAC in terms of fairness and throughput.     

混沌周期解提高测量灵敏度算法及抗干扰分析

混沌动力学系统具有初始条件的极端敏感性,当参数空间发生漂移时,系统的解空间将出现很大的变化.以Feigenbaun映射为例,分析了参数引起的分叉行为,提出利用混沌周期解提高测试系统灵敏度的方案.调整参数使测试系统工作在周期解的区域,根据参数敏感激发混沌系统周期数变化,设计了测量算法改善测量的精度和灵敏度,对混沌系统的抗干扰性进行了分析.     

Energy Efficiency Improvements in Heterogeneous Network Through Traffic Load Balancing and Sleep Mode Mechanisms

Heterogeneous network (HetNet) is one of the most promising approaches of IMT Advanced, which not only offers higher capacity and data rate, but also network Energy Efficiency (EE). HetNet is an advanced network that promotes complex cooperation between multiple tiers or sizes of base stations, i.e. macro, micro, pico, and femto base stations towards the above benefits. In this paper, a theoretical model for evaluating the EE of HetNet is proposed. Then, a sleep mode mechanism on picocells is proposed to reduce the total energy consumption which subsequently improves the EE. Simulation results show that EE can be increased by balancing the traffic load between different types of base stations. In fact, the improvement very much depends on the percentage of traffic that is offloaded to picocells. At low to medium traffic load conditions, significant improvements in EE can be observed through the proposed sleep mechanism. It is observed that by combining the sleep mode feature of picocells and load balancing between the different types of base stations in HetNet, further EE improvements up to 68 % for low traffic load and up to 33 % for medium traffic load can be achieved.     

一种无标度网络上的局部路由策略

提出了一种无标度（scale-free）网络上的局部路由策略。每个节点根据其当前负载与自身发送能力（设为等于节点度）的关系,自适应调整其接收邻居节点信息包的概率。此概率与每个节点度的α次方成正比,α是可自适应变化的偏好因子,由节点度以及负载联合决定。当节点负载小于发送能力时,增大其偏好因子;反之,则减小。这样使得整个网络业务量较小时,可以优先把业务转发往度较大的节点,从而更快到达目的地;而业务量较大时,度大以及度小节点的发送能力均能得到充分利用,从而提高了整个网络的业务承载能力。仿真结果表明,该策略有效地提高了网络容量,并且降低了网络中信息包的平均传输时延。     

基于Fisher的加权马尔可夫的话务预测

基于话务量数据的特性,提出基于加权马尔可夫的移动话务量预测模型。该模型具有要求的样本数量少,运算速度快,预测精度高,可检验等的特点。根据该模型的缺陷,应用模糊Fisher准则的有序聚类方法,可以对话务序列进行分类并建立分类标准,该方法克服了聚类有效性对样本空间分布的依赖并同时提高了算法的效率。仿真结果表明,在移动通信话务量预测中,该算法与其他方法相比较,运算速度快,准确度高。     

Study on a Distributed Wavelength Routing Algorithm in WDM Optical Transport Networks

A new design scheme for a distributed algorithm for routing and wavelength assignment (RWA) is developed in this paper, and the communication rules between the nodes to exchange signaling packets are discussed. The Adaptive-Alternate-Routing-Least-Load (AARLL) algorithm is implemented in the distributed scheme for the first time. Under dynamic traffic circumstances, the influence of the race condition, which does not exist in centralized scheme, on the network performance is analyzed and the analyzed results show that the race condition has a major impact on network performance only under light traffic load, while under medium and heavy traffic load the impact is very small. To analyze the performance loss caused by adopting the distributed algorithm for RWA, the capacity loss factor (CLF) is introduced and the calculated results show that CLF does not exceed 6% under medium traffic load.     

基于SDN的互联网域间路由研究

互联网流量的爆发式增长,叠加互联网流量固有的突发性特点,使得网络流量不均衡现象日益加剧。传统BGP协议由于缺乏全网拓扑和全局流量观,只能遵循标准BGP选路原则,在解决流量调度和负载均衡方面存在不足。针对BGP协议存在的局限性,研发了基于RR+的互联网骨干网流量调度系统,并应用于ChinaNet骨干网的网内中继、网间互联出口、IDC出口等多个流量优化场景。更进一步地,提出了一种基于SDN的互联网域间路由架构,通过在域间控制器之间交换BGP路由,无需在域内和域间运行BGP协议,极大地简化了网络协议,并能够实现灵活的流量调度和负载均衡。     

Domain load balancing routing for multi-gateway wireless mesh networks

As Wireless Mesh Networks (WMNs) are typically used for Internet access, most traffic is routed through the gateways which connect WMN to the wired network. As a result, the gateways tend to get congested and balancing of the traffic load of gateways is critical. In this paper, we consider applications that require continuous provision of a certain bandwidth to a server located at the wired network. If a path that satisfies the bandwidth request cannot be found, the request will be rejected, so that load imbalance will result underutilization of the network capacity. We present a novel load balancing routing algorithm for maximizing the network utilization (i.e., accommodating service requests as many as possible) for multi-gateway WMNs. In the proposed scheme, a WMN is divided into domains. Each domain is served by one gateway, so that all traffic of a domain is served by the corresponding gateway. Our scheme determines routing to balance the traffic load among domains, and then performs load balancing routing within each domain. Simulation results show that in square grid topologies, our intra-domain routing achieves near optimal performance with about 70% less overhead than the existing schemes. Our inter-domain load balancing scheme outperforms the existing heuristics by up to 25% while achieving about 80% performance of the optimal solution.     

Self‐organising cluster‐based cooperative load balancing in OFDMA cellular networks

Mobility load balancing (MLB) redistributes the traffic load across the networks to improve the spectrum utilisation. This paper proposes a self‐organising cluster‐based cooperative load balancing scheme to overcome the problems faced by MLB. The proposed scheme is composed of a cell clustering stage and a cooperative traffic shifting stage. In the cell clustering stage, a user‐vote model is proposed to address the virtual partner problem. In the cooperative traffic shifting stage, both inter‐cluster and intra‐cluster cooperations are developed. A relative load response model is designed as the inter‐cluster cooperation mechanism to mitigate the aggravating load problem. Within each cluster, a traffic offloading optimisation algorithm is designed to reduce the hot‐spot cell's load and also to minimise its partners’ average call blocking probability. Simulation results show that the user‐vote‐assisted clustering algorithm can select two suitable partners to effectively reduce call blocking probability and decrease the number of handover offset adjustments. The relative load response model can address public partner being heavily loaded through cooperation between clusters. The effectiveness of the traffic offloading optimisation algorithm is both mathematically proven and validated by simulation. Results show that the performance of the proposed cluster‐based cooperative load balancing scheme outperforms the conventional MLB. Copyright © 2013 John Wiley & Sons, Ltd.     

Impact of bursty error rates on the performance of wireless local area network (WLAN)

With an increasing popularity of DCF based wireless LAN, the modeling of 802.11 distributed coordination function (DCF) has attracted lots of research attention. Existing analysis of 802.11 DCF has been focused on the determination of the throughput and the packet delay under saturated traffic and ideal channel conditions. Although some recent papers address the saturated performance under a simple uniform error model, they can hardly capture the impact of bursty characteristics of wireless fading on the performance of 802.11 DCF. This paper presents exact formulae for the throughput and the delay in DCF for various traffic conditions when either saturated or unsaturated traffic load is present. A two-state Markov channel model is incorporated to present the bursty characteristics of channel errors. With our analysis, the impact of bursty channel error on unsuccessful transmission probability and the DCF performance can be determined. The results of our analytical framework reveal that the four-way handshaking scheme does not improve throughput substantially for light traffic load. However, for heavy traffic load, the four-way handshaking scheme is advantageous as compared to the basic access scheme. Also, extensive simulation is done to substantiate the accuracy of our analytical model.     

Reconfiguration and Dynamic Load Balancing in Broadcast WDM Networks*

In optical WDM networks, an assignment of transceivers to channels implies an allocation of the bandwidth to the various network nodes. Intuition suggests, and our recent study has confirmed, that if the traffic load is not well balanced across the available channels, the result is poor network performance. Hence, the time-varying conditions expected in this type of environment call for mechanisms that periodically adjust the bandwidth allocation to ensure that each channel carries an almost equal share of the corresponding offered load. In this paper we study the problem of dynamic load balancing in broadcast WDM networks by retuning a subset of transceivers in response to changes in the overall traffic pattern. Assuming an existing wavelength assignment and some information regarding the new traffic demands, we present two approaches to obtaining a new wavelength assignment such that (a) the new traffic load is balanced across the channels, and (b) the number of transceivers that need to be retuned is minimized. The latter objective is motivated by the fact that tunable transceivers take a non-negligible amount of time to switch between wavelengths during which parts of the network are unavailable for normal operation. Furthermore, this variation in traffic is expected to take place over larger time scales (i.e., retuning will be a relatively infrequent event), making slowly tunable devices a cost effective solution. Our main contribution is a new approximation algorithm for the load balancing problem that provides for tradeoff selection, using a single parameter, between two conflicting goals, namely, the degree of load balancing and the number of transceivers that need to be retuned. This algorithm leads to a scalable approach to reconfiguring the network since, in addition to providing guarantees in terms of load balancing, the expected number of retunings scales with the number of channels, not the number of nodes in the network.     

一种支持业务均衡的OBS自适应多可达性路由机制

针对光突发交换(OBS)网络中如何高效解决频繁发生的光突发竞争问题,提出了一种支持业务均衡的OBS自适应多可达性路由机制(AMR-LB).首先根据发送端发送业务量大小和当前网络业务承载状态,按需地为光突发确定多可达性路由;然后在非线性规划下,自适应地调整各条路由的业务承载比例.通过性能仿真,并与自适应替代路由算法(AA...     

MSC Pool负荷迁移机制及应用研究

针对常规MSC Pool负荷迁移后存在的MSC Pool中各MSC间负荷仍不均衡的情况,创立了基于话务模型的数据预测和多次迭代算法的迁移流程,实现了MSC Pool内的负荷均衡,并通过网管程序实现了负荷不均衡自动监测和负荷自动调整.     

A linear‐based trunk reservation routing algorithm for ATM networks

In this paper a practical routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost function which achieves a successful trade‐off between the use of the minimum‐hop routes and the application of the load‐balancing concept. Moreover, it employs the known Trunk Reservation notion according to a probability that increases linearly with the traffic load. This results in an effective compromise of the performance of the algorithm between light and heavy traffic loads. Finally, its simplicity and its suitability for a real‐time application render it as an efficient routing algorithm for ATM networks. Copyright © 1999 John Wiley & Sons, Ltd.     

A Drop and Throttle Flow Control Policy for Computer Networks

Store-and-forward packet switched networks are subject to congestion under heavy load conditions. In this paper a distributed drop and throttle flow control (DTFC) policy based on a nodal buffer management scheme is proposed. Two classes of traffic are identified: "new" and "transit" traffic. Packets that traveled over one or more hops are considered as transit packets. Packets that are candidates to enter the communication network are considered as new packets. At a given node if the number of allocated buffers is greater than a limit value, then new traffic is rejected, whereas transit traffic is accepted. Indeed, if the total buffer area is occupied, transit traffic is also rejected and, furthermore, it is dropped from the network. This policy is analyzed in the context of symmetrical networks. A queueing network model is developed whereby network throughput is expressed in terms of the traffic load, the number of buffers in a node and the DTFC limit value. Optimal policies where the limit value is a function of the traffic load are found to prevent network congestion. Furthermore, they achieve a very good network throughput even for loads fifty times beyond the normal operating region. Moreover, suboptimal, easy to implement fixed limit policies offer satisfactory results.     

Performance analysis for hierarchical multirate loss networks

The reduced load approximation technique has been extensively applied to flat networks, but the feasibility of applying it to hierarchical network model has seldom been described. Hierarchical routing is essential for large networks such as the Internet inter/intra-domain routing hierarchy and the Private Network to Node Interface (PNNI) standard. Therefore, this paper proposes an efficient and accurate analytical model for evaluating the performance of hierarchical networks with multiple classes of traffic. A performance analysis model with considering multiple classes of traffic, the complexity of analytical and explosion of computation will be extremely increased, and hence, result in inaccurate analytical. The issue of multiple classes of traffic has to be addressed in performance analysis model. In this paper, we first study the reduced load approximation model for loss networks, and then propose a novel performance evaluation model for large networks with multirate hierarchical routing. The hierarchical evaluation model is based on decomposing a hierarchical route into several analytic hierarchical segments. Once the blockings of these hierarchical segments are accurately determined, the blocking of the hierarchical path can be estimated accurately from these segments blocking. Numerical results indicate that the proposed hierarchical reduced load approximation yields quite accurate blocking probabilities as compared to that of simulation results. Furthermore, the accuracy of the proposed hierarchical reduced load approximation heuristic is independent of the blocking or the offered traffic load. Finally, we also draw some remarks on the convergence of the reduced load based approximation analysis model.     

A Fair and QoS-Aware Resource Allocation Scheme in UWB WPANs with WiMedia Distributed MAC

Merits of distributed medium access control specified by WiMedia Alliance such as distributed nature and high data rate make it a favorite candidate standard for high rate wireless personal area network. However, the current WiMedia MAC standard has not considered supporting Quality of Service (QoS) even though QoS parameters such as a range of service rates are provided to each traffic stream (TS). Therefore, we propose a fair and QoS-aware resource allocation method that provides a fair and maximized QoS for all TSs according to the current traffic load condition and differentiates SoQ among different QoS classes while guaranteeing fairness of SoQ within a QoS class in a fully distributed manner. Even in case that the traffic load varies, each device independently recognizes the changes and calculates fair and maximum allowable service rates for TSs. From the simulation results, it is proven that the proposed method achieves high capacity of TSs and fair QoS provisioning under various traffic load conditions.     

系统服务等级约束下提高认知无线网络可达业务负荷的研究

针对现有方案在系统服务等级约束下可能会降低认知无线网络可达业务负荷的问题,提出了一种新的频谱共享机制以提高系统服务等级约束下具有异构业务的认知无线网络可达业务负荷.该机制的主要思想是根据实时业务和非实时业务的不同延时特性,分别引入剥夺优先权和缓冲队列,进而同时减小异构次用户呼叫的强制中断概率和阻塞概率.仿真结果表明,所提机制能有效提高系统服务等级约束下认知无线网络的可达业务负荷.