RELAY ALGORITHM BASED ON NETWORK CODING IN WIRELESS LOCAL NETWORK

The network coding is a new technology in the field of information in 21st century. It could enhance the network throughput and save the energy consumption, and is mainly based on the single transmission rate. However, with the development of wireless network and equipment, wireless local network MAC protocols have already supported the multi-rate transmission. This paper investigates the optimal relay selection problem based on network coding. Firstly, the problem is formulated as an optimization problem. Moreover, a relay algorithm based on network coding is proposed and the transmission time gain of our algorithm over the traditional relay algorithm is analyzed. Lastly, we compare total transmission time and the energy consumption of our proposed algorithm, Network Coding with Relay Assistance (NCRA), Transmission Request (TR), and the Direct Transmission (DT) without relay algorithm by adopting IEEE 802.11b. The simulation results demonstrate that our algorithm that improves the coding opportunity by the cooperation of the relay nodes leads to the transmission time decrease of up to 17% over the traditional relay algorithms.

无线传感器网络基于测距的节点定位算法综述OverviewoftheNodeLocalizationAlgorithmBasedonRangingofWirelessSensorNetworks

基于测距的定位方法对测量的距离信息运用几何知识求解未知节点的位置,常用在定位精度较高的领域,可在误差、能耗、受环境因素影响等方面进行优化。本文对基于测距的无线传感器网络节点定位算法进行详细地分析和比较。

A New Distributed Localization Scheme for Wireless Sensor Networks

在无线传感器网络(WSN ) 的节点本地化是被对待一功能目标在纸从一个新奇观点追踪双。与在 WSN 的传统的追踪问题不同，使用静态的地点商品节点估计动人的目标，活动节点被用来帮助未知节点精确地发现他们的位置。一个新节点本地化计划虚拟烽火精力比率本地化(VB-ERL ) 和它为 WSN 的精炼被介绍。在计划，活动节点基于 Gauss-Markov 活动性模型搬到监视者地并且周期性地广播信息包。每个静态的未知节点在它的察觉到的范围收到虚拟烽火和精力，并且由发现一套超球面的交叉估计它的地点。模拟结果证明建议计划是有效的。

Rigid graph-based three-dimension localization algorithm for wireless sensor networks

This paper investigates the node localization problem for wireless sensor networks in three-dimension space. A distributed localization algorithm is presented based on the rigid graph. Before location, the communication radius is adaptively increasing to add the localizability. The localization process includes three steps: firstly, divide the whole globally rigid graph into several small rigid blocks; secondly, set up the local coordinate systems and transform them to global coordinate system; finally, use the quadrilateration iteration technology to locate the nodes in the wireless sensor network. This algorithm has the advantages of low energy consumption, low computational complexity as well as high expandability and high localizability. Moreover, it can achieve the unique and accurate localization. Finally, some simulations are provided to demonstrate the effectiveness of the proposed algorithm.

MDS and Trilateration Based Localization in Wireless Sensor Network

Localization of sensor nodes is crucial in Wireless Sensor Network because of applications like surveillance, tracking, navigation etc. Various optimization techniques for localization have been proposed in literature by different researchers. In this paper, we propose a two phase hybrid approach for localization using Multidi- mensional Scaling and trilateration, namely, MDS with refinement using trilateration. Trilateration refines the estimated locations obtained by the MDS algorithm and hence acts as a post optimizer which improves the accuracy of the estimated positions of sensor nodes. Through extensive simulations, we have shown that the proposed algorithm is more robust to noise than previous approaches and provides higher accuracy for estimating the positions of sensor nodes.

Broadcasting with Controlled Redundancy and Improved Localization in Wireless Sensor Networks

Wireless sensor networks （WSNs） consist of sensor nodes that broadcast a message within a network. Efficient broadcasting is a key requirement in sensor networks and has been a focal point of research over the last few years. There are many challenging tasks in the network, including redundancy control and sensor node localization that mainly depend on broadcasting. In this paper, we propose a broadcasting algorithm to control redundancy and improve localization （BACRIL） in WSNs. The proposed algorithm incorporates the benefits of the gossip protocol for optimizing message broadcasting within the network. Simulation results show a controlled level of redundancy, which is up to 57.6% if the number of sensor nodes deployed in a 500 m×500 m area are increased from 50 to 500.

Analysis of Five Typical Localization Algorithms for Wireless Sensor Networks

In this paper, the self-localization problem is studied. It is one of the key technologies in wireless sensor networks (WSNs). And five localization algorithms: Centroid algorithm, Amorphous algorithm, DV-hop algorithm, APIT algorithm and Bounding Box algorithm are discussed. Simulation of those five localization algorithms is done by MATLAB. The simulation results show that the positioning error of Amorphous algorithm is the minimum. Considering economy and localization accuracy, the Amorphous algorithm can achieve the best localization performance under certain conditions.

Application of Wireless Local Area Network Technology in Mobile Robot for Finned Tube Inspection

This paper introduces a novel robot for outer surface inspection of boiler tubes. The paper describes the hardware system, wireless communication strategy, communication procedure and system software of the robot. The WLAN technology is used in the robot. It solves the problem of shielding generated by iron boiler and 11Mbps bandwidth made it possible for video and control stream real-time transmit within the same channel. Though TCP/IP protocol is robust, serial server is a transparent channel but cannot detect error and retransmit the data. In order to improve the reliability of serial communication, a new communication protocol is proposed. Key words boiler tubes - mobile robotics - wireless local area network Project Supported by the National High-Tech Program (Grant No. 2002AA420080)

A Three-Dimensional Range-Free Localization Algorithm Based on Mobile Beacons for Wireless Sensor Networks

In wireless sensor networks （WSNs） the position information of individual nodes is a matter of vital importance because allows the implementation of necessary network functions such as routing, querying and other applications. The objective of this paper is to propose an algorithm of three-dimensional distributed range-free localization for WSNs, using a mobile beacon （MB） equipped with a rotary and tilting directional antenna. This algorithm, denominated as the three-dimensional azimuthally defined area localization algorithm （3D- ADAL）, is executed in each sensor node and is based only on the analysis of the information received from the MB, therefore is energy efficient and contributes to extend the lifetime of the sensor network. Additionally the proposed algorithm has the advantage of being simple and economical. The simulation results show that the proposed algorithm is a practical, effective and accurate method for a three-dimensional location of sensor nodes in a WSN.

Research on the Teaching Reform of ＂Wireless Local Area Network＂ in the Background of＂Wireless Business Circle＂

This paper proposes the teaching reform of the ＂Wireless Local Area Network＂ in the background of ＂Wireless Business Circle＂ . At present, WLAN technology is becoming more and more mature, the application is then becoming more and more extensive, the campus network will grow rapidly on wireless LAN applications especially the research and higher education institutions on the wireless LAN demand is increasing with wireless LAN will have a very broad market development space. GIS business circle analysis model is to determine business enterprise location or expand their existing business outlets of information necessary to say on the map by G1S visual function of the model. This paper makes the combination of the mentioned items that will then and later influence the performance of the model.

A newself-localization method for wireless sensor networks

Many applications of wireless sensor networks can benefit from fine-grained localization. In this paper, we proposed an accurate, distributed localization method based on the time difference between radio signal and sound wave. In a trilateration, each node adaptively chooses a neighborhood of sensors and updates its position estimate with trilateration, and then passes this update to neighboring sensors. Application examples demonstrate that the proposed method is more robust and accurate in localizing node than the previous proposals and it can achieve comparable results using much fewer anchor nodes than the previous methods.

Hierarchical self-localization of underwater wireless sensor network nodes

The follow-up application of underwater wireless sensor network is influenced by accuracy of self-localization of nodes. The self-localization of nodes is discussed in this paper. First of all, nodes of underwater wireless sensor network are classified into several levels according to the accuracy of position of nodes and the levels are from the first to the fifth in accordance with accuracy of nodes from high to low respectively. Secondly, the level of anchor nodes can be known by those unknown nodes from the information given by the anchor nodes themselves, At the same time the unknown nodes are able to be located in the area controlled by the first level of anchor nodes that are as the aggregation. Then the positioning algorithm is designed correspondingly in accordance with the accuracy level of nodes. Finally, the positioning algorithm is simulated and analyzed. The result shows that the unknown nodes can be located effectively by hierarchical control.

Lightweight jammer localization algorithm in wireless sensor networks

In wireless sensor networks （WSNs）, as the shared nature of the wireless medium, jam- ming attacks can be easily launched and result in a great damage to the network. How to deal with jamming attacks has become a great concern recently. Finding the location of a jammer is important to take security actions against the jammer, and thus to restore the network communication. After a comprehensive study on the jammer localization problem, a lightweight easy-operated algorithm called triple circles localization （TCL） is proposed. The evaluation results have demonstrated that, compared with other approaches, TCL achieves the best jammer localization accuracy under variable conditions.

Robust Cubic-Based 3-D Localization for Wireless Sensor Networks

The rapid progress of wireless communication and the availability of many small-sized, light-weighted and low-cost communication and computing devices nowadays have greatly impacted the development of wireless sensor network. Localization using sensor network has attracted much attention for its comparable low-cost and potential use with mon- itoring and targeting purposes in real and hostile application scenarios. Currently, there are many available approaches to locating persons/things based on global positioning system (GPS) and radio-frequency identification (RFID) technologies. However, in some application scenario, e.g., disaster rescue application, such localization devices may be damaged and may not provide the location information of the survivors. The main goal of this paper is to design and develop a robust localization technique for human existence detection in case of disasters such as earthquake or fire. In this paper, we propose a 3-D localization technique based on the hop-count data collected from sensor anchors to estimate the location of the activated sensor mote in 3-D coordination. Our algorithm incorporates two salient features, cubic-based output and event-triggering mechanism, to guarantee both improved accuracy and power efficiency. Both simulation and experimental results indicate that the proposed algorithm can improve the localization precision of the human existence and work well in real environment.

Localized Coverage Connectivity Based on Shape and Area Using Mobile Sensor Robots in Wireless Sensor Networks

A wireless sensor network (WSN) is spatially distributing independent sensors to monitor physical and environmental characteristics such as temperature, sound, pressure and also provides different applications such as battlefield inspection and biological detection. The Constrained Motion and Sensor (CMS) Model represents the features and explain k-step reach ability testing to describe the states. The description and calculation based on CMS model does not solve the problem in mobile robots. The ADD framework based on monitoring radio measurements creates a threshold. But the methods are not effective in dynamic coverage of complex environment. In this paper, a Localized Coverage based on Shape and Area Detection (LCSAD) Framework is developed to increase the dynamic coverage using mobile robots. To facilitate the measurement in mobile robots, two algorithms are designed to identify the coverage area, (i.e.,) the area of a coverage hole or not. The two algorithms are Localized Geometric Voronoi Hexagon (LGVH) and Acquaintance Area Hexagon (AAH). LGVH senses all the shapes and it is simple to show all the boundary area nodes. AAH based algorithm simply takes directional information by locating the area of local and global convex points of coverage area. Both these algorithms are applied to WSN of random topologies. The simulation result shows that the proposed LCSAD framework attains minimal energy utilization, lesser waiting time, and also achieves higher scalability, throughput, delivery rate and 8% maximal coverage connectivity in sensor network compared to state-of-art works.

Grid-Based Localization Mechanism with Mobile Reference Node in Wireless Sensor Networks

Wireless sensor networks （WSNs） are based on monitoring or managing the sensing area by using the location information with sensor nodes. Most sensor nodes require hardware support or receive packets with location information to estimate their locations, which needs lots of time or costs. In this paper we proposed a localization mechanism using a mobile reference node （MRN） and trilateration in WSNs to reduce the energy consumption and location error. The simulation results demonstrate that the proposed mechanism can obtain more unknown nodes locations by the mobile reference node moving scheme and will decreases the energy consumption and average ocation error.

Real-time localization estimator of mobile node in wireless sensor networks based on extended Kalman filter

Localization of the sensor nodes is a key supporting technology in wireless sensor networks （WSNs）. In this paper, a real-time localization estimator of mobile node in WSNs based on extended Kalman filter （KF） is proposed. Mobile node movement model is analyzed and online sequential iterative method is used to compute location result. The detailed steps of mobile sensor node self-localization adopting extended Kalman filter （EKF） is designed. The simulation results show that the accuracy of the localization estimator scheme designed is better than those of maximum likelihood estimation （MLE） and traditional KF algorithm.

Range-Based Localization in Wireless Networks Using Density-Based Outlier Detection

Node localization is commonly employed in wireless networks. For example, it is used to improve routing and enhance security. Localization algorithms can be classified as range-free or range-based. Range-based algorithms use location metrics such as ToA, TDoA, RSS, and AoA to estimate the distance between two nodes. Proximity sensing between nodes is typically the basis for range-free algorithms. A tradeoff exists since range-based algorithms are more accurate but also more complex. However, in applications such as target tracking, localization accuracy is very important. In this paper, we propose a new range-based algorithm which is based on the density-based outlier detection algorithm (DBOD) from data mining. It requires selection of the K-nearest neighbours (KNN). DBOD assigns density values to each point used in the location estimation. The mean of these densities is calculated and those points having a density larger than the mean are kept as candidate points. Different performance measures are used to compare our approach with the linear least squares (LLS) and weighted linear least squares based on singular value decomposition (WLS-SVD) algorithms. It is shown that the proposed algorithm performs better than these algorithms even when the anchor geometry about an unlocalized node is poor.

New Localization Technique for Mobile Wireless Sensor Networks Using Sectorized Antenna

Recently, there has been much focus on mobile sensor networks, and we have even seen the development of small-profile sensing devices that are able to control their own movement. Although it has been shown that mobility alleviates several issues relating to sensor network coverage and connectivity, many challenges remain. Among these, the need for position estimation is perhaps the most important. It is too expensive to include a GPS receiver with every sensor node. Hence, localization schemes for sensor networks typically use a small number of seed nodes that know their location and protocols whereby other sensor nodes estimate their location from the messages they receive. In this paper, we propose a new technique to localize mobile sensor nodes using sectorized antenna. We consider that both sensor nodes and seeds are mobile, and argue that mobility can be exploited to improve the accuracy and precision of localization. It is tested extensively in a simulation environment and compared with other existing methods. The results of our experiments clearly indicate that our proposed approach can achieve a high accuracy without need of high density of seeds.

Cooperative Nodes Localization for Three-Dimensional Underwater Wireless Sensor Network Based on Weighted Centroid Localization Algorithm

The underwater wireless sensor network(UWSN) has the features of mobility by drifting,less beacon nodes,longer time for localization and more energy consumption than the terrestrial sensor networks,which makes it more difficult to locate the nodes in marine environment.Aiming at the characteristics of UWSN,a kind of cooperative range-free localization method based on weighted centroid localization(WCL) algorithm for three-dimensional UWSN is proposed.The algorithm assigns the cooperative weights for the beacon nodes according to the received acoustic signal strength,and uses the located unknown nodes as the new beacon nodes to locate the other unknown nodes,so a fast localization can be achieved for the whole sensor networks.Simulation results indicate this method has higher localization accuracy than the centroid localization algorithm,and it needs less beacon nodes and achieves higher rate of effective localization.