Research@StAndrews
 
The University of St Andrews

Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10023/1675
This item has been viewed 1 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
Dobson-IEEE-ICCS2008.pdf217.17 kBAdobe PDFView/Open
Title: Multi criteria adaptation mechanisms in homological sensor networks
Authors: Zhang, Hui
Nixon, Paddy
Dobson, Simon
Keywords: Coverage
QA76 Computer software
Issue Date: Nov-2008
Citation: Zhang , H , Nixon , P & Dobson , S 2008 , ' Multi criteria adaptation mechanisms in homological sensor networks ' . in Proceedings of the 11th IEEE International Conference on Communciations Systems . IEEE , New York , pp. 937-942 , 11th IEEE Singapore International Conference on Communication Systems (ICCS) 2008 , Guangzhou , China , 19-21 November .
conference
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.
Version: Publisher PDF
URI: http://hdl.handle.net/10023/1675
DOI: http://dx.doi.org/10.1109/ICCS.2008.4737322
ISBN: 978-1-4244-2423-8
Type: Conference item
Rights: ©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Publisher: IEEE
Appears in Collections:University of St Andrews Research
Computer Science Research



This item is protected by original copyright

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

DSpace Software Copyright © 2002-2012  Duraspace - Feedback
For help contact: Digital-Repository@st-andrews.ac.uk | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)