Multi Criteria Adaptation in Homological Sensor Networks

H Zhang, P Nixon, S Dobson

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

4 Citations (Scopus)

Abstract

One fundamental feature of sensor network is unpredictable and this brings us a challenge of how to design an adaptation mechanism to let a sensor network adjust itself based on current "context" and pre-defined network criteria which include coverage density, fault tolerance, system life and so on. The key idea of our work is, based on calculation of nodes coverage, we can let networks be adaptive to ongoing changing network situation. We use system working life as our criterion in this work to demonstrate the potential usage of our system. An algebraic topology tool, homology, is used in our work to calculate sensor nodes coverage since the local properties of a sensor network, obtained by local interactions among nodes, can be captured by certain topological spaces. Also the global properties of the sensor network characteristics correspond to certain topological invariants of these spaces. Unlike other approaches, our work does not need any node location or orientation information and it does not have any assumption about the node deployment control and domain geometry. The only thing that it needs to calculate nodes coverage is a peer to peer communication graph.
LanguageEnglish
Title of host publicationUnknown Host Publication
Pages937-942
Number of pages6
DOIs
Publication statusPublished - 2008
Event11th IEEE International Conference on Communications Systems (ICCS) - Guangzhou, China
Duration: 1 Jan 2008 → …

Conference

Conference11th IEEE International Conference on Communications Systems (ICCS)
Period1/01/08 → …

Fingerprint

Sensor networks
Fault tolerance
Sensor nodes
Topology
Geometry
Communication

Keywords

  • n/a

Cite this

Zhang, H., Nixon, P., & Dobson, S. (2008). Multi Criteria Adaptation in Homological Sensor Networks. In Unknown Host Publication (pp. 937-942) https://doi.org/10.1109/ICCS.2008.4737322
Zhang, H ; Nixon, P ; Dobson, S. / Multi Criteria Adaptation in Homological Sensor Networks. Unknown Host Publication. 2008. pp. 937-942
@inproceedings{0295581f39fa4e3d877a4e302f9a66ab,
title = "Multi Criteria Adaptation in Homological Sensor Networks",
abstract = "One fundamental feature of sensor network is unpredictable and this brings us a challenge of how to design an adaptation mechanism to let a sensor network adjust itself based on current {"}context{"} and pre-defined network criteria which include coverage density, fault tolerance, system life and so on. The key idea of our work is, based on calculation of nodes coverage, we can let networks be adaptive to ongoing changing network situation. We use system working life as our criterion in this work to demonstrate the potential usage of our system. An algebraic topology tool, homology, is used in our work to calculate sensor nodes coverage since the local properties of a sensor network, obtained by local interactions among nodes, can be captured by certain topological spaces. Also the global properties of the sensor network characteristics correspond to certain topological invariants of these spaces. Unlike other approaches, our work does not need any node location or orientation information and it does not have any assumption about the node deployment control and domain geometry. The only thing that it needs to calculate nodes coverage is a peer to peer communication graph.",
keywords = "n/a",
author = "H Zhang and P Nixon and S Dobson",
year = "2008",
doi = "10.1109/ICCS.2008.4737322",
language = "English",
isbn = "978-1-4244-2423-8",
pages = "937--942",
booktitle = "Unknown Host Publication",

}

Zhang, H, Nixon, P & Dobson, S 2008, Multi Criteria Adaptation in Homological Sensor Networks. in Unknown Host Publication. pp. 937-942, 11th IEEE International Conference on Communications Systems (ICCS), 1/01/08. https://doi.org/10.1109/ICCS.2008.4737322

Multi Criteria Adaptation in Homological Sensor Networks. / Zhang, H; Nixon, P; Dobson, S.

Unknown Host Publication. 2008. p. 937-942.

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

TY - GEN

T1 - Multi Criteria Adaptation in Homological Sensor Networks

AU - Zhang, H

AU - Nixon, P

AU - Dobson, S

PY - 2008

Y1 - 2008

N2 - One fundamental feature of sensor network is unpredictable and this brings us a challenge of how to design an adaptation mechanism to let a sensor network adjust itself based on current "context" and pre-defined network criteria which include coverage density, fault tolerance, system life and so on. The key idea of our work is, based on calculation of nodes coverage, we can let networks be adaptive to ongoing changing network situation. We use system working life as our criterion in this work to demonstrate the potential usage of our system. An algebraic topology tool, homology, is used in our work to calculate sensor nodes coverage since the local properties of a sensor network, obtained by local interactions among nodes, can be captured by certain topological spaces. Also the global properties of the sensor network characteristics correspond to certain topological invariants of these spaces. Unlike other approaches, our work does not need any node location or orientation information and it does not have any assumption about the node deployment control and domain geometry. The only thing that it needs to calculate nodes coverage is a peer to peer communication graph.

AB - One fundamental feature of sensor network is unpredictable and this brings us a challenge of how to design an adaptation mechanism to let a sensor network adjust itself based on current "context" and pre-defined network criteria which include coverage density, fault tolerance, system life and so on. The key idea of our work is, based on calculation of nodes coverage, we can let networks be adaptive to ongoing changing network situation. We use system working life as our criterion in this work to demonstrate the potential usage of our system. An algebraic topology tool, homology, is used in our work to calculate sensor nodes coverage since the local properties of a sensor network, obtained by local interactions among nodes, can be captured by certain topological spaces. Also the global properties of the sensor network characteristics correspond to certain topological invariants of these spaces. Unlike other approaches, our work does not need any node location or orientation information and it does not have any assumption about the node deployment control and domain geometry. The only thing that it needs to calculate nodes coverage is a peer to peer communication graph.

KW - n/a

U2 - 10.1109/ICCS.2008.4737322

DO - 10.1109/ICCS.2008.4737322

M3 - Conference contribution

SN - 978-1-4244-2423-8

SP - 937

EP - 942

BT - Unknown Host Publication

ER -