首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Escape probability based routing for ad hoc networks
作者姓名:Zhang Xuanping  Qin Zheng & Li Xin Dept. of Computer Science  Xi’an Jiaotong Univ.  Xi’an  P. R. China
作者单位:Zhang Xuanping,Qin Zheng & Li Xin Dept. of Computer Science,Xi’an Jiaotong Univ.,Xi’an 710049,P. R. China
摘    要:1. INTRODUCTION Mobile ad hoc networks are wireless multi-hop networks where mobile nodes are self-organized, have highly dynamic topology, limited bandwidth and no support of fixed infrastructure1]. These characteristics often cause ad hoc networks to be viewed as quite different from traditional networks. Routing a packet from a source to a destination in an ad hoc network is a challenging problem. The main source of the challenge comes from the fact that there are no base stations in …

收稿时间:29 June 2005. 

Escape probability based routing for ad hoc networks
Zhang Xuanping,Qin Zheng,Li Xin.Escape probability based routing for ad hoc networks[J].Journal of Systems Engineering and Electronics,2006,17(4):927-930, 937.
Authors:Zhang Xuanping  Qin Zheng  Li Xin
Institution:Dept. of Computer Science, Xi'an Jiaotong Univ., Xi'an 710049 , P. R. China
Abstract:Routes in an ad hoc network may fail frequently because of node mobility. Stability therefore can be an important element in the design of routing protocols. The node escape probability is introduced to estimate the lifetime and stability of link between neighboring nodes and the escape probability based routing (EPBR) scheme to discover stable routes is proposed. Simulation results show that the EPBR can discover stable routes to reduce the number of route rediscovery, and is applicable for the situation that has highly dynamic network topology with broad area of communication.
Keywords:ad hoc networks  escape probability  routing  path stability
本文献已被 CNKI 万方数据 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号