The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Tag collision occurs easily when the multiple tags respond to the same reader query simultaneously over a shared wireless channel. The solution of tag collision is a significant issue in the mobile RFID environment, because of the random mobility of tags. For the purpose of object tracking, locating and monitoring, the reader will repeatedly identify the same tags which still stay within its read...
With the recent developments in RFID systems, many readers are needed to apply to the same work place, which easily leads to the reader collision. When the communication with tags of a reader is disturbed by the operation of other readers, a reader collision will occur, which is achieved less attention than the tag collision in previous studies. To solve several types of reader collisions, we propose...
Clustering protocol for data gathering is one of the effective ways to solve the energy hole problem in wireless sensor networks. However, most of the existing clustering protocols focus on the network model with uniform node distribution. They cannot effectively apply to the real network where the sensor nodes are randomly non-uniformly deployed. In this paper, we propose an energy-balanced clustering...
Abrupt motion tracking has gained special attention in visual tracking community in the past several years. However, the growing interest has not been accompanied by the development of criteria to evaluate the performance of different tracking algorithms. In this paper, we introduce an evaluation criterion for abrupt motion trackers. This criterion contains a set of trials that test the robustness...
Energy efficiency has become an important research issue for wireless sensor networks. Sensor nodes, thus, need to make use of their limited energy to keep active time as small as possible to prolong the whole network lifetime while meeting the performance requirement. In this work, we reinvestigate the overhearing problem, which occurs when an awake node overhears the transmission nearby, and this...
Neighbor discovery is crucial for both wireless sensor networks and mobile computing applications. The crux of the problem is to achieve energy efficiency, which has been demonstrated to be difficult by prior work. In this paper we propose Hello, a generic flexible protocol for neighbor discovery. With an unrestricted parameter, it serves as a generic framework that incorporates existing deterministic...
Due to slow advance in battery technology, power remains a bottleneck to limit wide applications of mobile ad hoc and wireless sensor networks. Among all extensive studies on minimizing power consumption, neighbor discovery is one of the fundamental components focusing on communication and access. This work surveys research literature on neighbor discovery protocols (NDPs). In general, they can be...
We propose an attribute-based cryptosystem in which decryption is conditional on the distance between attributes. Alice constructs a cipher text that consists of an encrypted message and a hidden attribute vector. Bob is able to decrypt Alice's message if and only if his attribute vector is within a specified maximum distance from Alice's attribute vector. We provide constructions for Euclidean and...
According to the power industry DL/T645 protocol and the characteristics of the meter data transmission, a wireless sensor network of automatic meter reading communications network is proposed. According to statistical feature of DL/T645 protocol and requirement of meter data transmission quality, an IEEE802.15.4 QoS (quality of service) communication network, is presented in this paper.
Alice possesses a sample of private data from which she wishes to obtain some probabilistic inference. Bob possesses Hidden Markov Models (HMMs) for this purpose, but he wants the model parameters to remain private. This paper develops a framework that enables Alice and Bob to collaboratively compute the so-called forward algorithm for HMMs while satisfying their privacy constraints. This is achieved...
Alice and Bob possess strings x and y of length m and n respectively and want to compute the Levenshtein distance L(x, y) between the strings under privacy and communication constraints. The Levenshtein distance, or edit distance, has a dynamic programming formulation that solves a series of minimum-finding problems. Based on this formulation, there are known symmetric privacy-preserving protocols...
In order to realize the Smart Grid vision, it is necessary to have guaranteed Quality of Service (QoS) for the communication and networking technology used in various stages of the Smart Grid, ranging from power generation, transmission, distribution, to the customer applications. The low cost wireless protocols such as Zigbee (using IEEE 802.15.4 defined physical and MAC layer) and Bluetooth (IEEE802...
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalized sum-type function of those sequences. We construct three-party protocols that allow Charlie to compute the function with arbitrarily high accuracy, while maintaining unconditional privacy for Alice and Bob and achieving...
Alice and Bob possess sequences x and y respectively and would like to compute the ℓ1 distance, namely || x - y ||1 under privacy and communication constraints. The privacy constraint requires that Alice and Bob do not reveal their data to each other. The communication constraint requires that they accomplish the secure distance calculation with a small number of protocol transmissions and key exchanges...
Internet users consume a large volume of rich media, and the consumption is increasing dramatically with the pervasiveness of network. BitTorrent has been well accepted as a solution to large-scale content distribution without requiring major infrastructure investment. However, it has not taken into account the link optimization across networks, causing heavy traffic across networks. This limitation...
Alice and Bob possess sequences xn and yn respectively and would like to compute d(xn, yn) where d(?? , ??) is a distortion measure. However, Alice and Bob do not trust each other and do not wish to reveal their data to each other. This paper describes and analyzes a protocol that uses homomorphic encryption for secure calculation of some special distortion functions without revealing xn and yn. The...
Consider the following problem in secure multiparty computation: Alice and Bob possess integers x and y respectively. Charlie is a researcher who would like to compute the value of some function f(x, y). The requirement is that Charlie should not gain any knowledge about x and y other than that which can be obtained from the function itself. Moreover, Alice and Bob do not trust each other and should...
As the next generation Internet (NGI) is coming, and with the rapid development and great research progress achieved, mobile Internet Protocol version 6 (MIPv6) based network has become a hotspot all over the world. Considering of the rapid growth of network service quality and data exchange requirement, we are going to propose a new data exchange method in this paper. This method uses resource reservation...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.