Group-Based Overhead Limiting for Stability Routing in Ad Hoc Networks
Two critical issues of designing scalable routing algorithm in ad hoc networks are that it should be robust to frequent path disruptions caused by node mobility and limit routing overhead.This paper argues grouping nodes with the motion direction of source to limit the range of RREQ broadcast.This kind of grouping also ensures that nodes, belonging to the same group, are more likely to establish longtime existent paths as they have similar motions.During route discovery, only the nodes which are in same group with source are allowed to rebroadcast RREQ.So the destination can select a most stable route to reply.The performance is evaluated through computer simulation with NS2.Simulation results indicate the proposed routing algorithm can limit routing overhead and enhance route stability effectively.
ad hoc networks overhead stability grouping
Xi Hu Cong Wang Siwei Zhao Xin Wang
Northestern University at Qinhuangdao, 066004, Hebei, China School of Electronic and Information Engineering, Beijing Jiaotong University,100044, Beijing, China Information and Control Engineering Faculty, Shenyang Jianzhu University, 110168,Shenyang, China
国际会议
4th international Conference,ICSI2013(第4届群体智能国际会议)
哈尔滨
英文
334-341
2013-06-12(万方平台首次上网日期,不代表论文的发表时间)