6 research outputs found

    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

    An Efficient Bypassing Void Routing Algorithm for Wireless Sensor Network

    Get PDF
    Since the sensor node’s distribution in a wireless sensor network (WSN) is irregular, geographic routing protocols using the greedy algorithm can cause local minima problem. This problem may fail due to routing voids and lead to failure of data transmission. Based on the virtual coordinate mapping, this paper proposes an efficient bypassing void routing protocol to solve the control packet overhead and transmission delay in routing void of WSN, which is called EBVRPVCM. The basic idea is to transfer the random structure of void edge to a regular one through mapping the coordinates on a virtual circle. In EBVRPVCM, some strategies, executed in different regions, are selected through virtual coordinates to bypass routing void efficiently. The regular edge is established by coordinate mapping that can shorten the average routing path length and decrease the transmission delay. The virtual coordinate mapping is not affected by the real geographic node position, and the control packet overhead can be reduced accordingly. Compared with RGP and GPSR, simulation results demonstrate that EBVRPVCM can successfully find the shortest routing path with higher delivery ratio and less control packet overhead and energy consumption

    Network lifetime maximising distributed forwarding strategies in Ad Hoc wireless sensor networks

    Full text link
    International audienceThe authors propose three variants of distributed and stateless forwarding strategies for wireless sensor networks, namely greedy minimum energy consumption forwarding protocol (GMFP), lifetime maximising GMFP (LM-GMFP) and variance minimising GMFP (VAR-GMFP), which aim at maximising the network lifetime while achieving a high forwarding success rate. GMFP selects a forwarding node that minimises per-packet energy consumption while maximising the forwarding progress. LM-GMFP extends the GMFP algorithm by also taking into account the remaining energy at the prospective one-hop forwarding nodes. In VAR-GMFP, on the other hand, the packet is forwarded to the next node that ensures a locally high mean and low variance of nodal remaining energy. Through simple probabilistic analysis the authors prove the intuition behind the optimum forwarding node selection for network lifetime maximisation. They then model the lifetime maximisation of a sensor network as an optimisation problem and compare the practical protocol-dependent network lifetime with the theoretical upper bound. Through extensive simulations the author demonstrate that the proposed protocols outperform the existing energy-aware protocols in terms of network lifetime and end-to-end delay

    On hole approximation algorithms in wireless sensor networks

    Get PDF
    Routing holes in sensor network are regions without operating nodes. They may occur due to several reasons, including cases caused by natural obstacles or disaster suffering areas. Determining the location and shape of holes can help monitor these disaster events (such as volcano, tsunami, etc.) or make smart, early routing decisions for circumventing a hole. However, given the energy limit of sensor nets, the determination and dissemination of the information about the exact shape of a large hole could be unreasonable. Therefore, there are some techniques to approximate a hole by a simpler shape. In this paper, the authors analyze and compare two existing approximation approaches that are considered as the most suitable for the sensor network, namely the grid-based and the convex-hull-based approaches. And a new algorithm of the grid-based approach is also introduced. The performances of all the mentioned algorithms are under analysis and evaluation in both theoretical and experimental perspectives. The findings show that grid-based approach has advantages in saving network energy and providing a finer image of the hole while the convex hull approach is better for making a shorter hole-bypassing the route but not much

    DESIGN OF MOBILE DATA COLLECTOR BASED CLUSTERING ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS

    Get PDF
    Wireless Sensor Networks (WSNs) consisting of hundreds or even thousands of nodes, canbe used for a multitude of applications such as warfare intelligence or to monitor the environment. A typical WSN node has a limited and usually an irreplaceable power source and the efficient use of the available power is of utmost importance to ensure maximum lifetime of eachWSNapplication. Each of the nodes needs to transmit and communicate sensed data to an aggregation point for use by higher layer systems. Data and message transmission among nodes collectively consume the largest amount of energy available in WSNs. The network routing protocols ensure that every message reaches thedestination and has a direct impact on the amount of transmissions to deliver messages successfully. To this end, the transmission protocol within the WSNs should be scalable, adaptable and optimized to consume the least possible amount of energy to suite different network architectures and application domains. The inclusion of mobile nodes in the WSNs deployment proves to be detrimental to protocol performance in terms of nodes energy efficiency and reliable message delivery. This thesis which proposes a novel Mobile Data Collector based clustering routing protocol for WSNs is designed that combines cluster based hierarchical architecture and utilizes three-tier multi-hop routing strategy between cluster heads to base station by the help of Mobile Data Collector (MDC) for inter-cluster communication. In addition, a Mobile Data Collector based routing protocol is compared with Low Energy Adaptive Clustering Hierarchy and A Novel Application Specific Network Protocol for Wireless Sensor Networks routing protocol. The protocol is designed with the following in mind: minimize the energy consumption of sensor nodes, resolve communication holes issues, maintain data reliability, finally reach tradeoff between energy efficiency and latency in terms of End-to-End, and channel access delays. Simulation results have shown that the Mobile Data Collector based clustering routing protocol for WSNs could be easily implemented in environmental applications where energy efficiency of sensor nodes, network lifetime and data reliability are major concerns
    corecore