Multi-radio Wireless Networks Research Articles

Optimizing channel allocation in WiMAX MIMO model using fuzzy game theory

The WiMAX (IEEE 802.16) network is meant to serve the requirement of prevalent broadband wireless network and present an affordable low maintenance substitute to the wired counterpart. Channel allocation for fully connected multi-radio wireless networks is a major research area for few years due to the challenges involved in it. In this paper, a hybrid multi-channel allocation in wireless IEEE802.16 network is formulated through game theory approach. In the channel allocation game, there can be too many strategies available, out of which only some of the strategies are feasible and the pay-offs are not known precisely. Since fuzzy based mathematics can be used to eliminate strategies which are impractical. An optimization technique for channel allocation using Fuzzy game theory is proposed. The simulation exhibit that the proposed FGCA (Fuzzy Game based Channel Allocation) notably diminishes the channel interference and enhance the comprehensive performance of the WiMAX system with respect to important network parameters like Channel acquisition delay, Channel utilization, Average throughput.

New Analytical Channel Allocation Methodology for Multichannel Multi-Radio Wireless Networks

In wireless technologies, jamming attack is a main Research problem in multichannel multi-radio as they block communication in wireless networks. Malicious nodes block legitimate communication through jamming attacks that causes intentional interference. This paper presents the problem of jamming attack in multichannel multi-radio wireless network. First, Allocated the channel in Randomized manner and measure the Entropy rate. Second, defined the channel capacity. Third determined noiseless channel. Furthermore, Find the responses from channel and compare Response channel (H(S/R)) with Noise less channel (T). If H(S/R) ∈ T, Then to select the channel otherwise to reject the channel and assign (H(S/R)) = Attack. Finally, Based on the jammer detection algorithm, the result is compared with cyclic spectral analysis. But the proposed algorithm computation process is very simple than cyclic spectral analysis algorithm and Cyclostationary.Based jammer Detection Algorithm.

An efficient trbl-cdrrp method to detect jamming attacks in multichannel multiradio wireless networks

Wireless network is a flexible and scalable data communications system, which uses electromagnetic waves or infrared waves to broadcast data and receive data from one end to another without use physical link. Limited processing speed, energy efficiency, limited memory power, and many more constraints are affecting wireless networks. In these constraints security is a main concern. Protecting wireless networks from different kinds of attack is not a simple task, as the security violates are varies. To recognize this difficulty, we have to discuss and evaluate different methods for jamming in multi channel multi-radio wireless networks. Jamming attacks in wireless networks is defined as by minimizing the noise ratio at receiver side by the way of transmission of interfering wireless signals. In this discussion Transmission Range Based Localization-Constant Deceptive Random Reactive Protocol (TRBL-CDRRP) is proposed for detecting the different types of jamming attacks in multichannel multi-radio wireless networks. Also the suggested technique is utilized to find location and transmission range for every node. The performance metrics like Packet Delivery Ratio (PDR), End-to-End delay, Security, and throughput are to be resolute and also related with the existing algorithms. The execution is done in a NS-2 simulator.

Joint Throughput Optimization for Multichannel Multiradio Multirate Wireless Network with Network Coding

ABSTRACTNetwork coding has been proposed to increase network throughput by combining packets at intermediate nodes. In this paper, we propose a joint throughput optimization method for a multirate multichannel multiradio wireless network with network coding. We propose algorithms for congestion control, joint distributed rate control, and heuristic resource allocation to solve the utility maximization problem in the wireless network environment with network coding. To minimize performance degradation generated by packet loss, we propose a congestion control algorithm. Furthermore, we present a sophisticated resource allocation algorithm which finds a node for the worst traffic jam and selects a session that needs to be first transferred in the node. Then, the node is allocated with the channels and radios for the packets of the selected session. Furthermore, a rate selection method is presented to determine the rate of each node. The simulation results show that the proposed method achieves the optimal performance in a multirate multichannel multiradio wireless network.

Stealthy attack detection in multi-channel multi-radio wireless networks

In recent years, the lack of network traffic analysis and flexible network topologies reduce the performance of the multi-channel multi-radio wireless networks. As high scalability of its participants and routing structure, multicast communication of wireless networks is vulnerable to stealthy attacks. Stealthy packet dropping disrupts the packet from reaching the destination through malicious behavior at an intermediate node. A network table is maintained in each hop to transfer the data packet from source to destination. The main contribution of this paper is to use that network table to monitor the drastic changes incoming packet as well as an outgoing packet. More specifically, we have proposed Cumulative Sum algorithm (CuSum) with bootstrap analysis method to monitor the changes in the network packet transmission. We have used NS-2 network simulator to simulate the proposed CUSUM algorithm with a bootstrap method is compared with various other existing change detection methods such as such as Binary Segmentation (BinSeg), Pruned Exact Linear Time (PELT) and Segment Neighborhood (SegNeigh) method. The simulation results proved the efficiency of the proposed CuSum with bootstrap analysis method.

Proportional Fair Traffic Splitting and Aggregation in Heterogeneous Wireless Networks

Traffic load balancing and resource allocation is set to play a crucial role in leveraging the dense and increasingly heterogeneous deployment of multiradio wireless networks. Traffic aggregation across different access points (APs)/radio access technologies (RATs) has become an important feature of recently introduced cellular standards on LTE dual connectivity and LTE-WLAN aggregation (LWA). Low complexity traffic splitting solutions for scenarios where the APs are not necessarily collocated are of great interest for operators. In this letter, we consider a scenario, where traffic for each user may be split across macrocell and an LTE or WiFi small cells connected by nonideal backhaul links, and develop a closed form solution for optimal aggregation accounting for the backhaul delay. The optimal solution lends itself to a “water-filling” based interpretation, where the fraction of user’s traffic sent over macrocell is proportional to ratio of user’s peak capacity on that macrocell and its throughput on the small cell. Using comprehensive system level simulations, the developed optimal solution is shown to provide substantial edge and median throughput gain over algorithms representative of current 3GPP-WLAN interworking solutions. The achievable performance benefits hold promise for operators expecting to introduce aggregation solutions with their existing WLAN deployments.

Distributed Joint Rate Control, Resource Allocation, and Congestion Control for Throughput Optimization in Multirate Multiradio Multichannel Wireless Network with Intersession/Intrasession Network Coding

Wireless multihop networks are increasingly used because of their low cost and easy deployment. However, there are still many restrictions that degrade performance. Network coding has been proposed to improve the throughput of a wireless network through the characteristics of overhearing and broadcast. In this paper, we model the network utility maximization problem using a combined intrasession and intersession network coding method to improve the network utility in multiradio, multichannel, and multirate wireless network. And we propose a network throughput optimization scheme with a rate control, resource allocation and congestion control algorithm. We formulate an optimal framework reflecting wireless network environment. Also, we propose a rate selection scheme to choose the transmission rate on each node. We evaluate the proposed algorithms by simulation. The performance evaluation results show that the proposed scheme can improve throughput for network by utility optimization in a multiradio, multichannel, and multirate wireless network.

Maximizing Networking Capacity in Multi-Channel Multi-Radio Wireless Networks

Providing each node with one or more multi-channel radios offers a promising avenue for enhancing the network capacity by simultaneously exploiting multiple non-overlapping channels through different radio interfaces and mitigating interferences through proper channel assignment. However, it is quite challenging to effectively utilize multiple channels and/or multiple radios to maximize throughput capacity. The National Natural Science Foundation of China (NSFC) Project 61128005 conducted comprehensive algorithmic-theoretic and queuing-theoretic studies of maximizing wireless networking capacity in multi-channel multi-radio (MC-MR) wireless networks under the protocol interference model and fundamentally advanced the state of the art. In addition, under the notoriously hard physical interference model, this project has taken initial algorithmic studies on maximizing the network capacity, with or without power control. We expect the new techniques and tools developed in this project will have wide applications in capacity planning, resource allocation and sharing, and protocol design for wireless networks, and will serve as the basis for future algorithm developments in wireless networks with advanced features, such as multi-input multi-output (MIMO) wireless networks.

An Interference based Routing Metric In Wireless Mesh Network

Wireless Mesh Networks (WMNs) are consist of mesh routers. Mesh routers are built with multiple radios for improving capacity of network with the assignment of different frequency bands (channels). Establishment of routing is very important for getting good output or achieving good performance in multi radio wireless networks. In this paper we have proposed Weighted Cumulative Consecutive Conflicting Expected Transmission Time (WCCCETT) routing metric for multi radio multi channel wireless mesh networks. Theoretic analysis and simulation verify WCCCETT gives better performance than other relevant metrics with respect to the selection of less interference effecting path.

Channel Aware Opportunistic Routing in Multi-Radio Multi-Channel Wireless Mesh Networks

Opportunistic routing (OR) involves multiple candidate forwarders to relay packets by taking advantage of the broadcast nature and multi-user diversity of the wireless medium. Compared with traditional routing (TR), OR is more suitable for the unreliable wireless link, and can evidently improve the end to end throughput. At present, there are many achievements concerning OR in the single radio wireless network. However, the study of OR in multi-radio wireless network stays the beginning stage. To demonstrate the benefit of OR in multi-radio multi-channel network, we propose a new route metric — multi-channel expected anypath transmission time (MEATT), which exploits the channel diversity and resource of multiple candidate forwarders for OR. Based on the new metric, a distributed algorithm named Channel Aware Opportunistic Routing (CAOR) is proposed. The simulation results demonstrate that MEATT improves 1.14 and 1.53 times of the average throughput than existing expected anypath transmission time (EATT)and metric of interference and channel switching cost (MIC) respectively. The average delay of MEATT is 17% and 40% lower than those of EATT, MIC, respectively.

A New Channel Conflict Model for Multi-Radio Multi-Channel Wireless Networks

Before the channel allocation of wireless networks, usually need to select the appropriate channel conflict model to model the channel collision. For the current channel conflict model cant model the channel collision comprehensively, the graph N-tuple coloring model based on graph N-tuple coloring theory is proposed in this article. The theoretical analysis and simulation results show that this model can model the channel collision comprehensively, and transform the channel allocation problem into N-tuple coloring problem on a graph for the further analysis and solve.

Multicast Capacity of Multi-channel Multi-radio Wireless Ad Hoc Networks

Multicast Capacity of Multi-channel Multi-radio Wireless Ad Hoc Networks

Low Delay MAC Scheduling for Frequency-Agile Multi-Radio Wireless Networks

Recent trends suggest that cognitive radio based wireless networks will be frequency agile and the nodes will be equipped with multiple radios capable of tuning across large swaths of spectrum. The MAC scheduling problem in such networks refers to making intelligent decisions on which communication links to activate at which time instant and over which frequency band. The challenge in designing a low-complexity distributed MAC, that achieves low delay, is posed by two additional dimensions of cognitive radio networks: interference graphs and data rates that are frequency-band dependent, and explosion in number of feasible schedules due to large number of available frequency-bands. In this paper, we propose MAXIMALGAIN MAC, a distributed MAC scheduler for frequency agile multi-band networks that simultaneously achieves the following: (i) optimal network-delay scaling with respect to the number of communicating pairs, (ii) low computational complexity of O(log2(maximum degree of the interference graphs)) which is independent of the number of frequency bands, number of radios per node, and overall size of the network, and (iii) robustness, i.e., it can be adapted to a scenario where nodes are not synchronized and control packets could be lost. Our proposed MAC also achieves a throughput provably within a constant fraction (under isotropic propagation) of the maximum throughput. Due to a recent impossibility result, optimal delay-scaling could only be achieved with some amount of throughput loss [30]. Extensive simulations using OMNeT++ network simulator shows that, compared to a multi-band extension of a state-of-art CSMA algorithm (namely, Q-CSMA), our asynchronous algorithm achieves a 2.5x? reduction in delay while achieving at least 85% of the maximum achievable throughput. Our MAC algorithms are derived from a novel local search based technique.

Proportionally Quasi-Fair Scheduling for End-to-End Rates in Multi-Hop Wireless Networks

Known an a criterion that solves the trade-off between fairness and efficiency, proportional fairness is well-studied in cellular networks in the Qualcomm High Data Rate System. In multi-hop wireless networks, proportional fairness is solved by maximizing the logarithmic aggregate utility function. However, this approach can deal with instantaneous rates only where long term fairness is to be targeted. In this case, cumulative rates are more suitable. This paper proposes a framework for multi-hop wireless networks to guarantee fairness of cumulative data rates. The framework can be extended to other kinds of fairness such as max-min fairness, and to more complex networks, multi-channel multi-radio wireless networks.

Design and analysis of cooperative wireless data access algorithms in multi-radio wireless networks

In the future, most mobile nodes will have multiple radio interfaces, and this feature can be exploited to reduce the transmission cost in wireless data access applications. In this work, we propose cooperative poll-each-read (CoopPER) and cooperative callback (CoopCB) wireless data access algorithms with strong consistency in multi-radio wireless networks. In addition, we investigate CoopPER and CoopCB in heterogeneous wireless networks where CoopPER and CoopCB nodes are mixed. Extensive simulations are done to show the effects of access-to-update ratio, data access pattern, cache size, and cooperation range. Simulation results demonstrate that CoopPER and CoopCB can significantly reduce the expensive transmission cost over wireless links.

Performance Comparison for Routing Protocols in Multi-Radio Multi-Channel Multi-Hop Wireless Networks

In this paper, we consider a TDMA-based wireless network and address two major issues, fading and interference, existing in wireless networks since fading will lead to low quality links and interference may lead to unfair channel allocation. Because channel allocation selects the proper channel for each logical link and routing determines through which logical links the packets should be forwarded, there is strong interaction between MAC layer and network layer. In this paper, we seek for the performance trend with more channels allocated and further compare the performances of Bellman-Ford and AODV routing protocols based on the Packet Deliver Rate (PDR) to MAC layer in multi-radio multi-channel multi-hop wireless networks. Numerical results are given and discussions as well as insights into performance aspects for multi-radio multi-channel deployment are provided.

Traffic sensing and characterization in multi-channel wireless networks for cognitive networking

Traffic sensing and characterization is an important building block of cognitive networking systems, however, it is very challenging to perform traffic characterization in multi-channel multi-radio wireless networks. Due to the presence of network traffic in multiple channels, the existing count-based packet sampling methods demand continuous capture on each channel to be effective; this requires a dedicated wireless interface per channel, and hence the existing sampling methods require a very expensive infrastructure and have poor scalability. Time-based sampling methods, on the other hand, offer a cost-effective and scalable solution by reducing the amount and cost of the resources necessary to monitor and characterize the wireless spectrum.The contributions of this paper include the following: (i) a discussion of packet sampling techniques for traffic sensing in multi-channel wireless networks, (ii) a comparison of various time-based sampling strategies using the Kullback–Leibler divergence (KLD) measure, (iii) a study on the effect of the sampling parameters on the accuracy of the sampling strategies, (iv) development of sampling accuracy graphs for easing the process of best sampling scheme selection in multi-channel wireless networks, (v) the proposal of a new metric (traffic intensity) which estimates the busyness of channels by taking into consideration not only the successfully received packets but also corrupt or broken packets, (vi) implementation of time-based sampling in a prototype traffic sensor device for multi-channel traffic sensing in IEEE 802.11 b/g networks, and (vii) characterization of a campus IEEE 802.11 network environment in a spatio-temporal–spectral fashion using sampled traffic traces collected by traffic sensors.

Design of scalable and efficient multi-radio wireless networks

A proper design of Wireless Mesh Networks (WMNs) is a fundamental task that should be addressed carefully to allow the deployment of scalable and efficient networks. Specifically, choosing strategic locations to optimally place gateways prior to network deployment can alleviate a number of performance/scalability related problems. In this paper, we first, propose a novel clustering based gateway placement algorithm (CBGPA) to effectively select the locations of gateways. Existing solutions for optimal gateway placement using clustering approaches are tree-based and therefore are inherently less reliable since a tree topology uses a smaller number of links. Independently from the tree structure, CBGPA strategically places the gateways to serve as many routers as possible that are within a bounded number of hops. Next, we devise a new multi-objective optimization approach that models WMN topologies from scratch. The three objectives of deployment cost, network throughput and average congestion of gateways are simultaneously optimized using a nature inspired meta-heuristic algorithm coupled with CBGPA. This provides the network operator with a set of bounded-delay trade-off solutions. Comparative simulation studies with different key parameter settings are conducted to show the effectiveness of CBGPA and to evaluate the performance of the proposed model.

Flow admission control for multi-channel multi-radio wireless networks

Providing Quality of Service (QoS) is a major challenge in wireless networks. In this paper we propose a distributed call admission control protocol (DCAC) to do both bandwidth and delay guaranteed call admission for multihop wireless mesh backbone networks, by exploiting the multi-channel multi-radio (mc-mr) feature. We propose a novel routing metric for route setup, and present an efficient distributed algorithm for link reservation that satisfies the required bandwidth and reduces the delay by a local scheduling that minimizes one hop delay. To the best of our knowledge, this is the first distributed protocol that embeds mc-mr feature in Time Division Medium Access (TDMA) to do QoS call admission in wireless backbone networks. Extensive simulation studies show that our protocol significantly improves network performance on supporting QoS sessions compared with some widely used protocols.

A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

Channel assignment in multi-channel multi-radio wireless networks poses a significant challenge due to scarcity of number of channels available in the wireless spectrum. Further, additional care has to be taken to consider the interference characteristics of the nodes in the network especially when nodes are in different collision domains. This work views the problem of channel assignment in multi-channel multi-radio networks with multiple collision domains as a non-cooperative game where the objective of the players is to maximize their individual utility by minimizing its interference. Necessary and sufficient conditions are derived for the channel assignment to be a Nash Equilibrium (NE) and efficiency of the NE is analyzed by deriving the lower bound of the price of anarchy of this game. A new fairness measure in multiple collision domain context is proposed and necessary and sufficient conditions for NE outcomes to be fair are derived. The equilibrium conditions are then applied to solve the channel assignment problem by proposing three algorithms, based on perfect/imperfect information, which rely on explicit communication between the players for arriving at an NE. A no-regret learning algorithm known as Freund and Schapire Informed algorithm, which has an additional advantage of low overhead in terms of information exchange, is proposed and its convergence to the stabilizing outcomes is studied. New performance metrics are proposed and extensive simulations are done using Matlab to obtain a thorough understanding of the performance of these algorithms on various topologies with respect to these metrics. It was observed that the algorithms proposed were able to achieve good convergence to NE resulting in efficient channel assignment strategies.