Abstract
Much of the schemes for Multipoint Relay (MPR) selection in wireless ad hoc networks have been studied using the unit graph model, under the assumption that packets are always received without any error. As this model does not reflect the real scenario of transmissions, recent studies propose heuristics which enable selecting MPR under realistic assumptions. For this, they use redundancy to maximize the probability of delivery. But redundancy can increase the size of the MPR set, and therefore generating amounts of retransmissions and collisions, which can lead to degradation of the MPR protocol performance. Using reversible marking, a mechanism we presented in a previous study, we propose two heuristics which efficiently compute MPR. One of them resorts to redundancy and both compute a MPR set which size is at most log m greater than the optimum.
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
Corson, M.S., Macker, J.: Mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations. IETF, RFC 2501 (1999)
ETSI STC-RES10 Committee, Radio equipment and systems: High performance radio local area network (hyperlan) type 1, functional specifications. ETS 300-652 (June 1996)
Jacquet, P., Minet, P., Muhlethaler, P., Riviere, N.: Increasing reliability in cable- free radio lans: Low level forwarding in hiperlan. Wireless Personal Communications (January 1997)
Laouiti, A., Qayyum, A., Viennot, L.: Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks. In: HICSS 2001, 35th Annual Hawaii International Conference on System Sciences (2001)
Adjih, C., Jacquet, P., Viennot, L.: Computing connected dominated sets with multipoint relays. Ad Hoc & Sensor Wireless Networks (March 2005)
Garey, M.R., Johnson, D.S.: Computers and intractability. A Guide to the Theory of NP-Completeness. Freeman, Oxford (1979)
Stojmenovic, I., Nayak, A., Kuruvila, J.: Design Guidelines for Routing Protocols in Ad Hoc and Sensor Networks with a realistic Physical layer. IEEE Communication Magazine 43(3), 101–106 (2005)
Ingelrest, F., Simplot-Ryl, D.: Maximizing the Probability of Delivery of Multipoint Relay Broadcast Protocol in Wireless Ad Hoc Networks with a Realistic Physical Layer. In: Cao, J., Stojmenovic, I., Jia, X., Das, S.K. (eds.) MSN 2006. LNCS, vol. 4325, pp. 143–154. Springer, Heidelberg (2006)
Gantsou, D., Sondi, P., Said, H.: Revisiting Multipoint Relay Selection in Optimal Link State Routing Protocol. Submitted for Publication in International Journal of Communication Networks and Distributed System
Härri, J., Bonnet, C., Filali, F.: OLSR and MPR: mutual dependences and performances. In: Med-Hoc Net 2005, 4th IFIP Mediterranean Ad Hoc Networking Workshop, Île de Porquerolls, France, June 21-24 (2005)
Wang, Z., Crowcroft, J.: Quality of Service Routing for Supporting Multimedia Applications. IEEE Journal of Selected Areas in Communications 14(7) (1996)
Ge, Y., Kunz, T., Lamont, L.: Proactive QoS Routing in Ad Hoc Networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, pp. 60–71. Springer, Heidelberg (2003)
Clausen, T., Jacquet, P.: Optimized Link State Routing Protocol (OLSR). RFC 3626, IETF (October 2003)
ILOG. CPLEX 9.0, user’s manual (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gantsou, D., Sondi, P. (2007). Efficient Selection of Multipoint Relays in Wireless Ad Hoc Networks with Realistic Physical Layer. In: Fdida, S., Sugiura, K. (eds) Sustainable Internet. AINTEC 2007. Lecture Notes in Computer Science, vol 4866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76809-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-76809-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76808-1
Online ISBN: 978-3-540-76809-8
eBook Packages: Computer ScienceComputer Science (R0)