Please use this identifier to cite or link to this item:
Multi-level low energy adaptive clustering hierarchy (ML-LEACH) : a routing solution for periodic data sensing in large-area wireless sensor network
|M.S.Q111.H3_4208 AUG 2007_r.pdf||Version for non-UH users. Copying/Printing is not permitted||4.42 MB||Adobe PDF||View/Open|
|M.S.Q111.H3_4208 AUG 2007_uh.pdf||Version for UH users||4.42 MB||Adobe PDF||View/Open|
|Title:||Multi-level low energy adaptive clustering hierarchy (ML-LEACH) : a routing solution for periodic data sensing in large-area wireless sensor network|
|Keywords:||Routing (Computer network management)|
|Abstract:||Wireless sensor networks (WSN) can provide valuable services in scientific data collection and other military applications. Recent technological advances have led to the development of small, low-cost, and low-power microsensors. Almost all of these microsensors are battery-powered. They maybe placed in some rough terrain or an area where a certain type of data needs to be collected. These sensors send data back to a base station (BS) through wireless transmission. Data mayor may not be sent back periodically depending on the types of application. Most of the time, it is very difficult to replace batteries for these sensors in the field. As a result, conservation of energy rather than QoS has become the most important factor to consider in the routing of wireless sensor networks. There are many routing algorithms designed for a variety of WSN applications from periodic data collection to intrusion detection. Each of them targets a certain type of application and has its own advantages and disadvantages. LEACH (Low-Energy Adaptive Clustering Hierarchy)  is a cluster-based routing protocol for WSN. It is designed for periodic data sensing and transmission. Compared with many other routing protocols for this application, it is superior in the following ways. First it is an energy efficient cluster-based protocol with random cluster-head (CH) rotations. This allows better uniform energy distribution and data aggregation. As a result, network lifetime is extended. Secondly, it has very good scalability in terms of number of sensor nodes. Sensor nodes can be added to the WSN at any time and the system will self-configure and adapt to all the changes. Finally the operations in LEACH are completely distributed with no central control. This makes it very robust with no "hot spots" or bottlenecks. However, LEACH is a single-hop protocol. The CH node collects the data from non cluster-heads (non-CH) nodes and transmits the aggregated data back to the base station. Due to energy constraint, the base station has to be within the transmission range of every node in the sensor network. Thus, a WSN that implements LEACH has a small radius (less than 200m). In other words, although LEACH is very energy efficient and robust, it is not suitable for large-area WSN. In this thesis, we propose a routing protocol called Multilevel-LEACH (MLLEACH). It retains all the key features of LEACH, such as its cluster-head election algorithm and cluster-formation scheme. ML-LEACH is also designed for periodic data collection. However unlike LEACH, ML-LEACH is a multi-hop protocol which allows sensors nodes faraway from the base station to transmit data back to the base station through data forwarding. This protocol allows the network area of WSN to be extended by many times and yet maintains fairly long network lifetime and satisfactory data transmission efficiency. The energy cost to build an n-level LEACH will also be studied and verified by MATLAB simulations.|
|Description:||Thesis (M.S.)--University of Hawaii at Manoa, 2007.|
Includes bibliographical references (leaves 66-67).
viii, 67 leaves, bound ill. (some col.) 29 cm
|Rights:||All UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.|
|Appears in Collections:||M.S. - Electrical Engineering|
Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.