Abstract
This paper presents the research work addressing optimal secure and protected Multicasting in wired and wireless Hierarchical Sensor Networks (HSN). The multicast nodes in a hierarchical set up are associated with” Importance values” that are normalized into probabilities. The security constraint imposed is associated with the concept of “Prefix-free paths” in the associated graph. The optimality constraint is to minimize the average path length based on hop count from root node to multicast nodes. The paper also discusses doubly optimal secure multicasting. A practical Hierarchical Sensor Network is described. Some conditions for satisfying the Kraft inequality are also discussed.
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 callMore From: International Journal of Wireless Networks and Broadband Technologies
Disclaimer: 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.
