On efficient data transport with mobile carriers

Jung Ryu; Lei Ying; Sanjay Shakkottai

doi:10.1109/JSAC.2011.111209

On efficient data transport with mobile carriers

Jung Ryu, Lei Ying, Sanjay Shakkottai

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

In this paper, we consider a network of stationary nodes that rely on mobile nodes to transport data between them. We assume the mobile nodes can control their mobility pattern to respond to traffic loads, as well as satisfy some other secondary objectives, such as surveillance requirements. We study this problem in the framework of cost minimization, where we derive a dual iterative algorithm that results in optimal mobility pattern for minimizing network wide cost. We then implement our proposed algorithm and evaluate its performance on a testbed.

Original language	English (US)
Article number	6081352
Pages (from-to)	1991-2001
Number of pages	11
Journal	IEEE Journal on Selected Areas in Communications
Volume	29
Issue number	10
DOIs	https://doi.org/10.1109/JSAC.2011.111209
State	Published - Dec 2011
Externally published	Yes

Keywords

Disruption tolerant networking
Mobile carriers
Mobility control
Network optimization
Routing

ASJC Scopus subject areas

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/JSAC.2011.111209

Cite this

@article{9967e137e88a4af9ade66fc7d2aa4209,

title = "On efficient data transport with mobile carriers",

abstract = "In this paper, we consider a network of stationary nodes that rely on mobile nodes to transport data between them. We assume the mobile nodes can control their mobility pattern to respond to traffic loads, as well as satisfy some other secondary objectives, such as surveillance requirements. We study this problem in the framework of cost minimization, where we derive a dual iterative algorithm that results in optimal mobility pattern for minimizing network wide cost. We then implement our proposed algorithm and evaluate its performance on a testbed.",

keywords = "Disruption tolerant networking, Mobile carriers, Mobility control, Network optimization, Routing",

author = "Jung Ryu and Lei Ying and Sanjay Shakkottai",

note = "Funding Information: IX. ACKNOWLEDGMENTS The authors would like to express their gratitude to Prof. Christine Julien and Prof. Sriram Vishwanath for permitting the use of the Pharos testbed [34], [36] to generate the experimental results presented in this paper. We acknowledge the support of NSF Grant CNS-0721380 and CNS-0953165, the DARPA ITMANET program, and the DTRA grants HDTRA1-08-1-0016 and HDTRA1-09-1-0055 ∑ConsiderAthPPEe LNDIXy∑apunA:ov PfunctROOFionOFVT(kHE) =l,jOR∑EM1(ql,j(k))2 + l′(Ql′(k))2+κ j(wj(k))2.DefineΔV(k)=V(k+1)− V (k). Note that",

year = "2011",

month = dec,

doi = "10.1109/JSAC.2011.111209",

language = "English (US)",

volume = "29",

pages = "1991--2001",

journal = "IEEE Journal on Selected Areas in Communications",

issn = "0733-8716",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

T1 - On efficient data transport with mobile carriers

AU - Ryu, Jung

AU - Ying, Lei

AU - Shakkottai, Sanjay

N1 - Funding Information: IX. ACKNOWLEDGMENTS The authors would like to express their gratitude to Prof. Christine Julien and Prof. Sriram Vishwanath for permitting the use of the Pharos testbed [34], [36] to generate the experimental results presented in this paper. We acknowledge the support of NSF Grant CNS-0721380 and CNS-0953165, the DARPA ITMANET program, and the DTRA grants HDTRA1-08-1-0016 and HDTRA1-09-1-0055 ∑ConsiderAthPPEe LNDIXy∑apunA:ov PfunctROOFionOFVT(kHE) =l,jOR∑EM1(ql,j(k))2 + l′(Ql′(k))2+κ j(wj(k))2.DefineΔV(k)=V(k+1)− V (k). Note that

PY - 2011/12

Y1 - 2011/12

N2 - In this paper, we consider a network of stationary nodes that rely on mobile nodes to transport data between them. We assume the mobile nodes can control their mobility pattern to respond to traffic loads, as well as satisfy some other secondary objectives, such as surveillance requirements. We study this problem in the framework of cost minimization, where we derive a dual iterative algorithm that results in optimal mobility pattern for minimizing network wide cost. We then implement our proposed algorithm and evaluate its performance on a testbed.

AB - In this paper, we consider a network of stationary nodes that rely on mobile nodes to transport data between them. We assume the mobile nodes can control their mobility pattern to respond to traffic loads, as well as satisfy some other secondary objectives, such as surveillance requirements. We study this problem in the framework of cost minimization, where we derive a dual iterative algorithm that results in optimal mobility pattern for minimizing network wide cost. We then implement our proposed algorithm and evaluate its performance on a testbed.

KW - Disruption tolerant networking

KW - Mobile carriers

KW - Mobility control

KW - Network optimization

KW - Routing

UR - http://www.scopus.com/inward/record.url?scp=82055163089&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=82055163089&partnerID=8YFLogxK

U2 - 10.1109/JSAC.2011.111209

DO - 10.1109/JSAC.2011.111209

M3 - Article

AN - SCOPUS:82055163089

SN - 0733-8716

VL - 29

SP - 1991

EP - 2001

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

IS - 10

M1 - 6081352

ER -

On efficient data transport with mobile carriers

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this