Clustering Time Synchronization Protocol Based on Event Driven for Wireless Sensor Network
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In this paper, we propose a K cover clustering time synchronization algorithm(K-CTSA) based on event driven for wireless sensor networks. When events are detected by a node, the node broadcasts event message. The neighbor nodes switch from dormancy to activation after they receive the broadcast message. In order to ensure the accuracy of the monitoring event, K coverage must be guaranteed in the monitoring area. In this paper, we election K nodes in the event area based on fuzzy logic and the K nodes cooperate to complete the task. The K-CTSA algorithm can select a cluster head from the K nodes. In order to ensure the reliability of monitoring tasks, the clock in the active nodes must be synchronized. Clock offset and drift are estimated by using the minimum linear two multiplication between cluster head and intra cluster nodes. Experimental simulation shows that the network node survival time and stability of K-CTSA are obviously better than the TPSN, which under the premise of ensuring the synchronization accuracy.

    Reference
    Related
    Cited by
Get Citation

徐世武,王平. WSN中基于事件驱动的簇型时间同步协议.计算机系统应用,2016,25(4):162-166

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 22,2015
  • Revised:September 28,2015
  • Adopted:
  • Online: April 19,2016
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063