An efficient void resolution method for geographic routing in wireless sensor networks

Geographic routing is an attractive choice for routing data in wireless sensor networks because of lightweight and scalable characteristics. Most geographic routing approaches combine a greedy forwarding scheme and a void resolution method to detour a void area that has no active sensor. The previous solutions, including the well-known GPSR protocol, commonly use the right-hand rule for void resolution. However, the detour path produced by the right-hand rule is not energy-efficient in many cases. In this paper, we propose a new void resolution method, called void resolution-forwarding, which can overcome voids in the sensor network energy-efficiently. It exploits the quadrant-level right-hand rule to select the next hop for the current node during circumventing a void area. We show by experiments that the proposed method is efficient and scalable with respect to the various voids and network density and that it outperforms the GPSR protocol significantly.     

无线传感器网络中分段贪婪地理路由算法

针对基于地理位置的无线传感器网络路由中存在的路由空洞问题,提出一种新的路由模式:分段贪婪路由.在该模式中,整个路由过程被中间节点序列划分为若干段,在每一段上仅应用贪婪转发策略.为确定合适的中间节点,给出一种基于递归探测的方法,并以GPSR算法为基础探测路由构造了SGR算法.仿真实验表明,在存在不同类型、大小、数量路由空洞的网络环境中,SGR算法均能以较小的探测开销获得接近最优的路由路径,尤其是凹空洞存在的情况.     

面向无线传感器网络能量均衡的地理位置路由方法

针对地理位置的无线传感器网络路由算法往往只注重地理信息的不足,提出了一种融合节点能量的多径路由算法。算法采用地理位置和能量信息建立三维坐标系,根据邻居节点有效向前距离和剩余能量大小来计算下一跳的概率值,进行路由选择。使能量消耗分散在有效向前推进距离较远的邻居节点之中,延长了网络生存时间,减小并推迟了路由"空洞"的出现。仿真结果显示,区域内节点死亡数、节点存活数和路由"空洞"数等相对TPGF算法均有较大改善,验证了算法的有效性。     

一种新的支持移动Sink的多媒体传感器网络路由协议

提出了一种新的支持移动Sink的多媒体传感器网络路由协议,该协议利用锚节点作为转发节点与移动Sink进行通信,避免多媒体传感器节点与Sink直接进行远距离通信,在多媒体传感器节点中采用改进的基于地理信息的路由协议建立路由路径.仿真实验表明:该协议不仅能支持移动Sink,而且能够有效降低节点能耗,延长网络寿命,提高数据传...     

三维无线传感器网络贪婪地理路由协议

针对已有的三维无线传感器网络路由协议均将三维问题转换到二维平面上解决,没有充分利用三维空间的特点,提出了一种基于地理信息的三维无线传感器网络贪婪地理路由(GGR)协议。该协议在通常状况下采用贪婪转发算法,针对基于地理信息的贪婪算法中易出现的路由空洞问题,给出一种三维滚动球边界遍历算法。实验结果表明:该协议具有较高的路由成功率,路由跳数也得到优化,尤其是在节点密度较低的情况下体现出较强的优势。     

A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks

Wireless sensor networks (WSNs) with nodes spreading in a target area have abilities of sensing, computing, and communication. Since the GPS device is expensive, we used a small number of fixed anchor nodes that are aware of their locations to help estimate the locations of sensor nodes in WSNs. To efficiently route sensed data to the destination (the server), identifying the location of each sensor node can be of great help. We adopted a range-free color-theory based dynamic localization (CDL) [Shen-Hai Shee, Kuochen Wang, I.L. Hsieh, Color-theory-based dynamic localization in mobile wireless sensor networks, in: Proceedings of Workshop on Wireless, Ad Hoc, Sensor Networks, August 2005] approach, to help identify the location of each sensor node. Since sensor nodes are battery-powered, we propose an efficient color-theory-based energy efficient routing (CEER) algorithm to prolong the life time of each sensor node. The uniqueness of our approach is that by comparing the associated RGB values among neighboring nodes, we can efficiently choose a better routing path with energy awareness. Besides, the CEER has no topology hole problem. Simulation results have shown that our CEER algorithm can save up to 50–60% energy than ESDSR [Mohammed Tarique, Kemal E. Tepe, Mohammad Naserian, Energy saving dynamic source routing for ad hoc wireless networks, in: Proceedings of Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, April 2005, pp. 305–310] in mobile wireless sensor networks. In addition, the latency per packet of CEER is 50% less than that of ESDSR.     

一种新的传感器网络能量有效路由算法

基于对LEACH、PEGASIS经典分簇算法的研究,提出一种基于分簇的传感器网络能量有效的路由算法NCEER。NCEER每隔20轮进行一次簇重构,簇内利用贪心算法形成短链,选取剩余能量最大者为簇首。然后,以基站为树根,各簇首节点根据跳数和能量级别建立层次路由树。最后,各簇首通过最优路径将采集到的数据发送到基站。该算法减少了簇重构的开销,建立了一条负载均衡的簇内路由、能量有效的簇间路由,减少了数据的传输时延。仿真结果表明,该算法的性能优于LEACH和PEGASIS。     

New routing framework base on rumor routing in wireless sensor networks

Rumor routing is a classic routing algorithm based on agents’ random walk. This paper proposes a novel approach based on this routing algorithm. Here, we try to improve the latency and energy consumption of the traditional algorithm using propagation of query and event agents within straight lines, instead of using purely random walk paths. As can be seen in our results, this method improves the delivery ratio of the queries which is a drawback of traditional rumor routing. Due to the reduction of final path length between source and destination, we introduce a second layer geographical routing. Moreover, a method is proposed to reduce the cost of localization equipments by using cheaper equipments like AoA antennas. In order to compare the performance measures with traditional algorithm, a simulation framework is developed and extensive simulations are performed.     

Energy efficient multicast routing in ad hoc wireless networks

In this paper, we discuss the energy efficient multicast problem in ad hoc wireless networks. Each node in the network is assumed to have a fixed level of transmission power. The problem of our concern is: given an ad hoc wireless network and a multicast request, how to find a multicast tree such that the total energy cost of the multicast tree is minimized. We first prove this problem is NP-hard and it is unlikely to have an approximation algorithm with a constant performance ratio of the number of nodes in the network. We then propose an algorithm based on the directed Steiner tree method that has a theoretically guaranteed approximation performance ratio. We also propose two efficient heuristics, node-join-tree (NJT) and tree-join-tree (TJT) algorithms. The NJT algorithm can be easily implemented in a distributed fashion. Extensive simulations have been conducted to compare with other methods and the results have shown significant improvement on energy efficiency of the proposed algorithms.     

无线自组网中一种高效的路由协议

无线自组网与传统的有线网不同,它由一些可移动的结点组成,这些结点的带宽、计算能力和能量都受到一定限制。针对这种网络,研究者们提出了按需路由协议,这些协议非常适合无线自组网这种拓扑结构,但是由于缺乏对全局拓扑和结点移动性的了解,可能达不到最优。因此提出了一种高效的路由协议ERNC,该协议基于已提出的SHORT路由协议[13],并对以前所提出的NAOR协议[14]进行了扩展,即利用网络编码技术来进一步提高路由协议的性能。最后,使用NS-2模拟器来评估ERNC的性能,结果显示ERNC在分组投递率和平均端到端时延等方面获得了比已有协议更好的性能。     

能量有效的无线传感器网络层次型路由协议

为改善LEACH中节点能耗不均而过早失效的情况,提出了一种能量有效的无线传感器网络层次型路由协议EEHRP,它采用一种智能延迟策略选取簇头,尽可能使得剩余能量越高的节点时延越小,它们能够先于周围剩余能量较低的节点发送簇头通告。在路由算法中引入了网关节点,能有效避免簇头远距离传送数据造成的能耗过多。仿真表明,EEHRP可使节点的能量消耗更均匀,有效地延长了网络生存时间。     

Energy efficient and QoS based routing protocol for wireless sensor networks

The increasing demand for real-time applications in Wireless Sensor Networks (WSNs) has made the Quality of Service (QoS) based communication protocols an interesting and hot research topic. Satisfying Quality of Service (QoS) requirements (e.g. bandwidth and delay constraints) for the different QoS based applications of WSNs raises significant challenges. More precisely, the networking protocols need to cope up with energy constraints, while providing precise QoS guarantee. Therefore, enabling QoS applications in sensor networks requires energy and QoS awareness in different layers of the protocol stack. In many of these applications (such as multimedia applications, or real-time and mission critical applications), the network traffic is mixed of delay sensitive and delay tolerant traffic. Hence, QoS routing becomes an important issue. In this paper, we propose an Energy Efficient and QoS aware multipath routing protocol (abbreviated shortly as EQSR) that maximizes the network lifetime through balancing energy consumption across multiple nodes, uses the concept of service differentiation to allow delay sensitive traffic to reach the sink node within an acceptable delay, reduces the end to end delay through spreading out the traffic across multiple paths, and increases the throughput through introducing data redundancy. EQSR uses the residual energy, node available buffer size, and Signal-to-Noise Ratio (SNR) to predict the best next hop through the paths construction phase. Based on the concept of service differentiation, EQSR protocol employs a queuing model to handle both real-time and non-real-time traffic.     

An efficient hop count routing protocol for wireless ad hoc networks

An efcient hop count route fnding approach for mobile ad hoc network is presented in this paper.It is an adaptive routing protocol that has a tradeof between transmission power and hop count for wireless ad hoc networks.During the route fnding process,the node can dynamically assign transmission power to nodes along the route.The node who has received route request message compares its power with the threshold power value,and then selects a reasonable route according to discriminating algorithms.This algorithm is an efective solution scheme to wireless ad hoc networks through reasonably selected path to reduce network consumption.Simulation results indicate that the proposed protocol can deliver better performances with respect to energy consumption and end-to-end delay.     

IRPL: An energy efficient routing protocol for wireless sensor networks

This study aims to overcome the disadvantages of the original RPL (IPv6 Routing Protocol for Low power and Lossy networks) routing protocol (RPL including problems with energy consumption and energy load balance). We developed a relatively balanced RPL – the improved protocol (IRPL). This protocol is based on an efficient clustering algorithm and an effective topology control model of the loop domain communication route. The clustering algorithm can be used to calculate the optimal number of cluster heads by assumption of the network model. Combined with the clustering probability model and the node competition mechanism, the cluster head node in the wireless sensor network was used to complete the clustering process. In the topology control model, the wireless sensor network was divided into concentric rings with equal areas. Nodes determined the best network route, depending on different levels of ring domain and the optimal forwarding communication area defined in this study. Simulation results indicate that the IRPL routing protocol can reduce overall network energy consumption, balance network energy consumption, and prolong network lifetime.     

Low-priced and efficient replica detection framework for wireless sensor networks

A replica attack is one of the most challenging problems in wireless sensor networks. Once a node is physically captured, it can be reprogrammed and replicated into a large number of replicas, and thus maliciously occupying the network. Although until now various schemes have been proposed to detect replicas, most of them suffer from high energy costs and additional device such as a global positioning system. In this paper, we introduce the efficient replica detection framework without the need of additional device. The framework consists of key establishment and replica detection protocols. The proposed replica detection protocol is executed on the proposed key establishment protocol. Furthermore, through simulation experiments, we show that the proposed replica detection protocol provides high replica detection ratio, faster replica detection, and higher energy saving than existing protocols.     

Distributed load balancing mechanism for detouring schemes of geographic routing in wireless sensor networks

Well-known ‘routing hole’ problem of geographic routing is hardly avoided in wireless sensor networks because of various actual geographical environments. Existing geographic routing protocols use perimeter routing strategies to find a detour path around the boundary of holes when they encounter the local minimum during greedy forwarding. However, this solution may lead to uneven energy consumption around the holes since it consumes more energy of the boundary sensors. It becomes more serious when holes appear in most of routing paths in a large-scale sensor network. In this paper, we propose a novel distributed strategy to balance the traffic load on the boundary of holes by virtually changing the sizes of these holes. The proposed mechanism dynamically controls holes to expand and shrink circularly without changing the underlying forwarding strategy. Therefore, it can be applied to most of the existing geographic routing protocols which detour around holes. Simulation results show that our strategy can effectively balance the load around holes, thus prolonging the network life of sensor networks when an existing geographic routing protocol is used as the underlying routing protocol.     

A new QoS aware and energy efficient opportunistic routing protocol for wireless sensor networks

Energy efficiency and Quality of Service (QoS) providing are known to be critical design concerns in routing protocols for Wireless Sensor Networks (WSNs). Recent studies, demonstrate that Opportunistic Routing (OR) can greatly improve the performance of WSNs by exploiting the broadcast nature of the wireless medium. In this paper, we propose a new QoS aware and Energy efficient Opportunistic Routing protocol (QEOR) to efficiently routing data under QoS and energy constraints for WSNs. QEOR uses a new multi-metric QoS based candidate selection method in order to accurately select and prioritise the candidate forwarders. The selection is focused on a QoS function that takes into consideration the reliabilty of buffers and links, while the prioritisation is established according to transmission delays. To achieve an obvious improvement on the energy consumption, QEOR uses an energy efficient coordination method and an implicit ACKnowledgement scheme for collision and redundancy avoidance. Simulation results show that QEOR provides best performances as compared to other OR protocols.