文章基本信息

标题：Routing Discovery Algorithm Using Parallel Chase Packet
本地全文：下载
作者：Muneer Bani Yassein ; Yaser M. Khamayseh ; Amera Al-Ameri 等
期刊名称：International Journal of Advanced Computer Science and Applications(IJACSA)
印刷版ISSN：2158-107X
电子版ISSN：2156-5570
出版年度：2013
卷号：4
期号：3
DOI：10.14569/IJACSA.2013.040318
出版社：Science and Information Society (SAI)
摘要：On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV) initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route discovery process in such protocols depends on a simple flooding as a broadcast technique due to its simplicity. Simple flooding results in packet congestion, route request overhead and excessive collisions, namely broadcast storm problem. A number of routing techniques have been proposed to control the simple flooding technique. Ideally, the broadcast of route request or the route discovery process must be stopped as soon as the destination node is found. This will free the network from many redundant packets that may cause network collision and contention. In this paper, chasing packet technique is used with standard AODV routing protocol to end the fulfilled route requests. The chase packet is initiated by the source node and is broadcasted in parallel with route request packet. As soon as the destination is found the chase packet starts its work by trying to catch and discard the route request in early stages before it broadcasts further in the network. Performance evaluation is conducted using simulation to investigate the performance of the proposed scheme against the existing approach that uses chase packet technique such as Traffic Locality Route Discovery Algorithm with Chase (TLRDA-C). Results reveal that the proposed scheme minimizes end-to-end packet delays and achieves low routing request overhead.
关键词：thesai; IJACSA; thesai.org; journal; IJACSA papers; MANET; Chase Packets; AODV; Broadcast Storm Problem.