Delaunay graphs are almost as good as complete graphs
Discrete & Computational Geometry
Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
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
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
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
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
Distributed Maintenance of Resource Efficient Wireless Network Topologies (Distinguished Paper)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
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
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Constant density spanners for wireless ad-hoc networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Localized Topology Control for Unicast and Broadcast in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Localized topology control for heterogeneous wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Handling asymmetry in power heterogeneous ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
A shortest-path-based topology control algorithm in wireless multihop networks
ACM SIGCOMM Computer Communication Review
Energy-efficient topology control for three-dimensional sensor networks
International Journal of Sensor Networks
Analysis of k-Neigh topology control protocol for mobile wireless networks
Computer Networks: The International Journal of Computer and Telecommunications 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
Bootstrapping a hop-optimal network in the weak sensor model
ACM Transactions on Algorithms (TALG)
DNIS'07 Proceedings of the 5th international conference on Databases in networked information systems
Undirected connectivity of sparse Yao graphs
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Approximating Mexican highways with slime mould
Natural Computing: an international journal
Locally-Constructed trees for adhoc routing
PWC'06 Proceedings of the 11th IFIP TC6 international conference on Personal Wireless Communications
Evaluation of the energy consumption in MANET
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Bootstrapping a hop-optimal network in the weak sensor model
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Topology control with limited geometric information
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Constructing efficient rotating backbones in wireless sensor networks using graph coloring
Computer Communications
Initializing sensor networks of non-uniform density in the weak sensor model
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Theoretical Computer Science
On growing connected β-skeletons
Computational Geometry: Theory and Applications
How β-skeletons lose their edges
Information Sciences: an International Journal
Hi-index | 0.01 |
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmission ranges. Our first structure has the following attractive properties: (1) It is energy efficient: given any two nodes u and v, there is a path connecting them in the structure with total energy cost at most ρ = 1/1-(2sin π/k)β times of the energy cost of any path connecting them in original communication graph; (2) Its node degree is bounded from above by a positive constant k+5 where k6 is an adjustable parameter; (3) It is a planar structure, which enables several localized routing algorithms; (4) It can be constructed and maintained locally and dynamically. Moreover, by assuming that the node ID and its position can be represented in O(log n) bits each for a wireless network of n nodes, we show that the structure can be constructed using at most 24n messages, where each message is O(log n) bits. Our second method improves the degree bound to k, relaxes the theoretical power spanning ratio to ρ = √2 β/1 -(2√2sinπ/k)β, where k›8 is an adjustable parameter, and keeps all other properties. We show that the second structure can be constructed using at most 3n messages, where each message has size of O(log n) bit.We also experimentally evaluate the performance of these new energy efficient network topologies. The theoretical results are corroborated by the simulations: these structures are more efficient in practice, compared with other known structures used in wireless ad hoc networks and are easier to construct. In addition, the power assignment based on our new structures shows low energy cost and small interference at each wireless node.