Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
5,295
Interpreting Broadcast Communication In SCCS
- CONCUR'93, LNCS 715
, 1993
"... CBS (Calculus of Broadcasting Systems) is a process calculus in the style of Robin Milner's CCS, with broadcast as the fundamental communication paradigm. A broadcast communication is an atomic and synchronous event; all participants act at the same instant. However, it is asymmetric in the sen ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
CBS (Calculus of Broadcasting Systems) is a process calculus in the style of Robin Milner's CCS, with broadcast as the fundamental communication paradigm. A broadcast communication is an atomic and synchronous event; all participants act at the same instant. However, it is asymmetric
The Impact of Mobility on Broadcast Communication
"... Reliable broadcast is an important building block for the design and implementation of various Mobile Ad Hoc Network (MANET) protocols. In this paper, we study the impact of mobility on broadcast communication by slowly relaxing the constraints on mobility. As we move toward a less restrictive mobil ..."
Abstract
- Add to MetaCart
Reliable broadcast is an important building block for the design and implementation of various Mobile Ad Hoc Network (MANET) protocols. In this paper, we study the impact of mobility on broadcast communication by slowly relaxing the constraints on mobility. As we move toward a less restrictive
Secure Broadcast Communication Protocol
, 1993
"... this paper, we discuss how to provide the secure group communication based on the distributed scheme by using less-secure broadcast networks. A group of entities is named a cltstet'. In the protocol, only and all the entities in the cluster agree on a same secret key by exchanging the nonce enc ..."
Abstract
- Add to MetaCart
this paper, we discuss how to provide the secure group communication based on the distributed scheme by using less-secure broadcast networks. A group of entities is named a cltstet'. In the protocol, only and all the entities in the cluster agree on a same secret key by exchanging the nonce
Broadcast Communication Interpreted In CCS
, 2000
"... Many algorithms implement broadcast using pairwise communication. But can the translation preserve observational equivalence? Holmer [Hol93] conjectured that it could not, and Ene and Muntian [EM99] showed the conjecture to be true under certain conditions. Here the conjecture is proved false in gen ..."
Abstract
- Add to MetaCart
Many algorithms implement broadcast using pairwise communication. But can the translation preserve observational equivalence? Holmer [Hol93] conjectured that it could not, and Ene and Muntian [EM99] showed the conjecture to be true under certain conditions. Here the conjecture is proved false
Support for broadcast communication in multicomputer networks
, 2002
"... A general-purpose multicomputer network must be able to efficiently handle broadcast communication because it is required by many parallel applications. Previous studies have focused mainly on the design of efficient broadcast algorithms. As a result, there has been hardly any work that assesses the ..."
Abstract
- Add to MetaCart
A general-purpose multicomputer network must be able to efficiently handle broadcast communication because it is required by many parallel applications. Previous studies have focused mainly on the design of efficient broadcast algorithms. As a result, there has been hardly any work that assesses
Computational geometry on the broadcast communication model
- Journal of Information Science and Engineering
, 1999
"... In this paper, we solve three geometric problems, including the ranking, convex hull and closest pair problems, under the broadcast communication model. To solve these problems, we propose a general scheme, the p-division approach, which is based upon the divide-and-conquer strategy. In the 2-dimens ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
In this paper, we solve three geometric problems, including the ranking, convex hull and closest pair problems, under the broadcast communication model. To solve these problems, we propose a general scheme, the p-division approach, which is based upon the divide-and-conquer strategy. In the 2
Broadcast Disks: Data Management for Asymmetric Communications Environments
, 1995
"... This paper proposes the use of repetitive broadcast as a way of augmenting the memory hierarchy of clients in an asymmetric communication environment. We describe a new technique called “Broadcast Disks” for structuring the broadcast in a way that provides improved performance for non-uniformly acce ..."
Abstract
-
Cited by 448 (19 self)
- Add to MetaCart
This paper proposes the use of repetitive broadcast as a way of augmenting the memory hierarchy of clients in an asymmetric communication environment. We describe a new technique called “Broadcast Disks” for structuring the broadcast in a way that provides improved performance for non
Jamming-resistant Broadcast Communication without Shared Keys
- USENIX SECURITY SYMPOSIUM
, 2009
"... Jamming-resistant broadcast communication is crucial for safety-critical applications such as emergency alert broadcasts or the dissemination of navigation signals in adversarial settings. These applications share the need for guaranteed authenticity and availability of messages which are broadcaste ..."
Abstract
-
Cited by 38 (1 self)
- Add to MetaCart
Jamming-resistant broadcast communication is crucial for safety-critical applications such as emergency alert broadcasts or the dissemination of navigation signals in adversarial settings. These applications share the need for guaranteed authenticity and availability of messages which
Expressiveness of Point-to-Point versus Broadcast Communications
- In Fundamentals of Computation Theory, volume 1684 of LNCS
, 1999
"... In this paper we address the problem of the expressive power of point-to-point communication to implement broadcast communication. We demonstrate that point-to-point communication as in CCS [M89] is "too asynchronous" to implement broadcast communication as in CBS [P95]. Milner's -cal ..."
Abstract
-
Cited by 27 (2 self)
- Add to MetaCart
In this paper we address the problem of the expressive power of point-to-point communication to implement broadcast communication. We demonstrate that point-to-point communication as in CCS [M89] is "too asynchronous" to implement broadcast communication as in CBS [P95]. Milner
Thwarting inside jamming attacks on wireless broadcast communications
- In Proceedings of the fourth ACM conference on Wireless network security, WiSec ’11
, 2011
"... ABSTRACT We address the problem of jamming-resistant broadcast communications under an internal threat model. We propose a time-delayed broadcast scheme (TDBS), which implements the broadcast operation as a series of unicast transmissions, distributed in frequency and time. TDBS does not rely on co ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
ABSTRACT We address the problem of jamming-resistant broadcast communications under an internal threat model. We propose a time-delayed broadcast scheme (TDBS), which implements the broadcast operation as a series of unicast transmissions, distributed in frequency and time. TDBS does not rely
Results 1 - 10
of
5,295
