936 research outputs found

    Connectivity, Coverage and Placement in Wireless Sensor Networks

    Get PDF
    Wireless communication between sensors allows the formation of flexible sensor networks, which can be deployed rapidly over wide or inaccessible areas. However, the need to gather data from all sensors in the network imposes constraints on the distances between sensors. This survey describes the state of the art in techniques for determining the minimum density and optimal locations of relay nodes and ordinary sensors to ensure connectivity, subject to various degrees of uncertainty in the locations of the nodes

    A survey of network lifetime maximization techniques in wireless sensor networks

    No full text
    Emerging technologies, such as the Internet of things, smart applications, smart grids and machine-to-machine networks stimulate the deployment of autonomous, selfconfiguring, large-scale wireless sensor networks (WSNs). Efficient energy utilization is crucially important in order to maintain a fully operational network for the longest period of time possible. Therefore, network lifetime (NL) maximization techniques have attracted a lot of research attention owing to their importance in terms of extending the flawless operation of battery-constrained WSNs. In this paper, we review the recent developments in WSNs, including their applications, design constraints and lifetime estimation models. Commencing with the portrayal of rich variety definitions of NL design objective used for WSNs, the family of NL maximization techniques is introduced and some design guidelines with examples are provided to show the potential improvements of the different design criteri

    Design and Evaluation of Distributed Algorithms for Placement of Network Services

    Get PDF
    Network services play an important role in the Internet today. They serve as data caches for websites, servers for multiplayer games and relay nodes for Voice over IP: VoIP) conversations. While much research has focused on the design of such services, little attention has been focused on their actual placement. This placement can impact the quality of the service, especially if low latency is a requirement. These services can be located on nodes in the network itself, making these nodes supernodes. Typically supernodes are selected in either a proprietary or ad hoc fashion, where a study of this placement is either unavailable or unnecessary. Previous research dealt with the only pieces of the problem, such as finding the location of caches for a static topology, or selecting better routes for relays in VoIP. However, a comprehensive solution is needed for dynamic applications such as multiplayer games or P2P VoIP services. These applications adapt quickly and need solutions based on the immediate demands of the network. In this thesis we develop distributed algorithms to assign nodes the role of a supernode. This research first builds off of prior work by modifying an existing assignment algorithm and implementing it in a distributed system called Supernode Placement in Overlay Topologies: SPOT). New algorithms are developed to assign nodes the supernode role. These algorithms are then evaluated in SPOT to demonstrate improved SN assignment and scalability. Through a series of simulation, emulation, and experimentation insight is gained into the critical issues associated with allocating resources to perform the role of supernodes. Our contributions include distributed algorithms to assign nodes as supernodes, an open source fully functional distributed supernode allocation system, an evaluation of the system in diverse networking environments, and a simulator called SPOTsim which demonstrates the scalability of the system to thousands of nodes. An example of an application deploying such a system is also presented along with the empirical results

    Wireless Network Design and Optimization: From Social Awareness to Security

    Get PDF
    abstract: A principal goal of this dissertation is to study wireless network design and optimization with the focus on two perspectives: 1) socially-aware mobile networking and computing; 2) security and privacy in wireless networking. Under this common theme, this dissertation can be broadly organized into three parts. The first part studies socially-aware mobile networking and computing. First, it studies random access control and power control under a social group utility maximization (SGUM) framework. The socially-aware Nash equilibria (SNEs) are derived and analyzed. Then, it studies mobile crowdsensing under an incentive mechanism that exploits social trust assisted reciprocity (STAR). The efficacy of the STAR mechanism is thoroughly investigated. Next, it studies mobile users' data usage behaviors under the impact of social services and the wireless operator's pricing. Based on a two-stage Stackelberg game formulation, the user demand equilibrium (UDE) is analyzed in Stage II and the optimal pricing strategy is developed in Stage I. Last, it studies opportunistic cooperative networking under an optimal stopping framework with two-level decision-making. For both cases with or without dedicated relays, the optimal relaying strategies are derived and analyzed. The second part studies radar sensor network coverage for physical security. First, it studies placement of bistatic radar (BR) sensor networks for barrier coverage. The optimality of line-based placement is analyzed, and the optimal placement of BRs on a line segment is characterized. Then, it studies the coverage of radar sensor networks that exploits the Doppler effect. Based on a Doppler coverage model, an efficient method is devised to characterize Doppler-covered regions and an algorithm is developed to find the minimum radar density required for Doppler coverage. The third part studies cyber security and privacy in socially-aware networking and computing. First, it studies random access control, cooperative jamming, and spectrum access under an extended SGUM framework that incorporates negative social ties. The SNEs are derived and analyzed. Then, it studies pseudonym change for personalized location privacy under the SGUM framework. The SNEs are analyzed and an efficient algorithm is developed to find an SNE with desirable properties.Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201

    Establishing and optimising unmanned airborne relay networks in urban environments

    Get PDF
    This thesis assesses the use of a group of small, low-altitude, low-power (in terms of communication equipment), xed-wing unmanned aerial vehicles (UAVs) as a mobile communication relay nodes to facilitate reliable communication between ground nodes in urban environments. This work focuses on enhancing existing models for optimal trajectory planning and enabling UAV relay implementation in realistic urban scenarios. The performance of the proposed UAV relay algorithms was demonstrated and proved through an indoor simulated urban environment, the rst experiment of its kind.The objective of enabling UAV relay deployment in realistic urban environments is addressed through relaxing the constraints on the assumptions of communication prediction models assumptions, reducing knowledge requirements and improving prediction efficiency. This thesis explores assumptions for urban environment knowledge at three different levels: (i) full knowledge about the urban environment, (ii) partially known urban environments, and (iii) no knowledge about the urban environment. The work starts with exploring models that assume the city size, layout and its effects on wireless communication strength are known, representing full knowledge about the urban environment. [Continues.]</div

    Scalable wireless sensor networks for dynamic communication environments: simulation and modelling

    No full text
    This thesis explores the deployment of Wireless Sensor Networks (WSNs) on localised maritime events. In particular, it will focus on the deployment of a WSN at sea and estimating what challenges derive from the environment and how they affect communication. This research addresses these challenges through simulation and modelling of communication and environment, evaluating the implications of hardware selection and custom algorithm development. The first part of this thesis consists of the analysis of aspects related to the Medium Access Control layer of the network stack in large-scale networks. These details are commonly hidden from upper layers, thus resulting in misconceptions of real deployment characteristics. Results show that simple solutions have greater advantages when the number of nodes within a cluster increases. The second part considers routing techniques, with focus on energy management and packet delivery. It is shown that, under certain conditions, relaying data can increase energy savings, while at the same time allows a more even distribution of its usage between nodes. The third part describes the development of a custom-made network simulator. It starts by considering realistic radio, channel and interference models to allow a trustworthy simulation of the deployment environment. The MAC and Routing techniques developed thus far are adapted to the simulator in a cross-layer manner. The fourth part consists of adapting the WSN behaviour to the variable weather and topology found in the chosen application scenario. By analysing the algorithms presented in this work, it is possible to find and use the best alternative under any set of environmental conditions. This mechanism, the environment-aware engine, uses both network and sensing data to optimise performance through a set of rules that involve message delivery and distance between origin and cluster hea

    Optimal Route Planning with Mobile Nodes in Wireless Sensor Networks

    Get PDF
    Wireless Sensor Networks (WSN) are a collection of sensor nodes that sense their surroundings and relay their proximal information for further analysis. They utilize wireless communication technology to allow monitoring areas remotely. A major problem with WSNs is that the sensor nodes have a set sensing radius, which may not cover the entire field space. This issue would lead to an unreliable WSN that sometimes would not discover or report about events taking place in the field space. Researchers have focused on developing techniques for improving area coverage. These include allowing mobile sensor nodes to dynamically move towards coverage holes through the use of a path planning approach to solve issues such as maximizing area coverage. An approach is proposed in this thesis to maximize the area of network coverage by the WSN through a Mixed Integer Linear Programming (MILP) formulation which utilizes both static and mobile nodes. The mobile nodes are capable of travelling across the area of interest, to cover empty ‘holes’ (i.e. regions not covered by any of the static nodes) in a WSN. The goal is to find successive positions of the mobile node through the network, in order to maximize the network area coverage, or achieve a specified level of coverage while minimizing the number of iterations taken. Simulations of the formulation on small WSNs show promising results in terms of both objectives

    Node Deployment in Heterogeneous Rayleigh Fading Sensor Networks

    Full text link
    We study a heterogeneous Rayleigh fading wireless sensor network (WSN) in which densely deployed sensor nodes monitor an environment and transmit their sensed information to base stations (BSs) using access points (APs) as relays to facilitate the data transfer. We consider both large-scale and small-scale propagation effects in our system model and formulate the node deployment problem as an optimization problem aimed at minimizing the wireless communication network's power consumption. By imposing a desired outage probability constraint on all communication channels, we derive the necessary conditions for the optimal deployment that not only minimize the power consumption, but also guarantee all wireless links to have an outage probability below the given threshold. In addition, we study the necessary conditions for an optimal deployment given ergodic capacity constraints. We compare our node deployment algorithms with similar algorithms in the literature and demonstrate their efficacy and superiority
    corecore