3,655 research outputs found

    Interference aware cluster-based joint channel assignment scheme in multi-channel multi-radio wireless mesh networks

    Get PDF
    Wireless Mesh Networks (WMNs) are emerging as a promising solution for robust and ubiquitous broadband Internet access in both urban and rural areas. WMNs extend the coverage and capacity of traditionalWi-Fi islands through multi-hop,multichannel and multi-radio wireless connectivity. The foremost challenge, encountered in deploying a WMN, is the interference present between the co-located links, which limits the throughput of the network. Thus, the objective of this research is to improve the throughput, fairness and channel utilization of WMNs by mitigating the interference using optimized spatial re-usability of joint channels available in the 2.4 GHz Industrial, Scientific, and Medical (ISM) band. Interference is quantified depending on the relative location of the interfering links. Further, the Interference aware Non-Overlapping Channel assignment (I-NOC) model is developed to mitigate the interference by utilizing optimized spectral re-usability of Non-Overlapping Channels (NOCs). NOCs are limited in number. Therefore, I-NOC model is extended by using joint channels available in the free spectrum, and termed as Interference aware Joint Channel Assignment (I-JCA) model. Normally, joint channel assignment is considered harmful due to adjacent channel interference. However, by systematic optimization, the I-JCA model has utilized the spectral re-usability of joint channels. I-JCA model cannot be solved at the time of network initialization because it requires prior knowledge of the geometric locations of the nodes. Thus, Interference aware Cluster-based Joint Channel Assignment Scheme (I-CJCAS) is developed. I-CJCAS partitions the network topology into tangential non-overlapping clusters, with each cluster consisting of intra- and inter-cluster links. I-CJCAS mitigates the interference effect of a cluster’s intra-cluster links by assigning a distinct common channel within its interference domain. On the other hand, the inter-cluster links are assigned to a channel based on the transmitter of the inter-cluster link. I-CJCAS is benchmarked with Hyacinth, Breadth-First Search Channel Assignment (BFS-CA) and Cluster- Based Channel Assignment Scheme (CCAS) in terms of throughput, fairness, channel utilization, and impact of traffic load in single-hop and multi-hop flows. Results show that I-CJCAS has outperformed the benchmark schemes at least by a factor of 15 percent. As a part of future work, I-CJCAS can be extended to incorporate dynamic traffic load, topology control, and external interference from co-located wireless network deployments

    Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network

    Full text link
    In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mechanisms. Wireless mesh networks usually intensively deploy mesh nodes to deal with the problem of dead spot communication. However, the higher density of nodes deployed, the higher radio interference occurred. This causes significant degradation of system performance. In this paper, we first convert network problems into geometry problems in graph theory, and then solve the interference problem by geometric algorithms. We first define line intersection in a graph to reflect radio interference problem in a wireless mesh network. We then use plan sweep algorithm to find intersection lines, if any; employ Voronoi diagram algorithm to delimit the regions among nodes; use Delaunay Triangulation algorithm to reconstruct the graph in order to minimize the interference among nodes. Finally, we use standard deviation to prune off those longer links (higher interference links) to have a further enhancement. The proposed hybrid solution is proved to be able to significantly reduce interference in a wireless mesh network in O(n log n) time complexity.Comment: 24 Pages, JGraph-Hoc Journal 201

    Distributed Clustering in Cognitive Radio Ad Hoc Networks Using Soft-Constraint Affinity Propagation

    Get PDF
    Absence of network infrastructure and heterogeneous spectrum availability in cognitive radio ad hoc networks (CRAHNs) necessitate the self-organization of cognitive radio users (CRs) for efficient spectrum coordination. The cluster-based structure is known to be effective in both guaranteeing system performance and reducing communication overhead in variable network environment. In this paper, we propose a distributed clustering algorithm based on soft-constraint affinity propagation message passing model (DCSCAP). Without dependence on predefined common control channel (CCC), DCSCAP relies on the distributed message passing among CRs through their available channels, making the algorithm applicable for large scale networks. Different from original soft-constraint affinity propagation algorithm, the maximal iterations of message passing is controlled to a relatively small number to accommodate to the dynamic environment of CRAHNs. Based on the accumulated evidence for clustering from the message passing process, clusters are formed with the objective of grouping the CRs with similar spectrum availability into smaller number of clusters while guaranteeing at least one CCC in each cluster. Extensive simulation results demonstrate the preference of DCSCAP compared with existing algorithms in both efficiency and robustness of the clusters

    Wireless industrial monitoring and control networks: the journey so far and the road ahead

    Get PDF
    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
    • …
    corecore