Abstract
In order for mobile ad-hoc networks (manets) to be a viable alternative to infrastructured wired and wireless networks, efficient reliable multicast protocols need to be established. In this paper, we propose a Robust Multicast Routing algorithm (RoMR), for ad-hoc networks. In order to increase reliability, RoMR builds multiple trees from a sender to each of the receivers in the multicast group. A novel technique to predict the likelihood that a link will continue to exist into the next time span is based on successive power levels of the received signal from neighboring nodes. These predictions are used during the creation of the multicast trees. Another unique aspect of RoMR is that links that are predicted to be less prone to failure than other links may be shared among several trees. Forward error correcting coding techniques reduce the total number of extra packets added to the original data packets from the source into the network increasing the efficiency of protocol.
Original language | English |
---|---|
Article number | STQSM05 |
Pages (from-to) | 4693-4699 |
Number of pages | 7 |
Journal | Proceedings of the Hawaii International Conference on System Sciences |
Volume | 37 |
Publication status | Published - 2004 |
Externally published | Yes |
Event | Proceedings of the Hawaii International Conference on System Sciences - Big Island, HI., United States Duration: Jan 5 2004 → Jan 8 2004 |
ASJC Scopus subject areas
- General Computer Science