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

A PSO-Optimized Minimum Spanning Tree-Based Topology Control Scheme for Wireless Sensor Networks

Author

Listed:
  • Wenzhong Guo
  • Bin Zhang
  • Guolong Chen
  • Xiaofeng Wang
  • Naixue Xiong

Abstract

Wireless sensor networks (WSNs) are networks of autonomous nodes used for monitoring an environment. Topology control is one of the most fundamental problems in WSNs. To overcome high connectivity redundancy and low structure robustness in traditional methods, a PSO-optimized minimum spanning tree-based topology control scheme is proposed in this paper. In the proposed scheme, we transform the problem into a model of multicriteria degree constrained minimum spanning tree (mcd-MST) and design a nondominated discrete particle swarm optimization (NDPSO) to deal with this problem. To obtain a better approximation of true Pareto front, the multiobjective strategy with a fitness function based on niche and phenotype sharing function is applied in NDPSO. Furthermore, a topology control scheme based on NDPSO is proposed. Simulation results show that NDPSO can converge to the non-dominated front quite evenly, and the topology derived under the proposed topology control scheme has lower total power consumption, higher robust structure, and lower contention among nodes.

Suggested Citation

  • Wenzhong Guo & Bin Zhang & Guolong Chen & Xiaofeng Wang & Naixue Xiong, 2013. "A PSO-Optimized Minimum Spanning Tree-Based Topology Control Scheme for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(4), pages 985410-9854, April.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:4:p:985410
    DOI: 10.1155/2013/985410
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/985410
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/985410?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:9:y:2013:i:4:p:985410. 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.