IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v8y2012i12p290717.html
   My bibliography  Save this article

Ant-Based Transmission Range Assignment Scheme for Energy Hole Problem in Wireless Sensor Networks

Author

Listed:
  • Ming Liu
  • Chao Song

Abstract

We investigate the problem of uneven energy consumption in large-scale many-to-one sensor networks (modeled as concentric coronas) with constant data reporting, which is known as an energy hole around the sink. We conclude that lifetime maximization and the energy hole problem can be solved by searching optimal transmission range for the sensors in each corona and then prove this is an NP-hard optimization problem. In view of the effectiveness of ant colony algorithms in solving combinatorial optimization problems, we propose an ant-based heuristic algorithm (ASTRL) to address the optimal transmission range assignment for the goal of achieving life maximization of sensor networks. Experimentation shows that the performance of ASTRL is very close to the optimal results obtained from exhaustive search method. Furthermore, extensive simulations have also been performed to evaluate the performance of ASTRL using various simulation parameters. The simulation results reveal that, with low communication cost, ASTRL can significantly mitigate the energy hole problem in wireless sensor networks with either uniform or nonuniform node distribution.

Suggested Citation

  • Ming Liu & Chao Song, 2012. "Ant-Based Transmission Range Assignment Scheme for Energy Hole Problem in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 8(12), pages 290717-2907, December.
  • Handle: RePEc:sae:intdis:v:8:y:2012:i:12:p:290717
    DOI: 10.1155/2012/290717
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2012/290717
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2012/290717?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:sae:intdis:v:8:y:2012:i:12:p:290717. 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: SAGE Publications (email available below). General contact details of provider: .

    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.