Clustering and cluster-based routing protocol for delay-tolerant mobile networks

This research investigates distributed clustering scheme and proposes a cluster-based routing protocol for DelayTolerant Mobile Networks (DTMNs). The basic idea is to distributively 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 efcient 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 ga...

• Type: Journal
• Year: 2010
• Where: TWC
• Authors: Ha Dang, Hongyi Wu
• Keywords: Artificial Intelligence, Cluster-based Routing Protocol, Nodal Contact, Nodal Contact Probability, TWC 2010