TL;DR: This work considers the fault-tolerant consensus problem in wireless ad hoc networks with crash-prone nodes and develops consensus algorithms for single-hop environments where the nodes are located within broadcast range of each other, and shows exactly in which cases consensus can be solved.
Abstract: We consider the fault-tolerant consensus problem in wireless ad hoc networks with crash-prone nodes. We develop consensus algorithms for single-hop environments where the nodes are located within broadcast range of each other. Our algorithms tolerate highly unpredictable wireless communication, in which messages may be lost due to collisions, electromagnetic interference, or other anomalies. Accordingly, each node may receive a different set of messages in the same round. In order to minimize collisions, we design adaptive algorithms that attempt to minimize the broadcast contention. To cope with unreliable communication, we augment the nodes with collision detectors and present a new classification of collision detectors in terms of accuracy and completeness, based on practical realities. We show exactly in which cases consensus can be solved, and thus determine the requirements for a useful collision detector.We validate the feasibility of our algorithms, and the underlying wireless model, with simulations based on a realistic 802.11 MAC layer implementation and a detailed radio propagation model. We analyze the performance of our algorithms under varying sizes and densities of deployment and varying MAC layer parameters. We use our single-hop consensus algorithms as the basis for solving consensus in a multi-hop network, demonstrating the resilience of our algorithms to a challenging and noisy environment.
TL;DR: The first polynomial-time algorithm that returns an optimal solution for any instance of the linear case is provided, which works in O(h|N|2) time.
TL;DR: The paper proposes some new trellis codes for TC-OFDM systems to combat the ICI and additive noise and investigates the feasibility of using multiresolution modulation (MRM) as a means for extending the broadcast range.
Abstract: A trellis-coded orthogonal frequency division multiplexing (TC-OFDM) system is studied for digital video broadcasting with emphasis on mobile reception. Mobility causes time variations over the OFDM blocks that leads to an error floor due to inter-channel interference (ICI). The paper proposes some new trellis codes for TC-OFDM systems to combat the ICI and additive noise. It also investigates the feasibility of using multiresolution modulation (MRM) as a means for extending the broadcast range.
TL;DR: In this paper, the authors propose a path control information alteration circuit (PCIAC) to determine a transfer path of a message to a receiving-end processor group, where the message is transferred from an input port in the downstream direction of an output port.
Abstract: In order to determine a transfer path of a message to a receiving-end processor group, a processor includes a routing bit generation circuit, and an exchange switch includes partial broadcast path control circuits and a path control information alteration circuit In order to define the range of a receiving-end processor group, a network includes transfer control circuits A crossbar switch includes transfer control circuits associated with output ports and a boundary register group When a partial broadcast message is transferred from an input port in the downstream direction of an output port, it is decided whether a belonging to the partial broadcast range associated with a connected to the particular input port is connected to the particular output port, whereby the particular partial broadcast message is transferred from the same output port
TL;DR: In this article, a system and method for delivering geographically restricted content, including but not limited to over-air broadcast programming, to a recipient over a computer network, namely the Internet, is described.
Abstract: A system and method for delivering geographically restricted content, including but not limited to over-air broadcast programming, to a recipient over a computer network, namely the Internet. The content is only delivered over the computer network if the recipient's computer or network device requesting the content over the network is verified to be located in the geographically restricted area. A conventional tuner is employed by the recipient's computer to receive one or more over-air signals having a broadcast range deemed to be synonymous with the geographically restricted area for the requested content. If the tuner is able to receive such over-air signal(s), the requested content is delivered over the network to the recipient's computer. This is because the recipient is known to be physically located in the geographically restricted area by the ability of the tuner to receive the over-air signal(s).