检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:ZHANG HuaZi ZHANG ZhaoYang YUEN Chau
机构地区:[1]Department of Information Science and Electronic Engineering,Zhejiang University,Hangzhou 310027,China [2]Zhejiang Provincial Key Laboratory of Information Network Technology,Hangzhou 310027,China [3]Singapore University of Technology and Design,Singapore
出 处:《Chinese Science Bulletin》2012年第28期3731-3739,共9页
基 金:supported by the National Basic Research Program of China (2009CB320405 and 2012CB316104);the National Natural Science Foundation of China (60972057);the Supporting Program for New Century Excellent Talents in Universities (NCET-09-0701)
摘 要:As a smart combination of cognitive radio networks and wireless sensor networks,recently introduced cognitive radio sensor network(CRSN) poses new challenges to the design of topology maintenance techniques for dynamic primary-user activities.This paper aims to provide a solution to the energy-efficient spectrum-aware CRSN clustering problem.Specifically,we design the clustered structure,establish a network-wide energy consumption model and determine the optimal number of clusters.We then employ the ideas from constrained clustering and propose both a centralized spectrum-aware clustering algorithm and a distributed spectrum-aware clustering(DSAC) protocol.Through extensive simulations,we demonstrate that DSAC can effectively form clusters under a dynamic spectrum-aware constraint.Moreover,DSAC exhibits preferable scalability and stability with its low complexity and quick convergence under dynamic spectrum variation.As a smart combination of cognitive radio networks and wireless sensor networks, recently introduced cognitive radio sensor network (CRSN) poses new challenges to the design of topology maintenance techniques for dynamic primary-user activities. This paper aims to provide a solution to the energy-efficient spectrum-aware CRSN clustering problem. Specifically, we design the clustered structure, establish a network-wide energy consumption model and determine the optimal number of clusters. We then employ the ideas from constrained clustering and propose both a centralized spectrum-aware clustering algorithm and a dis- tributed spectrum-aware clustering (DSAC) protocol. Through extensive simulations, we demonstrate that DSAC can effectively form clusters under a dynamic spectrum-aware constraint. Moreover, DSAC exhibits preferable scalability and stability with its low complexity and quick convergence under dynamic spectrum variation.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147