Energy consumption is a primary concern in the Wireless Sensor Network. This leads to pursue the maximum energy saving at sensor nodes, where a relay is used to transfer the data packet. This leads to the increase in the data gathering latency due to low moving velocity of the mobile collector. In this paper we study the tradeoff between energy saving and data gathering latency in mobile data g...

Recently proposed voter-verifiable protocols provide encrypted paper receipts to voters, who may later check that these receipts are in the electronic ballot box. This paper describes an enhancement that allows the voter to electronically transmit, from the polling booth, her encrypted receipt to an external verifier, who may perform the check on her behalf. It uses a CAPTCHA-like primitive – w...

in this paper, we have outlined the surrogate management framework for optimization of expensive functions. an initial simple iterative method which we call the “strawman” method illustrates how surrogates can be incorporated into optimization to stand in for the most expensive function. these ideas are made rigorous by incorporating them into the framework of pattern search methods. the smf al...

In this paper, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is stable and forms a regular sequence. The fraction of time spent by the server in the first queue is hig...

In wireless sensor networks, energy efficiency is crucial to achieving satisfactory network lifetime. To reduce the energy consumption significantly, a node should turn off its radio as long as possible. We propose a MAC protocol with little idle listening. The sensor node periodically turns on its radio in polling period and checks for a wake-up signal by sampling the energy on the channel. Af...

An alternative analysis of the classical M/G/1 cyclic order polling model is presented. We introduce the new Markov regenerative process framework, which provides a way to perform the analysis of the polling model on a unified, i.e. service discipline independent way. We derive the decomposition property and the general expressions of the stationary number of customers as well as the stationary...

A preliminary MPI library has been implemented for the Fujitsu AP1000+ multicomputer running the AP/Linux operating system. Under this environment, parallel programs may be dedicated to a fixed partition, or a number of parallel programs may share a partition. Therefore, the MPI library has been constructed so that messaging operations can be driven by polling and/or interrupt techniques. It ha...

We devise an approximation of the marginal queue length distribution in discrete-time polling systems with batch arrivals and fixed packet sizes. The polling server uses the Bernoulli service discipline and Markovian routing. The 1-limited and exhaustive service disciplines are special cases of the Bernoulli service discipline, and traditional cyclic routing is a special case of Markovian routi...