Energy-Efficient Neighbor Discovery Algorithm for Low Latency in Wireless Sensor Networks with Uncoordinated Power Saving Mechanisms

  Dhruv Kansara,  Raxit Jani,  Priyal Munshi,  Vaishvi Parikh

A wireless sensor network (WSN) is made up of a significant number of sensor joints that may be dispersed throughout an area to perform local calculations that are totally based on data collected from the environment. The foundation of the majority of recent studies on neighbour discovery is either the assumption that all nodes are well interconnected or that the network consists exclusively of relevant nodes. In real networks, the coupling is only loose; some nodes are within radio range of one another while others are not. Reduced latency and increased power efficacy are mutually beneficial goals, but in partly coupled networks, achieving both becomes very challenging. We discover that the collision caused by concurrent transmissions is the greatest barrier to achieving the two goals. In this paper, we address these issues by proposing Panacea, a powerful collection of collision-avoidance principles. As the major design goals of routing protocols for WSNs, latency and energy efficiency are primarily balanced in this article. No matter We demonstrate that the detection latency is constrained. Then, we provide Panacea-WCD, which further cuts the duration inside O(n•ln n) spaces, for nodes that are capable of detecting collisions. In summary, we conduct in-depth studies, and the findings validate our assessments.

Keywords- Low latency, Panacea, Neighbor discovery, Power saving mechanism.

Unique Identification Number - IJEDR2302014
Page Number(s) - 86-99
Pubished in - Volume 11 | Issue 2 | June 2023
DOI (Digital Object Identifier) -   
Publisher - IJEDR (ISSN - 2321-9939)

  Dhruv Kansara,  Raxit Jani,  Priyal Munshi,  Vaishvi Parikh,   "Energy-Efficient Neighbor Discovery Algorithm for Low Latency in Wireless Sensor Networks with Uncoordinated Power Saving Mechanisms", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.11, Issue 2, pp.86-99, June 2023, Available at :http://www.ijedr.org/papers/IJEDR2302014.pdf