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
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
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
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
Geometric Spanners for Wireless Ad Hoc Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
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
Efficient construction of low weight bounded degree planar spanner
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Localized Topology Control for Unicast and Broadcast in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Local solutions for global problems in wireless networks
Journal of Discrete Algorithms
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion
Computer Communications
An SPT-based topology control algorithm for wireless ad hoc networks
Computer Communications
A local distributed algorithm to approximate MST in unit disc graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
IEEE/ACM Transactions on Networking (TON)
Some problems in distributed computational geometry
Theoretical Computer Science
The MST of symmetric disk graphs (in arbitrary metric spaces) is light
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
We consider a wireless network composed of a set of n wireless nodes distributed in a two dimensional plane. The signal sent by a node can be received by all nodes within its transmission region, which is a unit disk centered at this node. The nodes together define a unit disk graph (UDG) with edge uv iff ||uv|| ≤ 1. We present the first localized method to construct a bounded degree planar connected structure for UDG whose total edge length is within a constant factor of the minimum spanning tree. The total communication cost of our method is O(n), and every node only uses its two-hop information to construct such structure. We show that some two-hop information is necessary to construct any low-weighted structure. We also study the application of this structure in efficient broadcasting in wireless ad hoc networks.We prove that this structure uses only O(1/n) of the total energy of the previously best-known light weighted structure RNG.