Ad hoc网络基于平面区域划分的多径路由协议

相对于传统的单径路由，多径路由在实现负载均衡、提高路由可靠性和容错性方面具有很强的优势，但是目前的大多数多径路由协议是在单径路由（如DSR和AODV）的基础上进行扩展的，在大规模网络环境下容易造成广播风暴的问题。提出了一种快速建立最大限度不相交多径的路由协议，充分利用节点的地理位置信息，结合区域内转发模式和边线转发模式在曲线划分的不相交区域内寻找路径并完成数据转发。仿真实验结果表明，该路由协议使用了较小的控制开销，找到了尽可能不相交的多条路径，可以更好地均衡网络的负载，提高数据包的投递率。...

Full description

Saved in:
Bibliographic Details
Published in计算机应用研究 Vol. 31; no. 5; pp. 1554 - 1557
Main Author 董萍 钱焕延 魏晓飞 兰少华
Format Journal Article
LanguageChinese
Published School of Computer Science & Technology，Nanjing University of Science & Technology，Nanjing 210094，Chin 2014
Subjects
地理路由
多径
平面区域划分
移动自组织网络
节点不相交
多径
node-disjoint
multipath
geographic routing
zoning
节点不相交
mobile Ad hoc network
平面区域划分
移动自组织网络
地理路由
Online AccessGet full text
ISSN1001-3695
DOI10.3969/j.issn.1001-3695.2014.05.066

Cover

More Information
Summary:相对于传统的单径路由，多径路由在实现负载均衡、提高路由可靠性和容错性方面具有很强的优势，但是目前的大多数多径路由协议是在单径路由（如DSR和AODV）的基础上进行扩展的，在大规模网络环境下容易造成广播风暴的问题。提出了一种快速建立最大限度不相交多径的路由协议，充分利用节点的地理位置信息，结合区域内转发模式和边线转发模式在曲线划分的不相交区域内寻找路径并完成数据转发。仿真实验结果表明，该路由协议使用了较小的控制开销，找到了尽可能不相交的多条路径，可以更好地均衡网络的负载，提高数据包的投递率。
Bibliography:51-1196/TP
mobile Ad hoc network; geographic routing; zoning; node-disjoint; multipath
Compared with single path routing protocols, muhipath routing protocols have many advantages in loading balan- cing, improving reliability and fault tolerance. A lot of multipath routing protocols are designed by expanding single path rou- ting protocols, just like DSR or AODV. However, these protocols are not suitable for the network of large scale and high den- sity as too many control messages will lead to the broadcast storm problem. This paper presented a novel multipath routing pro- tocol called ZMG （zoning-based multipath geographic routing protocol） to construct maximally node-disjoint multipath. In the proposed scheme, each node got his location information from GPS, discovered multiple paths and forwarded data packets by combining interior region forwarding mode and boundary forwarding mode. Simulation results show that ZMG not only has less control messages, but also can find maximally node-disjoint paths, which in
ISSN:1001-3695
DOI:10.3969/j.issn.1001-3695.2014.05.066