IDEAS home Printed from https://ideas.repec.org/a/igg/jitn00/v7y2015i3p13-35.html
   My bibliography  Save this article

A Benchmarking Algorithm for Maximum Bottleneck Node Trust Score-based Data Gathering Trees in Wireless Sensor Networks

Author

Listed:
  • Natarajan Meghanathan

    (Jackson State University, Flowood, MS, USA)

Abstract

The author proposes a benchmarking algorithm to determine maximum bottleneck node trust score-based data gathering trees (MaxBNT-DG trees) for wireless sensor networks (WSNs) wherein the bottleneck node trust score of a path (minimum trust score for any node on the path, including those of the end nodes) from any node to the root node of the DG tree is the maximum. He compares the performance of the MaxBNT-DG trees with that of the maximum bottleneck link weight-based data gathering trees (MaxBLT-DG trees) for which the bottleneck link trust score (minimum trust score for constituent links) of a path from any node to the root node is the maximum. The author observes the MaxBNT-DG trees to incur a smaller tree diameter, a larger percentage of nodes as leaf nodes and a larger trust score per intermediate node; whereas, the MaxBLT-DG trees incur a lower aggregation delay, indicating a trust-aggregation delay tradeoff in WSNs. The MaxBNT-DG algorithm is also generic and can be extended to any other node criterion like residual energy, wake-up frequency, etc

Suggested Citation

  • Natarajan Meghanathan, 2015. "A Benchmarking Algorithm for Maximum Bottleneck Node Trust Score-based Data Gathering Trees in Wireless Sensor Networks," International Journal of Interdisciplinary Telecommunications and Networking (IJITN), IGI Global, vol. 7(3), pages 13-35, July.
    • Handle: RePEc:igg:jitn00:v:7:y:2015:i:3:p:13-35
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJITN.2015070102
    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:jitn00:v:7:y:2015:i:3:p:13-35. 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.