A Serpentine Time Slot Storage Method
A time-slot and serpentine technology, applied in the field of serpentine time-slot storage, can solve communication bottlenecks, do not consider data storage and query energy costs, etc.
Inactive Publication Date: 2018-06-05
TIANJIN POLYTECHNIC UNIV
View PDF2 Cites 0 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
In the GHT method, there is only one storage node for each type of event, which will cause communication bottlenecks and hotspots; there may be no nodes at the hash position obtained by the hash function; the energy consumption in the process of data storage and query is not considered
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0031]Adopt Matlab platform, the present invention is implemented, and concrete process is as follows:
[0032] (1) Network division: Assume that 100 nodes are randomly deployed in an area of 200m*200m, with the Sink node as the apex and 90 / 6 as the angle, divide the network area into n (variable) fan-shaped areas. On the premise that each priority event is evenly distributed, compare the network life cycle of the serpentine time slot storage method when n is from 1 to 8, as shown in Figure 7 shown. Depend on Figure 7 It can be seen that when n=6, the network life cycle of the serpentine time slot storage method is the longest, and when the optimal number of divisions is taken, the system overhead can be effectively reduced. In the experiment, the optimal sector number (n) is selected as 6, and then the area is divided according to the circumferential spacing of 50m to form a grid area.
[0033] (2) Allocation of node working time slots: According to formula (1), the nu...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
The invention provides a serpentine time slot storage algorithm (P-SLPS) in a wireless sensor network on the basis of a planar storage algorithm by taking data as a center according to an event priority and in combination with a dynamic hash location, and the invention aims to reduce the energy consumption generated in the data transmission process. The strategy adopts the serpentine time slot to control only two nodes in the same one grid to listen data, so as to save the energy consumption due to the node idle listening; an event hash function is designed on such basis, and the events are stored in the grids with distances from smallest to largest from the query node according to the priority of the events from highest to lowest, and the hash location is rotated to the grid nearest the monitoring node, so as to reduce the energy consumption of the nodes in the data storage and data query processes. The test is performed in two aspects of the network life cycle and the node survival number of the network, and the result shows that the P-SLPS algorithm is superior to the energy-saving storage algorithm (SLPS) of the serpentine time slot.
Description
technical field [0001] The invention relates to a data storage method in a wireless sensor monitoring network. It can be applied to the field of wireless sensor network data storage. Background technique [0002] In the wireless sensor network, nodes collect data, because the number of nodes is relatively large, resulting in a huge amount of network data transmission. For some application fields, the data collected by the nodes is not transmitted in real time, so the collected data can be stored on the nodes (also known as storage nodes), and the data can be obtained from the storage nodes in the network when needed. However, the selection of storage nodes directly affects the efficiency of query data, as well as the energy consumption of nodes during the query process and data transmission process. Therefore, it is particularly important to select appropriate storage nodes and design energy-efficient data storage methods for network data types. [0003] The data-centric ...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & Authority Patents(China)
IPC IPC(8): H04W52/02H04W84/18
CPCH04W52/0209H04W84/18Y02D30/70
Inventor 林志贵安旭磊刘英平哈谦李敏
Owner TIANJIN POLYTECHNIC UNIV