IARP: An Intelligent ACO-Based Routing Protocol with Multiple Mobile Sinks Support for Wireless Sensor Networks

Wireless Personal Communications - Using a single fixed sink in wireless sensor networks (WSNs) creates the hotspot problem. Recently, the mobile sink technique is considered as a good solution to...     

一种改进的无线传感器网络分簇路由协议

针对无线传感器网络中节点能量受限的特征,提出了ILEACH(improved-LEACH)分簇路由协议,达到延长网络生存时间的目的,该分簇路由协议在簇头选取时,充分考虑了节点的剩余能量;簇形成时利用了距离阈值的约束来优化分簇方案;数据收集阶段,根据节点的权值在簇头节点之间建立到基站的路由树,利用NS2仿真软件对LEACH和ILEACH协议进行仿真、比较,结果显示ILEACH具有良好的性能.     

一种无线传感器网络自适应协同通信路由协议

无线传感器网络的重要应用特性是具有感测信息的传感节点形成一个自适应本地网络,由中心节点执行不同的协作信息处理任务。该文基于互信息量分析了不同中心节点选择机制的开销性能,证明了基于扩散计算的选择机制的开销有效性;提出一种自适应协同通信路由协议(ACCRP)：节点以分布式的方式选择中心节点并建立传输路径;分析讨论了ACCRP的性能参数;并通过实验验证了ACCRP是能源有效的、可扩展的自适应路由协议。     

An Energy-Efficient Routing Protocol for Event-Driven Dense Wireless Sensor Networks

The routing energy efficiency of a wireless sensor network is a crucial issue for the network lifetime. In this article, we propose MICRO (MInimum Cost Routing with Optimized data fusion), an energy-efficient routing protocol for event-driven dense wireless sensor networks. The proposed routing protocol is an improvement over the formerly proposed LEACH and PEGASIS protocol, which is designed to be implemented mainly with node computations rather than mainly with node communications. Moreover, in the routing computation the proposed scheme exploits a new cost function for energy balancing among sensor nodes, and uses an iterative scheme with optimized data fusions to compute the minimum-cost route for each event-detecting sensor node. Compared to the PEGASIS routing protocol, MICRO substantially improves the energy-efficiency of each route, by optimizing the trade-off between minimization of the total energy consumption of each route and the balancing of the energy state of each sensor node. It is demonstrated that the proposed protocol is able to outperform the LEACH and the PEGASIS protocols with respect to network lifetime by 100–300% and 10–100%, respectively.     

An Efficient Multicast Routing Protocol in Wireless Mobile Networks

Providing multicast service to mobile hosts in wireless mobile networking environments is difficult due to frequent changes of mobile host location and group membership. If a conventional multicast routing protocol is used in wireless mobile networks, several problems may be experienced since existing multicast routing protocols assume static hosts when they construct the multicast delivery tree. To overcome the problems, several multicast routing protocols for mobile hosts have been proposed. Although the protocols solve several problems inherent in multicast routing proposals for static hosts, they still have problems such as non-optimal delivery path, datagram duplication, overheads resulting from frequent reconstruction of a multicast tree, etc. In this paper, we summarize these problems of multicast routing protocols and propose an efficient multicast routing protocol based on IEFT mobile IP in wireless mobile networks. The proposed protocol introduces a multicast agent, where a mobile host receives a tunneled multicast datagram from a multicast agent located in a network close to it or directly from the multicast router in the current network. While receiving a tunneled multicast datagram from a remote multicast agent, the local multicast agent may start multicast join process, which makes the multicast delivery route optimal. The proposed protocol reduces data delivery path length and decreases the amount of duplicate copies of multicast datagrams. We examined and compared the performance of the proposed protocol and existing protocols by simulation under various environments and we got an improved performance over the existing proposals.     

EERP:一种能源有效的无线传感器网络路由协议

针对同构无线传感器网络的能源瓶颈问题提出一种能源有效的自适应路由协议,该协议在分布式动态分簇的基础上提出一种班车算法对数据进行逐层汇聚,以减少网络中流动数据包的数量,同时分担簇头节点的计算量。Tossim仿真试验表明该协议能够显著地减少节点的能量开销,提高网络的适应性,有效地延长网络的生命周期。     

Greedy Anti-Void Routing Protocol for Wireless Sensor Networks

The unreachability problem (i.e. the so-called void problem) which exists in the greedy routing algorithms has been studied for the wireless sensor networks. However, most of the current research work can not fully resolve the problem (i.e. to ensure the delivery of packets) within their formulation. In this letter, the greedy anti-void routing (GAR) protocol is proposed, which solves the void problem by exploiting the boundary finding technique for the unit disk graph (UDG). The proposed rolling-ball UDG boundary traversal (RUT) is employed to completely guarantee the delivery of packets from the source to the destination node. The proofs of correctness for the proposed GAR protocol are also given at the end of this letter.     

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

微机电系统、处理器、无线通信及存储技术的进步促进了无线传感器网络的飞速发展,使得无线传感器网络成为一种全新的信息获取和处理技术。在对其网络特点进行分析的基础上,介绍了无线传感器网络体系结构。路由技术是无线传感器网络通信层的核心技术,也是其组网的基础,着重讨论了无线传感器网络的路由协议的特点及其相关问题。     

Stable-Aware Evolutionary Routing Protocol for Wireless Sensor Networks

In real life scenario for wireless sensor networks (WSNs), energy heterogeneity among the sensor nodes due to uneven terrain, connectivity failure, and packet dropping is a crucial factor that triggered the race for developing robust and reliable routing protocols. Prolonging the time interval before the death of the first sensor node, viz. the stability period, is critical for many applications where the feedback from the WSN must be reliable. Although Low Energy Adaptive Clustering Hierarchy (LEACH) and LEACH-like protocols are fundamental and popular clustering protocols to manage the system’s energy and thus to prolong the lifespan of the network, they assume a near to a perfect energy homogeneous system where a node failure, drainage and re-energizing are typically not considered. More recent protocols like Stable Election Protocol (SEP) considers the reverse, i.e., energy heterogeneity, and properly utilizes the extra energy to guarantee a stable and reliable performance of the network system. While paradigms of computational intelligence such as evolutionary algorithms (EAs) have attracted significant attention in recent years to address various WSN’s challenges such as nodes deployment and localization, data fusion and aggregation, security and routing, they did not (to the best of our knowledge) explore the possibility of maintaining heterogeneous-aware energy consumption to guarantee a reliable and robust routing protocol design. By this, a new protocol named stable-aware evolutionary routing protocol (SAERP), is proposed in this paper to ensure maximum stability and minimum instability periods for both homogeneous/heterogeneous WSNs. SAERP introduces an evolutionary modeling, where the cluster head election probability becomes more efficient, to well maintain balanced energy consumption in both energy homogeneous and heterogeneous settings. The performance of SAERP over simulation for 90 WSNs is evaluated and compared to well known LEACH and SEP protocols. We found that SAERP is more robust and always ensures longer stability period and shorter instability period.     

Clustering with Load Balancing-Based Routing Protocol for Wireless Sensor Networks

In this paper we propose a routing protocol based on clustering (IGP-C Protocol) to extend the lifetime in the context of wireless sensor networks while optimizing other resources (memory and processor). Firstly, a clustering algorithm and a load balancing technique are used together in order to reap the benefits of both approaches. The proposed clustering algorithm with load balancing (CALB Algorithm) is a fully distributed algorithm performed by each sensor and requires only communication with its immediate neighbors. Secondly, an Improved Gossiping Protocol (IGP) is proposed to extend the CALB algorithm to the data routing. The simulation results demonstrate the better and promising performances of the IGP-C protocol compared with the other protocols proposed in the literature. The IGP-C protocol allows a better distribution of energy, memory and processing capabilities of cluster-heads and reduces the number of clusters consisting of a single sensor along with the number of iterations. This demonstrates the effectiveness of the cluster-heads election process which improves the load balancing in the wireless sensors network in terms of cluster-heads load and clusters size. Furthermore, the proposed routing strategy builds around the clustering algorithm, is effective since it reduces the data transmission delay and prolongs the network lifetime.     

移动传感网中一种基于RSSI的机会主义路由设计

 本文针对移动无线传感网提出一种结合节点移动向量和接收信号强度指示值RSSI(Received Signal Strength Indicator)信息的机会主义路由OR-RSSI,利用Sink节点Beacon报文的RSSI信息建立并更新机会概率值,使用报文广播后所能到达的具有最大机会概率值的最佳节点进行存储转发,完成移动无线传感网信息收集.OR-RSSI是一种良好的后择路由,不以既存路径为基础,不需额外设备支持,具有报文成功传输率高、网络有效吞吐量大以及能耗低等优点.     

An Adaptive Energy-aware Multi-path Routing Protocol with Load Balance for Wireless Sensor Networks

Using the available but limited resources of sensors more efficiently has been the recent interest in designing the routing protocols for Wireless Sensor Network (WSN). The major concern includes energy, storage and computing resources. Accordingly, we propose an adaptive energy-aware Multi-path routing protocol with load balance (AEMRP-LB). It introduces a concept named direction-angle to overcome the deficiency of broadcast and takes into account the tradeoff between the residual energy and hop count to establish multiple node-disjoint paths. The traffic load is balanced over the selected paths by using a weighted traffic scheduling algorithm considering their transmitting capacity, and then AEMRP-LB uses the advantages of Multi-path Source Routing to report the acquired data as saving the computing and storage resources of the sensors. In the scene with multiple Source-Sink pairs, AEMRP-LB can adaptively adjust the available residual energy of shared nodes so as to make reasonable use of them. The simulation results show that AEMRP-LB outperforms the two comparative schemes, and the sensors consume the energy in a more equitable way which ensures a more graceful degradation of service with time.     

MintRouteEE:一种无线传感器网络能量有效的路由协议

路由是无线传感器网络的关键问题之一。通过分析TinyOS系统中MintRoute路由协议的主要结构和路由策略。提出一种能量有效的路由协议MintRouteEE。模拟结果表明，MintRouteEE能够较大地降低网络的能耗，从而达到延长网络生存时间的目的。     

Routing Protocol for Heterogeneous Hierarchical Wireless Multimedia Sensor Networks

Recently, wireless multimedia sensor networks (WMSNs) have emerged as one of the most important technologies, driven by the development of powerful multimedia device such as CMOS. WMSNs require several factors such as resource constraints, specific QoS, high bandwidth and so on. In this paper, we propose a hierarchical heterogeneous network model based routing protocol for WMSNs. In our proposal, proposed network model is classified into monitoring class, delivery class and aggregation class. Also we define two kinds of the routing path in order to ensure bandwidth and QoS. In simulation results, we illustrate the performance of our proposal.     

基于生成树的无线传感器网络分布式路由协议

在无线传感器网络中,节点具有有限的电池能量,为了延长网络的生存时间,提出了一种基于生成树的分布式路由协议STRP及其具有能量意识的改进版本STRP-PA.每个传感器节点根据相邻节点与基站的距离、剩余能量等信息寻找父节点,构造一棵以基站为根的近优最小生成树,节点采集的数据沿树传输,并在树杈节点进行聚合.仿真实验结果表明:STRP-PA协议能够节省网络能量,显著延长网络稳定工作的时间,性能明显好于LEACH协议.     

Energy Efficient Fuzzy Routing Protocol for Wireless Sensor Networks

Wireless Personal Communications - Energy efficiency to route data in wireless sensor networks is key concern to enhance network lifetime. In this paper, an energy efficient routing protocol has...     

一种基于路由信息能量有效的无线传感器网MAC协议

传感器节点沿树状多跳路径逐级向Sink转发数据是无线传感器网络的主要业务模式之一。针对此类业务,该文的EBRI-MAC(Energy-efficient MAC protocol Based on Routing Information)协议提出一种对应树状路由转发关系,由父节点与子节点构成虚拟群的思想;并设计了连锁邀请与CSMA/CA结合的信道接入机制以及基于虚拟群同步的周期休眠机制,以达到节能的目的。结合节点能耗因素,定义了能量有效性的性能参数,并对EBRI-MAC的能量有效性进行理论分析。通过ns-2仿真结果表明网络业务时间相关性较强时,EBRI-MAC的能量有效性优于IEEE802.11DCF和S-MAC。     

一种无线传感器网络简单按需路由协议

对被监测对象进行实时监测,在有敏感事件突然发生时,由监测传感器及时向监测者报告被监测对象的相关信息是一类非常重要的无线传感器网络应用.针对这类应用,文章提出了一种无线传感器网络简单按需路由协议:SOD.协议通过动态汇聚节点生成协议使得节点能量消耗尽可能均衡化;利用扩散算法减少路由建立和恢复过程中消息的发送.考虑到此类应用的数据突发性和实时性特点,协议采取紧凑设计的原则,将路由请求消息与最初的突发数据相绑定,在路由建立的同时很好地保证了监测的实时性.仿真和实验表明该协议具有简单性、能量有效性和实时性等特点.