By Topic

PR-RAM: The Page Rank Routing Algorithm Method in Ad-hoc wireless 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

5 Author(s)
Sejong Yoon ; Dept. of Electr. Eng., Korea Univ., Seoul, South Korea ; Doohyun Ko ; Sanghoon Koh ; Heungwoo Nam
more authors

This paper presents the Page Rank Routing Algorithm Method (PR-RAM), which is the Ad-hoc wireless networks routing protocol using Page Rank algorithm. Page Rank is the link analysis algorithm used by the Google internet engine that assigns a numerical weighting to each element of World Wide Web (WWW) with the purpose of measuring its relative importance within the WWW. If any web page has a higher rank than other web page, it means that this web page is more important than other web page. In order to measure the relative importance of mobile node in wireless network environments, this paper uses the Page Rank algorithm in Ad-hoc wireless networks. Mobile node's Page Rank means how many routing paths are included to this node. This paper also uses available every multiple minimum hop-count routing paths to be more efficient on view of variance of entire mobile nodes energy. PR-RAM is guaranteed the access fairness of source node to Access Point (AP) in Ad-hoc networks environments.

Published in:

Consumer Communications and Networking Conference (CCNC), 2011 IEEE

Date of Conference:

9-12 Jan. 2011