STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A new way to weigh Malnourished Euclidean graphs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Power consumption in packet radio networks
Theoretical Computer Science
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
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
RNG and internal node based broadcasting algorithms for wireless one-to-one networks
ACM SIGMOBILE Mobile Computing and Communications Review
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Constructing Plane Spanners of Bounded Degree and Low Weight
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & 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
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and 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
Approximate MST for UDG locally
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
IEEE Communications Magazine
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
Joint range assignment and routing to conserve energy in wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Maximum life-time localized broadcast routing in MANET
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
Energy-efficient topology control in wireless ad hoc networks with selfish nodes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved approximation algorithms for maximum lifetime problems in wireless networks
Theoretical Computer Science
Neighbor Selection Game in Wireless Ad Hoc Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
We propose a novel localized topology-control algorithm for each wireless node to locally select communication neighbors and adjust its transmission power accordingly such that all nodes together self-form a topology that is energy efficient simultaneously for both unicast and broadcast communications. We theoretically prove that the proposed topology is planar, which meets the requirement of certain localized routing methods to guarantee packet delivery; it is power-efficient for unicast—the energy needed to connect any pair of nodes is within a small constant factor of the minimum; it is also asymptotically optimum for broadcast—the energy consumption for broadcasting data on top of it is asymptotically the best among all structures constructed using only local information; it has a constant bounded logical degree, which will potentially save the cost of updating routing tables if used. We further prove that the expected average physical degree of all nodes is a small constant. To the best of our knowledge, this is the first localized topology-control strategy for all nodes to maintain a structure with all these desirable properties. Previously, only a centralized algorithm was reported in [CHECK END OF SENTENCE]. Moreover, by assuming that the node ID and its position can be represented in O(\log n) bits for a wireless network of n nodes, the total number of messages by our methods is in the range of [5n,13n], where each message is O(\log n) bits. Our theoretical results are corroborated in the simulations.