Position Information Of Nodes Research Articles

Enabling accurate range free localization for mo-bile sensor networks

The Existing localization algorithm was Sequential Monte Carlo (SMC) method for mobile sensor networks. In this paper, we propose an energy efficient algorithm called novel localization, which can achieve high localization in a better way. In existing algorithm, high Localization is achieved by getting more number of beacon nodes as input which improves the computational cost and decreases the sampling efficiency to a higher rate. But in the Proposed algorithm, we achieve high Localization accuracy with less number of beacon nodes itself thus the computational cost will be less and the sampling efficiency will be high. Our algorithm uses the approximate calculated position information of sensor nodes to increase the localization accuracy. The existing algorithms doesn’t have high localization accuracy when nodes move very fast, so we have propose a new algorithm, novel localization which is executed based on spped of nodes. The novel algorithm improves the Localization accuracy also when the node move fast.

ROSE: Robustness Strategy for Scale-Free Wireless Sensor Networks

Due to the recent proliferation of cyber-attacks, improving the robustness of wireless sensor networks (WSNs), so that they can withstand node failures has become a critical issue. Scale-free WSNs are important, because they tolerate random attacks very well; however, they can be vulnerable to malicious attacks, which particularly target certain important nodes. To address this shortcoming, this paper first presents a new modeling strategy to generate scale-free network topologies, which considers the constraints in WSNs, such as the communication range and the threshold on the maximum node degree. Then, ROSE, a novel robustness enhancing algorithm for scale-free WSNs, is proposed. Given a scale-free topology, ROSE exploits the position and degree information of nodes to rearrange the edges to resemble an onion-like structure, which has been proven to be robust against malicious attacks. Meanwhile, ROSE keeps the degree of each node in the topology unchanged such that the resulting topology remains scale-free. The extensive experimental results verify that our new modeling strategy indeed generates scale-free network topologies for WSNs, and ROSE can significantly improve the robustness of the network topologies generated by our modeling strategy. Moreover, we compare ROSE with two existing robustness enhancing algorithms, showing that ROSE outperforms both.

Research on Secure Localization Model Based on Trust Valuation in Wireless Sensor Networks

Secure localization has become very important in wireless sensor networks. However, the conventional secure localization algorithms used in wireless sensor networks cannot deal with internal attacks and cannot identify malicious nodes. In this paper, a localization based on trust valuation, which can overcome a various attack types, such as spoofing attacks and Sybil attacks, is presented. The trust valuation is obtained via selection of the property set, which includes estimated distance, localization performance, position information of beacon nodes, and transmission time, and discussion of the threshold in the property set. In addition, the robustness of the proposed model is verified by analysis of attack intensity, localization error, and trust relationship for three typical scenes. The experimental results have shown that the proposed model is superior to the traditional secure localization models in terms of malicious nodes identification and performance improvement.

Advanced flooding-based routing protocols for underwater sensor networks

Flooding-based protocols are a reliable solution to deliver packets in underwater sensor networks. However, these protocols potentially involve all the nodes in the forwarding process. Thus, the performance and energy efficiency are not optimal. In this work, we propose some advances of a flooding-based protocol with the goal to improve the performance and the energy efficiency. The first idea considers the node position information in order to reduce the number of relays that may apply flooding. Second, a network coding-based protocol is proposed in order to make a better use of the duplicates. With network coding, each node in the network recombines a certain number of packets into one or more output packets. This may give good results in flooding-based protocols considering the high amount of packets that are flooded in the network. Finally, a fusion of both ideas is considered in order to exploit the benefits of both of them.

EGL: Efficient Geometry-based Localization in Wireless Sensor Networks

Localisation of sensor nodes deployed randomly is one of the most challenging issues in wireless sensor networks. Position information of nodes helps in effective coverage, routing, data collection, target tracking, and event detection. This paper describes a localisation scheme where an unmanned aerial vehicle (UAV) equipped with a global positioning system (GPS) unit scans the sensing field while periodically broadcasting its current position. The sensor nodes estimate three boundary points on its communication circle and then, using simple geometry rules, estimate their location. The scheme neither requires extra hardware nor any interaction for ordinary sensor nodes with their neighbours. Several enhancements, including detection and correction of boundary points errors, are explained. This scheme is accurate and efficient enough to tolerate obstacles in the sensing field. Simulation results show that localisation accuracy can be adjusted by properly selecting UAV speed and beacon interval along with the UAV scan pattern.

DSearching: Using Floating Mobility Information for Distributed Node Searching in DTNs

In delay tolerant networks (DTNs), enabling a mobile node to search and find another interested mobile node is an important function in many applications. However, the movement of nodes in DTNs makes the problem formidable. Current node searching methods in disconnected networks mainly rely on fixed stations in the network and infrastructure-based communication to collect node position information, which is difficult to implement in DTNs. In this paper, we present DSearching, a distributed mobile node searching scheme for DTNs that requires no infrastructure. In DSearching, the entire DTN area is split into sub-areas, and each node summarizes its mobility information as both transient sub-area visiting record and long-term movement pattern. Upon arriving at a sub-area, a node generates a new visiting record for the sub-area and distributes it to nodes that are likely to stay in the previous sub-area, so that visiting records form a chain for the locators to trace the node. Each node also stores different parts of its long-term mobility pattern to long-staying nodes in different sub-areas for others to trace it when visiting records are absent. Considering that nodes in DTNs usually have limited resources, DSearching constrains the communication and storage cost in the information distribution while enabling efficient node searching. Advanced extensions that can further improve the searching efficiency is also proposed in this paper. Extensive trace-driven experiments with real traces demonstrate the high efficiency and high effectiveness of DSearching.

An Improved DV-Hop Algorithm Based on Shuffled Frog Leaping Algorithm

According to that node localization accuracy is not high in the DV Hop localization algorithm, shuffled frog leaping algorithm with many advantages such as the convergence speed is fast, easy to realize and excellent performance of global optimization and so on is introduced into the design of DV-Hop algorithm. A new DV-Hop algorithm based on shuffled frog leaping algorithm (Shuffled Frog Leaping DV-Hop Algorithm, SF LA DV-Hop) is proposed in this paper. Based on traditional DV-Hop algorithm, the new algorithm used distance of nodes and position information of anchor nodes to establish objective optimization function and realize the estimation of unknown node coordinate in the final stage of DV-Hop algorithm. The simulation results showed that compared with the traditional DV-Hop algorithm, based on not increasing the sensor node hardware overhead, the improved algorithm can effectively reduce the positioning error.

Results and Performance Analysis of Local Broadcast Algorithms in Wireless Ad hoc Networks: Reducing the Number of Transmissions

Among Many fundamental communication primitives in wireless ad hoc network, flooding in wireless ad hoc network reduces the number of transmission in network and it plays a significant role in which every node transmits the message after receiving it for the first time. To successfully reducing the number of transmissions of broadcast that are required to achieve full delivery and constant approximation to the optimum solution without using exact position information of node. This paper presents two main approaches such as static and dynamic to broadcast algorithm in wireless ad hoc network. In static approach node status depends on local topology and priority function of node using this approach it can’t guarantee both full delivery and constant approximation if node exact position information isn’t available. On other hand in dynamic approach if node exact position information is available or not they can achieve both full delivery and constant approximation to their optimum solution using their partial 2-hop hybrid algorithm.

Multiple feature points representation in target localization of wireless visual sensor networks

This paper discusses the target localization problem in wireless visual sensor networks. Additive noises and measurement errors will affect the accuracy of target localization when the visual nodes are equipped with low-resolution cameras. In the goal of improving the accuracy of target localization without prior knowledge of the target, each node extracts multiple feature points from images to represent the target at the sensor node level. A statistical method is presented to match the most correlated feature point pair for merging the position information of different sensor nodes at the base station. Besides, in the case that more than one target exists in the field of interest, a scheme for locating multiple targets is provided. Simulation results show that, our proposed method has desirable performance in improving the accuracy of locating single target or multiple targets. Results also show that the proposed method has a better trade-off between camera node usage and localization accuracy.

Wireless Sensor Network Aided Cognitive Femtocell Networks

Abstract The radio spectrum is underutilized and salient application of cognitive radio (CR) is to capitalize the spectrum resources more effectively by opportunistically utilizing radio spectrum not utilized by primary networks, referred to as spectrum holes. When facilited by a sensor network, the cognitive femtocell will be able to use frequencies other than the macrocell network and also, enhance its power to cover macrocell edge areas. The foremost objectives of the wireless sensor network routing protocol design are stabilized network energy consumption and extending the entire network lifespan. In this paper, we analyze the effectiveness of Low Energy Adaptive Clustering Hierarchy (LEACH) protocol in cluster-head selection. It takes node's residual energy and position information into account, the selection method of the threshold for electing cluster-head is optimized, normal nodes select the optimal cluster-head based on the cost function which improves optimal cluster-head selection strategy. Finally, the effectiveness of the scheme is verified by extensive matlab simulation.

A Routing Protocol for Delay-tolerant Networks

Epidemic algorithm improves the delivery rate by generating a large number of copies of the message. It is easy to implement and obtain high delivery rate. However, DTN network is usually memory-and-bandwidth-limited. The copy and distribution of message without limitation lead to the decrease in network performance. The proposed ANEpidemic algorithm reduces the invalid replication of message by utilizing position and angle information of relay nodes. Simulation results show that the proposed algorithm has a better performance in delivery rate and end-to-end delay.

Dynamic packet beaconing for GPSR mobile ad hoc position-based routing protocol using fuzzy logic

Greedy perimeter stateless routing (GPSR) is a well-known position-based routing protocol in mobile ad hoc network (MANET). In GPSR, nodes use periodic beaconing (PB) strategy in broadcasting beacon packets to maintain up-to-date information on the geographical position of their neighbor nodes within their transmission boundary range. The nodes that receive beacon packets save all known neighbor nodes, along with their geographical position information, in their neighbor list to make effective routing decisions. Most recent studies on position-based routing protocols assume that the position information in the neighbor list of a node is accurate, although only a rough estimate of such position information is actually available to the node. Node mobility causes frequent network topology changes in MANETs. Thus, neighbor-to-neighbor relationships change frequently. Using the PB strategy leads to inaccurate node position information in the neighbor list of a node. In addition, it may cause the routing protocol to make suboptimal decisions and not route packets through the best-located neighbor within the transmission range of the node. This study presents an analysis of the influence of position information inaccuracy caused by network parameters such as beacon packet interval time (BPIT) and node moving speed (NMS) on the performance of GPSR position-based routing protocols. To overcome the effect of position information inaccuracy in the neighbor list of a node, we proposed a fuzzy logic dynamic beaconing (FLDB) strategy to improve the reliability of the neighbor list of a node by optimizing time between transmissions of beacon packets in position-based routing protocols. Optimization is based on the correlation between NMS, number of neighboring nodes (NoNNs) and BPIT using fuzzy logic control (FLC) mechanism. The simulation experiment shows the effectiveness of the FLC mechanism in improving overall performance of GPSR position-based routing protocol in terms of beacon packet control overhead, end-to-end delay, non-optimal hop, and false node position.

A Fuzzy Logical Based WSN Node Self-Locating Means

A WSN (Wireless Sensor Network) node self-locating means which utilized the position information of anchor nodes is proposed in this paper. There are two types of nodes in the objective network of the means. The first type is the anchor node that equipped GPS (Global Position System) unit, their exact position can be gained. The second type is normal node that supports RSS (Received Signal Strength) based ranging. With the help of anchor node, the normal nodes fulfill a low complexity, coarse-grained, RSS ranging based fuzzy logical locating algorithm, to determine their own positions. Theoretical analysis showed that, the proposed means can provide fine location accuracy with a relative low cost and complexity.

Wireless Sensor Network Achieved by Automatic Positioning System Node

In application of wireless sensor network, the position information of sensor node is crucial within life cycle in the whole network. In order to design algorithm of node positioning with high-efficiency, high-precision and low-consumption, this paper puts forward using the encryption algorithm of space control node originally applied in field of engineering measurement, by using SDI algorithm ( space and distance intersection algorithm) as three-dimensional position algorithm used in system to achieve threedimensional automatic positioning calculation of distributed nodes. Test proves that this kind of algorithm has better positioning nature and higher precision; it is used as threedimensional positioning because it has good engineering application value.

Target Localization Based on Improved DV-Hop Algorithm in Wireless Sensor Networks

The node localization technology of wireless sensor networks is essential and prerequisite to many applications, which it is one of the important support technologies for wireless sensor networks. The node localization is to get the position information of blind node by using location information of few known nodes and some special mechanisms. This paper primarily investigates a kind of target localization technology based on the improved DV-Hop algorithm in wireless sensor networks. We firstly compute the distances measured by RSSI and the mean value of one-hop distance. Then we can use the differences between the mean and the actual distance to get the error correction between the total distance and average one-hop distance. Replace trilateration with hybrid localization of MIN-MAX and weighted least square method. Finally, simulation experiment results show the improved algorithm can effectively carry out the network localization, thus has a certain of practical value

Effect of mobility parameters on the inaccuracy of the position information of position-based MANET routing

Position-based routing protocols have become increasingly popular in mobile ad-hoc networks because they can use geographical node position information to route data packets to their destinations. Each node periodically sends its geographical position information to its neighbours by using beacon packets. Data packet routing in position-based routing protocols uses the neighbours' position information that is stored in the node's neighbour list to route the data packet from the source to the destination. Most recent studies on position-based routing protocols assume that the position information in the node's neighbour list is accurate, although only a rough estimate of this position information is actually available to the nodes. In general, inaccuracy occurs when inaccurate geographical position information is used. This study presents an analysis and a simulation to examine the influence of position information inaccuracy caused by beacon packet interval-time and node speed mobility parameters on the performance of position-based routing protocols.

Grid-Based Cluster Head Selection Algorithm in Wireless Sensor Networks

Although low-energy adaptive clustering hierarchy (LEACH) protocol adopts distributed clustering algorithm and randomized rotation of Cluster Heads (CHs) mechanism to reduce energy consumption, election of CHs without residual energy and position information of each nodes brings about irregular distribution of CH, low network coverage and short lifecycle. In order to avoid these shortcomings, a Grid-based Cluster Head Selection (GCHS) is proposed. Referring to sensing distance, network is divided into several grids equivalent to independent clusters which can meet network coverage and connectivity. Furthermore, CH is selected ground on residual energy level of each node. Simulation taking full advantage of concept mentioned above manifests that it achieves a significant improvement in network coverage and lifecycle.

A modified sectoral sweeper-based localization estimation and its implementation in a multi-hop wireless sensor networking environment by using OPNET

In wireless sensor networks, location awareness along with the sensed data is important for most of the applications. Although there are many localization techniques in the literature, some of these techniques involve tiny sensor nodes, which need to be computationally powerful and complex in hardware to estimate their locations. This paper proposes a modified sectoral sweeper-based localization estimation (M-SSLE) method, which is the improved version of our previously studied SSLE method, to achieve position information of sensor nodes. This technique requires only a central node having a smart antenna capability to estimate locations of sensor nodes and simplified message formats. Using the SSLE technique, the computational burden for location estimation is carried out by a central node and no hardware or software modification to tiny sensor devices is required. The M-SSLE is implemented using an OPNET modeler for realistic fading channel conditions. The detailed implementation methodology in OPNET is presented in terms of node and process models. The performance of the M-SSLE method is evaluated through different network scenarios and channel parameters in terms of localization error, average throughput, and node energy consumption. Furthermore, its localization performance is compared with the SSLE and Cramér Rao Bound methods in the two different scenarios for the deployment of the sensor nodes. The M-SSLE average localization errors of 4.3 and 8.9 m are demonstrated under the log-distance and the log-normal shadowing channel conditions in a 250 m × 250 m area, respectively.

A Location Predicting Method for Indoor Mobile Target Localization in Wireless Sensor Networks

Node position information is one of the important issues in many wireless sensor networks' usages. In this paper, based on path planning, a location predicting method (PPLP) for indoor mobile target localization is proposed. We first establish the path planning model to constrain the movement trajectory of the mobile target in indoor environment according to indoor architectural pattern. Then, one certain localization result can be obtained using MLE algorithm. After that, based on the path-planning model and some previous localization results, the most likely position of the target in the next time interval can be predicted with the proposed predicting approach. Finally, the MLE result and prediction result are weighted to obtain the final position. The simulation results demonstrate the effectiveness of the proposed algorithm.

ARRP: Azimuth Restricted Routing Protocol for Ad Hoc Networks

Hoc Networks consists of set of mobile nodes forming spontaneous network. There is a need for an efficient routing protocol for Ad Hoc networks over the years. Bandwidth utilization and node power consumption are two important factors in wireless transmissions. This paper presents simulation model of new routing protocol ARRP (Azimuth Restricted Routing Protocol). ARRP uses position information of nodes and azimuth angle to define a range to restrict the broadcast of RREQ packets rather than flooding the entire network. This will reduce routing overhead in route discovery phase, saving wireless bandwidth and node power. Simulation of this protocol is done using Network Simulator 2.