Computational geometry: an introduction
Computational geometry: an introduction
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Unidirectional links prove costly in wireless ad hoc 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
An energy consumption model for performance analysis of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Constructing minimum energy mobile wireless 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
Constructing minimum energy mobile wireless networks
ACM SIGMOBILE Mobile Computing and Communications Review
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of 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
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
Wireless Communications & Mobile Computing
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
SIAM Journal on Discrete Mathematics
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
A fair and energy-efficient topology control protocol for wireless sensor networks
CASEMANS '08 Proceedings of the 2nd ACM international conference on Context-awareness for self-managing systems
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
TAP: an adjustable planar structure for adaptive topology control in wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A topology control protocol based on eligibility and efficiency metrics
Journal of Systems and Software
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
In wireless ad hoc networks, constructing and maintaining a topology with lower node degrees is usually intended to mitigate excessive traffic load on wireless nodes. However, keeping lower node degrees often prevents nodes from choosing better routes that consume less energy. Therefore, the trade-off is between the node degree and the energy efficiency. In this paper, an adjustable structure, named the r{\hbox{-}}{\rm neighborhood} graph, is proposed to control the topology. This structure has the flexibility to be adjusted between the two objectives through a parameter r, 0 \le r \le 1. More explicitly, for any set of n nodes, the maximum node degree and power stretch factor can be bounded from above by some decreasing and increasing functions of r, respectively. Specifically, the bounds can be constants in some ranges of r. Even more, the r{\hbox{-}}{\rm neighborhood} graph is a general structure of both RNG and GG, two well-known structures in topology control. Compared with YG_{k}, another famous adjustable structure, our method always results in a connected planar with symmetric edges. To construct this structure, we investigate a localized algorithm, named PLA, which consumes less transmitting power during construction and executes efficiently in O(n\log n) time.