Novel Load Balancing Algorithms Ensuring Uniform Packet Loss Probabilities for WSN

• Published in: 2011 IEEE 73rd Vehicular Technology Conference (VTC Spring) pp. 1 - 5
• Main Authors: Levendovszky, J., Tornai, K., Treplan, G., Olah, A.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.05.2011
• Subjects: Artificial neural networks; Equations; Optimal scheduling; Quality of service; Scheduling; Wireless sensor networks
• ISBN: 1424483328; 9781424483327
• ISSN: 1550-2252
• DOI: 10.1109/VETECS.2011.5956703

In this paper, we develop optimal scheduling mechanisms for packet forwarding in Wireless Sensor Network, where clusterheads are gathering information with a predefined Quality of Service. The objective is to ensure balanced energy consumption and to minimize the packet loss probability, subject to time constraints (i.e. different nodes must send all their packets within a given time interval). Novel solutions of scheduling are developed by combinatorial optimization, and by quadratic programming methods. In our approach, the scheduling of packet forwarding is broken down to a discrete quadratic optimization problem and the optimum is sought by a Hopfield Neural Network yielding the solution in polynomial time. The scheduling provided by the Hopfield Neural Network indeed guarantees uniform packet loss probabilities for all the nodes and saves the energy of the clusterheads. In this way, the longevity of the network can be increased.