A TIME-SLOT SCHEDULING ALGORITHM FOR E-HEALTH WIRELESS SENSOR NETWORKS

Author* ÓSCAR GAMA

University of Minho Supervisors: Paulo Mendes, Paulo Carvalho
School of Engineering
Centre of Algoritmi
* osg@di.uminho.pt

Introduction Time-Slot Allocation Algorithm

For e-health wireless sensor networks (WSN) presenting significant A set of equations is proposed to sustain the link scheduling algorithm Symbol Description
A(Mi) boolean activity state of mote Mi
traffic loads, MAC protocols based on deterministic scheduling of a MAC protocol using short size beacons operating in one-hop C(Mi) boolean criticality state of mote Mi
algorithms are consensually considered more adequate than WSNs characterized by a stable topology and regular traffic pattern. Mi (Bj) mote Mi of BSN Bj

protocols based on random access algorithms. Contention–based As the proposed algorithm is computationally non-intensive, it is nackp(Mi)= nacki1…,nackip) complement of the ACK bitmap for all motes M i present in the p BSNs
p number of BSNs (patients)
protocols work well under low traffic loads, but they degrade adequate for motes with very limited computational resources. Sa(Mi) time-slots used by mote Mi to receive the ACK pkt
drastically under higher loads. TDMA protocols are able to provide A time-slot occupation sequence in NTP and RP must be pre-defined. Sg(Mi) safeguard time-slots used by mote Mi

latency bounds and good energy efficiency, but a scheme to assign Sr nr. of reserved final time-slots in the superframe

time-slots to the motes is required. Ss(Mi)

St(Mi)
nr. of time-slots used by mote Mi to transmit a packet
total nr. of time-slots allocated to mote M i
Taking advantage of the regular traffic pattern found in e-health SNTP time-slot where NTP starts

WSNs, as well of the homogeneity regarding the number and types of SNTP(Mi,(Bj)) NTP time-slot for mote Mi of BSN Bj to start data tx

motes found in the BSNs of e-health WSNs, a simple collaborative SRP time-slot where RP starts

time-slot scheduling algorithm is proposed for one-hop networks using b | CAP | RP | M1(B1 … Bp), …, Mm-1(B1… Bp), Mm(B1… Bp) | SRP(Mi,(Bj)) RP time-slot for mote Mi of BSN Bj to start data retx
T(Mi) max nr of trials for mote Mi to retx one data packet
short size beacons. --------------------------- NTP --------------------------

b | CAP | nackp(M1).M1(B1…Bp),…,nackp(Mm).Mm(B0…Bp)) | NTP |

Short Size Beacon MAC Protocol
-------------------------------- RP ---------------------------- Conclusions

As the proposed link scheduling algorithm is computationally

C(Mi) == 0 ? T(Mi) ≤ 1 : T(Mi) = 2 non-intensive, it is adequate for motes with very limited
computational resources.

St ( Mi )  [( Ss ( Mi )  Sg ( Mi )  Sa ( Mi )).T ( Mi )  Sa ( Mi )]. A( Mi ) Results obtained in an experimental e-health testbed confirm

that the short size beacon MAC protocol using the proposed
link scheduling algorithm lead to a significant improvement in
i 1 p j 1 the network performance regarding scalability, loss ratio,
Protocols using short size beacons are valuable for the sake of SNTP ( Mi ( Bj ))  SNTP   ( St ( Mk ( Bn)))   St ( Mi ( Bn)) duplicated packets, and energy consumption, when compared
k 1 n 1 n 1
energy saving and packet delivery ratio improvement. Beacons carry with the IEEE 802.15.4 protocol.
only the minimal essential information for the proper operation of the
WSN: m p

the NTP ACK bitmap and the final CAP time-slot of the current SNTP  ( S  Sr )   St ( Mi ( Bj ))
superframe are the only data required by the motes to find the CFP i 1 j 1

time-slots during the normal operation state;

criticality and activity bitmaps are also required during the i 1 p j 1
reconfiguration state, along with other operational parameters of the SRP( Mi( Bj ))  SRP   ( nackp( Mk ).St ( Mk ( Bn)))   nackp ( Mi ).St ( M i ( Bn))
motes, such as the sampling rate. k 1 n 1 n 1

Multiple retransmissions and autonomous transmissions are used.

Engenharia para a Qualidade de Vida: SAÚDE, LAZER E AMBIENTE– Semana da Escola de Engenharia -11 a 16 de Outubro de 2010