CN104410714A - Network information pushing method and network information pushing device - Google Patents
Network information pushing method and network information pushing device Download PDFInfo
- Publication number
- CN104410714A CN104410714A CN201410782814.5A CN201410782814A CN104410714A CN 104410714 A CN104410714 A CN 104410714A CN 201410782814 A CN201410782814 A CN 201410782814A CN 104410714 A CN104410714 A CN 104410714A
- Authority
- CN
- China
- Prior art keywords
- information
- network node
- network
- path
- pushed
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/55—Push-based network services
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention provides a network information pushing method. The network information pushing method comprises the following steps: obtaining the relative position of each network node and a gateway and the amount of pushed information of all network nodes; according to the relative position of each network node and the gateway and the amount of pushed information of the network nodes, and grouping the network nodes so as to obtain a plurality of effective groups; determining the effective information push path of each effective group; according to each effective information push path, carrying out network information pushing operation for the network nodes in each effective group. The invention further provides a network information pushing device. Through the relative position of each network node and the gateway and the amount of pushed information of the network nodes, the network information pushing method and the network information pushing device carry out grouping operation for the network nodes and determining operation for the effective information push paths, so that the energy consumption of all network nodes can be effectively reduced, and the quality of network service is improved.
Description
Technical field
The present invention relates to the communications field, particularly relate to a kind of network information push method and network information push device.
Background technology
Along with the development of science and technology, increasing people understands by pushing network the information oneself wanted in time.Existing propelling movement network generally comprises gateway and network node, and gateway directly or indirectly transport network information can reach each network node.
Network node is generally made up of transducer, microprocessor and wireless communication unit, is arranged on the complex environments such as field, disaster area or battlefield as network node, and network node generally by powered battery, cannot obtain stable power supply support.Energy ezpenditure as some network node is excessive, this network node may be caused dead due to power-off, cause whole network service quality to decline and even paralyse.
Therefore, be necessary to provide a kind of network information push method and network information push device, to solve the problem existing for prior art.
Summary of the invention
The embodiment of the present invention provides a kind of network node energy-consumption lower, thus can improve network information push method and the network information push device of network service quality; The technical problem excessive with the energy ezpenditure of the network node solving existing network information push method and network information push device and network service quality is lower.
The embodiment of the present invention provides a kind of network information push method, and it comprises:
Obtain the relative position of each network node and gateway, and the pushed information amount of all described network nodes;
According to described network node and the relative position of described gateway and the pushed information amount of described network node, division operation is carried out to described network node, obtains multiple effective group; And determine that the effective information of each described effective group pushes path; And
Push path according to described effective information, network information push operation is carried out to the described network node in described effective group.
In network information push method of the present invention, total pushed information amount of the described network node in each described effective group is less than or equal to predetermined value.
In network information push method of the present invention, described total pushed information amount with described effective group of maximum total pushed information amount is 1:1 to 1.25:1 with the ratio of described total pushed information amount of described effective group with minimum total pushed information amount.
In network information push method of the present invention, describedly according to described network node and the relative position of described gateway and the pushed information amount of described network node, division operation is carried out to described network node, obtain multiple effective group; And determine that the step in the effective information propelling movement path of each described effective group comprises:
According to described network node and the relative position of described gateway and the pushed information amount of described network node, use scanning algorithm to obtain to meet pre-conditioned all default group and corresponding presupposed information pushes path; And
Use partheno genetic algorithm, path is pushed to all described default groups and corresponding described presupposed information and carries out least energy consumption calculating, described default group minimum for energy consumption and corresponding described presupposed information are pushed path and pushes path as described effective group and described effective information.
In network information push method of the present invention, described pre-conditioned total pushed information amount for the described network node in each described default group is less than or equal to predetermined value.
The embodiment of the present invention also provides a kind of network information push device, and it comprises:
Nodal information acquisition module, for obtaining the relative position of each network node and gateway, and the pushed information amount of all described network nodes;
Push path determination module, for according to the relative position of described network node and described gateway and the pushed information amount of described network node, division operation is carried out to described network node, obtain multiple effective group; And determine that the effective information of each described effective group pushes path; And
Pushing module, for pushing path according to described effective information, carries out network information push operation to the described network node in described effective group.
In network information push device of the present invention, total pushed information amount of the described network node in each described effective group is less than or equal to predetermined value.
In network information push device of the present invention, described total pushed information amount with described effective group of maximum total pushed information amount is 1:1 to 1.25:1 with the ratio of described total pushed information amount of described effective group with minimum total pushed information amount.
In network information push device of the present invention, described propelling movement path determination module comprises:
Presupposed information pushes path acquiring unit, for according to the relative position of described network node and described gateway and the pushed information amount of described network node, use scanning algorithm to obtain and meet pre-conditioned all default group and corresponding presupposed information propelling movement path; And
Effective information pushes path acquiring unit, for using partheno genetic algorithm, path is pushed to all described default groups and corresponding described presupposed information and carries out least energy consumption calculating, described default group minimum for energy consumption and corresponding described presupposed information are pushed path and pushes path as described effective group and described effective information.
In network information push device of the present invention, described pre-conditioned total pushed information amount for the described network node in each described default group is less than or equal to predetermined value.
Compared to network information push method and the network information push device of prior art, network information push method of the present invention and network information push device, by network node and the relative position of gateway and the pushed information amount of network node, carry out to network node the determination operation that division operation and effective information push path; The energy ezpenditure of all network nodes can be effectively reduced, thus improve network service quality; Solve the technical problem that energy ezpenditure is excessive and network service quality is lower of the network node of existing network information push method and network information push device.
Accompanying drawing explanation
Fig. 1 is the flow chart of the preferred embodiment of network information push method of the present invention;
Fig. 2 is the flow chart of the step S102 of the preferred embodiment of network information push method of the present invention;
Fig. 3 is the flow chart of the step S1021 of the step S102 of the preferred embodiment of network information push method of the present invention;
Fig. 4 is the structural representation of the doubly linked list in the step S1021 of the step S102 of the preferred embodiment of network information push method of the present invention;
Fig. 5 is the flow chart of the step S1022 of the step S102 of the preferred embodiment of network information push method of the present invention;
Fig. 6 is the structural representation of the preferred embodiment of network information push device of the present invention;
Fig. 7 is the structural representation of the propelling movement path determination module of the preferred embodiment of network information push device of the present invention;
Fig. 8 A is the propelling movement path schematic diagram of existing network information push method and network information push device;
Fig. 8 B is the propelling movement path schematic diagram of network information push method of the present invention and network information push device.
Embodiment
Please refer to graphic, wherein identical element numbers represents identical assembly, and principle of the present invention implements to illustrate in a suitable computing environment.The following description is based on the illustrated specific embodiment of the invention, and it should not be regarded as limiting the present invention not at other specific embodiment that this describes in detail.
In the following description, specific embodiments of the invention illustrate, unless otherwise stating clearly with reference to the step of the operation performed by or multi-section computer and symbol.Therefore, it can recognize these steps and operation, wherein have and will mention as being performed by computer for several times, include and handled with the computer processing unit of the electronic signal of the data in a structuring pattern by representing.These data of this manipulation transforms or the position maintained in the memory system of this computer, its reconfigurable or other running changing this computer in a manner familiar to those skilled in the art.The data structure that these data maintain is the provider location of this internal memory, and it has the particular characteristics defined by this data format.But the principle of the invention illustrates with above-mentioned word, it is not represented as a kind of restriction, and those skilled in the art can recognize that the plurality of step of the following stated and operation also may be implemented in the middle of hardware.
" assembly ", " module ", " system ", " interface ", " process " etc. are usually intended to refer to computer related entity as used herein the term: the combination of hardware, hardware and software, software or executory software.Such as, assembly can be but be not limited to be run process on a processor, processor, object, can perform application, the thread performed, program and/or computer.By diagram, run application on the controller and this both controller can be assembly.One or more assembly can have in the process and/or thread that are to perform, and assembly and/or can be distributed between two or more computers on a computer.
And claimed theme may be implemented as and uses standard program and/or engineering to produce software, firmware, hardware or its combination in any with the method for the theme disclosed in computer for controlling realization, device or manufacture.Term as used herein " manufacture " is intended to comprise can from the computer program of any computer readable device, carrier or medium access.Certainly, those skilled in the art will recognize that and can carry out many amendments to this configuration, and do not depart from scope or the spirit of claimed theme.
There is provided herein the various operations of embodiment.In one embodiment, described one or more operations can form the computer-readable instruction that one or more computer-readable medium stores, and it will make computing equipment perform described operation when being performed by electronic equipment.The order describing some or all of operation should not be interpreted as implying what these operations were necessarily sequentially correlated with.It will be appreciated by those skilled in the art that the alternative sequence of the benefit with this specification.And, should be appreciated that not all operation must exist in each embodiment provided in this article.
And word used herein " preferably " means to be used as example, example or illustration.Any aspect that Feng Wen is described as " preferably " or design need not be interpreted as than other aspects or design more favourable.On the contrary, the use of word " preferably " is intended to propose concept in a concrete fashion.Term "or" as used in this application is intended to the "or" that means to comprise and the "or" of non-excluded.That is, unless otherwise or clear from the context, " X uses A or B " means any one that nature comprises arrangement.That is, if X uses A; X uses B; Or X uses both A and B, then " X uses A or B " is met in aforementioned arbitrary example.
And although illustrate and describe the disclosure relative to one or more implementation, those skilled in the art are based on to the reading of this specification and accompanying drawing with understand and will expect equivalent variations and amendment.The disclosure comprises all such amendments and modification, and is only limited by the scope of claims.Especially about the various functions performed by said modules (such as element, resource etc.), term for describing such assembly is intended to the random component (unless otherwise instructed) corresponding to the appointed function (such as it is functionally of equal value) performing described assembly, even if be not structurally equal to the open structure of the function performed in exemplary implementations of the present disclosure shown in this article.In addition, although special characteristic of the present disclosure relative in some implementations only one be disclosed, this feature can with can be such as expect and other Feature Combinations one or more of other favourable implementations for given or application-specific.And, " comprise " with regard to term, " having ", " containing " or its distortion be used in embodiment or claim with regard to, such term is intended to comprise " to comprise " similar mode to term.
The operational environment of the electronic equipment at network information push device place of the present invention is preferably data basestation (gateway), data basestation pushes path according to obtaining the minimum effective information of energy consumption to the pushed information amount of the position relationship between each network node and data basestation and network node, although improve the energy ezpenditure of data basestation for path computing, but significantly reduce the energy ezpenditure of all-network node, thus improve network service quality.
Please refer to Fig. 1, Fig. 1 is the flow chart of the preferred embodiment of network information push method of the present invention.The network information push method of this preferred embodiment comprises:
Step S101, obtains the relative position of each network node and gateway, and the pushed information amount of all-network node;
Step S102, according to network node and the relative position of gateway and the pushed information amount of network node, carries out division operation to network node, obtains multiple effective group, and determines that the effective information of each effective group pushes path;
Step S103, pushes path according to effective information, carries out network information push operation to the network node in effective group.
The network information push method of this preferred embodiment ends at step S103.
The following detailed description of the idiographic flow of each step of the network information push method of this preferred embodiment.
In step S101, network information push device (gateway) obtains the network node of information to be pushed and the pushed information amount of each network node, and calculates and obtain the relative position of each network node and gateway.Forward step S102 to subsequently.
In step s 102, network information push device is according to network node and the relative position of gateway and the pushed information amount of network node, division operation is carried out to network node, obtains multiple effective group, and determine that the effective information of each effective group pushes path.
The idiographic flow of this step please refer to Fig. 2, and Fig. 2 is the flow chart of the step S102 of the preferred embodiment of network information push method of the present invention.This step S102 comprises:
Step S1021, according to network node and the relative position of gateway and the pushed information amount of described network node, uses scanning algorithm to obtain to meet pre-conditioned all default group and corresponding presupposed information pushes path.Be specially:
First according to network node and the relative position of gateway, the pushed information amount of described network node and pre-conditioned founding mathematical models.
Consider following conventional application scenarios, gateway (being numbered 0) for N number of network node (1,2 ..., N) and pushed information, the pushed information amount of each network node is w
i(i=1,2 ... N); The amount of information that gateway once can push at most is E
0, meet any w
i<=E
0, this is pre-conditioned for what must meet; Only carry this necessary pushed information amount during each propelling data of gateway, during each communication session, each network node can only push once by gateway, and node i is d to the distance of node j
ij, node j is d to the distance of gateway
j0(j=1,2,3 ... N), namely each network node that pushed information arrives at information pushing path is removed the information needed for this network node, after last network node in this information pushing path receives information, needs to return confirmation to gateway.
If when having information pushing, the communication information transmission energy consumption setting every kilobytes (K Bytes) every meter (m) is α; When network node returns confirmation to gateway, because amount of information is only bit (bit, position) level, therefore think that energy consumption is only relevant with confirmation transmission range, have nothing to do with confirmation amount, the confirmation information transmission energy consumption setting every meter is β.If c
ijrepresent from network node i to the energy consumption cost of network node j, m is information pushing number of paths, and this Mathematical Modeling specifically can be as follows:
V'
ijs=0 or 1, i, j=0,1 ..., N; S=1,2 ..., m (7)
c
1＝α*E
i*d
iji≠j,i,j＝1,2,..N (10)
c
2＝β*d
j0,j＝1,2,...,N (11)
V' in formula (1)
ijsrepresent that whether propelling data bag is via i network node and j network node, wherein i, j choose arbitrarily; Formula (2) then represents whether network node i is pushed by information pushing path s; The propelling movement task that formula (3) limits any one network node has only been come by an information pushing path, and the propelling movement task of all-network node has then been come by m bar information pushing path; Formula (4) defines the maximum pushed information amount that every bar information pushing path pushes; Formula (5-6) defines the information pushing path arriving and leave arbitrary network node to be had and only has 1; Formula (7) ensure that arbitrary information pushing path at most can only simultaneously to a network node transmissions communication information; Formula (8) is by E
iillustrate every bar information pushing path arrive each network node in this information pushing path after residue pushed information amount; By C in formula (9-11)
ijrepresent the network node of centre in any information pushing path and the propelling movement energy consumption cost of last network node needs, wherein C
1represent when still having a communication information of propelling movement, the energy consumption cost between any two network nodes, this energy consumption cost C
1network node spacing d
ijand entrained residue pushed information amount E
iand unit pushes the product of cost α, C
2represent when the propelling movement task of last network node completes, the energy consumption cost between last network node and gateway, this energy consumption cost C
2only with the distance d of this network node and gateway
j0and unit propelling movement cost β is relevant.Formula (12) is then minimum propelling movement overall energy consumption cost C
min, it is that all propelling movement subpaths push (a total m bar, m>=1) energy consumption cost C
ijsum.
The all default group that scanning algorithm can be used subsequently to obtain meet above-mentioned pre-conditioned or Mathematical Modeling Chinese style (1-11) and corresponding presupposed information push path.Please refer to Fig. 3, Fig. 3 is the flow chart of the step S1021 of the step S102 of the preferred embodiment of network information push method of the present invention.Specifically comprise the steps:
Step S301, with starting point (gateway) for initial point sets up polar coordinate system.
Step S302, according to the coordinate of each network node, calculates the polar angle that each network node is corresponding.When the Y-axis coordinate of network node is less than 0, polar angle is negative, and the polar angle at this moment for negative adds 2 π, guarantees the polar angle θ of all-network node
nall be positioned in the interval of [0,2 π].Then the polar angle of all network nodes is pressed order generation one doubly linked list as shown in Figure 4 from small to large.
Step S303, scanning is started from the network node that certain polar angle (as minimum or maximum polar angle) is corresponding, network node corresponding for polar angle is joined in current information pushing path one by one and goes, until do not meet pre-conditioned (as exceeding maximum pushed information amount etc.), re-establish a new information pushing path, thus multiple default group and corresponding presupposed information propelling movement path can be obtained.
Step S304, repeats the scanning process of step S303, until all carry out overscanning using all network nodes as starting point from secondary little or that secondary large polar angle is corresponding network node.Multiple default group and the corresponding presupposed information that can obtain Multiple-Scan like this push path.Forward step S1022 to subsequently.
Step S1022, after step S1021, the default group of above-mentioned Mathematical Modeling and corresponding presupposed information propelling movement path is met by N number of for acquisition, partheno genetic algorithm is used in this step, path is pushed to all default groups and corresponding presupposed information and carries out least energy consumption calculating, default group minimum for energy consumption and corresponding presupposed information are pushed path and pushes path as effective group and effective information.Please refer to Fig. 5, Fig. 5 is the flow chart of the step S1022 of the step S102 of the preferred embodiment of network information push method of the present invention.Specifically comprise the steps:
Step S501, push path to other presupposed information of preset group to encode, as having 5 network nodes, numbering is respectively 1, 2, 3, 4, 5, the pushed information amount of No. 1 network node is 3k, the pushed information amount of No. 2 network nodes is 4k, the pushed information amount of No. 3 network nodes is 2k, the pushed information amount of No. 4 network nodes is 5k, the pushed information amount of No. 5 network nodes is 1k, when every bar presupposed information propelling movement path pushes at most 8k byte, the coding in other presupposed information of preset group propelling movement path of this network (chromosome in partheno genetic algorithm) can be 03450120, i.e. No. 3 network nodes, No. 4 network nodes and No. 5 network nodes form a presupposed information and push path, No. 1 network node and No. 2 network nodes form a presupposed information and push path.Forward step S502 to subsequently.
Step S502, the fitness of each network (chromosome) obtained in calculation procedure S501, the energy consumption in the presupposed information propelling movement path of each network is less, and the fitness of this network is larger.Forward step S503 to subsequently.
Step S503, produces the initial population having the network in N number of step S502 to form.
Step S504, according to the fitness of each network in initial population, selects population of future generation, if reach stipulated number, and Output rusults, otherwise forward step S505 to.
Step S505, uses population choosing principles, carries out genetic recombination operation to each network, produces new individual, returns step S504 subsequently.
Here population choosing principles adopts elite to retain and roulette strategy, often arrange from big to small according to fitness for all chromosomes in population, elite is individual, and the individuality that namely fitness is higher comes foremost, directly enter the next generation, all the other individualities determine going or staying according to the principle of roulette.Next to determining that the individuality changed carries out the Chromosome recombination operations such as Inter-genic spacer, displacement, inversion, sudden change.After implementing Chromosome recombination operation, likely there will be the illegal chromosome not meeting constraints, if certain chromosome was 0261078043590 originally, may be 0790021843560 after restructuring, continuous print two 0 are there are, now delete one 0, become 079021843560, then judge whether that the presupposed information occurring exceeding maximum pushed information amount pushes path, have, add 0, then chromosome may become 0790218043560, finally judge whether individual fitness increases, if increase, then replace former individuality with new individuality, otherwise retain former individuality.
The network that the fitness finally obtained is the highest is active block, and the effective information that this active block comprises multiple effective group and effective group pushes path.Forward step S103 to subsequently.
In step s 103, push path according to the effective information that step S102 obtains, network information push operation is carried out to each network node in effective group.
So namely, complete the network information push process of the network information push method of this preferred embodiment.
Network information push method of the present invention, by network node and the relative position of gateway and the pushed information amount of network node, carries out to network node the determination operation that division operation and effective information push path; The energy ezpenditure of all network nodes can be effectively reduced, thus improve network service quality.
The present invention also provides a kind of network information push device, please refer to Fig. 6, and Fig. 6 is the structural representation of the preferred embodiment of network information push device of the present invention.This network information push device 60 of this preferred embodiment comprises nodal information acquisition module 61, pushes path determination module 62 and pushing module 63.Wherein nodal information acquisition module 61 is for obtaining the relative position of each network node 64 and gateway 65, and all-network saves the pushed information amount of 64; Push path determination module 62 for according to network node 64 and the relative position of gateway 65 and the pushed information amount of network node 64, division operation is carried out to network node 64, obtains multiple effective group; And determine that the effective information of each effective group pushes path; Pushing module 63, for pushing path according to effective information, carries out network information push operation to the network node 64 in effective group.
Please refer to Fig. 7, Fig. 7 is the structural representation of the propelling movement path determination module of the preferred embodiment of network information push device of the present invention.This propelling movement path determination module 62 comprises presupposed information and pushes path acquiring unit 621 and effective information propelling movement path acquiring unit 622, presupposed information propelling movement path acquiring unit 621, for according to network node 64 and the relative position of gateway 65 and the pushed information amount of network node, uses scanning algorithm to obtain and meets pre-conditioned all default group and corresponding presupposed information propelling movement path; Effective information pushes path acquiring unit 622 for using partheno genetic algorithm, path is pushed to all default groups and corresponding presupposed information and carries out least energy consumption calculating, default group minimum for energy consumption and corresponding presupposed information are pushed path and pushes path as effective group and effective information.
Total pushed information amount of the network node 64 wherein in each effective group is less than or equal to predetermined value, and total propelling movement amount of the network node 64 in each default group is also less than or equal to predetermined value.
Preferably, the ratio arranging total pushed information amount of total pushed information amount with effective group of maximum total pushed information amount and effective group with minimum total pushed information amount is 1:1 to 1.25:1, to reduce the energy consumption of the network information push of this network information push device further.
Description in the specific works principle of the network information push device of this preferred embodiment and the preferred embodiment of above-mentioned network information push method is same or similar, specifically refers to the associated description in the preferred embodiment of above-mentioned network information push method.
Network information push device of the present invention, by network node and the relative position of gateway and the pushed information amount of network node, carries out to network node the determination operation that division operation and effective information push path; The energy ezpenditure of all network nodes can be effectively reduced, thus improve network service quality.
The specific works principle of network information push method of the present invention and network information push device is described below by a specific embodiment.
In this specific embodiment, wireless sensor network has 1 gateway, 15 network nodes, gateway timing is these network node pushed information, each maximum pushed information amount pushing permission is 50 kilobytes, it is 0.35 unit that every kilobytes (K Bytes) every meter (m) push energy consumption cost, when last network node returns confirmation to gateway, every meter pushes energy consumption cost is 0.98 unit.
Table 1 gives the X of network node relative to gateway, Y-coordinate, and the pushed information amount of each node (unit is K Bytes).
Table 1 (demand unit: K Bytes; Coordinate unit: m)
Existing network information push pushes successively (from No. 15 network nodes to No. 1 network node) according to node serial number, and the maximum pushed information amount that every bar pushes path is 50 kilobytes.Do not consider the relative position of network node and gateway and the pushed information amount of network node.
Please refer to Fig. 8 A, Fig. 8 A is the propelling movement path schematic diagram of existing network information push method and network information push device.In figure, 0 represents gateway, and 1-15 represents each network node, and black circle is larger, represent that this network node information needed amount is larger, solid line represents information pushing path, and after dotted line represents that information arrives last network node, this network node beams back confirmation to gateway.As can be seen from the figure, in a communication session, always have 6 propelling movements, therefore have 6 information pushing paths, pushing total distance is 248 meters, the information load utilance in each information pushing path is respectively 96%, 84%, 72%, 70%, 94%, 26%, the average information load utilance in all information pushing paths is about 74%.The reason that the information pushing path of this technical scheme acquisition is undesirable is the constraint that only considered the maximum pushed information amount that gateway single pushes, and due to network node be order choose, have ignored gateway and the relative coordinate residing for each network node, successive ignition evolutionary operation is not had yet, thus the network node combination choosing the best is difficult to, each information pushing path may be caused thus mutually to intersect more, thus cause total propelling movement distance longer; And the quantity in the information pushing path got may be on the high side, the load in each bar information pushing path is caused not to be fully utilized.These all cause overall energy consumption and remain high.
Please refer to Fig. 8 B, Fig. 8 B is the propelling movement path schematic diagram of network information push method of the present invention and network information push device.In figure, 0 represents gateway, and 1-15 represents each network node, and black circle is larger, represent that this network node information needed amount is larger, solid line represents information pushing path, and after dotted line represents that information arrives last network node, this network node beams back confirmation to gateway.Be clearly shown that in Fig. 8 B that the information pushing path after successive ignition optimization essentially eliminates intersection, and number ratio Fig. 8 A in information pushing path decreases one, push total distance and only have 207 meters, bring the reduction of overall energy consumption cost, the information load utilance in each information pushing path is respectively 86%, 94%, 80%, 82%, 100%, the average information load utilance in all information pushing paths is about 89%.Total pushed information amount like this with effective group of maximum total pushed information amount is less than 1.25:1 with the ratio of total pushed information amount of effective group with minimum total pushed information amount, greatly improves the average information load utilance in information pushing path.The propelling movement energy consumption cost of prior art is 1694 units, and propelling movement energy consumption cost of the present invention is 1415 units, and the cost range of decrease is 16.5%.
In sum, scheme compared to existing technology of the present invention decreases the quantity in information pushing path, shortens and pushes total distance; The average information load utilance in each information pushing path significantly promotes, and takes full advantage of bandwidth; Overall energy consumption cost obviously reduces.Although gateway needs to carry out successive ignition computing to information pushing path, the energy ezpenditure of each network node can be greatly reduced, thus the overall energy consumption of whole network is declined, thus improve network service quality, extend the network operation cycle.
Network information push method of the present invention and network information push device, by network node and the relative position of gateway and the pushed information amount of network node, carry out to network node the determination operation that division operation and effective information push path; The energy ezpenditure of all network nodes can be effectively reduced, thus improve network service quality; Solve the technical problem that energy ezpenditure is excessive and network service quality is lower of the network node of existing network information push method and network information push device.
Each functional unit in the embodiment of the present invention can be integrated in a processing module, also can be that the independent physics of unit exists, also can be integrated in a module by two or more unit.Above-mentioned integrated module both can adopt the form of hardware to realize, and the form of software function module also can be adopted to realize.If described integrated module using the form of software function module realize and as independently production marketing or use time, also can be stored in a computer read/write memory medium.The above-mentioned storage medium mentioned can be read-only memory, disk or CD etc.Above-mentioned each device or system, can perform the method in correlation method embodiment.
In sum; although the present invention discloses as above with preferred embodiment; but above preferred embodiment is also not used to limit the present invention; those of ordinary skill in the art; without departing from the spirit and scope of the present invention; all can do various change and retouching, the scope that therefore protection scope of the present invention defines with claim is as the criterion.
Claims (10)
1. a network information push method, is characterized in that, comprising:
Obtain the relative position of each network node and gateway, and the pushed information amount of all described network nodes;
According to described network node and the relative position of described gateway and the pushed information amount of described network node, division operation is carried out to described network node, obtains multiple effective group; And determine that the effective information of each described effective group pushes path; And
Push path according to described effective information, network information push operation is carried out to the described network node in described effective group.
2. network information push method according to claim 1, is characterized in that, total pushed information amount of the described network node in each described effective group is less than or equal to predetermined value.
3. network information push method according to claim 1, it is characterized in that, described total pushed information amount with described effective group of maximum total pushed information amount is 1:1 to 1.25:1 with the ratio of described total pushed information amount of described effective group with minimum total pushed information amount.
4. network information push method according to claim 1, it is characterized in that, describedly according to described network node and the relative position of described gateway and the pushed information amount of described network node, division operation is carried out to described network node, obtain multiple effective group; And determine that the step in the effective information propelling movement path of each described effective group comprises:
According to described network node and the relative position of described gateway and the pushed information amount of described network node, use scanning algorithm to obtain to meet pre-conditioned all default group and corresponding presupposed information pushes path; And
Use partheno genetic algorithm, path is pushed to all described default groups and corresponding described presupposed information and carries out least energy consumption calculating, described default group minimum for energy consumption and corresponding described presupposed information are pushed path and pushes path as described effective group and described effective information.
5. network information push method according to claim 4, is characterized in that, described pre-conditioned total pushed information amount for the described network node in each described default group is less than or equal to predetermined value.
6. a network information push device, is characterized in that, comprising:
Nodal information acquisition module, for obtaining the relative position of each network node and gateway, and the pushed information amount of all described network nodes;
Push path determination module, for according to the relative position of described network node and described gateway and the pushed information amount of described network node, division operation is carried out to described network node, obtain multiple effective group; And determine that the effective information of each described effective group pushes path; And
Pushing module, for pushing path according to described effective information, carries out network information push operation to the described network node in described effective group.
7. network information push device according to claim 6, is characterized in that, total pushed information amount of the described network node in each described effective group is less than or equal to predetermined value.
8. network information push device according to claim 6, it is characterized in that, described total pushed information amount with described effective group of maximum total pushed information amount is 1:1 to 1.25:1 with the ratio of described total pushed information amount of described effective group with minimum total pushed information amount.
9. network information push device according to claim 6, is characterized in that, described propelling movement path determination module comprises:
Presupposed information pushes path acquiring unit, for according to the relative position of described network node and described gateway and the pushed information amount of described network node, use scanning algorithm to obtain and meet pre-conditioned all default group and corresponding presupposed information propelling movement path; And
Effective information pushes path acquiring unit, for using partheno genetic algorithm, path is pushed to all described default groups and corresponding described presupposed information and carries out least energy consumption calculating, described default group minimum for energy consumption and corresponding described presupposed information are pushed path and pushes path as described effective group and described effective information.
10. network information push device according to claim 9, is characterized in that, described pre-conditioned total pushed information amount for the described network node in each described default group is less than or equal to predetermined value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410782814.5A CN104410714B (en) | 2014-12-16 | 2014-12-16 | Network information push method and network information push device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410782814.5A CN104410714B (en) | 2014-12-16 | 2014-12-16 | Network information push method and network information push device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104410714A true CN104410714A (en) | 2015-03-11 |
| CN104410714B CN104410714B (en) | 2018-02-13 |
Family
ID=52648309
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410782814.5A Expired - Fee Related CN104410714B (en) | 2014-12-16 | 2014-12-16 | Network information push method and network information push device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104410714B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018149371A1 (en) * | 2017-02-15 | 2018-08-23 | 腾讯科技（深圳）有限公司 | Flow and service allocation method and apparatus for push information order, and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101483902A (en) * | 2009-02-25 | 2009-07-15 | 南京邮电大学 | Wireless multimedia sensor network routing method for guaranteeing QoS |
| CN102056079A (en) * | 2009-10-30 | 2011-05-11 | 中国移动通信集团上海有限公司 | Method, device and system for determining information to be pushed |
| CN102209033A (en) * | 2011-05-24 | 2011-10-05 | 哈尔滨工程大学 | Cluster-based routing method for wireless sensor networks |
| CN103068002A (en) * | 2012-12-27 | 2013-04-24 | 重庆邮电大学 | Efficient routing method of high rate-wireless personal area network (HR-WPAN) mesh network |
| US20140242943A1 (en) * | 2011-06-24 | 2014-08-28 | Jasper Wireless, Inc. | Core services platform for wireless voice, data and messaging network services |
-
2014
- 2014-12-16 CN CN201410782814.5A patent/CN104410714B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101483902A (en) * | 2009-02-25 | 2009-07-15 | 南京邮电大学 | Wireless multimedia sensor network routing method for guaranteeing QoS |
| CN102056079A (en) * | 2009-10-30 | 2011-05-11 | 中国移动通信集团上海有限公司 | Method, device and system for determining information to be pushed |
| CN102209033A (en) * | 2011-05-24 | 2011-10-05 | 哈尔滨工程大学 | Cluster-based routing method for wireless sensor networks |
| US20140242943A1 (en) * | 2011-06-24 | 2014-08-28 | Jasper Wireless, Inc. | Core services platform for wireless voice, data and messaging network services |
| CN103068002A (en) * | 2012-12-27 | 2013-04-24 | 重庆邮电大学 | Efficient routing method of high rate-wireless personal area network (HR-WPAN) mesh network |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018149371A1 (en) * | 2017-02-15 | 2018-08-23 | 腾讯科技（深圳）有限公司 | Flow and service allocation method and apparatus for push information order, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104410714B (en) | 2018-02-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Johansson et al. | Reducing interference in ad hoc networks through topology control | |
| Farsi et al. | A congestion-aware clustering and routing (CCR) protocol for mitigating congestion in WSN | |
| CN104579957A (en) | Routing method of delay tolerant network based on degree of intimacy and time constraint forwarding | |
| Wang et al. | A gradual noisy chaotic neural network for solving the broadcast scheduling problem in packet radio networks | |
| Wang et al. | An improved routing algorithm based on social link awareness in delay tolerant networks | |
| Banerjee et al. | EER: Energy efficient routing in wireless sensor networks | |
| CN107911859B (en) | Life cycle prolonging method of underwater wireless sensor network based on cross-layer design | |
| CN102946443B (en) | Multitask scheduling method for realizing large-scale data transmission | |
| Tang et al. | Achieving data k-availability in intermittently connected sensor networks | |
| CN106209683B (en) | Data transmission method and system based on data center's wide area network | |
| CN104410714A (en) | Network information pushing method and network information pushing device | |
| CN102075582A (en) | Storage method for data storage model of credible cloud storage system | |
| Roumy et al. | Optimal matching in wireless sensor networks | |
| Malshetty et al. | Efficient clustering in WSN-Cloud using LBSO (load based Self-Organized) technique | |
| Ahmad et al. | A reliability calculations model for large-scale MANETs | |
| Singh et al. | Mutual exclusive distributive clustering (medc) protocol for wireless sensor networks | |
| Yanez-Marquez et al. | BDD-based algorithm for the minimum spanning tree in wireless ad-hoc network routing | |
| KR101533025B1 (en) | Method for reconstructing tree wireless sensor network | |
| Orlinski et al. | Distributed expectation-based spatio-temporal cluster detection for pocket switched networks | |
| Zhang et al. | Crossed cube ring: a k-connected virtual backbone for wireless sensor networks | |
| Javeed et al. | A review on variant clustering designs in heterogeneous WSNs | |
| Xiong et al. | Fault-tolerant topology evolution and analysis of sensing systems in IoT based on complex networks | |
| Yao et al. | Reliability of wireless sensor network: Hotspot and critical challenges | |
| CN112446463A (en) | Neural network full-connection layer operation method and device and related products | |
| Jia et al. | Opportunistic transmission mechanism based on si in mobile crowd sensing networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180213 Termination date: 20191216 |