Name
Abstract | ||
|---|---|---|
Data aggregation is an essential operation for the sink to obtain summary information in a wireless sensor network (WSN). The problem of minimum latency aggregation schedule (MLAS) which seeks a fastest and conflict-free aggregation schedule has been well studied when nodes are always awake. However, in duty-cycle WSNs, nodes can only receive data in the active state. In such networks, it is of gr... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TNET.2018.2868943 | IEEE/ACM Transactions on Networking |
Keywords | Field | DocType |
Wireless sensor networks,Schedules,Data aggregation,Scheduling,Approximation algorithms,IEEE transactions,Switches | Approximation algorithm,Scheduling (computing),Computer science,Latency (engineering),Computer network,Network topology,Schedule,Latency (engineering),Wireless sensor network,Data aggregator,Distributed computing | Journal |
Volume | Issue | ISSN |
26 | 5 | 1063-6692 |
Citations | PageRank | References |
4 | 0.37 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Quan Chen | 1 | 51 | 7.05 |
| Hong Gao | 2 | 1086 | 120.07 |
| Zhipeng Cai | 3 | 1928 | 132.81 |
| Lianglun Cheng | 4 | 51 | 29.51 |
| Jianzhong Li | 5 | 3196 | 304.46 |