A Flow-Partitioned Unequal Clustering Routing Algorithm for Wireless Sensor Networks

作     者：Peng, Jian Chen, Xiaohai Liu, Tang 

作者机构：Sichuan Univ Coll Comp Sci Chengdu 610065 Peoples R China Sichuan Normal Univ Coll Fundamental Educ Chengdu 610068 Peoples R China 

出 版 物：《INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS》 (分布式传感网络国际杂志)

年 卷 期：2014年第2014卷第4期

页      面：1-12页

核心收录：

学科分类：0810[工学-信息与通信工程] 081203[工学-计算机应用技术] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Natural Science Foundation of China [61303204, U1333113] Sichuan Province Science and Technology Support Plan [2012GZX0088-1, 2011GZ0188] Scientific Research Fund of Sichuan Normal University [13KYL06] 

主　　题：FUZZY clustering technique WIRELESS sensor networks COMPUTER algorithms ENERGY consumption DATA analysis 

摘      要：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.