CN106792838B - DTN relay node candidate set selection method - Google Patents

DTN relay node candidate set selection method Download PDF

Info

Publication number
CN106792838B
CN106792838B CN201710150499.8A CN201710150499A CN106792838B CN 106792838 B CN106792838 B CN 106792838B CN 201710150499 A CN201710150499 A CN 201710150499A CN 106792838 B CN106792838 B CN 106792838B
Authority
CN
China
Prior art keywords
node
information
energy
neighbor
neighbor node
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.)
Expired - Fee Related
Application number
CN201710150499.8A
Other languages
Chinese (zh)
Other versions
CN106792838A (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

Images

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 DTN relay node candidate set selection method, wherein a node scans and determines a neighbor node set; the node exchanges metadata with the neighbor nodes; the node determines whether the information needs to be forwarded to the neighbor node according to the exchanged information list, and if the information needs to be forwarded to the neighbor node, a dynamic energy threshold value is calculated; and the node compares the residual energy of the neighbor node with the calculated energy threshold, if the residual energy of the neighbor node is not less than the energy threshold, the neighbor node is used as a candidate set of the relay node, and if the residual energy of the neighbor node is less than the energy threshold, the neighbor node is not selected as the relay node. According to the invention, through a dynamic energy threshold strategy, the possibility that the node with insufficient energy is used as the relay node is eliminated, the candidate set of the relay node is determined more accurately, and the network overhead is greatly reduced while the same network delivery rate and delay are ensured.

Description

DTN relay node candidate set selection method
Technical Field
The invention relates to the technical field of wireless network communication, in particular to a selection method of a candidate set of a Delay Tolerant Network (DTN) relay node in a DTN technology.
Background
The DTN is mainly applied to the fields of military affairs, aviation, animal trail research and the like. End-to-end paths, link time interruption and network topology structure time change do not exist in DTN communication, and nodes have mobility and resources of the nodes are severely limited, so that data communication in the DTN has certain challenges. Research shows that more than 95% of information in DTN communication can be finally transmitted to a destination node only by forwarding through a relay node, and the problem of selecting the relay node is always a key point and a difficulty point of research.
In the DTN, the communication device node is affected by factors such as its hardware, cost, size, and environment, and the energy of the node is generally limited. In the communication process, the energy of the node is greatly consumed in the processes of forwarding, receiving and discovering the neighbor node of the information, and if the residual energy of the node is insufficient, the information cannot be continuously transmitted; if a large number of nodes are lack of energy, network paralysis can be caused directly, and normal communication is affected. The energy of the node is a non-negligible factor in the DTN communication process.
Disclosure of Invention
The DTN relay node candidate set selection method based on the dynamic energy threshold fully considers the energy consumption and the residual energy in the process of receiving and forwarding information by the neighbor nodes, provides a solution for selecting a better relay node, and further reduces the network overhead on the basis of keeping the same delivery rate and delay.
In order to achieve the above object, a DTN relay node candidate set selection method designed by the present invention includes the following steps:
1) scanning the nodes to determine a neighbor node set of the nodes;
2) the node exchanges metadata with one of the neighbor nodes in the neighbor node set, wherein the metadata comprises a node ID, node residual energy and a node information list;
3) the node determines whether information needs to be forwarded to the neighbor node according to a node information list in the neighbor node metadata, if the information needs to be forwarded to the neighbor node, the step 4) is carried out, and if not, the step 6) is carried out;
4) the node calculates the energy consumed by the neighbor node for receiving and forwarding the information according to the size of the information to be forwarded, and obtains an energy threshold value by adding the energy consumed by the neighbor node for completing one-time scanning;
5) the node compares the residual energy of the neighbor node with the calculated energy threshold, if the residual energy of the neighbor node is not less than the energy threshold, the step 7) is carried out, otherwise, the step 6) is carried out;
6) the neighbor node is not selected as a relay node;
7) and adding the neighbor node into the candidate set of the relay node.
Preferably, the calculation formula of the node residual energy in the metadata of step 2) is:
Eor(n′)＝Eor(n′-1)-Ec(Δt)
wherein; eor(n ') represents the residual energy of the node before the nth' retransmission, Eor(n '-1) represents the residual energy value of the node before completing the (n' -1) th forwarding, Ec(Δ t) is the node energy consumption value during the interval Δ t, Δ t is the time since the last forwarding, Ec(delta t) comprises the energy consumed by the node for completing the (n '-1) th information forwarding and the energy consumed by the node scanning neighbor nodes in delta t, and n' is a natural number representing the times.
Preferably, in the step 3), the node compares the own information list with the node information list in the acquired metadata of the neighboring node, and determines whether the information in the node information list of the neighboring node includes all information included in the own information list, if the information includes information included in the own node information list but not included in the node information list of the neighboring node, it indicates that the node needs to forward the information to the neighboring node, and if the information does not include information, it indicates that the node does not need to forward the information to the neighboring node.
Preferably, the energy threshold in the step 4) is a dynamic value. The calculation formula of the energy threshold in the step 4) is as follows:
δth＝δth_em+b
wherein: deltathMinimum energy value required for assisting neighbor nodes in successfully submitting information, b is a fixed value and represents that the neighbor nodes need to consume for completing one-time scanningEnergy value of, deltath_emIn order to estimate the received information according to the size of the forwarded information and complete the energy value consumed by the forwarding node, the calculation formula is as follows:
δth_em＝δr+δf＝(k1+k2)Pmin,size
wherein: k is a radical of1Is a fixed value and expresses the energy consumed by the neighbor node for forwarding unit information, k2Is a fixed value and expresses the energy consumed by the neighbor node for receiving the unit information, Pmin,sizeThe size of the minimum information in the information set which shows that the node exists in the node information list of the node, but does not exist in the neighbor node information list.
Preferably, the step 7) selects the neighbor node as a candidate relay node, and whether to select the neighbor node as the relay node is determined according to a routing policy, which is not within the scope of the description of the present invention.
The principle of the invention is as follows:
1. nodal energy model
According to the DTN network communication principle, the DTN communication process mainly includes a discovery phase and a communication phase, as shown in fig. 1. And the states of the nodes can be simply described as a Search State (SS), a Forwarding State (FS), and a Reception State (RS). In the discovery phase, the node scans surrounding neighbor nodes capable of communicating, and the node state is SS. And information interaction is realized in the communication stage, wherein the information interaction comprises information forwarding and information receiving, and node transition states are FS and RS respectively. And when the node scans the neighbor node, the node enters a communication stage, and after the data communication is completed, the node continues to enter a discovery stage.
In DTN communication, energy of a node is continuously consumed, and a situation that the node loses communication capability due to insufficient energy and communication efficiency is reduced often occurs. According to the DTN communication process, the energy consumption of the node mainly comprises two aspects of data communication process consumption and searching process consumption. Node energy consumption value EcCan be expressed by the following expression:
Ec＝Ess+Efs+Ers(1)
wherein the content of the first and second substances,
Figure BDA0001245425130000031
representing energy consumption of node searching process and searching times
Figure BDA0001245425130000032
In direct proportion, T represents the time required to complete a search, T is the network running time, and b is a fixed value. Efs＝k1Pf,sizeRepresenting the energy consumed by the node to forward the information, representing the proportional size of the forwarded packet, k1Is a fixed value, representing the energy consumed by a node to forward a unit of information, Pf,sizeIndicating the size of the node forwarding information. Ers＝k2Pr,sizeEnergy consumed by the node for receiving information, k2Is a fixed value, representing the energy consumed by the node to receive a unit of information, Pr,sizeThe size of the information received for a node. Thus, equation (1) can be rewritten as:
Figure BDA0001245425130000041
and the energy source of the communication node mainly comprises an initial electric quantity value and a collected energy value. The energy source E of a node without regard to the energy harvesting process may be represented as:
E＝Einit(3)
Einitrepresenting the energy of the node initialization.
2. Relay node candidate set selection
Before selecting the relay node, the node respectively estimates the minimum energy consumed for receiving the information and completing the information forwarding once. Wherein the minimum energy delta consumed for receiving the information forwarded by other nodesrCan be expressed as:
δr＝k2Pmin,size(4)
Pmin,sizeindicating the presence of the node information list but not the neighbor node information listThe size of the smallest information in the information set.
Minimum energy delta consumed for completing information forwarding of nodefCan be expressed as:
δf＝k1Pmin,size(5)
the node information is received and the energy value delta consumed to complete one forwarding is receivedth_emComprises the following steps:
δth_em＝δr+δf＝(k1+k2)Pmin,size(6)
the node is selected as the relay node on the premise that the residual energy of the node is enough to complete one scanning, information receiving and forwarding, that is, the residual energy of the node is not less than the energy consumed by receiving information and completing one information forwarding and the energy consumed by one scanning of the node, and the energy is called as an energy threshold value deltath. The information that a node needs to forward to a neighbor node every time is different, so the energy threshold is a dynamic value.
Energy threshold deltathThe calculation formula of (a) is as follows:
δth＝δth_em+b (7)
therefore, when node A searches for a set of neighboring nodes { A }1,A2，…,AnWhen the energy E is larger than the energy E of the neighbor node, the neighbor node can be selected as the central nodeorMust not be less than the energy delta consumed to complete the reception of the information forwarded by node a, complete one scan and one information forwardingthHere, the case where the neighbor node is delivered to the destination node at one time is considered to be the minimum value of the required energy. I.e. the neighbor node residual energy EorThe requirements are as follows:
Eor≥δth(8)
the residual value of the energy before the nth' forwarding of the node is as follows:
Eor(n′)＝Eor(n′-1)-Ec(Δt) (9)
Eor(n '-1) represents the residual energy value of the node before completing the (n' -1) th forwarding, Ec(Δt)Specifically, the energy consumption value of the node within the Δ t time is calculated according to the formula (2), and the Δ t is the time from the last forwarding, including the energy consumed by the node to complete the n' -1 th information forwarding and the energy consumed by the node scanning neighbor nodes within the Δ t.
The invention has the advantages that: firstly, the energy consumption of the nodes in the search stage and the information communication stage in the DTN communication process is fully considered, and the energy consumption process is modeled; secondly, the condition that the energy consumption is different in the communication process due to different information sizes is considered; before the node selects the relay node to forward the information each time, energy consumption and pre-estimation of information forwarding are carried out on the received information and the information forwarding completion, and energy consumption of the node completing one-time scanning is added to obtain an energy threshold value and is compared with the residual energy of the neighbor nodes, so that the possibility that the node with insufficient energy is used as the relay node is eliminated, and a candidate set of the relay node is determined more accurately; finally, the invention preprocesses the neighbor nodes according to the node residual energy before path selection, which can greatly reduce the network overhead and improve the life cycle of the network on the basis of realizing the same network delivery rate and delay.
Drawings
Fig. 1 is a state diagram of a DTN node.
Fig. 2 is a DTN network communication diagram.
Fig. 3 is a flowchart of an embodiment of a DTN relay node candidate set selection method according to the present invention.
Detailed Description
In order to make the technical solution and the achievement effect of the present invention clearer, the present invention is further described in detail with reference to the accompanying drawings and the specific embodiments.
Fig. 2 shows a part of DTN network communication, in which letters A, B, S, C are all node identifiers (node IDs), solid circles represent communication nodes, and circular dotted lines surrounding the nodes represent communication ranges of the nodes. As shown in FIG. 2, t1The time node S scans to neighbor node a, neighbor node B, and neighbor node C.
As shown in fig. 3, a DTN relay node candidate set selection method of the present invention includes the following steps:
1) the node scans to determine its set of neighbor nodes.
2) The node exchanges metadata with one of the neighbor nodes in the set of neighbor nodes, the metadata including a node ID, a node residual energy, and a node information list.
The node S firstly interacts meta-information with the neighbor node A, wherein the meta-information comprises a node ID, an information list of the node, residual energy of the node and the like. For example, the information list of the node S is MS＝{m1,m3,m4,m5,m9,m10,m12The information list of the neighbor node A is MA＝{m2,m3,m5,m6The residual energy of the neighbor node A is
Figure BDA0001245425130000061
The unit is J.
3) And the node determines whether the information needs to be forwarded to the neighbor node according to a node information list in the neighbor node metadata, if the information needs to be forwarded to the neighbor node, the step 4) is carried out, and if not, the step 6) is carried out.
The node S may determine from the exchanged meta-information that the presence information list M ═ M1,m4,m9,m10,m12The information in is in node S and not in the neighbor node a. This means that the information or a part of the information in M needs to be forwarded to the neighboring node a, i.e. the node S needs to forward the information to the neighboring node a.
4) The node calculates the energy consumed by the neighbor node for receiving and forwarding the information according to the size of the information to be forwarded, and obtains the energy threshold by adding the energy consumed by the neighbor node for completing one-time scanning.
The node S receives the information according to the information in the M and completes the minimum energy delta required by the information for one-time forwardingth_emMake an estimate of deltath_emThe sum of the energy consumed by completing one scan with the neighbor node A is the energy threshold deltathThe unit is J. The information that a node needs to forward to a neighbor node each time is different (both the size of the information and the number of information may be different),the energy threshold is a dynamic value. The calculation formula is as follows:
δth_em＝δr+δf＝(k1+k2)Pmin,size
δth＝δth_em+b
wherein, Pmin,sizeIs equal to MA＝{m2,m3,m5,m6Minimum information size in (B) is in (Byte, k)1Is a fixed value and represents the energy consumed by the node for forwarding the unit Byte information, and the unit is J/Byte, k2The energy consumption of the node receiving unit Byte information is shown as a fixed value, the unit is J/Byte, b is the energy required by the node scanning once, the unit is J/time, and the minimum energy delta required by the neighbor node A to assist in successfully submitting the information is shown asthThe method comprises the energy consumed by the neighbor node A for receiving information, the energy consumed by the neighbor node A for scanning the neighbor node and the energy consumed by the neighbor node A for forwarding the information to a destination node.
5) And the node compares the residual energy of the neighbor node with the calculated energy threshold, if the residual energy of the neighbor node is not less than the energy threshold, the step 7) is carried out, and if not, the step 6) is carried out.
The node S converts the residual energy of the neighbor node A
Figure BDA0001245425130000071
With calculated energy threshold deltathA comparison is made. If it is not
Figure BDA0001245425130000072
The residual energy of the neighbor node A is enough to receive the information forwarded by the node S and finish the primary forwarding of the received information, and the neighbor node A can be selected as a relay node candidate set and then the step 7) is carried out; if it is not
Figure BDA0001245425130000073
And (6) indicating that the residual energy of the neighbor node A is insufficient and the neighbor node A cannot serve as a relay node to assist in forwarding information at this time).
6) The neighbor node is not selected as a relay node.
7) And adding the neighbor node into the candidate set of the relay node.
After the information forwarding is completed by the node S and the node A, the next neighbor node is continuously judged according to the description schemes of the steps 2) to 7), and whether the neighbor node can be used as a relay node candidate set or not is determined.
The invention discloses a DTN relay node candidate set selection method, which is characterized in that a proper relay node candidate set is selected according to a dynamic energy threshold before a relay node in DTN communication is determined, and the relay node candidate is determined according to whether the residual energy of a neighbor node is enough to receive and complete the energy consumed by one-time scanning and one-time forwarding. The energy threshold value is a dynamic value because the size and the number of the information which is required to be forwarded to the neighbor nodes by the nodes are different, and the energy which is required to be consumed for receiving and forwarding the information is also different. The selection of the neighbor node added to the relay node candidate set as the candidate relay node is determined according to the routing strategy, and is out of the description scope of the invention. In DTN communication, the idea of predicting the energy consumed for receiving and forwarding the information according to the information to be forwarded by the node and determining the relay candidate node according to the predicted energy and the residual energy of the neighbor node are contradicted with the scheme.
Those not described in detail in this specification are within the skill of the art.

Claims (3)

1. A DTN relay node candidate set selection method is characterized in that: end-to-end paths, link time interruption and network topology structure change do not exist in DTN communication, the nodes have mobility, and the resources of the nodes are severely limited; the method comprises the following steps:
1) scanning the nodes to determine a neighbor node set of the nodes;
2) the node exchanges metadata with one neighbor node in the neighbor node set, wherein the metadata comprises a node ID, node residual energy and a node information list;
3) the node determines whether information needs to be forwarded to the neighbor node according to a node information list in the neighbor node metadata, if the information needs to be forwarded to the neighbor node, the step 4) is carried out, and if not, the step 6) is carried out;
4) the node calculates the energy consumed by the neighbor node for receiving and forwarding the information according to the size of the information to be forwarded, and obtains an energy threshold value by adding the energy consumed by the neighbor node for completing one-time scanning; the energy threshold value is a dynamic value; the calculation formula of the energy threshold is as follows:
δth＝δth_em+b
wherein: deltathMinimum energy value required for assisting neighbor nodes in successfully submitting information, b is a fixed value representing the energy value required by the neighbor nodes to complete one-time scanning, deltath_emIn order to estimate the received information according to the size of the forwarded information and complete the energy value consumed by the forwarding node, the calculation formula is as follows:
δth_em＝δr+δf＝(k1+k2)Pmin,size
wherein: k is a radical of1Is a fixed value and expresses the energy consumed by the neighbor node for forwarding unit information, k2Is a fixed value and expresses the energy consumed by the neighbor node for receiving the unit information, Pmin,sizeThe size of the minimum information in the information set which shows that the node exists in the node information list of the node but does not exist in the neighbor node information list
5) The node compares the residual energy of the neighbor node with the calculated energy threshold, if the residual energy of the neighbor node is not less than the energy threshold, the step 7) is carried out, otherwise, the step 6) is carried out;
6) the neighbor node is not selected as a relay node;
7) and adding the neighbor node into the candidate set of the relay node.
2. The DTN relay node candidate set selection method of claim 1, wherein: the calculation formula of the node residual energy in the metadata in the step 2) is as follows:
Eor(n′)＝Eor(n′-1)-Ec(△t)
wherein; eor(n ') represents the residual energy of the node before the nth' retransmission, Eor(n '-1) represents the residual energy value of the node before completing the (n' -1) th forwarding, Ec(△ t) is the node energy consumption value during the △ t interval, △ t is the time since last forwarding, Ec(△ t) including the energy consumed by the node to finish the (n '-1) th information forwarding and the energy consumed by the node scanning neighbor nodes in △ t, wherein n' is a natural number representing the times.
3. The DTN relay node candidate set selection method of claim 1, wherein: the node in the step 3) compares the own information list with the node information list in the acquired neighbor node metadata, and judges whether the information in the node information list of the neighbor node contains all information contained in the own information list, if the information contained in the own node information list but not contained in the node information list of the neighbor node exists, the node indicates that the node needs to forward the information to the neighbor node, and if the information does not exist, the node indicates that the node does not need to forward the information to the neighbor node.
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 CN106792838A (en) 2017-05-31
CN106792838B true 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)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107359926B (en) * 2017-06-19 2019-12-13 华侨大学 Full-duplex relay transmission method based on energy state
CN110381559B (en) * 2019-06-29 2020-09-15 中国人民解放军军事科学院国防科技创新研究院 Distributed wireless network spectrum access method based on global optimal threshold decision
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
CN114079873B (en) * 2020-08-14 2023-03-24 展讯半导体(南京)有限公司 Multicast communication method and device without clear target user, storage medium, terminal and base station

Citations (4)

* 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
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

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10412654B2 (en) * 2014-02-17 2019-09-10 Telefonaktiebolaget Lm Ericsson (Publ) Method for improving data throughput in wireless networks

Patent Citations (4)

* 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
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

Also Published As

Publication number Publication date
CN106792838A (en) 2017-05-31

Similar Documents

Publication Publication Date Title
CN106792838B (en) DTN relay node candidate set selection method
US8797913B2 (en) Reduction of message and computational overhead in networks
US6704795B1 (en) Technique for reducing consumption of router resources after BGP restart
Prodhan et al. TTL based routing in opportunistic networks
KR101605175B1 (en) Name-based neighbor discovery and multi-hop service discovery in information-centric networks
JP6462879B2 (en) Method and apparatus for processing an adaptive flow table
RU2457627C2 (en) Node device and programme
US8165107B2 (en) Method and system for obtaining path information, path computation element
EP2911348A1 (en) Control device discovery in networks having separate control and forwarding devices
CN101483610B (en) Route updating method for link state routing protocol
CN102790963B (en) Mobile ad hoc network system based on Android cell phone and construction method thereof
CN103348639B (en) Routing resource and Control Server
CN106165355A (en) For the methods, devices and systems by realizing network association based on the peerings of hash route and/or summary route
US20140140210A1 (en) Network system and load balancing method
CN104378296A (en) Message forwarding method and device
CN105830500B (en) Method and apparatus for packet network
CN102916879B (en) Rapid route convergence method
CN105721302A (en) Routing selection method for software defined network
CN102075419B (en) Method for generating and transmitting three-layer virtual special network equative routing and edge router
CN103201987A (en) Prioritization of routing information updates
US8855010B2 (en) Assigning gateways for heterogeneous wireless mobile networks
Siasi et al. Tabu search for efficient service function chain provisioning in fog networks
CN103560947B (en) A kind of method and device avoiding intermediate system neighborhood to shake
US20120155322A1 (en) Method And Apparatus For Network Node Discovery
Chowdhury et al. Smart forwarding in ndn vanet

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

Granted publication date: 20200403

Termination date: 20210314