TAP: an adjustable planar structure for adaptive topology control in wireless ad hoc networks

Authors:
Zhaoliang Zhang;Guangquan Zhang;Xiaofang Zhang;Jianxi Fan
Affiliations:
School of Computer Science and Technology, Soochow University, Suzhou, China;School of Computer Science and Technology, Soochow University, Suzhou, China;School of Computer Science and Technology, Soochow University, Suzhou, China;School of Computer Science and Technology, Soochow University, Suzhou, China
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 9
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Algorithmic aspects of topology control problems for ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
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 K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Does topology control reduce interference?

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
A cone-based distributed topology-control algorithm for wireless multi-hop networks

IEEE/ACM Transactions on Networking (TON)
The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Design and analysis of an MST-based topology control algorithm

IEEE Transactions on Wireless Communications
Localized Delaunay triangulation with application in ad hoc wireless networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wireless ad hoc networks, a planar topology enables nodes to deliver packets without a routing table. Pervious planar structures are fixed for the whole network. However, environmental or network dynamics such as channel status, interference or energy will prevent such structures from providing the best service to the network. In this paper, we present a t-adjustable planar structure (TAP) which enables nodes to adjust the topology independently and allows nodes to have different path loss exponent. We show by proof or simulation properties of TAP: (1) It preserves connectivity; (2) It is planar, sparse and symmetric; (3) It preserves all minimum energy path when t = 1 for all nodes; (4) The average transmission power, interference and node degree decrease as t increases and the maximum node degree is bounded by 6 when t = 3 for all nodes.