Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
