Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ICC.2008.513
DC Field | Value | |
---|---|---|
dc.title | Location-aided topology discovery for wireless sensor networks | |
dc.contributor.author | Zhang, M. | |
dc.contributor.author | Mun, C.C. | |
dc.contributor.author | Ananda, A.L. | |
dc.date.accessioned | 2013-07-04T08:24:09Z | |
dc.date.available | 2013-07-04T08:24:09Z | |
dc.date.issued | 2008 | |
dc.identifier.citation | 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 | |
dc.identifier.isbn | 9781424420742 | |
dc.identifier.issn | 05361486 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/41294 | |
dc.description.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. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ICC.2008.513 | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.doi | 10.1109/ICC.2008.513 | |
dc.description.sourcetitle | IEEE International Conference on Communications | |
dc.description.page | 2717-2722 | |
dc.identifier.isiut | 000259505002003 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.