Abstract
Conventional GRID service is static (no mobility), and it has many drawbacks such as continuous connection, waste of bandwidth, and service overloading. Wireless GRID supports mobility, however it should consider geographic position to support efficient resource sharing and routing. When the devices in the GRID are highly mobile, there will be much traffic to exchange the geographic position information of each mobile node, and this makes adverse effect on efficient battery usage. To minimize the network traffic between mobile users, we use dead reckoning algorithm for each mobile nodes, where each node uses the algorithm to estimates its own movement (also other node’s movement), and when the estimation error is over threshold, the node sends the UPDATE (including position, velocity, etc) packet to other devices. As the estimation accuracy is increased, each node can minimize the number of UPDATE packet transmission. To improve the prediction accuracy of dead reckoning algorithm, we propose Kalman filter based dead reckoning approach. To experiment our scheme, we implement a popular network game (BZFlag) with our scheme added on each mobile node, and the results show that we can achieve better prediction accuracy and reduction of network traffic by 12 percents.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zhang, W., Zhang, J., Ma, D., Wang, B., Chen, Y.: Key technique research on GRID mobile servie. In: Proc. 2nd Int. Conf. Information Technology (2004)
Gossweiler, R., Laferriere, R.J., Keller, M.L., Pausch, R.: An introductory tutorial for developing multi-user virtual environments. Tele-operators and Virtual Environments 3(4), 255–264 (1994)
Aggarwal, S., Banavar, H., Khandelwal, A., Mukherjee, S., Rangarajan, S.: User experience: accuracy in dead-reckoning based distributed multi-player games. In: Proc. ACM SIGCOMM 2004 Workshops on Net-Games. Network and System Support for Games (2004)
Cai, W., Lee, F.B.S., Chen, L.: An auto-adaptive dead reckoning algorithm for distributed interactive simulation. In: Proc. of the thirteenth Workshop on Parallel and Distributed Simulation (1999)
Welch, G., Bishop, G.: An introduction to the Kalman filters, available in http://www.cs.unc.edu/~welch/Kalman/index.html
Gautier, L., Diot, C.: Design and Evaluation of MiMaze, a Multiplayer Game on the Internet. In: Proc. IEEE Multimedia. ICMCS (1998)
Mauve, M.: Consistency in Replicated Continuous Interactive Media. In: Proc. of the ACM Conference on Computer Supported Cooperative Work, pp. 181–190 (2000)
Singhal, S.K., Cheriton, D.R.: Exploiting Position History for Efficient Remote Rendering in Networked Virtual Reality. Tele-operators and Virtual Environments 4(2), 169–193 (1995)
Schoeneman, C., Riker, T.: BZFlag (Battle Zone capture Flag), available in http://www.bzflag.org
Tseng, Y.-C., Wu, S.-L., Liao, W.-H., Chao, C.-M.: Location awareness in ad hoc wireless mobile networks. IEEE Computer 34(6), 46–52 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, SW., Ko, KH. (2006). Kalman Filter Based Dead Reckoning Algorithm for Minimizing Network Traffic Between Mobile Nodes in Wireless GRID. In: Sha, E., Han, SK., Xu, CZ., Kim, MH., Yang, L.T., Xiao, B. (eds) Embedded and Ubiquitous Computing. EUC 2006. Lecture Notes in Computer Science, vol 4096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802167_18
Download citation
DOI: https://doi.org/10.1007/11802167_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36679-9
Online ISBN: 978-3-540-36681-2
eBook Packages: Computer ScienceComputer Science (R0)