Euclidean spanners: short, thin, and lanky
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Unidirectional links prove costly in wireless ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Sparse Power Efficient Topology for Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Localized algorithms for energy efficient topology in wireless ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Scoped Bellman-Ford geographic routing for large dynamic wireless sensor networks
Journal of Computer Science and Technology
An improved alamouti strategy in dense wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Energy-driven distribution of signal processing applications across wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
DNIS'07 Proceedings of the 5th international conference on Databases in networked information systems
Localized spanner construction for ad hoc networks with variable transmission range
ACM Transactions on Sensor Networks (TOSN)
Performance evaluation of distributed self-organization protocols in wireless sensor networks
Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Energy and mobility-aware topology control in heterogeneous mobile ad hoc networks
International Journal of Computational Science and Engineering
Approximation algorithms for multicast routing in ad hoc wireless networks
Journal of Combinatorial Optimization
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Hi-index | 0.00 |
This article studies topology control in heterogeneous wireless sensor networks, where different wireless sensors may have different maximum transmission ranges and two nodes can communicate directly with each other if and only if they are within the maximum transmission range of each other. We present several localized topology control strategies in which every wireless sensor maintains logical communication links to only a selected small subset of its physical neighbors using information of sensors within its local neighborhood in a heterogeneous network environment. We prove that the global logical network topologies formed by these locally selected links are sparse and/or power efficient and our methods are communication efficient. Here a structure is power efficient if the total power consumption of the least cost path connecting any two nodes in it is no more than a small constant factor of that in the original heterogeneous communication network. By utilizing the wireless broadcast channel capability, and assuming that a message sent by a sensor node will be received by all sensors within its transmission region with at most a constant number of transmissions, we prove that all our methods use at most O(n) total messages, where each message has O(log n) bits. We also conduct extensive simulations to study the practical performance of our methods.