Maximizing the Probability of Delivery of Multipoint Relay Broadcast Protocol in Wireless Ad Hoc Networks with a Realistic Physical Layer
Ingelrest, Simplot-Ryl
network routing multicast ad hoc manet mpr smf
@inproceedings{ingelrest:msn-2006,
title={Maximizing the Probability of Delivery of Multipoint Relay Broadcast
Protocol in Wireless Ad Hoc Networks with a Realistic Physical Layer},
author={Ingelrest, F. and Simplot-Ryl, D.},
booktitle={Mobile Ad-hoc and Sensor Networks},
pages={143--154},
year={2006},
publisher={Springer-Verlag}
}
Maximizing the Probability of Delivery of Multipoint Relay Broadcast Protocol in Wireless Ad Hoc Networks with a Realistic Physical Layer. Ingelrest, Simplot-Ryl. Mobile Ad-hoc and Sensor Networks (MSN 2006)
- Previous analysis of MPR was based on unit disk graph, which yields unrealistic results
- As long range links have same probability in the model, they are generally chosen since they have the most coverage
- This leads to many failures in actuality, since success may not be very probable
- Often better to choice more relays and shorter links to provide higher probability of success
- Low error rates can be addressed with correcting codes; otherwise more or re- transmissions are required
- Goal: Maximize coverage, minimize # or relays
- Accomplished by changing MPR step 2 heuristic to one of three (third is best):
- Weight coverage of relay by the probability of it receiving the message
- Probability of successful transmit to relay weighted by average probability of successful relay
- Do the same, but don't just set a node as covered when a relay has been chosen; choose redundant relays until node is covered beyond some threshold probability of success
- Simulations done using approximation of lognormal shadowing model
- Unit disk model results in optimizing over hops
- Lognormal shadowing results in optimizing over expected throughput
- Chooses somewhat more relay nodes, but has much higher coverage under more realistic model
- Good references to follow up on in this