Novel Load Balancing Algorithms Ensuring Uniform Packet Loss Probabilities for WSN

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 IEEE 73rd Vehicular Technology Conference (VTC Spring) s. 1 - 5
Hlavní autoři: Levendovszky, J., Tornai, K., Treplan, G., Olah, A.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2011
Témata:
Artificial neural networks
Equations
Optimal scheduling
Quality of service
Scheduling
Wireless sensor networks
ISBN:1424483328, 9781424483327
ISSN:1550-2252
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:1424483328
9781424483327
ISSN:1550-2252
DOI:10.1109/VETECS.2011.5956703