Name
Abstract | ||
|---|---|---|
A customary solution to reduce the energy consumption of wireless communication devices is to periodically put the radio into low-power sleep mode. A relevant problem is to schedule the wake-up of nodes in such a way as to ensure proper coordination among devices, respecting delay constraints while still saving energy. In this paper, we introduce a simple algebraic characterization of the problem of periodic wake-up scheduling under both energy consumption and delay constraints. We demonstrate that the general problem of wake-up times coordination is equivalent to integer factorization and discuss the implications on the design of efficient scheduling algorithms. We then propose simple polynomial time heuristic algorithms that can be implemented in a distributed fashion and present a message complexity of the order of the number of links in the network. Numerical results are provided in order to assess the performance of the proposed techniques when applied to wireless sensor networks. |
Year | Venue | Keywords |
|---|---|---|
2011 | CoRR | integer factorization,wireless communication,wireless network,polynomial time,heuristic algorithm,cluster computing,scheduling algorithm,wireless sensor network |
Field | DocType | Volume |
Wireless network,Key distribution in wireless sensor networks,Heuristic,Wireless,Scheduling (computing),Computer science,Computer network,Sleep mode,Energy consumption,Wireless sensor network,Distributed computing | Journal | abs/1106.1516 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francesco De Pellegrini | 1 | 1328 | 82.83 |
| Karina Mabell Gomez | 2 | 280 | 23.87 |
| Daniele Miorandi | 3 | 1794 | 117.08 |
| Imrich Chlamtac | 4 | 4617 | 728.71 |