Decentralized boundary detection without location information in wireless sensor networks

In wireless sensor networks (WSNs) deployed in an outdoor environment, obstacles may occur as a result of a non-uniform distribution of the sensor nodes or the presence of barriers. These obstacles result in a degradation of the network performance, so obstacle identification is a major concern in m...

Full description

Saved in:
Bibliographic Details
Published in2012 IEEE Wireless Communications and Networking Conference (WCNC) pp. 1720 - 1724
Main Authors Wei-Cheng Chu, Kuo-Feng Ssu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2012
Subjects
Conferences
Mobile computing
Robot sensing systems
Routing
Vegetation
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary:In wireless sensor networks (WSNs) deployed in an outdoor environment, obstacles may occur as a result of a non-uniform distribution of the sensor nodes or the presence of barriers. These obstacles result in a degradation of the network performance, so obstacle identification is a major concern in most WSN applications. This paper develops a Decentralized Boundary Detection (DBD) algorithm for identifying sensor nodes near a hole or obstacle in the WSN. The algorithm does not require any knowledge of the node locations or distances between two nodes. The detection capability is provided even in networks where the sensor nodes have a non-unit disk communication range.
ISBN:9781467304368
1467304360
ISSN:1525-3511
1558-2612
DOI:10.1109/WCNC.2012.6214061