search query: @keyword wireless sensor networks / total: 15
reference: 8 / 15
« previous | next »
Author:Lama Sherpa, Ang Tashi
Title:TDMA scheduling in wireless sensor networks
Publication type:Master's thesis
Publication year:2010
Pages:viii + 68 s. + liitt. 66      Language:   eng
Department/School:Tietoliikenne- ja tietoverkkotekniikan laitos
Main subject:Tietoliikennetekniikka   (S-72)
Supervisor:Jäntti, Riku
Instructor:Mahmood, Aamir
OEVS:
Electronic archive copy is available via Aalto Thesis Database.
Instructions

Reading digital theses in the closed network of the Aalto University Harald Herlin Learning Centre

In the closed network of Learning Centre you can read digital and digitized theses not available in the open network.

The Learning Centre contact details and opening hours: https://learningcentre.aalto.fi/en/harald-herlin-learning-centre/

You can read theses on the Learning Centre customer computers, which are available on all floors.

Logging on to the customer computers

  • Aalto University staff members log on to the customer computer using the Aalto username and password.
  • Other customers log on using a shared username and password.

Opening a thesis

  • On the desktop of the customer computers, you will find an icon titled:

    Aalto Thesis Database

  • Click on the icon to search for and open the thesis you are looking for from Aaltodoc database. You can find the thesis file by clicking the link on the OEV or OEVS field.

Reading the thesis

  • You can either print the thesis or read it on the customer computer screen.
  • You cannot save the thesis file on a flash drive or email it.
  • You cannot copy text or images from the file.
  • You cannot edit the file.

Printing the thesis

  • You can print the thesis for your personal study or research use.
  • Aalto University students and staff members may print black-and-white prints on the PrintingPoint devices when using the computer with personal Aalto username and password. Color printing is possible using the printer u90203-psc3, which is located near the customer service. Color printing is subject to a charge to Aalto University students and staff members.
  • Other customers can use the printer u90203-psc3. All printing is subject to a charge to non-University members.
Location:P1 Ark Aalto  955   | Archive
Keywords:wireless sensor networks
TDMA
centralized link scheduling
channel assignment
distributed broadcast scheduling
tree structured network topology
Abstract (eng): In this thesis, we address the time slot scheduling problem that arises while utilizing time division multiple access (TDMA) as the medium access control (MAC) protocol for wireless sensor networks (WSN).
We first propose two algorithms: Centralized link scheduling and channel assignment algorithm, and distributed broadcast TDMA scheduling algorithm (DB-TDMA), to solve the scheduling problem.

The centralized link scheduling and channel assignment algorithm allocates receiving channels to each node and allocates time slot to each link between two nodes.
Prior to link scheduling algorithm, a balanced tree formation algorithm is introduced to generate a balanced tree structured network topology.

Another proposed scheduling algorithm is the distributed broadcast TDMA scheduling algorithm (DB-TDMA), that allows each node to select its own time slot based on the local two-hop neighbourhood information.
Here, an option to obtain either global time framing or local time framing after .We focus on reducing the message transaction between the nodes without compromising the convergence time of the algorithm.
We also present an extension to the distributed broadcasts scheduling algorithm to provide multiple time slots to some nodes.

Finally, we present the performance analysis of the algorithms presented in this thesis.
Our experimental results show that: 1) In centralized link scheduling and channel assignment algorithm, the schedule length decreases with the increase in number of available channels.
The decrease is maximum when channel availability increases from one to two.
However, the decrease in schedule length becomes -less significant when channel availability is more than two; 2) The DB-TDMA and its extension provides optimal time slot schedule with low message transactions within reasonable run time; 3) The performance of DB-TDMA is observed to better than previously proposed distributed algorithms; distributed randomized TDMA scheduling (DRAND) and deterministic distributed TDMA scheduling (DDTDMA) algorithms in terms of message actions required for scheduling.
ED:2010-07-21
INSSI record number: 40033
+ add basket
« previous | next »
INSSI