نتایج جستجو برای: time slots

تعداد نتایج: 1893979  

2000
K. NAKANO S. OLARIU

Unlike the well-studied cellular networks that assume the existence of robust infrastructure, Ad-hoc Networks (AHN, for short) are rapidly deplo able, self-organizing, and do not rely on an existing infrastructure. These networks find applications to disaster-relief, search-and-rescue, law-enforcement, and collaborative computing, among others. The main contribution of this work is to propose a...

2002
Nir Naaman Raphael Rom

We investigate a scheduling problem in a TDMA environment where packets may be fragmented. Our model of the problem is derived from a scheduling problem present in data over CATV networks, where a slotted TDMA channel is used to carry both real-time and best-effort traffic. Packets of real-time flows have high priority and are allocated in fixed, periodically located slots. Best-effort packets ...

2011
Victor V. Toporkov Anna S. Toporkova Alexander Bobchenkov Dmitry Yemelyanov

In this paper, we present slot selection algorithms in economic models for independent job batch scheduling in distributed computing with non-dedicated resources. Existing approaches towards resource co-allocation and multiprocessor job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The sought time-slots must match requi...

2012
Weijie Shi Qiang-Sheng Hua Dongxiao Yu Yuexuan Wang Francis C. M. Lau

This paper studies the information exchange problem in single-hop multi-channel radio networks, which is to disseminate k messages stored in k arbitrary nodes to the entire network (with n nodes) with the fewest timeslots. By using Θ( √ n) channels, the previous best result [9] showed that this problem can be solved in Θ(k) time slots with high probability even if k is unknown and no bounds on ...

Journal: :IJWA 2010
Jan Vosecky Dan Hong Vincent Yun Shen

Provision of quality of service (QoS) in an ad hoc network is a challenging task. In this paper, we propose a QoS aware routing for Time Division Multiple Access (TDMA) based ad hoc networks. Our protocol tries to identify multiple paths each of which is capable of providing the QoS in terms of the number of time slots at its own or by combining it to a group of paths. Our protocol incorporates...

2005
Ann Stuart Laubstein

There are two types of speech errors those that involve interactions between two constituents and those that involve single constituents. The interaction errors are structure preserving: they implicate constituents of the same type replacing one another, and the resulting error is structurally well-formed. Interaction errors may be classified as substitutions, exchanges, anticipations, persever...

2008
Jon Feldman S. Muthukrishnan Evdokia Nikolova Martin Pál

We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constraint, as well as a maximum cost per click, and may not be assigned to more than one slot for a particular search. We give a truthful mechanism under the utility model where bidders try to maximize their clicks, subjec...

Journal: :Computer Networks and ISDN Systems 1997
Shie-Jue Lee Yu-Wen Lai Jian-Jou Lai Chi-Jong Chang

In the cyclic reservation multiple access (CRMA) scheme, nodes reserve slots in each reserve command. Cycles are then generated in sequence, each of which services the reservations made in the corresponding reserve command. Huang et al. [2,3] proposed a reservation scheme, in which nodes are partitioned into regions and slots can be reused in succeeding regions, to reduce access delays due to l...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید