Cluster head election in wireless sensor network

Other Title(s)

انتخاب رئيس المجموعة في شبكات الاستشعار اللاسلكية

Dissertant

al-Sharah, Abd Allah Sulayman

Thesis advisor

Samawi, Venus W.

Comitee Members

Bani Muhammad, Sad
al-Mubayyidin, Wisam

University

Al albayt University

Faculty

Prince Hussein Bin Abdullah Faculty for Information Technology

Department

Department of Computer Science

University Country

Jordan

Degree

Master

English Abstract

Recently, developments in Wireless sensor networks (WSN) have made sensor nodes available in different application areas, such as military applications, environmental monitoring, medical applications, and many other fields.

In WSN, the sensor nodes are partitioned into groups called clusters.

Sensor nodes, within the same cluster, will collect data from the monitored environment, and send messages to the Base-station.

The Base-station will process the received information and reports it to the user.

The sensor nodes life time is considered as the most critical factor since it increases the possibility of making use of network capabilities.

To elongate sensor nodes life time, power consumption should be reduced.

Many approaches could be used to reduce power consumption, one of these approaches is by performing load balancing. In this work, we are concerned with elongating the WSN life time by allowing different sensor nodes to act as cluster head (CH) for a period of time (round).

This will distribute the energy consumption over all nodes in the network.

The proper selection of CH/round greatly affects the energy efficiency of the network.

We suggest a developed approach that depends on calculating the estimated broadcast cost of each cluster node (the estimated cost of sending message from each node to all nodes within the same cluster) to elect the proper sensor node that acts as CH.

We called this approach LBEACH (Load Balanced Depending on Broadcasting and Energy Using Adaptive Clustering Hierarchy Protocol).

In each LBEACH round, the Base-station will calculate the estimated broadcast-cost per cluster.

For each cluster, three candidate nodes will be selected based on the estimated broadcast-cost of the cluster-nodes (three nodes with least estimated broadcast-cost per cluster).

The available power in each of the three candidate nodes will be compared, and the node with the highest power will be elected as the new CH. LBEACH performance is measured using network life time, power consumption, throughput, and total number of CHs.

By comparing LBEACH performance with LEACH (Low Energy Adaptive Clustering Hierarchy) and SEP (Stable Election Protocol) protocols, it was found that LBEACH shows a significant improvement in the network life time, power consumption, and load balanced (total number of CHs).

LBEACH improves the network life time between 63% -161 % as compared with SEP protocol, and 41%-155% as compared with LEACH protocol.

Power consumption is improved 46%-62% as compared with SEP protocol, and 30%- 61% as compared with LEACH protocol.

Number of CHs shows increased 24%-124% as compared with SEP protocol, and 31%-149% as compared with LEACH.The throughput toward Base-station from CHs (number of packets in network life time) is 24% -124% ascompared with SEP, and between 31%- 225% as compared with LEACH protocols.

Finally, electing CH depends on its power, location and the estimated broadcast-cost that shows improvement in the network performance.

Main Subjects

Telecommunications Engineering

No. of Pages

86

Table of Contents

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-420747