161 research outputs found
A Cooperative Diversity-Based Robust Mac Protocol in Wireless Ad Hoc Networks
In interference-rich and noisy environment, wireless communication is often hampered by unreliable communication links. Recently, there has been active research on cooperative communication that improves the communication reliability by having a collection of radio terminals transmit signals in a cooperative way. This paper proposes a medium access control (MAC) algorithm, called Cooperative Diversity MAC (CD-MAC), which exploits the cooperative communication capability of the physical (PHY) layer to improve robustness in wireless ad hoc networks. In CD-MAC, each terminal proactively selects a partner for cooperation and lets it transmit simultaneously so that this mitigates interference from nearby terminals, and thus, improves the network performance. For practicability, CD-MAC is designed based on the widely adopted IEEE 802.11 MAC. For accurate evaluation, this study presents and uses a realistic reception model by taking bit error rate (BER), derived from Intersil HFA3861B radio hardware, and the corresponding frame error rate (FER) into consideration. System-level simulation study shows that CD-MAC significantly outperforms the original IEEE 802.11 MAC in terms of packet delivery ratio and end-to-end delay
Cross-layer aided energy-efficient routing design for ad hoc networks
In this treatise, we first review some basic routing protocols conceived for ad hoc networks, followed by some design examples of cross-layer operation aided routing protocols. Specifically, cross-layer operation across the PHYsical layer (PHY), the Data Link layer (DL) and even the NETwork layer (NET) is exemplified for improving the energy efficiency of the entire system. Moreover, the philosophy of Opportunistic Routing (OR) is reviewed for the sake of further reducing the system's energy dissipation with the aid of optimized Power Allocation (PA). The system's end-to-end throughput is also considered in the context of a design example
Spectrum Allocation Algorithms for Cognitive Radio Mesh Networks
Empowered by the cognitive radio technology, and motivated by the sporadic channel utilization, both spatially and temporally, dynamic spectrum access networks (also referred to as cognitive radio networks and next generation wireless networks) have emerged as a solution to improve spectrum utilization and provide more flexibility to wireless communication. A cognitive radio network is composed of wireless users, referred to as secondary users, which are allowed to use licensed spectrum bands as long as their are no primary, licensed, users occupying the channel in their vicinity. This restricted spectrum access strategy leads to heterogeneity in channel availability among secondary users. This heterogeneity forms a significant source of performance degradation for cognitive radio networks, and poses a great challenge on protocol design. In this dissertation, we propose spectrum allocation algorithms that take into consideration the heterogeneity property and its effect on the network performance.
The spectrum allocation solutions proposed in this dissertation address three major objectives in cognitive radio mesh networks. The first objective is maximizing the network coverage, in terms of the total number of served clients, and at the same time simplifying the communication coordination function. To address this objective, we proposed a received based channel allocation strategy that alleviates the need for a common control channel, thus simplifying the coordination function, and at the same time maximizes the number of clients served with link reliability guarantees. We show the superiority of the proposed allocation strategy over other existing strategies.
The second objective is improving the multicast throughput to compensate for the performance degradation caused by channel heterogeneity. We proposed a scheduling algorithm that schedules multicast transmissions over both time and frequency and integrates that with the use of network coding. This algorithm achieves a significant gain, measured as the reduction in the total multicast time, as the simulation results prove. We also proposed a failure recovery algorithm that can adaptively adjust the schedule in response to temporary changes in channel availability.
The last objective is minimizing the effect of channel switching on the end-to-end delay and network throughput. Channel switching can be a significant source of delay and bandwidth wastage, especially if the secondary users are utilizing a wide spectrum band. To address this issue, we proposed an on-demand multicast routing algorithm for cognitive radio mesh networks based on dynamic programming. The algorithm finds the best available route in terms of end-to-end delay, taking into consideration the switching latency at individual nodes and the transmission time on different channels. We also presented the extensibility of the proposed algorithm to different routing metric. Furthermore, a route recovery algorithm that takes into consideration the overhead of rerouting and the route cost was also proposed. The gain of these algorithms was proved by simulation
Recommended from our members
Network Coding for Multihop Wireless Networks: Joint Random Linear Network Coding and Forward Error Correction with Interleaving for Multihop Wireless Networks
Optimising the throughput performance for wireless networks is one of the
challenging tasks in the objectives of communication engineering, since wireless
channels are prone to errors due to path losses, random noise, and fading
phenomena. The transmission errors will be worse in a multihop scenario due to its
accumulative effects. Network Coding (NC) is an elegant technique to improve the
throughput performance of a communication network. There is the fact that the bit
error rates over one modulation symbol of 16- and higher order- Quadrature
Amplitude Modulation (QAM) scheme follow a certain pattern. The Scattered
Random Network Coding (SRNC) system was proposed in the literature to exploit
the error pattern of 16-QAM by using bit-scattering to improve the throughput of
multihop network to which is being applied the Random Linear Network Coding
(RLNC). This thesis aims to improve further the SRNC system by using Forward
Error Correction (FEC) code; the proposed system is called Joint RLNC and FEC
with interleaving.
The first proposed system (System-I) uses Convolutional Code (CC) FEC. The
performances analysis of System-I with various CC rates of 1/2, 1/3, 1/4, 1/6, and
1/8 was carried out using the developed simulation tools in MATLAB and compared
to two benchmark systems: SRNC system (System-II) and RLNC system (System-
III). The second proposed system (System-IV) uses Reed-Solomon (RS) FEC
code. Performance evaluation of System IV was carried out and compared to three
systems; System-I with 1/2 CC rate, System-II, and System-III. All simulations were
carried out over three possible channel environments: 1) AWGN channel, 2) a
Rayleigh fading channel, and 3) a Rician fading channel, where both fading
channels are in series with the AWGN channel. The simulation results show that
the proposed system improves the SRNC system. How much improvement gain
can be achieved depends on the FEC type used and the channel environment.Indonesian Government and the University of Bradfor
Energy Minimization in D2D-Assisted Cache-Enabled Internet of Things: A Deep Reinforcement Learning Approach
Mobile edge caching (MEC) and device-to-device (D2D) communications are two potential technologies to resolve traffic overload problems in the Internet of Things. Previous works usually investigate them separately with MEC for traffic offloading and D2D for information transmission. In this article, a joint framework consisting of MEC and cache-enabled D2D communications is proposed to minimize the energy cost of systematic traffic transmission, where file popularity and user preference are the critical criteria for small base stations (SBSs) and user devices, respectively. Under this framework, we propose a novel caching strategy, where the Markov decision process is applied to model the requesting behaviors. A novel scheme based on reinforcement learning (RL) is proposed to reveal the popularity of files as well as users' preference. In particular, a Q-learning algorithm and a deep Q-network algorithm are, respectively, applied to user devices and the SBS due to different complexities of status. To save the energy cost of systematic traffic transmission, users acquire partial traffic through D2D communications based on the cached contents and user distribution. Taking the memory limits, D2D available files, and status changing into consideration, the proposed RL algorithm enables user devices and the SBS to prefetch the optimal files while learning, which can reduce the energy cost significantly. Simulation results demonstrate the superior energy saving performance of the proposed RL-based algorithm over other existing methods under various conditions
Wireless industrial monitoring and control networks: the journey so far and the road ahead
While traditional wired communication technologies have played a crucial role in industrial monitoring and control networks over the past few decades, they are increasingly proving to be inadequate to meet the highly dynamic and stringent demands of today’s industrial applications, primarily due to the very rigid nature of wired infrastructures. Wireless technology, however, through its increased pervasiveness, has the potential to revolutionize the industry, not only by mitigating the problems faced by wired solutions, but also by introducing a completely new class of applications. While present day wireless technologies made some preliminary inroads in the monitoring domain, they still have severe limitations especially when real-time, reliable distributed control operations are concerned. This article provides the reader with an overview of existing wireless technologies commonly used in the monitoring and control industry. It highlights the pros and cons of each technology and assesses the degree to which each technology is able to meet the stringent demands of industrial monitoring and control networks. Additionally, it summarizes mechanisms proposed by academia, especially serving critical applications by addressing the real-time and reliability requirements of industrial process automation. The article also describes certain key research problems from the physical layer communication for sensor networks and the wireless networking perspective that have yet to be addressed to allow the successful use of wireless technologies in industrial monitoring and control networks
- …