Research Article
Distributed lifetime maximizing cooperative routing algorithm in wireless Ad hoc networks
@INPROCEEDINGS{10.4108/chinacom.2010.39, author={Lina Zheng and Ju Liu and Chao Zhai and Lei Chen}, title={Distributed lifetime maximizing cooperative routing algorithm in wireless Ad hoc networks}, proceedings={5th International ICST Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2011}, month={1}, keywords={Binary phase shift keying Energy consumption Protocols Relays Resource management Routing}, doi={10.4108/chinacom.2010.39} }- Lina Zheng
Ju Liu
Chao Zhai
Lei Chen
Year: 2011
Distributed lifetime maximizing cooperative routing algorithm in wireless Ad hoc networks
CHINACOM
ICST
DOI: 10.4108/chinacom.2010.39
Abstract
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.