While energy efficiency is typically considered the major concern in wireless sensor networks (WSNs), many real-life applications also require reliability, timeliness, and scalability. In such scenarios, Time Division Multiple Access (TDMA) is typically used for data communication, as it avoids collisions and provides predictable latency and minimum energy consumption. TDMA requires a slot scheduling algorithm to allocate transmission slots to sensor nodes. In this paper, we propose a decentralized slot allocation algorithm which is localized and self adaptive, i.e., each node selects its slot(s) and adapts its behavior only basing on locally-available information. We derive analytically the time taken by the algorithm and the average energy consumed by the network to achieve a complete schedule. We also show that our solution performs significantly better than another previous similar algorithm.

A localized slot allocation algorithm for wireless sensor networks2013 12th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET) / Domenico De Guglielmo;Giuseppe Anastasi;Marco Conti. - STAMPA. - (2013), pp. 89-96. (Intervento presentato al convegno 2013 12th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET)) [10.1109/MedHocNet.2013.6767415].

A localized slot allocation algorithm for wireless sensor networks2013 12th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET)

DE GUGLIELMO, DOMENICO;
2013

Abstract

While energy efficiency is typically considered the major concern in wireless sensor networks (WSNs), many real-life applications also require reliability, timeliness, and scalability. In such scenarios, Time Division Multiple Access (TDMA) is typically used for data communication, as it avoids collisions and provides predictable latency and minimum energy consumption. TDMA requires a slot scheduling algorithm to allocate transmission slots to sensor nodes. In this paper, we propose a decentralized slot allocation algorithm which is localized and self adaptive, i.e., each node selects its slot(s) and adapts its behavior only basing on locally-available information. We derive analytically the time taken by the algorithm and the average energy consumed by the network to achieve a complete schedule. We also show that our solution performs significantly better than another previous similar algorithm.
2013
2013 12th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET)
2013 12th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET)
Domenico De Guglielmo;Giuseppe Anastasi;Marco Conti
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/921734
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 2
social impact