Subjectswireless sensor networks
MetadataShow full item record
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.
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-485
TypeConference papers, meetings and proceedings