University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Converge-and-diverge: A geographic routing for delay/disruption-tolerant networks using a delegation replication approach

Cao, Y, Sun, Zhili, Wang, Ning, Yao, F and Cruickshank, Haitham (2013) Converge-and-diverge: A geographic routing for delay/disruption-tolerant networks using a delegation replication approach IEEE Transactions on Vehicular Technology, 62 (5). pp. 2339-2343.

[img] Text
06409476.pdf - ["content_typename_Published version (Publisher's proof or final PDF)" not defined]
Restricted to Repository staff only
Available under License : See the attached licence file.

Download (433kB)
[img] Text (licence)
SRI_deposit_agreement.pdf
Restricted to Repository staff only
Available under License : See the attached licence file.

Download (33kB)

Abstract

Routing in delay/disruption-tolerant networks (DTNs) is without the assumption of contemporaneous end-to-end connectivity to relay messages. Geographic routing is an alternative approach using real-time geographic information instead of network topology information. However, if considering the mobility of destination, its real-time geographic information is often unavailable due to sparse network density in DTNs. Using historical geographic information to overcome this problem, we propose the converge-and-diverge (CaD) by combining two routing phases that depend on the proximity to the movement range estimated for destination. The key insight is to promote message replication converging to the edge of this range and diverging to the entire area of this range to achieve fast delivery, given limited message lifetime. Furthermore, the concept of delegation replication (DR) is explored to overcome the limitation of routing decisions and the local maximum problem. Evaluation results under the Helsinki city scenario show an improvement of CaD in terms of delivery ratio, average delivery latency, and overhead ratio. Since geographic routing in DTNs has not received much attention, apart from the design of CaD, our novelty also focuses on exploring DR to overcome the limitation of routing decision and the local maximum problem, in addition to enhancing efficiency, as DR originally intended. © 1967-2012 IEEE.

Item Type: Article
Authors :
NameEmailORCID
Cao, YUNSPECIFIEDUNSPECIFIED
Sun, ZhiliZ.Sun@surrey.ac.ukUNSPECIFIED
Wang, NingN.Wang@surrey.ac.ukUNSPECIFIED
Yao, FUNSPECIFIEDUNSPECIFIED
Cruickshank, HaithamH.Cruickshank@surrey.ac.ukUNSPECIFIED
Date : 2013
Identification Number : 10.1109/TVT.2013.2238958
Depositing User : Symplectic Elements
Date Deposited : 28 Mar 2017 10:51
Last Modified : 31 Oct 2017 17:13
URI: http://epubs.surrey.ac.uk/id/eprint/806793

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800