448 research outputs found

    Energy-aware Dual-path Geographic Routing to Bypass Routing Holes in Wireless Sensor Networks

    Get PDF
    This is the author accepted manuscript. The final version is available from IEEE via the DOI in this record.Geographic routing has been considered as an attractive approach for resource-constrained wireless sensor networks (WSNs) since it exploits local location information instead of global topology information to route data. However, this routing approach often suffers from the routing hole (i.e., an area free of nodes in the direction closer to destination) in various environments such as buildings and obstacles during data delivery, resulting in route failure. Currently, existing geographic routing protocols tend to walk along only one side of the routing holes to recover the route, thus achieving suboptimal network performance such as longer delivery delay and lower delivery ratio. Furthermore, these protocols cannot guarantee that all packets are delivered in an energy-efficient manner once encountering routing holes. In this paper, we focus on addressing these issues and propose an energy-aware dual-path geographic routing (EDGR) protocol for better route recovery from routing holes. EDGR adaptively utilizes the location information, residual energy, and the characteristics of energy consumption to make routing decisions, and dynamically exploits two node-disjoint anchor lists, passing through two sides of the routing holes, to shift routing path for load balance. Moreover, we extend EDGR into three-dimensional (3D) sensor networks to provide energy-aware routing for routing hole detour. Simulation results demonstrate that EDGR exhibits higher energy efficiency, and has moderate performance improvements on network lifetime, packet delivery ratio, and delivery delay, compared to other geographic routing protocols in WSNs over a variety of communication scenarios passing through routing holes. The proposed EDGR is much applicable to resource-constrained WSNs with routing holes.This work has been partially supported by the National Natural Science Foundation of China (No. 61402343, No. 61672318, No. U1504614, No. 61631013, and No. 61303241), the National Key Research and Development Program (No. 2016YFB1000102), the Natural Science Foundation of Suzhou/Jiangsu Province (No. BK20160385), the EU FP7 QUICK Project (No. PIRSESGA- 2013-612652), and the projects of Tsinghua National Laboratory for Information Science and Technology (TNList)

    Greedy Routing Recovery Using Controlled Mobility in Wireless Sensor Networks

    Get PDF
    International audienceOne of the most current routing families in wireless sensor networks is geographic routing. Using nodes location, they generally ap- ply a greedy routing that makes a sensor forward data to route to one of its neighbors in the forwarding direction of the destination. If this greedy step fails, the routing protocol triggers a recovery mechanism. Such re- covery mechanisms are mainly based on graph planarization and face traversal or on a tree construction. Nevertheless real-world network pla- narization is very difficult due to the dynamic nature of wireless links and trees are not so robust in such dynamic environments. Recovery steps generally provoke huge energy overhead with possibly long inefficient paths. In this paper, we propose to take advantage of the introduction of controlled mobility to reduce the triggering of a recovery process. We propose Greedy Routing Recovery (GRR) routing protocol. GRR en- hances greedy routing energy efficiency as it adapts network topology to the network activity. Furthermore GRR uses controlled mobility to relocate nodes in order to restore greedy and reduce energy consuming recovery step triggering. Simulations demonstrate that GRR successfully bypasses topology holes in more than 72% of network topologies avoid- ing calling to expensive recovery steps and reducing energy consumption while preserving network connectivity

    An Emergency-Adaptive Routing Scheme for Wireless Sensor Networks for Building Fire Hazard Monitoring

    Get PDF
    Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work

    An Emergency-Adaptive Routing Scheme for Wireless Sensor Networks for Building Fire Hazard Monitoring

    Get PDF
    Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work

    A Distributed Geo-Routing Algorithm for Wireless Sensor Networks

    Get PDF
    Geographic wireless sensor networks use position information for greedy routing. Greedy routing works well in dense networks, whereas in sparse networks it may fail and require a recovery algorithm. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costly for resource constrained position-based wireless sensor networks (WSNs). In this paper, we propose a void avoidance algorithm (VAA), a novel idea based on upgrading virtual distance. VAA allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forwarding packets using only greedy routing. In VAA, the stuck node upgrades distance unless it finds a next hop node that is closer to the destination than it is. VAA guarantees packet delivery if there is a topologically valid path. Further, it is completely distributed, immediately responds to node failure or topology changes and does not require planarization of the network. NS-2 is used to evaluate the performance and correctness of VAA and we compare its performance to other protocols. Simulations show our proposed algorithm consumes less energy, has an efficient path and substantially less control overheads

    GRACO: a geographic GReedy routing with an ACO-based void handling technique

    Get PDF
    Geographic routing has gained much attention as a basic routing primitive inwireless sensor networks due to its memory-less, scalability, efficiency and low overheadfeatures. Greedy forwarding is the simplest geographic routing scheme, it uses the distanceas a forwarding criterion. Nevertheless, it may suffer from communication holes, whereno next hop candidate is closer to the destination than the node currently holding thepacket. For this purpose, a void handling technique is needed to recover from the voidproblem and successfully deliver data packets if a path does exist between source anddestination nodes. Many approaches have been reported to solve this issue at the expenseof extra processing and or overhead. This paper proposes GRACO, an efficient geographicrouting protocol with a novel void recovery strategy based on ant colony optimization(ACO). GRACO is able to adaptively adjust the forwarding mechanism to avoid theblocking situation and effectively deliver data packets. Compared to GFG, one of the bestperforming geographic routing protocols, simulation results demonstrate that GRACOcan successfully find shorter routing paths with higher delivery rate, less control packetoverhead and shorter end-to-end delay

    Geographic GReedy routing with ACO recovery strategy GRACO

    Get PDF
    International audienceGeographic routing is an attractive routing strategy in wireless sensor networks. It works well in dense networks, but it may suffer from the void problem. For this purpose, a recovery step is required to guarantee packet delivery. Face routing has widely been used as a recovery strategy since proved to guarantee delivery. However, it relies on a planar graph not always achievable in realistic wireless networks and may generate long paths. In this paper, we propose GRACO, a new geographic routing algorithm that combines a greedy forwarding and a recovery strategy based on swarm intelligence. During recovery, ant packets search for alternative paths and drop pheromone trails to guide next packets within the network. GRACO avoids holes and produces near optimal paths. Simulation results demonstrate that GRACO leads to a significant improvement of routing performance and scalability when compared to the literature algorithms

    Using location services to autonomously drive flying mobile sinks in Wireless Sensor Networks

    Get PDF
    International audienceThe use of mobility in a Wireless Sensor Network has already been indicated as a feature whose exploitation would increase the performances and the ease of mantainance in these environments. Expecially in a event-based WSN, where is necessary a prompt response in terms of data processing and o oading, a set of mobile ying sinks could be a good option for the role of autonomous data collectors. For those reasons in this paper we propose a distributed algorithm to independently and autonomously drive a mobile sink through the nodes of a WSN and we show its preferability over more classical routing approaches expecially in the presence of a localized generation of large amount of information. Our result shows that, in the case of fairly complete coverage of the area where the nodes lie, it is possible to promptly notify a mobile sink about the presence of data to o oad, drive it to the interested area and achieve interesting performances
    • …
    corecore