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

Energy-Efficient Coverage Guarantees Scheduling and Routing Strategy for Wireless Sensor Networks

Author

Listed:
  • Nam-Tuan Le
  • Yeong Min Jang

Abstract

With the development of semiconductors and the resulting effect on manufacturing costs, wireless interface platforms have become increasingly powerful and popular. This has resulted in widespread applications ranging from daily life activities to military services. In large-scale applications of wireless sensor networks such as military surveillance, there are two important issues that determine the success of network services. The first is sensing coverage, the data collection process from the target that directly affects network traffic. The second is network lifetime which is based on the optimization of energy consumption. Power optimization for mobile platforms can be classified into two categories: efficient power based on protocol and extended interface. In this paper, we suggest an energy model for wireless sensor networks that is based on the first issue; it can be called Coverage and Energy Strategy for wireless sensor networks (CESS). The scheme will attempt to achieve optimal coverage of the sensing area and energy balanced scheduling for all sensors. It can reduce redundancy of working sensor nodes by defining minimal number of active nodes in a sensing area. Thus the network lifetime will be maximized by reducing redundancy power consumption.

Suggested Citation

  • Nam-Tuan Le & Yeong Min Jang, 2015. "Energy-Efficient Coverage Guarantees Scheduling and Routing Strategy for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(8), pages 612383-6123, August.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:8:p:612383
    DOI: 10.1155/2015/612383
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/612383
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/612383?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:11:y:2015:i:8:p:612383. 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.