Distributed low overhead ID in a wireless sensor network

Abstract

An overlay based ID assignment can facilitate a Wireless Sensor Network (WSN) with low tost and less time consuming look-up or event detection mechanism. In our paper, we present an efficient distributed sensor node look-up mechanism which assigns unique ID to the network nodes considering the physical proximity and ultimately this mechanism provides the low cost routes of messages with the help of these unique node IDs. Our method requires very few bounded number of physical hops for query resolution which contributes a low maintenance overhead. In this paper, we present theoretical analysis and experimental results to validate our claim.