Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Research on Congestion Control Routing Algorithm for Mobile Ad Hoc Networks Based on Node Degree Theory

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)
Liu Ban-teng ; Coll. of Inf., Zhejiang Shuren Univ., Hangzhou, China ; Wang Zhang-quan ; Chen Ju-hua ; Chen Yourong

Ad Hoc network is recently a hot spot in wireless network researching domain. The design of routing algorithm, which is as the core layer technology in Ad Hoc networks, has drawn great concern. After analyzing the drawbacks of the existing algorithms, this paper puts forward a congestion control routing algorithm based on the node degree. This paper explains the principle of the node degree algorithm; we select nodes with low degree to forward data packets in the process of routing searching. Results of simulation show: number of relay nodes is reduced significantly in the process of routing setup.

Published in:

Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on

Date of Conference:

23-25 Sept. 2011