scholarly journals Two-hop distance estimation in wireless sensor networks

2017 ◽  
Vol 13 (2) ◽  
pp. 155014771668968 ◽  
Author(s):  
Sunyong Kim ◽  
Sun Young Park ◽  
Daehoon Kwon ◽  
Jaehyun Ham ◽  
Young-Bae Ko ◽  
...  

In wireless sensor networks, the accurate estimation of distances between sensor nodes is essential. In addition to the distance information available for immediate neighbors within a sensing range, the distance estimation of two-hop neighbors can be exploited in various wireless sensor network applications such as sensor localization, robust data transfer against hidden terminals, and geographic greedy routing. In this article, we propose a two-hop distance estimation method, which first obtains the region in which the two-hop neighbor nodes possibly exist and then takes the average of the distances to the points in that region. The improvement in the estimation accuracy achieved by the proposed method is analyzed in comparison with a simple summation method that adds two single-hop distances as an estimate of a two-hop distance. Numerical simulation results show that in comparison with other existing distance estimation methods, the proposed method significantly reduces the distance estimation error over a wide range of node densities.

2017 ◽  
Vol 13 (7) ◽  
pp. 155014771772215 ◽  
Author(s):  
Wooguil Pak

Many researchers have analyzed sources of uncertainty in synchronization protocols for wireless sensor networks. However, very few researchers perform this work in depth, and failed to discover comprehensive characteristics since they worked with only one or two measurement intervals. To overcome this problem, extensive measurements were conducted and analyzed to find the characteristics of the sources according to various measurement intervals. Using the characteristics, a new media access control protocol, WideMAC, was designed to support a wide range of duty cycles for various applications. The transmission node in WideMAC calculates the wakeup time of the reception node before transmitting a packet and adaptively estimates the synchronization error size according to the synchronization interval from seconds to hours. To track the reception node’s wakeup time for synchronization, WideMAC uses two estimation algorithms that estimate the wakeup time and the upper bound of the total timing error. Accurate estimation of the wakeup time results in a significant amount of energy saving at the transmission node. Finally, through extensive performance evaluations in a testbed, WideMAC confirmed that it can significantly outperform existing state-of-the-art protocols.


2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Longfei Wen ◽  
Lingguo Cui ◽  
Senchun Chai ◽  
Baihai Zhang

Localization is one of the most significant technologies in wireless sensor networks (WSNs) since it plays a critical role in many applications. The main idea in most localization methods is to estimate the sensor-anchor distances that are used by sensors to locate themselves. However, the distance information is always imprecise due to the measurement or estimation errors. In this work, a novel algorithm called neighbor constraint assisted distributed localization (NCA-DL) is proposed, which introduces the application of geometric constraints to these distances within the algorithm. For example, in the case presented here, the assistance provided by a neighbor will consist in formulating a linear equality constraint. These constraints can be further used to formulate optimization problems for distance estimation. Then through some optimization methods, the imprecise distances can be refined and the localization precision is improved.


Fault Tolerant Reliable Protocol (FTRP) is proposed as a novel routing protocol designed for Wireless Sensor Networks (WSNs). FTRP offers fault tolerance reliability for packet exchange and support for dynamic network changes. The key concept used is the use of node logical clustering. The protocol delegates the routing ownership to the cluster heads where fault tolerance functionality is implemented. FTRP utilizes cluster head nodes along with cluster head groups to store packets in transient. In addition, FTRP utilizes broadcast, which reduces the message overhead as compared to classical flooding mechanisms. FTRP manipulates Time to Live values for the various routing messages to control message broadcast. FTRP utilizes jitter in messages transmission to reduce the effect of synchronized node states, which in turn reduces collisions. FTRP performance has been extensively through simulations against Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State (OLSR) routing protocols. Packet Delivery Ratio (PDR), Aggregate Throughput and End-to-End delay (E-2-E) had been used as performance metrics. In terms of PDR and aggregate throughput, it is found that FTRP is an excellent performer in all mobility scenarios whether the network is sparse or dense. In stationary scenarios, FTRP performed well in sparse network; however, in dense network FTRP’s performance had degraded yet in an acceptable range. This degradation is attributed to synchronized nodes states. Reliably delivering a message comes to a cost, as in terms of E-2-E. results show that FTRP is considered a good performer in all mobility scenarios where the network is sparse. In sparse stationary scenario, FTRP is considered good performer, however in dense stationary scenarios FTRP’s E-2-E is not acceptable. There are times when receiving a network message is more important than other costs such as energy or delay. That makes FTRP suitable for wide range of WSNs applications, such as military applications by monitoring soldiers’ biological data and supplies while in battlefield and battle damage assessment. FTRP can also be used in health applications in addition to wide range of geo-fencing, environmental monitoring, resource monitoring, production lines monitoring, agriculture and animals tracking. FTRP should be avoided in dense stationary deployments such as, but not limited to, scenarios where high application response is critical and life endangering such as biohazards detection or within intensive care units.


Author(s):  
Cong Gao ◽  
Ping Yang ◽  
Yanping Chen ◽  
Zhongmin Wang ◽  
Yue Wang

AbstractWith large deployment of wireless sensor networks, anomaly detection for sensor data is becoming increasingly important in various fields. As a vital data form of sensor data, time series has three main types of anomaly: point anomaly, pattern anomaly, and sequence anomaly. In production environments, the analysis of pattern anomaly is the most rewarding one. However, the traditional processing model cloud computing is crippled in front of large amount of widely distributed data. This paper presents an edge-cloud collaboration architecture for pattern anomaly detection of time series. A task migration algorithm is developed to alleviate the problem of backlogged detection tasks at edge node. Besides, the detection tasks related to long-term correlation and short-term correlation in time series are allocated to cloud and edge node, respectively. A multi-dimensional feature representation scheme is devised to conduct efficient dimension reduction. Two key components of the feature representation trend identification and feature point extraction are elaborated. Based on the result of feature representation, pattern anomaly detection is performed with an improved kernel density estimation method. Finally, extensive experiments are conducted with synthetic data sets and real-world data sets.


Energies ◽  
2021 ◽  
Vol 14 (9) ◽  
pp. 2417
Author(s):  
Andrzej Michalski ◽  
Zbigniew Watral

This article presents the problems of powering wireless sensor networks operating in the structures of the Internet of Things (IoT). This issue was discussed on the example of a universal end node in IoT technology containing RFID (Radio Frequency Identification) tags. The basic methods of signal transmission in these types of networks are discussed and their impact on the basic requirements such as range, transmission speed, low energy consumption, and the maximum number of devices that can simultaneously operate in the network. The issue of low power consumption of devices used in IoT solutions is one of the main research objects. The analysis of possible communication protocols has shown that there is a possibility of effective optimization in this area. The wide range of power sources available on the market, used in nodes of wireless sensor networks, was compared. The alternative possibilities of powering the network nodes from Energy Harvesting (EH) generators are presented.


2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Asmaa Ez-Zaidi ◽  
Said Rakrak

Wireless sensor networks have been the subject of intense research in recent years. Sensor nodes are used in wide range of applications such as security, military, and environmental monitoring. One of the most interesting applications in wireless sensor networks is target tracking, which mainly consists in detecting and monitoring the motion of mobile targets. In this paper, we present a comprehensive survey of target tracking approaches. We then analyze them according to several metrics. We also discuss some of the challenges that influence the performance of tracking schemes. In the end, we conduct detailed analysis and comparison between these algorithms and we conclude with some future directions.


Author(s):  
Pradeep Kumar Ts ◽  
Sayali Chitnis

The world of internet of things (IoT) and automation has been catching a robust pace to impact wide range of commercial and domestic applications for some time now. The IoT holds ad-hoc or wireless sensor networks (WSNs) at its very primary implementation level, the hardware level. The increasing requirement of these networks demands a renewed and better design of the network that improves the already existing setbacks of WSNs, which is mainly the power consumption and optimization. Routing highly affects the power consumed in the nodes in WSNs, hence having a modified routing algorithm which is specific to the application and meets its needs, particularly it is a good approach instead of having a generalized existent routing approach. Currently, for WSN having adequate number of nodes, routing involves maximum number of nodes and hops so as to reduce power consumption. However, for restricted areas and limited nodes, this scenario concludes with using up more number of nodes simultaneously resulting in reducing several batteries simultaneously. A routing algorithm is proposed in this paper for such applications that have a bounded region with limited resources. The work proposed in this paper is motivated from the routing algorithm positional attribute based next-hop determination approach (PANDA-TP) which proposes the increase in number of hops to reduce the requirement of transmission power. The aim of the proposed work is to compute the distance between the sending and receiving node and to measure the transmission power that would be required for a direct(path with minimum possible hops) and a multi-hop path. If the node is within the thresh-hold distance of the source, the packet is undoubtedly transferred directly; if the node is out of the thresh-hold distance, then the extra distance is calculated. Based on this, the power boosting factor for the source node, and if necessary, then the extra number of nodes that would be required to transmit is determined. An extra decision-making step is added to this approach which makes it convenient to utilize in varied situations. This routing approach suits the current level of robustness that the WSNs demand. 


Sign in / Sign up

Export Citation Format

Share Document