Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies
IEEE Transactions on Mobile Computing
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Ad hoc networks beyond unit disk graphs
Wireless Networks
Constrained Delaunay triangulation for ad hoc networks
Journal of Computer Systems, Networks, and Communications
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Approximate MST for UDG locally
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
On study of achievable capacity with hybrid relay in cognitive radio networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Policy controlled self-configuration in unattended wireless sensor networks
Journal of Network and Computer Applications
A simple scheme with low energy consumption for coverage maintenance in wireless sensor networks
UCS'06 Proceedings of the Third international conference on Ubiquitous Computing Systems
Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Fast localized delaunay triangulation
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
An energy-efficient coverage maintenance scheme for distributed sensor networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
On the monitoring period for fault-tolerant sensor networks
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
An active node set maintenance scheme for distributed sensor networks
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Fault-tolerant spanners for ad hoc networks
International Journal of Network Management
| Hi-index | 0.00 |
We propose a new geometric spanner, for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It combines the connected dominating set and the local Delaunay graph to form the backbone of wireless network. This new spanner has these following attractive properties: (1) the backbone is a planar graph;(2) the node degree of the backbone is bounded from above by a positive constant;(3) it is a spanner both for hops and length; moreover, we show that, given any two nodes u and v, there is a path connecting them in the backbone such that its length is no more than 6 times of the shortestpath and the number of links is no more than 3 times of the shortest path;(4) it can beconstructed locally and is easy to maintain when the nodes move around;(5) moreover, we show that the computation cost of each node is at most O(d log d), whered is its 1-hop neighbors in the original unit disk graph, and the communication cost of each node is bounded by a constant. Simulation results are also presented for studying its practical performance.