Delaunay graphs are almost as good as complete graphs
Discrete & Computational Geometry
Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
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
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
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
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
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)
The Delauney Triangulation Closely Approximates the Complete Euclidean Graph
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
On the Spanning Ratio of Gabriel Graphs and beta-skeletons
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
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
A Generic Broadcast Protocol in Ad Hoc Networks Based on Self-Pruning
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
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
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Localized techniques for broadcasting in wireless sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Improved approximation results for the minimum energy broadcasting problem
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Fault tolerant deployment and topology control in wireless ad hoc networks: Research Articles
Wireless Communications & Mobile Computing - Performance Evaluation of Wireless Networks
IEEE Communications Magazine
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Handling asymmetry in power heterogeneous ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion
Computer Communications
Energy efficient multicast routing in ad hoc wireless networks
Computer Communications
Modeling the energy cost of applications on portable wireless devices
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Heuristics for Minimizing Interference in Sensor Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
VCGG: a varying cone distributed topology-control algorithm for wireless ad hoc networks
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Joint range assignment and routing to conserve energy in wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Local Construction of Spanners in the 3-D Space
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Energy efficient opportunistic routing in wireless networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Topology control and geographic routing in realistic wireless networks
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Minimizing interference for the highway model in wireless ad-hoc and sensor networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
IEEE/ACM Transactions on Networking (TON)
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Fully localised energy-efficient multicast in large-scale wireless ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Undirected connectivity of sparse Yao graphs
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Exact algorithms to minimize interference in wireless sensor networks
Theoretical Computer Science
On the topologies of local minimum spanning trees
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Energy-Efficient broadcast scheduling for speed-controlled transmission channels
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Compressed data aggregation: energy-efficient and high-fidelity data collection
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We propose a novel communication efficient topology control algorithm for each wireless node to select communication neighbors and adjust its transmission power, such that all nodes together self-form a topology that is energy efficient simultaneously for both unicast and broadcast communications. We prove that the proposed topology is planar, which guarantees packet delivery if a certain localized routing method is used; it is power efficient for unicast-- the energy needed to connect any pair of nodes is within a small constant factor of the minimum under a common power attenuation model; it is efficient for broadcast: the energy consumption for broadcasting data on top of it is asymptotically the best compared with structures constructed locally; it has a constant bounded logical degree, which will potentially reduce interference and signal contention. We further prove that the average physical degree of all nodes is bounded by a small constant. To the best of our knowledge, this is the first communication-efficient distributed algorithm to achieve all these properties. Previously, only a centralized algorithm was reported in [3]. Moreover, by assuming that the ID and position of every node can be represented in O(log n) bits for a wireless network of n nodes, our method uses at most 13n messages, where each message is of O(log n) bits. We also show that this structure can be efficiently updated for dynamical network environment. Our theoretical results are corroborated in the simulations.