Results 201 to 210 of about 25,242 (261)
Some of the next articles are maybe not open access.

Related searches:

Scheduling transmissions in a network

Journal of Algorithms, 1985
Summary: Consider k stations wishing to transmit messages over a network of channels to a common receiver. The capacity of a channel is the maximum amount of data which can be transmitted in a time unit. In addition to the transmission stations, the network contains switching nodes.
Alon Itai, Michael Rodeh
openaire   +2 more sources

On Transmission Scheduling in Wireless Networks

2006 IEEE International Symposium on Information Theory, 2006
In the 1990s Chlamtac and Farago introduced a Transmission Scheduling (TS) algorithm for wireless networks, called the (Proper Robust Scheduling) PRS algorithm, later generalized to ML-PRS by Bozta? to support a set of multi-priority users, each with different transmission characteristics.
openaire   +2 more sources

Feasible Schedules for Rotating Transmissions

Combinatorics, Probability and Computing, 2006
Motivated by a scheduling problem that arises in the study of optical networks, we prove the following result, which is a variation of a conjecture of Haxell, Wilfong and Winkler.Let $k,n$ be two positive integers, let $w_{sj}, 1 \leq s \leq n, 1 \leq j \leq k$ be nonnegative reals satisfying $\sum_{j=1}^k w_{sj}< 1/n$ for every $1 \leq s \leq n$ and ...
openaire   +2 more sources

Transmission schedules to prevent traffic analysis

Proceedings of 9th Annual Computer Security Applications Conference, 2002
We propose scheduling strategies to determine transmission schedules that prevent traffic analysis and the creation of covert channels due to temporal variation in the transmission of packets. In addition to requiring the traffic matrix be neutral we require the transmission schedule be temporally neutral to eliminate that potential coved channel.
Balaji R. Venkatraman   +1 more
openaire   +1 more source

Optimal Scheduling of Jobs on a Transmission Network

Management Science, 1979
A number of jobs have to be carried out on a gas transmission network every year, which restrict the transmission capacity of the network while they are in progress. There are certain pairs of jobs which must not be in progress at the same time. The network must meet a convex annual demand pattern.
G. A. Jones, J. G. Wilson
openaire   +2 more sources

Efficient Scheduling of Transmissions in Optical Broadcast Networks

IEEE/ACM Transactions on Networking, 1996
All-optical networks (AONs) with a broadcast-star based physical topology offer the possibility of transmission scheduling to resolve channel and receiver conflicts. This paper considers the problem of scheduling packet transmissions in a wavelength-division multiplexed (WDM) optical network with tunable transmitters and fixed-tuned receivers.
Hongsik Choi   +2 more
exaly   +2 more sources

Distributed Transmission Scheduling and Power Allocation in CoMP

IEEE Systems Journal, 2018
The performance of wireless networks can be largely enhanced by coordinated multipoint (CoMP). To design an efficient CoMP in multiuser multiple-input multiple-output scenario, conventional transmission scheduling and power allocation are usually performed in a static and centralized manner.
Shu Fu   +5 more
openaire   +2 more sources

Collision-free anycast transmission scheduling in UWSNs

2017 Second International Conference on Fog and Mobile Edge Computing (FMEC), 2017
Underwater Wireless Sensor Network (UWSNs) have been proposed to monitor underwater regions such as seas and oceans. A typical example of an UWSN consists of a set of underwater sensor nodes and a set of sink nodes that are deployed at the sea surface.
Ahmad A. Ababneh   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy