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

Guaranteed convergence control for consensus of mobile sensor networks with dynamical topologies

Author

Listed:
  • Xiangshun Li
  • Cheng Lei
  • Lijing Dong
  • Sing-Kiong Nguang

Abstract

Mobile sensors need to reach consensus in many applications such as unmanned vehicles, multi-agent systems and environmental monitoring. In these scenarios, it is very important to reduce the power consumption as well as make sensors reach consensus as fast as possible. In this article, we propose a novel guaranteed convergence control algorithm to switch topologies of mobile sensors so that we can reduce power consumption in the sensor network and make the mobile sensors reach consensus with guaranteed convergence as well. The topology graphs over the mobile sensors are unconnected, directed, dynamical and switched periodically at any moment, while the joint graphs of dynamical topologies are connected in a bounded time period. The guaranteed convergence rate of consensus is derived on a method based on the variable decomposition. Some illustrative examples are provided to demonstrate the validity and effectiveness of the results.

Suggested Citation

  • Xiangshun Li & Cheng Lei & Lijing Dong & Sing-Kiong Nguang, 2016. "Guaranteed convergence control for consensus of mobile sensor networks with dynamical topologies," International Journal of Distributed Sensor Networks, , vol. 12(11), pages 15501477166, November.
    • Handle: RePEc:sae:intdis:v:12:y:2016:i:11:p:1550147716674011
    DOI: 10.1177/1550147716674011
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147716674011
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147716674011?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
    ---><---

    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:12:y:2016:i:11:p:1550147716674011. 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.