[an error occurred while processing this directive]
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2009, Vol. 35 Issue (5) :631-635    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
�� ˶, �Ѿջ�, �����, �� �*
�������պ����ѧ �����ѧԺ, ���� 100191
Coverage quality problem in wireless sensor networks
Zhang Shuo, Pu Juhua, Liu Yuheng, Xiong Zhang*
School of Computer Science and Technology, Beijing University of Aeronautics and Astronautics, Beijing 100191, China

Download: PDF (415KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ ���͹��ġ��ӳ����������ߴ����������һ����Ҫ����,ͬʱ,�Լ�����򱣳�һ���ĸ����������ܼ�ʱ��׽��Ŀ���״̬�仯.һ�ֹ㷺���õIJ�����ѡ���ܹ���������������Ҫ�����С�ڵ㼯��Ϊ�����ڵ�,�ر���������ڵ�.���,�����������п��ƽڵ������뱣�ָ���������������Ҫ����.�����һ����ѧģ��,�����������������Ƿ����������������С�ڵ���.ʵ�����,�����������ڵ��֪�����ֵ�ϴ�ʱ,����ķ�����Ϊ׼ȷ�ؼ����������С�����ڵ���,�Ҵ˷������Ӷȵ͡��������ڵ�ĸ�֪�������Ϊ������״.���縲��������ڵ�������ͬʱ�ﵽ�����һ��NP������,�����Ŵ��㷨���з���ʵ�鳢���Խ����һ����,Ϊ����������ʵ��Ӧ�ô�����Ҫ����.
Email Alert
�ؼ����� ���ߴ���������   ���Ƿ�������   �������   �Ŵ��㷨     
Abstract�� Extending lifetime by scheduling node state and maintaining the coverage quality are two important aspects in wireless sensor networks (WSNs). It was presented a mathematical model to compute minimum number of nodes under any given required coverage quality. Simulation results demonstrate that our approach is more accurate to compute minimum number of working nodes when the ratio of target region to sensor region is larger, and the complexity of this method is lower while the sensor-s region can be perceived as arbitrary shapes. It is an NP-hard problem that network-s coverage quality and ratio of sleeping nodes get to maximize together. It tried to solve this problem by using genetic algorithm for the experiments, which is significant in WSNs for the practical applications.
Keywords�� wireless sensor networks   coverage quality   optimum combination   genetic algorithms     
Received 2008-08-10;

������Ȼ��ѧ����������Ŀ(60803120); �������պ����ѧ�о�������ʵ������������Ŀ

About author: �� ˶(1983-),Ů,������,˶ʿ��,zhangshuo@cse.buaa.edu.cn.
�� ˶, �Ѿջ�, �����, �� �.���ߴ��������縲����������[J]  �������պ����ѧѧ��, 2009,V35(5): 631-635
Zhang Shuo, Pu Juhua, Liu Yuheng, Xiong Zhang.Coverage quality problem in wireless sensor networks[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2009,V35(5): 631-635
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2009/V35/I5/631
Copyright 2010 by �������պ����ѧѧ��