Optimal Period Length for the CGS Sensor Network Scheduling Algorithm

Gabor Bergmann (1) , Miklos Molnar (2) , Laszlo Gonczy (1) , Bernard Cousin (2)

1 DMIS - Deptartment of Measurement and Information Systems [Budapest]
2 ATNET - Advanced Technolgy in Networking

In Wireless Sensor Networks (WSN), a tradeoff between the network lifetime (limited by energy of sensors) and redundancy of actively sensing and communicating sensors (implicated by coverage requirements for the measured area) has to be established, typically in an over-deployed environment. This is achieved by scheduling algorithms which periodically alternate the state of sensors between ”asleep” and ”awake”. Obviously, the period length of the periodical synchronized scheduling affects the network performance and lifetime. Controlled Greedy Sleep algorithm is a quasi-optimal synchronized sensor scheduling algorithm which increases network lifetime while maintaining correct functionality, based on local decisions of sensors. This paper investigates the optimization of the period length of this algorithm and highlights best practices with simulations. Studies have been performed within a ring topology and in random square topology.

Mots clés: Computer Networks; Ad hoc networking; sensor network; energy conservation; sensor scheduling; synchronized alternation; optimal period length; network simulation

Domaines: Réseaux et télécommunications [cs.NI]

Gabor Bergmann, Miklos Molnar, Laszlo Gonczy, Bernard Cousin. Optimal Period Length for the CGS Sensor Network Scheduling Algorithm. Sixth International Conference on Networking and Services (ICNS 2010), Mar 2010, Cancun, Mexico. pp.192-199, ⟨10.1109/ICNS.2010.33⟩. ⟨hal-00540607⟩