WO2017024952A1 - 设备到设备的无线网格网络的路由寻找方法和装置 - Google Patents

设备到设备的无线网格网络的路由寻找方法和装置 Download PDF

Info

Publication number
WO2017024952A1
WO2017024952A1 PCT/CN2016/092366 CN2016092366W WO2017024952A1 WO 2017024952 A1 WO2017024952 A1 WO 2017024952A1 CN 2016092366 W CN2016092366 W CN 2016092366W WO 2017024952 A1 WO2017024952 A1 WO 2017024952A1
Authority
WO
WIPO (PCT)
Prior art keywords
terminal
neighboring node
power information
base station
mesh network
Prior art date
Application number
PCT/CN2016/092366
Other languages
English (en)
French (fr)
Inventor
谢佳锐
王亚峰
陈琳
戴博
吴栓栓
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to EP16834576.7A priority Critical patent/EP3337241A4/en
Priority to US15/750,680 priority patent/US20180227827A1/en
Publication of WO2017024952A1 publication Critical patent/WO2017024952A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/30—Connectivity information management, e.g. connectivity discovery or connectivity update for proactive routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/42—Centralised routing
    • 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
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/34—Modification of an existing route
    • H04W40/38—Modification of an existing route adapting due to varying relative distances between nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • 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

Definitions

  • This document relates to, but is not limited to, the field of mobile communication technologies, and in particular, to a route finding method and apparatus for a device-to-device wireless mesh network.
  • LTE Long Term Evolution
  • LTE-Advanced Long Term Evolution-Advanced
  • D2D Device to Device
  • D2D communication is a new type of technology that directly communicates between different terminals by multiplexing cell frequency resources under the control of a cellular system. Due to its short-distance communication characteristics and direct communication mode, D2D communication technology can effectively save system resources and improve system spectrum efficiency.
  • D2D is short-distance communication
  • the two devices cannot communicate after exceeding a certain range, which seriously affects the reliability of communication.
  • the technology can be combined with the mesh network of D2D and wireless mesh network. Through the multi-hop feature of the Mesh network, two remote devices can establish communication.
  • the Mesh network generally uses the spectrum resources of the unlicensed frequency band, and the communication distance is long.
  • the routing problem of the Mesh network generally only considers the distance, and does not consider the channel capacity and the mobility of the device.
  • the embodiment of the invention provides a route search method and device for a D2D Mesh network, which can improve the stability of the route.
  • a route finding method for a wireless mesh Mesh network of a device to a device D2D comprising:
  • the terminal sends a route seeking request to the base station
  • the route searching method further includes:
  • the terminal acquires the identity identifier of the neighboring node of the terminal and the power information of the neighboring node, and sends the identity identifier of the neighboring node and the power information of the neighboring node to the base station.
  • the acquiring, by the terminal, the identity of the neighboring node of the terminal and the power information of the neighboring node including:
  • the terminal receives a device discovery message sent by the neighboring node, where the device discovery message includes an identity identifier of the neighboring node and power information of the neighboring node.
  • the acquiring, by the terminal, the identity of the neighboring node of the terminal and the power information of the neighboring node further includes:
  • the terminal updates the neighboring node in the management information of the neighboring node according to the power information of the neighboring node in the device discovery message. Power information; if the neighboring node is not in the management information of the neighboring node recorded by the terminal, the terminal saves the neighboring node in the device discovery message in the management information of the neighboring node recorded by the terminal The identity of the identity and the power information of the neighboring node.
  • the sending the identity identifier of the neighboring node and the power information of the neighboring node to the base station including:
  • the terminal sends a request for accessing the Mesh network to the base station, where the request for accessing the Mesh network includes the identity identifier of the neighboring node and the power information of the neighboring node;
  • the identity identifier of the neighboring node and the power information of the neighboring node are sent to the base station.
  • the request and/or route seeking request for accessing the Mesh network includes a request sequence number; and the request sequence number of the request for accessing the Mesh network is used by the base station to distinguish whether the request of the terminal to access the Mesh network is The request sequence number of the route search request is used by the base station to distinguish whether the route search request sent by the terminal is valid.
  • sending the identity identifier of the neighboring node and the power information of the neighboring node to the base station includes:
  • the identity of the neighboring node and the power information of the neighboring node are sent to the base station by any of the following methods:
  • Manner 2 periodically send identity information and power information of each adjacent node of the terminal to the base station.
  • a route finding method for a wireless mesh Mesh network of a device to a device D2D comprising:
  • the base station After receiving the route seeking request of the terminal, the base station calculates routing information for the terminal according to the obtained identity identifier of the neighboring node of the terminal and the power information of the neighboring node;
  • the base station sends the routing information to the terminal.
  • the route searching method further includes: the base station receiving a request for accessing a Mesh network sent by the terminal, where the request for accessing the Mesh network includes an identity identifier of the neighboring node of the terminal, and the Power information of adjacent nodes;
  • the base station receives, by the terminal that has accessed the Mesh network, the neighboring node identity of the terminal and the power information of the neighboring node.
  • the base station calculates routing information for the terminal according to the obtained identity identifier of the neighboring node of the terminal and the power information of the neighboring node, including:
  • the base station calculates, according to the acquired identity identifier of the neighboring node of the terminal and the power information of the neighboring node, a weight value of a link between each node in the D2D mesh network;
  • the base station calculates routing information for the terminal according to the weight value of the link.
  • the weight value of the link between each node in the D2D mesh network is obtained by:
  • w i,j represents the weight value of the link between the terminal i and the terminal j in the Mesh network of the D2D
  • ⁇ is the weight of the signal power information received in the current period
  • p cij is in the reporting period.
  • the terminal i receives the signal power information of the terminal j
  • p pij is the signal power information of the terminal j received by the terminal i in the last reporting period
  • T is the time length of the reporting period
  • ⁇ t is the time difference of the reporting time of p cij and p pij .
  • a route finding device of the wireless mesh Mesh network of the device to the device D2D is disposed in the terminal, and includes:
  • a first sending module configured to send a route seeking request to the base station
  • the first receiving module is configured to receive, by the base station, routing information determined by the base station according to the identity identifier of the neighboring node of the terminal and the power information of the neighboring node.
  • the route searching device further includes:
  • a first acquiring module configured to acquire an identity identifier of the neighboring node of the terminal and power information of the neighboring node
  • the first sending module is further configured to send the identity identifier of the neighboring node and the power information of the neighboring node to the base station.
  • the first obtaining module includes:
  • the first receiving unit is configured to receive a device discovery message sent by the neighboring node, where the device discovery message includes an identity identifier of the neighboring node and power information of the neighboring node.
  • the first obtaining module further includes: a first determining unit, configured to determine, according to the identity identifier of the neighboring node, whether the neighboring node is in management information of the neighboring node recorded by the terminal;
  • a first processing unit configured to: if the neighboring node is in the management information of the neighboring node recorded by the terminal, update the management information of the neighboring node according to the power information of the neighboring node in the device discovery message Determining the power information of the neighboring node; if the neighboring node is not in the management information of the neighboring node recorded by the terminal, storing the adjacency in the device discovery message in the management information of the neighboring node recorded by the terminal The identity of the node and the power information of the neighboring node.
  • the first sending module includes:
  • the first sending unit is configured to send a request for accessing the Mesh network to the base station, where the request for accessing the Mesh network includes the identity identifier of the neighboring node of the terminal and the power information of the neighboring node;
  • the second sending unit is configured to send, after the terminal accesses the Mesh network, an identity of the neighboring node of the terminal and power information of the neighboring node to the base station.
  • the request and/or route seeking request for accessing the Mesh network includes a request sequence number; and the request sequence number of the request for accessing the Mesh network is used by the base station to distinguish whether the request of the terminal to access the Mesh network is The request sequence number of the route search request is used by the base station to distinguish whether the route search request sent by the terminal is valid.
  • the sending, by the first sending module, the identity identifier of the neighboring node and the power information of the neighboring node to the base station after the terminal accesses the Mesh network includes:
  • the identity of the neighboring node and the power information of the neighboring node are sent to the base station by any of the following methods:
  • Manner 2 periodically send identity information and power information of each adjacent node of the terminal to the base station.
  • a route finding device for a wireless mesh Mesh network of a device to a device D2D comprising:
  • the calculating module is configured to: after receiving the route seeking request of the terminal, calculate routing information for the terminal according to the identity identifier of the neighboring node of the terminal and the power information of the neighboring node;
  • the second sending module is configured to send the routing information to the terminal.
  • the route searching device further includes:
  • the second obtaining module is configured to receive a request for accessing the Mesh network sent by the terminal, where the request for accessing the Mesh network includes an identity identifier of the neighboring node of the terminal and power information of the neighboring node;
  • And/or configured to receive the neighboring node identity of the terminal and the power information of the neighboring node sent by the terminal that has accessed the Mesh network.
  • the calculating module includes:
  • a first calculating unit configured to calculate, according to the acquired identity of the neighboring node of the terminal and the power information of the neighboring node, a weight value of a link between each node in the D2D mesh network;
  • the second calculating unit is configured to calculate routing information for the terminal according to the weight value of the link.
  • the second calculating unit calculates a weight value of a link between each node in the D2D mesh network by:
  • w i,j represents the weight value of the link between the terminal i and the terminal j in the Mesh network of the D2D
  • ⁇ is the weight of the signal power information received in the current period
  • p cij is in the reporting period.
  • the terminal i receives the signal power information of the terminal j
  • p pij is the signal power information of the terminal j received by the terminal i in the last reporting period
  • T is the time length of the reporting period
  • ⁇ t is the time difference of the reporting time of p cij and p pij .
  • a computer readable storage medium storing computer executable instructions, the computer being executable Line instructions are used to perform the above methods.
  • the routing information is determined by the neighboring node of the terminal and the power information of the neighboring node, and the route can be determined according to the channel capacity and the terminal mobility, thereby improving the system capacity, improving the stability of the route, and reducing the search. Road overhead.
  • FIG. 1 is a flowchart of a route searching method for a D2D Mesh network according to an embodiment of the present invention
  • FIG. 2 is a flowchart of another D2D Mesh network route searching method according to an embodiment of the present invention.
  • FIG. 3 is a schematic diagram of an application scenario of a D2D Mesh network according to an embodiment of the present disclosure
  • 4a is an initial distribution diagram of a terminal according to an embodiment of the present invention.
  • FIG. 4b is a distribution diagram when a route reselection occurs in the terminal shown in FIG. 4a;
  • FIG. 5 is a comparison diagram of spectrum utilization rates in scenarios of different numbers of users according to an embodiment of the present invention.
  • FIG. 6 is a comparison diagram of route reselection times in a scenario with different number of users according to an embodiment of the present invention
  • FIG. 7 is a comparison diagram of spectrum utilization rates under different time parameters according to an embodiment of the present invention.
  • FIG. 8 is a comparison diagram of route reselection times under different time parameters according to an embodiment of the present invention.
  • FIG. 9 is a structural diagram of a route searching device for a D2D Mesh network according to an embodiment of the present invention.
  • FIG. 10 is a structural diagram of another route searching device for a D2D Mesh network according to an embodiment of the present invention.
  • FIG. 1 is a flow chart of a route search method for a D2D Mesh network according to an embodiment of the present invention; Cheng Tu.
  • the method shown in Figure 1 includes steps 101-102:
  • Step 101 The terminal sends a route seeking request to the base station.
  • Step 102 The terminal receives, according to the identity identifier of the neighboring node of the terminal, and the power information of the neighboring node, the routing information determined by the terminal.
  • the method provided by the embodiment of the present invention can determine the route according to the channel capacity and the terminal mobility by receiving the routing information determined by the base station according to the identity identifier of the neighboring node and the power information of the neighboring node, thereby improving the system capacity and improving The stability of the route can reduce the path finding overhead.
  • the route searching method further includes step 100:
  • the terminal acquires an identity identifier of the neighboring node of the terminal and power information of the neighboring node, and sends an identity identifier of the neighboring node and power information of the neighboring node to the base station.
  • Step 100 may be, but is not limited to, being performed before step 101, or the obtaining operation in step 100 may be performed before step 101, and the transmitting operation and step 101 are performed in parallel.
  • Other execution sequences are also possible, as long as the base station obtains the identity of the neighboring node of the terminal and the power information of the neighboring node when determining the routing information.
  • FIG. 2 is a flowchart of another route search method for a D2D Mesh network according to an embodiment of the present invention.
  • the method shown in Figure 2 includes steps 201-202:
  • Step 201 After receiving the route seeking request of the terminal, the base station calculates routing information for the terminal according to the obtained identity identifier of the neighboring node of the terminal and the power information of the neighboring node.
  • Step 202 The base station sends the routing information to the terminal.
  • the base station determines routing information by using neighboring nodes of the terminal and power information of the neighboring node, and can determine routing according to channel capacity and terminal mobility, improve system capacity, and improve routing stability. Sex can reduce the cost of pathfinding.
  • the terminal acquires an identity identifier of the neighboring node of the terminal and the neighboring node.
  • Power information can include:
  • the terminal receives a device discovery message sent by the neighboring node, where the device discovery message includes an identity identifier of the neighboring node and power information of the neighboring node.
  • the acquiring, by the terminal, the identity of the neighboring node of the terminal and the power information of the neighboring node may further include:
  • the terminal updates the neighboring node in the management information of the neighboring node according to the power information of the neighboring node in the device discovery message. Power information; if the neighboring node is not in the management information of the neighboring node recorded by the terminal, the terminal saves the neighboring node in the device discovery message in the management information of the neighboring node recorded by the terminal The identity of the identity and the power information of the neighboring node.
  • the process of device discovery is similar to the process of D2D device discovery in related technologies.
  • the terminal broadcasts a discovery signal, and other terminals reply to the form of an ACK signal, and the related technology can be used, and the compatibility is good.
  • the sending the identity identifier of the neighboring node and the power information of the neighboring node to the base station may include:
  • the terminal sends a request for accessing the Mesh network to the base station, where the request for accessing the Mesh network includes the identity identifier of the neighboring node and the power information of the neighboring node;
  • the identity identifier of the neighboring node and the power information of the neighboring node are sent to the base station.
  • the case where the terminal sends the identity and power information of the neighboring node after accessing the Mesh network includes at least one of the following:
  • the terminal may send the access first before sending the identity and power information of the neighboring node.
  • the request of the Mesh network sends the identity and power information of the neighboring node after determining that the access is allowed, and does not send when the access is not allowed. This ensures that the identity and power information of the neighboring node are sent only when access is allowed, which ensures the validity of the transmitted data, reduces the transmission of invalid data, and achieves the purpose of fully utilizing the bandwidth resources.
  • the request and/or route lookup request for accessing the Mesh network includes a request sequence number, where the request sequence number of the request for accessing the Mesh network is used by the base station to distinguish whether the request for accessing the Mesh network is A valid request; the request sequence number of the route finding request is used by the base station to distinguish whether the route seeking request sent by the terminal is valid.
  • the request for accessing the Mesh network may include a terminal ID, a request sequence number, and a neighbor node list.
  • the request for accessing the Mesh network by the terminal to the base station may be blocked due to delay, etc., and the request will time out.
  • the terminal will initiate a request to access the Mesh network again.
  • the request sequence number size of the request into the Mesh network distinguishes the request of the failed access Mesh network.
  • the terminal may periodically report the change information of the adjacent node.
  • the terminal may send a route seeking request to the base station, where the route seeking request may include: a destination terminal ID, a request sequence number, a QoS (Quality of Service) parameter, and a data volume. size.
  • the route lookup request sent by the terminal to the base station may be blocked due to delay, etc., and the route lookup request times out.
  • the terminal will initiate a route lookup request again, and the base station distinguishes the request sequence number by the route lookup request. Invalid route lookup request.
  • sending the identity identifier of the neighboring node and the power information of the neighboring node to the base station may include:
  • Manner 2 periodically transmitting identity information and power information of each adjacent node of the terminal to Base station.
  • the method for reporting the power information to the base station after the terminal accesses the Mesh network is divided into two types.
  • the first type is event trigger reporting. When the power information of the neighboring node is detected to be changed greatly (that is, the power information changes according to the preset value. In case of conditional, the incremental reporting is performed, only the identity and power information of the node are reported; the second is periodic reporting, and each period needs to be reported in full, that is, the identity and power information of each adjacent node is reported.
  • the process on the base station side may further include:
  • the base station receives the neighboring node identity identifier of the terminal and the power information of the neighboring node that are sent by the terminal that has accessed the Mesh network.
  • the case where the base station receives the neighboring node identity identifier of the terminal and the power information of the neighboring node sent by the terminal that has accessed the Mesh network includes at least one of the following:
  • the base station receives the identity and power information of the updated neighboring node that is sent after the terminal accesses the Mesh network.
  • the base station After determining that the terminal is allowed to access, the base station receives the identity identifier and power information of the neighboring node sent by the terminal, and does not receive the terminal to send when the terminal is not allowed to access.
  • the identity and power information of the neighboring node ensures that the identity and power information of the neighboring nodes of the terminal can be received only when the terminal is allowed to access, which can ensure the validity of the transmitted data and reduce the transmission of invalid data. Make full use of the purpose of bandwidth resources.
  • the calculating, by the base station, the routing information for the terminal according to the obtained identity identifier of the neighboring node of the terminal and the power information of the neighboring node may include:
  • the base station calculates, according to the acquired identity identifier of the neighboring node of the terminal and the power information of the neighboring node, a weight value of a link between each node in the D2D mesh network;
  • the base station calculates routing information for the terminal according to the weight value of the link.
  • the weight value of the link between each node in the D2D mesh network can be obtained as follows:
  • w i,j represents the weight value of the link between the terminal i and the terminal j in the Mesh network of the D2D
  • ⁇ is the weight of the signal power information received in the current period
  • p cij is in the reporting period.
  • the terminal i receives the signal power information of the terminal j
  • p pij is the signal power information of the terminal j received by the terminal i in the last reporting period
  • T is the time length of the reporting period
  • ⁇ t is the time difference of the reporting time of p cij and p pij .
  • the D2D mesh network since the D2D mesh network multiplexes the uplink resources of the cellular, the wireless channel is relatively complex, and the channel capacity depends on the bandwidth and the signal to noise ratio. In the case of a certain bandwidth, the channel capacity depends on the signal to noise ratio of the channel.
  • the received power information of the device reflects the distance between the devices to some extent. Therefore, in the mobility-sensitive D2D mesh network, the change of the received power information can reflect the relative motion between the two devices. When the received power information becomes small, the two devices are far apart from each other, and when the variation is large, the two devices are far away from each other.
  • ⁇ is the weight of the received signal power information in the current period, which can be determined by empirical values or experiments; when ⁇ is larger, the proportion of the signal power information received in the current period in the weight value The larger the proportion, the smaller the proportion of mobility; p cij is the signal power information of terminal j received by terminal i in the reporting period, and p pij is the signal power information of terminal j received by terminal i in the last reporting period. , T is the length of time of the reporting period, and ⁇ t is the time interval for reporting p cij and p pij , Indicates how fast the received power information changes. It can be seen that the smaller the weight, the more suitable the terminal is as a route.
  • the base station can calculate the weight of each link. Because the weight is smaller, the terminal is more suitable to act as a route. Therefore, the routing problem can be abstracted into the shortest path problem of graph theory. The following description:
  • V represents the set of all nodes (ie, terminals) in the D2D Mesh network
  • E represents the set of all links in the D2D Mesh network, if the node u and the node v , adjacent to and there is a link (u, v), then (u, v) ⁇ E.
  • the link (u, v) cost is represented by d uv
  • D v is a given node v reaches the shortest route to the destination node.
  • the routing problem is to find the shortest path from the node to the destination node by the following formula, ie
  • the routing calculation can be implemented by the shortest path algorithm including but not limited to the Dijkstra algorithm.
  • shortest path algorithms There are many shortest path algorithms, which is also a scalability of the protocol. By using different shortest path algorithms according to QoS parameters, it can be made. higher efficiency.
  • the method provided by the embodiment of the present invention includes the following steps:
  • Step 1 The terminal performs device discovery to generate a list of neighboring nodes.
  • Step 2 The terminal sends a request for accessing the Mesh network to the base station, where the request for accessing the Mesh network includes the identity identifier of the neighboring node and the power information of the neighboring node; the base station returns an ACK to the terminal, and then the terminal accesses Mesh network. After the access, the terminal may also report the power information change information to the base station.
  • the method of reporting is divided into two types. The first one is event-triggered reporting. When the power information of the neighboring node is detected to be changed greatly, the incremental reporting is performed, and only the ID and power information of the node are reported. The second is periodic reporting. , each period needs to be reported once in full;
  • Step 3 The terminal sends a route seeking request to the base station.
  • Step 4 The base station searches for the best route through the pathfinding algorithm.
  • Step 5 The base station sends routing information to the terminal.
  • the calculation process of the base station is as follows:
  • the base station obtains the topology map of the network and the received power information of different terminals by using the identity and power information of the neighboring nodes obtained in the second step.
  • the weight of each link can be calculated based on the size of the received power information.
  • the embodiment of the present invention proposes a new route measurement method:
  • the D2D mesh network multiplexes the uplink resources of the cellular, the wireless channel is complicated, and the channel capacity depends on the bandwidth and the signal to noise ratio. In the case of a certain bandwidth, the channel capacity depends on the signal to noise ratio of the channel.
  • the received power information of the device reflects the distance between the devices to some extent. Therefore, in the mobility-sensitive D2D mesh network, the change of the received power information can reflect the relative motion between the two devices. When the received power information becomes small, the two devices are far apart from each other, and when the variation is large, the two devices are far away from each other.
  • ⁇ is the weight of the received signal power information in the current period, which can be determined by empirical values or experiments; when ⁇ is larger, the proportion of the signal power information received in the current period in the weight value The larger the proportion, the smaller the proportion of mobility; p cij is the signal power information of terminal j received by terminal i in the reporting period, and p pij is the signal power information of terminal j received by terminal i in the last reporting period. , T is the length of time of the reporting period, and ⁇ t is the time interval for reporting p cij and p pij , Indicates how fast the received power information changes. It can be seen that the smaller the weight, the more suitable the terminal is as a route.
  • the base station can calculate the weight value of each link.
  • a research scenario of an embodiment of the present invention is introduced: a plurality of D2D terminals are included in one cellular network, and the D2D terminals multiplex cellular network uplink resources.
  • Table 1 gives the parameter settings for the experimental simulation of an embodiment of the present invention.
  • FIG. 4a and FIG. 4b are initial distribution diagrams of the terminal and a distribution diagram when a route reselection occurs.
  • the circle represents the D2D terminal.
  • the solid line path and the dotted line path respectively indicate a route selected by DSR (Dynamic Source Routing) and the embodiment of the present invention.
  • the DSR routing protocol mainly considers the distance when selecting routes, while ignoring the mobility factor. Therefore, the selected route stability is not good enough, and the route needs to be re-selected again in a short time. In this example, the DSR selected route fails after 5 seconds, and the route selected by the embodiment of the present invention is always valid.
  • FIG. 5 shows the change of the spectrum utilization rate of the system when the number of D2D terminals changes.
  • Figure 6 shows the change in the number of route reselection times when the number of D2D terminals changes. It can be seen that when the number of terminals becomes larger, the number of terminals in the area increases, the density is higher, the spectrum utilization rate becomes larger, and the possibility of routing reselection is also reduced.
  • FIG. 7 shows the spectrum utilization change of the system when the time changes
  • FIG. 8 shows the change of the number of route reselection times when the time changes. It can be seen that as the time becomes longer, the points gradually become dispersed, so the spectrum utilization rate gradually decreases and the number of route reselections gradually increases.
  • FIG. 9 is a structural diagram of a route searching device for a D2D Mesh network according to an embodiment of the present invention.
  • the device shown in FIG. 9 is disposed in the terminal, and includes:
  • the first sending module 902 is configured to send a route seeking request to the base station, and send an identity identifier of the neighboring node of the terminal and power information of the neighboring node;
  • the first receiving module 903 is configured to receive, by the base station, routing information determined by the base station according to the identity identifier of the neighboring node and the power information of the neighboring node.
  • the device may further include:
  • a first acquiring module configured to acquire an identity identifier of the neighboring node of the terminal and power information of the neighboring node
  • the first sending module may be further configured to send the identity identifier of the neighboring node and the power information of the neighboring node to the base station.
  • the first obtaining module may include:
  • the first receiving unit is configured to receive a device discovery message sent by the neighboring node, where the device discovery message includes an identity identifier of the neighboring node and power information of the neighboring node.
  • the first obtaining module may further include:
  • the first determining unit is configured to determine, according to the identity identifier of the neighboring node, whether the neighboring node is in management information of the neighboring node recorded by the terminal;
  • a first processing unit configured to: if the neighboring node is in the management information of the neighboring node recorded by the terminal, update the management information of the neighboring node according to the power information of the neighboring node in the device discovery message Determining the power information of the neighboring node; if the neighboring node is not in the management information of the neighboring node recorded by the terminal, storing the adjacency in the device discovery message in the management information of the neighboring node recorded by the terminal The identity of the node and the power information of the neighboring node.
  • the first sending module may include:
  • the first sending unit is configured to send a request for accessing the Mesh network to the base station, where the request for accessing the Mesh network includes the identity identifier of the neighboring node of the terminal and the power information of the neighboring node;
  • the second sending unit is configured to send, after the terminal accesses the Mesh network, an identity of the neighboring node of the terminal and power information of the neighboring node to the base station.
  • the request and/or route seeking request for accessing the Mesh network may include a request sequence number, where the request sequence number of the request for accessing the Mesh network is used by the base station to distinguish whether the request of the terminal to access the Mesh network is The request sequence number of the route search request is used by the base station to distinguish whether the route search request sent by the terminal is valid.
  • the first sending module sends the station to the base station after the terminal accesses the Mesh network.
  • the identity of the neighboring node and the power information of the neighboring node include:
  • the identity of the neighboring node and the power information of the neighboring node are sent to the base station by any of the following methods:
  • Manner 2 periodically send identity information and power information of each adjacent node of the terminal to the base station.
  • the device provided by the embodiment of the present invention determines the route by using the power information of the neighboring node and the neighboring node, and can determine the route according to the channel capacity and the terminal mobility, improve the system capacity, improve the stability of the route, and reduce the path finding. Overhead.
  • FIG. 10 is a structural diagram of another route searching device for a D2D Mesh network according to an embodiment of the present invention.
  • the device shown in Figure 10 includes:
  • the calculating module 1002 is configured to: after receiving the route seeking request of the terminal, calculate routing information for the terminal according to the identity identifier of the neighboring node of the terminal and the power information of the neighboring node;
  • the second sending module 1003 is configured to send the routing information to the terminal.
  • the device may further include:
  • the second obtaining module is configured to receive a request for accessing the Mesh network sent by the terminal, where the request for accessing the Mesh network includes an identity identifier of the neighboring node of the terminal and power information of the neighboring node;
  • And/or configured to receive the neighboring node identity of the terminal and the power information of the neighboring node sent by the terminal that has accessed the Mesh network.
  • the computing module can include:
  • a first calculating unit configured to calculate, according to the acquired identity of the neighboring node of the terminal and the power information of the neighboring node, a weight value of a link between each node in the D2D mesh network;
  • the second calculating unit is configured to calculate routing information for the terminal according to the weight value of the link.
  • the second calculating unit may calculate the weight value of the link between each node in the D2D mesh network by:
  • w i,j represents the weight value of the link between the terminal i and the terminal j in the Mesh network of the D2D
  • ⁇ is the weight of the signal power information received in the current period
  • p cij is in the reporting period.
  • the terminal i receives the signal power information of the terminal j
  • p pij is the signal power information of the terminal j received by the terminal i in the last reporting period
  • T is the time length of the reporting period
  • ⁇ t is the time difference of the reporting time of p cij and p pij .
  • the device provided by the embodiment of the present invention determines the route by using the power information of the neighboring node and the neighboring node, and can determine the route according to the channel capacity and the terminal mobility, improve the system capacity, improve the stability of the route, and reduce the path finding. Overhead.
  • the embodiment of the invention further provides a computer readable storage medium storing computer executable instructions for performing the above method.
  • all or part of the steps of the above embodiments may also be implemented by using an integrated circuit. These steps may be separately fabricated into individual integrated circuit modules, or multiple modules or steps may be fabricated into a single integrated circuit module. achieve. Thus, embodiments of the invention are not limited to any specific combination of hardware and software.
  • the device/function module/functional unit in the above embodiments may be implemented by using a general-purpose computing device, which may be concentrated on a single computing device or distributed in multiple computing devices. On the network.
  • the device/function module/functional unit in the above embodiment When the device/function module/functional unit in the above embodiment is implemented in the form of a software function module and sold or used as a stand-alone product, it can be stored in a computer readable storage medium.
  • the above mentioned computer readable storage medium may be a read only memory, a magnetic disk or an optical disk or the like.
  • the routing information is determined by the neighboring node of the terminal and the power information of the neighboring node, and the route can be determined according to the channel capacity and the terminal mobility, thereby improving the system capacity, improving the stability of the route, and reducing the search. Road overhead.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

一种设备到设备的无线网格网络的路由寻找方法和装置。所述方法包括：所述终端向基站发送路由寻找请求；所述终端接收所述基站根据所述终端的邻接节点的身份标识和所述邻接节点的功率信息为所述终端确定的路由信息。

Description

设备到设备的无线网格网络的路由寻找方法和装置 技术领域
本文涉及但不限于移动通信技术领域，尤其涉及一种设备到设备的无线网格网络的路由寻找方法和装置。
背景技术
随着LTE(Long Term Evolution，长期演进)/LTE-Advanced等蜂窝无线网络的广泛发展，D2D(Device to Device，设备到设备)通信引起了更多的关注。
D2D通信是一种在蜂窝系统的控制下，不同终端之间通过复用小区频率资源直接通信的新型技术。由于本身具有短距离通信特点和直接通信方式，D2D通信技术可以有效地节省系统资源，提升系统频谱效率。
但是，由于D2D是短距离通信，因此两个设备距离超过一定范围后便无法通信，严重影响了通信的可靠性，为了拓展D2D的通信距离，可以通过D2D与无线网格网络Mesh网络结合的技术，通过Mesh网络多跳的特性，使两个距离较远的设备能够建立通信。
目前，Mesh网络一般采用的是非授权频段的频谱资源，而且通信距离较长，Mesh网络的路由问题一般只考虑距离，不考虑信道容量及设备的移动性。
发明内容
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
本发明实施例提供一种D2D的Mesh网络的路由寻找方法和装置，可以提高路由的稳定性。
本发明实施例提供如下技术方案。
一种设备到设备D2D的无线网格Mesh网络的路由寻找方法，包括：
终端向基站发送路由寻找请求；
所述终端接收所述基站根据所述终端的邻接节点的身份标识和所述邻接节点的功率信息为所述终端确定的路由信息。
可选地，所述的路由寻找方法还包括：
所述终端获取所述终端的邻接节点的身份标识和所述邻接节点的功率信息，发送所述邻接节点的身份标识和所述邻接节点的功率信息给基站。
可选地，所述终端获取所述终端的邻接节点的身份标识和所述邻接节点的功率信息，包括：
终端接收邻接节点发送的设备发现消息，其中所述设备发现消息包括所述邻接节点的身份标识和所述邻接节点的功率信息。
可选地，所述终端获取所述终端的邻接节点的身份标识和所述邻接节点的功率信息还包括：
所述终端根据所述邻接节点的身份标识，判断所述邻接节点是否在所述终端记录的邻接节点的管理信息中；
如果所述邻接节点在所述终端记录的邻接节点的管理信息中，则所述终端根据设备发现消息中的所述邻接节点的功率信息，更新所述邻接节点的管理信息中所述邻接节点的功率信息；如果所述邻接节点不在所述终端记录的邻接节点的管理信息中，则所述终端在所述终端记录的邻接节点的管理信息中，保存所述设备发现消息中的所述邻接节点的身份标识以及所述邻接节点的功率信息。
可选地，所述发送所述邻接节点的身份标识和所述邻接节点的功率信息给基站，包括：
所述终端向基站发送接入Mesh网络的请求，所述接入Mesh网络的请求中包含所述邻接节点的身份标识和所述邻接节点的功率信息；
和/或，
所述终端接入Mesh网络后，向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息。
可选地，所述接入Mesh网络的请求和/或路由寻找请求包括请求序列号；所述接入Mesh网络的请求的请求序列号用于供基站区分所述终端接入Mesh网络的请求是否为有效请求；所述路由寻找请求的请求序列号用于供基站区分所述终端发送的路由寻找请求是否有效。
可选地，所述终端接入Mesh网络后，向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息包括：
通过如下任一方式向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息：
方式一：当检测到邻接节点的功率信息的变化符合预先设置的数值条件时，所述终端发送功率信息的变化符合预先设置的数值条件的邻接节点的身份标识及功率信息给基站；
方式二：周期性发送所述终端的每个邻接节点的身份信息及功率信息给基站。
一种设备到设备D2D的无线网格Mesh网络的路由寻找方法，包括：
基站收到终端的路由寻找请求后，根据所获取的所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，为所述终端计算路由信息；
所述基站向所述终端发送所述路由信息。
可选地，所述的路由寻找方法还包括：所述基站接收所述终端发送的接入Mesh网络的请求，所述接入Mesh网络的请求包括所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
和/或，所述基站接收已接入Mesh网络的所述终端发送的所述终端的邻接节点身份标识和所述邻接节点的功率信息。
可选地，所述基站根据所获取的所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，为所述终端计算路由信息，包括：
所述基站根据所获取的所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，计算所述D2D的Mesh网络中每个节点间链路的权重值；
所述基站根据所述链路的权重值，为所述终端计算路由信息。
可选地，所述D2D的Mesh网络中每个节点间链路的权重值是通过如下方式得到的：
Figure PCTCN2016092366-appb-000001
其中，wi,j表示D2D的Mesh网络中，终端i和终端j之间链路的权重值，α是本周期内接收到的信号功率信息占权重的大小，pcij是在本上报周期内终端i接收到终端j的信号功率信息，ppij是上一上报周期的终端i接收到终端j的信号功率信息，T为上报周期的时间长度，Δt为pcij和ppij的上报时间的时间差。
一种设备到设备D2D的无线网格Mesh网络的路由寻找装置，设置于终端，包括：
第一发送模块，设置成向基站发送路由寻找请求；
第一接收模块，设置成接收所述基站根据所述终端的邻接节点的身份标识和所述邻接节点的功率信息为所述终端确定的路由信息。
可选地，所述的路由寻找装置还包括：
第一获取模块，设置成获取所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
所述第一发送模块还设置成发送所述邻接节点的身份标识和所述邻接节点的功率信息给基站。
可选地，所述第一获取模块包括：
第一接收单元，设置成接收邻接节点发送的设备发现消息，所述设备发现消息包括所述邻接节点的身份标识和所述邻接节点的功率信息。
可选地，所述第一获取模块还包括：第一判断单元，设置成根据所述邻接节点的身份标识，判断所述邻接节点是否在所述终端记录的邻接节点的管理信息中；
第一处理单元，设置成如果所述邻接节点在所述终端记录的邻接节点的管理信息中，则根据设备发现消息中的所述邻接节点的功率信息，更新所述邻接节点的管理信息中所述邻接节点的功率信息；如果所述邻接节点不在所述终端记录的邻接节点的管理信息中，则在所述终端记录的邻接节点的管理信息中，保存所述设备发现消息中的所述邻接节点的身份标识以及所述邻接节点的功率信息。
可选地，所述第一发送模块包括：
第一发送单元，设置成向基站发送接入Mesh网络的请求，所述接入Mesh网络的请求中包含所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
和/或，
第二发送单元，设置成在所述终端接入Mesh网络后，向基站发送所述终端的邻接节点的身份标识和所述邻接节点的功率信息。
可选地，所述接入Mesh网络的请求和/或路由寻找请求包括请求序列号；所述接入Mesh网络的请求的请求序列号用于供基站区分所述终端接入Mesh网络的请求是否为有效请求；所述路由寻找请求的请求序列号用于供基站区分所述终端发送的路由寻找请求是否有效。
可选地，所述第一发送模块在所述终端接入Mesh网络后，向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息包括：
通过如下任一方式向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息：
方式一：当检测到邻接节点的功率信息的变化符合预先设置的数值条件时，发送功率信息的变化符合预先设置的数值条件的邻接节点的身份标识及功率信息给基站；
方式二：周期性发送所述终端的每个邻接节点的身份信息及功率信息给基站。
一种设备到设备D2D的无线网格Mesh网络的路由寻找装置，包括：
计算模块，设置成收到终端的路由寻找请求后，根据所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，为所述终端计算路由信息；
第二发送模块，设置成向所述终端发送所述路由信息。
可选地，所述的路由寻找装置还包括：
第二获取模块，设置成接收所述终端发送的接入Mesh网络的请求，所述接入Mesh网络的请求包括所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
和/或，设置成接收已接入Mesh网络的所述终端发送的所述终端的邻接节点身份标识和所述邻接节点的功率信息。
可选地，所述计算模块包括：
第一计算单元，设置成根据所获取的所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，计算所述D2D的Mesh网络中每个节点间链路的权重值；
第二计算单元，设置成根据所述链路的权重值，为所述终端计算路由信息。
可选地，所述第二计算单元通过如下方式计算D2D的Mesh网络中每个节点间链路的权重值：
Figure PCTCN2016092366-appb-000002
其中，wi,j表示D2D的Mesh网络中，终端i和终端j之间链路的权重值，α是本周期内接收到的信号功率信息占权重的大小，pcij是在本上报周期内终端i接收到终端j的信号功率信息，ppij是上一上报周期的终端i接收到终端j的信号功率信息，T为上报周期的时间长度，Δt为pcij和ppij的上报时间的时间差。
一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执 行指令用于执行上述方法。
本发明实施例通过终端的邻接节点和所述邻接节点的功率信息为终端确定路由信息，可以根据信道容量及终端移动性来确定路由，提升了系统容量，提高了路由的稳定性，能减少寻路开销。在阅读并理解了附图和详细描述后，可以明白其它方面。
附图概述
图1为本发明实施例提供的一种D2D的Mesh网络的路由寻找方法的流程图；
图2为本发明实施例提供的另一种D2D的Mesh网络的路由寻找方法的流程图；
图3为本发明实施例提供的D2D的Mesh网络的应用场景示意图；
图4a为本发明实施例提供的终端的初始分布图；
图4b为图4a所示终端发生了一次路由重选时的分布图；
图5为本发明实施例提供的不同用户数的场景下的频谱利用率对比图
图6为本发明实施例提供的不同用户数的场景下的路由重选次数对比图
图7为本发明实施例提供的不同时间参数下的频谱利用率对比图；
图8为本发明实施例提供的不同时间参数下的路由重选次数对比图；
图9为本发明实施例提供的一种D2D的Mesh网络的路由寻找装置的结构图；
图10为本发明实施例提供的另一种D2D的Mesh网络的路由寻找装置的结构图。
本发明的实施方式
需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互任意组合。
图1为本发明实施例提供的一种D2D的Mesh网络的路由寻找方法的流 程图。图1所示方法包括步骤101～102：
步骤101、终端向基站发送路由寻找请求；
步骤102、所述终端接收所述基站根据所述终端的邻接节点的身份标识和所述邻接节点的功率信息为所述终端确定的路由信息。
本发明实施例提供的方法，通过接收由基站根据邻接节点的身份标识和所述邻接节点的功率信息所确定的路由信息，可以根据信道容量及终端移动性来确定路由，提升了系统容量，提高了路由的稳定性，能够减少寻路开销。
可选地，所述路由寻找方法还包括步骤100：
100、所述终端获取所述终端的邻接节点的身份标识和所述邻接节点的功率信息，发送所述邻接节点的身份标识和所述邻接节点的功率信息给基站。
步骤100可以但不限于在步骤101前执行，也可以步骤100中的获取操作在步骤101前执行，发送操作和步骤101并行执行。其它的执行顺序也可以，只要保证基站在确定路由信息时已获取到所述终端的邻接节点的身份标识和所述邻接节点的功率信息即可。
图2为本发明实施例提供的另一种D2D的Mesh网络的路由寻找方法的流程图。图2所示方法包括步骤201～202：
步骤201、基站收到终端的路由寻找请求后，根据所获取的所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，为所述终端计算路由信息；
步骤202、所述基站向所述终端发送所述路由信息。
本发明实施例提供的方法，所述基站通过终端的邻接节点和所述邻接节点的功率信息确定路由信息，可以根据信道容量及终端移动性来确定路由，提升了系统容量，提高了路由的稳定性，能减少寻路开销。
首先，对终端侧的流程(步骤101～102)进行说明：
其中，所述终端获取所述终端的邻接节点的身份标识和所述邻接节点的 功率信息，可以包括：
终端接收邻接节点发送的设备发现消息，其中所述设备发现消息包括所述邻接节点的身份标识和所述邻接节点的功率信息。
其中，所述终端获取所述终端的邻接节点的身份标识和所述邻接节点的功率信息，还可以包括：
所述终端根据所述邻接节点的身份标识，判断所述邻接节点是否在所述终端记录的邻接节点的管理信息信息中；
如果所述邻接节点在所述终端记录的邻接节点的管理信息中，则所述终端根据设备发现消息中的所述邻接节点的功率信息，更新所述邻接节点的管理信息中所述邻接节点的功率信息；如果所述邻接节点不在所述终端记录的邻接节点的管理信息中，则所述终端在所述终端记录的邻接节点的管理信息中，保存所述设备发现消息中的所述邻接节点的身份标识以及所述邻接节点的功率信息。
其中，设备发现的过程与相关技术中D2D设备发现的过程相似，通过终端广播发现信号，其他终端回复ACK信号的形式实现，可以沿用相关技术，兼容性较好。
其中，所述发送所述邻接节点的身份标识和所述邻接节点的功率信息给基站，可以包括：
所述终端向基站发送接入Mesh网络的请求，所述接入Mesh网络的请求中包含所述邻接节点的身份标识和所述邻接节点的功率信息；
和/或，
所述终端接入Mesh网络后，向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息。
其中，终端接入Mesh网络后发送邻接节点的身份标识和功率信息的情况至少包括以下一种：
(1)终端接入Mesh网络后在需要时再次发送邻接节点的身份标识和功率信息给基站；
(2)终端在发送邻接节点的身份标识和功率信息前，可以先发送接入 Mesh网络的请求，在确定允许接入后，终端才发送所述邻接节点的身份标识和功率信息，而在不允许接入时不发送。这样可以保证只在允许接入时，才发送邻接节点的身份标识和功率信息，能保证传输的数据的有效性，减少无效数据的传输，达到充分利用带宽资源的目的。
其中，所述接入Mesh网络的请求和/或路由寻找请求，包括请求序列号，其中所述接入Mesh网络的请求的请求序列号用于供基站区分所述接入Mesh网络的请求是否为有效请求；所述路由寻找请求的请求序列号用于供基站区分所述终端发送的路由寻找请求是否有效。
其中，接入Mesh网络的请求可以包括终端的ID、请求序列号和邻接节点列表。由于终端向基站发送的接入Mesh网络的请求可能由于时延等原因发生阻塞导致请求超时，当接入Mesh网络的请求超时的时候，终端将再次发起接入Mesh网络的请求，基站可以通过接入Mesh网络的请求的请求序列号大小区分失效的接入Mesh网络的请求。接入Mesh网络之后终端还可以周期性地上报邻接节点的变化信息。
其中，当终端需要与另一终端进行通信时，终端可以向基站发出路由寻找请求，路由寻找请求可以包括：目的终端ID，请求序列号，QoS(Quality of Service，服务质量)参数，传输数据量大小。由于终端向基站发送的路由寻找请求可能由于时延等原因发生阻塞导致路由寻找请求超时，当路由寻找请求超时的时候，终端将再次发起路由寻找请求，基站通过路由寻找请求的请求序列号大小区分失效的路由寻找请求。
其中，所述终端接入Mesh网络后，向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息可以包括：
通过如下任一方式向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息，包括：
方式一：当检测到邻接节点的功率信息的变化符合预先设置的数值条件时，所述终端发送功率信息的变化符合预先设置的数值条件的邻接节点的身份标识及功率信息给基站；
方式二：周期性发送所述终端的每个邻接节点的身份信息及功率信息给 基站。
其中，终端接入Mesh网络后向基站上报功率信息的方式分成两种，第一种是事件触发上报，当检测到邻接节点的功率信息发生较大变化(即功率信息的变化符合预先设置的数值条件)时，进行增量上报，只上报该节点的身份标识及功率信息；第二种是周期上报，每个周期需要进行一次全量上报，即上报每个邻接节点的身份标识及功率信息。
接下来，对基站侧的流程(步骤201～202)进行说明：
其中，基站侧的流程还可以包括：
所述基站接收所述终端发送的接入Mesh网络的请求，其中所述接入Mesh网络的请求包括所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
和/或，
所述基站接收已接入Mesh网络的终端发送的所述终端的邻接节点身份标识和所述邻接节点的功率信息。
其中，所述基站接收已接入Mesh网络的终端发送的所述终端的邻接节点身份标识和所述邻接节点的功率信息的情况至少包括以下一种：
(1)基站接收所述终端接入Mesh网络后发送的更新后的邻接节点的身份标识和功率信息。
(2)在确定允许所述终端接入后，基站才接收所述终端发送的邻接节点的身份标识和功率信息，而在不允许所述终端接入时，不会收到所述终端发送的邻接节点的身份标识和功率信息；这样保证只在允许终端接入时，才能收到终端的邻接节点的身份标识和功功率信息，能保证传输的数据的有效性，减少无效数据的传输，达到充分利用带宽资源的目的。
其中，所述基站根据所获取的所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，为所述终端计算路由信息，可以包括：
所述基站根据所获取的所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，计算所述D2D的Mesh网络中每个节点间链路的权重值；
所述基站根据所述链路的权重值，为所述终端计算路由信息。
其中，所述D2D的Mesh网络中每个节点间链路的权重值可以通过如下方式得到：
Figure PCTCN2016092366-appb-000003
其中，wi,j表示D2D的Mesh网络中，终端i和终端j之间链路的权重值，α是本周期内接收到的信号功率信息占权重的大小，pcij是在本上报周期内终端i接收到终端j的信号功率信息，ppij是上一上报周期的终端i接收到终端j的信号功率信息，T为上报周期的时间长度，Δt为pcij和ppij的上报时间的时间差。
其中，由于D2D Mesh网络复用的是蜂窝的上行资源，其无线信道比较复杂，信道容量取决于带宽和信噪比。在带宽一定的情况下，信道容量取决于信道的信噪比。为了提高传输的有效性，需要选择接收功率信息大的设备充当路由。此外，设备的接收功率信息在一定程度上反映了设备之间的距离，因此在移动性敏感的D2D Mesh网络中，接收功率信息的变化可以反映出两个设备之间的相对运动。当接收功率信息变小时，两个设备是相互远离的，而且变化幅度大时，两个设备相互远离的速度快。
基于上述两个方面的考虑，提出了如下的链路权重衡量方法：
Figure PCTCN2016092366-appb-000004
上式中α是本周期内接收到的信号功率信息占权重的大小，可以通过经验值或实验确定；当α越大时，本周期内接收到的信号功率信息在权重值中所占的比重也就越大，移动性所占的比重越小；pcij是本上报周期内终端i接收到终端j的信号功率信息，ppij是上一上报周期的终端i接收到终端j的信号功率信息，T为上报周期的时间长度，Δt为上报pcij和ppij的时间间隔，
Figure PCTCN2016092366-appb-000005
表示接收功率信息变化的快慢。可以看出权值越小，终端越适合作为路由。
通过该方式基站可以计算每一条链路的权值，由于权值越小，终端越适合充当路由，因此，可以将路由问题抽象为图论的最短路问题，可以通过如 下描述：
将D2D的Mesh网络看成图G(V,E)，V代表D2D的Mesh网络中所有节点(即终端)的集合，E代表D2D的Mesh网络中所有链路的集合，若节点u和节点v，相邻且存在链路(u,v)，则(u,v)∈E。假定链路(u,v)的代价用duv来表示，Dv是节点v到达某给定目的节点的最短路由。路由问题就是通过下列公式来寻找节点到达目的节点的最短路由，即
Du＝min[duv+Dv]         (2)
它是通过寻找最佳的邻接节点，并通过该邻接节点实现到达目的节点的最短路由，这里的代价就是链路的权重值。可以通过包括但不限于迪杰斯特拉算法的最短路算法实现路由计算，最短路算法可以有很多种，这也是协议的一个可拓展性，通过根据QoS参数采用不同的最短路算法，可以使得效率更高。
在一个示例中，本发明实施例提供的方法包括如下步骤：
步骤一、终端进行设备发现，生成邻接节点列表；
步骤二、终端向基站发出接入Mesh网络的请求，所述接入Mesh网络的请求中包含所述邻接节点的身份标识和所述邻接节点的功率信息；基站向终端回复ACK，之后终端接入Mesh网络。接入后，终端还可以向基站上报功率信息变化信息。上报的方式分成两种，第一种是事件触发上报，当检测到邻接节点的功率信息发生较大变化时，进行增量上报，只上报该节点的ID及功率信息；第二种是周期上报，每个周期需要进行一次全量上报；
步骤三、终端向基站发出路由寻找请求；
步骤四、基站通过寻路算法寻找最佳路由；步骤五、基站向终端下发路由信息。
基站的计算过程如下：
基站通过步骤二中获取的邻接节点的身份标识和功率信息，可以得到网络的拓扑图，以及不同终端的接收功率信息大小，基于接收功率信息的大小可以计算出每条链路的权值。
在这里，本发明实施例提出一种新的路由衡量方法：
由于D2D Mesh网络复用的是蜂窝的上行资源，其无线信道比较复杂，信道容量取决于带宽和信噪比。在带宽一定的情况下，信道容量取决于信道的信噪比。为了提高传输的有效性，需要选择接收功率信息大的设备充当路由。此外，设备的接收功率信息在一定程度上反映了设备之间的距离，因此在移动性敏感的D2D Mesh网络中，接收功率信息的变化可以反映出两个设备之间的相对运动。当接收功率信息变小时，两个设备是相互远离的，而且变化幅度大时，两个设备相互远离的速度快。
基于上述两个方面的考虑，提出了如下的链路权重计算方式：
Figure PCTCN2016092366-appb-000006
上式中α是本周期内接收到的信号功率信息占权重的大小，可以通过经验值或实验确定；当α越大时，本周期内接收到的信号功率信息在权重值中所占的比重也就越大，移动性所占的比重越小；pcij是本上报周期内终端i接收到终端j的信号功率信息，ppij是上一上报周期的终端i接收到终端j的信号功率信息，T为上报周期的时间长度，Δt为上报pcij和ppij的时间间隔，
Figure PCTCN2016092366-appb-000007
表示接收功率信息变化的快慢。可以看出权值越小，终端越适合作为路由。
通过该方式基站可以计算每一条链路的权重值，由于权重值越小，终端越适合充当路由，因此，可以通过最短路算法实现路由计算，最短路算法可以有很多种，这也是协议的一个可拓展性，通过根据不同的QoS需求采用不同的最短路算法，可以使得效率更高。
下面结合视图和实施例的仿真情况进行描述。
参见图3，介绍本发明实施例的研究场景：在一个蜂窝网络中包含多个D2D终端，D2D终端复用蜂窝网络上行资源。在仿真场景中，表1给出了本发明实施例的实验仿真的参数设置。
表1仿真参数设置
Figure PCTCN2016092366-appb-000008
Figure PCTCN2016092366-appb-000009
参见图4，图4a和图4b为终端的初始分布图及发生了一次路由重选时的分布图。圆圈表示D2D终端。实线路径与虚线路径分别表示用DSR(Dynamic Source Routing，动态源路由协议)与本发明实施例选出来的路由。DSR路由协议在选择路由时主要考虑距离，而忽略了移动性的因素。因此选出来的路由稳定性不够好，在短时间需要再次重选路由。在此例中，经过5秒时DSR所选路由失效，而本发明实施例所选的路由一直有效。
参见图5和图6，图5为D2D终端数发生变化时，系统的频谱利用率的变化。图6为D2D终端数发生变化时，发生路由重选次数的变化。可以看出，在终端数变大时，区域内的终端数增加，密度更高，频谱利用率变大，发生路由重选的可能性也会降低。
参见图7和图8，图7为时间变化时，系统的频谱利用率变化，图8为时间变化时，发生路由重选次数的变化。可以看出，当时间变长时，点逐渐变得分散，因此频谱利用率逐渐下降而路由重选次数逐渐增大。
图9为本发明实施例提供的一种D2D的Mesh网络的路由寻找装置的结构图。图9所示装置设置于终端，包括：
第一发送模块902，设置成向基站发送路由寻找请求，发送所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
第一接收模块903，设置成接收所述基站根据所述邻接节点的身份标识和所述邻接节点的功率信息为所述终端确定的路由信息。
其中，所述装置还可以包括：
第一获取模块，设置成获取所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
所述第一发送模块还可以设置成发送所述邻接节点的身份标识和所述邻接节点的功率信息给基站。
其中，所述第一获取模块可以包括：
第一接收单元，设置成接收邻接节点发送的设备发现消息，所述设备发现消息包括所述邻接节点的身份标识和所述邻接节点的功率信息。
其中，所述第一获取模块还可以包括：
第一判断单元，设置成根据所述邻接节点的身份标识，判断所述邻接节点是否在所述终端记录的邻接节点的管理信息中；
第一处理单元，设置成如果所述邻接节点在所述终端记录的邻接节点的管理信息中，则根据设备发现消息中的所述邻接节点的功率信息，更新所述邻接节点的管理信息中所述邻接节点的功率信息；如果所述邻接节点不在所述终端记录的邻接节点的管理信息中，则在所述终端记录的邻接节点的管理信息中，保存所述设备发现消息中的所述邻接节点的身份标识以及所述邻接节点的功率信息。
其中，所述第一发送模块可以包括：
第一发送单元，设置成向基站发送接入Mesh网络的请求，所述接入Mesh网络的请求中包含所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
和/或，
第二发送单元，设置成在所述终端接入Mesh网络后，向基站发送所述终端的邻接节点的身份标识和所述邻接节点的功率信息。
其中，所述接入Mesh网络的请求和/或路由寻找请求可以包括请求序列号，其中所述接入Mesh网络的请求的请求序列号用于供基站区分所述终端接入Mesh网络的请求是否为有效请求；所述路由寻找请求的请求序列号用于供基站区分所述终端发送的路由寻找请求是否有效。
其中，所述第一发送模块在所述终端接入Mesh网络后，向基站发送所 述邻接节点的身份标识和所述邻接节点的功率信息包括：
通过如下任一方式向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息：
方式一：当检测到邻接节点的功率信息的变化符合预先设置的数值条件时，发送功率信息的变化符合预先设置的数值条件的邻接节点的身份标识及功率信息给基站；
方式二：周期性发送所述终端的每个邻接节点的身份信息及功率信息给基站。
本发明实施例提供的装置，通过邻接节点和所述邻接节点的功率信息确定路由，可以根据信道容量及终端移动性来确定路由，提升了系统容量，提高了路由的稳定性，能减少寻路开销。
图10为本发明实施例提供的另一种D2D的Mesh网络的路由寻找装置的结构图。图10所示装置包括：
计算模块1002，设置成收到终端的路由寻找请求后，根据所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，为所述终端计算路由信息；
第二发送模块1003，设置成向所述终端发送所述路由信息。
其中，所述装置还可以包括：
第二获取模块，设置成接收所述终端发送的接入Mesh网络的请求，所述接入Mesh网络的请求包括所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
和/或，设置成接收已接入Mesh网络的终端发送的所述终端的邻接节点身份标识和所述邻接节点的功率信息。
其中，所述计算模块可以包括：
第一计算单元，设置成根据所获取的所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，计算所述D2D的Mesh网络中每个节点间链路的权重值；
第二计算单元，设置成根据所述链路的权重值，为所述终端计算路由信息。
其中，所述第二计算单元可以通过如下方式计算D2D的Mesh网络中每个节点间链路的权重值：
Figure PCTCN2016092366-appb-000010
其中，wi,j表示D2D的Mesh网络中，终端i和终端j之间链路的权重值，α是本周期内接收到的信号功率信息占权重的大小，pcij是在本上报周期内终端i接收到终端j的信号功率信息，ppij是上一上报周期的终端i接收到终端j的信号功率信息，T为上报周期的时间长度，Δt为pcij和ppij的上报时间的时间差。
本发明实施例提供的装置，通过邻接节点和所述邻接节点的功率信息确定路由，可以根据信道容量及终端移动性来确定路由，提升了系统容量，提高了路由的稳定性，能减少寻路开销。
本发明实施例还提供一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行上述方法。
本领域普通技术人员可以理解上述实施例的全部或部分步骤可以使用计算机程序流程来实现，所述计算机程序可以存储于一计算机可读存储介质中，所述计算机程序在相应的硬件平台上(如系统、设备、装置、器件等)执行，在执行时，包括方法实施例的步骤之一或其组合。
可选地，上述实施例的全部或部分步骤也可以使用集成电路来实现，这些步骤可以被分别制作成一个个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本发明实施例不限制于任何特定的硬件和软件结合。
上述实施例中的装置/功能模块/功能单元可以采用通用的计算装置来实现，它们可以集中在单个的计算装置上，也可以分布在多个计算装置所组成 的网络上。
上述实施例中的装置/功能模块/功能单元以软件功能模块的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。上述提到的计算机可读取存储介质可以是只读存储器，磁盘或光盘等。
工业实用性
本发明实施例通过终端的邻接节点和所述邻接节点的功率信息为终端确定路由信息，可以根据信道容量及终端移动性来确定路由，提升了系统容量，提高了路由的稳定性，能减少寻路开销。

Claims (22)

  1. 一种设备到设备D2D的无线网格Mesh网络的路由寻找方法，包括：
    终端向基站发送路由寻找请求；
    所述终端接收所述基站根据所述终端的邻接节点的身份标识和所述邻接节点的功率信息为所述终端确定的路由信息。
  2. 根据权利要求1所述的路由寻找方法，还包括：
    所述终端获取所述终端的邻接节点的身份标识和所述邻接节点的功率信息，发送所述邻接节点的身份标识和所述邻接节点的功率信息给基站。
  3. 根据权利要求2所述的路由寻找方法，其中，所述终端获取所述终端的邻接节点的身份标识和所述邻接节点的功率信息，包括：
    终端接收邻接节点发送的设备发现消息，其中所述设备发现消息包括所述邻接节点的身份标识和所述邻接节点的功率信息。
  4. 根据权利要求3所述的路由寻找方法，其中，所述终端获取所述终端的邻接节点的身份标识和所述邻接节点的功率信息还包括：
    所述终端根据所述邻接节点的身份标识，判断所述邻接节点是否在所述终端记录的邻接节点的管理信息中；
    如果所述邻接节点在所述终端记录的邻接节点的管理信息中，则所述终端根据设备发现消息中的所述邻接节点的功率信息，更新所述邻接节点的管理信息中所述邻接节点的功率信息；如果所述邻接节点不在所述终端记录的邻接节点的管理信息中，则所述终端在所述终端记录的邻接节点的管理信息中，保存所述设备发现消息中的所述邻接节点的身份标识以及所述邻接节点的功率信息。
  5. 根据权利要求2所述的路由寻找方法，其中，所述发送所述邻接节点的身份标识和所述邻接节点的功率信息给基站，包括：
    所述终端向基站发送接入Mesh网络的请求，所述接入Mesh网络的请求中包含所述邻接节点的身份标识和所述邻接节点的功率信息；
    和/或，
    所述终端接入Mesh网络后，向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息。
  6. 根据权利要求5所述的路由寻找方法，其中，所述接入Mesh网络的请求和/或路由寻找请求包括请求序列号；所述接入Mesh网络的请求的请求序列号用于供基站区分所述终端接入Mesh网络的请求是否为有效请求；所述路由寻找请求的请求序列号用于供基站区分所述终端发送的路由寻找请求是否有效。
  7. 根据权利要求5所述的路由寻找方法，其中，所述终端接入Mesh网络后，向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息包括：
    通过如下任一方式向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息：
    方式一：当检测到邻接节点的功率信息的变化符合预先设置的数值条件时，所述终端发送功率信息的变化符合预先设置的数值条件的邻接节点的身份标识及功率信息给基站；
    方式二：周期性发送所述终端的每个邻接节点的身份信息及功率信息给基站。
  8. 一种设备到设备D2D的无线网格Mesh网络的路由寻找方法，包括：
    基站收到终端的路由寻找请求后，根据所获取的所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，为所述终端计算路由信息；
    所述基站向所述终端发送所述路由信息。
  9. 根据权利要求8所述的路由寻找方法，还包括：所述基站接收所述终端发送的接入Mesh网络的请求，所述接入Mesh网络的请求包括所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
    和/或，所述基站接收已接入Mesh网络的所述终端发送的所述终端的邻接节点身份标识和所述邻接节点的功率信息。
  10. 根据权利要求8所述的路由寻找方法，其中，所述基站根据所获取的所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，为所述终端计算路由信息，包括：
    所述基站根据所获取的所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，计算所述D2D的Mesh网络中每个节点间链路的权重值；
    所述基站根据所述链路的权重值，为所述终端计算路由信息。
  11. 根据权利要求10所述的路由寻找方法，其中，所述D2D的Mesh网络中每个节点间链路的权重值是通过如下方式得到的：
    Figure PCTCN2016092366-appb-100001
    其中，wi,j表示D2D的Mesh网络中，终端i和终端j之间链路的权重值，α是本周期内接收到的信号功率信息占权重的大小，pcij是在本上报周期内终端i接收到终端j的信号功率信息，ppij是上一上报周期的终端i接收到终端j的信号功率信息，T为上报周期的时间长度，Δt为pcij和ppij的上报时间的时间差。
  12. 一种设备到设备D2D的无线网格Mesh网络的路由寻找装置，设置于终端，包括：
    第一发送模块，设置成向基站发送路由寻找请求；
    第一接收模块，设置成接收所述基站根据所述终端的邻接节点的身份标识和所述邻接节点的功率信息为所述终端确定的路由信息。
  13. 根据权利要求12所述的路由寻找装置，还包括：
    第一获取模块，设置成获取所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
    所述第一发送模块还设置成发送所述邻接节点的身份标识和所述邻接节点的功率信息给基站。
  14. 根据权利要求13所述的路由寻找装置，其中，所述第一获取模块包括：
    第一接收单元，设置成接收邻接节点发送的设备发现消息，所述设备发现消息包括所述邻接节点的身份标识和所述邻接节点的功率信息。
  15. 根据权利要求14所述的路由寻找装置，其中，所述第一获取模块还包括：第一判断单元，设置成根据所述邻接节点的身份标识，判断所述邻接节点是否在所述终端记录的邻接节点的管理信息中；
    第一处理单元，设置成如果所述邻接节点在所述终端记录的邻接节点的管理信息中，则根据设备发现消息中的所述邻接节点的功率信息，更新所述邻接节点的管理信息中所述邻接节点的功率信息；如果所述邻接节点不在所述终端记录的邻接节点的管理信息中，则在所述终端记录的邻接节点的管理信息中，保存所述设备发现消息中的所述邻接节点的身份标识以及所述邻接节点的功率信息。
  16. 根据权利要求13所述的路由寻找装置，其中，所述第一发送模块包括：
    第一发送单元，设置成向基站发送接入Mesh网络的请求，所述接入Mesh网络的请求中包含所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
    和/或，
    第二发送单元，设置成在所述终端接入Mesh网络后，向基站发送所述终端的邻接节点的身份标识和所述邻接节点的功率信息。
  17. 根据权利要求16所述的路由寻找装置，其中，所述接入Mesh网络的请求和/或路由寻找请求包括请求序列号；所述接入Mesh网络的请求的请求序列号用于供基站区分所述终端接入Mesh网络的请求是否为有效请求；所述路由寻找请求的请求序列号用于供基站区分所述终端发送的路由寻找请求是否有效。
  18. 根据权利要求16所述的路由寻找装置，其中，所述第一发送模块在所述终端接入Mesh网络后，向基站发送所述邻接节点的身份标识和所述邻接节点的功率信息包括：
    通过如下任一方式向基站发送所述邻接节点的身份标识和所述邻接节点 的功率信息：
    方式一：当检测到邻接节点的功率信息的变化符合预先设置的数值条件时，发送功率信息的变化符合预先设置的数值条件的邻接节点的身份标识及功率信息给基站；
    方式二：周期性发送所述终端的每个邻接节点的身份信息及功率信息给基站。
  19. 一种设备到设备D2D的无线网格Mesh网络的路由寻找装置，包括：
    计算模块，设置成收到终端的路由寻找请求后，根据所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，为所述终端计算路由信息；
    第二发送模块，设置成向所述终端发送所述路由信息。
  20. 根据权利要求19所述的路由寻找装置，还包括：
    第二获取模块，设置成接收所述终端发送的接入Mesh网络的请求，所述接入Mesh网络的请求包括所述终端的邻接节点的身份标识和所述邻接节点的功率信息；
    和/或，设置成接收已接入Mesh网络的所述终端发送的所述终端的邻接节点身份标识和所述邻接节点的功率信息。
  21. 根据权利要求19所述的路由寻找装置，其中，所述计算模块包括：
    第一计算单元，设置成根据所获取的所述终端的邻接节点的身份标识以及所述邻接节点的功率信息，计算所述D2D的Mesh网络中每个节点间链路的权重值；
    第二计算单元，设置成根据所述链路的权重值，为所述终端计算路由信息。
  22. 根据权利要求21所述的路由寻找装置，其中，所述第二计算单元通过如下方式计算D2D的Mesh网络中每个节点间链路的权重值：
    Figure PCTCN2016092366-appb-100002
    其中，wi,j表示D2D的Mesh网络中，终端i和终端j之间链路的权重值， α是本周期内接收到的信号功率信息占权重的大小，pcij是在本上报周期内终端i接收到终端j的信号功率信息，ppij是上一上报周期的终端i接收到终端j的信号功率信息，T为上报周期的时间长度，Δt为pcij和ppij的上报时间的时间差。
PCT/CN2016/092366 2015-08-10 2016-07-29 设备到设备的无线网格网络的路由寻找方法和装置 WO2017024952A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP16834576.7A EP3337241A4 (en) 2015-08-10 2016-07-29 Method and apparatus for searching for route of device-to-device wireless mesh network
US15/750,680 US20180227827A1 (en) 2015-08-10 2016-07-29 Method and apparatus for searching for route of device-to-device wireless mesh network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510486079.8 2015-08-10
CN201510486079.8A CN106454988A (zh) 2015-08-10 2015-08-10 设备到设备的无线网格网络的路由寻找方法和装置

Publications (1)

Publication Number Publication Date
WO2017024952A1 true WO2017024952A1 (zh) 2017-02-16

Family

ID=57984479

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/092366 WO2017024952A1 (zh) 2015-08-10 2016-07-29 设备到设备的无线网格网络的路由寻找方法和装置

Country Status (4)

Country Link
US (1) US20180227827A1 (zh)
EP (1) EP3337241A4 (zh)
CN (1) CN106454988A (zh)
WO (1) WO2017024952A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113692727A (zh) * 2019-04-17 2021-11-23 株式会社Ntt都科摩 终端以及由终端执行的方法
CN112911199B (zh) * 2021-01-19 2023-07-07 深圳市皓丽智能科技有限公司 一种自组织会议通信方法、系统及其相关组件
CN116249077B (zh) * 2023-02-27 2023-10-20 北京云智软通信息技术有限公司 获取工作组成员通信路由状态的方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101043236A (zh) * 2006-05-10 2007-09-26 华为技术有限公司 控制网状网络节点发射功率的方法及网状网络节点
CN101895482A (zh) * 2009-05-18 2010-11-24 华为技术有限公司 对点到点技术网络的逻辑拓扑信息进行抽象的方法和装置
CN104320811A (zh) * 2014-09-18 2015-01-28 南京邮电大学 一种利用节点信息传输能力进行流量分配的路由方法
CN104394569A (zh) * 2014-11-14 2015-03-04 西安交通大学 无线d2d网络中基于角度和干扰控制建立多播路由的方法
CN104581864A (zh) * 2015-01-12 2015-04-29 西安交通大学 无线d2d网络中基于干扰感知的最小跳数的路由选择方法

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9603079B2 (en) * 2011-12-30 2017-03-21 Intel Corporation Routing for mobile nodes
US9918318B2 (en) * 2012-07-27 2018-03-13 Kyocera Corporation Mobile communication system and mobile communication method
US9930604B2 (en) * 2013-10-09 2018-03-27 Terranet Ab Path finding in a mesh network
EP2874438A1 (en) * 2013-11-18 2015-05-20 Sony Corporation Operating a user equipment in a wireless mesh radio network
CN104717714A (zh) * 2013-12-17 2015-06-17 中兴通讯股份有限公司 路由信息发送、接收的方法、装置及路由信息处理系统

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101043236A (zh) * 2006-05-10 2007-09-26 华为技术有限公司 控制网状网络节点发射功率的方法及网状网络节点
CN101043236B (zh) * 2006-05-10 2010-05-12 华为技术有限公司 控制网状网络节点发射功率的方法及网状网络节点
CN101895482A (zh) * 2009-05-18 2010-11-24 华为技术有限公司 对点到点技术网络的逻辑拓扑信息进行抽象的方法和装置
CN104320811A (zh) * 2014-09-18 2015-01-28 南京邮电大学 一种利用节点信息传输能力进行流量分配的路由方法
CN104394569A (zh) * 2014-11-14 2015-03-04 西安交通大学 无线d2d网络中基于角度和干扰控制建立多播路由的方法
CN104581864A (zh) * 2015-01-12 2015-04-29 西安交通大学 无线d2d网络中基于干扰感知的最小跳数的路由选择方法

Also Published As

Publication number Publication date
US20180227827A1 (en) 2018-08-09
CN106454988A (zh) 2017-02-22
EP3337241A1 (en) 2018-06-20
EP3337241A4 (en) 2018-08-01

Similar Documents

Publication Publication Date Title
US9854456B2 (en) Method and apparatus for managing multi-hop relay networks
TW200534647A (en) Method and arrangement in wireless ad hoc or multihop networks
KR20070007032A (ko) 이동 애드 혹 네트워크 시스템 및 운용 방법
JP2007518326A (ja) ルーティング情報の取得
US20140133353A1 (en) Communication device, method for detecting hub and transmitting packet thereof
Keshtgary et al. Performance evaluation of reactive, proactive and hybrid routing protocols in MANET
JP7389243B2 (ja) ＱｏＳマッピング
KR100845675B1 (ko) 무선 애드 혹 네트워크에서의 경로 설정 방법
KR20150082375A (ko) 무선 통신의 범위 확장을 위한 시스템들, 장치 및 방법들
Hess et al. Efficient neighbor discovery in mobile opportunistic networking using mobility awareness
EP3314951B1 (en) Enhanced peer discovery in a mesh network
CN108370610A (zh) 密集网格网络中的干扰减轻
WO2017024952A1 (zh) 设备到设备的无线网格网络的路由寻找方法和装置
KR101645978B1 (ko) 애드 혹 네트워크에서의 동적 라우팅 방법 및 그를 위한 네트워크 장치
Pirzadi et al. A novel routing method in hybrid DTN–MANET networks in the critical situations
Koneri Chandrasekaran et al. Primary path reservation using enhanced slot assignment in TDMA for session admission
KR20130077422A (ko) 서로 다른 무선 신체 영역 네트워크(ｗｂａｎ) 간의 임시 연결에 의해 통신을 수행하는 제1 허브, 제2 허브 및 그 통신 방법들
WO2012009849A1 (en) A routing scheme for wireless sensor networks
US11723101B1 (en) Mobile ad-hoc network data concurrency
KR101473868B1 (ko) 컨텐츠 중심 네트워킹 환경에서 노드들 사이의 통신 방법 및 노드
Dahlstrom et al. Performance analysis of routing protocols in Zigbee non-beacon enabled WSNs
KR101359455B1 (ko) 메시지 전송 주기 결정 방법
WO2014185768A1 (en) A method of spectrum aware routing in a mesh network and a system derived thereof
US9924400B2 (en) Enhanced power reduction in mesh networks
US9749815B2 (en) Node and a method of communicating among a plurality of nodes in content-centric networking environment

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: 16834576

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 15750680

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2016834576

Country of ref document: EP