Abstract
In this chapter, we discuss the improvements multipoint relays may experience by the use of mobility predictions. Multipoint Relaying (MPR) is a technique to reduce the number of redundant retransmissions while diffusing a broadcast message in the network. The algorithm creates a dominating set where only selected nodes are allowed to forward packets. Yet, the election criteria is solely based on instantaneous nodes’ degrees. The network global state is then kept coherent through periodic exchanges of messages. We propose in this chapter a novel heuristic to select kinetic multipoint relays based on nodes’ overall predicted degree in the absence of trajectory changes. Consequently, these exchanges of message may be limited to the instant when unpredicted topology changes happen. Significant reduction in the number of messages are then experienced, yet still keeping a coherent and fully connected multipoint relaying network. Finally, we present some simulation results to illustrate that our approach is similar to the MPR algorithm in terms of network coverage, number of multipoint relays, or flooding capacity, yet with a drastic reduction in the number of messages exchanged during the process.
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
Preview
Unable to display preview. Download preview PDF.
References
Williams, B., Camp, T.: Comparison of broadcasting techniques for mobile ad hoc networks. In: Proc. of the 3rd ACM international symposium on Mobile ad hoc networking & computing (MobiHoc 2002), Switzerland, pp. 194–205 (2002)
Li, X.Y., Stojmenovic, I.: Broadcasting and topology control in wireless ad hoc networks. In: Handbook of Algorithms for Mobile and Wireless Networking and Computing. CRC Press, Boca Raton (to appear)
Laouiti, A., et al.: Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks. In: 35th Annual Hawaii International Conference on System Sciences (HICSS 2001), Hawaii, USA (2001)
Clausen, T., Jacquet, P.: Optimized Link State Routing Protocol (OLSR), Project Hipercom, INRIA, France (October 2003), www.ietf.org/rfc/rfc3626.txt
Bianchi, G.: Performance analysis of the IEEE 802.11 distributed coordination function. IEEE Journal on Selected Areas in Communications 18(3), 535–547 (2000)
Toh, C.-K., Cobb, H., Scott, D.A.: Performance evaluation of battery-life-aware routing schemes for wireless ad hoc networks. In: The 2001 IEEE International Conference on Communications (ICC 2001), June 2001, vol. 9, pp. 2824–2829 (2001)
Gentile, C., Haerri, J., Van Dyck, R.E.: Kinetic minimum-power routing and clustering in mobile ad-hoc networks. In: IEEE Proc. Vehicular Technology Conf. Fall 2002, pp. 1328–1332 (September 2002)
Fontana, R.J., Gunderson, S.J.: Ultra-wideband precision asset location system. In: IEEE Conf. on Ultra Wideband Systems and Technologies, pp. 147–150 (2002)
Gentile, C., Klein-Berndt, L.: Robust Location using System Dynamics and Motion Constraints. In: Proc. of IEEE International Conference on Communications, Paris, June 20-24 (2004)
Haerri, J., Bonnet, C.: A Lower Bound for Vehicles’ Trajectory Duration. In: To be presented in IEEE VTC Fall 2005, Dallas, USA (September 2005)
Blazevic, L., et al.: Self-Organization in Mobile Ad-Hoc Networks: the Approach of Terminodes. IEEE Communications Magazine (June 2001)
Liang, B., Haas, Z.: Predictive distance-based mobility management for pcs networks. In: Proc. IEEE Infocom Conference, pp. 1377–1384 (1999)
Su, W., Lee, S.-J., Gerla, M.: Mobility Prediction in Wireless Networks. In: Proc. of the IEEE Military Communications Conference (Milcom 2005), October 2000, vol. 1, pp. 491–495 (2000)
Haerri, J., Nikaein, N., Bonnet, C.: Trajectory knowledge for improving topology management in mobile ad-hoc networks. In: Proc. of ACM CoNext Conference 2005, Toulouse, France (October 2005)
Haerri, J., Bonnet, C., Filali, F.: OLSR and MPR: Mutual Dependences and Performances. In: Proc. of the 2005 IFIP Med-Hoc-Net Conference, Porquerolles, France (June 2005)
Agarwal, A., Das, S.R.: Dead Reckoning in Mobile Ad-Hoc Networks. In: Proc. of the 2003 IEEE Wireless Communications and Networking Conference (WCNC 2003), New Orleans (March 2003)
Kumar, V., Das, S.R.: Performance of Dead Reckoning-Based Location Service for Mobile Ad Hoc Networks. Wireless Communications and Mobile Computing Journal 4(2), 189–202 (2004)
Tang, J., Xue, G., Zhang, W.: Reliable routing in mobile ad hoc networks based on mobility prediction. In: MASS 2004: IEEE International Conference on Mobile, Ad-Hoc and Sensor Systems, Fort Lauderdale, Florida, USA, October 25-27 (2004)
Son, D., Helmy, A., Krishnamachari, B.: The Effect of Mobility-induced Location Errors on Geographic Routing in Mobile Ad Hoc and Sensor Networks: Analysis and Improvement using Mobility Prediction. IEEE Transactions on Mobile Computing, Special Issue on Mobile Sensor Networks (2004) (to appear 3rd Quarter)
Haerri, J., Fiore, M., Filali, F., Bonnet, C., Chiasserini, C.-F., Casetti, C.: ”A Realistic Mobility Simulator for Vehicular Ad Hoc Networks”, Eurécom Technical Report, Institut Eurécom, France (2005)
Stephanov, I.: CANU Mobility Simulator, http://canu.informatik.uni-stuttgart.de/mobisim/
Helbing, D.: Traffic and Related Self-Driven Many-Particle Systems. Reviews of Modern Physics 73, 1067–1081 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Härri, J., Filali, F., Bonnet, C. (2005). On the Application of Mobility Predictions to Multipoint Relaying in MANETs: Kinetic Multipoint Relays. In: Cho, K., Jacquet, P. (eds) Technologies for Advanced Heterogeneous Networks. AINTEC 2005. Lecture Notes in Computer Science, vol 3837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599593_11
Download citation
DOI: https://doi.org/10.1007/11599593_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30884-3
Online ISBN: 978-3-540-32292-4
eBook Packages: Computer ScienceComputer Science (R0)