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

Nodes Deployment Mechanism Based on Energy Efficiency in Wireless Sensor Networks

Author

Listed:
  • Rui-Hua Zhang
  • Zhi-Ping Jia
  • Xin-Shun Xu

Abstract

In wireless sensor networks, devices are required to self-organize themselves into a network without previously established infrastructure. Because the device is battery-powered, one of the most important design criteria for this type of network is energy efficiency. Based on two linear traffic models and an extension of energy model of the radio, we consider different multi-hop scenarios to compute the energy and energy efficiency of the whole network. Through analyzing these results, we present two valid deployment mechanisms for sensor nodes. The first deployment mechanism is that nodes are deployed with equidistant spacing. Under this topology, we compute energy per payload bit, energy efficiency, and the total energy consumed by individual nodes, and the whole network. Simulation results show that a single-hop strategy is more efficient than a multi-hop one, especially for low path loss exponents, when the total distance is less than the feasible range of the radio. The receive and startup energy overhead, in addition to the energy drain increase at nodes close to the sink, makes multi-hop an inefficient technique. If overheads can be reduced with new transceiver technologies, multi-hop becomes more attractive. We derive the optimum value for one-hop spacing for the first mechanism, and present the formula to calculate the optimal value with the different application parameters. It is independent of the physical network topology, the number of transmission sources, and the total transmission distance. It only depends on the propagation environment and the device parameters. This mechanism can minimize the energy consumption of the whole network. The first deployment mechanism can achieve minimized energy consumption for the multi-hop scenario where each node transmits a data frame to the sink. However, it brings up a question of energy consumption disproportion between nodes. It is because those nodes close to the sink will relay larger amounts of data packets and their energy consumption will be more. In my intuition, node spacing is chosen shorter to consume less energy for the node closer to the sink. This strategy can balance energy consumption between nodes. So another deployment mechanism is that nodes are deployed with optimal spacing. We present the formula to calculate the optimal spacing. This mechanism can balance every node's energy consumption, thus prolonging the whole network's lifetime. Simulation results show that two deployment mechanisms are good and useful with energy efficiency in wireless sensor networks.

Suggested Citation

  • Rui-Hua Zhang & Zhi-Ping Jia & Xin-Shun Xu, 2009. "Nodes Deployment Mechanism Based on Energy Efficiency in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 5(1), pages 99-99, January.
  • Handle: RePEc:sae:intdis:v:5:y:2009:i:1:p:99-99
    DOI: 10.1080/15501320802575237
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1080/15501320802575237
    Download Restriction: no

    File URL: https://libkey.io/10.1080/15501320802575237?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:5:y:2009:i:1:p:99-99. 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.