文章基本信息

标题：Shortest Path Routing Over Scalable Mobile Ad Hoc Networks
本地全文：下载
作者：Kanika Pasrija ; Ashok ; Seema Rani 等
期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：9
出版社：S.S. Mishra
摘要：Over the past decade or so, there has been rapid growth in wireless and mobile applications technologies. More recently, an increasing emphasis has been on the potential of infrastructure less wireless mobile networks that are easy, fast and in-expensive to set up, with the view that such technologies will enable numerous new applications in a wide range of areas. Such networks are commonly referred to as mobi le ad hoc networks. In MANET, data is sent from one node to another node by using links, called path. Routing protocol is responsible to find out the path to be followed by the packets from source to destination. For MANET, there are different type of prot ocols are available and as per the requirement, we can use any one. Each protocol has its own criteria to find the path from source to destination. Some of researchers explored the concept of shortest path routing over ad hoc network. In this paper, we will analyse the impact of scalability over the mobile ad hoc network and the behaviour of shortest path routing algorithm
关键词：Ad-hoc network; MANET; Shortest Path; routing protocol; Bellman Ford; Dijkstra; DSD V