By Topic

Minimum outage probability routing and power allocation in wireless ad-hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zigui Yang ; Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI, USA ; A. Host-Madsen

We address the minimum outage probability problem for unicast communication in quasistatic networks when total power consumption is constrained. We use relay-channel signaling rather than traditional multihop routing. Under the assumptions that carrier level synchronization is not available and every intermediate node uses a decode-forward scheme, we show that for any node the interference from other unintended transmissions is effectively cancelled out even if all communications share one common physical medium. We show that any optimal relaying structure can be converted to a sequential path, for which we find a simple optimal power-allocation policy. Finding an optimal sequential path is still complex, and we therefore present two polynomial heuristic algorithms. Our simulation results show that they achieve exceptional outage performance and can obtain gains up to 4.5 dB and 6 dB respectively for outage probability 10-3.

Published in:

2005 International Conference on Wireless Networks, Communications and Mobile Computing  (Volume:2 )

Date of Conference:

13-16 June 2005