The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The node localization process of the traditional DV-Hop scheme is sensitive to the heterogeneity of network topology, and the robustness of the scheme is poor while the network topology is diversiform due to random node deployment. Aiming at such a problem, an improvement strategy is put forward, and different treatment algorithms are introduced in the distance estimation step and the position calculation...
Load balancing is a key technique to balance energy consumption, prolong network lifetime and reduce delays in Wireless Sensor Networks (WSNs). In this paper, a Spanning Multi-Tree (SMT) algorithm in multi-sink WSNs with heterogeneous traffic generating nodes is studied. In the SMT algorithm, multiple trees, each rooted from a sink, will be formed in order to cover all sensor nodes in the network...
The WirelessHART standard has been specifically designed for real-time communication between sensor and actuator devices for industrial process monitoring and control. End-to-end communication delay analysis for WirelessHART networks is required for acceptance test of real-time data flows from sensors to actuators and for workload adjustment in response to network dynamics. In this paper, we map the...
This paper presents an empirical study of the effects of the channel occupation on the consumption of actual IEEE 802.15.4/ZigBee motes. The study is focused on the current demanded by a sensor node in a simple beaconless star topology when the CSMA contention algorithm introduces idle times in the activity of the radio transceiver. For this purpose, the developed testbed permits to define the probability...
ZigBee is the emerging industrial standard for wireless sensor networks. Preemptive Distributed Address Assignment (PDAA) Mechanism improves ZigBee address assignment algorithm, and PDAA Mechanism presents an autorouting protocol which does not require any routing tables to send the packets to the destination. It can be used in any device in ZigBee, such as router and end device. However, the autorouting...
Wireless sensor networks (WSNs) detect and monitor the outside physical state by the sensor nodes organizing automatically. Clustering is a standard approach for achieving efficient and scalable performance in WSNs. In the applications of analysis topology discovering, geography routing, tracking and so forth, we need to resolve how to search for the boundary nodes and form the network boundary. Different...
Wireless sensor networks (WSNs) have recently emerged as suitable data collection tools for both military and civil applications. In an indoor factory monitoring environment sensor relocation and/or addition are necessary with reorganization of production lines and/or starting of new production lines. Due to memory, processing, etc. constraints of the wireless nodes these addition and relocation affect...
Wireless sensor networks (WSNs) are frameworks for modern pervasive computing infrastructures, and are often subject to operational difficulties, such as the inability to effectively mitigate signal noise or sensor failure. Natural systems, such as gene regulatory networks (GRNs), participate in similar information transport and are often subject to similar operational disruptions (noise, damage,...
How to measure and maintain connectivity is an important issue in ad hoc networks. A special case of such network is Wireless Sensor Networks (WSN), which are often deployed in harsh environments and also susceptible to a number of problems that may negatively affect the connectivity among the nodes. An additional factor that increases the cost of connectivity maintenance in ad hoc networks is when...
Many sensor network protocols utilize the existence of disjoint paths (e.g., perfectly secure message transmission or multi-path key establishment), but do not address how a node actually determines these paths in the presence of an adversary. In this paper we investigate what assumptions are necessary to gather information about the local network topology when adversarial nodes are present and capable...
An efficient logical topology helps wireless sensor networks (WSNs) minimizing different constraints. For large-scale WSNs, chain oriented logical topologies are shown to be more energy conservative than other logical topologies. Chain construction is the main challenge to create a chain oriented logical topology. In this paper, we propose a chain construction scheme, which creates several chains...
In this paper, we study the performance of the Greedy Perimeter Stateless Routing (GPSR) [1] and the Greedy Routing for Maximum Lifetime (GRMax)[2] which is our proposal, in wireless sensor networks in random topology and grid topology wireless sensor network. We decide to compare the performance of GPSR and GRMax in different topology of networks using the same simulation environment. Evaluation...
In this paper, we study the problem of data acquisition in wireless sensor networks (WSNs). A recently revitalized technique called compressive sensing (CS) has presented a new method to capture sparse signals at a rate below Nyquist. There are drawbacks to directly applying the existing CS algorithm to WSNs, which are mainly due to the fact that CS requires a large number of inter-communications...
Recently many Wireless Sensor Network (WSN)-based agriculture monitoring systems have been implemented mostly for developed countries. WSN in these monitoring systems uses tree topology and multi-hop dynamic flooding routing protocol that are not energy efficient and has a single point of failure. Though some protocols use zone-based routing they consider that a large number of sensors are deployed...
This paper presents a multi-hop dynamic moving algorithm to repair the coverage holes, while maintaining the initial topology and connectivity, for the wireless sensor networks. In such environment, the movement of each sensor node is fully distributed and autonomous. The proposed algorithm takes the density measures into consideration for determining which node to move and to what direction and distance...
Topology inference of end to end measurement overcomes the drawbacks of traditional algorithm that needs cooperation of internal node in network, And does not incur any additional burden on the network. Scholars show interests in Research Area in recent years. This paper analyzes recent new arithmetic Based on end to end date for wireless sensor networks, sums up the characteristics and the appropriate...
We consider a quasi-stationary Markov chain as a model for a decode and forward wireless multi-hop cooperative transmission system that forms successive Opportunistic Large Arrays (OLAs). This paper treats a linear network topology, where the nodes form a one-dimensional horizontal grid with equal spacing. In this OLA approach, all nodes are intended to decode and relay. We derive the transition probability...
In this paper we propose distributed algorithms that solve the coverage problem in 3D space. In particular, we use a swarm of unmanned aerial vehicles (UAVs) in order to explore a possibly unknown area. Actual use cases include the automated acquisition of sensory data in operations that try to gain extensive knowledge about an area. First, we try to efficiently cover a predefined 3D space with multiple...
We propose two strategies to reduce energy consumption for secure data aggregation in wireless sensor networks. While the purpose of data aggregation is to reduce energy consumption, secure data aggregation introduces an overhead making the total energy consumption comparable to naive secure non-aggregation. Another aspect is that the secure data aggregation has higher node congestion than non-aggregation...
In mobile wireless sensor networks where sensor nodes are general mobile terminals equipped by vehicles and pedestrians, it is difficult for applications to estimate coverages of sensor nodes due to their mobility. In addition, when a network is sparse, it is also difficult to estimate delivery delays of sensor readings to the sink node(s) because delays depend on both the distribution of nodes and...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.