Email this article 
Open Access
Subscription or Fee Access
An Algorithm for Dexterous Scanning Neighbour Devices in Opportunistic Mobile Social Networks
Abstract
In personal mobile devices, information is exchanged between the devices by encountering each other. While, frequent scanning for opportunistic encounters would soon drain the battery on existing devices. We propose a new hybrid algorithm for neighbour discovery called the Amalgam algorithm a combination approach of STAR and PISTONSv2 algorithms. STAR is based on contact probe time, which dynamically selects the probing interval using both the short-term contact history and also the long-term history based on time. PISTONv2 is based on inter probe time calculation, which enables mobile devices dynamically alter the rate when searching for other devices, thus creating a fully decentralized autonomous network and also save energy. By combined approach of STAR and PISTONv2 called Amalgam algorithm which saves power consumptions of a battery and detect more encounters as compared to individual approach of STAR and PISTONv2 algorithm.
Keywords
References
Orlinski, M, Filer, N “Neighbour discovery in opportunistic networks”, Elsevier, Vol. 25, pp. 383-392, 2015.
Motani, M, Srinivasan, V, “Peoplenet: engineering a wireless virtual social network”, in: Proceedings of ACM MobiCom, pp. 243– 257, 2005.
Chaintreau, A, Hui, P, Crowcroft, J, Diot, C, Gass, R, Scott, “ Pocket switched networks: real-world mobility and its consequences for opportunistic forwarding”, Tech. Rep. University of Cambridge, Computer Lab. UCAM-CL-TR-617, ISSN 1476-2986, 2005.
Henderson, T, Kotz, D, “The changing usage of a mature campus-wide wireless network”, Comput. Netw. Vol.52, no.14, pp. 2690–2712, 2008.
Han, B, Hui, P, Kumar, Shao, J, Srinivasan, A, “Mobile data offloading through opportunistic communications and social participation”, IEEE Trans. Mob. Comput. Vol. 11, no. 5, pp. 821– 834, 2012.
McInerney, J, Stein, S, Rogers, A, Jennings, N, “Breaking the habit: measuring and predicting departures from routine in individual human mobility”, Pervasive Mob. Comput. Vol.9, pp.808–822, 2013.
Kandhalu, A, Lakshmanan, K, Rajkumar, R, “U-connect: a low-latency energy-efficient asynchronous neighbor discovery protocol”, in: Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks, ACM, New York, NY, USA, Vol. 2015, pp.350–361, 2010.
Orlinski, M, Filer, N, “Movement speed based inter-probe times for neighbour discovery in mobile ad-hoc networks”, Ad Hoc Networks, Springer, Paris, France, vol. 111, 2012.
Wang, W, Motani, M, Srinivasan, V, ”Opportunistic energy-efficient contact probing in delay-tolerant applications”, Trans. Netw. Vol.17, no.5, pp.1592–1605, 2009.
Keranen, A, Ott, J, ”The ONE simulator for DTN protocol evaluation”, in: International Conference on Simulation Tools and Techniques, ICST, Rome, Italy, 2009.
F. Ekman, A. Keranen, J. Karvo, J. Ott, Working day movement model, in: ACM SIGMOBILE Workshop on Mobility Models, Hong Kong, China, pp. 33–40, 2008.
Neha Agrawal, Rajesh singh, “A Survey: Crucial Crime Information Sharing Mechanism Using DTN for Rural Areas”, International Journal of u- and e- Service, Science and Technology, Vol.8, No. 6, pp.79-90, 2015.
Manas kumar yogi , vijayakranthi chinthala, “A Study of Opportunistic Networks for Efficient Ubiquitous Computing”, International Journal of Advanced Research in Computer and Communication Engineering, Vol. 3, Issue 1, pp. 5187-5191, 2014.
X. Zhang, G. Neglia, J. Kurose, D. Towsley, Performance modeling of epidemic routing, Comput. Netw. Vol. 51, Issue. 10, pp. 827–839, 2006.
Navdeep Kaur, “An Introduction to Wireless Mobile Social Networking in Opportunistic Communication”, International Journal of Distributed and Parallel Systems , Vol.4, No.3, pp.73-84, 2013.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.