Call for Paper - November 2020 Edition
IJCA solicits original research papers for the November 2020 Edition. Last date of manuscript submission is October 20, 2020. Read More

Counterfeit Avoidance using Mark-Time Protocol in Mobile Networks

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2016
P.P. Joby, M. Lavanya, C. Lincy Magdaline

P P Joby, M Lavanya and Lincy C Magdaline. Article: Counterfeit Avoidance using Mark-Time Protocol in Mobile Networks. International Journal of Computer Applications 137(9):15-18, March 2016. Published by Foundation of Computer Science (FCS), NY, USA. BibTeX

	author = {P.P. Joby and M. Lavanya and C. Lincy Magdaline},
	title = {Article: Counterfeit Avoidance using Mark-Time Protocol in Mobile Networks},
	journal = {International Journal of Computer Applications},
	year = {2016},
	volume = {137},
	number = {9},
	pages = {15-18},
	month = {March},
	note = {Published by Foundation of Computer Science (FCS), NY, USA}


Keeping a track of the nodes through which the packets are sent, the retransmission of packets within the network can be avoided. A new protocol called the MARK-TIME protocol is introduced to track the information and store it in common at the base station of the network. The distance of the node in the network is calculated along with the path, is used to transmit the message packets within the network. The detail of the packets and the path along which the data is transmitted is stored in the proxy server at the base station. In the case of delay or loss in communication, due to mobility of nodes in the network, it leads to loss of the receiving packets in the receiver (sink node). It sends a message to the proxy server, which tracks the node and provides efficient transmission without duplication of packets within the mobile network.


  1. V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, and H.Weiss,“Delaytolerantnetworking architecture,” Network Working Group RFC 4838, Apr. 2007.
  2. K. Fall, “A delay-tolerant network architecture for challenged internets,” in Proceedings of Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, ser. SIGCOMM ’03, Aug. 2003, pp. 27–34.
  3. Q. Fu, L. Zhang, W. Feng, and Y. Zheng, “Dawn: A density adaptive routing algorithm for vehicular delay tolerant sensor networks,” in Annual Allerton Conference on Communication, Control, and Computing (Allerton), Sept. 2011, pp. 1250–1257.
  4. K. Scott, T. Refaei, N. Trivedi, J. Trinh, and J. Macker, “Robust communications for disconnected, intermittent, lowbandwidth (dil) environments,” in Military Communications Conference (MILCOM), Nov. 2011, pp. 1009–1014.
  5. Y. Zhuang, J. Pan, Y. Luo, and L. Cai, “Time and locationcritical emergency message dissemination for vehicular ad-hoc networks,” IEEE Journal on Selected Areas in Communications, vol. 29, no. 1, pp. 187–196, Jan. 2011.
  6. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and wait: An efficient routing scheme for intermittently connected mobile networks,” in Proceedings of the ACM SIGCOMM workshop on Delay-tolerant networking (WDTN), Aug. 2005, pp. 252–259.
  7. Z. Feng and K.-W. Chin, “A unified study of epidemic routing protocols and their enhancements,” in IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), May 2012, pp. 1484–1493.
  8. A. Lindgren, A. Dpria, E. Davies, and S. Grasic, “Probabilistic routing protocol for intermittently connected networks,” Internet Research Task Force (IRTF) RFC 6693, pp. 1–112, Aug. 2012.
  9. A. Balasubramanian, B. N. Levine, and A. Venkataramani, “Replication routing in dtns: A resource allocation approach,” IEEE/ACM Transactions on Networking, vol. 18, no. 2, pp.596–609, April 2010.
  10. X. Ma, “Coupling degree seeking based routing strategy for delay tolerant networks,” in International Conference on Signal Processing Systems (ICSPS), vol. 1.
  11. P.P. Joby, Sengottuvelan, " A Localised clustering scheme to detect attacks in wireless sensor Networks" International journal of electronic security and digital forensics, vol 7, No.3,2015.
  12. X. Wang, Y. Shu, Z. Jin, and H. Chen, “Directional forward routing for disruption tolerant networks,” in Asia-Pacific Conference on Communications (APCC), Oct. 2009, pp. 355–358.
  13. A. Bujari, C. Palazzi, D. Maggiorini, C. Quadri, and G. Rossi, “A solution for mobile dtn in a real urban scenario,” in IEEE Wireless Communications and Networking Conference Workshops (WCNCW), Apr. 2012, pp. 344–349.
  14. D. Hua, X. Du, Y. Qian, and S. Yan, “A dtn routing protocol based on hierarchy forwarding and cluster control,” in International Conference on Computational Intelligence and Security (CIS),vol.2.
  15. P.P. Joby, Sengottuvelan, "A survey on threats and security schemes in wireless sensor Networks", International journal of engineering research and apllications vol 5, issue 1,pp 89-94 2015.
  16. H. Mei, P. Jiang, and J. Bigham, “Augmenting coverage in a cellular network with dtn routing,” in IEEE Wireless Communications and Networking Conference (WCNC),Mar.2011,pp.516–521.
  17. M. Haibo, J. Peng, and J. Bigham, “Augment delay tolerant networking routing to extend wireless network coverage,” in International Conference on Wireless Communications and Signal Processing (WCSP),Nov.2011,pp.1–5.
  18. S.-H. Kim and S. jae Han, “Contour routing for peer-to-peer dtn delivery in cellular networks,” in International Conference on Communication Systems and Networks (COMSNETS),Jan.2012,pp.1–9.
  19. W. Jianjian and W. Ronghui, “A routing algorithm based on energy constraint,” in International Conference on Computer Research and Development (ICCRD), vol. 2, Mar. 2011, pp.330–332.
  20. Q. He, Y. Li, and X. Fan, “A study on buffer efficiency and surround routing strategy in delay tolerant network,” in IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC), Dec. 2009, pp. 566–570.


MTP-Mark- Time Protocol, SnW-Spray and Wait, BSN-Binary Spray and Wait, PROPHET-Probabilistic Routing Protocol using History Encounter and Transitivity.