Journal Home > Volume 22 , Issue 3
Tsinghua Science and Technology 2017, 22(3): 243-253 https://doi.org/10.23919/TST.2017.7914197
Open Access | Issue | Published: 04 May 2017

Geographic Information and Node Selfish-Based Routing Algorithm for Delay Tolerant Networks

Show Author's Information Fang Lu,  Jianbo Li( ),  Shan Jiang,  Youmei Song,  Fushu Wang
College of Computer Science and Technology, Qingdao University, Qingdao 266071, China.
Keywords:
delay tolerant networks, node willingness, routing algorithm, geographic information, forwarding process
Cite this article:
Lu F, Li J, Jiang S, et al. Geographic Information and Node Selfish-Based Routing Algorithm for Delay Tolerant Networks. Tsinghua Science and Technology, 2017, 22(3): 243-253. https://doi.org/10.23919/TST.2017.7914197
Download citation
EndNote(RIS)
BibTeX

457

Views

13

Downloads

Citations

9

Crossref

N/A

WoS

11

Scopus

2

CSCD

Abstract Full text About this article

In Delay Tolerant Networks (DTNs), some routing algorithms ignore that most nodes are selfish, i.e., nodes are willing to use their own resources to forward messages to nodes with whom they have a relationship. In view of this phenomenon, we propose a routing algorithm based on Geographic Information and Node Selfishness (GINS). To choose a forwarding node, GINS combines nodes’ willingness to forward and their geographic information to maximize the possibility of contacting the destination. GINS formulates the message forwarding process as a 0-1 Knapsack Problem with Assignment Restrictions to satisfy node demands for selfishness. Extensive simulations were conducted, and results show that GINS can achieve a high delivery ratio and a lower hop count compared with GRONE and LPHU. Furthermore, its overhead ratio is 25% and 30% less than that of GRONE and LPHU, respectively.


menu
Abstract
Full text
Outline
About this article

Geographic Information and Node Selfish-Based Routing Algorithm for Delay Tolerant Networks

Show Author's information Fang Lu, Jianbo Li( ), Shan Jiang, Youmei Song, Fushu Wang
College of Computer Science and Technology, Qingdao University, Qingdao 266071, China.

Abstract

In Delay Tolerant Networks (DTNs), some routing algorithms ignore that most nodes are selfish, i.e., nodes are willing to use their own resources to forward messages to nodes with whom they have a relationship. In view of this phenomenon, we propose a routing algorithm based on Geographic Information and Node Selfishness (GINS). To choose a forwarding node, GINS combines nodes’ willingness to forward and their geographic information to maximize the possibility of contacting the destination. GINS formulates the message forwarding process as a 0-1 Knapsack Problem with Assignment Restrictions to satisfy node demands for selfishness. Extensive simulations were conducted, and results show that GINS can achieve a high delivery ratio and a lower hop count compared with GRONE and LPHU. Furthermore, its overhead ratio is 25% and 30% less than that of GRONE and LPHU, respectively.

Keywords: delay tolerant networks, node willingness, routing algorithm, geographic information, forwarding process

References(18)

[1]
Soelistijanto B. and Howarth M. P., Transfer reliability and congestion control strategies in opportunistic networks: A survey, IEEE Communications Surveys Tutorials, vol. 64, no. 1, pp. 538-555, 2014.
DOI Google Scholar
[2]
Cha S., Talipov E., and Cha H., Data delivery scheme for intermittently connected mobile sensor networks, Computer Communications, vol. 36, no. 5, pp. 504-519, 2013.
DOI Google Scholar
[3]
Ren Z., Peng S., Chen H., Fang H., and Chen Q., Epidemic routing based on adaptive compression of vectors: Efficient low-delay routing for opportunistic networks based on adaptive compression of vectors, International Journal of Communication Systems, vol. 28, no. 3, pp. 560-573, 2015.
DOI Google Scholar
[4]
Cao Y. and Sun Z., Routing in delay/disruption tolerant networks: A taxonomy, survey and challenges, IEEE Communications Surveys Tutorials, vol. 15, no. 2, p. 654, 2013.
DOI Google Scholar
[5]
Picu A. and Spyropoulos T., Distributed stochastic optimization in opportunistic networks: The case of optimal relay selection, in Proc. 5th ACM Workshop Challenged Netw., Chicago, IL, USA, Sep. 20–24, 2010, p. 2128.
DOI
[6]
Mao Z., Jiang Y., Min G., Leng S., Jin X., and Yang K., Mobile social networks: Design requirement, architecture, and state-of-art technology, Computer Communications, vol. 100, pp. 1-19, 2017.
DOI Google Scholar
[7]
Xiao M., Wu J., and Huang L., Community-aware opportunistic routing in mobile social networks, IEEE Transactions on Computers, vol. 63, no. 7, pp. 1682-1695, 2014.
DOI Google Scholar
[8]
Motani M., Srinivasan V., and Nuggehalli P. S., Peoplenet: Engineering a wireless virtual social network, in Proceedings of the 11th Annual International Conference on Mobile Computing and Networking, MobiCom’05, New York, NY, USA, 2005, pp. 243-257.
DOI
[9]
Sermpezis P. and Spyropoulos T., Understanding the effects of social selfishness on the performance of heterogeneous opportunistic networks, Computer Communications, vol. 48, pp. 71-83, 2014.
DOI Google Scholar
[10]
Ciobanu R.-I., Dober C., Dascalu M., Trǎuşan-Matu Ş., and Cristea V., SENSE: A collaborative selfish node detection and incentive mechanism for opportunistic networks, Journal of Network and Computer Applications, vol. 41, pp. 240-249, 2014.
DOI Google Scholar
[11]
Pan D., Zhang H., and Chen W., Transmission of multimedia contents in opportunistic networks with social selfish nodes, Multimedia Systems, vol. 21, no. 3, pp. 277-288, 2015.
DOI Google Scholar
[12]
Boloni L. and Turgut D., Protecting bridge: Reorganizing sensor networks after catastrophic events, in 2011 7th International Wireless Communications and Mobile Computing Conference, IEEE, 2011, pp. 2028-2033.
DOI
[13]
Xu J., Li J., You L., and Dai C., Lphu: A local position and history utility based routing algorithm for delay tolerant networks, Sensors & Transducers, vol. 157, no. 10, p. 419, 2013.
Google Scholar
[14]
You L., Li J., Wei C., and Dai C., A one-hop information based geographic routing protocol for delay tolerant manets, International Journal of Ad Hoc and Ubiquitous Computing, vol. 20, no. 2, pp. 107-122, 2015.
DOI Google Scholar
[15]
Balasubramanian A., Levine B. N., and Venkataramani A., Replication routing in DTNs: A resource allocation approach, IEEE/ACM Transactions on Networking, vol. 18, no. 2, pp. 596-609, 2010.
DOI Google Scholar
[16]
Martin-Campilo A., Crowcroft J., Yoneki E., and Marti R., Evaluating opportunistic networks in disaster scenarios, Journal of Network and Computer Applications, vol. 36, no. 2, pp. 870-880, 2013.
DOI Google Scholar
[17]
Li Q., Zhu S., and Cao G., Routing in socially selfish delay tolerant networks, in IEEE INFOCOM, 2010.
DOI
[18]
Nelson S. C., Bakht M., and Kravets R., Encounter-based routing in DTNs, in Proceedings of the 28th Conference on Computer Communications(IEEE INFOCOM’09), 2009, pp. 846-854.
DOI
Publication history
Copyright
Acknowledgements
Rights and permissions

Publication history

Received: 16 March 2017
Revised: 23 March 2017
Accepted: 28 March 2017
Published: 04 May 2017
Issue date: June 2017

Copyright

© The authors 2017

Acknowledgements

This research was supported in part by the National Natural Science Foundation of China (Nos. 61502261, 61572457, and 61379132), and the Science and Technology Plan Project for Colleges and Universities of Shandong Province (No. J14LN85).

Rights and permissions

Return