The main contribution of this work is to propose energy-eecient randomized initialization protocols for ad-hoc radio networks (ARN, for short). First, we show that if the number n of stations is known beforehand, the single-channel ARN can be initialized by a protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. We the...

This paper defines principles for organizing semantic relations represented by slots in frame-structured knowledge bases. We consider not only the ways in which slots are used for reasoning about a given domain but also the features of the representation language of the knowledge-based system in which the slots reside. We find that the organization of slots may be based on the knowledge-level s...

Recently standardized wireless systems have multiple Time-Slots in a radio frame, but existing MUMIMO schedulers are not utilizing multiple Time-Slots efficiently. In this paper we propose a sub-optimal user grouping algorithm utilizing multiple Time-Slots efficiently. The proposed algorithm disperses highly-correlated users in different Time-Slots to prevent severe degradation of spatial multi...

We investigate a scheduling problem in which packets, or datagrams, may be fragmented. While there are a few applications to scheduling with datagram fragmentation, our model of the problem is derived from a scheduling problem present in data over CATV networks. In the scheduling problem datagrams of variable lengths must be assigned (packed) into fixed length time slots. One of the capabilitie...

A single product maritime inventory routing problem is addressed in this paper by exploring the use of continuous and discrete time models. We first present a continuous time model based on time slots for single docks, which is enhanced by reformulating the time assignment constraints. Next, we present a model based on event points to handle parallel docks. A discrete time is also presented bas...

In this paper, we propose a TDMA slot assignment protocol to improve the channel utilization, which controls the excessive increase of unassigned slots by changing the frame length dynamically. Our proposed protocol assigns one of the unassigned slots to a node which joins the network. If there is no unassigned slots available, our proposed protocol generates unassigned slots by depriving one o...