By Topic

A RED based minimum energy routing algorithm for 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

3 Author(s)
Xinyu Jin ; Dept. of Inf. Sci. & Electron. Eng., Zhejiang Univ., Hangzhou, China ; Wenyu Cai ; Yu Zhang

Mobile nodes in mobile ad-hoc networks (MANETs) operate on limited batteries, so it's a very important issue to use energy efficiently and reduce power consumption. To maximize the lifetime of an ad-hoc network, it is essential to prolong each individual node's life through minimizing the transmission energy consumption; some minimum energy routing schemes in MANETs have been developed for this reason. In this paper, a novel minimum energy routing scheme based on the mobile node's energy consumption and the hierarchical node's congestion levels, which is named RED based minimum energy routing (REDMER) scheme, has been presented. REDMER distinguishes node's congestion levels according to the principle of the well-known AQM (active queue management) scheme RED (random early detection). The simulation results verify that the performance of the REDMER scheme is better than the existing minimum energy routing scheme MTPR (total transmission power routing).

Published in:

Wireless Communications, Networking and Mobile Computing, 2005. Proceedings. 2005 International Conference on  (Volume:2 )

Date of Conference:

23-26 Sept. 2005