SMAODV: A Novel Smart Protocol for Routing in Ad-hoc Wireless Networks Using the PageRank Algorithm

Full Text (PDF, 783KB), PP.46-53

Views: 0 Downloads: 0


Ali Gozali 1,* Keivan Borna 2

1. Faculty of Electrical, Computer and IT Engineering, Islamic Azad University, Qazvin Branch, Qazvin, Iran

2. Faculty of Mathematics and Computer Science, Kharazmi University, Tehran, Iran

* Corresponding author.


Received: 17 Oct. 2014 / Revised: 22 Feb. 2015 / Accepted: 26 Apr. 2015 / Published: 8 Aug. 2015

Index Terms

Ad-Hoc networks, Routing Protocol, Multi Path, Ranking Algorithms


The Ad-Hoc networks are the kind of wireless networks that their configuration is done automatically and also the nodes are moving with a certain speed. For this reason the created paths (routes) are often unstable and these paths are usually broken by switching nodes. In this respect, choosing the right path and routing mechanism become more diverse in these networks.
In this research by applying some changes to the AODV routing protocols, two new protocols are presented: The first protocol is SAODV, which is a protocol for multi-path which finds the minimum length path between source and destination nodes and then sequentially sends the packets in these paths. The second protocol is SMAODV, which is a verified version of the first one but it finds multi-paths with minimum length for sending the control packets by the use of webpage rank algorithm and a smart mechanism for determining the amount of sending packets. This would cause the energy at any point in the network nodes with minimum variance and increase the network lifetime. The results of simulations in the NS-2 network simulator also verify that our proposed methods have better efficiency than the basic AODV protocol, and improve the network performance and decrease the end-to-end delay of receipt packets.

Cite This Paper

Ali Gozali, Keivan Borna, "SMAODV: A Novel Smart Protocol for Routing in Ad-hoc Wireless Networks Using the PageRank Algorithm", International Journal of Computer Network and Information Security(IJCNIS), vol.7, no.9, pp.46-53, 2015. DOI:10.5815/ijcnis.2015.09.06


[1]AKYILDIZ, I., AND WANG, X. A survey on wireless mesh networks, IEEE.
[2]ALOTAIBI, E., AND MUKHERJEE, B. A survey on routing algorithms for wireless Ad-Hoc and mesh networks, Department of computer science, university of California, 2012.
[3]DUHAN, N., SHARMA, A.K. AND BHTIA, K.K. Page Ranking Algorithms: A Survey, IEEE International Advance Computing Conference, Patiala, India, 6-7 March 2009.
[4]PERKINS, C. Ad Hoc On-Demand Distance Vector (AODV) Routing, Mobile Computing Systems and Applications, New Orleans, pp. 90-100, 2003.
[5]PERKINS, C.Ad hoc On-Demand Distance Vector (AODV) Routing RFC, RFC-Experimental, July 2003.
[6]PATEL, D.K., AND KUMAR,R. Performance Analysis & Behavioural Study of Proactive & Reactive Routing Protocols in MANET, International Journal of Advanced Research in Computer and Communication Engineering Vol. 2, Issue 4, April 2013.
[7]TANENBAUM, A. S. Introduction, in computer networks, 4th ed. USA, 2003.
[8]YOON, S., KO, D., KOH, S. AND NAM, H. PR-RAM: The Page Rank Routing Algorithm Method in Ad-hoc Wireless Networks, 5th IEEE Workshop on Personalized Networks (PerNEts 2011).