[论文解读] Performance Analysis of Probabilistic Rebroadcasting in Grid FSR for MANET

S. Nithya Rekha, C. Chandrasekar|arXiv (Cornell University)|Oct 11, 2012

Mobile Ad Hoc Networks参考文献 13被引用 5

一句话总结

本文提出了一种基于网格的鱼眼状态路由（FSR）中用于移动自组织网络（MANETs）的基于概率的重传方案，通过利用节点友谊关系和邻近信息共享来减少泛洪开销。通过使用基于启发式的友谊度量和缓存的路由暴露机制，该方法减少了不必要的重传，提升了带宽效率和连接建立速度，在高节点密度场景下的仿真结果表明性能显著提升。

ABSTRACT

Mobile Ad-hoc Network (MANET) is the self organizing collection of mobile nodes. The communication in MANET is done via a wireless media. Ad hoc wireless networks have massive commercial and military potential because of their mobility support. Due to demanding real time multimedia applications, Quality of Services (QoS) support in such infrastructure less networks have become essential. QoS routing in mobile Ad-Hoc networks is challenging due to rapid change in network topology. In this paper, we focused to reduce flooding performance of the Fisheye State Routing (FSR) protocol in Grid using ns-2 network simulator under different performance metrics scenario in respect to number of Nodes. For example, the connection establishment is costly in terms of time and resource where the network is mostly affected by connection request flooding. The proposed approach presents a way to reduce flooding in MANETs. Flooding is dictated by the propagation of connection-request packets from the source to its neighborhood nodes. The proposed architecture embarks on the concept of sharing neighborhood information. The proposed approach focuses on exposing its neighborhood peer to another node that is referred to as its friend-node, which had requested/forwarded connection request. If there is a high probability for the friend node to communicate through the exposed routes, this could improve the efficacy of bandwidth utilization by reducing flooding, as the routes have been acquired, without any broadcasts. Friendship between nodes is quantized based on empirical computations and heuristic algorithms. The nodes store the neighborhood information in their cache that is periodically verified for consistency. Simulation results show the performance of this proposed method.

研究动机与目标

• 为解决由于频繁的连接请求广播导致的鱼眼状态路由（FSR）在MANET中出现的高泛洪开销问题。
• 在动态、无基础设施的移动网络中提升带宽利用率并减少连接建立延迟。
• 探索基于节点关系的智能、概率性重传在减少广播风暴方面的可行性。
• 评估邻近信息共享和基于友谊的转发对MANET中路由性能的影响。

提出的方法

• 所提出的方法引入了‘好友节点’概念，节点通过与可信对等节点共享其邻近信息，以避免冗余的重传。
• 节点之间的友谊关系通过基于通信模式和距离的实证计算与启发式算法进行量化。
• 每个节点缓存邻近信息，并定期验证其一致性，以维持路由的准确性。
• 应用概率性重传机制：仅当好友节点具有高成功率完成路由传输时，节点才转发连接请求。
• 该方法与网格FSR协议集成，其中节点被组织为网格结构，以实现路由状态的局部化并减少泛洪范围。
• 在ns-2中进行仿真，以评估在不同节点数量和流量条件下的性能表现。

实验结果

研究问题

• RQ1 基于节点友谊的概率性重传在网格FSR中如何减少MANET的泛洪？
• RQ2 缓存的邻近信息对连接建立延迟和带宽使用有何影响？
• RQ3 基于启发式的友谊度量对路由效率和可靠性有何影响？
• RQ4 在高节点密度条件下，控制开销减少和QoS提升方面取得了哪些性能增益？

主要发现

• 与传统FSR相比，所提方法在高节点密度环境中显著减少了重传次数。
• 由于网络中泛洪的控制包减少，连接建立延迟得以降低。
• 通过可信好友节点预先暴露路由信息，带宽利用率得到提升，冗余传输被最小化。
• 启发式友谊模型通过优先选择可靠且频繁通信的对等节点，提高了路由成功交付的可能性。
• 仿真结果表明，在动态拓扑变化下，网络的可扩展性和稳定性均有明显提升。