Clustering and Cluster-Based Routing Protocol for Delay-Tolerant Mobile Networks
Clustering and Cluster-Based Routing Protocol for Delay-Tolerant Mobile Networks
复制标题
DOI：
10.1109/twc.2010.06.081216
复制
发表时间：
2010-06-01
影响因子：
10.4
通讯作者：
Wu, Hongyi
中科院分区：
文献类型：
--
作者：
Dang, Ha;Wu, Hongyi
本研究针对延迟容忍移动的网路，探讨分散式分群机制，并提出一个以分群为基础的路由协定。该算法的基本思想是将具有相似移动模式的移动的节点按一定的比例组成一个簇，簇内的节点可以相互共享资源（如缓存空间），以减少开销和均衡负载，从而实现DTMN中高效、可扩展的路由选择。由于移动的节点之间缺乏连续的通信以及节点接触概率估计中可能出现的误差，DTMN中的分布式分簇算法的收敛性和稳定性成为主要的挑战。为此，指数加权移动平均（EWMA）格式被用于在线更新节点接触概率，其平均值被证明收敛到真实的接触概率。基于节点接触概率，设计了一组包括Sync（）、Leave（）和Join（）的函数用于簇形成和网关选择。最后，网关节点交换网络信息并执行路由。大量的模拟进行评估的有效性和效率的建议基于簇的路由协议。仿真结果表明，与非分簇算法相比，该算法具有更高的投递率、更低的开销和端到端延迟。
This research investigates distributed clustering scheme and proposes a cluster-based routing protocol for Delay-Tolerant Mobile Networks (DTMNs). The basic idea is to dis-tributively group mobile nodes with similar mobility pattern into a cluster, which can then interchangeably share their resources (such as buffer space) for overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Due to the lack of continuous communications among mobile nodes and possible errors in the estimation of nodal contact probability, convergence and stability become major challenges in distributed clustering in DTMN. To this end, an exponentially weighted moving average (EWMA) scheme is employed for on-line updating nodal contact probability, with its mean proven to converge to the true contact probability. Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing. Extensive simulations are carried out to evaluate the effectiveness and efficiency of the proposed cluster-based routing protocol. The simulation results show that it achieves higher delivery ratio and significantly lower overhead and end-to-end delay compared with its non-clustering counterpart.