Energy Efficient Routing for Wireless Sensor Networks

Maung Phyo

ISBN 10: 3838304373 / ISBN 13: 9783838304373

Verlag: LAP LAMBERT Academic Publishing Mai 2010, 2010

Beschreibung

Neuware -Recent advances in wireless sensor networks (WSNs) have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Much attention has been given to the routing protocols since they might differ depending on the applications and network architectures. This proposed work, LEACH with Maximum Lifetime Routing, is based on the objective of maximizing the system lifetime. In this algorithm, clusters are formed randomly in each time period. Cluster heads transmit data to base station via multi-hop routing. By comparison with LEACH, LEACH with Maximum Lifetime Routing has better performance in time till first node dies and total dead nodes. Furthermore, nodes die in approximately uniformly distributed locations in LEACH with Maximum Lifetime Routing; there is no one section of the environment that is not being sensed as nodes dies, as occurs in the other algorithms.Books on Demand GmbH, Überseering 33, 22297 Hamburg 84 pp. Englisch.

Bestandsnummer des Verkäufers 9783838304373

Bibliografische Details

• Titel: Energy Efficient Routing for Wireless Sensor Networks
• Verlag: LAP LAMBERT Academic Publishing Mai 2010
• Erscheinungsjahr: 2010
• Sprache: Englisch
• ISBN-10: 3838304373
• ISBN-13: 9783838304373
• Einband: Taschenbuch
• Zustand: Neu
• Abmessungen: 220B x 150 H x 6 T Millimeter Breite: 220 mm, Höhe: 150 mm, Tiefe: 6 mm
• Gewicht: 143 Gramm

Über diesen Titel

Inhaltsangabe

Recent advances in wireless sensor networks (WSNs) have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Much attention has been given to the routing protocols since they might differ depending on the applications and network architectures. This proposed work, LEACH with Maximum Lifetime Routing, is based on the objective of maximizing the system lifetime. In this algorithm, clusters are formed randomly in each time period. Cluster heads transmit data to base station via multi-hop routing. By comparison with LEACH, LEACH with Maximum Lifetime Routing has better performance in time till first node dies and total dead nodes. Furthermore, nodes die in approximately uniformly distributed locations in LEACH with Maximum Lifetime Routing; there is no one section of the environment that is not being sensed as nodes dies, as occurs in the other algorithms.