Abstract

Problem statement: Increased use of handheld devices and sensor devices pose problems in existing routing protocols. The performance of the existing routing protocols deteriorates very much on these dense scenarios. Control overheads are very important parameter in deciding the performance of routing protocols, which are introduced during route discovery and maintenance process. Denser the network, higher is the control overhead in establishing and maintaining the communication path between end systems. This study aims at implementing an improved fault tolerant routing algorithm that minimizes the routing overhead for ad hoc networks using Zigbee. Approach: We propose a routing protocol which minimizes the routing overhead by exploiting the network density. The number of nodes involved in handling the control packets is minimized in the proposed protocol by selecting few of the neighbors of each node based on the received signal strength. The link breaks are maintained locally, thus by reducing the number of control overheads in the network. Results: The performance of the proposed protocol is tested using OMNet++ simulator. The implementation using Zigbee nodes indicate that the control overhead is reduced up to 80% in dense environments and 60% in heterogeneous and sparse thereby saving energy in the sensor nodes. Conclusion: The proposed protocol increases the energy conservation and hence the nodes life time and networks’ lifetime.

Highlights

  • INTRODUCTIONCreate a RREQ packet Add (dest addr, broadcast ID,) to route table is very weak (threshold -90) Upon the reception of link error signal, the Locally broadcast RREQ setting up wait time for predecessor node broadcast link repair packets to its Route Reply (RREP) } //Receiving RREQ: When a node receives a RREQ packet, it checks whether it is the intended destination

  • We propose an enhancement to Ad Hoc On Demand Distance Vector (AODV) protocol to minimize the control packets in the network and reduce the energy consumption and minimize the delay

  • The simulated conditions with OMNet++ for 802.11 protocols has been modified for Zigbee with AODV and various conditions has been tested to verify the working of the proposed protocol

Read more

Summary

INTRODUCTION

Create a RREQ packet Add (dest addr, broadcast ID,) to route table is very weak (threshold -90) Upon the reception of link error signal, the Locally broadcast RREQ setting up wait time for predecessor node broadcast link repair packets to its RREP } //Receiving RREQ: When a node receives a RREQ packet, it checks whether it is the intended destination. { Create a RREP packet; Unicast the RREP to the source of RREQ//using one hop neighbors with the address of the successor node of the node that is likely to cause link break, distinguishing between local connectivity management and general topology maintenance The neighboring mobile nodes that have the information about successor node replies and one of these reporting nodes is considered as a new intermediate node If the neighboring nodes have no link with the successor node, the Path Discovery process is initiated precursor list } else if (candidate node for rebroadcasting). { Choose the few border nodes; //determined by reachability parameter Modify RREQ packet; //add new border nodes for rebroadcasting

NextHop HopCount
Findings
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.