Power Optimisation and Relay Selection in Cooperative Wireless Communication Networks

Cooperative communications have emerged as a significant concept to improve reliability and throughput in wireless systems. In cooperative networks, the idea is to implement a scheme in wireless systems where the nodes can harmonize their resources thereby enhancing the network performance in different aspects such as latency, BER and throughput. As cooperation spans from the basic idea of transmit diversity achieved via MIMO techniques and the relay channel, it aims to reap somewhat multiple benefits of combating fading/burst errors, increasing throughput and reducing energy use. Another major benefit of cooperation in wireless networks is that since the concept only requires neighbouring nodes to act as virtual relay antennas, the concept evades the negative impacts of deployment costs of multiple physical antennas for network operators especially in areas where they are difficult to deploy. In cooperative communications energy efficiency and long network lifetimes are very important design issues, the focus in this work is on ad hoc and sensor network varieties where the nodes integrate sensing, processing and communication such that their cooperation capabilities are subject to power optimisation. As cooperation communications leads to trade-offs in Quality of Services and transmit power, the key design issue is power optimisation to dynamically combat channel fluctuations and achieve a net reduction of transmit power with the goal of saving battery life. Recent researches in cooperative communications focus on power optimisation achieved via power control at the PHY layer, and/or scheduling mechanism at the MAC layer. The approach for this work will be to review the power control strategy at the PHY layer, identify their associated trade-offs, and use this as a basis to propose a power control strategy that offers adaptability to channel conditions, the road to novelty in this work is a channel adaptable power control algorithm that jointly optimise power allocation, modulation strategy and relay selection. Thus, a novel relay selection method is developed and implemented to improve the performance of cooperative wireless networks in terms of energy consumption. The relay selection method revolves on selection the node with minimum distance to the source and destination. The design is valid to any wireless network setting especially Ad-hoc and sensor networks where space limitations preclude the implementation of bigger capacity battery. The thesis first investigates the design of relay selection schemes in cooperative networks and the associated protocols. Besides, modulation strategy and error correction code impact on energy consumption are investigated and the optimal solution is proposed and jointly implemented with the relay selection method. The proposed algorithm is extended to cooperative networks in which multiple nodes participate in cooperation in fixed and variable rate system. Thus, multi relay selection algorithm is proposed to improve virtual MIMO performance in terms of energy consumption. Furthermore, motivated by the trend of cell size optimisation in wireless networks, the proposed relay selection method is extended to clustered wireless networks, and jointly implemented with virtual clustering technique. The work will encompass three main stages: First, the cooperative system is designed and two major protocols Decode and Forward (DF) and amplify and forward (AF) are investigated. Second, the proposed algorithm is modelled and tested under different channel conditions with emphasis on its performance using different modulation strategies for different cooperative wireless networks. Finally, the performance of the proposed algorithm is illustrated and verified via computer simulations. Simulation results show that the distance based relay selection algorithm exhibits an improved performance in terms of energy consumption compared to the conventional cooperative schemes under different cooperative communication scenarios

Informed Network Coding for Minimum Decoding Delay

Network coding is a highly efficient data dissemination mechanism for wireless networks. Since network coded information can only be recovered after delivering a sufficient number of coded packets, the resulting decoding delay can become problematic for delay-sensitive applications such as real-time media streaming. Motivated by this observation, we consider several algorithms that minimize the decoding delay and analyze their performance by means of simulation. The algorithms differ both in the required information about the state of the neighbors' buffers and in the way this knowledge is used to decide which packets to combine through coding operations. Our results show that a greedy algorithm, whose encodings maximize the number of nodes at which a coded packet is immediately decodable significantly outperforms existing network coding protocols.Comment: Proc. of the IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2008), Atlanta, USA, September 200

Adoption of vehicular ad hoc networking protocols by networked robots

This paper focuses on the utilization of wireless networking in the robotics domain. Many researchers have already equipped their robots with wireless communication capabilities, stimulated by the observation that multi-robot systems tend to have several advantages over their single-robot counterparts. Typically, this integration of wireless communication is tackled in a quite pragmatic manner, only a few authors presented novel Robotic Ad Hoc Network (RANET) protocols that were designed specifically with robotic use cases in mind. This is in sharp contrast with the domain of vehicular ad hoc networks (VANET). This observation is the starting point of this paper. If the results of previous efforts focusing on VANET protocols could be reused in the RANET domain, this could lead to rapid progress in the field of networked robots. To investigate this possibility, this paper provides a thorough overview of the related work in the domain of robotic and vehicular ad hoc networks. Based on this information, an exhaustive list of requirements is defined for both types. It is concluded that the most significant difference lies in the fact that VANET protocols are oriented towards low throughput messaging, while RANET protocols have to support high throughput media streaming as well. Although not always with equal importance, all other defined requirements are valid for both protocols. This leads to the conclusion that cross-fertilization between them is an appealing approach for future RANET research. To support such developments, this paper concludes with the definition of an appropriate working plan

Trust and reputation management for securing collaboration in 5G access networks: the road ahead

Trust represents the belief or perception of an entity, such as a mobile device or a node, in the extent to which future actions and reactions are appropriate in a collaborative relationship. Reputation represents the network-wide belief or perception of the trustworthiness of an entity. Each entity computes and assigns a trust or reputation value, which increases and decreases with the appropriateness of actions and reactions, to another entity in order to ensure a healthy collaborative relationship. Trust and reputation management (TRM) has been investigated to improve the security of traditional networks, particularly the access networks. In 5G, the access networks are multi-hop networks formed by entities which may not be trustable, and so such networks are prone to attacks, such as Sybil and crude attacks. TRM addresses such attacks to enhance the overall network performance, including reliability, scalability, and stability. Nevertheless, the investigation of TRM in 5G, which is the next-generation wireless networks, is still at its infancy. TRM must cater for the characteristics of 5G. Firstly, ultra-densification due to the exponential growth of mobile users and data traffic. Secondly, high heterogeneity due to the different characteristics of mobile users, such as different transmission characteristics (e.g., different transmission power) and different user equipment (e.g., laptops and smartphones). Thirdly, high variability due to the dynamicity of the entities’ behaviors and operating environment. TRM must also cater for the core features of 5G (e.g., millimeter wave transmission, and device-to-device communication) and the core technologies of 5G (e.g., massive MIMO and beamforming, and network virtualization). In this paper, a review of TRM schemes in 5G and traditional networks, which can be leveraged to 5G, is presented. We also provide an insight on some of the important open issues and vulnerabilities in 5G networks that can be resolved using a TRM framework

Secure Routing in Wireless Mesh Networks

Wireless mesh networks (WMNs) have emerged as a promising concept to meet the challenges in next-generation networks such as providing flexible, adaptive, and reconfigurable architecture while offering cost-effective solutions to the service providers. Unlike traditional Wi-Fi networks, with each access point (AP) connected to the wired network, in WMNs only a subset of the APs are required to be connected to the wired network. The APs that are connected to the wired network are called the Internet gateways (IGWs), while the APs that do not have wired connections are called the mesh routers (MRs). The MRs are connected to the IGWs using multi-hop communication. The IGWs provide access to conventional clients and interconnect ad hoc, sensor, cellular, and other networks to the Internet. However, most of the existing routing protocols for WMNs are extensions of protocols originally designed for mobile ad hoc networks (MANETs) and thus they perform sub-optimally. Moreover, most routing protocols for WMNs are designed without security issues in mind, where the nodes are all assumed to be honest. In practical deployment scenarios, this assumption does not hold. This chapter provides a comprehensive overview of security issues in WMNs and then particularly focuses on secure routing in these networks. First, it identifies security vulnerabilities in the medium access control (MAC) and the network layers. Various possibilities of compromising data confidentiality, data integrity, replay attacks and offline cryptanalysis are also discussed. Then various types of attacks in the MAC and the network layers are discussed. After enumerating the various types of attacks on the MAC and the network layer, the chapter briefly discusses on some of the preventive mechanisms for these attacks.Comment: 44 pages, 17 figures, 5 table