Algebraic Watchdog: Mitigating Misbehavior in Wireless Network Coding
We propose a secure scheme for wireless network coding, called the algebraic watchdog. By enabling nodes to detect malicious behaviors probabilistically and use overheard messages to police their downstream neighbors locally, the algebraic watchdog delivers a secure global self-checking network. Unl...
Saved in:
| Published in: | IEEE journal on selected areas in communications Vol. 29; no. 10; pp. 1916 - 1925 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.12.2011
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0733-8716, 1558-0008 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We propose a secure scheme for wireless network coding, called the algebraic watchdog. By enabling nodes to detect malicious behaviors probabilistically and use overheard messages to police their downstream neighbors locally, the algebraic watchdog delivers a secure global self-checking network. Unlike traditional Byzantine detection protocols which are receiver-based, this protocol gives the senders an active role in checking the node downstream. The key idea is inspired by Marti et al.'s watchdog-pathrater, which attempts to detect and mitigate the effects of routing misbehavior. We first focus on a two-hop network. We present a graphical model to understand the inference process nodes execute to police their downstream neighbors; as well as to compute, analyze, and approximate the probabilities of misdetection and false detection. We also present an algebraic analysis of the performance using an hypothesis testing framework that provides exact formulae for probabilities of false detection and misdetection. We then extend the algebraic watchdog to a more general network setting, and propose a protocol in which we can establish trust in coded systems in a distributed manner. We develop a graphical model to detect the presence of an adversarial node downstream within a general multi-hop network. The structure of the graphical model (a trellis) lends itself to well-known algorithms (e.g. the Viterbi algorithm) which can compute the probabilities of misdetection and false detection. We show that as long as the min-cut is not dominated by the adversaries, upstream nodes can monitor downstream neighbors and allow reliable communication with certain probability. Finally, we present simulation results that support our analysis. |
|---|---|
| AbstractList | We propose a secure scheme for wireless network coding, called the algebraic watchdog. By enabling nodes to detect malicious behaviors probabilistically and use overheard messages to police their downstream neighbors locally, the algebraic watchdog delivers a secure global self-checking network. Unlike traditional Byzantine detection protocols which are receiver-based, this protocol gives the senders an active role in checking the node downstream. The key idea is inspired by Marti ηl's watchdog-pathrater, which attempts to detect and mitigate the effects of routing misbehavior. We first focus on a two-hop network. We present a graphical model to understand the inference process nodes execute to police their downstream neighbors; as well as to compute, analyze, and approximate the probabilities of misdetection and false detection. We also present an algebraic analysis of the performance using an hypothesis testing framework that provides exact formulae for probabilities of false detection and misdetection. We then extend the algebraic watchdog to a more general network setting, and propose a protocol in which we can establish trust in coded systems in a distributed manner. We develop a graphical model to detect the presence of an adversarial node downstream within a general multi-hop network. The structure of the graphical model (a trellis) lends itself to well-known algorithms (e.g. the Viterbi algorithm) which can compute the probabilities of misdetection and false detection. We show that as long as the min-cut is not dominated by the adversaries, upstream nodes can monitor downstream neighbors and allow reliable communication with certain probability. Finally, we present simulation results that support our analysis. We propose a secure scheme for wireless network coding, called the algebraic watchdog. By enabling nodes to detect malicious behaviors probabilistically and use overheard messages to police their downstream neighbors locally, the algebraic watchdog delivers a secure global self-checking network. Unlike traditional Byzantine detection protocols which are receiver-based, this protocol gives the senders an active role in checking the node downstream. The key idea is inspired by Marti et al.'s watchdog-pathrater, which attempts to detect and mitigate the effects of routing misbehavior. We first focus on a two-hop network. We present a graphical model to understand the inference process nodes execute to police their downstream neighbors; as well as to compute, analyze, and approximate the probabilities of misdetection and false detection. We also present an algebraic analysis of the performance using an hypothesis testing framework that provides exact formulae for probabilities of false detection and misdetection. We then extend the algebraic watchdog to a more general network setting, and propose a protocol in which we can establish trust in coded systems in a distributed manner. We develop a graphical model to detect the presence of an adversarial node downstream within a general multi-hop network. The structure of the graphical model (a trellis) lends itself to well-known algorithms (e.g. the Viterbi algorithm) which can compute the probabilities of misdetection and false detection. We show that as long as the min-cut is not dominated by the adversaries, upstream nodes can monitor downstream neighbors and allow reliable communication with certain probability. Finally, we present simulation results that support our analysis. We propose a secure scheme for wireless network coding, called the algebraic watchdog. By enabling nodes to detect malicious behaviors probabilistically and use overheard messages to police their downstream neighbors locally, the algebraic watchdog delivers a secure global self-checking network. Unlike traditional Byzantine detection protocols which are receiver-based, this protocol gives the senders an active role in checking the node downstream. The key idea is inspired by Marti eta l's watchdog-pathrater, which attempts to detect and mitigate the effects of routing misbehavior. We first focus on a two-hop network. We present a graphical model to understand the inference process nodes execute to police their downstream neighbors; as well as to compute, analyze, and approximate the probabilities of misdetection and false detection. We also present an algebraic analysis of the performance using an hypothesis testing framework that provides exact formulae for probabilities of false detection and misdetection. We then extend the algebraic watchdog to a more general network setting, and propose a protocol in which we can establish trust in coded systems in a distributed manner. We develop a graphical model to detect the presence of an adversarial node downstream within a general multi-hop network. The structure of the graphical model (a trellis) lends itself to well-known algorithms (e.g. the Viterbi algorithm) which can compute the probabilities of misdetection and false detection. We show that as long as the min-cut is not dominated by the adversaries, upstream nodes can monitor downstream neighbors and allow reliable communication with certain probability. Finally, we present simulation results that support our analysis. |
| Author | MinJi Kim Medard, M. Barros, J. |
| Author_xml | – sequence: 1 surname: MinJi Kim fullname: MinJi Kim email: minjikim@mit.edu organization: RLE, Massachusetts Inst. of Technol., Cambridge, MA, USA – sequence: 2 givenname: M. surname: Medard fullname: Medard, M. email: medard@mit.edu organization: RLE, Massachusetts Inst. of Technol., Cambridge, MA, USA – sequence: 3 givenname: J. surname: Barros fullname: Barros, J. email: jbarros@fe.up.pt organization: Fac. de Eng., Inst. de Telecommun., Univ. do Porto, Porto, Portugal |
| BookMark | eNp9kLtOwzAUQC1UJNrCjsQSsTCl3Os86rBVVXmJxwCoo-U4TuqSxsVOQfw9joIYOjDZls6x7j0jMmhMowg5RZggQnZ5_zKbTygg-idSoAdkiEnCQgBgAzKEaRSFbIrpERk5twbAOGZ0SBazulK5FVoGS9HKVWGqq-BRt7oSrW4qf3W5WolPbWygm2CpraqVc8GTar-MfQ_mpvDYMTksRe3Uye85Jm_Xi9f5bfjwfHM3nz2EMkrjNkQUUZFBykSagJCySCkWOcRIi5JlcalYnhRxLjMal5QKRUsKIABFoZTKvTwmF_2_W2s-dsq1fKOdVHUtGmV2jmdpxFJgSD15vkeuzc42fjieQeL74HTqobSHpDXOWVVyqVu_t2laX6TmCLxry7u2vGvL-7ZehD1xa_VG2O__lLNe0X6XP7wbNoqT6Afq2oWh |
| CODEN | ISACEM |
| CitedBy_id | crossref_primary_10_1109_TVT_2022_3214660 crossref_primary_10_1109_TCOMM_2018_2870831 crossref_primary_10_1016_j_comnet_2015_08_023 crossref_primary_10_1016_j_ijepes_2015_11_024 crossref_primary_10_1109_LCOMM_2017_2771274 crossref_primary_10_1109_ACCESS_2019_2933870 crossref_primary_10_1109_LCOMM_2020_3027972 crossref_primary_10_1109_ACCESS_2020_2977428 crossref_primary_10_1109_TVT_2014_2322939 crossref_primary_10_1016_j_comnet_2015_03_010 crossref_primary_10_1109_TII_2017_2754579 crossref_primary_10_1109_TIFS_2020_2980199 crossref_primary_10_1007_s11859_016_1186_1 |
| Cites_doi | 10.1145/501416.501437 10.1109/ISIT.2004.1365180 10.1109/18.850674 10.1109/TIT.2008.926449 10.1109/ISIT.2009.5206004 10.1109/INFCOM.2010.5462052 10.1109/TNET.2003.818197 10.1007/3-540-45748-8_24 10.1109/ISIT.2007.4557283 10.1109/INFCOM.2007.78 10.1109/18.850663 10.1007/3-540-55719-9_77 10.1109/JSAC.2010.100607 10.1109/65.806983 10.1145/345910.345955 10.1016/j.phycom.2008.01.006 10.1016/S1570-8705(03)00008-8 10.1145/357172.357176 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2011 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2011 |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD L7M F28 FR3 |
| DOI | 10.1109/JSAC.2011.111202 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Engineering Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-0008 |
| EndPage | 1925 |
| ExternalDocumentID | 2516819271 10_1109_JSAC_2011_111202 6081345 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 41~ 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT ADRHT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IBMZZ ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TN5 VH1 AAYXX CITATION 7SP 8FD L7M RIG F28 FR3 |
| ID | FETCH-LOGICAL-c364t-11a3d9068a650accd621db0412df894fe8b5d4bc924f22ae2f200a01adeeeb1a3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 16 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000297341300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0733-8716 |
| IngestDate | Sun Sep 28 07:38:08 EDT 2025 Mon Jun 30 05:29:45 EDT 2025 Tue Nov 18 20:55:38 EST 2025 Sat Nov 29 05:32:26 EST 2025 Wed Aug 27 02:47:43 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 10 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c364t-11a3d9068a650accd621db0412df894fe8b5d4bc924f22ae2f200a01adeeeb1a3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 |
| OpenAccessLink | http://hdl.handle.net/1721.1/73449 |
| PQID | 905202177 |
| PQPubID | 85481 |
| PageCount | 10 |
| ParticipantIDs | proquest_journals_905202177 crossref_citationtrail_10_1109_JSAC_2011_111202 proquest_miscellaneous_963860812 ieee_primary_6081345 crossref_primary_10_1109_JSAC_2011_111202 |
| PublicationCentury | 2000 |
| PublicationDate | 2011-December 2011-12-00 20111201 |
| PublicationDateYYYYMMDD | 2011-12-01 |
| PublicationDate_xml | – month: 12 year: 2011 text: 2011-December |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE journal on selected areas in communications |
| PublicationTitleAbbrev | J-SAC |
| PublicationYear | 2011 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref12 ref15 kim (ref21) 2008 ref11 ref10 ref2 ref1 johnson (ref22) 1994 ref17 ref16 ref19 ref18 papadimitratos (ref8) 2002 dietzfelbinger (ref24) 1992; 623 ref23 ref20 elias (ref25) 1957 douceur (ref3) 2002; 2429 yeung (ref14) 2006 castro (ref6) 1999 ref7 ref9 ref4 perlman (ref5) 1988 |
| References_xml | – year: 1999 ident: ref6 article-title: Practical Byzantine fault tolerance publication-title: Symposium on Operating System Design and Implementation – ident: ref1 doi: 10.1145/501416.501437 – ident: ref16 doi: 10.1109/ISIT.2004.1365180 – ident: ref23 doi: 10.1109/18.850674 – start-page: 19 year: 2006 ident: ref14 article-title: Network error correction publication-title: Communications in Information and Systems – start-page: 158 year: 1994 ident: ref22 article-title: Routing in ad hoc networks of mobile hosts publication-title: Proceedings of the Workshop on Mobile Computing Systems and Applications – ident: ref20 doi: 10.1109/TIT.2008.926449 – year: 1988 ident: ref5 publication-title: Network layer protocols with Byzantine robustness – ident: ref10 doi: 10.1109/ISIT.2009.5206004 – ident: ref13 doi: 10.1109/INFCOM.2010.5462052 – ident: ref12 doi: 10.1109/TNET.2003.818197 – volume: 2429 start-page: 251 year: 2002 ident: ref3 article-title: The sybil attack publication-title: Peer-to-Peer Systems Ser Lecture Notes in Computer Science doi: 10.1007/3-540-45748-8_24 – year: 2008 ident: ref21 article-title: Countering Byzantine adversaries with network coding: An overhead analysis publication-title: Proc MILCOM – ident: ref15 doi: 10.1109/ISIT.2007.4557283 – ident: ref19 doi: 10.1109/INFCOM.2007.78 – ident: ref11 doi: 10.1109/18.850663 – volume: 623 start-page: 235 year: 1992 ident: ref24 article-title: Polynomial hash functions are reliable publication-title: Proceedings of the 19th International Colloquium on Automata Languages and Programming doi: 10.1007/3-540-55719-9_77 – year: 1957 ident: ref25 article-title: List decoding for noisy channels publication-title: Technical Report 335 Research Laboratory of Electronics – ident: ref17 doi: 10.1109/JSAC.2010.100607 – ident: ref2 doi: 10.1109/65.806983 – ident: ref9 doi: 10.1145/345910.345955 – ident: ref18 doi: 10.1016/j.phycom.2008.01.006 – year: 2002 ident: ref8 article-title: Secure routing for mobile ad hoc networks publication-title: Proc SCS Communication Networks and Disbributed Systems Modeling and Simulation Conference – ident: ref4 doi: 10.1016/S1570-8705(03)00008-8 – ident: ref7 doi: 10.1145/357172.357176 |
| SSID | ssj0014482 |
| Score | 2.1669316 |
| Snippet | We propose a secure scheme for wireless network coding, called the algebraic watchdog. By enabling nodes to detect malicious behaviors probabilistically and... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1916 |
| SubjectTerms | Algebra Algorithms Approximation Coding Computer hacking Detection Encoding Graphical models Hypothesis testing Military communication Network coding Networks Police Protocol (computers) Protocols Security Studies Watchdog Wireless Wireless communication Wireless networks |
| Title | Algebraic Watchdog: Mitigating Misbehavior in Wireless Network Coding |
| URI | https://ieeexplore.ieee.org/document/6081345 https://www.proquest.com/docview/905202177 https://www.proquest.com/docview/963860812 |
| Volume | 29 |
| WOSCitedRecordID | wos000297341300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-0008 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014482 issn: 0733-8716 databaseCode: RIE dateStart: 19830101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlR1NS8Mw9DGHBz34NcU6lRy8CNa1TZc23sbYEMEhqLhbSZN0DkYr-_D3-5J-ICiCt0BfQvvS9_0FcCWyiGrmha5G-e2GTKdIc5q6MpbcV1oxFUs7bCKaTOLplD-14KaphdFa2-QzfWuWNpavCrkxrrIeQ_lFw_4WbEURK2u1mogBmhk2YhBR6hojoA5Jerz38DwYls06kbCDyoFSiyA7U-UHI7bSZbz_v_c6gL1KiySD8toPoaXzI9j91luwA6PBYmaCwnNJ3pDdvqtidkce52VLjXyGy1Vdok_mOTFZsAvkemRS5oWTYWGk2jG8jkcvw3u3mpngSsrCtev7girusVig6iWkVCzwVWqaaqks5mGm47SvwlSi2ZUFgdBBhmQiPF8o_KoUN59AOy9yfQoEFTnUafuSSypCwUUaC9QFJZOoEighqAO9Go2JrBqKm7kWi8QaFh5PDOITg_ikRLwD182Oj7KZxh-wHYPoBq7CsQPd-qaSitpWCTfJPGhbRQ6Q5imSiYl9iFwXGwRBPmOOCM5-P7cLO9ZbbBNVzqG9Xm70BWzLz_V8tby0v9oXeaHRMQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlR1ZS8Mw-GMeoD54i3UeefBFsK5turbxbQzFYxuCir6VNElnYbTiNn-_X9IDQRF8C_RLaL_0uy-AU56GVAWObyuU37YfqARpTlFbRIK5UslARsIMmwhHo-j1lT204LyphVFKmeQzdaGXJpYvCzHXrrJOgPKL-t0FWNKTs6pqrSZmgIaGiRmElNraDKiDkg7r3D32-mW7TiRtr3Kh1ELITFX5wYqNfLne-N-bbcJ6pUeSXnnxW9BS-TasfesuuANXvclYh4UzQV6Q4b7JYnxJhlnZVCMf43JaF-mTLCc6D3aCfI-Mysxw0i-0XNuF5-urp_6NXU1NsAUN_JntupxK5gQRR-WLCyEDz5WJbqsl04j5qYqSrvQTgYZX6nlceSkSCndcLvGrEty8B4t5kat9IKjKoVbbFUxQ7nPGk4ijNigCgUqB5Jxa0KnRGIuqpbiebDGJjWnhsFgjPtaIj0vEW3DW7Hgv22n8AbujEd3AVTi2oF3fVFzR2zRmOp0HravQAtI8RULR0Q-eq2KOIMhp9BHewe_nnsDKzdNwEA9uR_dtWDW-Y5O2cgiLs4-5OoJl8TnLph_H5rf7AonG1Ho |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Algebraic+Watchdog%3A+Mitigating+Misbehavior+in+Wireless+Network+Coding&rft.jtitle=IEEE+journal+on+selected+areas+in+communications&rft.au=Kim%2C+MinJi&rft.au=Medard%2C+Muriel&rft.au=Barros%2C+Joao&rft.date=2011-12-01&rft.issn=0733-8716&rft.volume=29&rft.issue=10&rft.spage=1916&rft.epage=1925&rft_id=info:doi/10.1109%2FJSAC.2011.111202&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_JSAC_2011_111202 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0733-8716&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0733-8716&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0733-8716&client=summon |