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

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

2015
Minglei Shu Dongfeng Yuan Chongqing Zhang Yinglong Wang Changfang Chen

Targeting the medical monitoring applications of wireless body area networks (WBANs), a hybrid medium access control protocol using an interrupt mechanism (I-MAC) is proposed to improve the energy and time slot utilization efficiency and to meet the data delivery delay requirement at the same time. Unlike existing hybrid MAC protocols, a superframe structure with a longer length is adopted to a...

Journal: :Algorithms 2014
Changyong Jung Suk-Jin Lee Vijay Bhuse

We study the scheduling problem for data collection from sensor nodes to the sink node in wireless sensor networks, also referred to as the convergecast problem. The convergecast problem in general network topology has been proven to be NP-hard. In this paper, we propose our heuristic algorithm (finding the minimum scheduling time for convergecast (FMSTC)) for general network topology and evalu...

1999
Kohei Shiomoto Naoaki Yamanaka

This paper proposes a new high-speed network architecture DBTN(Dynamic burst transfer time-slot-base network), which is based on circuit-switched network technology. A routing tag is attached to a burst at an ingress edge node and the burst is selfrouted in a DBTN network by creating a circuit dynamically. The routing tag, which is called time-slots-relay, is a series of link identifiers to the...

2004
Jeffrey K. MacKie-Mason Anna Osepayshvili Daniel M. Reeves Michael P. Wellman

In a market-based scheduling mechanism, the allocation of time-specific resources to tasks is governed by a competitive bidding process. Agents bidding for multiple, separately allocated time slots face the risk that they will succeed in obtaining only part of their requirement, incurring expenses for potentially worthless slots. We investigate the use of price prediction strategies to manage s...

2002
Yunjian Jia Yoshitaka Hara Shinsuke Hara

This paper proposes a TDD-SDMA/TDMA system with a multi-slot assignment to deal with asymmetry traffic in wireless networks, where the packet-based data services is supported. The proposed system assigns more than one time slots for downlink to each terminal so as to deal with the asymmetric traffic. We also present an efficient algorithm to decide the priority of time slots for downlink, by wh...

1999
Bing Bing Zhou Paul Mackerras Chris W. Johnson David Walsh Richard P. Brent

Gang scheduling is currently the most popular scheduling scheme for parallel processing in a time shared environment. One major drawback of using gang scheduling is the problem of fragmentation. The conventional method to alleviate this problem is to allow jobs running in multiple time slots. However, our experimental results show that simply applying this method alone cannot solve the problem ...

1999
M. Li

EM1 from slots and apertures resulting from coupling of interior sources through enclosure cavity modes in a Sun S-1000 workstation was investigated. The excitation of a specially designed rectangular enclosure with a slot was also studied experimentally and with finite-difference time-domain (FDTD) simulations. The radiated power results for both the S-1000 and simple rectangular enclosure ind...

A.A Dehghani M.R Pirestani T Esmaeili Tetsuya Sumi

Local scouring around bridge piers is a natural phenomenon caused by the erosive process of flowing stream on alluvial beds. The 3D flow field around bridge piers interacting with the bed materials increases complexity of local scour process. The local scour depth develops in accelerated flows and if it is not predicted correctly, the bottom level of local scour hole will exceed the original le...

1994
Ian Gale

The process of deregulating airlines in the United States began in earnest with the passage of the Airline Deregulation Act of 1978. The Act set in place a timetable for removing government controls on fares and entry into routes. However, airline access to airports has not been fully deregulated. In 1968, the Federal Aviation Administration (FAA) adopted the socalled "high-density rule" to com...

Journal: :Inf. Sci. 2007
Anita Saha Madhumangal Pal Tapan Kumar Pal

The present paper aims at developing a linear time algorithm to find a solution to the ‘maximum weight 1 colouring’ problem for an interval graph with interval weight. This algorithm has been applied to solve the problem that involves selecting different programme slots telecast on different television channels in a day so as to reach the maximum number of viewers. It is shown that all programm...

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

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