Email this article A Mobility Prediction Algorithm To Estimate The Contact Opportunities For Smartphone Users
Abstract
The objective is to consent users to issue queries for content stored on other smart phones wherever in the network and to measure the chances of obtaining the information needed. We take for granted that smart phones can carry out searches on their local storage and we find the appropriate results for a given query to make easy searching. In our work we inspect a network of smart phones with the deliberation that Smartphone carriers expend most of their time indoors where GPS cannot be accessed. Previous research shows that GPS signal is available for 4.5 percent only of a typical user’s day. Therefore we require designing a system to support location-based services in indoor environments. As well as the methods decrease resource consumption by sufficiently choosing the number of message replicas. However most of the existing prediction-based schemes focus on the prediction of whether two nodes would encounter each other in the prospect and not on when they would encounter each other again. Still the prediction of encounter opportunities based on the encounter history of nodes is not optimal due to missing communication opportunities.
Keywords
References
T3I Group LLC, http://www.telecomweb.com, 2010.
A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks,” technical report, Dept. of Computer Science, Duke Univ., Sept. 2000.
A. Balasubramanian, B.N. Levine, and A. Venkataramani, “DTN Routing as a Resource Allocation Problem,” Proc. ACM SIGCOMM, pp. 373-384, 2007.
R.C. Shah, S. Roy, S. Jain, and W. Brunette, “Data Mules: Modeling a Three-Tier Architecture for Sparse Sensor Networks,” Elsevier Ad Hoc Networks J., vol. 1, pp. 215-233, Sept. 2003.
A. Lindgren, A. Doria, and O. Schelen, “Probabilistic Routing in Intermittently Connected Networks,” SIGMOBILE Mobile Computer Comm. Rev., vol. 7, no. 3, pp. 19-20, 2003.
C. Liu and J. Wu, “An Optimal Probabilistic Forwarding Protocol in Delay Tolerant Networks,” Proc. ACM MobiHoc, pp. 14, 2009.
J. Wu, M. Lu, and F. Li, “Utility-Based Opportunistic Routing in Multi-Hop Wireless Networks,” Proc. 28th Int’l Conf. Distributed Computing Systems (ICDCS ’08), pp. 470-477, 2008.
T. Spyropoulos, K. Psounis, and C.S. Raghavendra, “Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks,” Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN ’05), pp. 252-259, 2005.
T. Spyropoulos, K. Psounis, and C. Raghavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case,” IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 63-76, Feb. 2008.
T. Spyropoulos, K. Psounis, and C.S. Raghavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case,” IEEE/ACM Trans. Networking, vol. 16, pp. 77-90, Feb. 2008.
I. Cardei, C. Liu, J. Wu, and Q. Yuan, “DTN Routing with Probabilistic Trajectory Prediction,” Proc. Third Int’l Conf. Wireless Algorithms, Systems, and Applications (WASA ’08,), pp. 40-51, 2008.
Q. Yuan, I. Cardei, and J. Wu, “Predict and Relay: An Efficient Routing in Disruption-Tolerant Networks,” Proc. 10th ACM MobiHoc, pp. 95-104, 2009.
E.M. Daly and M. Haahr, “Social Network Analysis for Routing in Disconnected Delay-tolerant MANETs,” Proc. Eighth ACM MobiHoc, pp. 32-40, 2007.
N.B. Chang and M. Liu, “Controlled Flooding Search in a Large Network,” IEEE/ACM Trans. Networking, vol. 15, no. 2, pp. 436- 449, Apr. 2007.
C. Avin and C. Brito, “Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques,” Proc. Third Int’l Symp. Information Processing in Sensor Networks (IPSN ’04), pp. 277-286, 2004.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.