By Topic

Distributed lifetime maximizing cooperative routing algorithm 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
$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

4 Author(s)
Lina Zheng ; Sch. of Inf. Sci. & Eng., Shandong Univ., Jinan, China ; Ju Liu ; Chao Zhai ; Lei Chen

In this paper, jointly combining advantages of cooperative communication at the physical layer and distributed routing schemes at the network layer, we propose a novel lifetime maximizing cooperative routing (LMCR) algorithm with decode-and-forward cooperative fashion to prolong the lifetime of wireless Ad-hoc networks. Optimal power allocation mechanism is analyzed for both cooperative and non-cooperative links with the constraint of average SER. Subsequently, link costs representing the weighted total consumed power are constructed to avoid the overuse of certain nodes with little energy. In addition, both the transmission energy and circuit energy are considered in energy consumption model. Finally, simulation results are provided to verify the efficiency of the proposed routing scheme.

Published in:

Communications and Networking in China (CHINACOM), 2010 5th International ICST Conference on

Date of Conference:

25-27 Aug. 2010