The Experts below are selected from a list of 135 Experts worldwide ranked by ideXlab platform
Patrice Godefroid - One of the best experts on this subject based on the ideXlab platform.
-
symbolic verification of communication protocols with infinite state spaces using qdds extended abstract
Computer Aided Verification, 1996Co-Authors: Bernard Boigelot, Patrice GodefroidAbstract:1 I n t r o d u c t i o n State-space exploration is one of the most successful s trategies for analyzing and verifying properties of finite-state concurrent reactive systems. It proceeds by exploring a global s ta te graph representing the combined behavior of all concurrent components in the system. This is done by recursively exploring all successor s ta tes of all s tates encountered dur ing the exploration, s tar t ing from a given initial s tate, by executing all enabled t ransi t ions in each state. The s ta te graph tha t is explored is called the state space of the system. Many different types of properties of a sys tem can be checked by exploring its s ta te space: deadlocks, dead code, violations of user-specified assertions, etc. Moreover, the range of properties tha t s tate-space explorat ion techniques can verify has been substant ial ly broadened during the last decade thanks to the development of model-checking methods for various temporal logics (e.g., ICES86, LP85, QS81, V~V86]). * "Aspirant" (Research Assistant) for the National Fund for Scientific Research (Belgium). The work of this author was done in part while visiting Bell Laboratories. Verification by state-space exploration has been studied by many researchers (cf. [Liu89, Rud87]). The simplicity of the strategy lends itself to easy, and thus efficient, implementations. Moreover, verification by state-space exploration is fully automatic: no intervention of the designer is required. The main limit of state-space exploration verification techniques is the often excessive size of the state space. Obviously, this state-explosion problem is even more critical when the state space being explored is infinite. In contrast with the last observation, we show in this paper that verification by state-space exploration is also possible for systems with infinite state spaces. Specifically, we consider communication protocols modeled by a finite set of finite-state machines that communicate by exchanging messages via unbounded FIFO queues. We present a state-space exploration Mgorithm that may construct a finite and exact representation of the state space of such a communication protocol, even if this state space is infinite. From this symbolic representation, it is then straightforward to verify many properties of the protocol, such as the absence of deadlocks, whether or not the number of messages stored in a queue is bounded, and the teachability of local and global states. Of course, given an arbitrary protocol, our algorithm may not terminate its search. Indeed, it is well-known that unbounded queues can be used to simulate the tape of a Turing machine, and hence that most interesting verification problems are undecidable for this class of systems [BZ83]. However, in practice, these verification problems may very well turn out to be decidable for a subclass containing most "real" protocols. To support this claim, properties of several communication protocols with infinite state spaces have been verified successfully with the algorithm introduced in this paper. In the next section, we formally define communication protocols. Our algorithm performs a loopfirst search in the state space of the protoco~ being analyzed. A loop-first search is a search technique that at tempts to explore first the results of successive executions of loops in the protocol description (code). This search technique is presented in Section 3. A new data structure, the Queue-content Decision Diagram (QDD), is introduced in Section 4 for representing (possibly infinite) sets of queuecontents. Operations for manipulating QDDs during a loop-first search are presented in Section 5. A loop-first search using QDDs has been implemented, and experiments on several communication protocols with infinite state spemes are reported in Section 6. This paper ends with a comparison between our contributions and related work. 2 Communicat ing Finite-State Mach ines Consider a protocol modeled by a finite set ~4 of finite-state machines that communicate with each other by sending and receiving messages via a finite set Q of unbounded FIFO queues, modeling communication channels. Let Mi denote the set of messages that can be stored i n queue ql, 1 < i < IQI. For Notational Convenience, let us assume that the sets 11~ are pairwise disjoint. Let Ci denote the finite set of states of machine . ~ i , 1 _< i < 12~]. Formally, a protocol P is a tuple (C, co ,A ,Q,M,T) where C = C1 x . . . x CI:~[ is a finite set of control states, co E C is an initial control state, A is a finite set of actions, Q is a finite set of unbounded FIFO queues, ~" = U l ~ M i is a finite set of messages, and T is a finite set of transitions, each of which is a triple of the form (cl, op, c2) where cl and c2 are control states, and op is a label of one of the forms qi!w, where qi E Q and w E M~*, q~?w, where q~ E Q and w E M~*, or a, where a E A . A transition of the form (cl, qi!w, c~) represents a change of the control state from cl to c2 while appending the messages composing w to the end of queue ql. A transition of the form (cl, qi?w, c2) represents a change of the control state from cl to c2 while removing the messages composing w Srom the head of queue qi. A global state of a protocol is composed of a control state and a queue-content. A queue-content
-
CAV - Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract)
1996Co-Authors: Bernard Boigelot, Patrice GodefroidAbstract:1 I n t r o d u c t i o n State-space exploration is one of the most successful s trategies for analyzing and verifying properties of finite-state concurrent reactive systems. It proceeds by exploring a global s ta te graph representing the combined behavior of all concurrent components in the system. This is done by recursively exploring all successor s ta tes of all s tates encountered dur ing the exploration, s tar t ing from a given initial s tate, by executing all enabled t ransi t ions in each state. The s ta te graph tha t is explored is called the state space of the system. Many different types of properties of a sys tem can be checked by exploring its s ta te space: deadlocks, dead code, violations of user-specified assertions, etc. Moreover, the range of properties tha t s tate-space explorat ion techniques can verify has been substant ial ly broadened during the last decade thanks to the development of model-checking methods for various temporal logics (e.g., ICES86, LP85, QS81, V~V86]). * "Aspirant" (Research Assistant) for the National Fund for Scientific Research (Belgium). The work of this author was done in part while visiting Bell Laboratories. Verification by state-space exploration has been studied by many researchers (cf. [Liu89, Rud87]). The simplicity of the strategy lends itself to easy, and thus efficient, implementations. Moreover, verification by state-space exploration is fully automatic: no intervention of the designer is required. The main limit of state-space exploration verification techniques is the often excessive size of the state space. Obviously, this state-explosion problem is even more critical when the state space being explored is infinite. In contrast with the last observation, we show in this paper that verification by state-space exploration is also possible for systems with infinite state spaces. Specifically, we consider communication protocols modeled by a finite set of finite-state machines that communicate by exchanging messages via unbounded FIFO queues. We present a state-space exploration Mgorithm that may construct a finite and exact representation of the state space of such a communication protocol, even if this state space is infinite. From this symbolic representation, it is then straightforward to verify many properties of the protocol, such as the absence of deadlocks, whether or not the number of messages stored in a queue is bounded, and the teachability of local and global states. Of course, given an arbitrary protocol, our algorithm may not terminate its search. Indeed, it is well-known that unbounded queues can be used to simulate the tape of a Turing machine, and hence that most interesting verification problems are undecidable for this class of systems [BZ83]. However, in practice, these verification problems may very well turn out to be decidable for a subclass containing most "real" protocols. To support this claim, properties of several communication protocols with infinite state spaces have been verified successfully with the algorithm introduced in this paper. In the next section, we formally define communication protocols. Our algorithm performs a loopfirst search in the state space of the protoco~ being analyzed. A loop-first search is a search technique that at tempts to explore first the results of successive executions of loops in the protocol description (code). This search technique is presented in Section 3. A new data structure, the Queue-content Decision Diagram (QDD), is introduced in Section 4 for representing (possibly infinite) sets of queuecontents. Operations for manipulating QDDs during a loop-first search are presented in Section 5. A loop-first search using QDDs has been implemented, and experiments on several communication protocols with infinite state spemes are reported in Section 6. This paper ends with a comparison between our contributions and related work. 2 Communicat ing Finite-State Mach ines Consider a protocol modeled by a finite set ~4 of finite-state machines that communicate with each other by sending and receiving messages via a finite set Q of unbounded FIFO queues, modeling communication channels. Let Mi denote the set of messages that can be stored i n queue ql, 1 < i < IQI. For Notational Convenience, let us assume that the sets 11~ are pairwise disjoint. Let Ci denote the finite set of states of machine . ~ i , 1 _< i < 12~]. Formally, a protocol P is a tuple (C, co ,A ,Q,M,T) where C = C1 x . . . x CI:~[ is a finite set of control states, co E C is an initial control state, A is a finite set of actions, Q is a finite set of unbounded FIFO queues, ~" = U l ~ M i is a finite set of messages, and T is a finite set of transitions, each of which is a triple of the form (cl, op, c2) where cl and c2 are control states, and op is a label of one of the forms qi!w, where qi E Q and w E M~*, q~?w, where q~ E Q and w E M~*, or a, where a E A . A transition of the form (cl, qi!w, c~) represents a change of the control state from cl to c2 while appending the messages composing w to the end of queue ql. A transition of the form (cl, qi?w, c2) represents a change of the control state from cl to c2 while removing the messages composing w Srom the head of queue qi. A global state of a protocol is composed of a control state and a queue-content. A queue-content
Bernard Boigelot - One of the best experts on this subject based on the ideXlab platform.
-
symbolic verification of communication protocols with infinite state spaces using qdds extended abstract
Computer Aided Verification, 1996Co-Authors: Bernard Boigelot, Patrice GodefroidAbstract:1 I n t r o d u c t i o n State-space exploration is one of the most successful s trategies for analyzing and verifying properties of finite-state concurrent reactive systems. It proceeds by exploring a global s ta te graph representing the combined behavior of all concurrent components in the system. This is done by recursively exploring all successor s ta tes of all s tates encountered dur ing the exploration, s tar t ing from a given initial s tate, by executing all enabled t ransi t ions in each state. The s ta te graph tha t is explored is called the state space of the system. Many different types of properties of a sys tem can be checked by exploring its s ta te space: deadlocks, dead code, violations of user-specified assertions, etc. Moreover, the range of properties tha t s tate-space explorat ion techniques can verify has been substant ial ly broadened during the last decade thanks to the development of model-checking methods for various temporal logics (e.g., ICES86, LP85, QS81, V~V86]). * "Aspirant" (Research Assistant) for the National Fund for Scientific Research (Belgium). The work of this author was done in part while visiting Bell Laboratories. Verification by state-space exploration has been studied by many researchers (cf. [Liu89, Rud87]). The simplicity of the strategy lends itself to easy, and thus efficient, implementations. Moreover, verification by state-space exploration is fully automatic: no intervention of the designer is required. The main limit of state-space exploration verification techniques is the often excessive size of the state space. Obviously, this state-explosion problem is even more critical when the state space being explored is infinite. In contrast with the last observation, we show in this paper that verification by state-space exploration is also possible for systems with infinite state spaces. Specifically, we consider communication protocols modeled by a finite set of finite-state machines that communicate by exchanging messages via unbounded FIFO queues. We present a state-space exploration Mgorithm that may construct a finite and exact representation of the state space of such a communication protocol, even if this state space is infinite. From this symbolic representation, it is then straightforward to verify many properties of the protocol, such as the absence of deadlocks, whether or not the number of messages stored in a queue is bounded, and the teachability of local and global states. Of course, given an arbitrary protocol, our algorithm may not terminate its search. Indeed, it is well-known that unbounded queues can be used to simulate the tape of a Turing machine, and hence that most interesting verification problems are undecidable for this class of systems [BZ83]. However, in practice, these verification problems may very well turn out to be decidable for a subclass containing most "real" protocols. To support this claim, properties of several communication protocols with infinite state spaces have been verified successfully with the algorithm introduced in this paper. In the next section, we formally define communication protocols. Our algorithm performs a loopfirst search in the state space of the protoco~ being analyzed. A loop-first search is a search technique that at tempts to explore first the results of successive executions of loops in the protocol description (code). This search technique is presented in Section 3. A new data structure, the Queue-content Decision Diagram (QDD), is introduced in Section 4 for representing (possibly infinite) sets of queuecontents. Operations for manipulating QDDs during a loop-first search are presented in Section 5. A loop-first search using QDDs has been implemented, and experiments on several communication protocols with infinite state spemes are reported in Section 6. This paper ends with a comparison between our contributions and related work. 2 Communicat ing Finite-State Mach ines Consider a protocol modeled by a finite set ~4 of finite-state machines that communicate with each other by sending and receiving messages via a finite set Q of unbounded FIFO queues, modeling communication channels. Let Mi denote the set of messages that can be stored i n queue ql, 1 < i < IQI. For Notational Convenience, let us assume that the sets 11~ are pairwise disjoint. Let Ci denote the finite set of states of machine . ~ i , 1 _< i < 12~]. Formally, a protocol P is a tuple (C, co ,A ,Q,M,T) where C = C1 x . . . x CI:~[ is a finite set of control states, co E C is an initial control state, A is a finite set of actions, Q is a finite set of unbounded FIFO queues, ~" = U l ~ M i is a finite set of messages, and T is a finite set of transitions, each of which is a triple of the form (cl, op, c2) where cl and c2 are control states, and op is a label of one of the forms qi!w, where qi E Q and w E M~*, q~?w, where q~ E Q and w E M~*, or a, where a E A . A transition of the form (cl, qi!w, c~) represents a change of the control state from cl to c2 while appending the messages composing w to the end of queue ql. A transition of the form (cl, qi?w, c2) represents a change of the control state from cl to c2 while removing the messages composing w Srom the head of queue qi. A global state of a protocol is composed of a control state and a queue-content. A queue-content
-
CAV - Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract)
1996Co-Authors: Bernard Boigelot, Patrice GodefroidAbstract:1 I n t r o d u c t i o n State-space exploration is one of the most successful s trategies for analyzing and verifying properties of finite-state concurrent reactive systems. It proceeds by exploring a global s ta te graph representing the combined behavior of all concurrent components in the system. This is done by recursively exploring all successor s ta tes of all s tates encountered dur ing the exploration, s tar t ing from a given initial s tate, by executing all enabled t ransi t ions in each state. The s ta te graph tha t is explored is called the state space of the system. Many different types of properties of a sys tem can be checked by exploring its s ta te space: deadlocks, dead code, violations of user-specified assertions, etc. Moreover, the range of properties tha t s tate-space explorat ion techniques can verify has been substant ial ly broadened during the last decade thanks to the development of model-checking methods for various temporal logics (e.g., ICES86, LP85, QS81, V~V86]). * "Aspirant" (Research Assistant) for the National Fund for Scientific Research (Belgium). The work of this author was done in part while visiting Bell Laboratories. Verification by state-space exploration has been studied by many researchers (cf. [Liu89, Rud87]). The simplicity of the strategy lends itself to easy, and thus efficient, implementations. Moreover, verification by state-space exploration is fully automatic: no intervention of the designer is required. The main limit of state-space exploration verification techniques is the often excessive size of the state space. Obviously, this state-explosion problem is even more critical when the state space being explored is infinite. In contrast with the last observation, we show in this paper that verification by state-space exploration is also possible for systems with infinite state spaces. Specifically, we consider communication protocols modeled by a finite set of finite-state machines that communicate by exchanging messages via unbounded FIFO queues. We present a state-space exploration Mgorithm that may construct a finite and exact representation of the state space of such a communication protocol, even if this state space is infinite. From this symbolic representation, it is then straightforward to verify many properties of the protocol, such as the absence of deadlocks, whether or not the number of messages stored in a queue is bounded, and the teachability of local and global states. Of course, given an arbitrary protocol, our algorithm may not terminate its search. Indeed, it is well-known that unbounded queues can be used to simulate the tape of a Turing machine, and hence that most interesting verification problems are undecidable for this class of systems [BZ83]. However, in practice, these verification problems may very well turn out to be decidable for a subclass containing most "real" protocols. To support this claim, properties of several communication protocols with infinite state spaces have been verified successfully with the algorithm introduced in this paper. In the next section, we formally define communication protocols. Our algorithm performs a loopfirst search in the state space of the protoco~ being analyzed. A loop-first search is a search technique that at tempts to explore first the results of successive executions of loops in the protocol description (code). This search technique is presented in Section 3. A new data structure, the Queue-content Decision Diagram (QDD), is introduced in Section 4 for representing (possibly infinite) sets of queuecontents. Operations for manipulating QDDs during a loop-first search are presented in Section 5. A loop-first search using QDDs has been implemented, and experiments on several communication protocols with infinite state spemes are reported in Section 6. This paper ends with a comparison between our contributions and related work. 2 Communicat ing Finite-State Mach ines Consider a protocol modeled by a finite set ~4 of finite-state machines that communicate with each other by sending and receiving messages via a finite set Q of unbounded FIFO queues, modeling communication channels. Let Mi denote the set of messages that can be stored i n queue ql, 1 < i < IQI. For Notational Convenience, let us assume that the sets 11~ are pairwise disjoint. Let Ci denote the finite set of states of machine . ~ i , 1 _< i < 12~]. Formally, a protocol P is a tuple (C, co ,A ,Q,M,T) where C = C1 x . . . x CI:~[ is a finite set of control states, co E C is an initial control state, A is a finite set of actions, Q is a finite set of unbounded FIFO queues, ~" = U l ~ M i is a finite set of messages, and T is a finite set of transitions, each of which is a triple of the form (cl, op, c2) where cl and c2 are control states, and op is a label of one of the forms qi!w, where qi E Q and w E M~*, q~?w, where q~ E Q and w E M~*, or a, where a E A . A transition of the form (cl, qi!w, c~) represents a change of the control state from cl to c2 while appending the messages composing w to the end of queue ql. A transition of the form (cl, qi?w, c2) represents a change of the control state from cl to c2 while removing the messages composing w Srom the head of queue qi. A global state of a protocol is composed of a control state and a queue-content. A queue-content
K. A. Earle - One of the best experts on this subject based on the ideXlab platform.
-
Evaluation of PROforma as a language for implementing medical guidelines in a practical context
BMC Medical Informatics and Decision Making, 2006Co-Authors: David R. Sutton, Paul Taylor, K. A. EarleAbstract:PROforma is one of several languages that allow clinical guidelines to be expressed in a computer-interpretable manner. How these languages should be compared, and what requirements they should meet, are questions that are being actively addressed by a community of interested researchers. We have developed a system to allow hypertensive patients to be monitored and assessed without visiting their GPs (except in the most urgent cases). Blood pressure measurements are performed at the patients' pharmacies and a web-based system, created using PROforma, makes recommendations for continued monitoring, and/or changes in medication. The recommendations and measurements are transmitted electronically to a practitioner with authority to issue and change prescriptions. We evaluated the use of PROforma during the knowledge acquisition, analysis, design and implementation of this system. The analysis focuses on the logical adequacy, heuristic power, Notational Convenience, and explanation support provided by the PROforma language. PROforma proved adequate as a language for the implementation of the clinical reasoning required by this project. However a lack of Notational Convenience led us to use UML activity diagrams, rather than PROforma process descriptions, to create the models that were used during the knowledge acquisition and analysis phases of the project. These UML diagrams were translated into PROforma during the implementation of the project. The experience accumulated during this study highlighted the importance of structure preserving design, that is to say that the models used in the design and implementation of a knowledge-based system should be structurally similar to those created during knowledge acquisition and analysis. Ideally the same language should be used for all of these models. This means that great importance has to be attached to the Notational Convenience of these languages, by which we mean the ease with which they can be read, written, and understood by human beings. The importance of Notational Convenience arises from the fact that a language used during knowledge acquisition and analysis must be intelligible to the potential users of a system, and to the domain experts who provide the knowledge that will be used in its construction.
-
Evaluation of PROforma as a language for implementing medical guidelines in a practical context
BMC Medical Informatics and Decision Making, 2006Co-Authors: K. A. EarleAbstract:Background: PROforma is one of several languages that allow clinical guidelines to be expressed in a computer-interpretable manner. How these languages should be compared, and what requirements they should meet, are questions that are being actively addressed by a community of interested researchers. Methods: We have developed a system to allow hypertensive patients to be monitored and assessed without visiting their GPs (except in the most urgent cases). Blood pressure measurements are performed at the patients' pharmacies and a web-based system, created using PROforma, makes recommendations for continued monitoring, and/or changes in medication. The recommendations and measurements are transmitted electronically to a practitioner with authority to issue and change prescriptions. We evaluated the use of PROforma during the knowledge acquisition, analysis, design and implementation of this system. The analysis focuses on the logical adequacy, heuristic power, Notational Convenience, and explanation support provided by the PROforma language. Results: PROforma proved adequate as a language for the implementation of the clinical reasoning required by this project. However a lack of Notational Convenience led us to use UML activity diagrams, rather than PROforma process descriptions, to create the models that were used during the knowledge acquisition and analysis phases of the project. These UML diagrams were translated into PROforma during the implementation of the project. Conclusion: The experience accumulated during this study highlighted the importance of structure preserving design, that is to say that the models used in the design and implementation of a knowledge-based system should be structurally similar to those created during knowledge acquisition and analysis. Ideally the same language should be used for all of these models. This means that great importance has to be attached to the Notational Convenience of these languages, by which we mean the ease with which they can be read, written, and understood by human beings. The importance of Notational Convenience arises from the fact that a language used during knowledge acquisition and analysis must be intelligible to the potential users of a system, and to the domain experts who provide the knowledge that will be used in its construction. © 2006Sutton et al; licensee BioMed Central Ltd.
Weiming Shen - One of the best experts on this subject based on the ideXlab platform.
-
Eavesdropping attack in collaborative wireless networks: Security protocols and intercept behavior
Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD), 2013Co-Authors: Xianbin Wang, Weiming ShenAbstract:In this paper, we investigate security issues in a collaborative wireless network in the presence of eavesdropping attacks, where multiple amplify-and-forward (AF) relays are exploited to secure the message transmission between legitimate users. We first consider the multiple AF relays all participating in assisting the transmission from source to destination, which is called all-relay based collaborative transmission scheme as denoted by all-relay scheme for Notational Convenience. We also propose the best-relay transmission scheme in which only the single “best” relay is selected to help the source transmit messages to destination. We then analyze the intercept behavior in wireless networks and evaluate intercept probabilities of the proposed all-relay and best-relay schemes as well as the conventional direct transmission without relay in a Rayleigh fading environment. Numerical results show that the best-relay transmission scheme always outperforms the all-relay and direct transmission schemes in terms of intercept probability. It is also shown that as the number of eavesdroppers increases, the intercept probabilities of both all-relay and best-relay schemes increase. Moreover, the intercept probability performance of all-relay and best-relay schemes significantly improves with an increasing number of relays, implying the advantage of exploiting multiple relays against eavesdropping attacks.
-
CSCWD - Eavesdropping attack in collaborative wireless networks: Security protocols and intercept behavior
Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD), 2013Co-Authors: Xianbin Wang, Weiming ShenAbstract:In this paper, we investigate security issues in a collaborative wireless network in the presence of eavesdropping attacks, where multiple amplify-and-forward (AF) relays are exploited to secure the message transmission between legitimate users. We first consider the multiple AF relays all participating in assisting the transmission from source to destination, which is called all-relay based collaborative transmission scheme as denoted by all-relay scheme for Notational Convenience. We also propose the best-relay transmission scheme in which only the single “best” relay is selected to help the source transmit messages to destination. We then analyze the intercept behavior in wireless networks and evaluate intercept probabilities of the proposed all-relay and best-relay schemes as well as the conventional direct transmission without relay in a Rayleigh fading environment. Numerical results show that the best-relay transmission scheme always outperforms the all-relay and direct transmission schemes in terms of intercept probability. It is also shown that as the number of eavesdroppers increases, the intercept probabilities of both all-relay and best-relay schemes increase. Moreover, the intercept probability performance of all-relay and best-relay schemes significantly improves with an increasing number of relays, implying the advantage of exploiting multiple relays against eavesdropping attacks.
Xianbin Wang - One of the best experts on this subject based on the ideXlab platform.
-
Eavesdropping attack in collaborative wireless networks: Security protocols and intercept behavior
Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD), 2013Co-Authors: Xianbin Wang, Weiming ShenAbstract:In this paper, we investigate security issues in a collaborative wireless network in the presence of eavesdropping attacks, where multiple amplify-and-forward (AF) relays are exploited to secure the message transmission between legitimate users. We first consider the multiple AF relays all participating in assisting the transmission from source to destination, which is called all-relay based collaborative transmission scheme as denoted by all-relay scheme for Notational Convenience. We also propose the best-relay transmission scheme in which only the single “best” relay is selected to help the source transmit messages to destination. We then analyze the intercept behavior in wireless networks and evaluate intercept probabilities of the proposed all-relay and best-relay schemes as well as the conventional direct transmission without relay in a Rayleigh fading environment. Numerical results show that the best-relay transmission scheme always outperforms the all-relay and direct transmission schemes in terms of intercept probability. It is also shown that as the number of eavesdroppers increases, the intercept probabilities of both all-relay and best-relay schemes increase. Moreover, the intercept probability performance of all-relay and best-relay schemes significantly improves with an increasing number of relays, implying the advantage of exploiting multiple relays against eavesdropping attacks.
-
CSCWD - Eavesdropping attack in collaborative wireless networks: Security protocols and intercept behavior
Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD), 2013Co-Authors: Xianbin Wang, Weiming ShenAbstract:In this paper, we investigate security issues in a collaborative wireless network in the presence of eavesdropping attacks, where multiple amplify-and-forward (AF) relays are exploited to secure the message transmission between legitimate users. We first consider the multiple AF relays all participating in assisting the transmission from source to destination, which is called all-relay based collaborative transmission scheme as denoted by all-relay scheme for Notational Convenience. We also propose the best-relay transmission scheme in which only the single “best” relay is selected to help the source transmit messages to destination. We then analyze the intercept behavior in wireless networks and evaluate intercept probabilities of the proposed all-relay and best-relay schemes as well as the conventional direct transmission without relay in a Rayleigh fading environment. Numerical results show that the best-relay transmission scheme always outperforms the all-relay and direct transmission schemes in terms of intercept probability. It is also shown that as the number of eavesdroppers increases, the intercept probabilities of both all-relay and best-relay schemes increase. Moreover, the intercept probability performance of all-relay and best-relay schemes significantly improves with an increasing number of relays, implying the advantage of exploiting multiple relays against eavesdropping attacks.
