By Topic

Performance analysis of two dynamic link selection algorithms in ad hoc CDMA 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

2 Author(s)
Kalai Bala ; Dept. of Elec. & Comp. Eng., Ryerson Univ., Toronto, Ont., Canada ; Anpalagan, A.

In a mobile ad hoc network, the connection between an arbitrary source and destination node can be established using intermediate nodes. Most of the mobile nodes heavily rely on the battery power to keep themselves alive. Therefore, the battery power (or battery lifetime) and the number of relaying nodes (or delay) play a major role in mobile ad hoc networking. In this paper we discuss three existing common algorithms, MHC, MTPR, and MBCR which are used to minimize the delay, power and nodal over-utilization respectively. This paper also proposes two new algorithms namely, MWBCR and MTP-WBCR and investigates their performance in terms of power and delay. These power-aware algorithms are simulated using JAVA. The simulation results show that the proposed algorithms require more transmission power and delay than others. However, it is expected that the fairness in utilizing relaying nodes in terms of in power and delay will be improved using the new algorithms.

Published in:

Electrical and Computer Engineering, 2003. IEEE CCECE 2003. Canadian Conference on  (Volume:3 )

Date of Conference:

4-7 May 2003