Distributed Estimation and Control of Algebraic Connectivity over Random Graphs

In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power iteration method that allows each node to estimate and track the algebraic connectivity of the underlying expected graph. Using results from stochastic approximation theory, we prove that the proposed method converges almost surely (a.s.) to the desired value of connectivity even in the presence of imperfect communication scenarios. The estimation strategy is then used as a basic tool to adapt the power transmitted by each node of a wireless network, in order to maximize the network connectivity in the presence of realistic Medium Access Control (MAC) protocols or simply to drive the connectivity toward a desired target value. Numerical results corroborate our theoretical findings, thus illustrating the main features of the algorithm and its robustness to fluctuations of the network graph due to the presence of random link failures.Comment: To appear in IEEE Transactions on Signal Processin

Efficient resource allocation for 5G hybrid wireless networks

This thesis explores three directions of energy-efficiency(EE) and spectral efficiency(SE) under 5G wireless networks. Firstly, we study the optimization of power control for the small (two-user) interference channel in which the terminals are time-switched between the signal-processing and energy-harvesting phases. Both energy harvesting and signal-processing processes are during the downlink. The objective is to maximize the sum-rate, subject to the minimum data and harvested energy constraints at the receivers, assuming a fixed time-switching coefficient. The key contribution is using a geometric approach that analyzes the feasible region governed by the constraints, which gives rise to the optimal power control solution. Another topic focuses on the performance analysis of two user association schemes for wireless power transfer (WPT) in heterogeneous networks (HetNets) massive multiple-input multiple-output (MIMO) antennas, downlink for the WPT in the first phase and uplink for wireless information transfer (WIT) in the second phase. The two user association schemes considered in the analysis are the Downlink received signal power (DRSP) based approach for maximizing the harvested energy; and the uplink received signal power (URSP) based approach for minimizing the uplink path loss. In the downlink, we adopt a low-complexity approach for massive MIMO power transfer to recharge users. Then we derive the average uplink achievable rate with the harvested energy. The last topic analyses a large-scale mmWave ad hoc network in the randomly located eavesdroppers area, where eavesdroppers can still intercept the confidential messages, since they may reside in the signal beam. This chapter explores the potential of physical layer security in mmWave ad hoc networks. Specifically, we characterize the impact of mmWave channel characteristics, random blockages, and antenna gains on the secrecy performance. For the special case of the uniform linear array (ULA), a tractable approach is proposed to evaluate the average achievable secrecy rate

Routing efficiency in wireless sensor-actor networks considering semi-automated architecture

Wireless networks have become increasingly popular and advances in wireless communications and electronics have enabled the development of different kind of networks such as Mobile Ad-hoc Networks (MANETs), Wireless Sensor Networks (WSNs) and Wireless Sensor-Actor Networks (WSANs). These networks have different kind of characteristics, therefore new protocols that fit their features should be developed. We have developed a simulation system to test MANETs, WSNs and WSANs. In this paper, we consider the performance behavior of two protocols: AODV and DSR using TwoRayGround model and Shadowing model for lattice and random topologies. We study the routing efficiency and compare the performance of two protocols for different scenarios. By computer simulations, we found that for large number of nodes when we used TwoRayGround model and random topology, the DSR protocol has a better performance. However, when the transmission rate is higher, the routing efficiency parameter is unstable.Peer ReviewedPostprint (published version

Resilient networking in wireless sensor networks

This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In this report, we focus on the behavior of routing protocols to determine which properties make them more resilient to attacks. Our aim is to find some answers to the following questions. Are there any existing protocols, not designed initially for security, but which already contain some inherently resilient properties against attacks under which some portion of the network nodes is compromised? If yes, which specific behaviors are making these protocols more resilient? We propose in this report an overview of security strategies for WSNs in general, including existing attacks and defensive measures. In this report we focus at the network layer in particular, and an analysis of the behavior of four particular routing protocols is provided to determine their inherent resiliency to insider attacks. The protocols considered are: Dynamic Source Routing (DSR), Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing (RWR)