Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICC.2008.513
Title: Location-aided topology discovery for wireless sensor networks
Authors: Zhang, M. 
Mun, C.C. 
Ananda, A.L. 
Issue Date: 2008
Source: Zhang, M., Mun, C.C., Ananda, A.L. (2008). Location-aided topology discovery for wireless sensor networks. IEEE International Conference on Communications : 2717-2722. ScholarBank@NUS Repository. https://doi.org/10.1109/ICC.2008.513
Abstract: Topology discovery in sensor network is useful in any practical deployment of the network. Topology information helps the administrators monitor, debug and perform proactive control and management. Obtaining topology for dense wireless sensor network is expensive due to limited bandwidth and contention for the wireless channel. In this paper, we consider the problem of efficiently obtaining network topology where the locations and associated node identifiers are known by the central controller (sink). Although the locations of the nodes are known, the connectivity between any two nodes cannot be determined by distance information alone due to irregular radio coverage and obstacles. We propose a location-aided topology discovery algorithm (LAD) that requires O(log(|M|)) data units per node in common cases, and O(|M|) data units per node in the worst case, where M is the set of directly communicable neighbors of a particular node. Simulation results show that the overhead reduction ranges from 70% to over 95%. ©2008 IEEE.
Source Title: IEEE International Conference on Communications
URI: http://scholarbank.nus.edu.sg/handle/10635/41294
ISBN: 9781424420742
ISSN: 05361486
DOI: 10.1109/ICC.2008.513
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

7
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

1
checked on Nov 18, 2017

Page view(s)

49
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.