Abstract
Several routing schemes have been proposed for intermittently connected mobile networks. In these schemes, a node carries a message and forwards the message to another node when they meet. To increase the delivery success rate and reduce the message delivery delay, the node to forward the message is selected based on such criteria as the probability that the node is likely to meet the destination. However, even if a node is suitable under such criteria, the contact duration may be too short to complete the message forwarding, which is called 'forwarding failure' in this paper. The risk of forwarding failure due to link disconnection during transmission has been mostly ignored in the existing routing schemes. In this paper we focus on avoiding forwarding failure. To this end, a large message is divided into smaller fragments, and we present a mathematical model to derive the optimal fragment size that minimizes message delivery delay. We then present a run-time algorithm which determines whether a current message fragment should be forwarded to a node encountered. Contact duration with the candidate node is estimated for this decision. Delayed forwarding and transmission power adjustment is incorporated into this algorithm to enhance energy efficiency of message forwarding. The benefits and feasibility of the proposed scheme are extensively evaluated by simulations and experiments.
| Original language | English |
|---|---|
| Pages (from-to) | 38-54 |
| Number of pages | 17 |
| Journal | Computer Networks |
| Volume | 64 |
| DOIs | |
| Publication status | Published - 2014 May 8 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
Cite this
}
Use of contact duration for message forwarding in intermittently connected mobile networks. / Kim, Sun Hyun; Jeong, Yeonsik; Han, Seung Jae.
In: Computer Networks, Vol. 64, 08.05.2014, p. 38-54.Research output: Contribution to journal › Article
TY - JOUR
T1 - Use of contact duration for message forwarding in intermittently connected mobile networks
AU - Kim, Sun Hyun
AU - Jeong, Yeonsik
AU - Han, Seung Jae
PY - 2014/5/8
Y1 - 2014/5/8
N2 - Several routing schemes have been proposed for intermittently connected mobile networks. In these schemes, a node carries a message and forwards the message to another node when they meet. To increase the delivery success rate and reduce the message delivery delay, the node to forward the message is selected based on such criteria as the probability that the node is likely to meet the destination. However, even if a node is suitable under such criteria, the contact duration may be too short to complete the message forwarding, which is called 'forwarding failure' in this paper. The risk of forwarding failure due to link disconnection during transmission has been mostly ignored in the existing routing schemes. In this paper we focus on avoiding forwarding failure. To this end, a large message is divided into smaller fragments, and we present a mathematical model to derive the optimal fragment size that minimizes message delivery delay. We then present a run-time algorithm which determines whether a current message fragment should be forwarded to a node encountered. Contact duration with the candidate node is estimated for this decision. Delayed forwarding and transmission power adjustment is incorporated into this algorithm to enhance energy efficiency of message forwarding. The benefits and feasibility of the proposed scheme are extensively evaluated by simulations and experiments.
AB - Several routing schemes have been proposed for intermittently connected mobile networks. In these schemes, a node carries a message and forwards the message to another node when they meet. To increase the delivery success rate and reduce the message delivery delay, the node to forward the message is selected based on such criteria as the probability that the node is likely to meet the destination. However, even if a node is suitable under such criteria, the contact duration may be too short to complete the message forwarding, which is called 'forwarding failure' in this paper. The risk of forwarding failure due to link disconnection during transmission has been mostly ignored in the existing routing schemes. In this paper we focus on avoiding forwarding failure. To this end, a large message is divided into smaller fragments, and we present a mathematical model to derive the optimal fragment size that minimizes message delivery delay. We then present a run-time algorithm which determines whether a current message fragment should be forwarded to a node encountered. Contact duration with the candidate node is estimated for this decision. Delayed forwarding and transmission power adjustment is incorporated into this algorithm to enhance energy efficiency of message forwarding. The benefits and feasibility of the proposed scheme are extensively evaluated by simulations and experiments.
UR - http://www.scopus.com/inward/record.url?scp=84894587560&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84894587560&partnerID=8YFLogxK
U2 - 10.1016/j.comnet.2014.01.007
DO - 10.1016/j.comnet.2014.01.007
M3 - Article
AN - SCOPUS:84894587560
VL - 64
SP - 38
EP - 54
JO - Computer Networks
JF - Computer Networks
SN - 1389-1286
ER -