Unlock instant, AI-driven research and patent intelligence for your innovation.

Wireless-route-oriented optimal selection method for Dijkstra and power-efficient gathering in sensor (PEGASISI) distance defining

An optimal selection and distance technology, applied in wireless communication, energy-saving ICT, advanced technology, etc., can solve the problem of no judgment on efficiency, achieve the effect of reducing workload, building reasonable energy saving, and reducing complexity

Inactive Publication Date: 2013-07-17
NANCHANG UNIV
View PDF2 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Such a path can only guarantee effectiveness, without any judgment on efficiency

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 more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Wireless-route-oriented optimal selection method for Dijkstra and power-efficient gathering in sensor (PEGASISI) distance defining
  • Wireless-route-oriented optimal selection method for Dijkstra and power-efficient gathering in sensor (PEGASISI) distance defining
  • Wireless-route-oriented optimal selection method for Dijkstra and power-efficient gathering in sensor (PEGASISI) distance defining

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0022] 1. Judging the distance between each node of the network by estimating energy

[0023] The steps of this process are: judge the distance between each node of the network by estimating the energy, where the communication distance power is obtained by increasing the proportional coefficient K of the spatial distance between two nodes, and the value of the proportional coefficient K is: Various ways, defined here in this paper:

[0024]

[0025] in is the voltage critical value of the communication node, is the current voltage of the node, then the mapping of the communication distance is defined as follows:

[0026]

[0027]

[0028] Then put the obtained power value into the array power[ori][des], which represents the communication distance from the ori node to the des node.

[0029] 2. Construct the entire network table through the node distance as attached figure 1 ;

[0030] The steps of this process are: map the power value obtained in the first step ...

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

No PUM Login to View More

Abstract

Disclosed is a wireless-route-oriented optimal selection method for Dijkstra and power-efficient gathering in sensor (PEGASISI) distance defining. The method comprises determining the distance between adjacent nodes through signal energy received by the nodes to record lengths of edges of a route network diagram; classifying the network nodes to be unmarked nodes through an improved Dijkstra algorithm, and searching downwards for nodes of communicated shortest routes, marking the nodes as temporary nodes; performing cyclic searching on the nodes in the shortest distance in the temporary nodes and marking the nodes as permanent nodes till all the nodes become the permanent nodes; determining the shortest route from a host node to the child nodes merely, and storing a routing list into an upper computer to build a whole network route. By means of the technical scheme, the complexity of manual routing selection can be reduced, the network route structure is reasonable and energy-saving, the information transmission distance is reduced effectively, and the real-time property is improved.

Description

technical field [0001] The invention relates to the technical field of wireless routing algorithms, in particular to an optimal selection method for wireless routing-oriented Dijkstra and PEGASISI distance definitions. Background technique [0002] During the research and practice of this method, the inventor of the present invention found that since the implementation of the Internet of Things strategy, the research of WSN (Wireless Sensor Network) has become a hot spot, and the research of WSN routing path is even more important. Hot. [0003] In the past wireless sensor network, the routing path is usually stored in the form of nodes storing the routing table, and at the same time, the routing table is updated every time for comparison, so as to obtain its upload and delivery addresses. Such a path can only guarantee effectiveness, without any judgment on efficiency. Here we introduce the Dijkstra algorithm, Dijkstra (Dijkstra) algorithm is a typical single-source short...

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
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04W40/02H04W40/24
CPCY02B60/50Y02D30/70
Inventor 张宇龙承志向满天虞贵财罗建平邹文生余尧毅周海
Owner NANCHANG UNIV