967 research outputs found
A Theoretical Review of Topological Organization for Wireless Sensor Network
The recent decades have seen the growth in the fields of wireless communication technologies, which has made it possible to produce components with a rational cost of a few cubic millimeters of volume, called sensors. The collaboration of many of these wireless sensors with a basic base station gives birth to a network of wireless sensors. The latter faces numerous problems related to application requirements and the inadequate abilities of sensor nodes, particularly in terms of energy. In order to integrate the different models describing the characteristics of the nodes of a WSN, this paper presents the topological organization strategies to structure its communication. For large networks, partitioning into sub-networks (clusters) is a technique used to reduce consumption, improve network stability and facilitate scalability
Internet of Things-aided Smart Grid: Technologies, Architectures, Applications, Prototypes, and Future Research Directions
Traditional power grids are being transformed into Smart Grids (SGs) to
address the issues in existing power system due to uni-directional information
flow, energy wastage, growing energy demand, reliability and security. SGs
offer bi-directional energy flow between service providers and consumers,
involving power generation, transmission, distribution and utilization systems.
SGs employ various devices for the monitoring, analysis and control of the
grid, deployed at power plants, distribution centers and in consumers' premises
in a very large number. Hence, an SG requires connectivity, automation and the
tracking of such devices. This is achieved with the help of Internet of Things
(IoT). IoT helps SG systems to support various network functions throughout the
generation, transmission, distribution and consumption of energy by
incorporating IoT devices (such as sensors, actuators and smart meters), as
well as by providing the connectivity, automation and tracking for such
devices. In this paper, we provide a comprehensive survey on IoT-aided SG
systems, which includes the existing architectures, applications and prototypes
of IoT-aided SG systems. This survey also highlights the open issues,
challenges and future research directions for IoT-aided SG systems
Self-stabilizing k-clustering in mobile ad hoc networks
In this thesis, two silent self-stabilizing asynchronous distributed algorithms are given for constructing a k-clustering of a connected network of processes. These are the first self-stabilizing solutions to this problem. One algorithm, FLOOD, takes O( k) time and uses O(k log n) space per process, while the second algorithm, BFS-MIS-CLSTR, takes O(n) time and uses O(log n) space; where n is the size of the network. Processes have unique IDs, and there is no designated leader. BFS-MIS-CLSTR solves three problems; it elects a leader and constructs a BFS tree for the network, constructs a minimal independent set, and finally a k-clustering. Finding a minimal k-clustering is known to be NP -hard. If the network is a unit disk graph in a plane, BFS-MIS-CLSTR is within a factor of O(7.2552k) of choosing the minimal number of clusters; A lower bound is given, showing that any comparison-based algorithm for the k-clustering problem that takes o( diam) rounds has very bad worst case performance; Keywords: BFS tree construction, K-clustering, leader election, MIS construction, self-stabilization, unit disk graph
Study on Different Topology Manipulation Algorithms in Wireless Sensor Network
Wireless sensor network (WSN) comprises of spatially distributed autonomous sensors to screen physical or environmental conditions and to agreeably go their information through the network to a principle area. One of the critical necessities of a WSN is the efficiency of vitality, which expands the life time of the network. At the same time there are some different variables like Load Balancing, congestion control, coverage, Energy Efficiency, mobility and so on. A few methods have been proposed via scientists to accomplish these objectives that can help in giving a decent topology control. In the piece, a few systems which are accessible by utilizing improvement and transformative strategies that give a multi target arrangement are examined. In this paper, we compare different algorithms' execution in view of a few parameters intended for every target and the outcomes are analyzed.
DOI: 10.17762/ijritcc2321-8169.15029
An energy-aware distributed algorithm for virtual backbone in wireless sensor network with different transmission range
Since there is no fixed infrastructure or centralized management in Wireless Sensor Networks (WSNs), a Connected Dominating Set(CDS) has been proposed as a virtual backbone is efficient. A virtual backbone plays a major role in routing, broadcasting, coverage andactivity scheduling. Wireless sensor networks to form a CDS usually by UDG (Unit Disk Graph) models that are used in this model, allnodes have the same message, but this article UDG model instead of a version that is closer to reality called DGB (Disk Graph withBidirectional links) is used in which nodes can adopt different transmission intervals. In many applications, to reduce overhead, increasenetwork lifetime, and so on, to find the MCDS (minimum connected dominating set) is desirable, but the point is that MCDS UDG modelsand DGB, the problem is NP-hard. In addition to the analysis of algorithms, the new algorithm will provide and the efficiency of thealgorithm, especially in terms of energy consumption, through theoretical analysis and simulation algorithms are available to be checked out
Robust Wireless Sensor Network Deployment
International audienceIn this work we present a decentralized deployment algorithm for wireless mobile sensor networks focused on deployment Efficiency, connectivity Maintenance and network Reparation (EMR). We assume that a group of mobile sensors is placed in the area of interest to be covered, without any prior knowledge of the environment. The goal of the algorithm is to maximize the covered area and cope with sudden sensor failures. By relying on the locally available information regarding the environment and neighborhood, and without the need for any kind of synchronization in the network, each sensor iteratively chooses the next-step movement location so as to form a hexagonal lattice grid. Relying on the graph of wireless mobile sensors, we are able to provide the properties regarding the quality of coverage, the connectivity of the graph and the termination of the algorithm. We run extensive simulations to provide compactness properties of the deployment and evaluate the robustness against sensor failures. We show through the analysis and the simulations that EMR algorithm is robust to node failures and can restore the lattice grid. We also show that even after a failure, EMR algorithm call still provide a compact deployment in a reasonable time
A self-healing framework for WSNs : detection and recovery of faulty sensor nodes and unreliable wireless links
Proponemos un marco conceptual para acoplar técnicas de auto-organización y técnicas de autocuración.
A este marco se le llama de auto-curación y es capaz de hacer frente a enlaces
inalámbricos inestables y nodos defectuosos. Dividimos el marco en dos componentes
principales: la auto-organización y auto-curación. En el componente de auto-organización,
nosotros construimos una topología de árbol que determine las rutas hacia el sumidero. En el
componente de auto-curación, la topología del árbol se adapta a ambos tipos de fallas siguiendo
tres pasos: recopilación de información, detección de fallas, y la recuperación de fallos. En el
paso de recopilación de información, los nodos determinan el estado actual de la red mediante
la recopilación de información de la capa MAC. En el paso de detección de fallas, los nodos
analizan la información recopilada y detectan nodos/enlaces defectuosos. En el paso de
recuperación de fallos, los nodos recuperan la topología del árbol mediante la sustitución de
componentes defectuosos con redundantes (es decir, componentes de respaldo). Este marco
permite una red con resiliencia que se recupera sin agotar los recursos de la red.We propose a conceptual framework for putting together self-organizing and self-healing
techniques. This framework is called the self-healing framework and it is capable of coping with
unstable wireless links and faulty nodes. We divide the framework into two major components:
selforganization and self-healing. In the self-organization component, we build a tree topology
that determines routing paths towards the sink. In the self-healing component, the tree
topology copes with both types of failures by following three steps: information collection, fault
detection, and fault recovery. In the information collection step, the nodes determine the
current status of the network by gathering information from the MAC layer. In the fault
detection step, the nodes analyze the collected information and detect faulty nodes/links. In
the fault recovery step, the nodes recover the tree topology by replacing the faulty components
with redundant ones (i.e., backup components). This framework allows a resilient network that
recovers itself without depleting the network resources.Doctor en IngenieríaDoctorad
- …