Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/3572
Title: A hierarchical architecture to implement a ? synchronizer in wireless sensor networks
Authors: Ozsoyeller D.
Erciyes K.
Keywords: Algorithms
Chemical reactions
Information science
Routing protocols
Sensor networks
Sensors
Synchronization
Trees (mathematics)
Wireless telecommunication systems
Intra cluster
Wireless sensors
Wireless sensor networks
Abstract: A synchronizer provides synchronous execution of asynchronous algorithms in an asynchronous network. We provide an architecture for a ? synchronizer in a wireless sensor network. The sensor network is partitioned into clusters of connected sub-spanning trees by an algorithm described in[1] in the first phase. Once the sub-spanning trees in the clusters are formed, the Ring Formation Algorithm provides bands of rings among the clusterheads of the same levels. This structure provides the necessary architecture for the ? synchronizer where communication between the clusters is performed using the ring similar to a ? synchronizer and the intra cluster communication is accomplished using the sub-spanning tree as in ? synchronizers. We discuss the model along with the algorithms and show that this architecture provides scalable operation of a ? synchronizer in a sensor network of significant size. © 2008 IEEE.
Description: 2008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008 -- 27 October 2008 through 29 October 2008 -- Istanbul -- 75080
URI: https://doi.org/10.1109/ISCIS.2008.4717906
https://hdl.handle.net/20.500.14365/3572
ISBN: 9.78142E+12
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Files in This Item:
File SizeFormat 
2664.pdf
  Restricted Access
1.35 MBAdobe PDFView/Open    Request a copy
Show full item record



CORE Recommender

Page view(s)

64
checked on Sep 30, 2024

Download(s)

6
checked on Sep 30, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.