Node Sensing & Dynamic Discovering Routes for Wireless Sensor Networks
Arabinda Nanda, Amiya Kumar Rath, Saroj Kumar Rout

TL;DR
This paper introduces a dynamic routing method for wireless sensor networks that tolerates node and area failures, using local information to discover new routes and manage routing loops effectively.
Contribution
It proposes a local-information-based dynamic routing protocol that handles failures and discovers routes without extra overhead during normal operation.
Findings
The method tolerates arbitrary node and area failures.
Routing is based solely on local neighbor information.
Routing loops are identified and minimized.
Abstract
The applications of Wireless Sensor Networks (WSN) contain a wide variety of scenarios. In most of them, the network is composed of a significant number of nodes deployed in an extensive area in which not all nodes are directly connected. Then, the data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the network. However, the correctness of a particular routing protocol mainly depends on the capabilities of the nodes and on the application requirements. This paper presents a dynamic discover routing method for communication between sensor nodes and a base station in WSN. This method tolerates failures of arbitrary individual nodes in the network (node failure) or a small part of the network (area failure). Each node in the network does only local routing preservation, needs to record only its neighbor nodes'…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEnergy Efficient Wireless Sensor Networks · Security in Wireless Sensor Networks
