TY - GEN
T1 - On-demand location aware multicast (OLAM) for ad hoc networks
AU - Basagni, Stefano
AU - Chlamtac, Imrich
AU - Syrotiuk, Violet R.
AU - Talebi, Rodeen
PY - 2000
Y1 - 2000
N2 - This paper introduces OLAM, a novel On-demand Location Aware Multicast protocol for ad hoc networks. The protocol assumes that, through the use of positioning system devices, such as Global Positioning System (GPS) devices, each node knows its own position and the current (global) time, and it is able to efficiently distribute these measures, including its current transmission radius, to all other nodes. As the measures are received, each node updates its local snapshot of the complete network topology. When a packet is to be multicast to a group, a heuristic is then used to locally compute the Steiner (i.e., multicast) tree for the addressed multicast group based on the snapshot rather than maintaining the tree in a distributed manner. The resulting Steiner tree is then optimally encoded by using its unique Prüfer sequence and included along with the packet, extending the length of the header by no more than the header of packets in source routing (unicast) techniques. All local computations are executed using efficient (i.e., polynomial time) algorithms. The protocol has been simulated in ad hoc networks with 30 and 60 nodes and with different multicast group sizes. We show that OLAM delivers packets to all the nodes in a destination group in more than 85% of the cases. Furthermore, compared to flooding, OLAM achieves improvements of up to 50% on multicast completion delay.
AB - This paper introduces OLAM, a novel On-demand Location Aware Multicast protocol for ad hoc networks. The protocol assumes that, through the use of positioning system devices, such as Global Positioning System (GPS) devices, each node knows its own position and the current (global) time, and it is able to efficiently distribute these measures, including its current transmission radius, to all other nodes. As the measures are received, each node updates its local snapshot of the complete network topology. When a packet is to be multicast to a group, a heuristic is then used to locally compute the Steiner (i.e., multicast) tree for the addressed multicast group based on the snapshot rather than maintaining the tree in a distributed manner. The resulting Steiner tree is then optimally encoded by using its unique Prüfer sequence and included along with the packet, extending the length of the header by no more than the header of packets in source routing (unicast) techniques. All local computations are executed using efficient (i.e., polynomial time) algorithms. The protocol has been simulated in ad hoc networks with 30 and 60 nodes and with different multicast group sizes. We show that OLAM delivers packets to all the nodes in a destination group in more than 85% of the cases. Furthermore, compared to flooding, OLAM achieves improvements of up to 50% on multicast completion delay.
UR - http://www.scopus.com/inward/record.url?scp=0034590719&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034590719&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0034590719
SN - 0780365968
SN - 9780780365964
T3 - 2000 IEEE Wireless Communications and Networking Conference
SP - 1323
EP - 1328
BT - 2000 IEEE Wireless Communications and Networking Conference
T2 - 2000 IEEE Wireless Communications and Networking Conference
Y2 - 23 September 2000 through 28 September 2000
ER -