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

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

Journal: :American Economic Journal: Microeconomics 2013

2010
Jacek Cichon Rafal Kapelko Jakub Lemiesz Marcin Zawada

We consider the problem of efficient alarm protocol for ad-hoc radio networks consisting of devices that try to gain access for transmission through a shared radio communication channel. The problem arise in tasks that sensors have to quickly inform the target user about an alert situation such as presence of fire, dangerous radiation, seismic vibrations, and more. In this paper, we show a prot...

Journal: :IEEE Trans. Parallel Distrib. Syst. 2000
Koji Nakano Stephan Olariu

ÐAd hoc networks are self-organizing entities that are deployed on demand in support of various events including collaborative computing, multimedia classroom, disaster-relief, search-and-rescue, interactive mission planning, and law enforcement operations. One of the fundamental tasks that have to be addressed when setting up an ad hoc network (AHN, for short) is initialization. This involves ...

2003
Emma Carlson Holger Karl Adam Wolisz Christian Prehofer

This paper examines a new mechanism for distributed resource reservation that offers support for applications with QoS requirements in a wireless multi-hop network. This mechanism is based on IEEE 802.11 DCF and includes end-to-end reservations of time slots and distribution of reservation information to mobile nodes unaware of the reservation, piggy-backed on existing medium access control mes...

2007
Niels Agatz Ann Melissa Campbell Moritz Fleischmann Martin Savelsbergh

In this chapter, we focus on home delivery, and, more specifically, on attended home delivery, where the consumer must be present for the delivery. To provide a high service level and to avoid delivery failures as much as possible, it is customary in attended home delivery services for the company to offer the customer a choice of narrow delivery time slots. The objective of this chapter is to ...

Journal: :IEICE Transactions 2005
Shyue-Horng Shiau Chang-Biau Yang

Given a set of n stations, the initialization problem is to assign each station a unique identification number, from 1 to n. In the single-hop wireless Networks with collision detection, Nakano and Olariu proposed an algorithm to build a partition tree and solve the problem. In this paper, we shall classify the partition tree into four parts. By reviewing the classifications, we find that three...

2006
Wen-Tzu Chen Guan-Hung Lin

In this paper, we present an anti-collision scheme in a RFID system. The scheme is based on dynamic framed ALOHA protocol developed for radio networks. In our scheme, we propose a method to estimate the number of tags and derive the optimal frame length. Simulation results indicate that the error of our tag estimate method can be less than 1%. The total number of time slots for reading all tags...

2013
Siti Khatijah Nor Abdul Rahim Andrzej Bargiela Rong Qu

Simulation modelling of the initial assignments of exams to time-slots provides an alternative approach to the establishment of a set of feasible solutions that are subsequently optimized. In this research, we analyze two backtracking strategies for reassigning exams after the initial allocation of exams to time-slots. We propose two approaches for backtracking, BT1 and BT2. The study indicates...

Journal: :International Journal of Advanced Computer Science and Applications 2014

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

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