Mobile sink data acquisition method based on binary tree inquiry in wireless sensor network

Abstract

The invention relates to a mobile sink data acquisition method based on a binary tree inquiry in a wireless sensor network. The method comprises the steps of building a virtual regional binary tree system in a circular deployment area; calculating the serial number of the belonged area of nodes in a virtual regional binary tree according to geographic positions and building a neighbour node information sheet; moving a sink along the outmost periphery of the circular area, staying on each area of an outmost layer in the virtual regional binary tree system, broadcasting an Hello package to the same area and all father areas in a multi-hop way, notifying the position information of the sink, and naming the area for broadcasting the position information as a label area; when the data of the nodes is needed to be uploaded to the sink, inquiring the position information of the sink in the label area, and then transmitting data to the sink according to the position information of the sink stored in the label area. The energy consumed by broadcasting the position information in the whole network in the process of moving the sink can be saved, the standing time in the different areas is decided by the data volume generated in the network and the node positions for generating data packages, and the energy consumption of the nodes can be further balanced.

Description

technical field [0001] The invention belongs to the technical field of wireless sensor networks, and in particular the invention relates to a mobile sink data collection method based on binary tree query in a wireless sensor network. Background technique [0002] In recent years, remarkable developments have been made in micro-electromechanical systems, wireless communication technology and digital electronic technology, making the application of wireless sensor networks increasingly widespread. The wireless sensor network can be regarded as a network composed of multiple sensor nodes with wireless communication functions deployed in the monitoring area, and a sink that collects the monitoring data of these nodes and sends the data to the remote terminal. In traditional sensor networks, static sinks are generally used to collect network-wide data. This method is simple and direct, but there is a "hot spot" problem, which makes the energy consumption of nodes in the network u...

AI Technical Summary

Problems solved by technology

In P1, the nodes directly send data to the sink, which saves energy, and the algorithm is simple. However, in areas where nodes are densely distributed, sending data packets to the sink at the same time will cause conflicts. Therefore, a suitable MAC protocol is required, and the sink traverses the entire network. Long time leads to a large delay; compared with P1, P2 reduces the distance that sinks need to move to traverse the entire network and improves time efficiency, but at the same time increases node communication and calculation costs; P3 enables sinks to traverse all areas as soon as possible through probabilistic methods; P4 The medium sink has a small movement range and does not need to traverse the entire network, and the delay is small, but the node builds a routing tree and multi-hop routing consumes more energy

[0006] 3) The article "Some Fundamental Results on Base Station Movement Problem for Wireless Sensor Networks" published by Yi Shi and Y.Thomas Hou on "IEEE / ACM TRANSACTIONS ON NETWORKING" in 2012, obtained the optimal mobile sink through theory The stay points and the total stay time at these points to ensure that the network life reaches the optimal value (1-ε), where ε is an arbitrary value based on the required accuracy, and the algorithm only needs to ensure that the sink is at each point The total time of staying is fixed, and there is no limit to when and how long the sink will stay at any point. However, the article does not give the optimal path for the sink to traverse these points, and the calculation is complicated. When some parameters in the network change, it is necessary to recalculate the residence time. Point location and total dwell time

[0011] 1) In most data collection protocols based on mobile sinks, the sink moves to each station to broadcast its location information in a small area and collect the data of the nodes in the small area. This method will bring a large delay. It is not suitable for low-latency applications, and due to sensor hardware limitations, node memory overflow may cause a large amount of data loss;

[0012] 2) The sink needs to re-broadcast location information every time it reaches a new area, which consumes a lot of energy;

[0013] 3) At the critical moment when the sink leaves a certain area, the node will still transmit the data packet to the old location, and the processing of this boundary case will affect the data transmission rate of the network

Images