عرض بسيط للتسجيلة

المؤلفAbderrazak, Abdaoui
المؤلفEl Fouly, Tarek Mohamed
تاريخ الإتاحة2024-03-24T04:31:01Z
تاريخ النشر2013
اسم المنشور2013, 7th International Conference on Signal Processing and Communication Systems, ICSPCS 2013 - Proceedings
المصدرScopus
معرّف المصادر الموحدhttp://dx.doi.org/10.1109/ICSPCS.2013.6723980
معرّف المصادر الموحدhttp://hdl.handle.net/10576/53367
الملخصWe consider the binary consensus problem over the wireless sensor networks (WSN), where each node of the network initially observes one of two states and the aim of each node is to decide which one of the two states was held by the majority of nodes. In this paper we consider the averaging of a measurement in aWSN composed of N nodes.We evaluate the distributed binary consensus algorithm by deriving the average convergence time of the algorithm. Since this time has been evaluated theoretically for mathematical aspects [1], we complete this work by considering real life environment including packet loss phenomenon and automatic repeat request (ARQ) protocol used in real message transmissions. In addition we compare the new analytical results with those obtained by a hardware emulation of the same binary consensus algorithm under TinyOS and TOSSIM. In performance evaluation, we consider the analysis of the average convergence time for node states. In the simulations, we apply the distributed binary consensus algorithm for fully connected, ring, path, Erdos Reny ra.ndom, and star-shaped topologies.
اللغةen
الناشرIEEE
الموضوعARQ
Binary consensus algorithm
distributed computation
IRIS Motes
packet loss
TinyOS
Tossim
Wireless sensor network
العنوانOn the distributed binary consensus algorithm in wireless sensor networks
النوعConference Paper
dc.accessType Abstract Only


الملفات في هذه التسجيلة

الملفاتالحجمالصيغةالعرض

لا توجد ملفات لها صلة بهذه التسجيلة.

هذه التسجيلة تظهر في المجموعات التالية

عرض بسيط للتسجيلة