Premium
Performance–lifetime tradeoff for source extraction in multihop sensor networks
Author(s) -
Chen Hongbin,
Feng Jiuchao,
Tse Chi K.
Publication year - 2010
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.1133
Subject(s) - computer science , wireless sensor network , sink (geography) , constraint (computer aided design) , channel (broadcasting) , node (physics) , real time computing , algorithm , computer network , mathematics , geometry , cartography , structural engineering , engineering , geography
This paper intends to reveal the performance–lifetime tradeoff for source extraction in a multihop sensor network. The randomly deployed sensor network consists of multiple independent branches. The leaf node in each branch takes an observation from the sensing field. The observation is assumed to be a noisy instantaneous linear mixture of the sources. To account for the bandwidth constraint, each leaf node quantizes its observation and sends the quantized data to the sink in a multihop fashion. The observed mixtures are reconstructed at the sink and are utilized to extract the sources. The accumulated bit error probability in each branch depends on the number of hops and the bit error probability of each channel in that branch. The communication errors affect the accuracy of reconstructing mixtures, and hence affect the performance of source extraction. Network lifetime is defined and analyzed under both per‐sensor energy constraint and network energy constraint. The tradeoff between performance and network lifetime is described by optimization problems and the conditions for optimization are identified. As a by‐product, the conditions for maximizing the network lifetime are also identified. Simulation results demonstrate that the tradeoff exists under certain situations. Copyright © 2010 John Wiley & Sons, Ltd.