Algorithms for Communication Scheduling in Data Gathering Network with Data Compression

We consider a communication scheduling problem that arises within wireless sensor networks, where data is accumulated by the sensors and transferred directly to a central base station. One may choose to compress the data collected by a sensor, to decrease the data size for transmission, but the cost...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 80; no. 11; pp. 3158 - 3176
Main Authors:	Luo, Wenchang, Xu, Yao, Gu, Boyuan, Tong, Weitian, Goebel, Randy, Lin, Guohui
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2018 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Approximation Completion time Computer Science Computer Systems Organization and Communication Networks Data compression Data Structures and Information Theory Data transmission Dynamic programming Mathematical analysis Mathematics of Computing Polynomials Production scheduling Remote sensors Scheduling Sensors Set theory Theory of Computation Wireless communications Wireless sensor networks Wireless sensor network Scheduling Approximation algorithm FPTAS Data compression Dual FPTAS
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!