Abstract
Multicast routing protocols in wireless sensor networks are required for sending the same message to multiple different destinations. In this paper, we propose two different distributed algorithms for multicast routing in wireless sensor networks which make use of location information of sensor nodes. Our 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. Our second algorithm calculates an Euclidean minimum spanning tree at the source node by using the positions of the destination nodes. The multicast message is forwarded to destination nodes according to the calculated MST. This helps in reducing the total energy consumed for delivering the message to all destinations by decreasing the number of total transmissions. Evaluation results show that the algorithms we propose are scalable and energy efficient, so they are good candidates to be used for multicasting in wireless sensor networks.
Highlights
Nowadays, low-cost tiny sensor nodes which communicate over wireless channels have become available due to advances in hardware technology
The algorithms we propose in this paper are LocationBased Multicasting with Direction (LBM-D) and LocationBased Multicasting according to Minimum Spanning Tree (LBM-MST)
In this paper we propose two location-based multicast routing algorithms for wireless sensor networks, namely LBM-D and LBM-MST
Summary
Low-cost tiny sensor nodes which communicate over wireless channels have become available due to advances in hardware technology. With cooperation of sensor nodes, data from the monitored region can be gathered to a base station [1]. Data dissemination includes the process of routing the queries or data into the sensor network, while data gathering consists of collecting data sensed by the nodes and delivering it to a base station. The algorithms we propose in this paper are LocationBased Multicasting with Direction (LBM-D) and LocationBased Multicasting according to Minimum Spanning Tree (LBM-MST). As it is common for most location-based routing algorithms, we assume that all nodes in the network know their own locations and their neighbors’ locations. Simulation results show that our proposed algorithms perform well and can be used as location-based multicasting protocols for wireless sensor networks.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
