Full-duplex communication for future wireless networks: Dynamic resource block allocation approach

In this paper, we discuss a full-duplex (FD) communication scenario, where multiple FD user equipments (UEs) share same spectrum resources (or resource blocks) simultaneously. The FD eNodeB deploys digital precoding and successive interference cancellation with optimal ordering algorithm, to allow coexistence of multiple UEs in downlink and uplink, respectively. The sharing of same resource blocks, results in co-channel interference (CCI), in downlink of a UE, from uplink signals of other UEs. To mitigate the interference, a smart antenna approach is adopted. The approach includes using multiple antennas at UEs to form directed beams towards eNodeB and nulls towards other UEs. However, the approach fails when the UEs due to their mobility align themselves in the same direction with respect to the eNodeB (eNB). In this paper, we propose a dynamic resource block allocation (DRBA) algorithm for avoiding CCI due to mobility of UEs, sharing the spectrum resource, in a FD communication scenario. The proposed algorithm shows significant improvement of the quality of service (QoS) of the communication links.     

一种无线传感器网络中的混沌信号重构算法

将无线传感器网络节点观测区域中的一个混沌信号发送到融合中心,进行信号重构.由于节点的通信带宽受限,信号传输之前需要进行量化,给信号带来量化噪声,使得信号重构工作变得更为棘手.本文提出用平方根容积卡尔曼滤波器对融合中心收集的信号进行重构.首先估计观测信号的概率密度函数,使用最优量化器量化观测信号,在有限的量化比特数下,取得最优的信号量化性能.平方根容积卡尔曼滤波器相对无先导卡尔曼算法具有较少的求容积分点,因此具有计算量小的优点,同时迭代过程采用传递误差矩阵的平方根矩阵,保证迭代过程的稳定性和提高数据估计精度.仿真结果表明,该算法能够有效和快速地重构观测信号,并且比基于无先导卡尔曼滤波的算法更快.     

基于无线传感器网络的地震信号特征提取方法研究

为解决野外古墓葬安防网络中高采样率会缩短无线传感器网络寿命的问题, 提出了使用功率谱二次处理对地震信号进行特征提取的方法. 并通过三类地面活动数据采集进行对比识别实验, 分析了低采样率条件下地震信号特征提取方法的性能. 结果表明, 使用功率谱二次分析的特征提取方法能够降低网络通信能耗, 延长网络寿命, 提高系统目标识别的准确性.该方法已应用于秦始皇兵马俑野外文物安防系统, 经实践检验, 收到了良好的效果. 关键词： 地震信号 特征提取 功率谱二次处理 无线传感器网络     

Distributed wireless quantum communication networks

The distributed wireless quantum communication network （DWQCN） ha~ a distributed network topology and trans- mits information by quantum states. In this paper, we present the concept of the DWQCN and propose a system scheme to transfer quantum states in the DWQCN. The system scheme for transmitting information between any two nodes in the DWQCN includes a routing protocol and a scheme for transferring quantum states. The routing protocol is on-demand and the routing metric is selected based on the number of entangled particle pairs. After setting up a route, quantum tele- portation and entanglement swapping are used for transferring quantum states. Entanglement swapping is achieved along with the process of routing set up and the acknowledgment packet transmission. The measurement results of each entan- glement swapping are piggybacked with route reply packets or acknowledgment packets. After entanglement swapping, a direct quantum link between source and destination is set up and quantum states are transferred by quantum teleportation. Adopting this scheme, the measurement results of entanglement swapping do not need to be transmitted specially, which decreases the wireless transmission cost and transmission delay.     

Spatial networks with wireless applications

Many networks have nodes located in physical space, with links more common between closely spaced pairs of nodes. For example, the nodes could be wireless devices and links communication channels in a wireless mesh network. We describe recent work involving such networks, considering effects due to the geometry (convex, non-convex, and fractal), node distribution, distance-dependent link probability, mobility, directivity, and interference.     

A generalized approach to complex networks

This work describes how the formalization of complex network concepts in terms of discrete mathematics, especially mathematical morphology, allows a series of generalizations and important results ranging from new measurements of the network topology to new network growth models. First, the concepts of node degree and clustering coefficient are extended in order to characterize not only specific nodes, but any generic subnetwork. Second, the consideration of distance transform and rings are used to further extend those concepts in order to obtain a signature, instead of a single scalar measurement, ranging from the single node to whole graph scales. The enhanced discriminative potential of such extended measurements is illustrated with respect to the identification of correspondence between nodes in two complex networks, namely a protein-protein interaction network and a perturbed version of it.     

Multi-radius geographical spatial networks: Statistical characteristics and application to wireless sensor networks

In this paper, a new kind of complex network model named multi-radius geographical spatial networks is proposed. We investigate statistical characteristics of this model and then map wireless sensor networks (WSNs) to it based on an efficient mechanism of broadcasting radius adjustment. Analysis and simulation show that WSNs working under this mechanism obtain longer lifetime and faster data delivering speed than those in traditional uniform radius WSNs.     

Joint utility-based uplink power and rate allocation in wireless networks: A non-cooperative game theoretic framework

In this paper a novel utility-based game theoretic framework is proposed to address the problem of joint transmission power and rate allocation in the uplink of a cellular wireless network. Initially, each user is associated with a generic utility function, capable of properly expressing and representing mobile user’s degree of satisfaction, in relation to the allocated system’s resources for heterogeneous services with various transmission rates. Then, a Joint Utility-based uplink Power and Rate Allocation (JUPRA) game is formulated, where each user aims selfishly at maximizing his utility-based performance under the imposed physical limitations, and its unique Nash equilibrium is determined with respect to both variables, i.e. uplink transmission power and rate. The JUPRA game’s convergence to its unique Nash equilibrium is proven and a distributed, iterative and low complexity algorithm for computing JUPRA game’s equilibrium is introduced. The performance of the proposed approach is evaluated in detail and its superiority compared to various state of the art approaches is illustrated, while the contribution of each component of the proposed framework in its performance is quantified and analyzed.     

A complex networks approach for data clustering

This work proposes a method for data clustering based on complex networks theory. A data set is represented as a network by considering different metrics to establish the connection between each pair of objects. The clusters are obtained by taking into account five community detection algorithms. The network-based clustering approach is applied in two real-world databases and two sets of artificially generated data. The obtained results suggest that the exponential of the Minkowski distance is the most suitable metric to quantify the similarities between pairs of objects. In addition, the community identification method based on the greedy optimization provides the best cluster solution. We compare the network-based clustering approach with some traditional clustering algorithms and verify that it provides the lowest classification error rate.     

Physical-layer distributed synchronization in wireless networks and applications

Physical-layer (pulse-coupled) techniques for distributed synchronization in wireless networks are attracting significant attention for their efficiency and scalability. In this paper, the model of pulse-coupled discrete Phase Locked Loops is reviewed and further investigated in two directions. At first, we extend the characterization of (frequency or phase) synchronous states and convergence conditions from homogeneous networks, where all the nodes have the same power constraints, to more general heterogeneous networks. Towards this goal, we build on recent results on algebraic graph theory for generally non-bidirectional graphs, and derive: (i) necessary and sufficient conditions for global synchronization of the network; (ii) closed-form expressions for the asymptotic values of frequency and phases, as a function of the network topology. In the second part of the paper, an application of pulse-coupled synchronization is considered, namely data collection in a sensor network. The energy efficiency of two medium access protocols for data collection from a set of randomly located sensors to an access point is compared: (i) basic ALOHA (which does not require time synchronization among the sensors); (ii) slotted ALOHA, where time synchronization is achieved via pulse-coupled clocks. Analysis shows that the energy spent for maintaining synchronization in slotted ALOHA pays off in terms of total energy consumption with respect to basic ALOHA provided that the number of sensors is sufficiently small. Moreover, the energy gain is proved to depend explicitly on the system load (in terms of packets /s), hardware and topology of the network.     

Cascading failure in the wireless sensor scale-free networks

In the practical wireless sensor networks(WSNs), the cascading failure caused by a failure node has serious impact on the network performance. In this paper, we deeply research the cascading failure of scale-free topology in WSNs. Firstly,a cascading failure model for scale-free topology in WSNs is studied. Through analyzing the influence of the node load on cascading failure, the critical load triggering large-scale cascading failure is obtained. Then based on the critical load,a control method for cascading failure is presented. In addition, the simulation experiments are performed to validate the effectiveness of the control method. The results show that the control method can effectively prevent cascading failure.     

A single hop architecture exploiting cooperative beamforming for wireless sensor networks

In this paper, we propose a single hop architecture for a cooperative wireless sensor network and analyze the attained distributed beamforming gain performance using the theory of random arrays. All nodes in the system transmit a single carrier such that the signals add up constructively towards the direction of the fusion center. The potential directive beamforming gains are investigated for different sensor network densities which are expressed as the number of nodes per carrier wavelength squared. The multiple access capability of the sensor network is achieved by employing an on-off keying orthogonal signaling technique, which is usually employed in atmospheric optical systems. Finally, we investigate the average loss in directivity gain when the received signal from each sensor node follows a Ricean distribution. The results show that high directive gains can be achieved in practical wireless sensor networks using simple sensor nodes.     

一种新的复杂网络影响力最大化发现方法

复杂网络中影响力最大化建模与分析是社会网络分析的关键问题之一, 其研究在理论和现实应用中都有重大的意义. 在给定s值的前提下, 如何寻找发现s个最大影响范围的节点集, 这是个组合优化问题, Kempe等已经证明该问题是NP-hard问题. 目前已有的随机算法时间复杂度低, 但是结果最差; 其他贪心算法时间复杂度很高, 不能适用于大型社会网络中, 并且这些典型贪心算法必须以了解网络的全局信息为前提, 而获取整个庞大复杂且不断发展变化的社会网络结构是很难以做到的. 我们提出了一种新的影响力最大化算法模型RMDN, 及改进的模型算法RMDN++, 模型只需要知道随机选择的节点以及其邻居节点信息, 从而巧妙地回避了其他典型贪心算法中必须事先掌握整个网络全局信息的问题, 算法的时间复杂度仅为O(s log(n)); 然后, 我们利用IC模型和LT模型在4种不同的真实复杂网络数据集的实验显示, RMDN, RMDN++算法有着和现有典型算法相近的影响力传播效果, 且有时还略优, 同时在运行时间上则有显著的提高; 我们从理论上推导证明了方法的可行性. 本文所提出的模型算法适用性更广, 可操作性更强, 为这项具有挑战性研究提供了新的思路和方法.     

无线传感网中基于质心的高效坐标压缩算法

鉴于无线传感网中有限的通信带宽和计算资源, 传感器节点传送压缩后的数据对于系统节能具有十分重要的意义. 本文提出一种利用反正切函数构建的非线性坐标压缩策略来降低系统的数据传输量. 得益于反正切函数的非线性特点, 在质心附近压缩率低, 离质心越远, 压缩率越高. 仿真结果显示, 所提算法特别适应于在质心附近具有高频分量的信号类型. 所提算法具有以下几个特点: 1)采样间隔是非均匀的; 2)可以在采样前实现压缩, 类似于压缩感知; 3)计算复杂度低, 算法简单易实现, 在实际应用中更具有优势. 关键词： 无线传感器网络 坐标压缩 非线性 质心     

一种基于势博弈的无线传感器网络拓扑控制算法

在实际的应用中,无线传感器网络常常由大量电池资源有限的传感器节点组成.如何降低网络功耗,最大化网络生存时间,是传感器网络拓扑控制技术的重要研究目标.随着传感节点的运行,节点的能量分布可能越来越不均衡,需要在考虑该因素的情况下,动态地调整节点的网络负载以均衡节点的能耗,达到延长网络生存时间的目的.该文引入博弈理论和势博弈的概念,综合考虑节点的剩余能量和节点发射功率等因素,设计了一种基于势博弈的拓扑控制模型,并证明了该模型纳什均衡的存在性.通过构造兼顾节点连通性和能耗均衡性的收益函数,以确保降低节点功耗的同时维持网络的连通性.通过提高邻居节点的平均剩余能量值以实现将剩余能量多的节点选择作为自身的邻居节点,提高节点能耗的均衡性.在此基础上,提出了一种分布式的能耗均衡拓扑控制算法.理论分析证明了该算法能保持网络的连通性.与现有基于博弈理论的DIA算法和MLPT算法相比,本算法形成的拓扑负载较重、剩余能量较小的瓶颈节点数量较少,节点剩余能量的方差较小,网络生存时间更长.     

Structural changes in data communication in wireless sensor networks

Wireless sensor networks are an important technology for making distributed autonomous measures in hostile or inaccessible environments. Among the challenges they pose, the way data travel among them is a relevant issue since their structure is quite dynamic. The operational topology of such devices can often be described by complex networks. In this work, we assess the variation of measures commonly employed in the complex networks literature applied to wireless sensor networks. Four data communication strategies were considered: geometric, random, small-world, and scale-free models, along with the shortest path length measure. The sensitivity of this measure was analyzed with respect to the following perturbations: insertion and removal of nodes in the geometric strategy; and insertion, removal and rewiring of links in the other models. The assessment was performed using the normalized Kullback-Leibler divergence and Hellinger distance quantifiers, both deriving from the Information Theory framework. The results reveal that the shortest path length is sensitive to perturbations.     

Efficient weakly-radiative wireless energy transfer: An EIT-like approach

Inspired by a quantum interference phenomenon known in the atomic physics community as electromagnetically induced transparency (EIT), we propose an efficient weakly radiative wireless energy transfer scheme between two identical classical resonant objects, strongly coupled to an intermediate classical resonant object of substantially different properties, but with the same resonance frequency. The transfer mechanism essentially makes use of the adiabatic evolution of an instantaneous (so called “dark”) eigenstate of the coupled 3-object system. Our analysis is based on temporal coupled mode theory (CMT), and is general enough to be valid for various possible sorts of coupling, including the resonant inductive coupling on which witricity-type wireless energy transfer is based. We show that in certain parameter regimes of interest, this scheme can be more efficient, and/or less radiative than other, more conventional approaches. A concrete example of wireless energy transfer between capacitively-loaded metallic loops is illustrated at the beginning, as a motivation for the more general case. We also explore the performance of the currently proposed EIT-like scheme, in terms of improving efficiency and reducing radiation, as the relevant parameters of the system are varied.