A Geographic Multicopy Routing Scheme for DTNs With Heterogeneous Mobility
IEEE Systems Journal
Institute of Electrical and Electronics Engineers (IEEE)
© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Previous geographic routing schemes in delay/disruption tolerant networks (DTNs) only consider the homogeneous scenario where nodal mobility is identical. Motivated by this gap, we turn to design a DTN based geographic routing scheme in heterogeneous scenario. Systematically, our target is achieved via two steps: 1) We first propose, “The-best-geographic-relay (TBGR)” routing scheme to relay messages via a limited number of copies, under the homogeneous scenario. We further overcome the local maximum problem of TBGR given a sparse network density, different from those efforts in dense networks like clustered wireless sensor networks. 2) We next extend TBGR for heterogeneous scenario, and propose “the-best-heterogeneity-geographic-relay (TBHGR)” routing scheme considering individual nodal visiting preference (referred to nonidentical nodal mobility). Extensive results under a realistic heterogeneous scenario show the advantage of TBHGR over literature works in terms of reliable message delivery, while with low routing overhead.
This work was supported by National Natural Science of Foundation of China under Grant 61502202, the Priority Academic Program Development of Jiangsu Higher Education Institutions and Jiangsu Collaborative Innovation Centre on Atmospheric Environment and Equipment Technology.
This is the author accepted manuscript. The final version is available from the publisher via the DOI in this record.
Vol. 12 (1), pp. 790 - 801