Download now Free registration required
Multicast routing protocols in wireless sensor networks are required for sending the same message to multiple different destinations. In this paper, the authors propose two different distributed algorithms for multicast routing in wireless sensor networks which make use of location information of sensor nodes. The authors' first algorithm groups the destination nodes according to their angular positions and forwards the multicast message toward each group in order to reduce the number of total branches in multicast tree which also reduces the number of messages transmitted. Their second algorithm calculates an Euclidean minimum spanning tree at the source node by using the positions of the destination nodes.
- Format: PDF
- Size: 1070.2 KB