Euclidean spanners: short, thin, and lanky
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
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
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
RNG and internal node based broadcasting algorithms for wireless one-to-one networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
SIAM Journal on Discrete Mathematics
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Distributed Maintenance of Resource Efficient Wireless Network Topologies (Distinguished Paper)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
On local algorithms for topology control and routing in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Geometric spanners with applications in wireless networks
Computational Geometry: Theory and Applications
A distributed boundary detection algorithm for multi-robot systems
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
On channel-discontinuity-constraint routing in wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
A mapping function to use cellular automata for solving MAS problems
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Spanners, weak spanners, and power spanners for wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Computational Geometry: Theory and Applications
On channel-discontinuity-constraint routing in wireless networks
Ad Hoc Networks
On certain geometric properties of the Yao---Yao graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a linear number of links while still preserving some power-efficient routes for any pair of nodes. We prove that this new topology not only has a bounded node degree k but also has a bounded power stretch factor 2 in civilized graph. Finally, we give some simulation results to verify its performance in practice and conclude the paper with the discussion of possible future works.