AN APPROACH ON CLUSTER-BASED ROUTING PROTOCOL FOR DELAY-TOLERANT MOBILE NETWORKS(DTMNS)
Abstract
In proposed paper distributed clustering scheme and proposes a cluster-based routing protocol for Delay- Tolerant 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 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.Downloads
Published
Issue
Section
License
COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY
 All paper submissions must carry the following duly signed by all the authors:
“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.â€