CN106792838A - DTN via node Candidate Set systems of selection - Google Patents

DTN via node Candidate Set systems of selection Download PDF

Info

Publication number
CN106792838A
CN106792838A CN201710150499.8A CN201710150499A CN106792838A CN 106792838 A CN106792838 A CN 106792838A CN 201710150499 A CN201710150499 A CN 201710150499A CN 106792838 A CN106792838 A CN 106792838A
Authority
CN
China
Prior art keywords
node
energy
information
neighbor node
neighbor
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
Application number
CN201710150499.8A
Other languages
Chinese (zh)
Other versions
CN106792838B (en
Inventor
刘可文
杨知桃
熊红霞
陆东城
刘紫龙
王思力
郭志强
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wuhan University of Technology WUT
Original Assignee
Wuhan University of Technology WUT
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Wuhan University of Technology WUT filed Critical Wuhan University of Technology WUT
Priority to CN201710150499.8A priority Critical patent/CN106792838B/en
Publication of CN106792838A publication Critical patent/CN106792838A/en
Application granted granted Critical
Publication of CN106792838B publication Critical patent/CN106792838B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/06—Testing, supervising or monitoring using simulated traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0215—Traffic management, e.g. flow control or congestion control based on user or device properties, e.g. MTC-capable devices
    • H04W28/0221—Traffic management, e.g. flow control or congestion control based on user or device properties, e.g. MTC-capable devices power availability or consumption
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
    • H04W28/0236—Traffic management, e.g. flow control or congestion control based on communication conditions radio quality, e.g. interference, losses or delay
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • 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/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a kind of DTN via nodes Candidate Set system of selection, node scan determines its neighbor node collection；Node exchanges metadata with its neighbor node；Node determines the need for forwarding information to the neighbor node according to the information list for exchanging, and if desired forwards information to the neighbor node, then calculate dynamic energy threshold；With the energy threshold for calculating be compared the dump energy of neighbor node by node, if the dump energy of neighbor node is not less than energy threshold, using the neighbor node as via node Candidate Set, if the dump energy of neighbor node is less than energy threshold, the neighbor node is not selected as via node.The present invention eliminates possibility of the not enough node of energy as via node by dynamic power threshold strategies, more accurately determines the Candidate Set of via node, and network overhead is greatly reduced while ensureing that identical network submits rate and time delay.

Description

DTN via node Candidate Set systems of selection
Technical field
It is a kind of in particular in time delay tolerant network (DTN) technology the present invention relates to wireless network communication technique field DTN via node Candidate Set systems of selection.
Background technology
DTN is mainly used in the fields such as military affairs, aviation, the research of animal trace.In the absence of road end to end in DTN communications Footpath, link off and on, the change of network topology structure moment, and node has the resource critical constraints of mobility, node, because This, data communication has certain challenge in DTN.Research shows that more than 95% information need to all be saved via relaying in DTN communications The forwarding of point can just be ultimately delivered to destination node, and the select permeability of via node is always the emphasis and difficult point of research.
In DTN, communication apparatus node is influenceed by factors such as own hardware, cost, volume, environment, and the energy of node is general All it is limited.In communication process, the energy of node can be during the forwarding of information with reception and discovery neighbor node Substantial amounts of consumption, if the dump energy of node is not enough, information cannot continue to be passed；If substantial amounts of node energy is deficient Network paralysis, the normal communication of influence can be directly resulted in.The energy of node be can not ignore in DTN communication process one because Element.
The content of the invention
A kind of DTN via node Candidate Set systems of selection based on dynamic power threshold value proposed by the invention, fully examine Energy consumption and dump energy that neighbor node receives simultaneously forwarding information process are considered, to select more excellent via node to provide a kind of solution Scheme, so keep it is identical submit rate and time delay on the basis of reduce network overhead.
To achieve the above object, a kind of DTN via nodes Candidate Set system of selection designed by the present invention, including following step Suddenly：
1) node scan determines its neighbor node collection；
2) node exchanges metadata, the metadata bag with one of neighbor node that the neighbor node is concentrated Include node ID, residue energy of node and nodal information list；
3) nodal information list of the node in neighbor node metadata determines the need for forwarding information to neighbour Node is occupied, the neighbor node is if desired forwarded information to, gone to step 4), otherwise, gone to step 6)；
4) node calculates the neighbor node and receives and forward the information needs according to the size of the information that will be forwarded The energy of consumption, the energy of consumption is needed along with the neighbor node completes single pass, obtains energy threshold；
5) with the energy threshold for calculating be compared the dump energy of neighbor node by the node, if neighbor node is surplus Complementary energy is not less than energy threshold, goes to step 7), otherwise, goes to step 6)；
6) neighbor node is not selected as via node；
7) neighbor node is added the Candidate Set of via node.
Preferably, the step 2) computing formula of metadata interior joint dump energy is：
Eor(n ')=Eor(n′-1)-Ec(Δt)
Wherein；Eor(n ') represents the dump energy before the secondary forwarding of node the n-th ', Eor(n ' -1) represents that node completes the Residual energy value, E before -1 forwarding of n 'c(Δ t) is Δ t interim node energy consumption figures, and Δ t is that distance is last to be forwarded Time, Ec(Δ t) includes that node completes the n-th ' -1 information and forwards the energy and Δ t internal segment spot scan neighbor nodes of consumption to disappear The energy of consumption, n ' is the natural number of expression number of times.
Preferably, the step 3) described in node will be own information list and the neighbor node metadata for obtaining in Whether nodal information list compares, judge the information in the nodal information list of neighbor node comprising institute in self information list Comprising all information, if being included and letter that the nodal information list of neighbor node does not include in there is own node information list Breath, then illustrate that the node needs to forward this information to the neighbor node, and this need not be forwarded information to if the explanation in the absence of if Neighbor node.
Preferably, the step 4) in energy threshold be dynamic value.The step 4) in the computing formula of energy threshold be：
δth=δth_em+b
Wherein：δthFor neighbor node assists that information is successfully submitted the minimum energy value of needs, b is fixed value, represents adjacent Occupy node and complete the energy value that single pass needs to consume, δth_emIt is the receive information estimated according to the information size of forwarding And the energy value that current forward node needs to consume is completed, computing formula is：
δth_em=δr+δf=(k1+k2)Pmin,size
Wherein：k1It is fixed value, states the energy that the neighbor node forwarding unit information is consumed, k2It is fixed value, table State the energy that neighbor node recruiting unit information is consumed, Pmin,sizeExist in expression node own node information list, but should Non-existent information concentrates the size of minimal information in information of neighbor nodes list.
Preferably, the step 7) in be by the neighbor node selected as candidates via node, specifically whether be elected to be relaying section Point is determined according to routing policy, not in present invention description scope.
Principle of the invention is as follows：
1st, node energy model
According to DTN Network Communication Principles, DTN communication process mainly includes findings that stage and stage of communication, as shown in Figure 1. And the state of node can be briefly described into search condition (SS, Search State), forwarding state (FS, Forward ) and reception state (RS, Receive State) State.In discovery phase, node enters to the neighbor node that can around communicate Row scanning, node state is SS.Realize information exchange in stage of communication, including information forwarding and information receive, node transition Respectively FS and RS.Enter stage of communication after node scan is to neighbor node, complete data communication posterior nodal point and go successively to hair At this stage.
DTN communication in, the energy of node can constantly be consumed, and often occur node because energy deficiency lose logical Letter ability, reduces the situation of communication efficiency.According to DTN communication process, the energy ezpenditure of node mainly includes data communication process Consumption and search procedure consume two aspects.Node energy consumption figures EcCan be represented with following expression：
Ec=Ess+Efs+Ers (1)
Wherein,The energy consumption of node searching process is represented, with searching timesIt is directly proportional, T represents completion once Search for the time for needing, t is the network operation time, and b is fixed value.Efs=k1Pf,sizeRepresent the energy of node forwarding information consumption Amount, represents and is directly proportional to the size of the packet of forwarding, k1It is fixed value, represents the energy that node forwarding unit information is consumed Amount, Pf,sizeRepresent the size of node forwarding information.Ers=k2Pr,sizeThe energy consumed by node receive information, k2It is fixation Value, represents the energy that node recruiting unit information is consumed, Pr,sizeIt is the size of the information that node is received.Therefore, formula (1) Can be rewritten into：
And the energy source of communication node is mainly made up of initial quantity of electricity value and collection energy value.Do not considering energy collection The energy source E of node is represented by the basis of process：
E=Einit (3)
EinitRepresent the energy of node initializing.
2nd, via node Candidate Set selection
Node is in selecting after the minimum energy for needing consumption before node to receive information and completion primary information forwarding respectively Amount is estimated.Wherein, receiving the information of other nodes forwarding needs the least energy δ of consumptionrCan be expressed as：
δr=k2Pmin,size (4)
Pmin,sizeExist in expression nodal information list, but non-existent information is concentrated most in the information of neighbor nodes list The size of small information.
Completing the information forwarding of node needs the least energy δ of consumptionfCan be expressed as：
δf=k1Pmin,size (5)
Then receiving node information and complete once forward required for consumption energy value δth_emFor：
δth_em=δr+δf=(k1+k2)Pmin,size (6)
The premise that node is selected as via node is that the dump energy of node must enough complete single pass, information and connect Receive and forward, that is to say, that the dump energy of node must not drop below receive information and complete primary information and forwards consumed energy The energy that amount and node scan are once consumed, the energy is referred to as energy threshold δth.Node needs to be forwarded to neighbor node every time Information it is different, so energy threshold is dynamic value.
Energy threshold δthComputing formula it is as follows：
δth=δth_em+b (7)
So, when node A searches neighbor node collection { A1,A2..., AnWhen, neighbor node can be chosen as Centroid On condition that the dump energy E of neighbor nodeorMust not drop below the information for completing node A forwarding reception, complete single pass and The energy δ of consumption required for primary information forwardingth, consider that neighbor node is once delivered to the situation of destination node here, it is institute Need the minimum value of energy.That is neighbor node dump energy EorNeed to meet：
Eor≥δth (8)
The surplus value of energy before the secondary forwarding of node the n-th '：
Eor(n ')=Eor(n′-1)-Ec(Δt) (9)
Eor(n ' -1) represents node residual energy value, E before the n-th ' -1 forwarding is completedc(Δ t) is Δ t time interior nodes Energy consumption values, specifically, calculated according to formula (2), Δ t is the time of the last forwarding of distance, including node complete the n-th '- The energy of 1 information forwarding consumption and the energy of Δ t internal segment spot scans neighbor node consumption.
The advantage of the invention is that：First, taken into full account that DTN communication process interior joint communicates in search phase and information The energy ezpenditure in stage, is modeled to energy consuming process；Secondly, it is contemplated that information communication process energy consumption of different sizes is not Deng situation；Furthermore, before node selects via node forwarding information every time, to this receive information and complete primary information turn The energy consumption of hair and estimated, along with the energy ezpenditure that node completes single pass obtains energy threshold, and saved with neighbours The dump energy of point is compared, and eliminates the not enough node of energy as the possibility of via node, is more accurately determined The Candidate Set of via node；Finally, the present invention is to have done pre- to neighbor node according to residue energy of node before Path selection Treatment, network overhead is substantially reduced on the basis of can submitting rate and time delay identical network is realized, while improving network Life cycle.
Brief description of the drawings
Fig. 1 is the state diagram of DTN nodes.
Fig. 2 is DTN network service figures.
Fig. 3 is the flow chart of DTN via nodes Candidate Set system of selection embodiment of the present invention.
Specific embodiment
In order to become apparent from the solution of the present invention and realize effect, below in conjunction with the drawings and specific embodiments the present invention is made into One step ground is described in detail.
Fig. 2 show a part for DTN network services, and letter A, B, S, C are node identifier (node ID) in figure, real Heart round dot represents communication node, and the circular dashed line being enclosed in outside node represents the communication range of node.As shown in Fig. 2 t1Moment Neighbor node A, neighbor node B and neighbor node C are arrived in node S scannings.
As shown in figure 3, a kind of DTN via nodes Candidate Set system of selection of the invention, comprises the following steps：
1) node scan determines its neighbor node collection.
2) node exchanges metadata with one of neighbor node that neighbor node is concentrated, and metadata includes node ID, section Point dump energy and nodal information list.
Node S interacts metamessage with neighbor node A first, including node ID, node information list, the residual energy of node Amount etc..Such as information list of node S is MS={ m1,m3,m4,m5,m9,m10,m12, the information list of neighbor node A is MA= {m2,m3,m5,m6, the dump energy of neighbor node A isUnit is J.
3) nodal information list of the node in neighbor node metadata determines the need for forwarding information and gives neighbours' section Point, if desired forwards information to the neighbor node, goes to step 4), otherwise, goes to step 6).
Node S can determine existence information list M={ m according to the metamessage for exchanging1,m4,m9,m10,m12In information In node S, and do not exist in neighbor node A.This explanation needs for the information in M or a part of information to be forwarded to neighbor node In A, that is, during node S needs to forward information to neighbor node A.
4) node according to the size of the information that will be forwarded calculate the neighbor node receive and forward the information need consumption Energy, along with the neighbor node complete single pass need consumption energy, obtain energy threshold.
Node S receives the information and completes the least energy δ that information once forwards needs according to the information butt joint in Mth_emEnter Row is estimated, δth_emWith neighbor node A complete single pass consume it is energy and, be energy threshold δth, unit is J.Node is every It is secondary to need the information for being forwarded to neighbor node different (information size and information number all be different), so energy threshold is dynamic Value.Computing formula is：
δth_em=δr+δf=(k1+k2)Pmin,size
δth=δth_em+b
Wherein, Pmin,sizeEqual to MA={ m2,m3,m5,m6In minimal information size, unit is Byte, k1It is fixed value, table Show the energy that node forwarding unit byte information is consumed, unit is J/Byte, k2It is fixed value, represents node recruiting unit word The energy that section information is consumed, unit is J/Byte, and b represents the energy that node scan once needs, and unit is J/ times, Lin Jujie Point A can assist in successfully the least energy δ of handover information needsthEnergy, Lin Jujie including the consumption of neighbor node A receive informations The energy and neighbor node A of point A sweep neighbor node consumption forward the information to destination node needs the energy of consumption.
5) with the energy threshold for calculating be compared the dump energy of neighbor node by node, if the residual energy of neighbor node Amount is not less than energy threshold, goes to step 7), otherwise, goes to step 6).
Node S is by the dump energy of neighbor node AWith the energy threshold δ for calculatingthIt is compared.If Illustrate the information of the enough receiving node S forwardings of dump energy of neighbor node A and complete the once forwarding of receive information, Lin Jujie Point A can be selected as via node Candidate Set, step 7 of walking around)；IfIllustrate the dump energy of neighbor node A not Foot, this cannot function as via node and assists forwarding information, goes to step 6).
6) neighbor node is not selected as via node.
7) neighbor node is added the Candidate Set of via node.
After node S and node A completes information forwarding, may proceed to next neighbor node according to step 2)~step 7) Description scheme judged, determines whether the neighbor node can be used as via node Candidate Set.
A kind of DTN via nodes Candidate Set system of selection of the present invention, is the basis before via node during DTN communicates determines Dynamic power threshold value selects suitable via node Candidate Set, and whether the present invention receives enough according to the dump energy of neighbor node And complete single pass and once forward the energy of consumption to determine relay candidate node.Need to be forwarded to neighbours every time due to node The information size and number of node are different, receive and forward these information to need the energy of consumption also different, therefore energy threshold It is dynamic value.The neighbor node selected as candidates via node of via node Candidate Set will be added, specifically whether be elected to be via node It is to be determined according to routing policy, not in present invention description scope.In DTN communications, every information for needing to forward according to node It is to estimate the energy for receiving and forwarding the needs consumption of these information and big according to the energy and neighbor node dump energy estimated The small thought to determine relay candidate node is all inconsistent with this programme.
The content not being described in detail in this specification belongs to prior art known to professional and technical personnel in the field.

Claims (5)

1. a kind of DTN via nodes Candidate Set system of selection, it is characterised in that：Comprise the following steps：
1) node scan determines its neighbor node collection；
2) neighbor node that the node is concentrated with the neighbor node exchanges metadata, and the metadata includes node ID, residue energy of node and nodal information list；
3) nodal information list of the node in neighbor node metadata determines the need for forwarding information and gives neighbours' section Point, if desired forwards information to the neighbor node, goes to step 4), otherwise, goes to step 6)；
4) node according to the size of the information that will be forwarded calculate the neighbor node receive and forward the information need consumption Energy, along with the neighbor node complete single pass need consumption energy, obtain energy threshold；
5) with the energy threshold for calculating be compared the dump energy of neighbor node by the node, if the residual energy of neighbor node Amount is not less than energy threshold, goes to step 7), otherwise, goes to step 6)；
6) neighbor node is not selected as via node；
7) neighbor node is added the Candidate Set of via node.
2. DTN via nodes Candidate Set system of selection according to claim 1, it is characterised in that：The step 2) first number Computing formula according to interior joint dump energy is：
Eor(n ')=Eor(n′-1)-Ec(Δt)
Wherein；Eor(n ') represents the dump energy before the secondary forwarding of node the n-th ', Eor(n ' -1) represents that node is completed the n-th ' -1 time Residual energy value, E before forwardingc(Δ t) is Δ t interim node energy consumption figures, Δ t be the last forwarding of distance when Between, Ec(Δ t) includes that node completes the n-th ' -1 information and forwards what the energy and Δ t internal segment spot scans neighbor node of consumption were consumed Energy, n ' is the natural number of expression number of times.
3. DTN via nodes Candidate Set system of selection according to claim 1, it is characterised in that：The step 3) in institute State nodal information list of the node by own information list in the neighbor node metadata for obtaining to compare, judge that neighbours save Whether the information in the nodal information list of point includes all information included in self information list, if there is own node Included and information that the nodal information list of neighbor node does not include in information list, then illustrate that the node needs to forward the letter The neighbor node is ceased, the neighbor node need not be forwarded information to if the explanation in the absence of if.
4. DTN via nodes Candidate Set system of selection according to claim 1, it is characterised in that：The step 4) in energy Amount threshold value is dynamic value.
5. DTN via nodes Candidate Set system of selection according to claim 4, it is characterised in that：The energy threshold Computing formula is：
δth=δth_em+b
Wherein：δthFor neighbor node assists that information is successfully submitted the minimum energy value of needs, b is fixed value, represents neighbours' section Point completes single pass needs the energy value of consumption, δth_emIt is according to the receive information estimated of information size of forwarding and complete The energy value of consumption is needed into current forward node, computing formula is：
δth_em=δr+δf=(k1+k2)Pmin,size
Wherein：k1It is fixed value, states the energy that the neighbor node forwarding unit information is consumed, k2It is fixed value, statement is adjacent Occupy the energy that node recruiting unit information is consumed, Pmin,sizeExist in expression node own node information list, but the neighbours Non-existent information concentrates the size of minimal information in nodal information list.
CN201710150499.8A 2017-03-14 2017-03-14 DTN relay node candidate set selection method Expired - Fee Related CN106792838B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710150499.8A CN106792838B (en) 2017-03-14 2017-03-14 DTN relay node candidate set selection method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710150499.8A CN106792838B (en) 2017-03-14 2017-03-14 DTN relay node candidate set selection method

Publications (2)

Publication Number Publication Date
CN106792838A true CN106792838A (en) 2017-05-31
CN106792838B CN106792838B (en) 2020-04-03

Family

ID=58962724

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710150499.8A Expired - Fee Related CN106792838B (en) 2017-03-14 2017-03-14 DTN relay node candidate set selection method

Country Status (1)

Country Link
CN (1) CN106792838B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107359926A (en) * 2017-06-19 2017-11-17 华侨大学 A kind of full duplex relaying transmission method based on energy state
CN110381559A (en) * 2019-06-29 2019-10-25 中国人民解放军军事科学院国防科技创新研究院 Distributed wireless networks frequency spectrum access method based on global optimum's threshold
CN111343067A (en) * 2020-03-23 2020-06-26 珠海格力电器股份有限公司 Method for establishing relay node of CAN communication network and CAN communication network
CN111586761A (en) * 2020-04-29 2020-08-25 南华大学 Multi-factor balanced overlapped non-uniform clustering WSN (Wireless sensor network) balanced data transmission method
CN114079873A (en) * 2020-08-14 2022-02-22 展讯半导体(南京)有限公司 Multicast communication method and device without clear target user, storage medium, terminal and base station

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101741685A (en) * 2008-11-14 2010-06-16 华为技术有限公司 Route searching method and routing device
US20150237563A1 (en) * 2014-02-17 2015-08-20 Telefonaktiebolaget L M Ericsson (Publ) Method for Improving Data Throughput in Wireless Networks
CN106028417A (en) * 2016-05-26 2016-10-12 重庆大学 Wireless sensor network path planning method based on node energy consumption and remaining energy
CN106068027A (en) * 2016-05-25 2016-11-02 重庆邮电大学 The system adaptive recognition method of Situation Awareness in chance intelligent perception network
CN106211259A (en) * 2016-07-29 2016-12-07 北京智芯微电子科技有限公司 The route implementation method of a kind of time delay tolerant network and realize device

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101741685A (en) * 2008-11-14 2010-06-16 华为技术有限公司 Route searching method and routing device
US20150237563A1 (en) * 2014-02-17 2015-08-20 Telefonaktiebolaget L M Ericsson (Publ) Method for Improving Data Throughput in Wireless Networks
CN106068027A (en) * 2016-05-25 2016-11-02 重庆邮电大学 The system adaptive recognition method of Situation Awareness in chance intelligent perception network
CN106028417A (en) * 2016-05-26 2016-10-12 重庆大学 Wireless sensor network path planning method based on node energy consumption and remaining energy
CN106211259A (en) * 2016-07-29 2016-12-07 北京智芯微电子科技有限公司 The route implementation method of a kind of time delay tolerant network and realize device

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107359926A (en) * 2017-06-19 2017-11-17 华侨大学 A kind of full duplex relaying transmission method based on energy state
CN107359926B (en) * 2017-06-19 2019-12-13 华侨大学 Full-duplex relay transmission method based on energy state
CN110381559A (en) * 2019-06-29 2019-10-25 中国人民解放军军事科学院国防科技创新研究院 Distributed wireless networks frequency spectrum access method based on global optimum's threshold
CN111343067A (en) * 2020-03-23 2020-06-26 珠海格力电器股份有限公司 Method for establishing relay node of CAN communication network and CAN communication network
CN111343067B (en) * 2020-03-23 2020-12-04 珠海格力电器股份有限公司 Method for establishing relay node of CAN communication network and CAN communication network
CN111586761A (en) * 2020-04-29 2020-08-25 南华大学 Multi-factor balanced overlapped non-uniform clustering WSN (Wireless sensor network) balanced data transmission method
CN114079873A (en) * 2020-08-14 2022-02-22 展讯半导体(南京)有限公司 Multicast communication method and device without clear target user, storage medium, terminal and base station
CN114079873B (en) * 2020-08-14 2023-03-24 展讯半导体(南京)有限公司 Multicast communication method and device without clear target user, storage medium, terminal and base station

Also Published As

Publication number Publication date
CN106792838B (en) 2020-04-03

Similar Documents

Publication Publication Date Title
CN106792838A (en) DTN via node Candidate Set systems of selection
CN102404817B (en) Networking method and system for wireless sensor network based on multiple sink nodes
CN103457849B (en) The method that node apparatus and node apparatus perform
CN102271377B (en) Double-bounce multi-path route method of wireless sensor network based on energy collection technology
CN108696903A (en) A kind of LEACH algorithm optimization methods based on energy consumption balance
US20190098693A1 (en) Method for decentralized clustering in wireless sensor networks
CN102916879B (en) Rapid route convergence method
CN102497679B (en) Static clustering algorithm for wireless sensor network
CN101414964B (en) Method for reducing redundant message of delay-tolerant network and intermittently-connected network
CN103402234B (en) A kind of collecting network data of wireless sensor method
CN106411736A (en) Node resource discovery strategy optimization method for software defined satellite network
CN105959217A (en) Data processing method and apparatus for SDN Mobile Ad-Hoc Network
CN105246117B (en) A kind of implementation method of the energy-saving routing protocol suitable for mobile wireless Sensor Network
CN104579957A (en) Routing method of delay tolerant network based on degree of intimacy and time constraint forwarding
CN106131916A (en) A kind of wireless network method for routing foundation based on ant group algorithm
CN105898679B (en) It is a kind of based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer
CN108900996A (en) A kind of wireless sensor network data transmission method based on the double-deck fuzzy algorithmic approach
CN109547351A (en) Method for routing based on Q study and trust model in Ad Hoc network
CN104486741A (en) Trust state perceiving mixed service discovery method
CN106714263A (en) Wireless sensor network AODV routing protocol implementation system and method
Zuo et al. A hybrid multi-path routing algorithm for industrial wireless mesh networks
CN106911570B (en) A kind of reliable network data communication method
CN103095572A (en) Route maintenance method of multiple mobile sink wireless sensor networks (MMS-WSNs)
CN110035468A (en) Highly reliable high safety wireless network topology control system
CN105307231B (en) Tolerance delay network route implementation method based on collision probability and social analysis

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
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20200403

Termination date: 20210314

CF01 Termination of patent right due to non-payment of annual fee