Please use this identifier to cite or link to this item:
Title: Bounding the power rate function of wireless ad hoc networks
Authors: Wu, Y
Zhang, Q
Zhu, W
Kung, SY
Keywords: Ad hoc networks
Graph theory
Greedy algorithms
Linear programming
Radio links
Issue Date: 2005
Publisher: IEEE
Source: IEEE INFOCOM 2005 : the conference on computer communications : 24th Annual Joint Conference of the IEEE Computer and Communications Societies : proceedings : 13-17 March, 2005, Hyatt Regency Miami, Miami, Florida USA, v. 1, p. 584-595 How to cite?
Abstract: Given a wireless ad hoc network and an end-to-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput under a layered model of wireless networks. A critical notion of the layered model is the realizable graphs, which describe possible hit-rate supplies on the links by the physical and medium access layers. Under the layered model, the problem of finding the power rate function can he transformed into finding the minimum-power realizable graph that can provide a given throughput. We introduce a usage conflict graph to represent the conflicts among different uses of the wireless medium. Testing the realizability of a given graph can be transformed into finding the (vertex) chromatic number, i.e., the minimum number of colors required in a proper vertex-coloring, of the associated usage conflict graph. Based on an upper bound of the chromatic number, we propose a linear program that outputs an upper bound of the power rate function. A lower bound of the chromatic number is the clique number. We propose a systematic way of identifying cliques based on a geometric analysis of the space sharing among active links. This leads to another linear program, which yields a lower bound of the power rate function. We further apply greedy vertex-coloring to fine tune the bounds. Simulations results demonstrate that the obtained bounds are tight in the low power and low rate regime.
ISBN: 0-7803-8968-9
ISSN: 0743-166X
DOI: 10.1109/INFCOM.2005.1497925
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Feb 15, 2019

Page view(s)

Last Week
Last month
Citations as of Feb 18, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.