Location Information Of Sensor Nodes Research Articles

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

The paper proposes a scheme on achieving all-IP communication between wireless sensor networks and IPv6 networks based on sensor nodes' location information. The paper proposes the sensor node's IPv6 address structure based on location information, the IPv6-address configuration algorithm based on the proposed IPv6 address structure, the mobility handoff algorithm and the routing algorithm in the link layer. The location information of sensor nodes is utilized to achieve the IPv6-address configuration algorithm and the routing algorithm. In the mobility handoff algorithm, neither does a mobile sensor node need a care-of address during the mobility process, nor is involved in the mobility handoff process. Therefore, a mobile sensor node's power consumption is reduced and the life span is prolonged. The paper analyzes the performances of the proposed scheme and the existing schemes, and the analytical data show that the performance of the proposed scheme is better.

MSNS: mobile sensor network simulator for area coverage and obstacle avoidance based on GML

Abstract A mobile sensor network is a distributed collection of sensors, each of which has sensing, computation, communication, and locomotion capabilities. In particular, locomotion facilitates the ability to self-deployment. In such a network of self-deployable mobile sensors, it is difficult to evaluate the effectiveness of mobile sensor network deployment in a given target area because we cannot predict the coverage rate for the target area. The coverage rate will be changed due to the number of sensor required in the target area, connectivity degree to be maintained and unknown obstacles. In this article, we develop mobile sensor network simulator (MSNS) in order to visualize (1) coverage secured by mobile sensors and (2) avoidance of obstacle objects (building, road and wall, and so on) on the real map drawn by GML (Geography Markup Language). From a user, MSNS receives the number of mobile sensor nodes, connectivity degree, sensor node's sensing range, communication range, and supersonic wave range. And then it visualizes the location information of sensor nodes, connectivity degree, and sensing coverage, all of which change with simulation time. Thereby we can estimate how many nodes are required in a given target area, and also calculate coverage rate of the target area in advance to the real deployment of mobile sensors.

An efficient Dynamic Addressing based routing protocol for Underwater Wireless Sensor Networks

Underwater Wireless Sensor Networks (UWSNs) are different in many aspects as compared to terrestrial sensor networks. Other than long propagation delays and high error probability, continuous node movement makes it hard to manage the location information of sensor nodes. Determining the location of every node is a major issue as nodes can move continuously with the water currents. In order to handle the problem of large propagation delays and unreliable link quality, many algorithms have been proposed and some of them provide good solutions for these issues, but continuous node movements still need attention. In order to handle the problem of node mobility, we proposed a Hop-by-Hop Dynamic Addressing Based (H2-DAB) routing protocol, where every node in the network will be assigned a routable address in a quick and efficient way without requiring an explicit configuration or any dimensional location information. It helps to provide an option where nodes can communicate without any centralized infrastructure, also a mechanism is available where nodes can come and leave the network without having any serious effect on the rest of the network. Simulation results show that H2-DAB can manage easily during the quick routing changes where node movements are very frequent yet require little or no overhead in order to complete its tasks.

A Wormhole Attack Defense Strategy of WSN Based on Node Location Information

Wormhole attack is a kind of attack manner in WSN that does not need to crack network encryption key, which has great harm. Aiming at the characteristics of Wormhole attack, a wormhole attack defense strategy based on node location information was presented. The manner computed physical distance between two nodes through extraction of location information in the packets and compared it with stored threshold, so as to determine whether these packets come from normal communication range. WSN network modeling and simulation results based on OMNeT++ indicates that AODV protocol of defense strategy added sensor node location information can implement successfully defense.

무선 애드혹 네트워크를 위한 위치정보 기반 기울기 라우팅 알고리즘

본 논문에서는 무선 애드혹 네트워크에서 센서 노드들의 물리적 위치정보를 기반으로 라우팅 경로를 설정하기 위한 LIGR (Location Information-based Gradient Routing) 알고리즘을 제안한다. LIGR 알고리즘은 물리적 위치정보를 이용하여 소스 노드와 싱크 노드를 잇는 직선의 기울기를 통해 전송 방향과 탐색 범위를 결정함으로써 불필요한 데이터 전송과 경로 탐색 시간 및 전파 지연 시간을 감소시킨다. 또한 포워딩 노드 선택 시 배터리 부족 노드는 2순위 또는 3순위의 우선순위를 갖도록 하여 우선적으로 선택하지 않도록 함으로써 에너지 부족 노드가 네트워크상에서 라우터로서의 기능 수행보다는 데이터 수집을 위한 호스트로서의 기능을 수행하도록 하였다. LGR (Logical Grid Routing) 프로토콜에 비하여 LIGR 알고리즘은 평균 수신율, 평균 지연시간, 평균 잔여 에너지 및 네트워크 처리율에서 개선된 성능을 보였다. In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.

선박내 환경 정보 모니터링을 위한 고장 감래 센서 라우팅 알고리즘 모델 설계에 관한 연구

The goal of this research is to enhance the maintenance and monitoring system of ship environment using sensor network. It is important to know the location information of sensor nodes to control the sensors and to obtain the sensor data from sensor network inside the ship. In this paper, we address the grouping and routing mechanism according to the relative distance of sensor nodes, based on LEACH and PEGASIS. We also consider the fault tolerant mechanism using the location information of sensor nodes.

Distributed and Location-Based Multicast Routing Algorithms for Wireless Sensor Networks

Multicast routing protocols in wireless sensor networks are required for sending the same message to multiple different destinations. In this paper, we propose two different distributed algorithms for multicast routing in wireless sensor networks which make use of location information of sensor nodes. Our first algorithm groups the destination nodes according to their angular positions and forwards the multicast message toward each group in order to reduce the number of total branches in multicast tree which also reduces the number of messages transmitted. Our second algorithm calculates an Euclidean minimum spanning tree at the source node by using the positions of the destination nodes. The multicast message is forwarded to destination nodes according to the calculated MST. This helps in reducing the total energy consumed for delivering the message to all destinations by decreasing the number of total transmissions. Evaluation results show that the algorithms we propose are scalable and energy efficient, so they are good candidates to be used for multicasting in wireless sensor networks.

Anchor Global Position Accuracy Enhancement Based on Data Fusion

The location information of sensor nodes in wireless sensor networks is crucial for various applications such as emergency rescue operations, environmental monitoring, home automation, and traffic control. In this paper, a new method to improve the anchor location accuracy in wireless sensor networks is proposed based on fusion of Global Positioning System (GPS) measurements and anchor-to-anchor parameter estimates. Novel algorithms are derived to increase the accuracy of anchor locations using both anchor-to-anchor distance and angle-of-arrival (AOA) estimates for both line-of-sight (LOS) and non-LOS (NLOS) scenarios. When using anchor-to-anchor distance estimates in LOS conditions, an optimization-based algorithm is developed. The Cramer-Rao lower bound (CRLB) is derived to benchmark positioning accuracy in 3-D environments with both GPS measurements and anchor-to-anchor parameter estimates, which has not been studied in the literature. Simulation results demonstrate that the proposed algorithms can substantially improve anchor position accuracy, and the performance of the proposed algorithms approaches the CRLB.

An Energy-Efficient Secure Routing and Key Management Scheme for Mobile Sinks in Wireless Sensor Networks Using Deployment Knowledge

For many sensor network applications such as military or homeland security, it is essential for users (sinks) to access the sensor network while they are moving. Sink mobility brings new challenges to secure routing in large-scale sensor networks. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. Also, studies and experiences have shown that considering security during design time is the best way to provide security for sensor network routing. This paper presents an energy-efficient secure routing and key management for mobile sinks in sensor networks, called SCODEplus. It is a significant extension of our previous study in five aspects: (1) Key management scheme and routing protocol are considered during design time to increase security and efficiency; (2) The network topology is organized in a hexagonal plane which supports more efficiency than previous square-grid topology; (3) The key management scheme can eliminate the impacts of node compromise attacks on links between non-compromised nodes; (4) Sensor node deployment is based on Gaussian distribution which is more realistic than uniform distribution; (5) No GPS or like is required to provide sensor node location information. Our security analysis demonstrates that the proposed scheme can defend against common attacks in sensor networks including node compromise attacks, replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Both mathematical and simulation-based performance evaluation show that the SCODEplus significantly reduces the communication overhead, energy consumption, packet delivery latency while it always delivers more than 97 percent of packets successfully.

Hierarchical data gathering schemes in wireless sensor networks

PurposeThis paper aims to balance the total energy consumption and the transmission delay for data gathering application in wireless sensor networks.Design/methodology/approachThis paper adopts a hierarchical grid structure to reduce the total energy consumption, and utilizes a tree architecture to decrease the transmission delay.FindingsIn the results, the proposed method performs better, in terms of the number of rounds and the energy × delay cost, than other data gathering protocols with different network sizes and node densities. Moreover, the proposed method also provides good coverage preservation in different environments.Research limitations/implicationsIn this paper, sensor nodes are assumed to be uniformly distributed, homogenous, energy‐constrained. Each sensor node also has ability to adjust its transmission power. For practice, the proposed method needs location information of sensor nodes and the radio interference between sensor nodes during data transmissions should be considered.Practical implicationsThe proposed method can significantly reduce the delay time and may be suitable for real‐time data gathering applications.Originality/valueThis paper combines hierarchical grid structure with tree architecture to minimize the energy × delay cost for data gathering application.

RSS-based Monte Carlo localisation for mobile sensor networks

Node localisation is a fundamental problem in wireless sensor networks. Many applications require the location information of sensor nodes. Received signal strength (RSS) is a simple and inexpensive approach for localisation purpose. However, the accuracy of RSS measurement is unpredictable owing to the nature of the radio frequency (RF) channel. An RSS-based Monte Carlo localisation scheme is proposed to sequentially estimate the location of mobile nodes, using the log-normal statistical model of RSS measurement. The RSS measurement is treated as the observation model in Monte Carlo method and the mobility feature of nodes as the transition model. Our method is widely applicable because the RSS function is easy to implement on nodes, and the mathematical model for mobile nodes may have non-analytic forms. Simulation results about localisation accuracy and cost show that this scheme is better than other methods.

Analysis for Multi-Coverage Problem in Wireless Sensor Networks

Since wireless sensor networks consist of a large number of tiny sensors with limited power supply, it becomes a major concern that how to extend sensor network lifetime and maintain sufficient sensing area at the same time. To achieve this goal, a broadly used strategy is to select some sensor nodes as working nodes to cover the deployment area and at the same time turn off redundant nodes. This paper proposes a mathematical model in which only if the proportion of the sensing range of nodes to the range of the deployment area is known, the number of the nodes needed to reach the expected coverage fraction can be calculated. This work is different from the most literature studying the coverage problem because it is not based on location information of sensor nodes, and thus the cost of hardware and the energy consumption on sensor nodes for deriving and maintaining location information can be considerably reduced. The simulated experiment suggests that in random deployment strategy, the error between the expected coverage fraction and the coverage fraction derived from the simulated experiment is no larger than 2% of the expected coverage fraction; when the expected coverage fraction and the coverage fraction derived from the simulated experiment is the same, the error between the number of working nodes derived from the calculation and the number of working nodes derived from the simulated experiment is less than 5% of the number derived from the calculation. It suggests that the results are identical to the experimental results. The analytical results in this paper can be widely adopted in handling sensor deployment, topology control, and other issues.

Random Walk Routing in WSNs with Regular Topologies

Topology is one of the most important characteristics for any type of networks because it represents the network’s inherent properties and has great impact on the performance of the network. For wireless sensor networks (WSN), a well-deployed regular topology can help save more energy than what a random topology can do. WSNs with regular topologies can prolong network lifetime as studied in many previous work. However, little work has been done in developing effective routing algorithms for WSNs with regular topologies, except routing along a shortest path with the knowledge of global location information of sensor nodes. In this paper, a new routing protocol based on random walk is proposed. It does not require global location information. It also achieves load balancing property inherently for WSNs which is difficult to achieve by other routing protocols. In the scenarios where the message required to be sent to the base station is in comparatively small size with the inquiry message among neighboring nodes, it is proved that the random walk routing protocol can guarantee high probability of successful transmission from the source to the base station with the same amount of energy consumption as the shortest path routing. Since in many applications of WSNs, sensor nodes often send only beep-like small messages to the base station to report their status, our proposed random walk routing is thus a viable scheme and can work very efficiently especially in these application scenarios. The random walk routing provides load balancing in the WSN as mentioned, however, the nodes near to the base station are inevitably under heavier burden than those far away from the base station. Therefore, a density-aware deployment scheme is further proposed to guarantee that the heavy-load nodes do not affect the network lifetime even if their energy is exhausted. The main idea is deploying sensors with different densities according to their distance to the base station. It will be shown in this paper that incorporating the random walk routing protocol with the density-aware deployment scheme can effectively prolong the network lifetime.

Location Information-Aided Task-Oriented Self-Organization of Ad-Hoc Sensor Systems

A novel task-oriented self-organization algorithm that accounts for mostly location-dependent tasks and heterogeneous sensors inherent in dense ad-hoc sensor systems is proposed. It forms a sensor group for an announced task by sequentially selecting the best matched sensors using a leader election algorithm and a residual task calculation algorithm. To improve the associated communication overhead, the sensor node location information is used in task broadcasting, thus confining the algorithm implementation to a dynamically maintained contributor group which comprises of those sensors which may contribute to the task. Sensor localization is based on a refinement of an algorithm in which utilizes only the neighborhood information of each sensor node corresponding to its each preset radio transmission power level. The proposed self-organization algorithm and how various system parameters affect its performance are examined via extensive simulations. In a densely deployed sensor system, when the refined localization scheme is demonstrated to achieve very good localization, the proposed self-organization algorithm consistently yields a sensor group that covers the announced task.