.png){kind=icon}
.png){kind=icon}
Return
Lifetime maximized data gathering in wireless sensor networks using limited-order distributed source coding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2011.05.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the problem of efficient data gathering in wireless sensor networks with a complexity constrained data gathering node. Due to the complexity constraint, the data gathering node employs an asymmetric DSC that (de)compresses the data of a given node exploiting its dependency with a limited number of other nodes. This is characterized in a DSC rate allocation structure that is referred to as limited-order DSC. Within this structure, we investigate the problem of rate allocation for the nodes to maximize the network lifetime. To this end, an algorithm is proposed that is proven optimal with polynomial complexity in terms of number of network nodes. Numerical results demonstrate that the algorithm, even with limited complexity, allows for exploiting most of the achievable compression gain. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Wireless sensor network
Data gathering
Distributed source coding
Slepian-Wolf coding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.