基于AOMDV的自适应负载均衡研究

针对Ad-hoc网络中大多数路由协议没有考虑如何使流量在网络中平均分配的问题,提出了一种自适应的负载均衡方法,使建立的路径减少拥塞,并且流量会均匀地分布在网络中。在Ad-hoc按需多路径距离矢量(AOMDV)中应用这种方法,并且通过NS2仿真结果表明网络负载在总体上是均衡的,路由开销和平均端到端时延的性能也提高了。     

标准的高效的WSN路由协议

无线传感网络包括许多个微小的节点,这些节点具有感知、计算和无线通信的能力。遗憾的是,这些设备是能源有限的设备,这就意味着我们必须尽可能的节约能源以尽可能的延长网络的生命周期。在这片文章中我们介绍标准的能量高效的路由协议,这一协议通过基于请求-应答路由的AODV和依赖于路由中剩余能量的MRPC之间的转换延长了网络生命周期。     

一种基于信道利用状况的无线Mesh路由判据

无线Mesh网络,又称无线因特网,融合了无线局域网和移动Ad Hoe网络的优势,它已经成为下一代无线网络的关键技术之一.路由技术对Mesh网络性能起着至关重要的作用.现有用于Ad Hoc的路由协议不能充分体现WlVlN的特殊性,在现有WCETT及CCM判据的基础上,提出一种新的用于Mesh网络的多信道路径判据Weighted Cumulative CCM-L(WCCCM-L),该判据主要根据信道利用状况选择干扰低的路径发送消息.     

WSN中负载均衡能量有效的路由算法研究

在PHGASIS建链方法的基础上提出了一种改进的建链方法；在此基础上提出了一种基于双层链结构并由基站集中控制的负载均衡、能量有效的路由算法（LBEERA），此算法充分利用了簇状路由算法和链状路由算法的优点．LBEERA算法将网络划分为多个簇，每个簇的节点组成一条低层链，每条链的链头节点形成一条高层链．仿真试验发现，相对于LHACH算法和PHGASIS算法，LBEERA算法增加了网络生存时间，减少了包传输时延．     

一种基于负载均衡的高能效LLN路由算法

针对低功耗有损网络(LLN)中由于节点部署不均匀易导致负载不均衡的问题,提出一种基于负载均衡的高能效LLN路由算法(EELB-RPL)。通过将链路质量、传输时延、节点剩余能量、吞吐量以及拥塞检测因子等因素相结合选出最优父节点;再通过调整溪流计时器,使节点根据网络拓扑密度调整自身抑制机制,避免了抑制不公平性导致负载不均衡。仿真结果表明,所提算法与现有算法相比较,能够有效实现负载均衡。其中,数据包投递率提升了14.6%,根节点吞吐量提升了28.5%,网络平均寿命提升了8.96%。     

基于负载均衡的Ad Hoc网络多信道MAC协议

在Ad hoc网络多信道MAC层协议中,信道的负载均衡问题会影响系统的性能,已有的负载均衡方法大多基于载波侦听技术,给每个数据信道配置一个物理载波侦听模块,这增加了设备复杂度和系统能耗。为此,提出了一种新的基于虚拟载波侦听的负载均衡方法,系统设置负载信息表记录每个数据信道的负载信息,使节点不需要侦听模块就可以获取数据信道上的负载量。仿真结果表明该方法提高了系统的性能。     

基于能量和负载均衡的AODV路由协议改进

在Ad Hoc网络中AODV路由协议是一个比较成熟且广泛接收的路由协议,具有较低的内存和处理开销,实现简单,但是AODV协议在能量和负载方面却存在着很大问题;针对这个问题提出无线Ad Hoc网络中基于AODV路由协议的能量和负载均衡的B-AODV协议。B-AODV协议考虑了节点的剩余能量和节点的已使用缓冲区大小两个度量,使之支持能量均衡和负载均衡,仿真结果表明B-AODV协议有效地均衡了AODV路由协议的能量消耗和节点的负载,延长了网络的生存时间,提高了包的传输率,充分利用了网络资源。     

基于定向天线的WSN路由关键技术研究

定向天线相比于全向天线可提高无线传感器网络的吞吐量,减少通信信道之间的干扰,提高网络信噪比,且能有效提升无线传感器网络路由协议DRP的性能,本文针对定向天线技术在无线传感器网络的实现方法,分析其应用优势,并对定向路由中的主要技术进行分析。     

一种基于前向感知因子的WSN能量均衡路由方法

无线传感网络由于受能量和通信能力的限制,为了保证感知数据的有效送达,路由方法(协议)的设计显得尤为关键.本文提出了一种基于前向感知因子的能量均衡路由协议FAF-EBRP,它通过感知链路权重和前向区域内的能量密度来决定下一跳节点,并设计了相应的局部拓扑自发重构机制.通过实验对FAF-EBRP和LEACH、EEUC两个典型路由方法(协议)进行了比较,结果表明,FAF-EBRP能使无线传感网络表现出更好的能量均衡性和更长的有效工作时间.     

多电台多信道无线mesh网络路由研究

针对多电台多信道无线mesh网络中AODV-MR路由判据是基于最小跳数,并且缺乏动态的负载均衡机制,不能选择和维护高性能的路由。针对以上不足,考虑无线链路传输速率、包损失率、流干扰以及通信负载,引入多尺度衡量路由判据MOWCETT和动态负载均衡机制,提出一种改进路由协议-OMAR。利用NS2仿真平台,仿真结果表明OMAR路由协议使路由性能得到改善。     

基于最小跳数的无线传感器网络路由协议

在分析了最小跳数路由算法局限性的基础上对该算法进行了改进,充分考虑了无线传感器网络的跳数、能量、负载均衡等问题。改进后的算法使得传感器的某些节点不会因为频繁使用而迅速死亡,数据包可以沿着最优的路径向网关节点发送。仿真结果显示,改进后的算法可以有效地提高无线传感器网络的可靠性和稳定性,延长了网络的通信时间。     

Trust-aware secure routing protocol for wireless sensor networks

A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.     

An unequal cluster-based routing protocol in wireless sensor networks

Clustering provides an effective method for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques; selecting cluster heads with more residual energy, and rotating cluster heads periodically to distribute the energy consumption among nodes in each cluster and extend the network lifetime. However, they rarely consider the hot spot problem in multihop sensor networks. When cluster heads cooperate with each other to forward their data to the base station, the cluster heads closer to the base station are burdened with heavier relay traffic and tend to die much faster, leaving areas of the network uncovered and causing network partitions. To mitigate the hot spot problem, we propose an Unequal Cluster-based Routing (UCR) protocol. It groups the nodes into clusters of unequal sizes. Cluster heads closer to the base station have smaller cluster sizes than those farther from the base station, thus they can preserve some energy for the inter-cluster data forwarding. A greedy geographic and energy-aware routing protocol is designed for the inter-cluster communication, which considers the tradeoff between the energy cost of relay paths and the residual energy of relay nodes. Simulation results show that UCR mitigates the hot spot problem and achieves an obvious improvement on the network lifetime. Guihai Chen obtained his B.S. degree from Nanjing University, M. Engineering from Southeast University, and PhD from University of Hong Kong. He visited Kyushu Institute of Technology, Japan in 1998 as a research fellow, and University of Queensland, Australia in 2000 as a visiting professor. During September 2001 to August 2003, he was a visiting professor at Wayne State University. He is now a full professor and deputy chair of Department of Computer Science, Nanjing University. Prof. Chen has published more than 100 papers in peer-reviewed journals and refereed conference proceedings in the areas of wireless sensor networks, high-performance computer architecture, peer-to-peer computing and performance evaluation. He has also served on technical program committees of numerous international conferences. He is a member of the IEEE Computer Society. Chengfa Li was born 1981 and obtained his Bachelor’s Degree in mathematics in 2003 and his Masters Degree in computer science in 2006, both from Nanjing University, China. He is now a system programmer at Lucent Technologies Nanjing Telecommunication Corporation. His research interests include wireless ad hoc and sensor networks. Mao Ye was born in 1981 and obtained his Bachelor’s Degree in computer science from Nanjing University, China, in 2004. He served as a research assistant At City University of Hong Kong from September 2005 to August 2006. He is now a PhD candidate with research interests in wireless networks, mobile computing, and distributed systems. Jie Wu is a professor in the Department of Computer Science and Engineering at Florida Atlantic University. He has published more than 300 papers in various journal and conference proceedings. His research interests are in the areas of mobile computing, routing protocols, fault-tolerant computing, and interconnection networks. Dr. Wu serves as an associate editor for the IEEE Transactions on Parallel and Distributed Systems and several other international journals. He served as an IEEE Computer Society Distinguished Visitor and is currently the chair of the IEEE Technical Committee on Distributed Processing (TCDP). He is a member of the ACM, a senior member of the IEEE, and a member of the IEEE Computer Society.     

Dynamic energy efficient routing protocol in wireless sensor networks

Wireless Networks - Currently, IEEE 802.11 standard for ad-hoc wireless mode is inadequate for multi-hop network. Recent efforts for the advancement of 802.11 standards, such as 11e for QoS support...     

A centralized energy-efficient routing protocol for wireless sensor networks

Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Several network layer protocols have been proposed to improve the effective lifetime of a network with a limited energy supply. In this article we propose a centralized routing protocol called base-station controlled dynamic clustering protocol (BCDCP), which distributes the energy dissipation evenly among all sensor nodes to improve network lifetime and average energy savings. The performance of BCDCP is then compared to clustering-based schemes such as low-energy adaptive clustering hierarchy (LEACH), LEACH-centralized (LEACH-C), and power-efficient gathering in sensor information systems (PEGASIS). Simulation results show that BCDCP reduces overall energy consumption and improves network lifetime over its comparatives.     

Passive cluster-based multipath routing protocol for wireless sensor networks

Energy efficiency and quality of service (QoS) are both essential issues in the applications of wireless sensor networks (WSNs) all along, which are mainly reflected in the development of routing and MAC protocols. However, there is little design for achieving the dual performances simultaneously. In this paper, we develop a practical passive cluster-based node-disjoint many to one multipath routing protocol to satisfy the requirements of energy efficiency and QoS in practical WSNs. Passive clustering approach is put to use in the first round, while active clustering technique is taken in the other rounds. Implementation of smart delay strategy makes the cluster distribute uniformly, as well as lessen the number of nodes that have taken part in routing. Among cluster heads, a node-disjoint many to one multipath routing discovery algorithm, which is composed of the optimal path searching process and multipath expansion process, is implemented to find multiple paths at the minimum cost. The simulation results show the proposed protocol achieved very good performance both in energy efficiency and QoS.     

无线传感器网络分簇路由协议研究

在无线传感器网络中,分簇型路由在路由协议中占据重要的地位,该协议方便拓扑结构管理,能源利用率高,数据融合简单。文章从簇头生成、簇形成和簇路由3个角度对典型的分簇路由算法LEACH,HEED,EEUC,PEGASIS进行了系统描述,从网络生命周期和节点存活数量等方面,对比了其优缺点,结合该领域的研究现状,指出了未来研究的方向。     

无线传感器网络能量均衡分簇路由协议

针对LEACH协议存在的3大问题:簇头选举时未考虑节点剩余能量、频繁成簇造成了大量额外能耗以及欠缺对簇间能耗均衡的考虑,提出了能量有效分簇路由协议(LEACH-improved).该协议中,首轮成簇后网络中簇的分布和数量将保持不变,以后每轮各簇的簇头由上一轮簇头结合节点的能量水平来指定,借鉴泛洪算法的思想,在簇间建立多...     

Hybrid routing and load balancing protocol for wireless sensor network

In wireless sensor network, when the nodes are mobile, the network structure keeps on changing dynamically, that is, new nodes enter the network and old members exit the network. As a result, the path from one node to the other varies from time to time. In addition, if the load on a particular part of the network is high, then the nodes will not be capable of transmitting the data. Thus, data delivery at the destination will be unsuccessful. Moreover, the part of the network involved in transmitting the data should not be overloaded. To overcome these issues, a hybrid routing protocol and load balancing technique is discussed in this paper for the mobile data collectors in which the path from source to destination is ensured before data transmission. The hybrid routing protocol that combines the reactive and proactive approach is used to enhance gradient based routing protocol for low power and lossy networks. This protocol can efficiently handle the movement of multiple sinks. Finally, load balancing is applied over the multiple mobile elements to balance the load of sensor nodes. Simulation results show that this protocol can increase the packet delivery ratio and residual energy with reduced delay and packet drop.     

Adaptive energy aware cluster-based routing protocol for wireless sensor networks

Wireless sensor networks (WSNs) have grown excessively due to their various applications and low installation cost. In WSN, the main concern is to reduce energy consumption among nodes while maintaining timely and reliable data forwarding. However, most of the existing energy aware routing protocols incur unbalanced energy consumption, which results in inefficient load balancing and compromised network lifetime. Therefore, the main target of this research paper is to present adaptive energy aware cluster-based routing (AECR) protocol for improving energy conservation and data delivery performance. Our proposed AECR protocol differs from other energy efficient routing schemes in some aspects. Firstly, it generates balance sized clusters based on nodes distribution and avoids random clusters formation. Secondly, it optimizes both intra-cluster and inter-cluster routing paths for improving data delivery performance while balancing data traffic on constructed forwarding routes and at the end, in order to reduce the excessive energy consumption and improving load distribution, the role of Cluster Head (CH) is shifted dynamically among nodes by exploit of network conditions. Simulation results demonstrate that AECR protocol outperforms state of the art in terms of various performance metrics.