WO2018119933A1 - 一种路由表的生成方法和服务器 - Google Patents
一种路由表的生成方法和服务器 Download PDFInfo
- Publication number
- WO2018119933A1 WO2018119933A1 PCT/CN2016/113182 CN2016113182W WO2018119933A1 WO 2018119933 A1 WO2018119933 A1 WO 2018119933A1 CN 2016113182 W CN2016113182 W CN 2016113182W WO 2018119933 A1 WO2018119933 A1 WO 2018119933A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- node device
- network
- frequency point
- routing cost
- node
- Prior art date
Links
Images
Classifications
-
- 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
Definitions
- the present application relates to the field of communications technologies, and in particular, to a method and a server for generating a routing table.
- a cognitive wireless network that can effectively utilize idle frequency resources can be created.
- the cognitive wireless network can enable an unauthorized user equipment to temporarily occupy the frequency resource of the authorized user equipment when the authorized user equipment does not communicate, and the authorized user When the device communicates, the unauthorized user device is disconnected from the communication, thereby preventing the unauthorized user device from interfering with the authorized user device.
- Cognitive wireless networks can fully exploit and utilize idle frequency resources, effectively alleviating the increasingly tight problem of frequency resources.
- Manner 1 Analyze the characteristics of the cognitive wireless network, extend the shortest path routing algorithm applicable to the traditional wireless network to the cognitive wireless network, and obtain the corresponding routing table according to the above method.
- Manner 2 Modeling the routing problem as a joint optimization problem between the path and the wireless link, comprehensively considering the geometric distribution information of each network node, optimizing the routing of the entire cognitive wireless network, and obtaining a corresponding routing table according to the above method.
- Method 3 Consider the spatial domain and frequency caused by the uncertainty of frequency points in cognitive wireless networks For the routing problem of the rate domain, the routing path is calculated by the game theory method, and the corresponding routing table is obtained according to the above method.
- the embodiment of the present application provides a method and a server for generating a routing table, which are used to solve the problem of low routing efficiency of the routing table generated by the prior art.
- an embodiment of the present application provides a method for generating a routing table, where the method includes:
- neighbor node information of the i th node device in the network resource idle probability of the i th node device in the network at the mth frequency point And a bit error rate of the link between the i-th node device and the j-th node device at the mth frequency point in the network Obtaining a neighbor node device set J0 with the lowest routing cost corresponding to the i th node device in the network;
- the resource idle probability of the i-th node device in the mth frequency point in the network is obtained by using the following formula:
- the maximum idle duration of the i-th node device in the network at m frequency points.
- the i-th node device in the network is in the mth according to neighbor node information of the i-th node device in the network Resource idle probability at a frequency point and a bit error rate of a link between the i-th node device and the j-th node device at the m-th frequency point in the network Obtaining a neighbor node device set J0 with the smallest routing cost corresponding to the i th node device in the network, including:
- the routing cost and the routing cost of the last target node device at the m-th frequency point Neighboring node information of the i-th node device in the network, iterating the routing cost of the i-th node device in the network to the target node device in the network at the m-th frequency point to obtain the current
- the routing cost of the i-th node device in the network to the target node device in the network at the m-th frequency point wherein the number of iterations is N times, and the value of N is the number of node devices included in the network.
- the i-th node device in the network is at the mth frequency point
- the initial routing cost of the target node device in the network is infinity and the initial routing cost of the target node device at the mth frequency point is 0;
- the neighboring node device set J corresponding to the i-th node device in the network and the i-th node device in the network are in the mth frequency point Bit error rate of the link between the upper node and the jth node device Obtaining the correct transmission probability of the neighboring node device set J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point
- the routing cost of the neighboring node device set J with the lowest routing cost and the node in the neighbor node device set J with the smallest routing cost are the smallest.
- Average routing cost of the device to the target node device in the network at m frequency points Obtaining a minimum routing cost to a target node device in the network when the i-th node device in the network transmits data at the mth frequency point
- the minimum routing cost of the target node device in the network when the i-th node device in the network transmits data at the mth frequency point Obtaining an average minimum routing cost D i to a target node device in the network when the i-th node device in the network transmits data at all possible frequency points;
- the routing cost corresponding to the i-th node device in the network of each node device in the network is the smallest
- the correct probability of transmission to the set of neighboring node devices J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point is obtained by the following formula
- the routing cost of the set of neighboring node devices J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point is obtained by using the following formula:
- the foregoing aspect and any possible implementation manner further provide an implementation manner, where the ith node device in the network transmits data at the mth frequency point, and the neighbor with the lowest routing cost
- Obtaining the minimum routing cost of the set of neighboring node devices J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point include:
- the routing table is sent to each node device in the network such that each node device in the network routes data according to the routing table.
- the idle duration of the i-th node device at the m-th frequency point and the i-th node in the network are obtained in the acquiring network.
- the resource idle probability of the i-th node device in the network at the m-th frequency point is obtained, and then according to the Neighboring node information of the i-th node device in the network, resource idle probability of the i-th node device in the network at the m-th frequency point, and the m-th node of the i-th node device in the network
- an embodiment of the present application provides a server, where the server includes:
- An obtaining unit configured to acquire an idle duration of the i-th node device in the network at the mth frequency point And the occupation time of the i-th node device in the network at the mth frequency point And a bit error rate of the link between the i-th node device and the j-th node device at the mth frequency point in the network And the neighboring node information of the i-th node device in the network, where the value range of i is [1, the number of node devices included in the network], and the value range of m is [1, i-th The number of frequency points on the node device], j is a set of neighboring node devices of the i-th node device in the network;
- a node set determining unit configured to: according to neighbor node information of the i th node device in the network, resource idle probability of the i th node device in the network at the mth frequency point And a bit error rate of the link between the i-th node device and the j-th node device at the mth frequency point in the network Obtaining a neighboring node device set J0 with the lowest routing cost corresponding to the i th node device in the network;
- the routing table generating unit is configured to generate a routing table according to the neighboring node device set J0 with the smallest routing cost corresponding to the i th node device in the network.
- the data processing unit is configured to use the idle duration And the duration of the occupation
- the resource idle probability of the i-th node device in the network is obtained at the m-th frequency point, it is specifically used to:
- the resource idle probability of the i-th node device in the mth frequency point in the network is obtained by using the following formula:
- the maximum idle duration of the i-th node device in the network at m frequency points.
- the node set determining unit is configured to use, according to neighbor node information of an i th node device in the network, an i th The resource idle probability of the node device at the mth frequency point and the bit error rate of the link between the i-th node device and the jth node device at the mth frequency point in the network
- the neighboring node device set J0 with the lowest routing cost corresponding to the i th node device in the network is specifically used to:
- the routing cost and the routing cost of the last target node device at the m-th frequency point Neighboring node information of the i-th node device in the network, iterating the routing cost of the i-th node device in the network to the target node device in the network at the m-th frequency point to obtain the current
- the routing cost of the i-th node device in the network to the target node device in the network at the m-th frequency point wherein the number of iterations is N times, and the value of N is the number of node devices included in the network.
- the initial routing cost of the i-th node device in the network to the target node device in the network at the m-th frequency point is infinity and the initial routing cost of the target node device at the m-th frequency point is 0. ;
- the neighboring node device set J corresponding to the i-th node device in the network and the i-th node device in the network are in the mth frequency point Bit error rate of the link between the upper node and the jth node device Obtaining the correct transmission probability of the neighboring node device set J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point
- the routing cost of the neighboring node device set J with the lowest routing cost and the node in the neighbor node device set J with the smallest routing cost are the smallest.
- Average routing cost of the device to the target node device in the network at m frequency points Obtaining a minimum routing cost to a target node device in the network when the i-th node device in the network transmits data at the mth frequency point
- the minimum routing cost of the target node device in the network when the i-th node device in the network transmits data at the mth frequency point Obtaining an average minimum routing cost D i to the target node device in the network when the i th node device in the network transmits data at all possible frequency points;
- the node set determining unit is configured to use, according to the Nth iteration, the i-th node device in the network of each node device in the network
- the bit error rate of the link between the adjacent node device set J with the lowest routing cost and the link between the jth node device and the jth node device in the i-th node device in the network Obtaining the correct transmission probability of the neighboring node device set J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point
- the node set determining unit is configured to use, according to the Nth iteration, the i-th node device in the network of each node device in the network
- the bit error rate of the link between the adjacent node device set J with the lowest routing cost and the link between the jth node device and the jth node device in the i-th node device in the network Obtaining the correct transmission probability of the neighboring node device set J with the lowest routing cost when the
- the correct probability of transmission to the set of neighboring node devices J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point is obtained by the following formula
- the node set determining unit is configured to use the correct probability of transmission Resource idle probability at the mth frequency point of the i-th node device in the network Obtaining, when the data of the ith node device in the network transmits data on the mth frequency point, to the routing cost of the neighboring node device set J with the lowest routing cost, specifically:
- the routing cost of the set of neighboring node devices J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point is obtained by using the following formula:
- the node set determining unit is configured to: when the i th node device in the network transmits data on the mth frequency point, The routing cost of the neighboring node device set J with the lowest routing cost and the average routing cost of each node device in the neighboring node device set J with the lowest routing cost to the target node device in the network at m frequency points Obtaining the minimum routing cost of the set of neighboring node devices J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point When specifically used to:
- server further includes:
- a sending unit configured to send the routing table to each node device in the network, so that each node device in the network routes data according to the routing table.
- the idle duration of the i-th node device at the m-th frequency point and the i-th node in the network are obtained in the acquiring network.
- the resource idle probability of the i-th node device in the network at the m-th frequency point is obtained, and then according to the Neighboring node information of the i-th node device in the network, resource idle probability of the i-th node device in the network at the m-th frequency point, and the m-th node of the i-th node device in the network
- FIG. 1 is a flow chart showing an example of a method for generating a routing table according to an embodiment of the present application
- FIG. 2 is a schematic structural diagram of a cognitive wireless network according to an embodiment of the present application.
- FIG. 3 is a schematic structural diagram of a cognitive wireless network carrying a frequency point resource idle probability and a bit error rate according to an embodiment of the present application
- FIG. 5 is a schematic structural diagram of a server according to an embodiment of the present application.
- the word “if” as used herein may be interpreted as “when” or “when” or “in response to determining” or “in response to detecting.”
- the phrase “if determined” or “if detected (conditions or events stated)” may be interpreted as “when determined” or “in response to determination” or “when detected (stated condition or event) “Time” or “in response to a test (condition or event stated)”.
- the implementation of the present application provides a method for generating a routing table. As shown in FIG. 1, the method may include the following steps:
- the value range of i is [1, the number of node devices included in the network]
- the value range of m is [1, the number of frequency points on the i-th node device]
- j is in the network.
- the record of the use of the resource of each frequency point is generated on the node device. Therefore, the record of the use of the resource of each frequency point can be used to obtain the i-th node device at the mth. Idle time at each frequency And the occupation time of the i-th node device in the network at the mth frequency point Getting idle time And occupation time When it is time, the node device can obtain the idle time. And occupation time After the idle time And occupation time Sent to the server to make the server based on idle time And occupation time Perform subsequent calculations and get the idle time And occupation time Can be the idle time within the preset time from the current time And occupation time
- the neighbor node information of the i-th node device in the network records the node device adjacent to the i-th node device, and the i-th node device sends data to the node adjacent thereto when the data is routed.
- the device needs to obtain the neighbor node information record of the i-th node device. Further, in order to improve the routing efficiency of the generated routing table, it is required to select a route cost lower among the node devices adjacent to the i-th node device.
- a set of node devices generates a routing table according to a lower-cost node device set, thereby improving routing efficiency of the generated routing table.
- the resource idle probability of the i-th node device in the mth frequency point in the network may be obtained by using the following formula:
- the maximum idle duration of the i-th node device in the network at m frequency points.
- the resource idle probability of the i-th node device at the m-th frequency point is used for the probability that the m-th frequency point of the i-th node device is in an idle state, and further, may be used to represent the i-th How much probability of the mth frequency point of the node device can be used, when the i-th node When the probability that the mth frequency point of the device is in an idle state is greater, the probability that the mth frequency point of the i th node device can be used by the unauthorized user equipment is higher.
- the i-th node device since the i-th node device performs data transmission, the data can be transmitted to the neighboring node device.
- the routing cost is different, and the lower the cost, the lower the packet loss rate of the i-th node device when transmitting data, the faster the transmission speed, and the transmission.
- the higher the probability of success the lesser neighboring node device set J0 corresponding to the i-th node device in the network obtained above is the i-th node device transmitting data to the neighboring node device.
- the most efficient set of neighboring node devices the set contains at least one number of node devices.
- the neighboring node device set J0 with the lowest routing cost corresponding to the i th node device in the network may be obtained by the following steps:
- Step 1 Using the routing cost of the i-th node device in the network to the target node device in the network at the mth frequency point, and the routing of the last target node device at the m-th frequency point. And the neighboring node information of the i-th node device in the network, and iterating the routing cost of the i-th node device in the network to the target node device in the network at the m-th frequency point to obtain The routing cost of the i-th node device in the network to the target node device in the network at the mth frequency point.
- the number of times of iteration is N times, and the value of N is the number of node devices included in the network, and the i-th node device in the network reaches the target node in the network at the m-th frequency point.
- the initial routing cost of the backup is infinity and the initial routing cost of the target node device at the mth frequency is zero.
- the initial routing cost of the i-th node device in the network to the target node device in the network at the m-th frequency point is infinity and the initial route of the target node device at the m-th frequency point
- the cost is 0, using the initial routing cost of the i-th node device in the network to the target node device in the network at the m-th frequency point and the initial routing cost of the target node device at the m-th frequency point
- the first iteration is performed on each node device, and the iteration result of the first iteration is obtained. The result is that each node device in each node device performs the first iteration after the first iteration of each node device.
- each node device in each node device performs the second iteration on its corresponding frequency point, and each node device in each node device goes to the target node device at its corresponding frequency point.
- the number of iterations is the same as the number of node devices in the network, for example, when the number of node devices in the network is eight, The number of iterations is 8 times, and each iteration is iterated using the last iteration result.
- each iteration is an update of the result of the previous iteration. Since the obtained iterative result is the routing cost of each node device in each node device to its corresponding frequency point to the target node device, therefore, there is no iteration. Is an update to the routing cost.
- Step 2 According to the routing cost of the i-th node device in the network to the target node device in the network at the m-th frequency point obtained according to the Nth iteration, obtain the nodes in the network after the Nth iteration a set of neighboring node devices J having the lowest routing cost corresponding to the i-th node device in the network, and each node device in the set of neighboring node devices J having the lowest routing cost to the network at m frequency points Average routing cost of the target node device
- the current iteration result may be used to determine a routing cost corresponding to each node of each node device at each frequency point. Therefore, the routing cost may be determined according to the routing cost obtained above.
- the set of neighboring node devices when the node device performs routing, the data is sent to the set to ensure the highest routing efficiency, and the average of the routing time of the node device at different frequency points can also be determined according to the routing cost obtained above.
- the routing cost which can reflect the true routing cost of the node device.
- Step 3 According to the Nth iteration, the neighboring node device set J with the lowest routing cost corresponding to the i th node device in the network in each network device in the network and the i th node device in the network are at the mth Bit error rate of the link between the frequency point and the jth node device Obtaining the correct transmission probability of the neighboring node device set J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point
- Step 4 according to the correct probability of transmission Resource idle probability at the mth frequency point of the i-th node device in the network Obtaining the routing cost of the set of neighboring node devices J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point.
- Step 5 According to the ith node device in the network transmitting data at the mth frequency point, the routing cost of the neighboring node device set J with the lowest routing cost and the neighboring node device set J with the smallest routing cost are the smallest Average routing cost of each node device to the target node device in the network at m frequency points Obtaining a minimum routing cost to a target node device in the network when the i-th node device in the network transmits data at the mth frequency point
- Step 6 According to the minimum routing cost of the target node device in the network when the i-th node device in the network transmits data at the mth frequency point Obtaining an average minimum routing cost D i to the target node device in the network when the i-th node device in the network transmits data at all possible frequency points.
- Step 7 Obtain an ith node device in the network according to an average minimum routing cost D i of the target node device in the network when the i-th node device in the network transmits data at all possible frequency points.
- the corresponding node device set J0 with the lowest routing cost.
- the neighboring node device with higher routing cost is removed, and only the neighboring node device set with less routing cost is reserved, so that the node is When the device routes according to the set of neighboring node devices with the lowest routing cost, the routing efficiency is guaranteed to be the highest.
- the following formula can be used to obtain the correct transmission probability of the neighboring node device set J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point. among them, Indicates that the i-th node device routes the set of neighboring node devices with the least cost at the mth frequency point.
- the routing cost of the neighboring node device set J with the lowest routing cost when the i-th node device in the network transmits data at the m-th frequency point can be obtained by using the following formula:
- the minimum routing cost of the set of neighboring node devices with the lowest routing cost when the i-th node device in the network transmits data at the m-th frequency point can be obtained by using the following formula:
- the routing table is sent to each node device in the network, so that each node device in the network routes data according to the routing table.
- the node device may select a frequency point with the highest frequency probability of the frequency resource to perform spectrum sensing according to the routing table, and if the frequency is idle, select the frequency point as the frequency to be communicated; otherwise, the sensing frequency resource idle probability The second largest frequency point, and so on, until the frequency resource that is idle at the current time is selected.
- the node device performs wireless transmission on the perceived frequency point, and broadcasts the data packet to be sent to the optimal neighbor set J of the current frequency point; if the node device with the lowest routing cost in the optimal neighbor set J correctly receives the data
- the packet informs the node device that sent the data, and other node devices in J, and sends the node device that successfully receives the data node device for the next hop; otherwise, according to the size of the routing cost, a certain received packet is correctly received.
- the node device becomes the next hop sending node under the condition that other less expensive node devices do not correctly receive the data packet.
- the node device may be a wireless terminal with frequency cognition capability, such as a personal computer (PC), a personal digital assistant (PDA), a wireless handheld device, a tablet computer ( Tablet Computer), mobile phones, etc.
- PC personal computer
- PDA personal digital assistant
- Tablet Computer tablet computer
- mobile phones etc.
- the network may be a network with uncertainty of frequency resources and wireless link uncertainty, such as a cognitive wireless network.
- the cognitive wireless network has eight node devices (s, v 1 , v 2 , v 3 , v 4 , v 5 , v 6 , d) composition, where d is the target node device, and 8 wireless terminals can communicate at two frequency points c1 and c2, both of which are private frequency points of the authorized user equipment, and only in the authorization When the user equipment does not occupy the above two frequency points, the cognitive wireless network can temporarily transmit the above frequency points.
- Specific implementations may include the following steps:
- Step 1 Each node device sends its own occupation time and idle duration of C1 and C2 to the server through the shared channel, and sends the error rate of the wireless link to the server.
- Step 2 The server obtains the resource idle probability of each node device at C1 and C2 by using the above formula for calculating the resource idle probability.
- Step 3 The server obtains, according to the obtained resource idle probability, the error rate, and the topology information of the network, the set of neighboring node devices with the lowest routing cost corresponding to each node device according to the foregoing method.
- the constructed opportunity routing path is shown by the black thick line in Figure 3, where the optimal neighbor sets of the node devices s, v 2 , v 3 , v 5 , and v 6 are ⁇ v 2 , v 3 ⁇ , ⁇ v 5 respectively. ⁇ , ⁇ v 2 , v 6 ⁇ , ⁇ d ⁇ , ⁇ v 5 , d ⁇ .
- the node device s When routing data, as shown in FIG. 4, assuming that the quality of the frequency point c1 is better than c2, the node device s first perceives the idle state of the frequency point c1, and when it is found that c1 is idle, the node device s broadcasts the request data at the frequency point. Package to view the current wireless link status. Though the node device of its neighbors v 1, but not in the best neighbor set, therefore, it enters a silent period so as not to interfere with the current communication. Since the best neighbor set the cost of the route D 2 v 2 v is less than the cost of the route 3 v 3, and therefore, v 2 for s-transmission response to respond. If, at this time, the authorized user equipment of frequency point c1 starts to use the frequency point.
- the server switches to another available frequency point c2 through the CCC channel notification s, v 2 , v 3 . Thereafter, the above process continues at frequency c2 until the data is correctly transmitted, wherein the master device in FIG. 4 is an authorized user device.
- Tests show that when the routing table is provided for routing in the embodiment of the present application, the network throughput can be increased by 70% and the packet transmission rate can be increased by 40% compared with the prior art. Use this application When the embodiment provides a routing table for routing, data transmission efficiency can be improved.
- the embodiment of the present application further provides an apparatus embodiment for implementing the steps and methods in the foregoing method embodiments.
- the server may include:
- An obtaining unit 51 configured to acquire an idle duration of the i-th node device in the network at the mth frequency point And the occupation time of the i-th node device in the network at the mth frequency point And a bit error rate of the link between the i-th node device and the j-th node device at the mth frequency point in the network And the neighboring node information of the i-th node device in the network, where the value range of i is [1, the number of node devices included in the network], and the value range of m is [1, i-th The number of frequency points on the node device], j is a set of neighboring node devices of the i-th node device in the network;
- a data processing unit 52 configured to use the idle duration And the duration of the occupation Obtaining the resource idle probability of the i-th node device in the network at the mth frequency point
- the node set determining unit 53 is configured to: according to neighbor node information of the i th node device in the network, resource idle probability of the i th node device in the network at the mth frequency point And a bit error rate of the link between the i-th node device and the j-th node device at the mth frequency point in the network Obtaining a neighboring node device set J0 with the lowest routing cost corresponding to the i th node device in the network;
- the routing table generating unit 54 is configured to generate a routing table according to the neighboring node device set J0 with the smallest routing cost corresponding to the i th node device in the network.
- the data processing unit 52 is configured to use the idle duration And the duration of the occupation
- the method is as follows: obtaining the idle resource of the i-th node in the network at the m-th frequency point by using the following formula: Probability: among them, The maximum idle duration of the i-th node device in the network at m frequency points.
- the node set determining unit 53 is configured to: according to neighbor node information of the i th node device in the network, the i th node device in the network is at the mth frequency point. Resource idle probability and error rate of the link between the i-th node device and the j-th node device at the mth frequency point in the network
- the method is specifically configured to: use the i-th node device in the network at the mth frequency point to The routing cost of the target node device in the network, the routing cost of the last target node device at the mth frequency point, and the neighbor node information of the i-th node device in the network, for the ith in the network
- the node device iterates to the routing cost of the target node device in the network at the mth frequency point to obtain the i-th node device in the current network to the target node
- Routing cost where the number of iterations is N times, the value of N is the number of node devices included in the network, and the i-th node device in the network reaches the network at the mth frequency point
- the initial routing cost of the target node device is infinity and the initial routing cost of the target node device at the mth frequency point is 0; the i-th node device in the network obtained according to the Nth iteration is at the mth frequency Point to the network
- the routing cost of the target node device obtains the neighboring node device set J with the smallest routing cost corresponding to the i-th node device in the network of each node device in the network after the Nth iteration, and obtains the neighbor with the least routing cost
- Average routing cost of the device Obtaining a minimum routing cost to a target node device in the network when the i-th node device in the network transmits data at the mth frequency point According to the minimum routing cost of the target node device in the network when the i-th node device in the network transmits data at the mth frequency point Obtaining an average minimum routing cost D i to a target node device in the network when the i th node device in the network transmits data at all possible frequency points; according to the i th node device in the network at all possible When the data is transmitted on the frequency point, the average minimum route cost D i to the target node device in the network is obtained, and the neighbor node device set J0 with the lowest routing cost corresponding to the i th node device in the network is obtained.
- the node set determining unit 53 is configured to use, according to the Nth iteration, the neighboring node device set with the lowest routing cost corresponding to the i th node device in the network of each node device in the network. J and the error rate of the link between the i-th node device and the j-th node device at the mth frequency point in the network Obtaining the correct probability of transmission of the set of neighboring node devices J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point Specifically, it is used to obtain the correct transmission probability of the neighboring node device set J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point by using the following formula: among them, Indicates that the i-th node device routes the set of neighboring node devices with the least cost at the mth frequency point.
- the node set determining unit 53 is configured to correct the probability according to the transmission.
- Resource idle probability at the mth frequency point of the i-th node device in the network Obtaining, when obtaining the routing cost of the neighboring node device set J with the lowest routing cost, when the ith node device in the network transmits data on the mth frequency point, specifically: obtaining the network in the network by using the following formula When the i-node device transmits data at the mth frequency point, the routing cost to the neighboring node device set J with the least routing cost:
- the node set determining unit 53 is configured to: according to the i-th node device in the network, when transmitting data on the mth frequency point, the neighboring node device set J with the lowest routing cost The average routing cost of each node device in the set of neighboring node devices J with the lowest routing cost and routing cost to the target node devices in the network at m frequency points Obtaining the minimum routing cost of the set of neighboring node devices J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point Specifically, it is used to obtain the minimum routing cost of the set of neighboring node devices J with the lowest routing cost when the i-th node device in the network transmits data at the mth frequency point by using the following formula:
- the server further includes: a sending unit 55, configured to send the routing table to each node device in the network, so that each node device in the network according to the route Table routing data.
- the idle duration of the ith node device at the mth frequency point and the occupation time of the ith node device at the mth frequency point in the network After acquiring the idle duration of the ith node device at the mth frequency point and the occupation time of the ith node device at the mth frequency point in the network, Obtaining, according to the idle duration and the occupied duration, a resource idle probability of the i-th node device in the network at the m-th frequency point, and then according to the neighbor node information of the i-th node device in the network.
- the resource idle probability of the i-th node device in the network at the mth frequency point and the link between the i-th node device and the j-th node device at the mth frequency point in the network a bit error rate, obtaining a set of neighboring node devices with the lowest routing cost corresponding to the i th node device in the network, and generating a route according to the set of neighboring node devices with the lowest routing cost corresponding to the i th node device in the network
- the resource idle probability of the frequency point and the error rate of the link between the node devices are fully considered, thereby reducing the frequency resource in the cognitive wireless network. Uncertainty, And a radio link uncertainty the probability that the problem of packet loss probability of data transmission, data transmission and transmission efficiency is low probability of failure of data transmission, thus improving the efficiency of the routing tables generated by the routing.
- the disclosed system, apparatus, and method may be implemented in other manners.
- the device embodiments described above are merely illustrative.
- the division of the unit is only a logical function division.
- multiple units or components may be combined.
- the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.
- the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
- each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
- the above integrated unit can be implemented in the form of hardware or in the form of hardware plus software functional units.
- the above-described integrated unit implemented in the form of a software functional unit can be stored in a computer readable storage medium.
- the software functional unit is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor to perform the methods of the various embodiments of the present application. Part of the steps.
- the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program codes. .
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
本申请实施例提供了一种路由表的生成方法和服务器。一方面,该方法包括:根据所述空闲时长和所述占用时长,获得所述网络中第i个节点设备在第m个频点上的资源空闲概率,然后再根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率,获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合,并根据所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合生成路由表,在本申请实施例中,可以提高生成的路由表的路由效率。
Description
本申请涉及通信技术领域,尤其涉及一种路由表的生成方法和服务器。
在无线网络中,由于有限的频点资源与无限的需要之间矛盾日益突出,频点资源成为限制无线通信进一步法阵的资源瓶颈。因此,可以有效利用空闲频点资源的认知无线网络应运而生,认知无线网络可以使非授权用户设备在授权用户设备不进行通信时临时占用授权用户设备的频点资源,而在授权用户设备进行通信时,使非授权用户设备退出通信,从而避免非授权用户设备对授权用户设备的干扰。认知无线网络可以充分发掘和利用空闲频点资源,有效的缓解了频点资源日益紧张的难题。
随着认知无线网络的发展,如何使认知无线网络进行高效路由成为一个急需解决的问题,在现有技术中,可以通过下面三种方式提高认知无线网络的路由效率:
方式一:分析认知无线网络的特点,将适用于传统无线网络的最短路径路由算法扩展到认知无线网络中,根据上述方法获得对应的路由表。
方式二:将路由问题建模为路径与无线链路的联合优化问题,综合考虑各网络节点的几何分布信息,实现对整个认知无线网络的路由进行优化,根据上述方法获得对应的路由表。
方式三:考虑认知无线网络中由于频点的不确定性带来的空间域与频
率域的路由切换问题,采用博弈论方法计算路由路径,根据上述方法获得对应的路由表。
在实现本申请过程中,发明人发现现有技术中至少存在如下问题:
由于认知无线网络中具有频点资源的不确定性,以及无线链路不确定性,现有技术中的实现方式中并未考虑上述两个不确定性,因此,生成的路由表的路由效率较低。
发明内容
有鉴于此,本申请实施例提供了一种路由表的生成方法和服务器,用以解决现有技术生成的路由表的路由效率较低的问题。
第一方面,本申请实施例提供了一种路由表的生成方法,所述方法包括:
获取网络中第i个节点设备在第m个频点上的空闲时长和所述网络中第i个节点设备在第m个频点上的占用时长以及,所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率以及所述网络中第i个节点设备的相邻节点信息,其中,i的取值范围为[1,网络中包含的节点设备的个数],m的取值范围为[1,第i个节点设备上频点的个数],j为所述网络中第i个节点设备的相邻节点设备集合;
根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络
中第i个节点设备对应的路由代价最小的相邻节点设备集合J0;
根据所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0,生成路由表。
利用如下公式获得所述网络中第i个节点设备在第m个频点上的资源空闲概率:
如上所述的方面和任一可能的实现方式,进一步提供一种实现方式,所述根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0,包括:
使用上一次所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价、上一次所述目标节点设备在第m个频点上的路由代价和所述网络中第i个节点设备的相邻节点信息,对所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价进行迭代,以获得当前所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价,其中,进行迭代的次数为N次,N的取值为网络中包含的节点设备的个数,所述网络中第i个节点设备在第m个频点上到
所述网络中目标节点设备的初始路由代价为无穷大和所述目标节点设备在第m个频点上的初始路由代价为0;
根据第N次迭代获得的所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价,获得第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J,以及获得路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价
根据第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的传输正确概率
根据所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价和路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价获得所述网络中第i个节点设备在第m个频点上传输数据时,到所述网络中目标节点设备的最小路由代价
根据所述网络中第i个节点设备在第m个频点上传输数据时,到所述网络中目标节点设备的最小路由代价获得所述网络中第i个节点设备在所有可能的频点上传输数据时,到所述网络中目标节点设备的平均最小
路由代价Di;
根据所述网络中第i个节点设备在所有可能的频点上传输数据时,到所述网络中目标节点设备的平均最小路由代价Di,获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0。
如上所述的方面和任一可能的实现方式,进一步提供一种实现方式,所述根据第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的传输正确概率包括:
如上所述的方面和任一可能的实现方式,进一步提供一种实现方式,所述根据所述传输正确概率和所述网络中第i个节点设备在第m个频点上的资源空闲概率获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价,包括:
利用如下公式获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价:
如上所述的方面和任一可能的实现方式,进一步提供一种实现方式,
所述根据所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价和路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的最小路由代价包括:
如上所述的方面和任一可能的实现方式,进一步提供一种实现方式,所述方法还包括:
将所述路由表发送给所述网络中的各节点设备,以使所述网络中的各节点设备根据所述路由表路由数据。
上述技术方案中的一个技术方案具有如下有益效果:在本申请实施例中,在获取到获取网络中第i个节点设备在第m个频点上的空闲时长和所述网络中第i个节点设备在第m个频点上的占用时长后,根据所述空闲时长和所述占用时长,获得所述网络中第i个节点设备在第m个频点上的资源空闲概率,然后再根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率,获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合,并根据所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合生成路由表,在本申请实施例中,在生成路由表时,充分考虑了频点的资源空闲概率和节点设备之间的链路的误码率,从而降低了由于认知无线网
络中具有频点资源的不确定性,以及无线链路不确定性使而出现问题的概率,如数据传输时的丢包概率,数据传输时传输效率较低和传输数据失败的概率,因此提高了生成的路由表的路由效率。
第二方面,本申请实施例提供了一种服务器,所述服务器包括:
获取单元,用于获取网络中第i个节点设备在第m个频点上的空闲时长和所述网络中第i个节点设备在第m个频点上的占用时长以及,所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率以及所述网络中第i个节点设备的相邻节点信息,其中,i的取值范围为[1,网络中包含的节点设备的个数],m的取值范围为[1,第i个节点设备上频点的个数],j为所述网络中第i个节点设备的相邻节点设备集合;
节点集合确定单元,用于根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0;
路由表生成单元,用于根据所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0,生成路由表。
利用如下公式获得所述网络中第i个节点设备在第m个频点上的资源空闲概率:
如上所述的方面和任一可能的实现方式,进一步提供一种实现方式,所述节点集合确定单元用于根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0,时,具体用于:
使用上一次所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价、上一次所述目标节点设备在第m个频点上的路由代价和所述网络中第i个节点设备的相邻节点信息,对所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价进行迭代,以获得当前所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价,其中,进行迭代的次数为N次,N的取值为网络中包含的节点设备的个数,所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的初始路由代价为无穷大和所述目标节点设备在第m个频点上的初始路由代价为0;
根据第N次迭代获得的所述网络中第i个节点设备在第m个频点上到
所述网络中目标节点设备的路由代价,获得第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J,以及获得路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价
根据第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的传输正确概率
根据所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价和路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价获得所述网络中第i个节点设备在第m个频点上传输数据时,到所述网络中目标节点设备的最小路由代价
根据所述网络中第i个节点设备在所有可能的频点上传输数据时,到所述网络中目标节点设备的平均最小路由代价Di,获得所述网络中第i个
节点设备对应的路由代价最小的相邻节点设备集合J0。
如上所述的方面和任一可能的实现方式,进一步提供一种实现方式,所述节点集合确定单元用于根据第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的传输正确概率时,具体用于:
如上所述的方面和任一可能的实现方式,进一步提供一种实现方式,所述节点集合确定单元用于根据所述传输正确概率和所述网络中第i个节点设备在第m个频点上的资源空闲概率获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价时,具体用于:
利用如下公式获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价:
如上所述的方面和任一可能的实现方式,进一步提供一种实现方式,所述节点集合确定单元用于根据所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价和路由
代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的最小路由代价时,具体用于:
如上所述的方面和任一可能的实现方式,进一步提供一种实现方式,所述服务器还包括:
发送单元,用于将所述路由表发送给所述网络中的各节点设备,以使所述网络中的各节点设备根据所述路由表路由数据。
上述技术方案中的一个技术方案具有如下有益效果:在本申请实施例中,在获取到获取网络中第i个节点设备在第m个频点上的空闲时长和所述网络中第i个节点设备在第m个频点上的占用时长后,根据所述空闲时长和所述占用时长,获得所述网络中第i个节点设备在第m个频点上的资源空闲概率,然后再根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率,获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合,并根据所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合生成路由表,在本申请实施例中,在生成路由表时,充分考虑了频点的资源空闲概率和节点设备之间的链路的误码率,从而降低了由于认知无线网络中具有频点资源的不确定性,以及无线链路不确定性使而出现问题的概
率,如数据传输时的丢包概率,数据传输时传输效率较低和传输数据失败的概率,因此提高了生成的路由表的路由效率。
为了更清楚地说明本申请实施例的技术方案,下面将对实施例中所需要使用的附图作简单地介绍,显而易见地,下面描述中的附图仅仅是本申请的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动性的前提下,还可以根据这些附图获得其它的附图。
图1是本申请实施例提出的一种路由表的生成方法的流程示例图;
图2是本申请实施例提出的一种认知无线网络的结构示意图;
图3是本申请实施例提出的一种携带有频点资源空闲概率和误码率的认知无线网络的结构示意图;
图4是本申请实施例提出的一种频点切换的示意图;
图5是本申请实施例提出的一种服务器的结构示意图。
为了更好的理解本申请的技术方案,下面结合附图对本申请实施例进行详细描述。
应当明确,所描述的实施例仅仅是本申请一部分实施例,而不是全部的实施例。基于本申请中的实施例,本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其它实施例,都属于本申请保护的范围。
在本申请实施例中使用的术语是仅仅出于描述特定实施例的目的,而非旨在限制本申请。在本申请实施例和所附权利要求书中所使用的单数形
式的“一种”、“所述”和“该”也旨在包括多数形式,除非上下文清楚地表示其他含义。
应当理解,本文中使用的术语“和/或”仅仅是一种描述关联对象的关联关系,表示可以存在三种关系,例如,A和/或B,可以表示:单独存在A,同时存在A和B,单独存在B这三种情况。另外,本文中字符“/”,一般表示前后关联对象是一种“或”的关系。
取决于语境,如在此所使用的词语“如果”可以被解释成为“在……时”或“当……时”或“响应于确定”或“响应于检测”。类似地,取决于语境,短语“如果确定”或“如果检测(陈述的条件或事件)”可以被解释成为“当确定时”或“响应于确定”或“当检测(陈述的条件或事件)时”或“响应于检测(陈述的条件或事件)”。
实施例一
本申请实施提供了一种路由表的生成方法,如图1所示,该方法可以包括以下步骤:
101、获取网络中第i个节点设备在第m个频点上的空闲时长和所述网络中第i个节点设备在第m个频点上的占用时长以及,所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率以及所述网络中第i个节点设备的相邻节点信息。
其中,i的取值范围为[1,网络中包含的节点设备的个数],m的取值范围为[1,第i个节点设备上频点的个数],j为所述网络中第i个节点设备的相邻节点设备集合。
具体的,在节点设备的各频点资源被使用时,该节点设备上会产生各频点资源使用的记录,因此,可以通过各频点资源使用的记录来获取第i
个节点设备在第m个频点上的空闲时长和所述网络中第i个节点设备在第m个频点上的占用时长在获取空闲时长和占用时长时,可以是节点设备获取空闲时长和占用时长后,将空闲时长和占用时长发送给服务器,以使服务器根据空闲时长和占用时长进行后续计算,并且获得的空闲时长和占用时长可以为距离当前时刻在预设时长内的空闲时长和占用时长
所述网络中第i个节点设备的相邻节点信息记录的是与第i个节点设备相邻的节点设备,由于第i个节点设备在路由数据时,会将数据发送给与其相邻的节点设备,因此需要获取第i个节点设备的相邻节点信息记录,进一步的,为了提高生成的路由表的路由效率,需要在与第i个节点设备相邻的节点设备中选择路由代价较低的节点设备集合,并根据代价较低的节点设备集合生成路由表,从而提高生成的路由表的路由效率。
在一个具体的实施方式中,可以利用如下公式获得所述网络中第i个节点设备在第m个频点上的资源空闲概率:
具体的,第i个节点设备在第m个频点上的资源空闲概率用于该第i个节点设备的第m个频点处于空闲状态的概率,进一步的,也可以用于表示该第i个节点设备的第m个频点有多大概率可以被使用,当第i个节点
设备的第m个频点处于空闲状态的概率越大时,第i个节点设备的第m个频点可以被非授权用户设备使用的概率越高。
103、根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0。
具体的,由于第i个节点设备在进行数据传输时,可以将数据传输给相邻节点设备上。但是第i个节点设备将数据传输给不同的相邻节点设备上时的路由代价不同,代价越小表示第i个节点设备在传输数据时的丢包率越低、传输速度越快,以及传输成功的概率越高,因此,上述获得的所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0为第i个节点设备将数据传输给与其相邻的节点设备中路由效率最高的相邻节点设备的集合,该集合包含的节点设备的个数至少为一个。
在一个具体的实施方式中,可以通过下述步骤获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0:
步骤1、使用上一次所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价、上一次所述目标节点设备在第m个频点上的路由代价和所述网络中第i个节点设备的相邻节点信息,对所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价进行迭代,以获得当前所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价。
其中,进行迭代的次数为N次,N的取值为网络中包含的节点设备的个数,所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设
备的初始路由代价为无穷大和所述目标节点设备在第m个频点上的初始路由代价为0。
具体的,将所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的初始路由代价为无穷大和所述目标节点设备在第m个频点上的初始路由代价为0,使用所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的初始路由代价和所述目标节点设备在第m个频点上的初始路由代价对各节点设备进行第一次迭代,并得到第一次迭代的迭代结果,该结果为各节点设备中每个节点设备在其对应的各频点上进行完第一次迭代后各节点设备中每个节点设备在其对应的各频点上到目标节点设备的路由代价;然后使用第一次迭代的迭代结果,对各节点设备进行第二次迭代,并得到第二迭代的迭代结果,该结果为各节点设备中每个节点设备在其对应的各频点上进行完第二次迭代后各节点设备中每个节点设备在其对应的各频点上到目标节点设备的路由代价;然后再以此类推,对各节点设备进行迭代,进行迭代的次数与所述网络中的节点设备的个数相同,例如,当网络中的节点设备的个数为8个时,进行迭代的次数为8次,每次迭代时,都要使用上一次的迭代结果进行迭代。
并且,每次迭代都是对上一次迭代结果的更新,由于得到的迭代结果为各节点设备中每个节点设备在其对应的各频点到目标节点设备的路由代价,因此,没次迭代都是对路由代价的更新。
步骤2、根据第N次迭代获得的所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价,获得第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J,以及获得路由代价最小的相邻节点设备集合J中的各节点设备
在m个频点上到所述网络中目标节点设备的平均路由代价
具体的,在进行N次迭代后,可以使用当前的迭代结果确定出各节点设备中每个节点设备在各频点上对应的路由代价,因此,可以根据上述得到的路由代价确定出路由代价最小的相邻节点设备集合,节点设备进行路由时,将数据发送给该集合可以保证路由效率最高,并且,还可以根据上述得到的路由代价确定出该节点设备在不同的频点上路由时的平均路由代价,该平均路由代价可以反映出该节点设备真实的路由代价。
步骤3、根据第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的传输正确概率
步骤5、根据所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价和路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价获得所述网络中第i个节点设备在第m个频点上传输数据时,到所述网络中目标节点设备的最小路由代价
步骤6、根据所述网络中第i个节点设备在第m个频点上传输数据时,到所述网络中目标节点设备的最小路由代价获得所述网络中第i个节点设备在所有可能的频点上传输数据时,到所述网络中目标节点设备的平
均最小路由代价Di。
步骤7、根据所述网络中第i个节点设备在所有可能的频点上传输数据时,到所述网络中目标节点设备的平均最小路由代价Di,获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0。
具体的,上述步骤可以将第i个节点设备在m个频点上传输数据时,路由代价较高的相邻节点设备去除,只保留路由代价较小的相邻节点设备集合,以使该节点设备按照该路由代价最小的相邻节点设备集合进行路由时,保证路由效率最高。
在一个具体的实施方式中,可以利用下述公式获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的传输正确概率其中,表示第i个节点设备在第m个频点上路由代价最小的相邻节点设备集合。
104、根据所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0,生成路由表。
在一个具体的实施方式中,在生成路由表后,将所述路由表发送给所述网络中的各节点设备,以使所述网络中的各节点设备根据所述路由表路由数据。
具体的,节点设备可以根据路由表选择频点资源空闲概率最大的频点进行频谱感知,如果该频点空闲,则选择该频点作为将要通信传输的频点;否则,感知频点资源空闲概率第二最大的频点,依次类推,直到选择到当前时刻空闲的频点资源。
节点设备在感知到的频点上进行无线传输,将待发送的数据包广播给当前频点的最优邻居集合J;如果最优邻居集合J中具有最低路由代价的节点设备正确接收到该数据包,则告知发送该数据的节点设备,以及J中的其它节点设备,并将成功接收数据节点设备的为下一跳发送节点设备;否则,依据路由代价的大小,某一正确接收到数据包的节点设备在其它代价更小的节点设备均未正确接收到数据包的条件下成为下一跳发送节点。
在本申请实施例中,节点设备可以为具有频点认知能力的无线终端,如:个人计算机(Personal Computer,PC)、个人数字助理(Personal Digital Assistant,PDA)、无线手持设备、平板电脑(Tablet Computer)、手机等。
在本申请实施例中,所述网络可以为具有频点资源的不确定性和无线链路不确定性的网络,如:认知无线网络等。
为了对本申请实施例进行进一步的说明,现举例说明,如图2所示,认知无线网络有8个节点设备(s、v1、v2、v3、v4、v5、v6、d)组成,其中,d为目标节点设备,并且,8个无线终端可在c1、c2两个频点上通信,这两个频点均为授权用户设备的私有频点,且只有在该授权用户设备不占用上述两个频点时,认知无线网络才可以临时将上述频点进行数据传输。具体的实施方式可以包括以下步骤:
步骤1、各节点设备通过共用信道将自身在C1和C2的占用时长和空闲时长发送给服务器,以及将无线链路的误码率发送给该服务器。
步骤2、服务器利用上述计算资源空闲概率的公式,获得各节点设备在C1和C2的资源空闲概率。
步骤3、服务器根据获得的资源空闲概率、误码率,以及所属网络的拓扑信息,按照上述方法获得各节点设备对应的路由代价最小的相邻节点设备集合。
具体的,如图3所示,图中每个节点设备下方的代表该节点设备在频点c1与c2上的频点资源空闲概率,每条无线链路上方的代表该无线链路在频点c1与c2上的误码率,然后采用上述计算方法,可以依次算得v5、v6、v2、v3、s的路由代价为D5=3、D6=4.39、D2=5.71、D3=6.073、Ds=7.18。所构建的机会路由路径如图3中黑色粗线条所示,其中,节点设备s、v2、v3、v5、v6的最优邻居集合分别为{v2、v3}、{v5}、{v2、v6}、{d}、{v5、d}。
在路由数据时,如图4所示,假设频点c1的质量优于c2,节点设备s首先感知频点c1的空闲状态,当发现c1空闲时,节点设备s便在该频点广播请求数据包以便查看当前的无线链路状态。节点设备v1虽然为其邻居,但是不在最优邻居集合中,因此,其进入静默期以便不干扰当前的通信。由于最优邻居集合中v2的路由代价D2低于v3的路由代价v3,因此,v2对s发送回应进行回应。如果,此时频点c1的授权用户设备开始使用该频点。服务器通过CCC信道通知s、v2、v3切换到另一个可用频点c2。此后,上述过程在频点c2继续进行,直到数据正确传输,其中,图4中的主设备为授权用户设备。
测试表明,使用本申请实施例提供路由表进行路由时,与现有技术相比,其网络吞吐量可以提高70%,数据包传递率可以提高40%。用本申请实
施例提供路由表进行路由时,可以提高数据传输效率。
本申请实施例进一步给出实现上述方法实施例中各步骤及方法的装置实施例。
实施例二
本申请实施例提供了一种服务器,如图5所示,该服务器可以包括:
获取单元51,用于获取网络中第i个节点设备在第m个频点上的空闲时长和所述网络中第i个节点设备在第m个频点上的占用时长以及,所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率以及所述网络中第i个节点设备的相邻节点信息,其中,i的取值范围为[1,网络中包含的节点设备的个数],m的取值范围为[1,第i个节点设备上频点的个数],j为所述网络中第i个节点设备的相邻节点设备集合;
节点集合确定单元53,用于根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0;
路由表生成单元54,用于根据所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0,生成路由表。
在一个具体的实施方式中,所述数据处理单元52用于根据所述空闲时
长和所述占用时长获得所述网络中第i个节点设备在第m个频点上的资源空闲概率时,具体用于:利用如下公式获得所述网络中第i个节点设备在第m个频点上的资源空闲概率:其中,为所述网络中第i个节点设备在m个频点上的最大空闲时长。
在一个具体的实施方式中,所述节点集合确定单元53用于根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0时,具体用于:使用上一次所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价、上一次所述目标节点设备在第m个频点上的路由代价和所述网络中第i个节点设备的相邻节点信息,对所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价进行迭代,以获得当前所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价,其中,进行迭代的次数为N次,N的取值为网络中包含的节点设备的个数,所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的初始路由代价为无穷大和所述目标节点设备在第m个频点上的初始路由代价为0;根据第N次迭代获得的所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价,获得第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J,以及获得路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价根据第
N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的传输正确概率根据所述传输正确概率和所述网络中第i个节点设备在第m个频点上的资源空闲概率获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价;根据所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价和路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价获得所述网络中第i个节点设备在第m个频点上传输数据时,到所述网络中目标节点设备的最小路由代价根据所述网络中第i个节点设备在第m个频点上传输数据时,到所述网络中目标节点设备的最小路由代价获得所述网络中第i个节点设备在所有可能的频点上传输数据时,到所述网络中目标节点设备的平均最小路由代价Di;根据所述网络中第i个节点设备在所有可能的频点上传输数据时,到所述网络中目标节点设备的平均最小路由代价Di,获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0。
在一个具体的实施方式中,所述节点集合确定单元53用于根据第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的
传输正确概率时,具体用于:利用如下公式获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的传输正确概率其中,表示第i个节点设备在第m个频点上路由代价最小的相邻节点设备集合。
在一个具体的实施方式中,所述节点集合确定单元53用于根据所述传输正确概率和所述网络中第i个节点设备在第m个频点上的资源空闲概率获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价时,具体用于:利用如下公式获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价:
在一个具体的实施方式中,所述节点集合确定单元53用于根据所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价和路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的最小路由代价时,具体用于:利用如下公式获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的最小路由代价
在一个具体的实施方式中,所述服务器还包括:发送单元55,用于将所述路由表发送给所述网络中的各节点设备,以使所述网络中的各节点设备根据所述路由表路由数据。
由于本实施例中的各单元能够执行实施例一所示的方法,本实施例未详细描述的部分,可参考对实施例一的相关说明。
在本申请实施例中,在获取到获取网络中第i个节点设备在第m个频点上的空闲时长和所述网络中第i个节点设备在第m个频点上的占用时长后,根据所述空闲时长和所述占用时长,获得所述网络中第i个节点设备在第m个频点上的资源空闲概率,然后再根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率,获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合,并根据所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合生成路由表,在本申请实施例中,在生成路由表时,充分考虑了频点的资源空闲概率和节点设备之间的链路的误码率,从而降低了由于认知无线网络中具有频点资源的不确定性,以及无线链路不确定性使而出现问题的概率,如数据传输时的丢包概率,数据传输时传输效率较低和传输数据失败的概率,因此提高了生成的路由表的路由效率。
所属领域的技术人员可以清楚地了解到,为描述的方便和简洁,上述描述的系统,装置和单元的具体工作过程,可以参考前述方法实施例中的对应过程,在此不再赘述。
在本申请所提供的几个实施例中,应该理解到,所揭露的系统,装置和方法,可以通过其它的方式实现。例如,以上所描述的装置实施例仅仅是示意性的,例如,所述单元的划分,仅仅为一种逻辑功能划分,实际实现时可以有另外的划分方式,例如,多个单元或组件可以结合或者可以集成到另一个系统,或一些特征可以忽略,或不执行。另一点,所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口,装置或单元的间接耦合或通信连接,可以是电性,机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的,作为单元显示的部件可以是或者也可以不是物理单元,即可以位于一个地方,或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外,在本申请各个实施例中的各功能单元可以集成在一个处理单元中,也可以是各个单元单独物理存在,也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现,也可以采用硬件加软件功能单元的形式实现。
上述以软件功能单元的形式实现的集成的单元,可以存储在一个计算机可读取存储介质中。上述软件功能单元存储在一个存储介质中,包括若干指令用以使得一台计算机装置(可以是个人计算机,服务器,或者网络装置等)或处理器(Processor)执行本申请各个实施例所述方法的部分步骤。而前述的存储介质包括:U盘、移动硬盘、只读存储器(Read-Only Memory,ROM)、随机存取存储器(Random Access Memory,RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述仅为本申请的较佳实施例而已,并不用以限制本申请,凡在本申请的精神和原则之内,所做的任何修改、等同替换、改进等,均应包含在本申请保护的范围之内。
Claims (14)
- 一种路由表的生成方法,其特征在于,所述方法包括:获取网络中第i个节点设备在第m个频点上的空闲时长和所述网络中第i个节点设备在第m个频点上的占用时长以及,所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率以及所述网络中第i个节点设备的相邻节点信息,其中,i的取值范围为[1,网络中包含的节点设备的个数],m的取值范围为[1,第i个节点设备上频点的个数],j为所述网络中第i个节点设备的相邻节点设备集合;根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0;根据所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0,生成路由表。
- 如权利要求1所述的方法,其特征在于,根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0,包括:使用上一次所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价、上一次所述目标节点设备在第m个频点上的路由代价和所述网络中第i个节点设备的相邻节点信息,对所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价进行迭代,以获得当前所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价,其中,进行迭代的次数为N次,N的取值为网络中包含的节点设备的个数,所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的初始路由代价为无穷大和所述目标节点设备在第m个频点上的初始路由代价为0;根据第N次迭代获得的所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价,获得第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J,以及获得路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价根据第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中 第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的传输正确概率根据所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价和路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价获得所述网络中第i个节点设备在第m个频点上传输数据时,到所述网络中目标节点设备的最小路由代价根据所述网络中第i个节点设备在所有可能的频点上传输数据时,到所述网络中目标节点设备的平均最小路由代价Di,获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0。
- 如权利要求1所述的方法,其特征在于,所述方法还包括:将所述路由表发送给所述网络中的各节点设备,以使所述网络中的各节 点设备根据所述路由表路由数据。
- 一种服务器,其特征在于,所述服务器包括:获取单元,用于获取网络中第i个节点设备在第m个频点上的空闲时长和所述网络中第i个节点设备在第m个频点上的占用时长以及,所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率以及所述网络中第i个节点设备的相邻节点信息,其中,i的取值范围为[1,网络中包含的节点设备的个数],m的取值范围为[1,第i个节点设备上频点的个数],j为所述网络中第i个节点设备的相邻节点设备集合;节点集合确定单元,用于根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0;路由表生成单元,用于根据所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0,生成路由表。
- 如权利要求8所述的服务器,其特征在于,所述节点集合确定单元用于根据所述网络中第i个节点设备的相邻节点信息、所述网络中第i个节点设备在第m个频点上的资源空闲概率和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0,时,具体用于:使用上一次所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价、上一次所述目标节点设备在第m个频点上的路由代价和所述网络中第i个节点设备的相邻节点信息,对所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价进行迭代,以获得当前所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价,其中,进行迭代的次数为N次,N的取值为网络中包含的节点设备的个数,所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的初始路由代价为无穷大和所述目标节点设备在第m个频点上的初始路由代价为0;根据第N次迭代获得的所述网络中第i个节点设备在第m个频点上到所述网络中目标节点设备的路由代价,获得第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J,以及获得路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价根据第N次迭代后所述网络中各节点设备所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J和所述网络中第i个节点设备在第m个频点上与第j个节点设备之间的链路的误码率获得所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的传输正确概率根据所述网络中第i个节点设备在第m个频点上传输数据时,到路由代价最小的相邻节点设备集合J的路由代价和路由代价最小的相邻节点设备集合J中的各节点设备在m个频点上到所述网络中目标节点设备的平均路由代价获得所述网络中第i个节点设备在第m个频点上传输数据时,到所述网络中目标节点设备的最小路由代价根据所述网络中第i个节点设备在所有可能的频点上传输数据时,到所述网络中目标节点设备的平均最小路由代价Di,获得所述网络中第i个节点设备对应的路由代价最小的相邻节点设备集合J0。
- 如权利要求8所述的服务器,其特征在于,所述服务器还包括:发送单元,用于将所述路由表发送给所述网络中的各节点设备,以使所述网络中的各节点设备根据所述路由表路由数据。
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2016/113182 WO2018119933A1 (zh) | 2016-12-29 | 2016-12-29 | 一种路由表的生成方法和服务器 |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2016/113182 WO2018119933A1 (zh) | 2016-12-29 | 2016-12-29 | 一种路由表的生成方法和服务器 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2018119933A1 true WO2018119933A1 (zh) | 2018-07-05 |
Family
ID=62707407
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2016/113182 WO2018119933A1 (zh) | 2016-12-29 | 2016-12-29 | 一种路由表的生成方法和服务器 |
Country Status (1)
Country | Link |
---|---|
WO (1) | WO2018119933A1 (zh) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115473901A (zh) * | 2022-11-15 | 2022-12-13 | 四川汉唐云分布式存储技术有限公司 | 一种分布式算力集群智慧调度方法、装置及计算机设备 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2010118578A1 (zh) * | 2009-04-16 | 2010-10-21 | 华为技术有限公司 | 路由方法、装置及系统 |
CN102238684A (zh) * | 2011-08-01 | 2011-11-09 | 南京邮电大学 | 一种基于带宽和时延双目标优化的路由方法 |
CN103491595A (zh) * | 2013-09-13 | 2014-01-01 | 深圳先进技术研究院 | 路由生成方法、装置和一种无线传感器网络 |
CN103781145A (zh) * | 2012-10-25 | 2014-05-07 | 上海交通大学 | 认知无线传感网络中多信道机会路由协议的设计方法 |
-
2016
- 2016-12-29 WO PCT/CN2016/113182 patent/WO2018119933A1/zh active Application Filing
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2010118578A1 (zh) * | 2009-04-16 | 2010-10-21 | 华为技术有限公司 | 路由方法、装置及系统 |
CN102238684A (zh) * | 2011-08-01 | 2011-11-09 | 南京邮电大学 | 一种基于带宽和时延双目标优化的路由方法 |
CN103781145A (zh) * | 2012-10-25 | 2014-05-07 | 上海交通大学 | 认知无线传感网络中多信道机会路由协议的设计方法 |
CN103491595A (zh) * | 2013-09-13 | 2014-01-01 | 深圳先进技术研究院 | 路由生成方法、装置和一种无线传感器网络 |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115473901A (zh) * | 2022-11-15 | 2022-12-13 | 四川汉唐云分布式存储技术有限公司 | 一种分布式算力集群智慧调度方法、装置及计算机设备 |
CN115473901B (zh) * | 2022-11-15 | 2023-03-10 | 四川汉唐云分布式存储技术有限公司 | 一种分布式算力集群智慧调度方法、装置及计算机设备 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7720440B2 (en) | Distributed coordination of a clear channel assessment (CCA) threshold | |
US9002277B2 (en) | Distributed channel selection for wireless networks | |
CN111200846A (zh) | 时延敏感网络通信方法及其装置 | |
EP3852419A1 (en) | Latency-sensitive network communication method and apparatus thereof | |
RU2610250C2 (ru) | Узел передачи и способ отчетности о статусе буфера | |
CN110601978B (zh) | 流量分发控制方法和装置 | |
CN109347540B (zh) | 一种安全路由的实现方法及装置 | |
CN108632307A (zh) | 一种会话连接建立方法以及smf | |
CN108513361A (zh) | 信道接入方法、装置及存储介质 | |
Rothfus et al. | Social-similarity-based routing algorithm in delay tolerant networks | |
Alim et al. | Structural vulnerability assessment of community-based routing in opportunistic networks | |
CN104363187A (zh) | 一种物联网网关资源响应方法和装置 | |
Chen et al. | Adaptive channel recommendation for opportunistic spectrum access | |
WO2018119933A1 (zh) | 一种路由表的生成方法和服务器 | |
Happ et al. | On the impact of clustering for IoT analytics and message broker placement across cloud and edge | |
Shafiul Azam Howlader et al. | Delay‐insensitive identification of neighbors using unslotted and slotted protocols | |
CN103298078B (zh) | 通信系统中主动地确定通信链路的设备和方法 | |
US9692685B2 (en) | Heterogeneous network system, network apparatus, and rendezvous path selection method thereof | |
Wei et al. | CACC: A context-aware congestion control approach in smartphone networks | |
Mehta | Recursive quadratic programming for constrained nonlinear optimization of session throughput in multiple‐flow network topologies | |
CN105141527B (zh) | 一种物联网网络中路由安全和隐私保护的方法 | |
CN111866845B (zh) | 数据传输方法、装置、设备及计算机可读存储介质 | |
Rasool et al. | An approximate analysis of buffered S-ALOHA in fading channels using tagged user analysis | |
US10715390B2 (en) | Service optimization method, transport controller, client controller, and system | |
CN107979855B (zh) | 一种数据传输方法、基站及计算机存储介质 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 16925860 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 16925860 Country of ref document: EP Kind code of ref document: A1 |