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

On Deployment of Multiple Base Stations for Energy-Efficient Communication in Wireless Sensor Networks

Author

Listed:
  • Yunyue Lin
  • Qishi Wu
  • Xiaoshan Cai
  • Xiaojiang Du
  • Ki-Hyeon Kwon

Abstract

Data transmission from sensor nodes to a base station or a sink node often incurs significant energy consumption, which critically affects network lifetime. We generalize and solve the problem of deploying multiple base stations to maximize network lifetime in terms of two different metrics under one-hop and multihop communication models. In the one-hop communication model, the sensors far away from base stations always deplete their energy much faster than others. We propose an optimal solution and a heuristic approach based on the minimal enclosing circle algorithm to deploy a base station at the geometric center of each cluster. In the multihop communication model, both base station location and data routing mechanism need to be considered in maximizing network lifetime. We propose an iterative algorithm based on rigorous mathematical derivations and use linear programming to compute the optimal routing paths for data transmission. Simulation results show the distinguished performance of the proposed deployment algorithms in maximizing network lifetime.

Suggested Citation

  • Yunyue Lin & Qishi Wu & Xiaoshan Cai & Xiaojiang Du & Ki-Hyeon Kwon, 2010. "On Deployment of Multiple Base Stations for Energy-Efficient Communication in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 6(1), pages 563156-5631, July.
  • Handle: RePEc:sae:intdis:v:6:y:2010:i:1:p:563156
    DOI: 10.1155/2010/563156
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2010/563156
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2010/563156?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:6:y:2010:i:1:p:563156. 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.