Cart (Loading....) | Create Account
Close category search window
 

Bandwidth-Power Aware Cooperative Multipath Routing for Wireless Multimedia Sensor 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
$31 $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

5 Author(s)
Hongli Xu ; Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China ; Liusheng Huang ; Chunming Qiao ; Yindong Zhang
more authors

Cooperative communication is becoming an attractive technology as it can greatly improve the spatial diversity without additional antennas. This novel communication paradigm can effectively reduce power consumption via multi-node cooperation and resource allocation. This paper studies the energy-efficient node-disjoint multi-path routing for a given source-destination pair by joint route construction, relay assignment and power allocation methods. We first define a new bandwidth-power aware cooperative multi-path routing (BP-CMPR) problem, and formally prove its NP-hardness. The paper then presents a polynomial-time heuristic algorithm CMPR to solve the above problem. The algorithm adopts the Suurballe's method to find k minimal-weight node-disjoint paths from source to destination on a weighted graph. Then, dynamic programming is used to implement relay assignment and power allocation. The theoretical analysis shows that CMPR can reach approximation factors of 2 and frac{4}{3} for BP-CMPR under the amplify-and-forward and decode-and-forward schemes respectively. The distributed version of the algorithm DCMPR is also presented for this problem. We also prove that both CMPR and DCMPR construct the same cooperative multi-path routing, and show via simulations that the performance of the proposed scheme is more than 15% better than that of a traditional multi-path routing scheme, and close to the optimal result for BP-CMPR in variety of situations.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:11 ,  Issue: 4 )

Date of Publication:

April 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.