Worst-Case Interactive Communication and Enhancing Sensor Network Lifetime

Simple item page
dc.creatorAgnihotri, Samar
dc.creatorNuggehalli, Pavan
dc.date2007-07-07
dc.date2007-11-03
dc.date.accessioned2026-07-07T08:39:57Z
dc.date.available2026-07-07T08:39:57Z
dc.descriptionWe are concerned with the problem of maximizing the worst-case lifetime of a data-gathering wireless sensor network consisting of a set of sensor nodes directly communicating with a base-station.We propose to solve this problem by modeling sensor node and base-station communication as the interactive communication between multiple correlated informants (sensor nodes) and a recipient (base-station). We provide practical and scalable interactive communication protocols for data gathering in sensor networks and demonstrate their efficiency compared to traditional approaches. In this paper, we first develop a formalism to address the problem of worst-case interactive communication between a set of multiple correlated informants and a recipient. We realize that there can be different objectives to achieve in such a communication scenario and compute the optimal number of messages and bits exchanged to realize these objectives. Then, we propose to adapt these results in the context of single-hop data-gathering sensor networks. Finally, based on this proposed formalism, we propose a clustering based communication protocol for large sensor networks and demonstrate its superiority over a traditional clustering protocol.
dc.descriptionMinor revision: fixed some typos and reorganized some portions. 12 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/0707.1099
dc.identifierhttp://arxiv.org/abs/0707.1099
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141254
dc.subjectInformation Theory
dc.subjectC.2; E.4; H.1.1
dc.titleWorst-Case Interactive Communication and Enhancing Sensor Network Lifetime
dc.typetext

Files

Collections

arXiv