Home // CTRQ 2011, The Fourth International Conference on Communication Theory, Reliability, and Quality of Service // View article

Novel Load Balancing Scheduling Algorithms for Wireless Sensor Networks

Authors:
Endre László
Kálmán Tornai
Gergely Treplán
János Levendovszky

Keywords: load balancing, scheduling, wireless sensor networks (WSN), numerical optimization

Abstract:
In this paper, optimal scheduling mechanisms are developed for packet forwarding in wireless sensor networks, where clusterheads are gathering information. The objective is to monitor real-life processes for a given time interval and forward packets with minimum loss probabilities to the base station. In order to achieve this objective we develop an optimal scheduling algorithm, which determines the time slots in which packets must be sent by the nodes. The scheduling algorithm, on the one hand, guarantees that all the packets will be sent within a predefined time window and thus meeting delay constraints and, on the other hand, it provides uniform packet loss probabilities for all the nodes. The algorithm we propose is capable of providing optimal scheduling with given constraints and guarantees balanced load in polynomial time.

Pages: 54 to 59

Copyright: Copyright (c) IARIA, 2011

Publication date: April 17, 2011

Published in: conference

ISSN: 2308-4022

ISBN: 978-1-61208-126-7

Location: Budapest, Hungary

Dates: from April 17, 2011 to April 22, 2011