Fluctuation control for many-to-one routing in wireless sensor networks

This paper presents a distributed and adaptive fluctuation control scheme for many-to-one routing （FCM） in wireless sensor networks. Unlike well-known topology control schemes, the primary design objective is to reduce the fluctuation which happens due to overload of sensors in a data collection tree. More specifically, an estimation model of a sensor available capacity based on the number of its neighbors is proposed. In addition, this paper proposes a parent selection mechanism by three-way handshake. With such model and the selection mechanism, it is ensured that the load of a sensor does not exceed its available capacity. Finally, an adaptive maintenance mechanism is proposed to adjust the estimation of a sensor available capacity as the network environment changes. Simulation results demonstrate the effectiveness of the scheme.

Exploring Channel Diversity in HF Communication Systems： A Matching-Potential Game Approach

This paper investigates the channel diversity problem in high frequency(HF) communication systems. Due to the limited HF spectrum resources, a HF communication system with shared channels is considered, where each user equipment(UE) has individual communication demand. In order to maximize the communication probability of the whole system, a matching-potential game framework is designed. In detail, the channel diversity problem is decomposed into two sub-problems. One is channel-transmitter matching problem, which can be formulated as a many-to-one matching game. The other is the transmitter allocation problem which decides the transmission object that each transmitter communicates with under channel-transmitter matching result, and this sub-problem can be modeled as a potential game. A multiple round stable matching algorithm(MRSMA) is proposed, which obtains a stable matching result for the first sub-problem, and a distributed BR-based transmitter allocation algorithm(DBRTAA) is designed to reach Nash Equilibrium(NE) of the second sub-problem. Simulation results verify the effectiveness and superiority of the proposed method.

Cancelable biometric schemes for Euclidean metric and Cosine metric

The handy biometric data is a double-edged sword,paving the way of the prosperity of biometric authentication systems but bringing the personal privacy concern.To alleviate the concern,various biometric template protection schemes are proposed to protect the biometric template from information leakage.The preponderance of existing proposals is based on Hamming metric,which ignores the fact that predominantly deployed biometric recognition systems(e.g.face,voice,gait)generate real-valued templates,more applicable to Euclidean metric and Cosine metric.Moreover,since the emergence of similarity-based attacks,those schemes are not secure under a stolen-token setting.In this paper,we propose a succinct biometric template protection scheme to address such a challenge.The proposed scheme is designed for Euclidean metric and Cosine metric instead of Hamming distance.Mainly,the succinct biometric template protection scheme consists of distance-preserving,one-way,and obfuscation modules.To be specific,we adopt location sensitive hash function to realize the distance-preserving and one-way properties simultaneously and use the modulo operation to implement many-to-one mapping.We also thoroughly analyze the proposed scheme in three aspects:irreversibility,unlinkability and revocability.Moreover,comprehensive experiments are conducted on publicly known face databases.All the results show the effectiveness of the proposed scheme.

Approximation for a scheduling problem with application in wireless networks

A network of many sensors and a base station that are deployed over a region is considered.Each sensor has a transmission range,an interference range and a carrier sensing range,which are r,αr and βr,respectively.In this paper,we study the minimum latency conflict-aware many-to-one data aggregation scheduling problem:Given locations of sensors along with a base station,a subset of all sensors,and parameters r,α and β,to find a schedule in which the data of each sensor in the subset can be transmitted to the base station with no conflicts,such that the latency is minimized.We designe an algorithm based on maximal independent sets,which has a latency bound of(a+19b)R + Δb-a + 5 time slots,where a and b are two constant integers relying on α and β,Δ is the maximum degree of network topology,and R is the trivial lower bound of latency.Here Δ contributes to an additive factor instead of a multiplicative one,thus our algorithm is nearly a constant(a+19b)-ratio.