Abstract
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).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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–147
K. Fall, A delay-tolerant network architecture for challenged internets, in Proceedings of ACM SIGCOMM 2003, Karlsruhe, 25–29 August 2003, pp. 27–34
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. https://tools.ietf.org/html/draft-irtf-dtnrg-arch-02. Versions: 00 01 02 03 04 05 06 07 08 RFC 4838
http://delay-tolerant-networks.blogspot.in/p/one-tutorial.html
L. Pelusi, A. Passarella, M. Conti, Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun. Mag. 44(11), 134–141 (2006)
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–1071
S. Okasha, Altruism, group selection, and correlated interaction. Br. J. Philos. Sci. 56(4), 703–725 (2005)
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–55
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–55
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–230
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)
https://www.openstreetmap.org/user/ChristophWeber/diary/15291
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–936
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–189
A. Lindgren, A. Doria, O. Schelen, Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mob. Comput. Commun. Rev 7(3), 19–20 (2003)
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–12
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–244
H. Takagi, L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans. Commun. 32(3), 246–257 (1984)
A. Keranen, T. Kärkkäinen, J. Ott, Simulating mobility and DTNs with the ONE. J. Commun 5, 92–105 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Garg, N., Lather, J.S., Dhurandher, S.K. (2018). Time Validity-Based Message Transmission for College Activities. In: Woungang, I., Dhurandher, S. (eds) International Conference on Wireless, Intelligent, and Distributed Environment for Communication. WIDECOM 2018. Lecture Notes on Data Engineering and Communications Technologies, vol 18. Springer, Cham. https://doi.org/10.1007/978-3-319-75626-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-75626-4_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-75625-7
Online ISBN: 978-3-319-75626-4
eBook Packages: EngineeringEngineering (R0)