2011/06/08 by Francesco De Pellegrini, De Pellegrini, Francesco, Karina Gomez +5
Computer Science · Engineering · #Distributed #Energy Efficient Wireless Sensor Networks #Energy Harvesting in Wireless Networks #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Parallel #and Cluster Computing (cs.DC) #cs.DC #cs.NI
paper · pdf · doi:10.48550/arxiv.1106.1516
13 pages, 4 figures
arxiv created 2011/06/08 · openalex publication_date 2011/06/08 · arxiv updated 2011/06/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.