Energy and Spectral Efficient Wireless Communications

Energy and spectrum are two precious commodities for wireless communications. How to improve the energy and spectrum efficiency has become two critical issues for the designs of wireless communication systems. This dissertation is devoted to the development of energy and spectral efficient wireless communications. The developed techniques can be applied to a wide range of wireless communication systems, such as wireless sensor network (WSN) designed for structure health monitoring (SHM), medium access control (MAC) for multi-user systems, and cooperative spectrum sensing in cognitive radio systems. First, to improve the energy efficiency in SHM WSN, a new ultra low power (ULP) WSN is proposed to monitor the vibration properties of structures such as buildings, bridges, and the wings and bodies of aircrafts. The new scheme integrates energy harvesting, data sensing, and wireless communication into a unified process, and it achieves significant energy savings compared to existing WSNs. Second, a cross-layer collision tolerant (CT) MAC scheme is proposed to improve energy and spectral efficiency in a multi-user system with shared medium. When two users transmit simultaneously over a shared medium, a collision happens at the receiver. Conventional MAC schemes will discard the collided signals, which result in a waste of the precious energy and spectrum resources. In our proposed CT-MAC scheme, each user transmits multiple weighted replicas of a packet at randomly selected data slots in a frame, and the indices of the selected slots are transmitted in a special collision-free position slot at the beginning of each frame. Collisions of the data slots in the MAC layer are resolved by using multiuser detection (MUD) in the PHY layer. Compared to existing schemes, the proposed CT-MAC scheme can support more simultaneous users with a higher throughput. Third, a new cooperative spectrum sensing scheme is proposed to improve the energy and spectral efficiency of a cognitive radio network. A new Slepian-Wolf coded cooperation scheme is proposed for a cognitive radio network with two secondary users (SUs) performing cooperative spectrum sensing through a fusion center (FC). The proposed scheme can achieve significant performance gains compared to existing schemes

SURF: A Distributed Channel Selection Strategy for Data Dissemination in Multi-Hop Cognitive Radio Networks

In this paper, we propose an intelligent and distributed channel selection strategy for efficient data dissemination in multi-hop cognitive radio network. Our strategy, SURF, classifies the available channels and uses them efficiently to increase data dissemination reliability in multi-hop cognitive radio networks. The classification is done on the basis of primary radio unoccupancy and of the number of cognitive radio neighbors using the channels. Through extensive NS-2 simulations, we study the performance of SURF compared to three related approaches. Simulation results confirm that our approach is effective in selecting the best channels for efficient communication (in terms of less primary radio interference) and for highest dissemination reachability in multi-hop cognitive radio networks

Randomized and efficient time synchronization in dynamic wireless sensor networks: a gossip-consensus-based approach

This paper proposes novel randomized gossip-consensus-based sync (RGCS) algorithms to realize efficient time correction in dynamic wireless sensor networks (WSNs). First, the unreliable links are described by stochastic connections, reflecting the characteristic of changing connectivity gleaned from dynamicWSNs. Secondly, based on the mutual drift estimation, each pair of activated nodes fully adjusts clock rate and offset to achieve network-wide time synchronization by drawing upon the gossip consensus approach. The converge-to-max criterion is introduced to achieve a much faster convergence speed. The theoretical results on the probabilistic synchronization performance of the RGCS are presented. Thirdly, a Revised-RGCS is developed to counteract the negative impact of bounded delays, because the uncertain delays are always present in practice and would lead to a large deterioration of algorithm performances. Finally, extensive simulations are performed on the MATLAB and OMNeT++ platform for performance evaluation. Simulation results demonstrate that the proposed algorithms are not only efficient for synchronization issues required for dynamic topology changes but also give a better performance in term of converging speed, collision rate, and the robustness of resisting delay, and outperform other existing protocols

Decentralized Machine Learning based Energy Efficient Routing and Intrusion Detection in Unmanned Aerial Network (UAV)

Decentralized machine learning (FL) is a system that uses federated learning (FL). Without disclosing locally stored sensitive information, FL enables multiple clients to work together to solve conventional distributed ML problems coordinated by a central server. In order to classify FLs, this research relies heavily on machine learning and deep learning techniques. The next generation of wireless networks is anticipated to incorporate unmanned aerial vehicles (UAVs) like drones into both civilian and military applications. The use of artificial intelligence (AI), and more specifically machine learning (ML) methods, to enhance the intelligence of UAV networks is desirable and necessary for the aforementioned uses. Unfortunately, most existing FL paradigms are still centralized, with a singular entity accountable for network-wide ML model aggregation and fusion. This is inappropriate for UAV networks, which frequently feature unreliable nodes and connections, and provides a possible single point of failure. There are many challenges by using high mobility of UAVs, of loss of packet frequent and difficulties in the UAV between the weak links, which affect the reliability while delivering data. An earlier UAV failure is happened by the unbalanced conception of energy and lifetime of the network is decreased; this will accelerate consequently in the overall network. In this paper, we focused mainly on the technique of security while maintaining UAV network in surveillance context, all information collected from different kinds of sources. The trust policies are based on peer-to-peer information which is confirmed by UAV network. A pre-shared UAV list or used by asymmetric encryption security in the proposal system. The wrong information can be identified when the UAV the network is hijacked physically by using this proposed technique. To provide secure routing path by using Secure Location with Intrusion Detection System (SLIDS) and conservation of energy-based prediction of link breakage done by location-based energy efficient routing (LEER) for discovering path of degree connectivity.  Thus, the proposed novel architecture is named as Decentralized Federate Learning- Secure Location with Intrusion Detection System (DFL-SLIDS), which achieves 98% of routing overhead, 93% of end-to-end delay, 92% of energy efficiency, 86.4% of PDR and 97% of throughput

Algorithm Optimization and Hardware Acceleration for Machine Learning Applications on Low-energy Systems

Machine learning (ML) has been extensively employed for strategy optimization, decision making, data classification, etc. While ML shows great triumph in its application field, the increasing complexity of the learning models introduces neoteric challenges to the ML system designs. On the one hand, the applications of ML on resource-restricted terminals, like mobile computing and IoT devices, are prevented by the high computational complexity and memory requirement. On the other hand, the massive parameter quantity for the modern ML models appends extra demands on the system\u27s I/O speed and memory size. This dissertation investigates feasible solutions for those challenges with software-hardware co-design

Privacy-Preserving Distributed Optimization via Subspace Perturbation: A General Framework

As the modern world becomes increasingly digitized and interconnected, distributed signal processing has proven to be effective in processing its large volume of data. However, a main challenge limiting the broad use of distributed signal processing techniques is the issue of privacy in handling sensitive data. To address this privacy issue, we propose a novel yet general subspace perturbation method for privacy-preserving distributed optimization, which allows each node to obtain the desired solution while protecting its private data. In particular, we show that the dual variables introduced in each distributed optimizer will not converge in a certain subspace determined by the graph topology. Additionally, the optimization variable is ensured to converge to the desired solution, because it is orthogonal to this non-convergent subspace. We therefore propose to insert noise in the non-convergent subspace through the dual variable such that the private data are protected, and the accuracy of the desired solution is completely unaffected. Moreover, the proposed method is shown to be secure under two widely-used adversary models: passive and eavesdropping. Furthermore, we consider several distributed optimizers such as ADMM and PDMM to demonstrate the general applicability of the proposed method. Finally, we test the performance through a set of applications. Numerical tests indicate that the proposed method is superior to existing methods in terms of several parameters like estimated accuracy, privacy level, communication cost and convergence rate

A COMMUNICATION FRAMEWORK FOR MULTIHOP WIRELESS ACCESS AND SENSOR NETWORKS: ANYCAST ROUTING & SIMULATION TOOLS

The reliance on wireless networks has grown tremendously within a number of varied application domains, prompting an evolution towards the use of heterogeneous multihop network architectures. We propose and analyze two communication frameworks for such networks. A first framework is designed for communications within multihop wireless access networks. The framework supports dynamic algorithms for locating access points using anycast routing with multiple metrics and balancing network load. The evaluation shows significant performance improvement over traditional solutions. A second framework is designed for communication within sensor networks and includes lightweight versions of our algorithms to fit the limitations of sensor networks. Analysis shows that this stripped down version can work almost equally well if tailored to the needs of a sensor network. We have also developed an extensive simulation environment using NS-2 to test realistic situations for the evaluations of our work. Our tools support analysis of realistic scenarios including the spreading of a forest fire within an area, and can easily be ported to other simulation software. Lastly, we us our algorithms and simulation environment to investigate sink movements optimization within sensor networks. Based on these results, we propose strategies, to be addressed in follow-on work, for building topology maps and finding optimal data collection points. Altogether, the communication framework and realistic simulation tools provide a complete communication and evaluation solution for access and sensor networks