2,146 research outputs found
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
Demand based State Aware Channel Reconfiguration Algorithm for Multi-Channel Multi-Radio Wireless Mesh Networks
Efficient utilization of Multi Channel - Multi Radio (MC-MR) Wireless Mesh Networks (WMNs) can be achieved only by intelligent Channel Assignment (CA) and Link Scheduling (LS). Due to the dynamic nature of traffic demand in WMNs, the CA has to be reconfigured whenever traffic demand changes, in order to achieve maximum throughput in the network. The reconfiguration of CA requires channel switching which leads to disruption of ongoing traffic in the network. The existing CA algorithms for MC-MR WMNs in the literature do not consider the channel reconfiguration overhead that occurs due to this channel switching. In this paper, we propose a novel reconfiguration framework that considers both network throughput and reconfiguration overhead to quantitatively evaluate a reconfiguration algorithm. Based on the reconfiguration framework, we propose an online heuristic algorithm for CA called Demand based State Aware channel Reconfiguration Algorithm (DeSARA) that finds the CA for the current traffic demand by considering the existing CA of the network to minimize the reconfiguration overhead. We show through simulations that DeSARA outperforms both static CA and fully dynamic CA in terms of total achieved throughput
Near Optimal Channel Assignment for Interference Mitigation in Wireless Mesh Networks
In multi-radio multi-channel (MRMC) WMNs, interference alleviation is
affected through several network design techniques e.g., channel assignment
(CA), link scheduling, routing etc., intelligent CA schemes being the most
effective tool for interference mitigation. CA in WMNs is an NP-Hard problem,
and makes optimality a desired yet elusive goal in real-time deployments which
are characterized by fast transmission and switching times and minimal
end-to-end latency. The trade-off between optimal performance and minimal
response times is often achieved through CA schemes that employ heuristics to
propose efficient solutions. WMN configuration and physical layout are also
crucial factors which decide network performance, and it has been demonstrated
in numerous research works that rectangular/square grid WMNs outperform random
or unplanned WMN deployments in terms of network capacity, latency, and network
resilience. In this work, we propose a smart heuristic approach to devise a
near-optimal CA algorithm for grid WMNs (NOCAG). We demonstrate the efficacy of
NOCAG by evaluating its performance against the minimal-interference CA
generated through a rudimentary brute-force technique (BFCA), for the same WMN
configuration. We assess its ability to mitigate interference both,
theoretically (through interference estimation metrics) and experimentally (by
running rigorous simulations in NS-3). We demonstrate that the performance of
NOCAG is almost as good as the BFCA, at a minimal computational overhead of
O(n) compared to the exponential of BFCA
Recommended from our members
Performance enhancements for single hop and multi-hop meshed high data rate wireless personal area networks
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The High Data Rate (HDR) Wireless Personal Area Networks (WPANs) typically have a limited operating range and are intended to support demanding multi-media applications at high data rates. In order to extend the communication range, HDR WPANs can operate in a wireless mesh configuration (i.e. enable multiple WPAN clusters) to communicate in a multi-hop fashion. HDR WPANs face several research challenges and some of the open key issues are limited capacity, optimum resource allocation to requesting devices and maintaining Quality of Service (QoS) for real time multimedia flows. Although, there have been some scheduling algorithms proposed for HDR WPANs, the main objective is to maintain the QoS in most cases whereas efficient and fair utilization of network capacity is still largely open for research. This thesis mainly intends to resolve the issues related to capacity of HDR WPANs such as admission control, fair allocation of Channel Time Allocations (CTAs), improvement in capacity through transmission power control, and efficient utilization of time by each flow. A technique which re-orders the time slots to reduce queuing delay for meshed WPANs is also proposed and evaluated.
The first contribution aims to improve peer-to-peer connectivity in case of two or more independent piconet devices by proposing an inter-PAN communication framework that is augmented by an admission control strategy to handle the cases when the superframe capacity is congested. The queued devices are prioritized by proposing a parameter called the Rejection Ratio. The second contribution consists of a resource allocation framework for meshed WPANs. The main objectives are to reduce the control traffic due to high volume of channel time reservation requests and introduce an element of fairness in the channel time allocated to requesting devices. The objectives are achieved by using traffic prediction techniques and an estimated backoff procedure to reduce control traffic, and define different policies based on offered traffic for fair allocation of channel time. The centralized scheme uses traffic prediction techniques to use the proposed concept of bulk reservations. Based on the bulk reservations and resource allocation policies, the overall overhead is reduced while an element of fairness is shown to be maintained for certain scenarios. In the third contribution, the concepts of Time Efficiency and CTA switching are introduced to improve communication efficiency and utilization of superframe capacity in meshed WPANs. Two metrics known as Switched Time Slot (STS) and Switched Time Slot with Re-ordering (STS-R) are proposed which aim to achieve the purpose. The final contribution proposes and evaluates a technique called CTA overlappnig to improve capacity in single hop and meshed WPANs using tramission power control. Extensive simulation studies are performed to analyze and to evaluate the proposed techniques. Simulation results demonstrate significant improvements in meshed WPANs performance in terms of capacity utilization, improvement in fairness index for CTA allocation by upto 62% in some cases, reduction in control traffic overhead by upto 70% and reduction in delay for real time flows by more than 10% in some cases
- …