Improving broadcast efficiency in wireless sensor network time synchronization protocols

Authors:
Wenxun Huang;Yujuan Quan;Deming Chen
Affiliations:
University of Illinois at Urbana-Champaign, Urbana, IL;Computer Center of Ji Nan University, Guangzhou, China;University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
Proceedings of the International Workshop on System Level Interconnect Prediction
Year:
2012

Citing 9
Cited 0

Approximating maximum leaf spanning trees in almost linear time

Journal of Algorithms
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Timing-sync protocol for sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Versatile low power media access for wireless sensor networks

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Fine-grained network time synchronization using reference broadcasts

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Wakeup scheduling in wireless sensor networks

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Optimal clock synchronization in networks

Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Evaluation of clock synchronization protocols for wireless sensor networks

WD'09 Proceedings of the 2nd IFIP conference on Wireless days

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we proposed an algorithm to allow nodes in a wireless sensor network to interconnect in a way such that time stamp information can be efficiently distributed for network wide synchronization. The algorithm works by first establishing a level hierarchy in the network, and then solves set cover problems between adjacent levels through local interactions of the nodes. A proof is included to demonstrate the correctness of the distributed set cover method used in the algorithm. The algorithm features low overhead since it does not require any neighboring node list to be sent, making it ideal for networks with high connectivity. The efficiency and operation of the algorithm is studied through simulations.