Outlier detection has many important applications in sensor networks, e.g., abnormal event detection, animal behavior change, etc. It is a difficult problem since global information about data distributions must be known to identify outliers. In this paper, we use histogram-based method for outlier reduce communication cost. Rather than collecting all the one location centralized processing, propose hints (in form of histogram) distribution, and using filter out unnecessary potential We show...

Radio Frequency IDentification (RFID) technology has attracted much attention due to its variety of applications, e.g., inventory control and object tracking. One important problem in RFID systems is how quickly estimate the number distinct tags without reading each tag individually. This plays a crucial role many real-time monitoring privacy-preserving applications. In this paper, we present an efficient anonymous scheme for population estimation. leverages position first reply from group...

RFID is an emerging technology with many potential applications such as inventory management for supply chain. In practice, these often need a series of continuous scanning operations to accomplish task. For example, if one wants scan all the products tags in large warehouse, given limited reading range reader, multiple have be launched at different locations cover whole warehouse. Usually, this are not completely independent some can read by processes. Simply during each process inefficient...

As RFID tags are increasingly attached to everyday items, it quickly becomes impractical collect data from every tag in order extract useful information. In this paper, we consider the problem of identifying popular categories out a large collection tags, without reading all data. We propose two algorithms based on idea group testing, which allows us efficiently derive tags. evaluate our solutions using both theoretical analysis and simulation.

Data storage has become a important issue in sensor networks as large amount of collected data need to be archived for future information retrieval. This paper introduces nodes store the from sensors their proximities. The alleviate heavy load transmitting all central place archiving and reduce communicatio cost induced by network query. considers node placement problem aiming minimize total energy gathering replying queries. We examine deterministic odes present optimal algorithms based on...

Computing correlation functions for many-particle systems in Lattice QCD is vital to extract nuclear physics observables like the energy spectrum of hadrons such as protons. However, this type calculation has long been considered be very challenging and computing-resource intensive because complex nature a hadron composed quarks with many degrees freedom. In particular, function can calculated through sum all possible pairs quark contractions, each which batched tensor contraction, dictated...

Data storage has become an important issue in sensor networks as a large amount of collected data needs to be archived for future information retrieval. This paper proposes introduce nodes that can store from the sensors their proximities. The alleviate heavy load transmitting all central place archiving and reduce communication cost induced by network query. considers node placement problem minimize total power consumption funneling We formulate it integer linear programming present...

Body sensor networks (BSNs) have been developed for a set of performance-critical applications, including smart healthcare, assisted living, emergency response, athletic performance evaluation, and interactive controls. Many these applications require stringent assurance in terms communication throughput bounded time delay. While solutions exist literature providing joint delay by proposing specific MAC protocols or extensions, we provide this novel radio-agnostic manner. In our approach,...

Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introduced this paper store the from sensors their proximities. The alleviate heavy load transmitting all central place archiving and reduce communication cost induced by network query. objective is address node placement problem aiming minimize total energy gathering replying queries. We examine deterministic present...

Deploying city-wide 802.11 access points has made possible internet in a vehicle, nevertheless it is challenging to maintain client performance at vehicular speed especially when multiple mobile users exist. This paper considers the association control problem for networks drive-thru Internet scenarios. In particular, we aim improve overall throughput and fairness all users. We design efficient algorithms achieve objectives through several techniques including approximation. Our simulation...

Data storage has become an important issue in sensor networks as a large amount of collected data needs to be archived for future information retrieval. This paper proposes introduce nodes that can store from the sensors their proximities. The alleviate heavy load transmitting all central place archiving and reduce communication cost induced by network query. considers node placement problem minimize total power consumption funneling We formulate it integer linear programming present...

We study parallel job scheduling, where each may be scheduled on any number of available processors in a given system. propose mathematical model to estimate job's execution time when assigned multiple processors. The incorporates both the linear computation speedup achieved by having execute and overhead incurred due communication, synchronization, management working same job. show that is sophisticated enough reflect reality meanwhile also concise make theoretical analysis possible. In...

Processor allocation in a mesh or torus connected multicomputer system with up to three dimensions is hard problem that has received some research attention the past decade. With recent deployment of systems topology higher than three, which are used solve complex problems arising scientific computing, it becomes imminent study allocating processors configuration multi-dimensional system. In this paper, we first define concept semitorus. We present two partition schemes, Equal Partition (EP)...

Deploying road-side WiFi access points has made possible internet in a vehicle, nevertheless it is challenging to maintain client performance at vehicular speed especially when multiple mobile users exist. This paper considers the association control problem for Drive-thru Internet scenario. In particular, we aim improve efficiency and fairness all users. We design efficient algorithms achieve these objectives through several techniques including approximation. Our simulation results...

The bin packing problem is to pack a list of reals in $( {0,1} ]$ into unit-capacity bins using the minimum number bins. Let $R[A]$ be limiting worst value for ratio ${{A(L)} / {L^ * }}$ as $L^ $ goes $\infty $, where $A(L)$ denotes used approximation algorithm A, and needed L. Obviously, reflects worst-case behavior A. For Next-k-Fit($NkF$ short, $k \geqslant 2$), which linear time packing, it was known that $1.7 + \frac{3}{{10(k - 1)}} \leqslant R[NkF] 2$. In this paper, tight bound...

Data transmission over WiFi quickly drains the batteries of mobile devices. Although IEEE 802.11 standards provide power save mode (PSM) to help devices conserve energy, PSM fails bring expected benefits in many real scenarios. In particular, when multiple associate a single access point (AP), does not work well under contention. Optimizing saving clients is challenging task, because each client expects complete data early so that it can turn low mode. this paper, we define an energy...