IDEAS home Printed from https://ideas.repec.org/a/igg/jwnbt0/v2y2012i4p51-63.html
   My bibliography  Save this article

Doubly Optimal Secure and Protected Multicasting in Hierarchical Sensor Networks

Author

Listed:
  • Samdarshi Abhijeet

    (International Institute of Information Technology, Hyderabad, Andhra Pradesh, India)

  • Garimella Rama Murthy

    (International Institute of Information Technology, Hyderabad, Andhra Pradesh, India)

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.

Suggested Citation

  • Samdarshi Abhijeet & Garimella Rama Murthy, 2012. "Doubly Optimal Secure and Protected Multicasting in Hierarchical Sensor Networks," International Journal of Wireless Networks and Broadband Technologies (IJWNBT), IGI Global, vol. 2(4), pages 51-63, October.
    • Handle: RePEc:igg:jwnbt0:v:2:y:2012:i:4:p:51-63
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijwnbt.2012100104
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jwnbt0:v:2:y:2012:i:4:p:51-63. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.