Trajectory optimization of packet ferries in sparse mobile social networks

Xin Guan, Min Chen, Cong Liu, Hongyang Chen, Tomoaki Ohtsuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

In sparse mobile social networks, the moving activity of nodes always happen in a specific area, which corresponds to some specific community. How to guarantee the higher packet delivery ratio while reducing forwarding delay in such networks, is a challenging issue and has not been widely investigated yet. Recently, additional super-node was introduced to ferry packets between the isolated areas. However, most existing solutions assume the super-node is always moving according to the fixed trajectory. In this paper, we put some special mobile nodes in the networks, they are called postmen, and their responsibility is to carry packets for normal nodes which belong to specific communities. Our work focus on the optimization of the moving trajectory by considering the minimum transmission delay. We formulate the optimal issue into semi-Markov Decision Process model. The decision process includes two parts: Packets-choosing strategy and trajectory of packet-ferrying-determination strategy. By maximizing the individual reward of a postman, its optimal trajectory will be found. Furthermore, the proposed solution guarantees the packet delivery ratio and delay for isolated communities. Simulation results show that the proposed packet-ferrying solution outperforms two existing ferrying solutions in terms of packet delivery ratio.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
DOIs
Publication statusPublished - 2011
Event54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States
Duration: 2011 Dec 52011 Dec 9

Other

Other54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
CountryUnited States
CityHouston, TX
Period11/12/511/12/9

Fingerprint

Trajectories

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Guan, X., Chen, M., Liu, C., Chen, H., & Ohtsuki, T. (2011). Trajectory optimization of packet ferries in sparse mobile social networks. In GLOBECOM - IEEE Global Telecommunications Conference [6134185] https://doi.org/10.1109/GLOCOM.2011.6134185

Trajectory optimization of packet ferries in sparse mobile social networks. / Guan, Xin; Chen, Min; Liu, Cong; Chen, Hongyang; Ohtsuki, Tomoaki.

GLOBECOM - IEEE Global Telecommunications Conference. 2011. 6134185.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Guan, X, Chen, M, Liu, C, Chen, H & Ohtsuki, T 2011, Trajectory optimization of packet ferries in sparse mobile social networks. in GLOBECOM - IEEE Global Telecommunications Conference., 6134185, 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011, Houston, TX, United States, 11/12/5. https://doi.org/10.1109/GLOCOM.2011.6134185
Guan X, Chen M, Liu C, Chen H, Ohtsuki T. Trajectory optimization of packet ferries in sparse mobile social networks. In GLOBECOM - IEEE Global Telecommunications Conference. 2011. 6134185 https://doi.org/10.1109/GLOCOM.2011.6134185
Guan, Xin ; Chen, Min ; Liu, Cong ; Chen, Hongyang ; Ohtsuki, Tomoaki. / Trajectory optimization of packet ferries in sparse mobile social networks. GLOBECOM - IEEE Global Telecommunications Conference. 2011.
@inproceedings{bf2a0d57c1924e8888865cb005ca976f,
title = "Trajectory optimization of packet ferries in sparse mobile social networks",
abstract = "In sparse mobile social networks, the moving activity of nodes always happen in a specific area, which corresponds to some specific community. How to guarantee the higher packet delivery ratio while reducing forwarding delay in such networks, is a challenging issue and has not been widely investigated yet. Recently, additional super-node was introduced to ferry packets between the isolated areas. However, most existing solutions assume the super-node is always moving according to the fixed trajectory. In this paper, we put some special mobile nodes in the networks, they are called postmen, and their responsibility is to carry packets for normal nodes which belong to specific communities. Our work focus on the optimization of the moving trajectory by considering the minimum transmission delay. We formulate the optimal issue into semi-Markov Decision Process model. The decision process includes two parts: Packets-choosing strategy and trajectory of packet-ferrying-determination strategy. By maximizing the individual reward of a postman, its optimal trajectory will be found. Furthermore, the proposed solution guarantees the packet delivery ratio and delay for isolated communities. Simulation results show that the proposed packet-ferrying solution outperforms two existing ferrying solutions in terms of packet delivery ratio.",
author = "Xin Guan and Min Chen and Cong Liu and Hongyang Chen and Tomoaki Ohtsuki",
year = "2011",
doi = "10.1109/GLOCOM.2011.6134185",
language = "English",
isbn = "9781424492688",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Trajectory optimization of packet ferries in sparse mobile social networks

AU - Guan, Xin

AU - Chen, Min

AU - Liu, Cong

AU - Chen, Hongyang

AU - Ohtsuki, Tomoaki

PY - 2011

Y1 - 2011

N2 - In sparse mobile social networks, the moving activity of nodes always happen in a specific area, which corresponds to some specific community. How to guarantee the higher packet delivery ratio while reducing forwarding delay in such networks, is a challenging issue and has not been widely investigated yet. Recently, additional super-node was introduced to ferry packets between the isolated areas. However, most existing solutions assume the super-node is always moving according to the fixed trajectory. In this paper, we put some special mobile nodes in the networks, they are called postmen, and their responsibility is to carry packets for normal nodes which belong to specific communities. Our work focus on the optimization of the moving trajectory by considering the minimum transmission delay. We formulate the optimal issue into semi-Markov Decision Process model. The decision process includes two parts: Packets-choosing strategy and trajectory of packet-ferrying-determination strategy. By maximizing the individual reward of a postman, its optimal trajectory will be found. Furthermore, the proposed solution guarantees the packet delivery ratio and delay for isolated communities. Simulation results show that the proposed packet-ferrying solution outperforms two existing ferrying solutions in terms of packet delivery ratio.

AB - In sparse mobile social networks, the moving activity of nodes always happen in a specific area, which corresponds to some specific community. How to guarantee the higher packet delivery ratio while reducing forwarding delay in such networks, is a challenging issue and has not been widely investigated yet. Recently, additional super-node was introduced to ferry packets between the isolated areas. However, most existing solutions assume the super-node is always moving according to the fixed trajectory. In this paper, we put some special mobile nodes in the networks, they are called postmen, and their responsibility is to carry packets for normal nodes which belong to specific communities. Our work focus on the optimization of the moving trajectory by considering the minimum transmission delay. We formulate the optimal issue into semi-Markov Decision Process model. The decision process includes two parts: Packets-choosing strategy and trajectory of packet-ferrying-determination strategy. By maximizing the individual reward of a postman, its optimal trajectory will be found. Furthermore, the proposed solution guarantees the packet delivery ratio and delay for isolated communities. Simulation results show that the proposed packet-ferrying solution outperforms two existing ferrying solutions in terms of packet delivery ratio.

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

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

U2 - 10.1109/GLOCOM.2011.6134185

DO - 10.1109/GLOCOM.2011.6134185

M3 - Conference contribution

SN - 9781424492688

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -