Abstract
Recently, wireless sensor networks (WSN) have drawn much research interest. In this paper, we explore the problem of location-aided multicast routing for WSN. A sensor network of nodes with location information and limited energy is considered. As the problem is NP-hard, we propose four heuristic schemas to construct the geomulticast routing tree, namely, single branch regional flooding, single branch multicast tree, cone-based forwarding area multicast tree and MST-based single branch multicast tree. The algorithms of setting up multicast tree, which are distributed and energy efficient, are discussed in detail and compared. Extensive simulations have been conducted to evaluate the performance of the proposed routing schemas. Simulation results have shown that when constructing geographic multicast tree in sensor networks, less messages must be transmitted in our schemas.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
