Energy adaptive block design based neighbor discovery for asynchronous wireless sensor networks

Sagar Mekala

doi:10.17485/ijst/v13i26.782

Abstract

Background: The need for an efficient neighbor discovery model is tremendously essential with the development of Wireless Sensor Networks (WSNs).The neighbor discovery model has growingly been significant in enhancing the performance of WSNs. Methods: In this study, adaptive energy duty-cycle, energy-efficient Balanced Incomplete Block Design (BIBD) hybrid scheme is proposed for WSNs that controls collisions, and overhearing obstacle by maintaining energy over WSNs. Energy adaptive BIBD leverages the features of symmetric BIBD. Evaluation of the proposed model is demonstrated using the TOSSIM tool, and the performance parameters are compared with other wellknown neighbor discovery process, including Disco, U-Connect, and Searchlight, Hedis, and Todis algorithms. Findings: The outputs of our simulation study illustrates that the proposed model significantly outperforms other neighbor discovery algorithms with reference to energy-efficiency and discovery latency.Keywords: Wireless sensor networks; energy efficiency; neighbor discovery; block design; collisions

Highlights

In the last decade, the use of Wireless Sensor Networks (WSNs) are increased in many fields such as long-term environmental monitoring, tracking objects, military applications, and so on[1]
We propose an energy adaptiveBIBD based neighbor algorithm that adopts both symmetric and asymmetric strategies
If residual energy of a sensor mi less than the dynamic threshold value Eth, Balanced Incomplete Block Design (BIBD) based neighbor discovery duty cycle can be constructed to enlarging the lifespan of the network

Summary

INTRODUCTION

The use of Wireless Sensor Networks (WSNs) are increased in many fields such as long-term environmental monitoring, tracking objects, military applications, and so on[1]. The fundamental goal of the implemented protocol is to minimize the overall energy consumption by using BIBD symmetric neighbor discovery schedule. This study is the first of its kind to design neighbor discovery by considering the remaining energy of node to construct BIBD based neighbor discovery schedule where they must guarantee the existence of overlapping active slots between any two sensor nodes. In this work, it is implemented some representative models of the neighbor discovery process in TOSSIM simulation[10]. It uses a single prime number to construct a neighbor discovery schedule. It adds periodic active slots based on the prime number. Worst-case latency is still high

BIBD and neighbor discovery problem

Neighbor discovery schedule based on residual energy

Performance analysis and evaluation

Findings

Conclusion