A Flow-Partitioned Unequal Clustering Routing Algorithm for Wireless Sensor Networks
Energy efficiency and energy balance are two important issues for wireless sensor networks. In previous clustering routing algorithms, multihop transmission, sleep scheduling, and unequal clustering are always used to improve energy efficiency and energy balance. In these algorithms, only the cluste...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-04-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2014/875268 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849309294626865152 |
|---|---|
| author | Jian Peng Xiaohai Chen Tang Liu |
| author_facet | Jian Peng Xiaohai Chen Tang Liu |
| author_sort | Jian Peng |
| collection | DOAJ |
| description | Energy efficiency and energy balance are two important issues for wireless sensor networks. In previous clustering routing algorithms, multihop transmission, sleep scheduling, and unequal clustering are always used to improve energy efficiency and energy balance. In these algorithms, only the cluster heads share the burden of data forwarding in each round. In this paper, we propose a flow-partitioned unequal clustering routing (FPUC) algorithm to achieve better energy efficiency and energy balance. FPUC consists of two phases: clustering and routing. In the clustering phase, the competition radius is computed according to the node density and the distance from sensor nodes to the sink. The sensor nodes that have more residual energy and larger overlapping degree have higher probability to be selected as cluster heads. In the routing phase, each cluster head first finds the gateway nodes and then distributes the data flow to each of its gateway nodes depending on residual energy. After that, each gateway node forwards the data to the next hop with minimum cost. Two metrics called network lifetime and coverage lifetime are used to compare the performance of FPUC with that of the existing ones. Simulation results show that FPUC can achieve longer network lifetime and coverage lifetime than previous algorithms. |
| format | Article |
| id | doaj-art-18e86c7c592741aeb3db2194e0fb45cf |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2014-04-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-18e86c7c592741aeb3db2194e0fb45cf2025-08-20T03:54:12ZengWileyInternational Journal of Distributed Sensor Networks1550-14772014-04-011010.1155/2014/875268875268A Flow-Partitioned Unequal Clustering Routing Algorithm for Wireless Sensor NetworksJian Peng0Xiaohai Chen1Tang Liu2 College of Computer Science, Sichuan University, Chengdu 610065, China College of Computer Science, Sichuan University, Chengdu 610065, China College of Fundamental Education, Sichuan Normal University, Chengdu 610068, ChinaEnergy efficiency and energy balance are two important issues for wireless sensor networks. In previous clustering routing algorithms, multihop transmission, sleep scheduling, and unequal clustering are always used to improve energy efficiency and energy balance. In these algorithms, only the cluster heads share the burden of data forwarding in each round. In this paper, we propose a flow-partitioned unequal clustering routing (FPUC) algorithm to achieve better energy efficiency and energy balance. FPUC consists of two phases: clustering and routing. In the clustering phase, the competition radius is computed according to the node density and the distance from sensor nodes to the sink. The sensor nodes that have more residual energy and larger overlapping degree have higher probability to be selected as cluster heads. In the routing phase, each cluster head first finds the gateway nodes and then distributes the data flow to each of its gateway nodes depending on residual energy. After that, each gateway node forwards the data to the next hop with minimum cost. Two metrics called network lifetime and coverage lifetime are used to compare the performance of FPUC with that of the existing ones. Simulation results show that FPUC can achieve longer network lifetime and coverage lifetime than previous algorithms.https://doi.org/10.1155/2014/875268 |
| spellingShingle | Jian Peng Xiaohai Chen Tang Liu A Flow-Partitioned Unequal Clustering Routing Algorithm for Wireless Sensor Networks International Journal of Distributed Sensor Networks |
| title | A Flow-Partitioned Unequal Clustering Routing Algorithm for Wireless Sensor Networks |
| title_full | A Flow-Partitioned Unequal Clustering Routing Algorithm for Wireless Sensor Networks |
| title_fullStr | A Flow-Partitioned Unequal Clustering Routing Algorithm for Wireless Sensor Networks |
| title_full_unstemmed | A Flow-Partitioned Unequal Clustering Routing Algorithm for Wireless Sensor Networks |
| title_short | A Flow-Partitioned Unequal Clustering Routing Algorithm for Wireless Sensor Networks |
| title_sort | flow partitioned unequal clustering routing algorithm for wireless sensor networks |
| url | https://doi.org/10.1155/2014/875268 |
| work_keys_str_mv | AT jianpeng aflowpartitionedunequalclusteringroutingalgorithmforwirelesssensornetworks AT xiaohaichen aflowpartitionedunequalclusteringroutingalgorithmforwirelesssensornetworks AT tangliu aflowpartitionedunequalclusteringroutingalgorithmforwirelesssensornetworks AT jianpeng flowpartitionedunequalclusteringroutingalgorithmforwirelesssensornetworks AT xiaohaichen flowpartitionedunequalclusteringroutingalgorithmforwirelesssensornetworks AT tangliu flowpartitionedunequalclusteringroutingalgorithmforwirelesssensornetworks |