Distributed Perimeter Detection in Wireless Sensor Networks

This paper introduces a distributed localized algorithm where sensor nodes determine if they are located along the perimeter of a wireless sensor network. The algorithm works correctly in sufficiently dense wireless sensor networks with a minimal requisite degree of connectivity. Using 1-hop and 2-hop neighbour information, nodes determine if they are surrounded by neighbouring nodes, and consequently, if they are located within the interior of the wireless sensor network. The algorithm requires minimal communication between nodes a desirable property since energy reserves are generally limited and non-renewable. keywords: wireless sensor network, distributed algorithms, perimeter detection

[1]  Ramesh Govindan,et al.  Localized edge detection in sensor fields , 2003, Ad Hoc Networks.

[2]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[3]  Urbashi Mitra,et al.  Boundary Estimation in Sensor Networks: Theory and Methods , 2003, IPSN.

[4]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[5]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[6]  Lixia Zhang,et al.  Recursive position estimation in sensor networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[7]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[8]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).