This paper explores an efficient Medium Access Control protocol for carrying data traffic via satellite. The Combined Free/Demand Assignment Multiple Access (CFDAMA) protocol combines free assignment of data slots with demand assignment, providing a minimum delay of one round trip time at low loads and the statistical multiplexing gains of demand assignment at high loads. The delay/utilisation ...

There has been growing interest in broadband satellite networks lately. The unique characteristics of satellites such as long propagation delay, limited bandwidth to be shared among many users, and power limitations necessitate the use of appropriate medium access control (MAC) schemes for bandwidth assignment, particularly in applications with bursty traffic. This paper presents a study of MAC...

This paper proposes a distributed and adaptive channel assignment (D-CAS) scheme for wireless sensor networks. D-CAS performs statistical analysis of load pattern of the individual cluster and adjusts channel assignment dynamically as per requirement generated by the current cluster’ traffic load. It follows a static schedule during infrastructure establishment based on initial traffic conditio...

A feasible green light assignment is an assignment of time period to each traffic stream so that only compatible traffic streams are allowed to recieve overlapping time period. In case of an intersection, it is almost always possible to find several feasible green light assignments. We usually have some goal such as to minimise the total waiting time, to maximise the volume of flow etc. , to be...

This paper proposes some novel techniques to accommodate users with different transmission rate requirements in a CDMA system which employs orthogonal variable spreading factor codes. Several static and dynamic code assignment strategies are put forth and their behavior investigated, in terms of call blocking probability and number of required call reassignments. Their efficiency in dealing wit...

The n-card problem is to determine the minimal intervals [u, v] such that for every n×n stochastic matrix A there is an n×n permutation matrix P (depending on A) such that tr(PA) ∈ [u, v]. This problem is closely related to classical mathematical problems from industry and management, including the linear assignment problem and the travelling salesman problem. The minimal intervals for the n-ca...

The probabilistic serial rule is one of the most wellestablished and desirable rules for the random assignment problem. We present the egalitarian simultaneous reservation social decision scheme — an extension of probabilistic serial to the more general setting of randomized social choice. We consider various desirable fairness, efficiency, and strategic properties of social decision schemes an...