Time Validity-Based Message Transmission for College Activities

  • Neeraj Garg
  • J. S. Lather
  • S. K. Dhurandher
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 18)


As the existence of an end-to-end connected path between the sender and the receiver is not possible but still opportunistic networks (OppNets), look into that aspect of finding a path after considering some parameters like joining frequency of same nodes, distance from most frequented nodes (most reliable) to the destination, etc. We are looking into this connection between nodes, from college campus point of view. So routing in this type of scenario networks (campus) is different from the traditional mobile networks. Here intermittent nodes between source and destination play a vital role to decide the validity of message so as to transmit it to a destination within time validity limit. Routes are constructed dynamically as the source node or an intermediate node will choose any node, as next hop from a group of nearby neighbors depending upon (some parameter matched in the message body header of sender node by using utility metric calculated in that situation). In this paper, we had proposed a novel college campus-based timely validated message routing (CCTVMR) protocol. The proposed protocol will be compared with the all other routing protocols, prophet, epidemic, and HiBOp, on basis of some parameters. The CCTVMR protocol is introduced to address the message-passing problem in college campus network where speedily information delivery is important for students and teachers and thus fast delivery of messages was exchanged as delivery probability of spray and wait routing is best for our scenario between faculty and students and direct delivery routing protocol outperforms others in hop count (least).


Opportunistic network (opponents) Delay-tolerant networks (DTN) ONE Routing Disconnections Message 


  1. 1.
    L. Lilien, Z.H. Kamal, V. Base, A. Gupta, Opportunistic networks: the concept and research challenges in privacy and security, in Proceedings Of NSF Intl. Workshop on Research Challenges in Security and Privacy for Mobile and Wireless Networks (WSPWN 2006), Miami, March 2006, pp. 134–147Google Scholar
  2. 2.
    K. Fall, A delay-tolerant network architecture for challenged internets, in Proceedings of ACM SIGCOMM 2003, Karlsruhe, 25–29 August 2003, pp. 27–34Google Scholar
  3. 3.
  4. 4.
    S. Burleigh July 2004 A. Hooke Expires January 2005 L. Torgerson NASA/Jet Propulsion Laboratory. DTNRG Chair DTN Research Group V. Cerf INTERNET-DRAFT MCI/Jet Propulsion Laboratory. Versions: 00 01 02 03 04 05 06 07 08 RFC 4838
  5. 5.
  6. 6.
    L. Pelusi, A. Passarella, M. Conti, Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun. Mag. 44(11), 134–141 (2006)CrossRefGoogle Scholar
  7. 7.
    S.K. Dhurandher, D.K. Sharma, I. Woungang, H.C. Chao, Performance evaluation of various routing protocols in opportunistic networks, in Proceedings of IEEE GLOBECOM Workshop 2011, Houston, 5–9 December 2011, pp. 1067–1071Google Scholar
  8. 8.
    S. Okasha, Altruism, group selection, and correlated interaction. Br. J. Philos. Sci. 56(4), 703–725 (2005)CrossRefGoogle Scholar
  9. 9.
    P. Bose, P. Morin, I. Stojmenovic, J. Urrutia, Routing with guaranteed delivery in ad hoc wireless networks, in Proc. of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM ‘99), Seattle, 20 August 1999, pp. 48–55Google Scholar
  10. 10.
    J. Gao, L. Guibas, J. Hershberger, L. Zhang, A. Zhu, Geometric spanner for routing in mobile networks, in Proc. of the 2nd ACM International Symposium on Mobile Ad Hoc. Networking & Computing (MobiHoc ‘01), Long Beach, 04–05 October 2001, pp. 45–55Google Scholar
  11. 11.
    Y.J. Kim, R. Govindan, B. Karp, S. Shenker, Geographic routing made practical, in Proceedings of the 2nd Conference on Symposium on Networked Systems Design & Implementation – Vol. 2, San Jose, 2005, pp. 217–230Google Scholar
  12. 12.
    A. Vahdat, D. Becker, Epidemic Routing for Partially Connected Ad Hoc Networks, Technical Report CS-2000-06 (Dept. of Computer Science, Duke University, Durham, 2000)Google Scholar
  13. 13.
  14. 14.
    S.K. Dhurandher, D.K. Sharma, I. Woungang, S. Bhati, HBPR: history based prediction for routing in infrastructure-less opportunistic networks, in Proc. of 27th IEEE AINA 2013, Barcelona, 2013, pp. 931–936Google Scholar
  15. 15.
    M. Musolesi, S. Hailes, C. Mascolo, Adaptive routing for intermittently connected mobile ad hoc network, in Proceeding of Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Network (WOWMOM '05), Taormina- Giardini Naxos, 13–16 June 2005, pp 183–189Google Scholar
  16. 16.
    A. Lindgren, A. Doria, O. Schelen, Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mob. Comput. Commun. Rev 7(3), 19–20 (2003)CrossRefGoogle Scholar
  17. 17.
    C. Boldrini, M. Conti, I. Iacopini, A. Passarella, HiBOp: A history based routing protocol for opportunistic networks, in Proceedings of IEEE International Symposium on World of Wireless, Mobile and Multimedia Networks, 2007 (WoWMoM 2007), Espoo, 18–21 June 2007, pp. 1–12Google Scholar
  18. 18.
    C.E. Perkins, P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computer, in Proceedings of the conference on Communications architectures, protocols and application (SIGCOMM’94), London, August 1994, pp. 234–244Google Scholar
  19. 19.
    H. Takagi, L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans. Commun. 32(3), 246–257 (1984)CrossRefGoogle Scholar
  20. 20.
    A. Keranen, T. Kärkkäinen, J. Ott, Simulating mobility and DTNs with the ONE. J. Commun 5, 92–105 (2010)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Neeraj Garg
    • 1
  • J. S. Lather
    • 2
  • S. K. Dhurandher
    • 3
  1. 1.Department of Computer Science EngineeringMAITNew DelhiIndia
  2. 2.Department of Electrical and Electronics EngineeringNIT KurukshetraKurukshetraIndia
  3. 3.CAITFS, Division of Information Technology, Netaji Subhas Institute of TechnologyUniversity of DelhiNew DelhiIndia

Personalised recommendations