Path Holding Probability Based Ad Hoc On-Demand Routing Protocol
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In mobile ad hoc networks (MANET), node movement often makes the wireless link break, and results in the routing invalidation. In order to improve the stability of routing, based on the analysis of the time-t holding probability of single link, an on-demand routing protocol is provided based on the time-t holding probability of a whole path. With double reply of routing request from destination and reverse optimizing of middle nodes, this protocol chooses the path that has the maximal time-t holding probability as the best routing. Simulations show that, compared with AODV (ad hoc on-demand distance vector) and DSR (dynamic source routing), this protocol saves the overhead of the protocol and reduces the end-to-end delay of the packet.

    Reference
    Related
    Cited by
Get Citation

刘军,郭伟,肖百龙,黄飞.移动自组网基于路径维持概率的按需路由协议.软件学报,2007,18(3):693-701

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 20,2005
  • Revised:March 09,2006
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063