Literature Database Entry

zou2021distributed


Yifei Zou, Dongxiao Yu, Jiguo Yu, Yong Zhang, Falko Dressler and Xiuzhen Cheng, "Distributed Byzantine-Resilient Multiple-Message Dissemination in Wireless Networks," IEEE/ACM Transactions on Networking, vol. 29 (4), pp. 1662–1675, August 2021.


Abstract

The byzantine model is widely used to depict a variety of node faults in networks. Previous studies on byzantine-resilient protocols in wireless networks assume reliable communications and do not consider the jamming behavior of byzantine nodes. Such jamming, however, is a very critical and realistic behavior to be considered in modern wireless networks. In this paper, for the first time, we integrate the jamming behavior of byzantine nodes into the network setting. We show that, in this much more comprehensive and harsh model, efficient distributed communication protocols can be still devised with elaborate protocol design. In particular, we developed an algorithm that can accomplish the basic multiple-message dissemination task close to the optimal solution in terms of running time. Empirical results validate the byzantine-resilience and efficiency of our algorithm.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Yifei Zou
Dongxiao Yu
Jiguo Yu
Yong Zhang
Falko Dressler
Xiuzhen Cheng

BibTeX reference

@article{zou2021distributed,
    author = {Zou, Yifei and Yu, Dongxiao and Yu, Jiguo and Zhang, Yong and Dressler, Falko and Cheng, Xiuzhen},
    doi = {10.1109/TNET.2021.3069324},
    title = {{Distributed Byzantine-Resilient Multiple-Message Dissemination in Wireless Networks}},
    pages = {1662--1675},
    journal = {IEEE/ACM Transactions on Networking},
    issn = {1063-6692},
    publisher = {IEEE},
    month = {8},
    number = {4},
    volume = {29},
    year = {2021},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.

Last modified: 2024-12-03