Efficient Selection of Multipoint Relays in Wireless Ad Hoc Networks with Realistic Physical Layer

Authors:
Dhavy Gantsou;Patrick Sondi
Affiliations:
University of Valenciennes, LAMIH/ROI, Le Mont Houy --- ISTV2, 59313 Valenciennes cedex 9, France;University of Valenciennes, LAMIH/ROI, Le Mont Houy --- ISTV2, 59313 Valenciennes cedex 9, France
Venue:
AINTEC '07 Proceedings of the 3rd Asian conference on Internet Engineering: Sustainable Internet
Year:
2007

Citing 5
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Increasing Reliability in Cable-Free Radio LANs Low Level Forwarding in HIPERLAN

Wireless Personal Communications: An International Journal
Revisiting multipoint relay selection in the optimized link state routing protocol

International Journal of Communication Networks and Distributed Systems
Design guidelines for routing protocols in ad hoc and sensor networks with a realistic physical layer

IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Design guidelines for quality of service support in Optimized Link State Routing-based mobile ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

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 mgreater than the optimum.