402 research outputs found

    A critical analysis of research potential, challenges and future directives in industrial wireless sensor networks

    Get PDF
    In recent years, Industrial Wireless Sensor Networks (IWSNs) have emerged as an important research theme with applications spanning a wide range of industries including automation, monitoring, process control, feedback systems and automotive. Wide scope of IWSNs applications ranging from small production units, large oil and gas industries to nuclear fission control, enables a fast-paced research in this field. Though IWSNs offer advantages of low cost, flexibility, scalability, self-healing, easy deployment and reformation, yet they pose certain limitations on available potential and introduce challenges on multiple fronts due to their susceptibility to highly complex and uncertain industrial environments. In this paper a detailed discussion on design objectives, challenges and solutions, for IWSNs, are presented. A careful evaluation of industrial systems, deadlines and possible hazards in industrial atmosphere are discussed. The paper also presents a thorough review of the existing standards and industrial protocols and gives a critical evaluation of potential of these standards and protocols along with a detailed discussion on available hardware platforms, specific industrial energy harvesting techniques and their capabilities. The paper lists main service providers for IWSNs solutions and gives insight of future trends and research gaps in the field of IWSNs

    Autonomous optimization of UWB link access

    Get PDF
    We present a novel approach for interference management in low data rate IR-UWB networks that enables concurrent transmissions at full power while allows each source to independently adapt its pulse rate (transmitted pulses per second) to mitigate multi-user interference. The work is motivated by the fact that the distributed adaptation of IR-UWB pulse rate has not been sufficiently addressed in the literature before. Existing approaches rely on the presence of a central authority or assume a definite receiver technique. Our approach enables users to share the communication medium in an efficient way compatible with individual QoS requirements and it is independent of any particular modulation scheme or receiver technique

    Clock synchronisation for UWB and DECT communication networks

    Get PDF
    Synchronisation deals with the distribution of time and/or frequency across a network of nodes dispersed in an area, in order to align their clocks with respect to time and/or frequency. It remains an important requirement in telecommunication networks, especially in Time Division Duplexing (TDD) systems such as Ultra Wideband (UWB) and Digital Enhanced Cordless Telecommunications (DECT) systems. This thesis explores three di erent research areas related to clock synchronisation in communication networks; namely algorithm development and implementation, managing Packet Delay Variation (PDV), and coping with the failure of a master node. The first area proposes a higher-layer synchronisation algorithm in order to meet the specific requirements of a UWB network that is based on the European Computer Manufacturers Association (ECMA) standard. At up to 480 Mbps data rate, UWB is an attractive technology for multimedia streaming. Higher-layer synchronisation is needed in order to facilitate synchronised playback at the receivers and prevent distortion, but no algorithm is de ned in the ECMA-368 standard. In this research area, a higher-layer synchronisation algorithm is developed for an ECMA-368 UWB network. Network simulations and FPGA implementation are used to show that the new algorithm satis es the requirements of the network. The next research area looks at how PDV can be managed when Precision Time Protocol (PTP) is implemented in an existing Ethernet network. Existing literature indicates that the performance of a PDV ltering algorithm usually depends on the delay pro le of the network in which it is applied. In this research area, a new sample-mode PDV filter is proposed which is independent of the shape of the delay profile. Numerical simulations show that the sample-mode filtering algorithm is able to match or out-perform the existing sample minimum, mean, and maximum filters, at differentlevels of network load. Finally, the thesis considers the problem of dealing with master failures in a PTP network for a DECT audio application. It describes the existing master redundancy techniques and shows why they are unsuitable for the specific application. Then a new alternate master cluster technique is proposed along with an alternative BMCA to suit the application under consideration. Network simulations are used to show how this technique leads to a reduction in the total time to recover from a master failure

    Design and Analysis of Medium Access Control Protocols for Broadband Wireless Networks

    Get PDF
    The next-generation wireless networks are expected to integrate diverse network architectures and various wireless access technologies to provide a robust solution for ubiquitous broadband wireless access, such as wireless local area networks (WLANs), Ultra-Wideband (UWB), and millimeter-wave (mmWave) based wireless personal area networks (WPANs), etc. To enhance the spectral efficiency and link reliability, smart antenna systems have been proposed as a promising candidate for future broadband access networks. To effectively exploit the increased capabilities of the emerging wireless networks, the different network characteristics and the underlying physical layer features need to be considered in the medium access control (MAC) design, which plays a critical role in providing efficient and fair resource sharing among multiple users. In this thesis, we comprehensively investigate the MAC design in both single- and multi-hop broadband wireless networks, with and without infrastructure support. We first develop mathematical models to identify the performance bottlenecks and constraints in the design and operation of existing MAC. We then use a cross-layer approach to mitigate the identified bottleneck problems. Finally, by evaluating the performance of the proposed protocols with analytical models and extensive simulations, we determine the optimal protocol parameters to maximize the network performance. In specific, a generic analytical framework is developed for capacity study of an IEEE 802.11 WLAN in support of non-persistent asymmetric traffic flows. The analysis can be applied for effective admission control to guarantee the quality of service (QoS) performance of multimedia applications. As the access point (AP) becomes the bottleneck in an infrastructure based WLAN, we explore the multiple-input multiple-output (MIMO) capability in the future IEEE 802.11n WLANs and propose a MIMO-aware multi-user (MU) MAC. By exploiting the multi-user degree of freedom in a MIMO system to allow the AP to communicate with multiple users in the downlink simultaneously, the proposed MU MAC can minimize the AP-bottleneck effect and significantly improve the network capacity. Other enhanced MAC mechanisms, e.g., frame aggregation and bidirectional transmissions, are also studied. Furthermore, different from a narrowband system where simultaneous transmissions by nearby neighbors collide with each other, wideband system can support multiple concurrent transmissions if the multi-user interference can be properly managed. Taking advantage of the salient features of UWB and mmWave communications, we propose an exclusive region (ER) based MAC protocol to exploit the spatial multiplexing gain of centralized UWB and mmWave based wireless networks. Moreover, instead of studying the asymptotic capacity bounds of arbitrary networks which may be too loose to be useful in realistic networks, we derive the expected capacity or transport capacity of UWB and mmWave based networks with random topology. The analysis reveals the main factors affecting the network (transport) capacity, and how to determine the best protocol parameters to maximize the network capacity. In addition, due to limited transmission range, multi-hop relay is necessary to extend the communication coverage of UWB networks. A simple, scalable, and distributed UWB MAC protocol is crucial for efficiently utilizing the large bandwidth of UWB channels and enabling numerous new applications cost-effectively. To address this issue, we further design a distributed asynchronous ER based MAC for multi-hop UWB networks and derive the optimal ER size towards the maximum network throughput. The proposed MAC can significantly improve both network throughput and fairness performance, while the throughput and fairness are usually treated as a tradeoff in other MAC protocols

    Design, Modeling, and Analysis for MAC Protocols in Ultra-wideband Networks

    Get PDF
    Ultra-wideband (UWB) is an appealing transmission technology for short-range, bandwidth demanded wireless communications. With the data rate of several hundred megabits per second, UWB demonstrates great potential in supporting multimedia streams such as high-definition television (HDTV), voice over Internet Protocol (VoIP), and console gaming in office or home networks, known as the wireless personal area network (WPAN). While vast research effort has been made on the physical layer issues of UWB, the corresponding medium access control (MAC) protocols that exploit UWB technology have not been well developed. Given an extremely wide bandwidth of UWB, a fundamental problem on how to manage multiple users to efficiently utilize the bandwidth is a MAC design issue. Without explicitly considering the physical properties of UWB, existing MAC protocols are not optimized for UWB-based networks. In addition, the limited processing capability of UWB devices poses challenges to the design of low-complexity MAC protocols. In this thesis, we comprehensively investigate the MAC protocols for UWB networks. The objective is to link the physical characteristics of UWB with the MAC protocols to fully exploit its advantage. We consider two themes: centralized and distributed UWB networks. For centralized networks, the most critical issue surrounding the MAC protocol is the resource allocation with fairness and quality of service (QoS) provisioning. We address this issue by breaking down into two scenarios: homogeneous and heterogeneous network configurations. In the homogeneous case, users have the same bandwidth requirement, and the objective of resource allocation is to maximize the network throughput. In the heterogeneous case, users have different bandwidth requirements, and the objective of resource allocation is to provide differentiated services. For both design objectives, the optimal scheduling problem is NP-hard. Our contributions lie in the development of low-complexity scheduling algorithms that fully exploit the characteristics of UWB. For distributed networks, the MAC becomes node-based problems, rather than link-based problems as in centralized networks. Each node either contends for channel access or reserves transmission opportunity through negotiation. We investigate two representative protocols that have been adopted in the WiMedia specification for future UWB-based WPANs. One is a contention-based protocol called prioritized channel access (PCA), which employs the same mechanisms as the enhanced distributed channel access (EDCA) in IEEE 802.11e for providing differentiated services. The other is a reservation-based protocol called distributed reservation protocol (DRP), which allows time slots to be reserved in a distributed manner. Our goal is to identify the capabilities of these two protocols in supporting multimedia applications for UWB networks. To achieve this, we develop analytical models and conduct detailed analysis for respective protocols. The proposed analytical models have several merits. They are accurate and provide close-form expressions with low computational effort. Through a cross-layer approach, our analytical models can capture the near-realistic protocol behaviors, thus useful insights into the protocol can be obtained to improve or fine-tune the protocol operations. The proposed models can also be readily extended to incorporate more sophisticated considerations, which should benefit future UWB network design

    Optimization of positioning capabilities in wireless sensor networks : from power efficiency to medium access

    Get PDF
    In Wireless Sensor Networks (WSN), the ability of sensor nodes to know its position is an enabler for a wide variety of applications for monitoring, control, and automation. Often, sensor data is meaningful only if its position can be determined. Many WSN are deployed indoors or in areas where Global Navigation Satellite System (GNSS) signal coverage is not available, and thus GNSS positioning cannot be guaranteed. In these scenarios, WSN may be relied upon to achieve a satisfactory degree of positioning accuracy. Typically, batteries power sensor nodes in WSN. These batteries are costly to replace. Therefore, power consumption is an important aspect, being performance and lifetime of WSN strongly relying on the ability to reduce it. It is crucial to design effective strategies to maximize battery lifetime. Optimization of power consumption can be made at different layers. For example, at the physical layer, power control and resource optimization may play an important role, as well as at higher layers through network topology and MAC protocols. The objective of this Thesis is to study the optimization of resources in WSN that are employed for positioning purposes, with the ultimate goal being the minimization of power consumption. We focus on anchor-based positioning, where a subset of the WSN nodes know their location (anchors) and send ranging signals to nodes with unknown position (targets) to assist them in estimating it through distance-related measurements. Two well known of such measurements are received signal strength (RSS) and time of arrival (TOA), in which this Thesis focuses. In order to minimize power consumption while providing a certain quality of positioning service, in this dissertation we research on the problems of power control and node selection. Aiming at a distributed implementation of the proposed techniques, we resort to the tools of non-cooperative game theory. First, transmit power allocation is addressed for RSS based ranging. Using game theory formulation, we develop a potential game leading to an iterated best response algorithm with sure convergence. As a performance metric, we introduce the geometric dilution of precision (GDOP), which is shown to help achieving a suitable geometry of the selected anchor nodes. The proposed scheme and relative distributed algorithms provide good equilibrium performance in both static and dynamic scenarios. Moreover, we present a distributed, low complexity implementation and analyze it in terms of computational complexity. Results show that performance close to that of exhaustive search is possible. We then address the transmit power allocation problem for TOA based ranging, also resorting to a game theoretic formulation. In this setup, and also considering GDOP as performance metric, a supermodular game formulation is proposed, along with a distributed algorithm with guaranteed convergence to a unique solution, based on iterated best response. We analyze the proposed algorithm in terms of the price of anarchy (PoA), that is, compared to a centralized optimum solution, and shown to have a moderate performance loss. Finally, this dissertation addresses the effect of different MAC protocols and topologies in the positioning performance. In this direction, we study the performance of mesh and cluster-tree topologies defined in WSN standards. Different topologies place different constraints in network connectivity, having a substantial impact on the performance of positioning algorithms. While mesh topology allows high connectivity with large energy consumption, cluster-tree topologies are more energy efficient but suffer from reduced connectivity and poor positioning performance. In order to improve the performance of cluster-tree topologies, we propose a cluster formation algorithm. It significantly improves connectivity with anchor nodes, achieving vastly improved positioning performance.En les xarxes de sensors sense fils (WSN), l'habilitat dels nodes sensors per conèixer la seva posició facilita una gran varietat d'aplicacions per la monitorització, el control i l'automatització. Així, les dades que proporciona un sensor tenen sentit només si la posició pot ésser determinada. Moltes WSN són desplegades en interiors o en àrees on la senyal de sistemes globals de navegació per satèl.lit (GNSS) no té prou cobertura, i per tant, el posicionament basat en GNSS no pot ésser garantitzat. En aquests escenaris, les WSN poden proporcionar una bona precisió en posicionament. Normalment, en WSN els nodes són alimentats amb bateries. Aquestes bateries són difícils de reemplaçar. Per tant, el consum de potència és un aspecte important i és crucial dissenyar estratègies efectives per maximitzar el temps de vida de la bateria. L'optimització del consum de potència pot ser fet a diferents capes del protocol. Per exemple, en la capa física, el control de potència i l'optimització dels recursos juguen un rol important, igualment que la topologia de xarxa i els protocols MAC en les capes més altes. L'objectiu d'aquesta tesi és estudiar l¿optimització de recursos en WSN que s'utilitzen per fer posicionament, amb el propòsit de minimitzar el consum de potència. Ens focalitzem en el posicionament basat en àncora, en el qual un conjunt de nodes coneixen la seva localització (nodes àncora) i envien missatges als nodes que no saben la seva posició per ajudar-los a estimar les seves coordenades amb mesures de distància. Dues classes de mesures són la potència de la senyal rebuda (RSS) i el temps d'arribada (TOA) en les quals aquesta tesi està focalitzada. Per minimitzar el consum de potència mentre que es proporciona suficient qualitat en el posicionament, en aquesta tesi estudiem els problemes de control de potència i selecció de nodes. Tenint en compte una implementació distribuïda de les tècniques proposades, utilitzem eïnes de teoria de jocs no cooperatius. Primer, l'assignació de potència transmesa és abordada pel càlcul de la distància amb RSS. Utilitzant la teoria de jocs, desenvolupem un joc potencial que convergeix amb un algoritme iteratiu basat en millor resposta (best response). Com a mètrica d'error, introduïm la dilució de la precisió geomètrica (GDOP) que mostra quant d'apropiada és la geometria dels nodes àncora seleccionats. L'esquema proposat i els algoritmes distribuïts proporcionen una bona resolució de l'equilibri en l'escenari estàtic i dinàmic. Altrament, presentem una implementació distribuïda i analitzem la seva complexitat computacional. Els resultats obtinguts són similars als obtinguts amb un algoritme de cerca exhaustiva. El problema d'assignació de la potència transmesa en el càlcul de la distància basat en TOA, també és tractat amb teoria de jocs. En aquest cas, considerant el GDOP com a mètrica d'error, proposem un joc supermodular juntament amb un algoritme distribuït basat en millor resposta amb convergència garantida cap a una única solució. Analitzem la solució proposada amb el preu de l'anarquia (PoA), és a dir, es compara la nostra solució amb una solució òptima centralitzada mostrant que les pèrdues són moderades. Finalment, aquesta tesi tracta l'efecte que causen diferents protocols MAC i topologies en el posicionament. En aquesta direcció, estudiem les topologies de malla i arbre formant clusters (cluster-tree) que estan definides als estàndards de les WSN. La diferència entre les topologies crea diferents restriccions en la connectivitat de la xarxa, afectant els resultats de posicionament. La topologia de malla permet una elevada connectivitat entre els nodes amb gran consum d'energia, mentre que les topologies d'arbre són més energèticament eficients però amb baixa connectivitat entre els nodes i baix rendiment pel posicionament. Per millorar la qualitat del posicionament en les topologies d'arbre, proposem un algoritme de formació de clústers.Postprint (published version
    corecore