Distributed Cooperative Synchronization for Large-Scale 4G Wireless Sensor Networks Using CAZAC Sequences

被引:4
作者
Saedy, Mahdy [1 ]
Kelley, Brian [2 ]
机构
[1] Univ Texas San Antonio, San Antonio, TX 78249 USA
[2] Univ Texas San Antonio, Dept Elect & Comp Engn ECE, San Antonio, TX 78249 USA
关键词
Ad Hoc; Consensus; Constant Amplitude Zero Auto Correlation (CAZAC) Sequences; Cooperative; Distributed; Random Networks; Scale-Free; Synchronization;
D O I
10.4018/jitn.2012010104
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Clock synchronization is an important requirement of wireless sensor networks (WSNs). Synchronization is crucial to maintain data consistency, coordination, and perform fundamental operations. Many application scenarios exist where external clock synchronization may be required because WSN itself may not consist of an infrastructure for distributing the clock reference. In distributed systems the clock of a reference node is synchronized with GPS time tag or UTC as conventional external clock sources. The rest of the nodes estimate the offset and drift based on a synchronization protocol. For vast WSN, where the topology introduces propagation delay and fast drift rate of clock over sampling periods, synchronizing the WSN nodes and maintaining the synchronization is difficult. To maintain an accurate synchronization across the WSN, the authors propose a cooperative synchronization method, which uses Constant Amplitude Zero Auto Correlation (CAZAC) sequences for OFDM symbols. The proposed method is part of a class of distributed methods known as Gossip or Consensus. These protocols are robust and self-correcting to topology changes and link failure. In this paper, the authors introduce a specific type of power-law topology called scale-free and compare the synchronization performance of the proposed method in random and scale-free topologies.
引用
收藏
页码:56 / 71
页数:16
相关论文
共 28 条
  • [1] 3rd Generation Partnership Project, 2008, 36211 3GPP TS
  • [2] Energy-Efficient Gradient Time Synchronization for Wireless Sensor Networks
    Apicharttrisorn, Kittipat
    Choochaisri, Supasate
    Intanagonwiwat, Chalermek
    [J]. 2010 SECOND INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE, COMMUNICATION SYSTEMS AND NETWORKS (CICSYN), 2010, : 124 - 129
  • [3] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [4] Barrat A., 2008, DYNAMICAL PROCESSES, DOI [10.1017/CBO9780511791383, DOI 10.1017/CBO9780511791383]
  • [5] Randomized gossip algorithms
    Boyd, Stephen
    Ghosh, Arpita
    Prabhakar, Balaji
    Shah, Devavrat
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) : 2508 - 2530
  • [6] Chunlin Y., 2006, J ELECT INFORM TECHN, V28, P139
  • [7] Information flow and cooperative control of vehicle formations
    Fax, JA
    Murray, RM
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2004, 49 (09) : 1465 - 1476
  • [8] Ghash A., 2007, P 18 ANN IEEE INT S, P1
  • [9] Grimmett G.R., 2001, PROBABILITY RANDOM P
  • [10] [胡晓宇 HU Xiaoyu], 2008, [高分子通报, Polymer Bulletin], P1