MPR-based pruning techniques for Shortest Path Tree computation

@article{Fuertes2010MPRbasedPT,
  title={MPR-based pruning techniques for Shortest Path Tree computation},
  author={Juan Antonio Cordero Fuertes},
  journal={SoftCOM 2010, 18th International Conference on Software, Telecommunications and Computer Networks},
  year={2010},
  pages={240-244}
}
Multi-Point Relaying (MPR) is a well-known relay pruning algorithm that has proved to be useful for efficient dissemination in Mobile Ad hoc Networks (MANETs). But this technique may be useful for other tasks in MANET link-state routing as well. In particular, the approach is attractive for the selection of topology information to be flooded across the network. Requirements for such topology selection are however different from those applying for efficient dissemination, so approaches in such… CONTINUE READING
6 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Alhalimi: Energy-efficient proactive routing in MANET: Energy metrics accuracy

  • R. T. Kunz
  • In Ad Hoc Networks, No
  • 2010
1 Excerpt

The Optimized Link State Routing Protocol version 2. Internet-Draft, draft-ietf-manet-olsrv2-11.txt

  • C. Dearlove, T. Clausen, P. Jacquet
  • IETF. April
  • 2010
2 Excerpts

Laouiti : Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks

  • L. Viennot A. Qayyum, A.
  • Hawaii International Conference in System…
  • 2002

Viennot : RR 4597 , Computing Connected Dominated Sets with Multipoint Relays

  • P. Jacquet C. Adijh, L.
  • INRIA Research Report
  • 2002

Similar Papers

Loading similar papers…