Assignment of sensors for multiple tasks using path information

Susumu Toriumi, Shinichi Honiden

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A "shared" wireless sensor network (WSN) where multiple users deploy multiple tasks requires a mechanism for resource arbitration. This arbitration can be viewed as a problem with determining how best to assign sensors to tasks. The previous approaches only dealt with energy used for sensing; however, experiments have shown that the energy used for communication must be dealt with within the context of a WSN. In this paper, we propose a novel formulation of this problem and a distributed assignment algorithm based on heuristics that takes into account path information between the assigned node and the base station. We take advantage of the "reactive" nature of the system and piggyback path information on task queries. We can expect higher utilization of the network in comparison with previous approaches by preserving routes through which sensing data run. The results of software simulations revealed that our assignment algorithm is more energy-efficient than the previous one that does not exploit information about the path.

Original languageEnglish
Title of host publicationProceedings - 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011
Pages120-127
Number of pages8
DOIs
Publication statusPublished - 2011 Dec 1
Externally publishedYes
Event2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011 - Melbourne, VIC, Australia
Duration: 2011 Oct 242011 Oct 26

Other

Other2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011
CountryAustralia
CityMelbourne, VIC
Period11/10/2411/10/26

Fingerprint

Wireless sensor networks
Sensors
Base stations
Communication
Experiments

Keywords

  • Assignment
  • Multiple tasks
  • Wireless sensor network

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Human-Computer Interaction

Cite this

Toriumi, S., & Honiden, S. (2011). Assignment of sensors for multiple tasks using path information. In Proceedings - 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011 (pp. 120-127). [6104516] https://doi.org/10.1109/EUC.2011.19

Assignment of sensors for multiple tasks using path information. / Toriumi, Susumu; Honiden, Shinichi.

Proceedings - 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011. 2011. p. 120-127 6104516.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Toriumi, S & Honiden, S 2011, Assignment of sensors for multiple tasks using path information. in Proceedings - 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011., 6104516, pp. 120-127, 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011, Melbourne, VIC, Australia, 11/10/24. https://doi.org/10.1109/EUC.2011.19
Toriumi S, Honiden S. Assignment of sensors for multiple tasks using path information. In Proceedings - 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011. 2011. p. 120-127. 6104516 https://doi.org/10.1109/EUC.2011.19
Toriumi, Susumu ; Honiden, Shinichi. / Assignment of sensors for multiple tasks using path information. Proceedings - 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011. 2011. pp. 120-127
@inproceedings{0e9dea2020484730945f9a30b5a7bd94,
title = "Assignment of sensors for multiple tasks using path information",
abstract = "A {"}shared{"} wireless sensor network (WSN) where multiple users deploy multiple tasks requires a mechanism for resource arbitration. This arbitration can be viewed as a problem with determining how best to assign sensors to tasks. The previous approaches only dealt with energy used for sensing; however, experiments have shown that the energy used for communication must be dealt with within the context of a WSN. In this paper, we propose a novel formulation of this problem and a distributed assignment algorithm based on heuristics that takes into account path information between the assigned node and the base station. We take advantage of the {"}reactive{"} nature of the system and piggyback path information on task queries. We can expect higher utilization of the network in comparison with previous approaches by preserving routes through which sensing data run. The results of software simulations revealed that our assignment algorithm is more energy-efficient than the previous one that does not exploit information about the path.",
keywords = "Assignment, Multiple tasks, Wireless sensor network",
author = "Susumu Toriumi and Shinichi Honiden",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/EUC.2011.19",
language = "English",
isbn = "9780769545523",
pages = "120--127",
booktitle = "Proceedings - 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011",

}

TY - GEN

T1 - Assignment of sensors for multiple tasks using path information

AU - Toriumi, Susumu

AU - Honiden, Shinichi

PY - 2011/12/1

Y1 - 2011/12/1

N2 - A "shared" wireless sensor network (WSN) where multiple users deploy multiple tasks requires a mechanism for resource arbitration. This arbitration can be viewed as a problem with determining how best to assign sensors to tasks. The previous approaches only dealt with energy used for sensing; however, experiments have shown that the energy used for communication must be dealt with within the context of a WSN. In this paper, we propose a novel formulation of this problem and a distributed assignment algorithm based on heuristics that takes into account path information between the assigned node and the base station. We take advantage of the "reactive" nature of the system and piggyback path information on task queries. We can expect higher utilization of the network in comparison with previous approaches by preserving routes through which sensing data run. The results of software simulations revealed that our assignment algorithm is more energy-efficient than the previous one that does not exploit information about the path.

AB - A "shared" wireless sensor network (WSN) where multiple users deploy multiple tasks requires a mechanism for resource arbitration. This arbitration can be viewed as a problem with determining how best to assign sensors to tasks. The previous approaches only dealt with energy used for sensing; however, experiments have shown that the energy used for communication must be dealt with within the context of a WSN. In this paper, we propose a novel formulation of this problem and a distributed assignment algorithm based on heuristics that takes into account path information between the assigned node and the base station. We take advantage of the "reactive" nature of the system and piggyback path information on task queries. We can expect higher utilization of the network in comparison with previous approaches by preserving routes through which sensing data run. The results of software simulations revealed that our assignment algorithm is more energy-efficient than the previous one that does not exploit information about the path.

KW - Assignment

KW - Multiple tasks

KW - Wireless sensor network

UR - http://www.scopus.com/inward/record.url?scp=84855784496&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84855784496&partnerID=8YFLogxK

U2 - 10.1109/EUC.2011.19

DO - 10.1109/EUC.2011.19

M3 - Conference contribution

AN - SCOPUS:84855784496

SN - 9780769545523

SP - 120

EP - 127

BT - Proceedings - 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011

ER -