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

Robust Monitor Assignment with Minimum Cost for Sensor Network Tomography

Author

Listed:
  • Xiaojin Liu
  • Yi Gao
  • Wenbin Wu
  • Wei Dong
  • Jiajun Bu

Abstract

In wired networks, monitor-based network tomography has been proved to be an effective technology for network internal state measurements. Existing wired network tomography approaches assume that the network topology is relatively static. However, the network topology of sensor networks is usually changing over time due to wireless dynamics. In this paper, we study the problem to assign a number of sensor nodes as monitors in large scale sensor networks, so that the end-to-end measurements among monitors can be used to identify hop-by-hop link metrics. We propose RoMA, a Robust Monitor Assignment, algorithm to assign monitors in large scale sensor networks with dynamically changing topology. RoMA includes two components, confidence-based robust topology generation and cost-minimized monitor assignment. We implement RoMA and evaluate its performance based on a deployed large scale sensor network. Results show that RoMA achieves high identifiability with dynamically changing topology and is able to assign monitors with minimum cost.

Suggested Citation

  • Xiaojin Liu & Yi Gao & Wenbin Wu & Wei Dong & Jiajun Bu, 2015. "Robust Monitor Assignment with Minimum Cost for Sensor Network Tomography," International Journal of Distributed Sensor Networks, , vol. 11(8), pages 512463-5124, August.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:8:p:512463
    DOI: 10.1155/2015/512463
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1155/2015/512463?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:512463. 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.