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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 80; číslo 11; s. 3158 - 3176
Hlavní autoři:	Luo, Wenchang, Xu, Yao, Gu, Boyuan, Tong, Weitian, Goebel, Randy, Lin, Guohui
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.11.2018 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!