Thesis (M.Sc.) - Cairo University - Faculty of Computers and Information - Department of Information Technology

Wireless Sensor Networks (WSNs) consist of many resource-constrained micro sensor nodes that are scattered in a field to sense the surrounding environment. Furthermore, the nodes perform computation and communication operations to deliver the collected data packets to a central point called base station (BS). These sensors are powered up by batteries for which the replacement or recharging is difficult in many cases. The major problem inherited in this type of networks is that sensor nodes run out of energy quickly. Therefore, reducing the energy consumption and extending the main challenge to the researchers in WSN lifetime; is the limited battery power. To satisfy the network lifetime prolonging and the scalability, the sensor nodes are grouped into clusters. So many clustering techniques were introduced to WSNs in order to save energy consumption for these low power sensors. The problem is how to develop a clustering technique that takes in consideration the energy consumption of the sensor nodes. This thesis proposes a clustering algorithm based on the well-known clustering algorithm named LEACH Inner Cluster Election algorithm (LEACH-ICE), by adjusting its mechanisms and steps to cluster the wireless sensor network

Issued also as CD