无线网络中的一种基于小世界模型的路由协议

最近，利用节点的移动性提升网络系统性能的方法引起了不少关注。这些方法已经被运用于包括移动Adhoc网络（MANET）、无线传感网络（WSN）和容忍延时网络（DTN）在内的一些新兴网络中，他们都认为节点是随机或者可控移动的。为了达到优化或平衡包括延时、平均中继节点数目和移动距离在内的一些度量参数的目的，本文提出了一种基于于小世界模型的路由协议（SWR）。通过分析，该协议只有多对数数量级的中继节点，大大减少了报文传输过程中中继节点的数量。文中定义了短链接与长链接的概念，其中每一节点与其最邻近的节点之间存在“短”链接，而与其他遵循桌一概率分布的节点间存在着“长”链接。短链接通常是无线链接，而长链接通常是利用移动节点来实现的。本文在网络规模、使用数据搭乘者、多重长链接和等待移动节点时间方面进行了分析。通过仿真结果，我们对各方面性能进行了评估。

A Small World Routing Protocol in Wireless Networks

The use of mobile nodes to improve network system performance has drawn considerable attention recently.These methods consider that resource-rich mobile nodes are moving randomly or controlled.The application has been used in several emerging networks,including mobile ad hoc networks(MANET),wireless sensor networks(WSN),and delay tolerant networks(DTN).In order to optimize or balance several measures,including delay,average number of relays,and moving distance,this paper proposes a new Small World Routing(SWR)protocol.The protocol is based on the small-world model and only has an expected polylogarithmic number of relays.Each static node has "short" link connections to its nearest neighbors and "long" link connections to other nodes following a certain probability distribution.Short links are regular wireless connections whereas long links are implemented using mobile nodes.It also considers network sizes,using hitchhiker,multiple long links and waiting time for mobile nodes.All aspects are evaluated by simulation results.