Ozsoyeller D.Erciyes K.2023-06-162023-06-162008-109.78E+12https://doi.org/10.1109/ISCIS.2008.4717906https://hdl.handle.net/20.500.14365/35722008 23rd International Symposium on Computer and Information Sciences, ISCIS 2008 -- 27 October 2008 through 29 October 2008 -- Istanbul -- 75080A 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.eninfo:eu-repo/semantics/closedAccessAlgorithmsChemical reactionsInformation scienceRouting protocolsSensor networksSensorsSynchronizationTrees (mathematics)Wireless telecommunication systemsIntra clusterWireless sensorsWireless sensor networksConference Object10.1109/ISCIS.2008.47179062-s2.0-58449098450