A MULTI-SCHEME ADAPTIVE ROUTING ALGORTHM BASED ON SPRAY AND WAIT FOR DALAY TOLERANT NETWORKS

Publications

Share / Export Citation / Email / Print / Text size:

International Journal on Smart Sensing and Intelligent Systems

Professor Subhas Chandra Mukhopadhyay

Exeley Inc. (New York)

Subject: Computational Science & Engineering , Engineering, Electrical & Electronic

GET ALERTS

eISSN: 1178-5608

DESCRIPTION

0
Reader(s)
0
Visit(s)
0
Comment(s)
0
Share(s)

VOLUME 8 , ISSUE 4 (December 2015) > List of articles

A MULTI-SCHEME ADAPTIVE ROUTING ALGORTHM BASED ON SPRAY AND WAIT FOR DALAY TOLERANT NETWORKS

Jianbo Li * / Shan Jiang * / Youmei Song * / Jixing Xu * / Yan Wang *

Keywords : Delay Tolerant Networks, routing algorithm, Spray and Wait algorithm, PROPHET, similarity.

Citation Information : International Journal on Smart Sensing and Intelligent Systems. Volume 8, Issue 4, Pages 2,136-2,158, DOI: https://doi.org/10.21307/ijssis-2017-846

License : (CC BY-NC-ND 4.0)

Received Date : 23-August-2015 / Accepted: 11-November-2015 / Published Online: 01-December-2015

ARTICLE

ABSTRACT

Delay tolerant networks (DTNs) are a type of emerging mobile wireless network that experience long delays, intermittent disruption, buffer space and energy limitations, node irregularities and frequent mobility. To this end, many protocols take advantage of the flooding mechanism to increase the probability of successful message transmission. However, sending too many copies of each message may result in large network overhead and communication cost. Based on the Spray and Wait (S&W) algorithm, we propose an improved Adaptive Spray and Wait scheme, named ASW, for different delay tolerant network scenes. In this paper, we define a hybrid utility metric combined with multiple variables, delivery probability and similarity. Then, we distribute message copies in accordance with the proportion of the utility value to optimize the delivery ratio. Extensive simulations have been conducted to verify the efficiency of our proposed algorithm. In addition to the comparison, the results also show that our proposed algorithm achieves a better performance in terms of the delivery ratio and average latency than the other three protocols.

Content not available PDF Share

FIGURES & TABLES

REFERENCES

[1] Fall K, Farrell S (2008) DTN: An architectural retrospective. IEEE Journal on Selected Areas in Communications 26(5):828-836.
[2] Voyiatzis A (2012) A Survey of Delay- and Disruption-Tolerant Networking Applications. Journal of Internet Engineering 5(1).
[3] Zheng Guo, Bing Wang, JunHong Cui (2013) Generic prediction assisted single-copy routing in underwater delay tolerant sensor networks. Ad Hoc Networks 11(3):1136-1149.
[4] Vastardis N., Yang K. (2013) Mobile Social Networks: Architecture, Social Properties, and Key Research Challenges. IEE Communications Surveys & Tutorials 15(3).
[5] Kayastha N., Niyato D., Wang P., et al. (2011) Applications, Architectures, and Protocol Design Issues for Mobile Social Networks: A survey. Proceedings of The IEEE 99(12).
[6] Longxiang Gao, Ming Li, Wanlei Zhou, et al. (2013) Multidimensional Routing Protocol in Human-Associated Delay-Tolerant Networks. IEEE Transactions on Mobile Computing 12(11): 2132-2144.
[7] Soares, Vasco N. G. J., Rodrigues, et al. (2014) GeoSpray: A geographic routing protocol for vehicular delay-tolerant networks. Information Fusion 15(1):102–113.
[8] Smaldone S., Han L., Shankar, P., et al. (2008). Roadspeak: enabling voice chat on roadways using vehicular social networks. SocialNets 43-48.
[9] Kaimin Wei, Renyong Duan, Guangzhou Shi, et al. (2013) Distribution of Inter-Contact Time: An Analysis-Based on Social Relationships. Journal of Communications and Networks 15(5):504-513.
[10] Xia F., Ahmed A.M., Yang L.T., et al. (2014) Exploiting Social Relationship to Enable Efficient Replica Allocation in Ad-hoc Social Networks. IEEE Transactions on Parallel and Distributed Systems 25(12):3167-3176.
[11] Abdelkader T., Naik K., Nayak A., t al. (2013) SGBR: A Routing Protocol for Delay Tolerant Networks Using Social Grouping. IEEE Transactions on Parallel and Distributed Systems 24(12): 2472-2481.
[12] Jie Wu, Yunsheng Wang (2014) Hypercube-Based Multipath Social Feature Routing in Human Contact Networks. IEEE Transactions on Computers 63(2):383-396.
[13] Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks. Duke University Technical Report CS-2000-06.
[14] Lindgren A, Doria A, Schelén O (2003) Probabilistic routing in intermittently connected networks. ACM SIGMOBILE mobile computing and communications review 7: 19-20.
[15] Spyropoulos T, Psounis K, Raghavendra CS (2008) Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions 16: 77-90.
[16] Erramilli V, Crovella M, Chaintreau A, Diot C (2008) Delegation Forwarding. ACM MobiHoc pp: 251-260.
[17] Nelson S C, Bakht M, Kravets R (2009) Encounter-based routing in DTNs. INFOCOM pp: 846-854.
[18] Liu Jieyan, Wu Lei, Gong Haigong (2013) Utility based data gathering in mobile sensor network. International Journal on Smart Sensing and Intelligent Systems VOL. 6, NO. 3, pp. 953-972.
[19] C. Ranhotigamage and S. C. Mukhopadhyay, “Field Trials and Performance Monitoring of Distributed Solar Panels Using a Low Cost Wireless Sensors Network for Domestic Applications”, IEEE Sensors Journal, Vol. 11, No. 10, October 2011, pp. 2583-2590.
[20] Spyropoulos T, Psounis K, Raghavendra CS (2008) Efficient routing in intermittently connected mobile networks: The single-copy case. IEEE/ACM Transactions on Networking 16: 63 –76.
[21] Xu Jia, Feng xin, Wang Ruchuan (2013) Adaptive spray routing for opportunistic networks. International Journal on Smart Sensing and Intelligent Systems VOL. 6, NO. 1, pp. 95-119.
[22] Liben-Nowell D, Kleinberg J (2007) The link prediction problem for social networks. Journal of the American society for information science and technology 58: 1019-1031.
[23] Mei A, Morabito G, Santi P, et al. (2011) Social-aware stateless forwarding in pocket switched networks. IEEE INFOCOM pp: 251-255.
[24] Leguay J, Friedman T, Conan V (2005) DTN routing in a mobility pattern space. ACM SIGCOMM workshop on Delay-tolerant networking pp: 276-283.
[25] Keranen A, Ott J, Karkkainen T (2009) The ONE simulator for DTN protocol evaluation. International Conference on Simulation Tools and Techniques,No.55.

EXTRA FILES

COMMENTS