Multi-radio Multi-channel Wireless Networks Research Articles

Retraction Note: Stealthy attack detection in multi-channel multi-radio wireless networks

Retraction Note: Stealthy attack detection in multi-channel multi-radio wireless networks

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.

RETRACTED ARTICLE: 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.

Delay constraint energy efficient broadcasting in heterogeneous MRMC wireless networks

Energy efficient broadcasting is a critical problem in Multi-Radio Multi-Channel (MRMC) wireless networks and has captured tremendous attention in the past decades. Most existing works try to minimize energy consumption in broadcast by simply minimizing the number of transmissions. However, radios and channels in MRMC wireless networks may have different propagation characteristics, e.g., communication range and energy consumption. Since wireless radios with different communication ranges have different energy consumptions, it is not always true that minimizing the number of transmissions can minimize the energy consumption. Meanwhile, more and more applications require end-to-end delay guarantee to provide Quality of Service (QoS), e.g., wireless video and online games. It is essential to satisfy the delay constraint when broadcasting in MRMC wireless networks as well.In this paper, we investigate the Delay Constraint Minimum Energy Broadcasting (DCMEB) problem in heterogeneous MRMC wireless networks. Especially, we consider heterogeneous radios and channels with different communication ranges and energy consumptions. We present an Energy Efficient Broadcasting (EEB) strategy in this work. EEB utilizes Multi-Dimension Conflict Graph (MDCG) to capture the conflicts among all possible forwarding nodes and channels, and then calculates the schedule to maximize the number of concurrent transmissions in each time slot in a cost effective way without violating the delay constraint. Our evaluation results show that EEB outperforms the state-of-the-art methods in terms of broadcasting energy cost under delay constraint in heterogeneous MRMC networks.

Distributed Scheduling and Delay-Aware Routing in Multihop MR-MC Wireless Networks

In multiradio multichannel (MR-MC) networks with significantly expanded network resource space, many existing scheduling/routing algorithms rely on a link-based network model and apply different heuristics in algorithm design to achieve/approximate throughput optimality. In this paper, using a tuple-based multidimensional conflict graph model, we establish a cross-layer framework, which facilitates systematically studying distributed scheduling and routing in multihop multipath MR-MC networks. In this framework, each tuple link is installed with a routing controller, which feeds controlled amounts of data to the tuple-link output queues for scheduling and transmission. We rigorously prove that, under a set of certain conditions, the network is queue stable in the mean sense under the distributed maximal scheduling policy. Based on Lyapunov optimization, we further propose a distributed delay-aware multipath routing method, which aims at minimizing the end-to-end delay of each commodity flow. Extensive simulation results demonstrate that the proposed joint scheduling/routing algorithm outperforms existing link-based single-path and multipath algorithms and tuple-based cross-layer control algorithm.

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.

Random Node Failures and Wireless Networks Connectivity: Theoretical Analysis

Multi-radio multi-channel wireless networks (M 2WNs) have been studied intensively over the past decade with focusing on traffic management functionalities such as channel-to-interface assignment, traffic routing and scheduling. These developed solutions always assumed continuous normal operation of all network components while failing to take into considering the failure-prone nature of wireless networks. This article analyzes the effects of node failure on the ability of network nodes to maintain their connectivity. More precisely, we present a tight upper bound on the node failure probabilities needed to maintain full network connectivity on the one hand. On the other hand, a lower bound, at which the system loses connectivity, is also derived. We show that these bounds are dependent only on the nodes' geometric distribution and density. We then verify these theoretical results against those obtained via experimentation.

A Systematic Study of Maximal Scheduling Algorithms in Multiradio Multichannel Wireless Networks

The greedy maximal scheduling (GMS) and maximal scheduling (MS) algorithms are well-known low-complexity scheduling policies with guaranteed capacity region in the context of single-radio single-channel (SR-SC) wireless networks. However, how to design maximal scheduling algorithms for multiradio multichannel (MR-MC) wireless networks and the associated capacity analysis are not well understood yet. In this paper, we develop a new model by transforming an MR-MC network node to multiple node-radio-channel (NRC) tuples. Such a framework facilitates the derivation of a tuple-based back-pressure algorithm for throughput-optimal control in MR-MC wireless networks and enables the tuple-based GMS and MS scheduling as low-complexity approximation algorithms with guaranteed performance. An important existing work on GMS and MS for MR-MC networks is that of Lin and Rasool (IEEE/ACM Trans. Networking, vol. 17, no. 6, 1874--1887, Dec. 2009), where link-based algorithms are developed. Compared to the link-based algorithms, the tuple-based modeling has significant advantages in enabling a fully decomposable cross-layer control framework. Another theoretical contribution in this paper is that we, for the first time, extend the local-pooling factor analysis to study the capacity efficiency ratio of the tuple-based GMS in MR-MC networks and obtain a lower bound that is much tighter than those known in the literature. Moreover, we analyze the communications and computation overhead in implementing the distributed MS algorithm and present simulation results to demonstrate the performance of the tuple-based maximal scheduling algorithms.

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.

Routing Metrics for Minimizing End-to-End Delay in Multiradio Multichannel Wireless Networks

This paper studies how to select a path with the minimum expected end-to-end delay (EED) in a multiradio multichannel (MR-MC) wireless mesh network. While the existing studies mainly focus on the packet transmission delay due to medium access control (MAC), our new EED metric further takes into account the queuing delay at the MAC layer. In particular, in the MR-MC context, we develop a generic iterative approach to compute the multiradio achievable bandwidth (MRAB) for a path, taking the impact of inter-/intraflow interference and space/channel diversity into consideration. The MRAB is then combined with the EED to form the metric weighted end-to-end delay (WEED). As a byproduct of MRAB, a channel diversity coefficient is defined to quantitatively represent the channel diversity for a given path. Moreover, we design and implement a distributed WEED-based routing protocol for MR-MC wireless networks by extending the well-known AODV protocol. Extensive simulation results are presented to demonstrate the performance of EED/WEED-based routing, with comparison to some existing well-known routing metrics.

Channel assignment in heterogeneous multi-radio multi-channel wireless networks: A game theoretic approach

Channel assignment is a challenging issue for multi-radio multi-channel wireless networks, especially in a competing environment. This paper investigates channel assignment for selfish nodes in a heterogeneous scenario, in which nodes may have different QoS requirements and thus compete for different channels with unequal bandwidth. The interaction among nodes is formulated as a non-cooperative Multi-radio Channel Assignment Game (MCAG), where Nash Equilibrium (NE) corresponds to a stable channel assignment outcome from which no individual node has the incentive to deviate. The NEs in MCAG are characterized in this paper. Since multiple NEs may exist in this game, it is natural to choose the NE that maximizes the network utility, i.e., the sum of node utilities. It is shown that the optimal NE outcome can be derived by solving an integer non-linear programming problem. Based on some observations on the radio number distribution of NE, we propose a two-stage optimization algorithm to achieve an optimal channel assignment. Finally, computer simulations validate the effectiveness of the proposed algorithm.

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

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.

Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes

We consider the broadcasting problem in multi-radio multi-channel ad hoc networks. The objective is to minimize the total cost of the network-wide broadcast, where the cost can be of any form that is summable over all the transmissions (e.g., the transmission and reception energy, the price for accessing a specific channel). Our technical approach is based on a simplicial complex model that allows us to capture the broadcast nature of the wireless medium and the heterogeneity across radios and channels. Specifically, we show that broadcasting in multi-radio multi-channel ad hoc networks can be formulated as a minimum spanning problem in simplicial complexes. We establish the NP-completeness of the minimum spanning problem and propose two approximation algorithms with order-optimal performance guarantee. The first approximation algorithm converts the minimum spanning problem in simplical complexes to a minimum connected set cover (MCSC) problem. The second algorithm converts it to a node-weighted Steiner tree problem under the classic graph model. These two algorithms offer tradeoffs between performance and time-complexity. In a broader context, this work appears to be the first that studies the minimum spanning problem in simplicial complexes and weighted MCSC problem.

A theoretical framework for optimal cooperative networking in multiradio multichannel wireless networks

A wide range of next generation wireless networks are based on the multiradio multichannel (MR-MC) network model. A full exploration of the MR-MC wireless network capacity incurs challenging cooperative networking issues including transmission cooperation, resource allocation cooperation, and cross-layer protocol cooperation. In this article, rather than focus on protocol designs for specific cooperative networking issues, we present a generic theoretical framework that could guide the protocol or algorithm development to approach the maximum network capacity. Based on our multidimensional conflict graph (MDCG) tool, we could achieve a cross-layer linear programming framework to study the optimal cooperative networking in two complementary aspects: optimal network dimensioning and throughput-optimal control. While certain NP-hard computing issues hindered the MR-MC network optimization for a long time, the MDCG-based framework can readily generate simple polynomial and distributed algorithms with guaranteed capacity region.

Robust Topology Engineering in Multiradio Multichannel Wireless Networks

Topology engineering concerns with the problem of automatic determination of physical layer parameters to form a network with desired properties. In this paper, we investigate the joint power control, channel assignment, and radio interface selection for robust provisioning of link bandwidth in infrastructure multiradio multichannel wireless networks in presence of channel variability and external interference. To characterize the logical relationship between spatial contention constraints and transmit power, we formulate the joint power control and radio-channel assignment as a generalized disjunctive programming problem. The generalized Benders decomposition technique is applied for decomposing the radio-channel assignment (combinatorial constraints) and network resource allocation (continuous constraints) so that the problem can be solved efficiently. The proposed algorithm is guaranteed to converge to the optimal solution within a finite number of iterations. We have evaluated our scheme using traces collected from two wireless testbeds and simulation studies in Qualnet. Experiments show that the proposed algorithm is superior to existing schemes in providing larger interference margin, and reducing outage and packet loss probabilities.

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.