The broadcast of a message in Mobile Ad Hoc Networks requires its retransmission by multiple devices, consuming both bandwidth and power. In general, broadcast algorithms limit the number of retransmissions but randomly select the nodes that retransmit. This may adversely affect their performance. This paper presents an alternative mechanism for node selection in broadcast algorithms. Evaluatio...

In this paper, we present the performance of different broadcast schemes for multihop sensor networks based on mathematical modeling. In near future many applications will demand multicast (Broadcast) communication feature from the sensor networks. This broadcast feature does not use virtual carrier sensing but relies on physical carrier sensing to reduce collision. For this paper, we analyze t...

Observing that it is impractical to use traditional methods to control concurrency for transaction processing in broadcast-based asymmetric communication environment, this paper introduces a concurrency control protocol designed for broadcast-based transaction processing called STUBcast (Server Timestamp and Update Broadcast Supported Concurrency). It then focuses on the correctness proof of ST...

Broadcast mechanism is prevalent in many forms of electronic networks. Modeling broadcast protocols succinctly and reasoning about how secure these protocols are is gaining importance as society increasingly comes to depend on a wide variety of electronic communications. In this work we present a modified ambient calculus where the nature of communication is broadcast within domains. We allow r...

We derive a new outer bound on the capacity region of broadcast traffic in multiple input broadcast packet erasure channels with feedback, and extend this outer bound to packet erasure relay networks with feedback. We show the tightness of the outer bound for various classes of networks. An important engineering implication of this work is that for network coding schemes for parallel broadcast ...

In this paper, we present the performance of different broadcast schemes for multihop sensor networks based on mathematical modeling. In near future many applications will demand multicast (Broadcast) communication feature from the sensor networks. This broadcast feature does not use virtual carrier sensing but relies on physical carrier sensing to reduce collision. For this paper, we analyze t...

For general broadcast protocols, the natural generalization of the Karp and Miller procedure does not terminate; even the problem of deciding if a broadcast protocol may exhibit an infinite behavior is undecidable [4]. We define a subclass of broadcast protocols, called entropic broadcast protocols, which "contains" the MESI protocol, and we prove that the Generalized Karp and Miller procedure ...

Traditional wireless ad hoc medium access control (MAC) protocols often utilize control frames such as Request-ToSend (RTS), Clear-To-Send (CTS) and Acknowledgement (ACK) to reliably delivery unicast data. However, little effort has been given to improve the reliable delivery of broadcast data. Often, broadcast data are transmitted blindly without any consideration of hidden terminals. In this ...

We begin an investigation of broadcasting from multiple originators, a variant of broadcasting in which any k vertices may be the originators of a message in a network of n vertices. The requirement is that the message be distributed to all n vertices in minimum time. A minimum k-originator broadcast graph is a graph on n vertices with the fewest edges such that any subset of k vertices can bro...

In real-time environments, information is disseminated to clients under timing constraints. In this paper, we focus on the real time data scheduling problem in multiple broadcast channels environments, where the clients are equipped with multiple receivers. Each request is associated with a deadline. The clients can either retrieve data items from the broadcast channels or send requests to the ...