In this paper, polling based mobile data gathering and the priority based data storage algorithm for wireless sensor networks (WSN) is proposed. Initially, the centralized algorithm places the polling points (PPs) on the shortest path. These polling points (PP) buffer locally aggregated data and upload the data to the mobile data collector when it arrives. Then, priority based data storage modu...

Bluetooth is an emerging technology to build a solution for providing short range, low power, low cost, and ubiquitous wireless environments. In this paper we propose a algorithm for asynchronous data traffic at the Medium Access Control(MAC) layer to meet Bluetooth characteristic and compare with other scheduling algorithms. The algorithm, named Efficient Utilization Polling (EUP), uses a sing...

Closed polling systems with station breakdowns, under the Gated, Exhaustive or Globally Gated services regimes, are studied and analyzed. Multi-dimensional sets of probability generating functions of the system's state are derived. They are further utilized to obtain an approximate solution for the mean number of jobs residing in the system's various queues at polling instants. The analysis is ...

In this paper, we present a polling scheme which allows for augmenting the support of voice communications in point co-ordination function (PCF) of IEEE 802.11 wireless networks. In this scheme, the Access Point (AP) of the Basic Service Set (BSS) maintains two polling lists, i.e. the talking list and the silence list. Based on the talking status of the stations identified via silence detection...

This paper presents a new dynamically adaptable polling scheme for efficient support of voice communications over an IEEE802.11 network. The proposed Cyclic Shift and Station Removal polling scheme is implemented only on the Access Point of each Basic Service Set without requiring any modification on the existing access protocol. This polling scheme increases the number of conversations in case...

| We consider the problem of minimizing average paging cost subject to delay constraints in a wireless system. Previous work assumed the unit to be found did not move during the paging process whereas here the unit may change location during polling events. We show that the conditionally most probable locations given that the unit has not yet been found should be searched rst. We nd the optimal...

Several activities are employed in network management to ensure correct network operation, including administration, monitoring, and provisioning of network devices. Among them, one of the most CPUand bandwidth-intensive tasks is network polling. Although this task has to be performed in several real network management situations, it presents serious scalability and fault tolerance drawbacks if...

Abstract: We investigate a polling model of a radio-cell of the broadband wireless IEEE 802.11 network. A radio-cell is assumed to work in the ‘‘data collection’’ regime. It is modeled by a polling system with N queues and a single server polling the queues in a cyclic adaptive order. Under adaptive scheme, the server (base station) skips (does not visit) the queues (subscriber stations) which ...