5.00
Hdl Handle:
http://hdl.handle.net/10547/272052
Title:
Efficient node discovery in mobile wireless sensor networks
Authors:
Dyo, Vladimir; Mascolo, Cecilia
Abstract:
In this paper we propose an algorithm for energy efficient node discovery in sparsely connected mobile wireless sensor networks. The work takes advantage of the fact that nodes have temporal patterns of encounters and exploits these patterns to drive the duty cycling. Duty cycling is seen as a sampling process and is formulated as an optimization problem. We have used reinforcement learning techniques to detect and dynamically change the times at which a node should be awake as it is likely to encounter other nodes. We have evaluated our work using real human mobility traces, and the paper presents the performance of the protocol in this context.
Affiliation:
Department of Computer Science, University College London; Computer Laboratory, University of Cambridge
Citation:
Dyo, V., Mascolo, C., (2008) 'Efficient Node Discovery in Mobile Wireless Sensor Networks', in DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems: 478-485
Publisher:
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date:
2008
URI:
http://hdl.handle.net/10547/272052
DOI:
10.1007/978-3-540-69170-9_33
Additional Links:
http://dl.acm.org/citation.cfm?id=1425072
Type:
Conference papers, meetings and proceedings
Language:
en
ISBN:
9783540691693
Appears in Collections:
Centre for Wireless Research (CWR)

Full metadata record

DC FieldValue Language
dc.contributor.authorDyo, Vladimiren_GB
dc.contributor.authorMascolo, Ceciliaen_GB
dc.date.accessioned2013-03-13T13:07:44Z-
dc.date.available2013-03-13T13:07:44Z-
dc.date.issued2008-
dc.identifier.citationDyo, V., Mascolo, C., (2008) 'Efficient Node Discovery in Mobile Wireless Sensor Networks', in DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems: 478-485en_GB
dc.identifier.isbn9783540691693-
dc.identifier.doi10.1007/978-3-540-69170-9_33-
dc.identifier.urihttp://hdl.handle.net/10547/272052-
dc.description.abstractIn this paper we propose an algorithm for energy efficient node discovery in sparsely connected mobile wireless sensor networks. The work takes advantage of the fact that nodes have temporal patterns of encounters and exploits these patterns to drive the duty cycling. Duty cycling is seen as a sampling process and is formulated as an optimization problem. We have used reinforcement learning techniques to detect and dynamically change the times at which a node should be awake as it is likely to encounter other nodes. We have evaluated our work using real human mobility traces, and the paper presents the performance of the protocol in this context.en_GB
dc.language.isoenen
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCen_GB
dc.relation.urlhttp://dl.acm.org/citation.cfm?id=1425072en_GB
dc.subjectwireless sensor networksen_GB
dc.titleEfficient node discovery in mobile wireless sensor networksen
dc.typeConference papers, meetings and proceedingsen
dc.contributor.departmentDepartment of Computer Science, University College Londonen_GB
dc.contributor.departmentComputer Laboratory, University of Cambridgeen_GB
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.