A multi-station packet-radio network

The performance of a multistation packet-radio network in which the nodes of the network employ some collision resolution algorithm (CRA) for accessing a shared radio channel is analyzed. The two CRAs considered here are the binary-tree CRA (BTCRA) and the clipped binary-tree CRA (CBTCRA). The exact analysis of a multistation network with these access schemes is intractable. Therefore, the authors present an approximate method that captures the interactions among the nodes of different stations. The mean idea is to view the interference among the nodes of different stations as independent random noises and compute the probabilities of these noises, taking into account the interactions between the nodes. Numerical results of the approximate analysis are presented and compared with the results of simulations. >

Collision resolution algorithms in multistation packet-radio networks

The author proposes a three-state image model whose elements are named object, background, and new-scene after their representation of the corresponding structural situation. An interframe state transition diagram controlled by luminance differences is introduced. The model is then utilized in a background luminance updating algorithm based on a maximum a posteriori probability. Applications of the model and the updating algorithm in predictive video coding at low bit rate (64 kb/s and less) are suggested. >

An object-background image model for predictive video coding

A multistation packet radio network with m stations and a finite number of nodes n that uses a conflict-free protocol to access the backbone network of stations through a shared channel is discussed. The goal is to derive an allocation of the channel time slots (time-division multiplexing cycle), so that all transmissions will be conflict-free and some measure of performance (e.g., the expected total weighted throughput, the expected weighted holding cost) will be optimized. The methodology that is used is to bound the performance and to allocate the slots according to the golden ratio policy. >

TDM policies in multistation packet radio networks

Packet dynamic resource allocation (packet DRA) is a new medium access control (MAC) protocol that applies interference-adaptive DRA concepts to manage reuse in packet-switched networks Sending and receiving stations use a short handshake to exchange interference-related information and publish it for 3rd parties so they can avoid interfering The protocol is simply described and executed, completely distributed, and compatible with both peer-to-peer and base-station-oriented networks Simulations show significantly higher capacity than carrier-sense multiple access (CSMA) networks

Distributed packet dynamic resource allocation (DRA) for wireless networks

Interference problems in radio networks are investigated. A general model is developed for the case of two interfering channels. The model is used to analyzed the performance of a two-station packet radio network and a CSMA network with hidden terminals. Performance evaluations for both slotted and unslotted systems are presented.

I Cidon

Papers

Carrier sense access in an enviornment of two interfering channels