CN109890062A - System adaptive recognition method, device and equipment, computer readable storage medium - Google Patents
System adaptive recognition method, device and equipment, computer readable storage medium Download PDFInfo
- Publication number
- CN109890062A CN109890062A CN201910184451.8A CN201910184451A CN109890062A CN 109890062 A CN109890062 A CN 109890062A CN 201910184451 A CN201910184451 A CN 201910184451A CN 109890062 A CN109890062 A CN 109890062A
- Authority
- CN
- China
- Prior art keywords
- node
- indicate
- coordinate
- grid
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a kind of system adaptive recognition method, device and equipment, computer readable storage medium, belongs to field of communication technology.System adaptive recognition method of the invention, comprising: data transmission region is divided into multiple grids；According to the coordinate of each node in each grid, node number and acquired grid mass center, the mass center benefit value of each grid is calculated；According to the current remaining value and primary power value of each node, the dump energy benefit value of each node is obtained, to calculate the cluster head benefit value of each node, and using the smallest node of cluster head benefit value as leader cluster node, and as present node；According to the coordinate of the present node, coordinate, primary power value and the current remaining value of its each neighbor node, and the coordinate of base station, obtain the fitness function of each neighbor node of present node, and by the smallest next-hop node as present node of acquired fitness function.
Description
Technical field
The invention belongs to fields of communication technology, and in particular to a kind of system adaptive recognition method, device and equipment calculates
Machine readable storage medium storing program for executing.
Background technique
Currently used data transmission method mainly has: flooded transmissions method and low power consumption adaptive sub-clustering transmission method.
Wherein, the basic thought of flooded transmissions method is that source node passes data to surrounding neighbours node, and encumbrance
According to copy.Surrounding neighbours node sends the data to other nodes again, until data eventually arrive at destination node.Flooded transmissions
Although method data transmission efficiency is high, the data copy of bulk redundancy is produced in network, wastes the energy of network.
The basic thought of low power consumption adaptive sub-clustering transmission method is that network is divided into multiple regions, and each region has specially
Cluster head acquisition ordinary node data, leader cluster node again merges data, is ultimately routed to base station.But this method does not have
There is the dump energy information for considering that node is current, leads to the too fast death of the leader cluster node of partial region.
Summary of the invention
The present invention is directed at least solve one of the technical problems existing in the prior art, a kind of system adaptive recognition is provided
Method, device and equipment, computer readable storage medium.
Solving technical solution used by present invention problem is a kind of system adaptive recognition method, comprising:
Data transmission region is divided into multiple grids, and obtains the seat of each node and base station in data transmission region
Mark and grid mass center；
According to the coordinate of each node in each grid, node number and acquired grid mass center, it is calculated
The mass center benefit value of each grid；
According to the current remaining value and primary power value of each node, the dump energy benefit of each node is obtained
Value, and according to the mass center benefit value of grid where the dump energy benefit value of each node and the node, calculate each node
Cluster head benefit value, and using the smallest node of cluster head benefit value as leader cluster node, and using leader cluster node as present node；
According to the coordinate of the present node, the coordinate of each neighbor node of present node, primary power value and current
Residual energy magnitude and the coordinate of base station obtain the fitness function of each neighbor node of present node, and will be acquired
The smallest next-hop node as present node of fitness function；
Using the next-hop node of present node as present node, and the coordinate according to the present node is returned to, currently
Prosthomere is worked as in coordinate, primary power value and the current remaining value of each neighbor node of node and the coordinate of base station, acquisition
The fitness function of each neighbor node of point, and by the smallest next-hop as present node of acquired fitness function
The step of node, until forwarding the data to base station.
Preferably, described according to the coordinate of each node in each grid, node number and acquired grid
Mass center, the step of mass center benefit value of each grid is calculated, comprising:
For each grid, according to the coordinate of the coordinate of grid mass center and each node, grid mass center and each is obtained
The distance between node, and determine the distance between grid mass center and node maximum value and minimum value；
Pass through formula:Calculate each grid mass center benefit value；
Wherein,
DkIndicate the mass center benefit value of k-th of grid；CkIndicate the mass center of k-th of grid；x0Indicate CkAbscissa；y0Table
Show CkOrdinate；NiIndicate any node in k-th of grid；xiIndicate NiAbscissa；yiIndicate NiOrdinate；maxd
(Ni,Ck) indicate CkWith NiBetween maximum distance；mind(Ni,Ck) indicate CkWith NiBetween minimum range；N indicates k-th of net
Node number in lattice.
Preferably, the coordinate according to present node, the coordinate of each neighbor node of present node, primary power
The coordinate of value and current remaining value and base station obtains the fitness function of each neighbor node of present node, and will
The step of acquired fitness function the smallest next-hop node as present node, comprising:
According to the coordinate of the coordinate of present node and its neighbor node, it is calculated between present node and its neighbor node
Distance；
According to the coordinate of the coordinate of present node and base station, the coordinate between present node and base station is calculated；
Obtain the neighbor node primary power value and current remaining value of present node；
Pass through formula:Calculate the suitable of the neighbor node of present node
Response function, and the next-hop node by one of fitness function minimum as present node；Wherein,
N0Indicate present node；NjIndicate N0Any one neighbor node；NBSIndicate base station；g(Nj) indicate NjAdaptation
Spend function；d(Nj,N0) indicate N0With NjThe distance between；d(Nj,NBS) indicate NjWith NBSThe distance between；d(N0,NBS) indicate N0
With NBSThe distance between；Ecur(Nj) indicate NjCurrent remaining value；Eini(Nj) indicate NjPrimary power value.
Solving technical solution used by present invention problem is a kind of system adaptive recognition device, comprising:
Initialization module for data transmission region to be divided into multiple grids, and obtains each in data transmission region
The coordinate and grid mass center of a node and base station；
Mass center benefit value obtains module, for the coordinate according to each node in each grid, node number, Yi Jisuo
The mass center benefit value of each grid is calculated in the grid mass center of acquisition；
Leader cluster node obtains module, for the current remaining value and primary power value according to each node, obtains every
The dump energy benefit value of a node, and imitated according to the mass center of grid where the dump energy benefit value of each node and the node
Benefit value, calculates the cluster head benefit value of each node, and using the smallest node of cluster head benefit value as leader cluster node, and by cluster head section
Point is used as present node；
Next-hop node obtains module, for the coordinate according to the present node, each neighbor node of present node
Coordinate, primary power value and current remaining value and base station coordinate, obtain each neighbor node of present node
Fitness function, and by the smallest next-hop node as present node of acquired fitness function；And
Spider module for using the next-hop node of present node as present node, and returns and works as prosthomere according to described
The coordinate of point, coordinate, primary power value and the current remaining value of each neighbor node of present node and the seat of base station
Mark obtains the fitness function of each neighbor node of present node, and the smallest be used as of acquired fitness function is worked as
The step of next-hop node of front nodal point, until forwarding the data to base station.
Preferably, the mass center benefit value obtains module, is specifically used for for each grid, according to grid mass center
The coordinate of coordinate and each node obtains the distance between grid mass center and each node, and determines grid mass center and node
The distance between maximum value and minimum value；
Pass through formula:Calculate each grid mass center effect
Benefit value；Wherein,
DkIndicate the mass center benefit value of k-th of grid；CkIndicate the mass center of k-th of grid；x0Indicate CkAbscissa；y0Table
Show CkOrdinate；NiIndicate any node in k-th of grid；xiIndicate NiAbscissa；yiIndicate NiOrdinate；maxd
(Ni,Ck) indicate CkWith NiBetween maximum distance；mind(Ni,Ck) indicate CkWith NiBetween minimum range；N indicates k-th of net
Node number in lattice.
Preferably, the next-hop node obtains module, specifically for being saved according to the coordinate of present node and its neighbour
The coordinate of point, is calculated the distance between present node and its neighbor node；
According to the coordinate of the coordinate of present node and base station, the coordinate between present node and base station is calculated；
Obtain the neighbor node primary power value and current remaining value of present node；
Pass through formula:Calculate the suitable of the neighbor node of present node
Response function, and the next-hop node by one of fitness function minimum as present node；Wherein,
N0Indicate present node；NjIndicate N0Any one neighbor node；NBSIndicate base station；g(Nj) indicate NjAdaptation
Spend function；d(Nj,N0) indicate N0With NjThe distance between；d(Nj,NBS) indicate NjWith NBSThe distance between；d(N0,NBS) indicate N0
With NBSThe distance between；Ecur(Nj) indicate NjCurrent remaining value；Eini(Nj) indicate NjPrimary power value.
Solving technical solution used by present invention problem is a kind of system adaptive recognition equipment, and feature exists
In, comprising: at least one processor, the computer program instructions of at least one processor and storage in the memory,
Above-mentioned method is realized when the computer program instructions are executed by the processor.
Solving technical solution used by present invention problem is a kind of computer readable storage medium, is stored thereon with
Computer program instructions, which is characterized in that above-mentioned method is realized when the computer program instructions are executed by processor.
The invention has the following beneficial effects:
System adaptive recognition method provided in the present invention utilizes grid mass center benefit value, dump energy benefit value
And the factors such as fitness function carry out self-adapting data acquisition and transmission.Under the premise of guaranteeing network connectivty, it ensure that
The balanced consumption of network energy.
Detailed description of the invention
Fig. 1 is the flow chart of the system adaptive recognition method of the embodiment of the present invention 1；
Fig. 2 is the schematic diagram of the system adaptive recognition device of the embodiment of the present invention 2；
Fig. 3 is the schematic diagram of the system adaptive recognition equipment of the embodiment of the present invention 3.
Specific embodiment
Technical solution in order to enable those skilled in the art to better understand the present invention, with reference to the accompanying drawing and specific embodiment party
Present invention is further described in detail for formula.
Embodiment 1:
As shown in Figure 1, including the following steps: the present embodiment provides a kind of system adaptive recognition method
S1, data transmission region is divided into multiple grids, and obtains each node and base station in data transmission region
Coordinate and grid mass center.
Specifically, the step of step is an initialization, it is in matrix arrangement that data transmission region, which is divided into multiple,
Grid, the side length of each grid are a, if being divided into k grid altogether, each grid is multiple nodes.At this point it is possible to
Coordinate system is established according to grid, so, node coordinate, base station coordinates and each net in available each grid
The center-of-mass coordinate of lattice.
S2, according to the coordinate of each node in each grid, node number and acquired grid mass center, calculate
Obtain the mass center benefit value of each grid.
Specifically, in this step, for each grid, according to the coordinate of the coordinate of grid mass center and each node,
The distance between grid mass center and each node are obtained, and determines the distance between grid mass center and node maximum value maxd
(Ni,Ck) and minimum value mind (Ni,Ck)。
Pass through formula:Calculate each grid mass center benefit value；
Wherein,
DkIndicate the mass center benefit value of k-th of grid；CkIndicate the mass center of k-th of grid；x0Indicate CkAbscissa；y0Table
Show CkOrdinate；NiIndicate any node in k-th of grid；xiIndicate NiAbscissa；yiIndicate NiOrdinate；maxd
(Ni,Ck) indicate CkWith NiBetween maximum distance；mind(Ni,Ck) indicate CkWith NiBetween minimum range；N indicates k-th of net
Node number in lattice.
S3, current remaining value and primary power value according to each node, obtain the residual energy dose-effect of each node
Benefit value, and according to the mass center benefit value of grid where the dump energy benefit value of each node and the node, calculate each node
Cluster head benefit value, and the smallest node of cluster head benefit value is denoted as present node as leader cluster node, and by leader cluster node.
Specifically, obtaining each current remaining value in this step, it is denoted as Ecur(Ni), primary power value is denoted as
Eini(Ni), by calculating the current remaining value of each node and the ratio of primary power value, obtain the residual energy of each node
Measure benefit value Eres(Ni), that is,Later, according to the mass center of each grid calculated in step S2
Benefit value DkWith the dump energy benefit value E of the node in the gridres(Ni) ratio, obtain the cluster head benefit value of each nodeAnd using the smallest node of cluster head benefit value as leader cluster node.
S4, according to the coordinate of present node (namely the leader cluster node obtained in step S3), each neighbours of present node
Coordinate, primary power value and the current remaining value of node and the coordinate of base station obtain each neighbours section of present node
The fitness function of point, and by the smallest next-hop node as present node of acquired fitness function.
Specifically, the step may include:
According to the coordinate of the coordinate of present node and its neighbor node, it is calculated between present node and its neighbor node
Distance；
According to the coordinate of the coordinate of present node and base station, the coordinate between present node and base station is calculated；
Obtain the neighbor node primary power value and current remaining value of present node；
Pass through formula:Calculate the suitable of the neighbor node of present node
Response function, and the next-hop node by one of fitness function minimum as present node；Wherein,
N0Indicate present node；NjIndicate N0Any one neighbor node；NBSIndicate base station；g(Nj) indicate NjAdaptation
Spend function；d(Nj,N0) indicate N0With NjThe distance between；d(Nj,NBS) indicate NjWith NBSThe distance between；d(N0,NBS) indicate N0
With NBSThe distance between；Ecur(Nj) indicate NjCurrent remaining value；Eini(Nj) indicate NjPrimary power value.
S5, using the next-hop node of the leader cluster node obtained in step S4 as present node, and according in step S4
Method obtains next-hop node again, until forwarding the data to base station.
System adaptive recognition method provided in the present embodiment utilizes grid mass center benefit value, dump energy benefit
The factors such as value and fitness function carry out self-adapting data acquisition and transmission.Under the premise of guaranteeing network connectivty, guarantee
The balanced consumption of network energy.
Embodiment 2:
As shown in Fig. 2, the present embodiment provides a kind of system adaptive recognition devices, comprising: initialization module, mass center benefit
Value obtains module, leader cluster node obtains module, next-hop node obtains module, spider module.
Wherein, initialization module for data transmission region to be divided into multiple grids, and obtains in data transmission region
Each node and base station coordinate and grid mass center.
Mass center benefit value obtains module, for the coordinate according to each node in each grid, node number, Yi Jisuo
The mass center benefit value of each grid is calculated in the grid mass center of acquisition.
Specifically, mass center benefit value obtains module, be specifically used for for each grid, according to the coordinate of grid mass center and
The coordinate of each node obtains the distance between grid mass center and each node, and determines between grid mass center and node
Apart from maximum value and minimum value；
Pass through formula:Calculate each grid mass center effect
Benefit value；Wherein,
DkIndicate the mass center benefit value of k-th of grid；CkIndicate the mass center of k-th of grid；x0Indicate CkAbscissa；y0Table
Show CkOrdinate；NiIndicate any node in k-th of grid；xiIndicate NiAbscissa；yiIndicate NiOrdinate；maxd
(Ni,Ck) indicate CkWith NiBetween maximum distance；mind(Ni,Ck) indicate CkWith NiBetween minimum range；N indicates k-th of net
Node number in lattice.
Leader cluster node obtains module, for the current remaining value and primary power value according to each node, obtains every
The dump energy benefit value of a node, and imitated according to the mass center of grid where the dump energy benefit value of each node and the node
Benefit value, calculates the cluster head benefit value of each node, and using the smallest node of cluster head benefit value as leader cluster node, and by cluster head section
Point is used as present node.
Next-hop node obtains module, for the coordinate according to the present node, each neighbor node of present node
Coordinate, primary power value and current remaining value and base station coordinate, obtain each neighbor node of present node
Fitness function, and by the smallest next-hop node as present node of acquired fitness function.
Next-hop node obtains module, specifically for calculating according to the coordinate of present node and the coordinate of its neighbor node
Obtain the distance between present node and its neighbor node；
According to the coordinate of the coordinate of present node and base station, the coordinate between present node and base station is calculated；
Obtain the neighbor node primary power value and current remaining value of present node；
Pass through formula:Calculate the suitable of the neighbor node of present node
Response function, and the next-hop node by one of fitness function minimum as present node；Wherein,
N0Indicate present node；NjIndicate N0Any one neighbor node；NBSIndicate base station；g(Nj) indicate NjAdaptation
Spend function；d(Nj,N0) indicate N0With NjThe distance between；d(Nj,NBS) indicate NjWith NBSThe distance between；d(N0,NBS) indicate N0
With NBSThe distance between；Ecur(Nj) indicate NjCurrent remaining value；Eini(Nj) indicate NjPrimary power value.
Spider module for using the next-hop node of present node as present node, and returns and works as prosthomere according to described
The coordinate of point, coordinate, primary power value and the current remaining value of each neighbor node of present node and the seat of base station
Mark obtains the fitness function of each neighbor node of present node, and the smallest be used as of acquired fitness function is worked as
The step of next-hop node of front nodal point, until forwarding the data to base station.
System adaptive recognition device provided in the present embodiment can carry out data biography using the method in embodiment 1
It is defeated, i.e., self-adapting data acquisition is carried out using factors such as grid mass center benefit value, dump energy benefit value and fitness functions
And transmission.Under the premise of guaranteeing network connectivty, the balanced consumption of network energy ensure that.
Embodiment 3:
The invention of this reality applies example and provides a kind of system adaptive recognition equipment, wherein 1 self-adapting data of the embodiment of the present invention
Transmission method can be realized by the energy-saving equipment of base station cell.Fig. 3 shows base station cell provided in an embodiment of the present invention
The hardware structural diagram of energy-saving equipment.
The energy-saving equipment of the base station cell may include processor and the memory for being stored with computer program instructions.
Specifically, above-mentioned processor may include central processing unit (CPU) or specific integrated circuit (Application
Specific Integrated Circuit, ASIC), or may be configured to implement one or more of the embodiment of the present invention
A integrated circuit.
Memory may include the mass storage for data or instruction.For example it rather than limits, memory can
Including hard disk drive (Hard Disk Drive, HDD), floppy disk drive, flash memory, CD, magneto-optic disk, tape or general string
The combination of row bus (Universal Serial Bus, USB) driver or two or more the above.Suitable
In the case of, memory may include the medium of removable or non-removable (or fixed).In a suitable case, memory can be in number
Inside or outside processing unit.In a particular embodiment, memory is non-volatile solid state memory.In specific embodiment
In, memory includes read-only memory (ROM).In a suitable case, which can be the ROM of masked edit program, may be programmed
ROM (PROM), erasable PROM (EPROM), electric erasable PROM (EEPROM), electrically-alterable ROM (EAROM) or flash memory or
The combination of two or more the above.
Processor is by reading and executing the computer program instructions stored in memory, to realize in above-described embodiment
The power-economizing method of any one base station cell.
In one example, the energy-saving equipment of base station cell may also include communication interface and bus.Wherein, as shown in figure 3,
Processor, memory, communication interface are connected by bus and complete mutual communication.
Communication interface is mainly used for realizing logical between each module, device, unit and/or equipment in the embodiment of the present invention
Letter.
Bus includes hardware, software or both, and the component of the energy-saving equipment of base station cell is coupled to each other together.Citing
For rather than limit, bus may include accelerated graphics port (AGP) or other graphics bus, enhancing Industry Standard Architecture (EISA)
Bus, front side bus (FSB), super transmission (HT) interconnection, the interconnection of Industry Standard Architecture (ISA) bus, infinite bandwidth, low pin count
(LPC) bus, memory bus, micro- channel architecture (MCA) bus, peripheral component interconnection (PCI) bus, PCI-Express
(PCI-X) bus, Serial Advanced Technology Attachment (SATA) bus, Video Electronics Standards Association part (VLB) bus or other conjunctions
The combination of suitable bus or two or more the above.In a suitable case, bus may include one or more total
Line.Although specific bus has been described and illustrated in the embodiment of the present invention, the present invention considers any suitable bus or interconnection.
Embodiment 4:
The embodiment of the present invention can provide a kind of computer readable storage medium to realize.On the computer readable storage medium
It is stored with computer program instructions；The computer program instructions realize any one in above-described embodiment when being executed by processor
System adaptive recognition method.
It should be clear that the invention is not limited to specific configuration described above and shown in figure and processing.
For brevity, it is omitted here the detailed description to known method.In the above-described embodiments, several tools have been described and illustrated
The step of body, is as example.But method process of the invention is not limited to described and illustrated specific steps, this field
Technical staff can be variously modified, modification and addition after understanding spirit of the invention, or suitable between changing the step
Sequence.
Functional block shown in structures described above block diagram can be implemented as hardware, software, firmware or their group
It closes.When realizing in hardware, it may, for example, be electronic circuit, specific integrated circuit (ASIC), firmware appropriate, insert
Part, function card etc..When being realized with software mode, element of the invention is used to execute program or the generation of required task
Code section.Perhaps code segment can store in machine readable media program or the data-signal by carrying in carrier wave is passing
Defeated medium or communication links are sent." machine readable media " may include any medium for capableing of storage or transmission information.
The example of machine readable media includes electronic circuit, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), soft
Disk, CD-ROM, CD, hard disk, fiber medium, radio frequency (RF) link, etc..Code segment can be via such as internet, inline
The computer network of net etc. is downloaded.
It should also be noted that, the exemplary embodiment referred in the present invention, is retouched based on a series of step or device
State certain methods or system.But the present invention is not limited to the sequence of above-mentioned steps, that is to say, that can be according in embodiment
The sequence referred to executes step, may also be distinct from that the sequence in embodiment or several steps are performed simultaneously.
The above description is merely a specific embodiment, it is apparent to those skilled in the art that,
For convenience of description and succinctly, the system, module of foregoing description and the specific work process of unit can refer to preceding method
Corresponding process in embodiment, details are not described herein.It should be understood that scope of protection of the present invention is not limited thereto, it is any to be familiar with
Those skilled in the art in the technical scope disclosed by the present invention, can readily occur in various equivalent modifications or substitutions,
These modifications or substitutions should be covered by the protection scope of the present invention.
Claims (8)
1. a kind of system adaptive recognition method characterized by comprising
Data transmission region is divided into multiple grids, and obtains the coordinate of each node and base station in data transmission region,
And grid mass center；
According to the coordinate of each node in each grid, node number and acquired grid mass center, it is calculated each
The mass center benefit value of grid；
According to the current remaining value and primary power value of each node, the dump energy benefit value of each node is obtained, and
According to the mass center benefit value of grid where the dump energy benefit value of each node and the node, the cluster head effect of each node is calculated
Benefit value, and using the smallest node of cluster head benefit value as leader cluster node, and using leader cluster node as present node；
According to the coordinate of the present node, coordinate, primary power value and the current residual of each neighbor node of present node
Energy value and the coordinate of base station, obtain the fitness function of each neighbor node of present node, and by acquired adaptation
Spend the smallest next-hop node as present node of function；
Using the next-hop node of present node as present node, and return to the coordinate according to the present node, present node
Each neighbor node coordinate, primary power value and current remaining value and base station coordinate, obtain present node
The fitness function of each neighbor node, and by the smallest next-hop node as present node of acquired fitness function
The step of, until forwarding the data to base station.
2. system adaptive recognition method according to claim 1, which is characterized in that described according to each in each grid
Coordinate, node number and the acquired grid mass center of a node, are calculated the step of the mass center benefit value of each grid
Suddenly, comprising:
Grid mass center and each node are obtained according to the coordinate of the coordinate of grid mass center and each node for each grid
The distance between, and determine the distance between grid mass center and node maximum value and minimum value；
Pass through formula:Calculate each grid mass center benefit value；Wherein,
DkIndicate the mass center benefit value of k-th of grid；CkIndicate the mass center of k-th of grid；x0Indicate CkAbscissa；y0Indicate Ck
Ordinate；NiIndicate any node in k-th of grid；xiIndicate NiAbscissa；yiIndicate NiOrdinate；maxd(Ni,
Ck) indicate CkWith NiBetween maximum distance；mind(Ni,Ck) indicate CkWith NiBetween minimum range；N indicates k-th of grid
In node number.
3. system adaptive recognition method according to claim 1, which is characterized in that the seat according to present node
Mark, coordinate, primary power value and the current remaining value of each neighbor node of present node and the coordinate of base station, are obtained
The fitness function of each neighbor node of present node is taken, and acquired fitness function is the smallest as present node
Next-hop node the step of, comprising:
According to the coordinate of the coordinate of present node and its neighbor node, be calculated between present node and its neighbor node away from
From；
According to the coordinate of the coordinate of present node and base station, the coordinate between present node and base station is calculated；
Obtain the neighbor node primary power value and current remaining value of present node；
Pass through formula:Calculate the fitness of the neighbor node of present node
Function, and the next-hop node by one of fitness function minimum as present node；Wherein,
N0Indicate present node；NjIndicate N0Any one neighbor node；NBSIndicate base station；g(Nj) indicate NjFitness letter
Number；d(Nj,N0) indicate N0With NjThe distance between；d(Nj,NBS) indicate NjWith NBSThe distance between；d(N0,NBS) indicate N0With
NBSThe distance between；Ecur(Nj) indicate NjCurrent remaining value；Eini(Nj) indicate NjPrimary power value.
4. a kind of system adaptive recognition device characterized by comprising
Initialization module for data transmission region to be divided into multiple grids, and obtains each section in data transmission region
The coordinate and grid mass center of point and base station；
Mass center benefit value obtains module, for according to the coordinate of each node in each grid, node number and acquired
Grid mass center, the mass center benefit value of each grid is calculated；
Leader cluster node obtains module and obtains each section for the current remaining value and primary power value according to each node
The dump energy benefit value of point, and according to the mass center benefit of grid where the dump energy benefit value of each node and the node
Value, calculates the cluster head benefit value of each node, and using the smallest node of cluster head benefit value as leader cluster node, and by leader cluster node
As present node；
Next-hop node obtains module, for the coordinate according to the present node, the seat of each neighbor node of present node
The coordinate of mark, primary power value and current remaining value and base station, obtains the adaptation of each neighbor node of present node
Function is spent, and by the smallest next-hop node as present node of acquired fitness function；And
Spider module for using the next-hop node of present node as present node, and is returned according to the present node
Coordinate, coordinate, primary power value and the current remaining value of each neighbor node of present node and the coordinate of base station,
The fitness function of each neighbor node of present node is obtained, and the smallest be used as of acquired fitness function is worked as into prosthomere
The step of next-hop node of point, until forwarding the data to base station.
5. system adaptive recognition device according to claim 4, which is characterized in that the mass center benefit value obtains mould
Block, is specifically used for for each grid, according to the coordinate of the coordinate of grid mass center and each node, obtains grid mass center and every
The distance between a node, and determine the distance between grid mass center and node maximum value and minimum value；
Pass through formula:Calculate each grid mass center benefit value；
Wherein,
DkIndicate the mass center benefit value of k-th of grid；CkIndicate the mass center of k-th of grid；x0Indicate CkAbscissa；y0Indicate Ck
Ordinate；NiIndicate any node in k-th of grid；xiIndicate NiAbscissa；yiIndicate NiOrdinate；maxd(Ni,
Ck) indicate CkWith NiBetween maximum distance；mind(Ni,Ck) indicate CkWith NiBetween minimum range；N indicates k-th of grid
In node number.
6. system adaptive recognition device according to claim 4, which is characterized in that the next-hop node obtains mould
Block, specifically for present node and its neighbor node is calculated according to the coordinate of present node and the coordinate of its neighbor node
The distance between；
According to the coordinate of the coordinate of present node and base station, the coordinate between present node and base station is calculated；
Obtain the neighbor node primary power value and current remaining value of present node；
Pass through formula:Calculate the fitness of the neighbor node of present node
Function, and the next-hop node by one of fitness function minimum as present node；Wherein,
N0Indicate present node；NjIndicate N0Any one neighbor node；NBSIndicate base station；g(Nj) indicate NjFitness letter
Number；d(Nj,N0) indicate N0With NjThe distance between；d(Nj,NBS) indicate NjWith NBSThe distance between；d(N0,NBS) indicate N0With
NBSThe distance between；Ecur(Nj) indicate NjCurrent remaining value；Eini(Nj) indicate NjPrimary power value.
7. a kind of system adaptive recognition equipment characterized by comprising at least one processor, at least one processor with
And the computer program instructions of storage in the memory, it is real when the computer program instructions are executed by the processor
Existing method as claimed in any one of claims 1-3.
8. a kind of computer readable storage medium, is stored thereon with computer program instructions, which is characterized in that when the computer
Method as claimed in any one of claims 1-3 is realized when program instruction is executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910184451.8A CN109890062A (en) | 2019-03-12 | 2019-03-12 | System adaptive recognition method, device and equipment, computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910184451.8A CN109890062A (en) | 2019-03-12 | 2019-03-12 | System adaptive recognition method, device and equipment, computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109890062A true CN109890062A (en) | 2019-06-14 |
Family
ID=66931680
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910184451.8A Pending CN109890062A (en) | 2019-03-12 | 2019-03-12 | System adaptive recognition method, device and equipment, computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109890062A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100220653A1 (en) * | 2007-11-01 | 2010-09-02 | Hwang So-Young | Multi-path routing method in wireless sensor network |
| US20160037566A1 (en) * | 2014-07-29 | 2016-02-04 | Em Microelectronic-Marin S.A. | Method and system for optimized bluetooth low energy communications |
| CN108770036A (en) * | 2018-06-20 | 2018-11-06 | 中国联合网络通信集团有限公司 | Communication means and wireless sensor network Routing Protocol between cluster head |
| CN108900998A (en) * | 2018-08-14 | 2018-11-27 | 长春理工大学 | A kind of the mobile sink node paths planning method and system of energy consumption balance |
-
2019
- 2019-03-12 CN CN201910184451.8A patent/CN109890062A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100220653A1 (en) * | 2007-11-01 | 2010-09-02 | Hwang So-Young | Multi-path routing method in wireless sensor network |
| US20160037566A1 (en) * | 2014-07-29 | 2016-02-04 | Em Microelectronic-Marin S.A. | Method and system for optimized bluetooth low energy communications |
| CN108770036A (en) * | 2018-06-20 | 2018-11-06 | 中国联合网络通信集团有限公司 | Communication means and wireless sensor network Routing Protocol between cluster head |
| CN108900998A (en) * | 2018-08-14 | 2018-11-27 | 长春理工大学 | A kind of the mobile sink node paths planning method and system of energy consumption balance |
Non-Patent Citations (1)
| Title |
|---|
| 徐珂: ""WSN中基于移动基站的路由动态调整协议的研究"", 《信息科技辑》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101113006B1 (en) | Apparatus and method for clustering using mutual information between clusters | |
| CN108463976B (en) | Reducing flooding of link-like changes in a network | |
| US20180192306A1 (en) | Signal output apparatus, board, and signal output method | |
| WO2019056941A1 (en) | Decoding method and device, and decoder | |
| CN104640222A (en) | Pilot frequency scheduling method for multi-input multi-output system and synergetic equipment | |
| CN106656406B (en) | Signal detecting method and device in a kind of access of non-orthogonal multiple | |
| JP2020119556A (en) | Method and device for verifying integrity of parameters of cnn by using test pattern to enhance fault tolerance and fluctuation robustness in extreme situations for functional safety | |
| WO2015131840A1 (en) | Detection method and apparatus of mimo system | |
| CN106022936B (en) | Community structure-based influence maximization algorithm applicable to thesis cooperative network | |
| CN109919826B (en) | Graph data compression method for graph computation accelerator and graph computation accelerator | |
| CN105701128A (en) | Query statement optimization method and apparatus | |
| CN109890062A (en) | System adaptive recognition method, device and equipment, computer readable storage medium | |
| CN105488237A (en) | Enable signal optimizing method for register based on FPGA (Field Programmable Gate Array) | |
| WO2018086405A1 (en) | Modulation mode detection method and device | |
| JP6507260B2 (en) | Channel estimation method and apparatus, storage medium | |
| US7970134B2 (en) | Method for generating, operating, and using a sparse w-NAF key for encryption | |
| CN105808823A (en) | Antenna structure parameter determination method and device | |
| CN113905066B (en) | Networking method of Internet of things, networking device of Internet of things and electronic equipment | |
| CN105892995A (en) | Minus searching method and device as well as processor | |
| Wei et al. | On mitigating on-off attacks in wireless sensor networks | |
| EP2687980B1 (en) | Device and method for implementing address buffer management of processor | |
| US10320523B2 (en) | Method for detecting sent sequence, receiver, and receiving device | |
| CN107295686A (en) | One kind interference processing method, relevant device and interference processing system | |
| CN107248929B (en) | Strong correlation data generation method of multi-dimensional correlation data | |
| CN107453850B (en) | Detection method of physical uplink control channel |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190614 |