All-IP communication between wireless sensor networks and IPv6 networks based on location information

2013 ◽  
Vol 35 (1) ◽  
pp. 65-77 ◽  
Author(s):  
Wang Xiaonan ◽  
Zhong Shan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Location Information ◽  
Ipv6 Networks ◽  
Ip Communication

scholarly journals Fuzzy Logic-Based Geographic Routing Protocol for Dynamic Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (1) ◽  
pp. 196 ◽  
Author(s):  
Xing Hu ◽  
Linhua Ma ◽  
Yongqiang Ding ◽  
Jin Xu ◽  
Yan Li ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Fuzzy Logic ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Geographic Routing ◽  
Wireless Sensor ◽  
Location Information ◽  
Destination Node ◽  
Routing Overhead ◽  
Geographic Routing Protocol

The geographic routing protocol only requires the location information of local nodes for routing decisions, and is considered very efficient in multi-hop wireless sensor networks. However, in dynamic wireless sensor networks, it increases the routing overhead while obtaining the location information of destination nodes by using a location server algorithm. In addition, the routing void problem and location inaccuracy problem also occur in geographic routing. To solve these problems, a novel fuzzy logic-based geographic routing protocol (FLGR) is proposed. The selection criteria and parameters for the assessment of the next forwarding node are also proposed. In FLGR protocol, the next forward node can be selected based on the fuzzy location region of the destination node. Finally, the feasibility of the FLGR forwarding mode is verified and the performance of FLGR protocol is analyzed via simulation. Simulation results show that the proposed FLGR forwarding mode can effectively avoid the routing void problem. Compared with existing protocols, the FLGR protocol has lower routing overhead, and a higher packet delivery rate in a sparse network.

scholarly journals Distributed Beacon Drifting Detection for Localization in Unstable Environments

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Ming Xia ◽  
Peiliang Sun ◽  
Xiaoyan Wang ◽  
Yan Jin ◽  
Qingzhang Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Detection Algorithm ◽  
Experimental Results ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Information ◽  
Detection Accuracy ◽  
Research Issue ◽  
Fundamental Research

Localization is a fundamental research issue in wireless sensor networks (WSNs). In most existing localization schemes, several beacons are used to determine the locations of sensor nodes. These localization mechanisms are frequently based on an assumption that the locations of beacons are known. Nevertheless, for many WSN systems deployed in unstable environments, beacons may be moved unexpectedly; that is, beacons are drifting, and their location information will no longer be reliable. As a result, the accuracy of localization will be greatly affected. In this paper, we propose a distributed beacon drifting detection algorithm to locate those accidentally moved beacons. In the proposed algorithm, we designed both beacon self-scoring and beacon-to-beacon negotiation mechanisms to improve detection accuracy while keeping the algorithm lightweight. Experimental results show that the algorithm achieves its designed goals.

scholarly journals Neighborhood Kalman Estimation for Distributed Localization in Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-8 ◽  
Author(s):  
Xiaochu Wang ◽  
Ting Sun ◽  
Chunshi Fan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Fusion ◽  
Numerical Simulations ◽  
Covariance Matrices ◽  
Wireless Sensor ◽  
Location Information ◽  
Localization Algorithm ◽  
Fast Speed ◽  
Sensor Locations

Accurate location information plays an important role in the performance of wireless sensor networks since many mission applications depend on it. This paper proposes a fully distributed localization algorithm based on the concept of data fusion, allowing the full intranodes information including the correlations among estimates to take part in the algorithm. By properly constructing and updating the estimates as well as the corresponding covariance matrices, the algorithm can fuse intranodes information to generate more accurate estimates on the sensor locations with a fast speed. Finally, numerical simulations are given as examples to demonstrate the effectiveness of the algorithm.

scholarly journals Efficient Location Service for a Mobile Sink in Solar-Powered Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 272 ◽  
Author(s):  
Minjae Kang ◽  
Ikjune Yoon ◽  
Dong Noh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Information ◽  
Position Information ◽  
Location Service ◽  
Surplus Energy ◽  
Solar Powered

By utilizing mobile sinks in wireless sensor networks (WSNs), WSNs can be deployed in more challenging environments that cannot connect with the Internet, such as those that are isolated or dangerous, and can also achieve a balanced energy consumption among sensors which leads to prolonging the network lifetime. However, an additional overhead is required to check the current location of the sink in order for a node to transmit data to the mobile sink, and the size of the overhead is proportional to that of the network. Meanwhile, WSNs composed of solar-powered nodes have recently been actively studied for the perpetual operation of a network. This study addresses both of these research topics simultaneously, and proposes a method to support an efficient location service for a mobile sink utilizing the surplus energy of a solar-powered WSN. In this scheme, nodes that have a sufficient energy budget can constitute rings, and the nodes belonging to these rings (which are called ring nodes) maintain up-to-date location information on the mobile sink node and serve this information to the other sensor nodes. Because each ring node only uses surplus energy to serve location information, this does not affect the performance of a node’s general operations (e.g., sensing, processing, and data delivery). Moreover, because multiple rings can exist simultaneously in the proposed scheme, the overhead for acquiring the position information of the sink can be significantly reduced, and also hardly increases even if the network size becomes larger.

Sign in / Sign up

Export Citation Format

Share Document