184 research outputs found

    Robotic Wireless Sensor Networks

    Full text link
    In this chapter, we present a literature survey of an emerging, cutting-edge, and multi-disciplinary field of research at the intersection of Robotics and Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system that aims to achieve certain sensing goals while meeting and maintaining certain communication performance requirements, through cooperative control, learning and adaptation. While both of the component areas, i.e., Robotics and WSN, are very well-known and well-explored, there exist a whole set of new opportunities and research directions at the intersection of these two fields which are relatively or even completely unexplored. One such example would be the use of a set of robotic routers to set up a temporary communication path between a sender and a receiver that uses the controlled mobility to the advantage of packet routing. We find that there exist only a limited number of articles to be directly categorized as RWSN related works whereas there exist a range of articles in the robotics and the WSN literature that are also relevant to this new field of research. To connect the dots, we first identify the core problems and research trends related to RWSN such as connectivity, localization, routing, and robust flow of information. Next, we classify the existing research on RWSN as well as the relevant state-of-the-arts from robotics and WSN community according to the problems and trends identified in the first step. Lastly, we analyze what is missing in the existing literature, and identify topics that require more research attention in the future

    Optimisation of Mobile Communication Networks - OMCO NET

    Get PDF
    The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

    Differential Evolution in Wireless Communications: A Review

    Get PDF
    Differential Evolution (DE) is an evolutionary computational method inspired by the biological processes of evolution and mutation. DE has been applied in numerous scientific fields. The paper presents a literature review of DE and its application in wireless communication. The detailed history, characteristics, strengths, variants and weaknesses of DE were presented. Seven broad areas were identified as different domains of application of DE in wireless communications. It was observed that coverage area maximisation and energy consumption minimisation are the two major areas where DE is applied. Others areas are quality of service, updating mechanism where candidate positions learn from a large diversified search region, security and related field applications. Problems in wireless communications are often modelled as multiobjective optimisation which can easily be tackled by the use of DE or hybrid of DE with other algorithms. Different research areas can be explored and DE will continue to be utilized in this contex

    WSN Configuration using Agent Modeling and Hybrid Intelligent Decision Support System

    Get PDF
    A conceptual multi-agent framework based on a knowledge-based collaborative decision suppor

    Overlay virtualized wireless sensor networks for application in industrial internet of things : a review

    Get PDF
    Abstract: In recent times, Wireless Sensor Networks (WSNs) are broadly applied in the Industrial Internet of Things (IIoT) in order to enhance the productivity and efficiency of existing and prospective manufacturing industries. In particular, an area of interest that concerns the use of WSNs in IIoT is the concept of sensor network virtualization and overlay networks. Both network virtualization and overlay networks are considered contemporary because they provide the capacity to create services and applications at the edge of existing virtual networks without changing the underlying infrastructure. This capability makes both network virtualization and overlay network services highly beneficial, particularly for the dynamic needs of IIoT based applications such as in smart industry applications, smart city, and smart home applications. Consequently, the study of both WSN virtualization and overlay networks has become highly patronized in the literature, leading to the growth and maturity of the research area. In line with this growth, this paper provides a review of the development made thus far concerning virtualized sensor networks, with emphasis on the application of overlay networks in IIoT. Principally, the process of virtualization in WSN is discussed along with its importance in IIoT applications. Different challenges in WSN are also presented along with possible solutions given by the use of virtualized WSNs. Further details are also presented concerning the use of overlay networks as the next step to supporting virtualization in shared sensor networks. Our discussion closes with an exposition of the existing challenges in the use of virtualized WSN for IIoT applications. In general, because overlay networks will be contributory to the future development and advancement of smart industrial and smart city applications, this review may be considered by researchers as a reference point for those particularly interested in the study of this growing field

    Performance analysis of cellular and ad-hoc sensor networks : theory and applications

    Get PDF
    Fifth-generation (5G) mobile networks have three main goals namely enhanced mobile broadband (eMBB), massive machine-type communication (mMTC) and ultra-reliable low latency communication (URLLC). The performance measures associated with these goals are high peak throughput, high spectral efficiency, high capacity and mobility. Moreover, achieving ubiquitous coverage, network and device energy efficiency, ultra-high reliability and ultra-low latency are associated with the performance of 5G mobile networks. One of the challenges that arises during the analysis of these networks is the randomness of the number of nodes and their locations. Randomness is an inherent property of network topologies and could occur due to communication outage, node failure, blockage or mobility of the communication nodes. One of the tools that enable analysis of such random networks is stochastic geometry, including the point process theory. The stochastic geometry and Poisson point theory allow us to build upon tractable models and study the random networks, which is the main focus of this dissertation. In particular, we focus on the performance analysis of cellular heterogeneous networks (HetNet) and ad-hoc sensor networks. We derive closed-forms and easy-to-use expressions, characterising some of the crucial performance metrics of these networks. First, as a HetNet example, we consider a three-tier hybrid network, where microwave (µWave) links are used for the first two tiers and millimetre wave (mmWave) links for the last tier. Since HetNets are considered as interference-limited networks, therefore, we also propose to improve the coverage in HetNet by deploying directional antennas to mitigate interference. Moreover, we propose an optimisation framework for the overall area spectral and energy efficiency concerning the optimal signal-to-interference ratio (SIR) threshold required for µWave and mmWave links. Results indicate that for the µWave tiers (wireless backhaul) the optimal SIR threshold required depends only on the path-loss exponent and that for the mmWave tier depends on the area of line-of-sight (LOS) region. Furthermore, we consider the average rate under coverage and show that the area spectral and energy efficiency are strictly decreasing functions with respect to the SIR threshold. Second, in ad-hoc sensor networks, coverage probability is usually defined according to a fixed detection range ignoring interference and propagation effects. Hence, we define the coverage probability in terms of the probability of detection for localisability. To this end, we provide an analysis for the detection probability and S-Localisability probability, i.e. the probability that at least S sensors may successfully participate in the localisation procedure, according to the propagation effects such as path-loss and small-scale fading. Moreover, we analyse the effect of the number of sensors S on node localisation and compare different range based localisation algorithms
    corecore