Localized topology control for unicast and broadcast in wireless ad hoc networks

We propose a novel localized topology-control algorithm for each wireless node to locally select communication neighbors and adjust its transmission power accordingly such that all nodes together self-form a topology that is energy efficient simultaneously for both unicast and broadcast communicatio...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 2006-04, Vol.17 (4), p.321-334
Main Authors: Wen-Zhan Song, Xiang-Yang Li, Frieder, O., Weu Zhao Wang
Format: Article
Language:English
Subjects:
Algorithms
Asymptotic properties
broadcast
Broadcasting
Communication system control
Computer networks
Control algorithms
Cost function
Energy consumption
Energy efficiency
Graph theory
localized communication
low interference
low weight
Mobile ad hoc networks
Network topology
Networks
power efficient
Routing
Routing (telecommunications)
Studies
Topology
topology control
Unicast
wireless ad hoc networks
Wireless communication
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a novel localized topology-control algorithm for each wireless node to locally select communication neighbors and adjust its transmission power accordingly such that all nodes together self-form a topology that is energy efficient simultaneously for both unicast and broadcast communications. We theoretically prove that the proposed topology is planar, which meets the requirement of certain localized routing methods to guarantee packet delivery; it is power-efficient for unicast - the energy needed to connect any pair of nodes is within a small constant factor of the minimum; it is also asymptotically optimum for broadcast - the energy consumption for broadcasting data on top of it is asymptotically the best among all structures constructed using only local information; it has a constant bounded logical degree, which will potentially save the cost of updating routing tables if used. We further prove that the expected average physical degree of all nodes is a small constant. To the best of our knowledge, this is the first localized topology-control strategy for all nodes to maintain a structure with all these desirable properties. Previously, only a centralized algorithm was reported. Moreover, by assuming that the node ID and its position can be represented in O(log n) bits for a wireless network of n nodes, the total number of messages by our methods is in the range of theoretical results are corroborated in the simulations.
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2006.53