CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Message Matching-based Artificial Bee Colony based Behaviour Detection in Delay Tolerant Networks

by Srimathi M, Karthigha M
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 114 - Number 16
Year of Publication: 2015
Authors: Srimathi M, Karthigha M
10.5120/20066-2144

Srimathi M, Karthigha M . Message Matching-based Artificial Bee Colony based Behaviour Detection in Delay Tolerant Networks. International Journal of Computer Applications. 114, 16 ( March 2015), 46-51. DOI=10.5120/20066-2144

@article{ 10.5120/20066-2144,
author = { Srimathi M, Karthigha M },
title = { Message Matching-based Artificial Bee Colony based Behaviour Detection in Delay Tolerant Networks },
journal = { International Journal of Computer Applications },
issue_date = { March 2015 },
volume = { 114 },
number = { 16 },
month = { March },
year = { 2015 },
issn = { 0975-8887 },
pages = { 46-51 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume114/number16/20066-2144/ },
doi = { 10.5120/20066-2144 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:52:59.479222+05:30
%A Srimathi M
%A Karthigha M
%T Message Matching-based Artificial Bee Colony based Behaviour Detection in Delay Tolerant Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 114
%N 16
%P 46-51
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Delay Tolerant Networks (DTNs) is a promising current research field that have captured a lot of attention. In DTN, an end-to-end path is not assured and packets are transmitted from a source node to a destination node by the use of store-carry-forward based routing. In case of DTN, a source node or an intermediary node accumulates the packets in its buffer and holds them at the time of moving around in the network. In the majority of routing protocols, each node is necessary to truthfully pass on information. On the other hand, in certain scenarios few nodes possibly will break this principle, and pass on information in a greedy manner with the intention of maximizing their individual gain. The majority of the current security mechanism doesn't depend on the practice of swarm intelligence based process for selection of untrusted nodes and recognizes the behaviour of illegal nodes. With the aim of solving this complication, this work employs the practice of swarm intelligence method, an Artificial Bee Colony (ABC) based greedy behaviour, in order to match the messages where a smart Mobile Trusted Module (MTM) is launched to supervise the forwarding progression of messages buffered in the node for the purpose of preventing the greedy behaviour. The performance of the proposed protocol was assessed in terms of average relay time, average message delivery ratio and reward ratio. Results confirm that the proposed protocol can onsiderably enhance the average message delivery ratio, diminished delay time and condensed packet overhead ratio by properly selecting the threshold values of forwarding counter and threshold hop counter.

References
  1. K. Fall, A delay-tolerant network architecture for challenged internets, in: Proceedings of ACM SIGCOMM, August 2003, pp. 27–34.
  2. V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, E. Travis, H. Weiss, Interplanetary Internet (IPN): Architectural Definition, http://www. ipnsig. org/reports/memo-ipnrg-arch-00. pdf.
  3. J. A. Rice, R. K. Creber, C. L. Fletcher, P. A. Baxley, K. E. Rogers, D. C. Davison, Evolution of Seaweb underwater acoustic networking, in: Proceedings of IEEE Conference of the Oceans on Information Systems and Sciences, September 2000, pp. 2007–2017.
  4. Z. Zhang, "Routing in intermittently connected mobile ad hoc etworks and delay tolerant networks: overview and challenges," IEEE Communications Surveys and Tutorials, vol. 8, no. 1, pp. 24–37, 2006.
  5. P. R. Pereira, A. Casaca, J. J. P. C. Rodrigues, V. N. G. J. Soares, J. Triay, and C. Cervell´o-Pastor, "From delay-tolerant networks to vehicular delay-tolerant networks," IEEE Communications Surveys & Tutorials, vol. 14, no. 4, pp. 1166–1182, 2012.
  6. Y. Cao and Z. Sun, "Routing in delay/disruption tolerant networks: a taxonomy, survey and challenges," IEEE Communications Surveys and Tutorials, vol. 15, no. 2, pp. 654–677, 2013.
  7. X. Zhang, G. Neglia, J. Kurose, and D. Towsley, "Performance modeling of epidemic routing," Computer Networks, vol. 51, no. 10, pp. 2867–2891, 2007.
  8. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Efficient routing in intermittently connected mobile networks: the multiple- copy case," IEEE/ACM Transactions on Networking, vol. 16,no. 1, pp. 77–90, 2008.
  9. A. Lindgren, A. Doria, E. Davies, and S. Grasic, "Probabilistic routing protocol for intermittently connected networks," IETF RFC 6683, August 2012.
  10. F. Li, A. Srinivasan and J. Wu, "Thwarting Blackhole Attacks in Disruption-Tolerant Networks using Encounter Tickets," in Proc. of IEEE INFOCOM'09, 2009.
  11. S. Marti, T. Giuli, K. Lai, M. Baker, Mitigating routing misbehavior in mobile ad hoc networks, in: Proceedings of ACM MobiCom, 2000, pp. 255–265.
  12. S. Buchegger, J. Boudec, Performance analysis of the CONFIDANT protocol: Cooperation of nodes-fairness in dynamic ad-hoc networks, in: Proceedings of IEEE/ACM Workshop on MobiHoc, 2002, pp. 226–236.
  13. H. Zhu, X. Lin, R. Lu, X. Shen, D. Xing, Z. Cao, An opportunistic batch bundle authentication scheme for energy constrained DTNs, in: Proceedings of IEEE INFOCOM, March 2010, pp. 605–613.
  14. V. Srinivasan, P. Nuggehalli, C. Chiasserini, R. Rao, Cooperation in wireless ad hoc networks, in: Proceedings of IEEE INFOCOM, 2003, pp. 808–817.
  15. U. Shevade, H. Song, L. Qiu, Y. Zhang, Incentive-aware routing in DTNs, in: Proceedings of IEEE ICNP, October 2008, pp. 238–247.
  16. J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva. A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In ACM Mobicom, Aug. 1998.
  17. J. Burgess, B. Gallagher, D. Jensen and B. Levine, "MaxProp: Routing for Vehicle-Based DisruptionTolerant Networks," In Proc. IEEE INFOCOM, Apr. 2006.
  18. A. Balasubramanian, B. Neil Levine and A. Venkataramani, "DTN routing as a resource allocation problem," In Proc. ACM SIGCOMM, Aug. 2007.
  19. A. Panagakis, A. Vaios and I. Stavrakakis, "On the Effects of Cooperation in DTNs," In Proc. 2nd International Conference on Communication Systems Software and Middleware (COMSWARE), pp. 1-6, Jan. 2007.
  20. A. Keranen, M. Pitkanen, M. Vuori and J. Ott, "Effect of non-cooperative nodes in mobile DTNs," In Proc. 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), pp. 1-7, Jun. 2011.
  21. N. Suguna and K. G. Thanushkodi, "An Independent Rough Set Approach Hybrid with Artificial Bee Colony Algorithm for Dimensionality Reduction", American Journal of Applied Sciences 8 (3): 261 – 266, 2011.
  22. Li Bao and Jian-chao Zeng, Comparison and Analysis of the Selection Mechanism in the Artificial Bee Colony Algorithm, Proc. IEEE Ninth International Conference on Hybrid Intelligent Systems, 2009
Index Terms

Computer Science
Information Sciences

Keywords

Delay tolerant networks Greedy behaviour Mobile trusted module Artificial Bee Colony (ABC)

Powered by PhDFocusTM