Communication Radius Research Articles

An APIT Algorithm Based on DV-HOP Multi-Hop

Aiming at misjudgment formed by PIT (Point-In-triangulation Test) and position failure formed by edge effect in APIT algorithm, this paper introduces a multi-hop mechanism of DV-HOP algorithm and presents an APIT algorithm of based on DV-HOP multi-hop mechanism (AHMH-APIT). The AHMH-APIT algorithm uses DV-HOP multi-hop to compensate edge effect and anchor circle intersection region to replace triangulation, and uses weighted method to calculate the regional centroid. The paper simulated the AHMH-APIT algorithm by Matlab .The simulation result shows that, in the case of nodes being randomly distributed, compared with the APIT, all nodes can be positioned. Even if the number of anchor nodes and the communication radius is relatively small, unknown nodes can be positioned. And then the AHMH-APIT algorithm reduces average localization error and energy cost of communication.

The Application Research of Multi-hop 3D AOA with Space-based Angle Transmission Localization Algorithm in Terrain Modeling

Node’s localization is a key technology in Wireless Sensor Networks. There are only quite a few studies on 3D localization which is suffered in slow progress, actually, is one of the main difficulties in WSN localization. Based on the study of the application of terrain modeling, localization algorithm for sensor nodes in 3D condition has been focus on as well as the application of terrain model. The paper proposed a new algorithm named Multi-hop 3D AOA With Space-based Angle Transmission, and then combined the new algorithm with Delaunay triangulation algorithm for terrain modeling. The results of simulation have shown that as the ratio of beacon nodes and their communication radius changes, the algorithm’s localization error rate range from 7% to 27%, and has a good terrain modeling accuracy, range from 59% to 98%.

Optimal Locating of Misbehavior Node in Wireless Sensor Network

In the application scene of the wireless sensor network, the distribution of nodes in the ideal case should be symmetrical. Each beacon node can help unknown nodes to locate. However, in the actual application environment, uneven distribution of nodes and irregular radius of node communication exist which lead to some unknown nodes that can not be achieved positioning. Based on the above problems, such nodes will be positioning analyzed and solutions are proposed to improve the precision and coverage of the network node positioning.

An Improved DV-HOP on Weighted and Distributed Calculation Method

In DV-HOP algorithm, the average one-hop distance is calculated by using the centralized calculation and broken line replacing straight line method. Thismethod causeslocalization errors.In view of the localization errors,we propose an improved DV-HOP on weighted and distributed calculation method (WD-DVHOP) in this paper. In the WD-DVHOP, we replace the centralized and distributed calculation method by a weighted calculation method.The distance between unknown nodes and anchor nodes is calculated by a method, which the average one-hop distance of each anchor node multiplies by hops count between unknown nodes and anchor node.Simulation result shows that average localization error is reduced in the WD-DVHOP, in case of less anchor nodes and smaller communication radius.

An Efficient Clustering Protocol for Wireless Sensor Networks Based on Localized Game Theoretical Approach

Game theory has emerged as a brand new approach to model and analyse several problems of wireless sensor networks, such as routing, data collection, and topology control. Recently, a novel clustering mechanism called clustered routing for selfish sensors (CROSS) has been proposed based on game theory. The sensor nodes, which are modelled as players, join in a clustering game to campaign for cluster heads with an equilibrium probability. However, the CROSS algorithm needs the global information of how many nodes participate in the game at every round. Considering that this global way introduces much more packets exchange and energy consumption, we present a Localized game theoretical clustering algorithm (LGCA). In our protocol, each node selfishly plays a localized clustering game only with its neighbours within a communication radius [Formula: see text]. Moreover, exactly one node can successfully bid for a position of the cluster head in one district, thus achieving an optimal payoff. Simulation results show that our method achieves a better result compared with CROSS and LEACH in terms of network lifetime.

Robot Flocking Control with Part Information of the Virtual Leader

Under virtual leader-follower model, when all robots can receive the information of the virtual leader, the robot flocking algorithm can avoid diverging. For time-delay, noise and network congestion in the communication, in the fact, only part robots can receive the information of the virtual leader. In the paper, we analyze the performance of robot flocking control algorithm with part information of the virtual leader. We analyze the impact brought by the parameters on the robot flocking control when only part robots can receive the information of the virtual leader, and simulations are done. Results show that the performance of distributed robot flocking algorithm depends on the probability of robot receiving the information of the virtual leader, the communication radius among robots, and density of robot and so on.

A Refined Concentric Anchor-Beacons Location Algorithm for Wireless Sensor Networks Based on Received Signal Strength Indicator

As the development of technology, the wireless sensor networks (WSN) have a wide spread usage. And people pay more attention on the localization algorithm, as the key technology of WSN, there have been many method of self-localization. The concentric anchor-beacons (CAB) location algorithm is one of the most practical one, which is a range-free WSN localization algorithm. In order to further improve the accuracy of localizing nodes, an improved CAB location algorithm base on Received Signal Strength Indicator (RSSI) is proposed. The RSSI is used to measure the distance between two anchors and compare with the practical distance. Then the environment between two anchors can be simulated. At last the communication radius of anchors can be optimized. And the common area of the anchors in the process of localizing nodes can be reduced. Then the accuracy is improved. By simulation, the localization accuracy is improved when the anchors numbers is more than a certain percentage.

A Region Localization Algorithm Based on Anchors within Two Hops for Wireless Sensor Networks

Localization is a fundamental and essential issue for wireless sensor networks (WSNs). In this paper, we present a range-free region localization (RFRL) algorithm for static WSNs, in which each unknown node collects the location information of anchors within its two-hop distance, and then some location information of its one-hop anchors and two-hop anchors are chosen to implement a grid-scan algorithm. Analysis and simulation results show that our algorithm outperforms the other Grid-Scan schemes even when the communication radius is irregular.

Maximizing network lifetime in wireless sensor networks with regular topologies

Limited energy supply (battery-powered) is a crucial problem in wireless sensor networks (WSNs). Sensor node placement schemes and routing protocols are mostly proposed to address this problem. In this paper, we first present how to place sensor nodes by use of a minimal number of them to maximize the coverage area when the communication radius of the sensor node is different from the sensing radius, which results in the application of regular topology to WSNs deployment. With nodes placed at an equal distance and equipped with an equal power supply, the problem of unbalanced energy consumption in 2-D regular topologies becomes more severe and much more difficult to tackle than that in 1-D chains, though the latter is known as an already quite hard problem. We address this problem and propose an adaptive data collection scheme by employing different communication radii for nodes in different locations to balance the energy consumption in WSNs. In order to achieve the ultimate goal of maximizing network lifetime in grid-based WSNs, we give a mathematical formulation, which shows the problem of maximizing network lifetime is a nonlinear programming problem and NP-hard even in the 1-D case. We discuss several heuristic solutions and show that the halving shift data collection scheme is the best solution among them. We also generalize the maximizing network lifetime problem to the randomly-deployed WSNs, which shows the significance of our mathematical formulation for this crucial problem in WSNs.

Wireless Sensor Network Node Deployment Method for Soil Salinization Monitoring

Soil salinization is one form of soil degradation. In this paper, the formation of physical topology known as node deployment in wireless sensor networks is studied based on the characteristics of wireless sensor networks. After calculating the value of the edge length of the grid, the minimum number nodes achieved according to the relationship between the radius of node sensing and radius of node communication. For data transmission, a mobile sink energy efficient routing algorithm based on the shortest path was applied to reduce the energy consumption.

Improvement on localization precision and positioning rate in Grid-Scan algorithm

Concerning the poor positioning rate and localization precision of Grid-Scan algorithm,an improved Grid-Scan localization algorithm based on virtual beacon nodes was proposed.Three related works were mentioned as follows: Firstly,the unknown nodes which have neighbor beacon nodes located themselves by using the beacon nodes,and the located unknown nodes were upgraded to virtual beacon nodes.Secondly,the unknown nodes that do not have neighbor beacon nodes got their location through virtual beacon nodes.Finally,different communication radiuses were set between beacon nodes,virtual beacon nodes and unknown nodes to scan in order to accomplish the localization.The simulation results show that the improved algorithm's positioning accuracy and positioning rate increase by 6.35% and 23.37% on average respectively.

Virus spreading in wireless sensor networks with a medium access control mechanism

In this paper, an extended version of standard susceptible-infected (SI) model is proposed to consider the influence of a medium access control mechanism on virus spreading in wireless sensor networks. Theoretical analysis shows that the medium access control mechanism obviously reduces the density of infected nodes in the networks, which has been ignored in previous studies. It is also found that by increasing the network node density or node communication radius greatly increases the number of infected nodes. The theoretical results are confirmed by numerical simulations.

Scale-free topology evolution for wireless sensor networks

Robustness is an important issue in Wireless Sensor Networks (WSNs). In this paper, two topology evolution models based on complex network theory are proposed. A bayesian game clustering algorithm is used to achieve a uniform clustering, and topology evolution is executed among cluster heads according to random walk. Residual energy, node fitness, node saturation and communication radius are considered in the processes of topology evolution. Simulation results show that network topologies formed by the models are more in line with the practical application of WSNs and have a good robustness in harsh environment.

The Method of the Global Positioning Based on RSSI

A novel Global Positioning Algorithm for Workers in Underground Coal Mine Based on RSSI (Received Signal Strength Indication) is proposed and implemented. The innovation of the algorithm is the RSSI optimization and GIS auxiliary positioning. The RSSI optimization can reduces the error caused when the blind code is too closed to the reference node, and GIS auxiliary positioning is to solve the problem that the number of the reference codes in the communication radius of blind code is less than three. Experimental Results Indicate that Global positioning algorithm has the average vertical positioning error less than 4m, the horizontal error less than 1/2 roadway width, and the positioning cycle less than 1s, with better positioning and tracking performance, and expands the coverage of the network of underground positioning.

Epidemic theory and data survivability in unattended wireless sensor networks: Models and gaps

Information survivability is the capability of a system to fulfill its mission, in a timely manner, and even in the presence of attacks, failures, or accidents. In this paper, we provide a preliminary assessment of epidemic-domain inspired approaches to model the information survivability in UWSNs. In particular, we show that epidemic models can be used to devise solutions enabling the information to survive, once the maximal compromising power of an attacker is estimated. However, we also point out that the mere application of these models is not always the right choice. Indeed, our results show that these deterministic models are not accurate enough, and “unlikely” events—usually met when striving to optimize resource usage—can cause the loss of the datum; furthermore, we highlight that when translating these models into real applications, geometric constraints (such as communication radius and deployment area) can hinder the applicability of epidemic models. We propose a simple but effective solution to these issues. Finally, extensive simulations support our results.

A Novel Wireless Sensor Network Model Based on Complex Network Theory

The key issue of wireless sensor networks is to balance the energy costs of the entire network, to enhance the robustness of the entire sensor network. Sensor networks as a special kind of complex network, in particular, environmental constraints, and more from the traditional complex networks, such as Internet networks, ecological networks, social networks, is to introduce a way of wireless sensor networks way of complex networks theory and analytical method, the key lies in, which is a successful model of complex network theory and analysis methods, more suitable for the application of wireless sensor networks, in order to achieve certain characteristics of some wireless sensor networks to optimize the network. Considering multi-hop transmission of sensor network, this paper has proposed a maximum restriction on the communication radius of each sensor node; in order to improve the efficiency of energy consumption and maintain the sparsely of the entire network, this paper has also added a minimum restriction on the communication radius of each sensor node to the improved model; to balance the energy consumption of the entire network, The simulation results show that proposed improvements to the entire network more robust to random failure and energy costs are more balanced and reasonable. This is more applicable to wireless sensor networks.

빌딩 자동화 및 홈 센서 네트워크에서 에너지 효율적이고 실용적인 듀티사이클링 메커니즘

본 논문에서는 이론과 실제 현상의 차이를 보이기 위해 우선 테스트베드 센서 네트워크에서 이론에 기반한 이웃 노드 집합과 실제 연결 설정된 이웃 노드 집합의 차이의 결과를 보인다. 이러한 결과는 이론적 통신 반경에 근거한 관리 메커니즘들(예, 듀티사이클링, 라우팅, 애그리게이션 등)이 의도한 성능을 얻지 못할 가능성을 시사해 준다. 본 논문에서는 에너지 효율성을 고려하여 실제 이웃 노드 집합에 기반한 실용적인 듀티사이클링 메커니즘을 제안한다. 이 메커니즘은 각 존(의도되어 분할된 네트워크의 일부 영역)에서 특정 임계치 내의 유사성을 가진 센싱값들의 중복 전송을 억제한다. 실제 센서 데이터를 이용한 시뮬레이션을 통하여 제안한 메커니즘이 중요 센싱값의 전송을 보장하며, 네트워크 라이프타임을 증가시킴을 보인다. In order to show the gap between theory and practice, this paper first gives some experimental results for theoretical and real neighbor sets on a test-bed sensor network. The results prove that existing management protocols (e.g., duty-cycling, routing or aggregation) based on the theoretical communication radius cannot achieve their original goal, efficiency. In this paper, we present a practical duty-cycling mechanism based on the real neighbor set, allowing for energy-efficiency. It also guarantees to suppress duplicated transmissions of sensing values with similarity within a specific threshold in each zone (i.e., a portion of intended divided network). Simulation results performed with a set of real sensor data show that our mechanism increases the network life time while guaranteeing the transmission of necessary sensing values.

Minimizing interference in ad hoc networks with bounded communication radius

We consider a topology control problem in which we are given a set of sensors in Rd and we would like to assign a communication radius to each of them so that they generate a connected network and have low receiver-based interference (defined as the largest in-degree of the network). We show that any radii assignment that generates a connected network can be modified so that interference is (asymptotically) unaffected and no sensor is assigned communication radius larger than Rmin, where Rmin is the smallest possible radius needed to obtain strong connectivity. Combining this result with the previous network construction methods (see Halldórsson and Tokuyama (2008) [7] and von Rickenbach et al. (2009) [11]), we obtain a way to construct a connected network of low interference and bounded radii. Since the radius of a sensor is only affected by neighboring sensors, this construction can be done in a distributed fashion.

Connectivity Preserving Flocking without Velocity Measurement

AbstractIn this paper, we address the design of a decentralized controller for connectivity‐preserving flocking, where each agent only can access to the position information of the agents within its sensing zone. An output vector, based on the position information alone, is constructed to replace the role of velocity, and some bounded attractive and repulsive forces are integrated together to design the controller. We prove that the controller not only synchronizes all agents in a stable formation, but also enables collision avoidance and connectivity preserving all of the time, when the initial condition meets certain requirements. Moreover, a leader‐follower method is used to guide the group to a desired direction, where the followers can sense the leader only if the distance between them is less than the communication radius.

Research on fiber-grating-based wireless sensor networks

A 20-node fiber-grating-based wireless sensor network is proposed and experimentally demonstrated. Each sensor node is integrated with the light source, 1–3 FBG sensing probes, wavelength demodulation, and wireless communication module. Via self-organized clusters and low energy adaptive clustering hierarchy (LEACH) route protocols, the sensor nodes are able to exchange sensing data with the control center, and the maximum communication radius of a sensor node is over 170 m. The sensor node is battery-powered with a survival lifetime of up to 120 days at a network refresh rate of 5 minutes.