A Centralized Energy-Efficient Routing Protocol for Wireless Sensor Networks

Aamir Sharif Fawad Alam

Outlines
Introduction Network and Radio Models Base Station Controlled Dynamic Clustering Protocol Performance Evaluation Conclusions

Introduction
There are many cluster- based routing protocols have been proposed in wireless sensor networks, such as LEACH, LEACH -C and PEGASIS. In this paper, they propose a centralized routing protocol called Base Station Controlled Dynamic Clustering Protocol (BCDCP).

Energy-Efficient Routing:
Direct Transmissions The greater the distance, the more energy required Far away nodes die first

Energy-Efficient Routing:
Minimum Transmission Energy Nodes close to sink route more Packets Close nodes die first

Energy-Efficient Routing: Clustered

Only cluster heads send Data to base- station Nodes take in turn the burden of sending to base-station

BCDCP
Base-Station Controlled Dynamic Clustering Protocol

Centralized Protocol
Base-Station is assumed to have energy and computing power in abundance Base-Station is assumed to know all the node locations Nodes are assumed to have control over transmission power

Base-Station
Gathers node energy levels Clusters Nodes Creates TDMA Schedule Forms cluster head spanning tree Only one cluster head forwards to base-station

BCDCP Setup Phase

Choose two most separated nodes from potentional cluster heads Divide nodes based on proximity Balance clusters Iterate

BCDCP Setup Phase

Choose two most separated nodes from potentional cluster heads Devide nodes based on proximity Balance clusters Iterate

BCDCP Setup Phase

Choose two most separated nodes from potentional cluster heads Devide nodes based on proximity Balance clusters Iterate

BCDCP Setup Phase

Choose two most separated nodes from potentional cluster heads Devide nodes based on proximity Balance clusters Iterate

BCDCP TDMA Schedule

Major task for base station Iterative cluster splitting algorithm Data communication phase -Data gathering -Data fusion -Data routing

Simulation Result
Matlab (500 nodes 2J energy) LEACH
LEACH-C

PEGASIS

Results
40% energy reduction over LEACH(-C) In LEACH cluster heads send directly to base station Unbalanced Clusters 5% energy reduction over PEGASIS CH-to-CH routing out performes PEGASIS
(BCDCP has better neighbor distances)

Increasingly better with area increase

Conclusion
The paper delivers as promised:
Significant energy savings over LEACH(-C) Small, but still, improvement over PEGASIS

Centralized Protocol
PEGASIS, all nodes global network knowledge BCDCP, base station global network knowledge

Future Work
Enable for nodes which can t reach the base-station Allow for mobile nodes