A data transmission scheme for community-based opportunistic networks

Authors:
Jianwei Niu;Xing Zhou;Kongqiao Wang;Jian Ma
Affiliations:
School of Computer Science and Engineering, Beihang University, Beijing, China;School of Computer Science and Engineering, Beihang University, Beijing, China;Nokia Research Center, Beijing, China;Nokia Research Center, Beijing, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 7
Cited 1

Probabilistic routing in intermittently connected networks

ACM SIGMOBILE Mobile Computing and Communications Review
Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Performance analysis of mobility-assisted routing

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A community based mobility model for ad hoc network research

REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility

PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Efficient routing in intermittently connected mobile networks: the multiple-copy case

IEEE/ACM Transactions on Networking (TON)
Bubble rap: social-based forwarding in delay tolerant networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing

Exploiting mobility diversity in sharing wireless access: a game theoretic approach

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Opportunistic network that consists of mobile devices carried by social people is called community based opportunistic network (CON) which has community characteristics. Currently prevalent multi-copy routing algorithms in opportunistic networks have not considered these characteristics, therefore when these algorithms are used in CON, they will lead to high transmission delay and packet loss rate. This paper proposes a Community-based Data Transmission Scheme (CDTS) to solve these problems. CDTS organizes all nodes into different communities based on the contact frequency between nodes. CDTS adaptively adjusts the number of data copies in the network and data can be transmitted to target community mainly relying on active nodes. Simulation results show that CDTS can achieve satisfying data delivery ratio in community-based opportunistic networks and reduces the data forwarding times by 19.4% to 24.7%.