Abstract:
One of the exigent problems in wireless sensor networks is the recognition of network boundary and the detection of holes within the network. In this paper, we propose an...Show MoreMetadata
Abstract:
One of the exigent problems in wireless sensor networks is the recognition of network boundary and the detection of holes within the network. In this paper, we propose an algorithm in which every node in the network self-detects whether it is a boundary node or an inner node by utilizing the available connectivity information and making no assumptions about the location awareness. The algorithm is efficient than existing schemes in terms of accuracy and energy consumption. It does not need high degree of connectivity as compare to other existing schemes. The simulation results prove the efficiency and accuracy of our algorithm.
Published in: 2009 IEEE 34th Conference on Local Computer Networks
Date of Conference: 20-23 October 2009
Date Added to IEEE Xplore: 18 December 2009
ISBN Information: