Pages that link to "Item:Q272491"
From MaRDI portal
The following pages link to Communication scheduling in data gathering networks with limited memory (Q272491):
Displaying 8 items.
- Scheduling for data gathering networks with data compression (Q319855) (← links)
- Lifetime maximized data gathering in wireless sensor networks using limited-order distributed source coding (Q634890) (← links)
- Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments (Q724122) (← links)
- Algorithms for communication scheduling in data gathering network with data compression (Q1755733) (← links)
- Scheduling in data gathering networks with background communications (Q2215200) (← links)
- Data collection in population protocols with non-uniformly random scheduler (Q2285150) (← links)
- Data Collection in Population Protocols with Non-uniformly Random Scheduler (Q5056046) (← links)
- A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks (Q6048111) (← links)