Next Article in Journal
A Hierarchical Mapping System for Flat Identifier to Locator Resolution Based on Active Degree
Previous Article in Journal
Joint AP Association and Bandwidth Allocation Optimization Algorithm in High-Dense WLANs
Article Menu
Issue 8 (August) cover image

Export Article

Open AccessArticle
Future Internet 2018, 10(8), 74; https://doi.org/10.3390/fi10080074

Predict and Forward: An Efficient Routing-Delivery Scheme Based on Node Profile in Opportunistic Networks

1,2
,
1,2,* , 1,2
,
1,2
and
1,2
1
School of Software, Central South University, Changsha 410075, China
2
“Mobile Health” Ministry of Education-China Mobile Joint Laboratory, Changsha 410083, China
*
Author to whom correspondence should be addressed.
Received: 26 June 2018 / Revised: 26 July 2018 / Accepted: 4 August 2018 / Published: 6 August 2018
Full-Text   |   PDF [1268 KB, uploaded 6 August 2018]   |  

Abstract

In the social scene of opportunistic networks, message applications find suitable relay nodes or certain transmission destinations from the surrounding neighbors through specific network addresses of users. However, at the dawn of big data and 5G networks, the variational location information of nodes is difficult to be available to mobile devices all the time, and a long wait for the destination may cause severe end-to-end delay. To improve the transmission environment, this study constructs an efficient routing-delivery scheme (Predict and Forward) based on node profile for the opportunistic networks. The node profile effectively characterizes nodes by analyzing and comparing their attributes instead of network addresses, such as physical characteristics, places of residence, workplaces, occupations or hobbies. According to the optimal stopping theory, this algorithm implements the optimal transmission for Prelearn messages by dividing the complex data transmission process into two different phases (Predict and Forward). Through simulations and the comparison of routing algorithms in opportunistic networks, the proposed strategy increases the delivery ratio by 80% with the traditional methods on average, and the average end-to-end delay in this algorithm is the lowest. View Full-Text
Keywords: opportunistic network; node profile; routing algorithm; node meeting; data transmission opportunistic network; node profile; routing algorithm; node meeting; data transmission
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Liu, K.; Chen, Z.; Wu, J.; Xiao, Y.; Zhang, H. Predict and Forward: An Efficient Routing-Delivery Scheme Based on Node Profile in Opportunistic Networks. Future Internet 2018, 10, 74.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Future Internet EISSN 1999-5903 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top