In this article, we investigate a distributed clustering scheme and a cluster-based routing protocol for delay-tolerant mobile networks. The basic idea is to distributively group mobile nodes that have similar mobility pattern into a cluster, which can then interchangeably share their resources such as buffer space for overhead reduction and load balancing. Due to the lack of continuous communications and possible errors in the estimation of nodal contact probability, convergence and stability become major challenges in such cluster formation. In our algorithm, an exponentially weighted moving average (EWMA) scheme is employed for on-line updating the nodal contact probability, with its mean proven to converge to the true contact probability. Based on the local information, a set of functions including Sync(), Leave(), and Join() is devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing.
[1]
Cauligi S. Raghavendra,et al.
Performance analysis of mobility-assisted routing
,
2006,
MobiHoc '06.
[2]
David Kotz,et al.
Extracting a Mobility Model from Real User Traces
,
2006,
Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[3]
Anders Lindgren,et al.
Probabilistic Routing in Intermittently Connected Networks
,
2004,
SAPIR.
[4]
Zygmunt J. Haas,et al.
The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way)
,
2003,
MobiHoc '03.
[5]
Hongyi Wu,et al.
Protocol Design and Optimization for Delay/Fault-Tolerant Mobile Sensor Networks
,
2007,
27th International Conference on Distributed Computing Systems (ICDCS '07).