| 无线传感器网络中基于径向基函数的簇首选择 |
| |
| 引用本文： | 朱晓荣,沈连丰.无线传感器网络中基于径向基函数的簇首选择[J].东南大学学报,2006,22(4):451-455. |
| |
| 作者姓名： | 朱晓荣 沈连丰 |
| |
| 作者单位： | 东南大学移动通信国家重点实验室 南京210096 |
| |
| 基金项目： | The National Natural Science Foundation of China （ No. 60472053 ）, the Natural Science Foundation of Jiangsu Province （No, BK2003055）, the Specialized Research Fund for the Doctoral Program of Higher Education （ No, 20030286017）. |
| |
| 摘 要： | 采用一种神经网络算法——径向基函数来选择无线传感器网络的节点簇首,它具有并行处理能力、分布式存储以及快速学习等优点.通过分析得出与节点作为簇首相关的4个因素:节点的剩余能量,周围分布的节点的数目,中心度和距离基站的位置.把这4个因素作为神经网络的输入变量,输出变量就是该节点作为簇首的适应度值.根据网络规模的大小,基站选出一组作为簇首的节点,然后广播作为簇首的节点号的消息.如果一个节点被选为簇首,就向周围广播自己的身份并成立一个新簇,周围的非簇首节点要求加入该簇并成为它的成员.每簇中由簇首负责管理它的成员并执行数据融合等功能.实验结果表明,与其他算法相比,该算法能显著地延长传感器网络的生命.
|
| 关 键 词： | 传感器网络 径向基函数 簇首选择 |
| 收稿时间： | 04 28 2006 12:00AM |
RBF-based cluster-head selection for wireless sensor networks |
| |
| Zhu Xiaorong,Shen Lianfeng.RBF-based cluster-head selection for wireless sensor networks[J].Journal of Southeast University(English Edition),2006,22(4):451-455. |
| |
| Authors: | Zhu Xiaorong Shen Lianfeng |
| |
| Institution: | National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China |
| |
| Abstract: | The radial basis function (RBF),a kind of neural networks algorithm,is adopted to select cluster-heads. It has many advantages such as simple parallel distributed computation,distributed storage,and fast learning.Four factors related to a node becoming a cluster-head are drawn by analysis,which are energy (energy available in each node),number (the number of neighboring nodes), centrality (a value to classify the nodes based on the proximity how central the node is to the cluster), and location (the distance between the base station and the node).The factors are as input variables of neural networks and the output variable is suitability that is the degree of a node becoming a cluster head.A group of cluster-heads are selected according to the size of network.Then the base station broadcasts a message containing the list of cluster-heads' IDs to all nodes.After that,each cluster-head announces its new status to all its neighbors and sets up a new cluster.If a node around it receives the message,it registers itself to be a member of the cluster.After identifying all the members,the cluster-head manages them and carries out data aggregation in each cluster.Thus data flowing in the network decreases and energy consumption of nodes decreases accordingly.Experimental results show that,compared with other algorithms,the proposed algorithm can significantly increase the lifetime of the sensor network. |
| |
| Keywords: | sensor networks radial basis function cluster-head selection |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
