No Cover Image

Conference Paper/Proceeding/Abstract 713 views

Exploiting Relative Consensus Techniques in Future Advanced Communication Networks in the Presence of Failures

Mohammad Javad Salehi, Mehraveh Salehi, Hamidreza Bagheri, Babak Khalaj, Pavel Loskot Orcid Logo, Marcos Katz

1st International Conference on Electrical Engineering and Applications, Pages: 1 - 6

Swansea University Author: Pavel Loskot Orcid Logo

Abstract

IIn this paper, a relative consensus algorithm is proposed to enable distributed systems to confront malicious behavior of the network nodes. In service networks, nodes get services from each other, and after each service provision, the receiving node calculates an indicative value of the quality of...

Full description

Published in: 1st International Conference on Electrical Engineering and Applications
Published: Athens, Greece Mosharaka 2014
Online Access: http://mosharaka.net/?Cat=Conferences&Pag=PaperDownloadA&Paper=923
URI: https://cronfa.swan.ac.uk/Record/cronfa21291
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2015-05-11T02:10:42Z
last_indexed 2018-02-09T04:58:41Z
id cronfa21291
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2016-08-04T11:57:27.5723396</datestamp><bib-version>v2</bib-version><id>21291</id><entry>2015-05-10</entry><title>Exploiting Relative Consensus Techniques in Future Advanced Communication Networks in the Presence of Failures</title><swanseaauthors><author><sid>bc7cba9ef306864239b9348c3aea4c3e</sid><ORCID>0000-0002-2773-2186</ORCID><firstname>Pavel</firstname><surname>Loskot</surname><name>Pavel Loskot</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2015-05-10</date><deptcode>EEN</deptcode><abstract>IIn this paper, a relative consensus algorithm is proposed to enable distributed systems to confront malicious behavior of the network nodes. In service networks, nodes get services from each other, and after each service provision, the receiving node calculates an indicative value of the quality of the received service. However, every node can behave maliciously, in either the service provision or the value calculation step. Both Byzantine and Logical malicious behavior types are considered. The aim is to identify the malicious nodes, and then to punish them by other nodes. This is achieved by exploiting Exponential Information Gathering (EIG) data structures. A new algorithm is formulated based on the EIG in order to reach a relative consensus agreement about the faultiness of one specific node before punishing it. The proposed algorithm is theoretically evaluated and discussed to confirm its correctness and validity. Moreover, it is shown that the proposed algorithm puts no constraints on the network structure, and since it has low implementation complexity, it is efficiently applicable to all network types including wireless networks.</abstract><type>Conference Paper/Proceeding/Abstract</type><journal>1st International Conference on Electrical Engineering and Applications</journal><paginationStart>1</paginationStart><paginationEnd>6</paginationEnd><publisher>Mosharaka</publisher><placeOfPublication>Athens, Greece</placeOfPublication><keywords/><publishedDay>31</publishedDay><publishedMonth>1</publishedMonth><publishedYear>2014</publishedYear><publishedDate>2014-01-31</publishedDate><doi/><url>http://mosharaka.net/?Cat=Conferences&amp;amp;Pag=PaperDownloadA&amp;amp;Paper=923</url><notes></notes><college>COLLEGE NANME</college><department>Engineering</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>EEN</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2016-08-04T11:57:27.5723396</lastEdited><Created>2015-05-10T20:48:01.4277016</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Engineering and Applied Sciences - Uncategorised</level></path><authors><author><firstname>Mohammad Javad</firstname><surname>Salehi</surname><order>1</order></author><author><firstname>Mehraveh</firstname><surname>Salehi</surname><order>2</order></author><author><firstname>Hamidreza</firstname><surname>Bagheri</surname><order>3</order></author><author><firstname>Babak</firstname><surname>Khalaj</surname><order>4</order></author><author><firstname>Pavel</firstname><surname>Loskot</surname><orcid>0000-0002-2773-2186</orcid><order>5</order></author><author><firstname>Marcos</firstname><surname>Katz</surname><order>6</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2016-08-04T11:57:27.5723396 v2 21291 2015-05-10 Exploiting Relative Consensus Techniques in Future Advanced Communication Networks in the Presence of Failures bc7cba9ef306864239b9348c3aea4c3e 0000-0002-2773-2186 Pavel Loskot Pavel Loskot true false 2015-05-10 EEN IIn this paper, a relative consensus algorithm is proposed to enable distributed systems to confront malicious behavior of the network nodes. In service networks, nodes get services from each other, and after each service provision, the receiving node calculates an indicative value of the quality of the received service. However, every node can behave maliciously, in either the service provision or the value calculation step. Both Byzantine and Logical malicious behavior types are considered. The aim is to identify the malicious nodes, and then to punish them by other nodes. This is achieved by exploiting Exponential Information Gathering (EIG) data structures. A new algorithm is formulated based on the EIG in order to reach a relative consensus agreement about the faultiness of one specific node before punishing it. The proposed algorithm is theoretically evaluated and discussed to confirm its correctness and validity. Moreover, it is shown that the proposed algorithm puts no constraints on the network structure, and since it has low implementation complexity, it is efficiently applicable to all network types including wireless networks. Conference Paper/Proceeding/Abstract 1st International Conference on Electrical Engineering and Applications 1 6 Mosharaka Athens, Greece 31 1 2014 2014-01-31 http://mosharaka.net/?Cat=Conferences&amp;Pag=PaperDownloadA&amp;Paper=923 COLLEGE NANME Engineering COLLEGE CODE EEN Swansea University 2016-08-04T11:57:27.5723396 2015-05-10T20:48:01.4277016 Faculty of Science and Engineering School of Engineering and Applied Sciences - Uncategorised Mohammad Javad Salehi 1 Mehraveh Salehi 2 Hamidreza Bagheri 3 Babak Khalaj 4 Pavel Loskot 0000-0002-2773-2186 5 Marcos Katz 6
title Exploiting Relative Consensus Techniques in Future Advanced Communication Networks in the Presence of Failures
spellingShingle Exploiting Relative Consensus Techniques in Future Advanced Communication Networks in the Presence of Failures
Pavel Loskot
title_short Exploiting Relative Consensus Techniques in Future Advanced Communication Networks in the Presence of Failures
title_full Exploiting Relative Consensus Techniques in Future Advanced Communication Networks in the Presence of Failures
title_fullStr Exploiting Relative Consensus Techniques in Future Advanced Communication Networks in the Presence of Failures
title_full_unstemmed Exploiting Relative Consensus Techniques in Future Advanced Communication Networks in the Presence of Failures
title_sort Exploiting Relative Consensus Techniques in Future Advanced Communication Networks in the Presence of Failures
author_id_str_mv bc7cba9ef306864239b9348c3aea4c3e
author_id_fullname_str_mv bc7cba9ef306864239b9348c3aea4c3e_***_Pavel Loskot
author Pavel Loskot
author2 Mohammad Javad Salehi
Mehraveh Salehi
Hamidreza Bagheri
Babak Khalaj
Pavel Loskot
Marcos Katz
format Conference Paper/Proceeding/Abstract
container_title 1st International Conference on Electrical Engineering and Applications
container_start_page 1
publishDate 2014
institution Swansea University
publisher Mosharaka
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Engineering and Applied Sciences - Uncategorised{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Engineering and Applied Sciences - Uncategorised
url http://mosharaka.net/?Cat=Conferences&amp;Pag=PaperDownloadA&amp;Paper=923
document_store_str 0
active_str 0
description IIn this paper, a relative consensus algorithm is proposed to enable distributed systems to confront malicious behavior of the network nodes. In service networks, nodes get services from each other, and after each service provision, the receiving node calculates an indicative value of the quality of the received service. However, every node can behave maliciously, in either the service provision or the value calculation step. Both Byzantine and Logical malicious behavior types are considered. The aim is to identify the malicious nodes, and then to punish them by other nodes. This is achieved by exploiting Exponential Information Gathering (EIG) data structures. A new algorithm is formulated based on the EIG in order to reach a relative consensus agreement about the faultiness of one specific node before punishing it. The proposed algorithm is theoretically evaluated and discussed to confirm its correctness and validity. Moreover, it is shown that the proposed algorithm puts no constraints on the network structure, and since it has low implementation complexity, it is efficiently applicable to all network types including wireless networks.
published_date 2014-01-31T03:25:13Z
_version_ 1763750878380032000
score 11.017797

Similar Items