Abstract
Communicating the information between different people distributed over various geographical locations is a very difficult task, especially in sparse and highly crowded areas. Sparse areas lack regular network and follow highly intermittent connectivity, whereas overcrowded areas contain overlapped bandwidth. Opportunistic network (Oppnet) has the solution to all the above problem. In oppnet to overcome the problem node does not have to depends on the regular network. Source node who want to send the message to the destination forward the message to the node who have similar mobility patterns like that of source and destination. We design small routing protocol based mobility pattern that helps in control the message generation, message deletion, aborting of the message and save the network with the overcrowded message. It also helps in quick transfer of the message. This is implemented over the One simulator.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kumar, S., Paul, S., Amar, A.K.: Communication in vehicular cloud network using ns-3. Int. J. Control Theory Appl. 10 (2017). ISSN 974-5572
Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. Division of Computer Science and Networking, Department of Computer Science and Electrical Engineering, Lule University of Technology, SE - 971 87 Luleå, Sweden. Electronics and Telecommunications Research Institute (ETRI), 161 Gajeong-don, Yuseong-GU, Daejeon 305-350, Korea (2003)
Verma, A., Srivastava, D.: Integrated routing protocol for opportunistic networks. Int. J. Adv. Comput. Sci. Appl. 2(3) (2011)
Vahdat, A., Becker, D.: Epidemic routing for partially-connected ad hoc networks. Technical report CS-200006, Duke University, April 2000
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility. In: Proceedings of the Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW 2007) 0-7695-2788-4/07 (2007)
Woungang, I., Dhurandher, S.K., Anpalagan, A., Vasilakos, A.V.: Routimg in opportunity networks. https://doi.org/10.1007/978-1-4614-3514-3. ISBN 978-1-4614-3513-6
Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. In: Dini, P., Lorenz, P., de Souza, J.N. (eds.) SAPIR 2004. LNCS, vol. 3126, pp. 239–254. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27767-5_24
Burns, B., Brock, O., Levine, B.N.: MV routing and capacity building in disruption tolerant networks. This research was supported in part by National Science Foundation award. ANI-0133055 and EIA-0080199 (2005)
Burgess, J., Gallagher, B., Jensen, D., Levine, B.N.: MaxProp: routing for vehicle-based disruption-tolerant networks. DARPA contract C-36-B82-S1 and in part by National Science Foundation awards CNS-0519881, EIA-0080199 (2006)
Costantino, G., Maiti, R., Martinelli, F., Santi, P.: Private mobility-cast for opportunistic networks. Comput. Netw. 120, 28–42 (2017). https://doi.org/10.1016/j.comnet.2017.04.010. ISSN 1389-1286
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Kumar, B., Suman, R.R., Kumar Singh, B. (2019). Frequency of Meeting with Node and Visit to Physical Location Based on Mobility Pattern. In: Verma, S., Tomar, R., Chaurasia, B., Singh, V., Abawajy, J. (eds) Communication, Networks and Computing. CNC 2018. Communications in Computer and Information Science, vol 839. Springer, Singapore. https://doi.org/10.1007/978-981-13-2372-0_4
Download citation
DOI: https://doi.org/10.1007/978-981-13-2372-0_4
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2371-3
Online ISBN: 978-981-13-2372-0
eBook Packages: Computer ScienceComputer Science (R0)