Delaunay graphs are almost as good as complete graphs
Discrete & Computational Geometry
Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
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
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
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
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Energy and mobility-aware topology control in heterogeneous mobile ad hoc networks
International Journal of Computational Science and Engineering
Deterministic recurrent communication and synchronization in restricted sensor networks
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Netted radar: Network communications design and optimisation
Ad Hoc Networks
Improved stretch factor for bounded-degree planar power spanners of wireless ad-hoc networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Hi-index | 0.00 |
Topology control in wireless ad hoc networks is to select a subgraph of the communication graph (when all nodes use their maximum transmission range) with some properties for energy conservation. In this paper, we propose two novel localized topology control methods for homogeneous wireless ad hoc networks.Our first method constructs a structure with the following attractive properties: power efficient, bounded node degree, and planar. Its power stretch factor is at most ρ=1/1-(2sin π/k)β, and each node only has to maintain at most k + 5 neighbors where the integer k 6 is an adjustable parameter, and β is a real constant between 2 and 5 depending on the wireless transmission environment. 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) bits.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.