PPMA, a probabilistic predictive multicast algorithm for ad hoc networks

Ad Hoc Networks

Volumn 4, Issue 6, 2006, Pages 724-748

  Pompili, Dario ^a   Vittucci, Marco ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Ad hoc multicast; MANET; Mobility prediction; Performance; Route stability; Tree robustness

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; COMPUTER SIMULATION; ENERGY UTILIZATION; MULTICASTING; PREDICTIVE CONTROL SYSTEMS; TELECOMMUNICATION LINKS; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC MULTICAST; MANET; MOBILITY PREDICTION; ROUTE STABILITY; TREE ROBUSTNESS;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 33747114956     PISSN: 15708705     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.adhoc.2005.09.001     Document Type: Article

References (19)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows: Theory, Algorithms, and Applications (1993), Prentice Hall
2. Akyildiz I.F., Lin Y.B., Lai W.R., and Chen R.J. A new random walk model for PCS networks. IEEE Journal on Selected Areas in Communications 18 7 (2000) 1254-1260
3. Cheng C., Riley R., Kumar S.P.R., and Garcia-Luna-Aceves J.J. A loop-free Bellman-Ford routing protocol without bouncing effect. Proceedings of ACM SIGMETRICS'89, Oakland, California, USA, September 1989 (1989), ACM Press 224-237
4. A.J. Goldsmith, Variable-rate variable-power MQAM for fading channels, in: Proceedings of IEEE Vehicular Technology Conference, Atlanta, GA, USA, April 1996, pp. 815-819. URL citeseer.ist.psu.edu/goldsmith97variablerate.html.
5. Goldsmith A.J., and Chua S.-G. Variable-rate variable-power MQAM for fading channels. IEEE Transactions on Communications 45 10 (1997) 1218-1230
6. C. Gui, P. Mohapatra, Efficient overlay multicast for mobile ad hoc networks, in: Proceedings of IEEE WCNC'03, New Orleans, Luoisiana, USA, March 2003.
7. C. Gui, P. Mohapatra, Scalable multicasting in mobile ad hoc networks, in: Proceedings of IEEE INFOCOM'04, Hong Kong SAR, PRC, March 2004.
8. W. Heinzelman, Application-specific protocol architectures for wireless networks. Ph.d. thesis, Massachusetts Institute of Technology, 2000. URL .
9. Heinzelman W.B., Chandrakasan A., and Balakrishnan H. An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications 1 4 (2002) 660-670
10. A.B. McDonald, T.F. Znati, A path availability model for wireless ad-hoc networks, in: Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), New Orleans, Luoisiana, USA, September 1999.
11. McDonald A.B., and Znati T.F. Predicting node proximity in ad-hoc networks: a least overhead adaptive model for selecting stable routes. Proceedings of the 1st ACM International Symposium on Mobile Ad Hoc Networking & Computing (2000), IEEE Press, Boston, MA, USA 29-33
12. T. Melodia, D. Pompili, I.F. Akyildiz, Optimal local topology knowledge for energy efficient geographical routing in sensor networks, in: Proceedings of IEEE INFOCOM 2004, Hong Kong SAR, PRC, March 2004.
13. D. Pompili, L. Lopez, C. Scoglio, DIMRO, A DiffServ-integrated multicast algorithm for Internet resource optimization in source specific multicast applications, in: Proceedings of ICC 2004, Paris, France, June 2004.
14. D. Pompili, M. Vittucci, A probabilistic predictive multicast algorithm in ad hoc networks (PPMA), in: Proceedings of IEEE Med-Hoc-Net 2004, Bodrum, Turkey, June 2004.
15. E.M. Royer, C.E. Perkins, Multicast Operation of the ad-hoc on-demand distance vector routing protocol, in: Mobile Computing and Networking (MOBICOM), August 1999, pp. 207-218. URL .
16. Sahasrabuddhe L.H., and Mukherjee B. Multicast routing algorithms and protocols: a tutorial. IEEE Network 14 1 (2000) 90-102
17. Sajama S., and Haas Z.J. Independent-tree ad hoc multicast routing (ITAMAR). Mobile Networks & Applications 8 5 (2003) 551-566.
18. Takahashi H., and Matsuyama A. An approximate solution for the Steiner problem in graphs. Mathematica Japonica 6 (1980) 573-577
19. Wong R.T. A dual ascent approach for Steiner tree problems on a directed graph. Mathematical Programming 28 (1984) 271-287