Node grouping method, node, and access point转让专利
申请号 : US14335423
文献号 : US09622157B2
文献日 : 2017-04-11
发明人 : Tianyu Wu , Chen Chen , Lina Zhu , Changle Li
申请人 : Huawei Technologies Co., Ltd.
摘要 :
权利要求 :
What is claimed is:
说明书 :
This application is a continuation of International Patent Application No. PCT/CN2013/070746, filed on Jan. 21, 2013, which claims priority to Chinese Patent Application No. 201210017911.6, filed on Jan. 19, 2012, both of which are hereby incorporated by reference in their entireties.
The present disclosure relates to the technical field of communication, and in particular to a node grouping method, a node and an access point.
With the development of communication technology, new requirements are proposed for the wireless network technology, i.e., a new generation of Wireless Fidelity (abbreviated as Wi-Fi) network of high rate, large scale and high throughput is required. The existing standard series of the Institute of Electrical and Electronics Engineers (abbreviated as IEEE) provide three channel access functions, including a Distributed Coordination Function (abbreviated as DCF), a Point Coordination Function (abbreviated as PCF) and a Hybrid Coordination Function (abbreviated as HCF). The DCF of Carrier Sense Multiple Access with Collision Avoidance (abbreviated as CSMA/CA), which is simple and convenient to be implemented, is a basic access mechanism and is used widely. As an optional access mechanism, PCF is based on DCF and performs centralized management on data transmission via a Point Coordinator (abbreviated as PC). HCF is a combination of DCF and PCF, and is used by a node which has Quality of Service (abbreviated as QoS) requirement. Therefore, the existing 802.11 IEEE standard series are based on contention. However, in a large scale network environment, the number of nodes which contend the channels at the same time is increased rapidly, thereby resulting in severe contention failure and thus lowering the network efficiency. In addition, the problem of hidden terminals in the wireless network may be more severe in the large scale network. It is indicated by a research that, in a network with infrastructure, the probability that any two nodes within the coverage area of a central node are hidden terminals is 41%. The problem of hidden terminals may become more severe with the increase of the network scale. If a delivery rate is 99% in a network without hidden terminal, the delivery rate is reduced to 94% in a network with hidden terminals of 5%. Therefore, the problem of hidden terminals is to be solved or alleviated urgently in a large scale network.
In view of this, the conventional technology can not satisfy people's new requirement on the wireless network, especially for the large scale network. Therefore, an appropriate solution is required to solve the problems brought by the large scale network.
A method for grouping a node is provided according to embodiments of the disclosure, to solve problems such as contention conflict and low network efficiency in a large scale network, and reduce probability of hidden terminals.
In one aspect, a method for grouping a node is provided, including: receiving a grouping request sent from an Access point (AP); acquiring a Received Signal Strength Indicator (RSSI) based on the grouping request; and acquiring an Identity (ID) of a group that the node belongs to determined based on the RSSI.
In another aspect, a method for grouping a node is provided, including: sending to a node a grouping request, so that the node acquires a Received Signal Strength Indicator (RSSI) based on the grouping request; and acquiring an Identity (ID) of a group that the node belongs to determined based on the RSSI.
In another aspect, a method for grouping a node is provided, including: receiving a group joining request sent from a first node; sending a first grouping poll to each node in a first set of nodes based on the group joining request, where the first set of nodes is composed of a grouped node in nodes served by an Access point (AP); receiving a first grouping acknowledgement sent from each node in a second set of nodes, where the second set of nodes is composed of a node that monitors the group joining request in the first set of nodes; receiving a two-way neighbor node list sent from the first node, where the two-way neighbor node list includes a third set of nodes which is composed of a node corresponding to the first grouping acknowledgement monitored by the first node; and grouping the first node based on the two-way neighbor node list.
In another aspect, a method for grouping a node is provided, including: sending to an Access point (AP) a group joining request, so that the AP sends a first grouping poll to each node in a first set of nodes based on the group joining request and receives a first grouping acknowledgement sent from each node in a second set of nodes, where the first set of group is composed of a grouped node in nodes served by the AP, and the second set of nodes is composed of a node that monitors the group joining request in the first set of nodes; monitoring the first grouping acknowledgement sent from each node in the second set of nodes to the AP; and sending a two-way neighbor node list to the AP, where the two-way neighbor node list includes a third set of nodes which is composed of a node corresponding to the first grouping acknowledgement that is monitored.
In another aspect, a node is provided, including: a first receiving module, configured to receive a grouping request sent from an Access point (AP); a first acquisition module, configured to acquire a Received Signal Strength Indicator (RSSI) based on the grouping request received by the first receiving module; and a second acquisition module, configured to acquire an Identity (ID) of a group that the node belongs to determined based on the RSSI acquired by the first acquisition module.
In another aspect, an access point is provided, including: a first sending module, configured to send to a node a grouping request, so that the node acquires a Received Signal Strength Indicator (RSSI) based on the grouping request; and a first acquisition module, configured to acquire an Identity (ID) of a group that the node belongs to determined based on the RSSI.
In another aspect, an access point is provided, including: a first receiving module, configured to receive a group joining request sent from a first node; a first sending module, configured to send a first grouping poll to each node in a first set of nodes based on the group joining request received by the first receiving module, where the first set of nodes is composed of a grouped node in nodes served by the Access point (AP); a second receiving module, configured to receive the first grouping acknowledgement sent from the second set of nodes, where the second set of node is composed of a node that monitors the group joining request sent from the first sending module in the first set of nodes; a third receiving module, configured to receive a two-way neighbor node list sent from the first node, where the two-way neighbor node list includes a third set of nodes, and the third set of nodes is composed of a node corresponding to the first grouping acknowledgement monitored by the first node; and a first grouping module, configured to group the first node based on the two-way neighbor node list received by the third receiving module.
In another aspect, a node is provided, including: a first sending module, configured to send to an Access point (AP) a group joining request, so that the AP sends a first grouping poll to each node in a first set of nodes based on the group joining request and receives a first grouping acknowledgement sent from each node in a second set of nodes, where the first set of nodes is composed of a grouped node in nodes served by the AP, and the second set of nodes is composed of a node that monitors the group joining request in the first set of nodes; a first monitoring module, configured to monitor the first grouping acknowledgement sent from each node in the second set of nodes to the AP; and a second sending module, configured to send a two-way neighbor node list to the AP, where the two-way neighbor node list includes a third set of nodes which is composed of a node corresponding to the first grouping acknowledgement monitored by the first monitoring module.
Based on the foregoing technical solutions, in the node grouping method, node and access point according to the embodiments of the disclosure, by grouping the node based on RSSI, the problems such as contention conflict and low network efficiency in the large scale network may be solved, and unfair throughput caused by near-far effect may be avoided, thereby reducing the probability of hidden terminals.
In order to clearly illustrate the technical solutions of embodiments provided by the disclosure, drawings to be used in the disclosure of the embodiments or the prior art will be briefly described in the following. Obviously, the drawings described in the following are only some of embodiments of the disclosure, and those skilled in the art may obtain other drawings based on these drawings without any creative work.
The technical solutions according to the embodiments of the disclosure will be described clearly and completely in conjunction with the drawings of the embodiment of the disclosure. Obviously, the disclosed embodiments are only some but not all of embodiments of the disclosure. Other embodiments obtained by those skilled in the art without any creative work based on the embodiments of the disclosure fall within the protection scope of the disclosure.
It should be understood that, the technical solutions in the embodiments of the disclosure are applicable to various of communication systems, such as a Global System for Mobile Communications (abbreviated as GSM) system, a Code Division Multiple Access (abbreviated as CDMA) system, a Wideband Code Division Multiple Access (abbreviated as WCDMA) system, a General Packet Radio Service (abbreviated as GPRS), a Long Term Evolution (abbreviated as LTE) system, a LTE Frequency Division Duplex (abbreviated as FDD) system, a LTE Time Division Duplex (abbreviated as TDD) system and a Universal Mobile Telecommunications System (abbreviated as UMTS).
S110 may include receiving a grouping request sent from an Access Point (abbreviated as AP).
S120 may include acquiring a Received Signal Strength Indicator (abbreviated as RSSI) based on the grouping request.
S130 may include acquiring an Identity (abbreviated as ID) of a group that the node belongs to determined based on the RSSI.
After receiving the grouping request sent from the AP, the node may acquire the RSSI based on the grouping request and thus acquire the ID of the group that the node belongs to.
Therefore, in the method for grouping the node provided according to the embodiment of the disclosure, by grouping the node based on the RSSI, the problems such as contention conflict and low network efficiency in the large scale network may be solved, and unfair throughput caused by near-far effect may be avoided, thereby reducing the probability of hidden terminals.
In addition, in an embodiment of the disclosure, by grouping the node based on the RSSI, the power may be controlled based on the actual situation, an uplink-downlink scheduling transmission reference may be provided for a power-saving protocol, and collision degree may be reduced by combining a directional antenna with a Multi-User Multiple Input Multiple Output (abbreviated as MU-MIIMO) technology and system capacity may be increased.
An AP itself is a node in a WiFi network, and the AP may be regarded as a special station STA or may be a central node for managing and controlling in the network. In an embodiment of the disclosure, the node may be an AP or other nodes, which may be determined based on the actual situation, and the embodiment of the disclosure is not limited thereto.
In an embodiment of the disclosure, as shown in
S140 may include sending the RSSI to the AP.
Correspondingly, the acquiring the ID of the group that the node belongs to determined based on the RSSI in S130 may include steps 134 and 135 as follows.
S134 may include receiving a message including the ID of the group sent from the AP, where the ID of the group is determined by the AP based on the RSSI and a preset RSSI grouping range.
S135 may include acquiring the ID of the group from the message including the ID of the group.
That is, after acquiring the RSSI based on the grouping request sent from the AP, the node may sent to the AP the RSSI; and after receiving the RSSI sent from the node, the AP may determine the ID of the group that the node belongs to based on the RSSI and a preset RSSI grouping range. For example, if the RSSI belongs to the RSSI grouping range of a certain group, the group is determined as the one that the node belongs to. After determining the ID of the group that the node belongs to, the AP may send to the node a message including the ID of the group, and then the node may acquire the ID of the group that the node belongs to based on the message including the ID of the group.
In an embodiment of the disclosure, the preset RSSI grouping range is a RSSI range which can be grouped into each group. For example, the RSSI of a certain node is 2, and the preset RSSI grouping range is defined as follows: 1≦ the RSSI range of a first group <3, 3≦ the RSSI range of a second group <5, and 5≦ the RSSI range of a third group <7; the node may be grouped into the first group since the RSSI of the node is 2, which is in the RSSI range of the first group.
It may be understood that, the foregoing preset range of each group is only an example, which is not limited to the disclosure, and the specific preset range of each group may be determined according to actual situation. In an embodiment of the disclosure, as shown in
S136 may include determining the ID of the group that the node belongs to based on the RSSI and the preset RSSI grouping range.
For example, in a case that the RSSI belongs to the RSSI range of a certain group, the group may be determined as a group that the node belongs to.
The method may further include a step 160 as follows.
S160 may include sending to the AP a message including the ID of the group.
For example, the node may send to the AP the message including the ID of the group that the node belongs to within a period of time determined based on the ID of the group that the node belongs to, a Distributed Coordination Function Inter-frame Space (abbreviated as DIFS) and a minimum value of Contention Window (abbreviated as CW) CWmin. For example, the time when the AP sends the ID of the group that the node belongs to may be determined based on the following formula (1).
T=ID*DIFS+random(0,CWmin) (1)
where T is the determined sending time.
It should be understood that, the foregoing formula (1) is only an example, which is not limited to the embodiment of the disclosure, and the reporting time of the node may be determined based on other formulas. For example, supposing that the IDs of the groups are respectively 1, 2, 3, 4, 5, the node may determine the reporting time based on the following formula (2).
T(ID−4)*DIFS+random(0,CWmin) (2)
Alternatively, after the ID of the group that the node belongs to is determined, the node may send the ID of the group to the AP by carrying the ID of the group in the uplink data reported for the first time within a period of time specified by the AP in a Contention Period (abbreviated as CP).
Therefore, in the embodiment of the disclosure, signaling conflict may be reduced by decentralizing the time when the node reports the ID of the group that the node belongs to.
In an embodiment of the disclosure, the ID of the group may be sent to the AP via a MAC frame. For example, a domain for indicating the ID of the group that the node belongs to may be added into a frame head of a Medium Access Control (abbreviated as MAC) frame, and the domain may be referred to as a GID domain for convenience in an embodiment of the disclosure. For example, as shown in
In an embodiment of the disclosure, the preset RSSI grouping range may be determined by negotiation between the node and the AP in advance. For example, the RSSI grouping range may be determined by negotiation when the node and the AP are associated. Alternatively, the preset RSSI grouping range may be informed to the node by the AP before the AP sends to the node a grouping request. Alternatively, the preset RSSI grouping range may be carried in a grouping request sent from the AP to the node, where the grouping request may be indicated by a beacon frame. For example, as shown in
Therefore, the receiving a grouping request sent from an AP in S110 may include:
receiving the grouping request indicated by the beacon frame and sent from the AP, where the body of the beacon frame carries the preset RSSI grouping range.
In an embodiment of the disclosure, the preset RSSI grouping range may be set based on requirement or may be set automatically by the AP. For example, the preset RSSI grouping range may be determined based on, for example, tolerance of contention in the group, the number of nodes in the group and the RSSI value level of the group.
In an embodiment of the disclosure, the ID of the group that the node belongs to may be determined based on the RSSI and the preset RSSI grouping range in conjunction with other factors, such as location and energy information of the node. In an embodiment of the disclosure, the ID of the group that the node belongs to may be determined based on the RSSI and the preset RSSI grouping range, or the ID of the group that the node belongs to may be determined based on the RSSI of the node and the RSSIs of other groups. For example, the RSSIs of all the nodes may be acquired, and the nodes are averagely distributed to each group based on the RSSIs of all the nodes. Therefore, all solutions, as long as in which the ID of the group that the node belongs to is determined based on the RSSI, are within the protection scope of the disclosure.
The process of grouping provided according to the embodiment of the disclosure is described above, and the normal operation stage of the network after the nodes are grouped will be described in detail below.
In an embodiment of the disclosure, as shown in
S172 may include receiving, from the AP, a message of an access time period which only includes a CP, where the CP includes the access time divided for each group.
S174 may include determining the access time of the group that the node belongs to based on the access time period.
S176 may include transmitting data with the AP within the access time of the group that the node belongs to.
That is, the AP may determine the access time period after the grouping is finished. The access time period only includes the CP, and the CP includes the access time divided for each group. For example, the AP may determine the access time of each group based on the number of the nodes in each group, or the traffic of nodes in each group, or the number of nodes and the traffic of nodes in each group. After determining the access time period, the AP may send the access time period to the grouped nodes via a broadcast frame. After receiving the message including the access time period sent from the AP, the node may determine the access time of the group that the node belongs to based on the access time period, and thus the node may transmit data with the AP within the access time of the group that the node belongs to.
The access time period includes not only the CP and but also a Contention-Free Period (abbreviated as CFP), where the CFP is not used well. Therefore, in this embodiment, the access time period only includes a CP, thereby avoiding the CFP in the conventional technology, taking full use of time, and reducing the time cost.
In an embodiment of the disclosure, the CP may only include the access time divided for each group, or the CP may include not only the access time divided for each group but also an access time which is not divided for any group. The access time which is not divided for any group may be used for transmitting delay-sensitive service. For example, as shown in
Therefore, in an embodiment of the disclosure, as shown in
S182 may include determining that the data is delay-sensitive service and transmission of the data is not completed within the access time of the group that the node belongs to in a first access time period.
S184 may include transmitting the data with the AP within the access time which is not divided for any group in the first access time period.
That is, in a case that the node determines that the transmitted data is delay-sensitive service and the transmission of the data is not completed within the access time of the group that the node belongs to in the first access time period, the node may transmit the data with the AP within the access time which is not divided for any group in the first access time period.
Therefore, in an embodiment of the disclosure, the average end-to-end transmission delay of the delay-sensitive service may be reduced effectively by setting a time for transmitting the delay-sensitive service in the CP.
In an embodiment of the disclosure, as shown in
S192 may include receiving a Traffic Indication Map (abbreviated as TIM) frame sent from the AP, where the TIM frame carries information of the node which has cache downlink data at the AP in each group.
S194 may include determining that there is downlink cache data at the AP based on the TIM frame.
That is, the AP sends a TIM frame to the node based on the stored cache data about the grouped nodes. The TIM frame carries information of the node which has cache downlink data at the AP in each group. After receiving the TIM frame, the node acquires corresponding data from the AP if the node determines that it has cache downlink data at the AP based on the TIM.
For example, as shown in
Thus it can be seen that, the insufficient of partial virtual bitmap of the TIM frame can be solved by adding the domain for indicating the ID of the group that the node belongs to into the TIM frame.
Therefore, in the embodiment of the disclosure, by grouping the node based on the RSSI, the problems such as contention conflict and low network efficiency in the large scale network may be solved, and unfair throughput caused by near-far effect may be avoided, thereby reducing the probability of hidden terminals.
The method for grouping the node provided according to the embodiment of the disclosure is described from a perspective of node, and the method for grouping the node provided according to the embodiment of the disclosure may be described in the following from a perspective of AP.
S210 may include sending to a node a grouping request, so that the node acquires a RSSI based on the grouping request.
S220 may include acquiring an ID of a group that the node belongs to determined based on the RSSI.
Therefore, in an embodiment of the disclosure, by grouping the node based on the RSSI, the problems such as contention conflict and low network efficiency in the large scale network may be solved, and unfair throughput caused by near-far effect may be avoided, thereby reducing the probability of hidden terminals.
In addition, in an embodiment of the disclosure, by grouping the node based on the RSSI, the power may be controlled based on the actual situation, an uplink-downlink scheduling transmission reference may be provided for a power-saving protocol, and collision degree may be reduced by combining a directional antenna with an MU-MIIMO technology and system capacity may be increased.
In an embodiment of the disclosure, as shown in
S224 may include receiving a message including the ID of the group sent from the node, where the ID of the group is determined by the node based on the RSSI and a preset RSSI grouping range.
S228 may include acquiring the ID of the group from the message including the ID of the group.
In an embodiment of the disclosure, as shown in
S240 may include receiving the RSSI sent from the node.
Correspondingly, the acquiring the ID of the group that the node belongs to determined based on the RSSI in S220 includes a step 226 as follows.
S226 may include determining the ID of the group that the node belongs to based on the RSSI and the preset RSSI grouping range. For example, if the RSSI belongs to the RSSI grouping range of a certain group, the group is determined as the one that the node belongs to.
Correspondingly, the method further includes a step 250 as follows.
S250 may include sending to the node a message including the ID of the group.
In an embodiment of the disclosure, the preset RSSI grouping range may be determined by negotiation in advance or may be carried along with the sent grouping request. For example, the preset RSSI grouping range is carried in a beacon frame which indicates the grouping request.
Therefore, the sending the grouping request to an AP in S210 may include:
sending to the AP the grouping request indicated by a beacon frame, where the beacon frame carries the preset RSSI grouping range.
The process of grouping provided according to the embodiment of the disclosure is described above, and the normal operation stage of the network after the nodes are grouped may be described in detail below.
In an embodiment of the disclosure, the AP may send to the node an access time period which only includes a CP, where the CP includes the access time divided for each group, so that the node may transmit data with the AP within the access time of the group that the node belongs to.
Therefore, the access time period only includes the CP, thereby avoiding the CFP in the conventional technology, taking full use of time, and reducing the time cost.
In an embodiment of the disclosure, in a case that there is an idle of the sum of the DIFS and CWmin time, the AP may issue a grouping CP releasing message and re-send to the node the reset access time period, such as the CP2 shown in
Therefore, the grouping access time is reset in a case that there is an idle in the group, thereby taking full use of time and reducing the time cost.
In an embodiment of the disclosure, the CP may further include an access time which is not divided for any group, so that in a case that the node determines that the data is delay-sensitive service and transmission of the data is not completed within the access time of the group that the node belongs to in a first access time period, the node may transmit the data with the AP within the access time which is not divided for any group in the first access time period, such as the time T in CP1 shown in
In an embodiment of the disclosure, the AP may send to the node a TIM frame after determining that the grouping is completed, where the TIM frame carries information of the node which has cache downlink data at the AP in each group. For example, as shown in
Therefore, in the embodiment of the disclosure, a large number of nodes in the large scale network may be supported by setting a domain of an ID of a carrying group in the TIM frame for indicating, in conjunction with the virtual bitmap, which node in which group has cache data at the AP.
Therefore, in the embodiment of the disclosure, by grouping the node based on the RSSI, the problems such as contention conflict and low network efficiency in the large scale network may be solved, and unfair throughput caused by near-far effect may be avoided, thereby reducing the probability of hidden terminals.
Another method for grouping a node is further provided according to an embodiment of the disclosure. The method may be described in detail below in conjunction with
S310 may include receiving a group joining request sent from a first node.
S320 may include sending a first grouping poll to each node in a first set of nodes based on the group joining request, where the first set of nodes is composed of grouped nodes in nodes served by the AP.
S330 may include receiving a first grouping acknowledgement sent from each node in a second set of nodes, where the second set of nodes is composed of the node that monitors the group joining request in the first set of nodes.
S340 may include receiving a two-way neighbor node list sent from the first node, where the two-way neighbor node list includes a third set of nodes, and the third set of node is composed of the node corresponding to the first grouping acknowledgement monitored by the first node.
S350 may include grouping the first node based on the two-way neighbor node list.
The AP may send the first grouping poll to each node in the first set of nodes after receiving the group joining request sent from the first node, where the first set of nodes is composed of grouped nodes in nodes served by the AP. The second set of nodes, which is composed of the node that monitors the group joining request in the second set of nodes, sends to the AP the first grouping acknowledgement. The first node monitors the first grouping acknowledgement sent from the node in the second set of nodes and sends to the AP the two-way neighbor node list, where the two-way neighbor node list includes a third set of nodes which is composed of the node corresponding to the first grouping acknowledgement monitored by the first node. The AP groups the first node based on the two-way neighbor node list after receiving the two-way neighbor node list sent from the first node.
Therefore, in the method for grouping the node provided according to the embodiment of the disclosure, nodes in each group are neighbor nodes with each other by grouping the nodes based on the two-way neighbor node lists of the nodes, thereby reducing the probability of hidden terminals in the large scale network and solving the problems such as contention conflict and low network efficiency.
Furthermore, in an embodiment of the disclosure, the neighbor node information may be collected by monitoring the grouping acknowledgement sent from the polled node to the AP, thereby reducing the probability of hidden terminals.
In an embodiment of the disclosure, the AP may check the existing grouping after receiving the two-way neighbor node list sent from the first node, and then the first node may be grouped into such a group that all the nodes in this group are the two-way neighbor nodes of the first node; and the first node may be grouped into a group which includes the least number of nodes in a case that nodes in multiple groups all belong to the two-way neighbor node list of the first node; or the first node itself may be grouped into an independent group in a case that there is no such a group that all the nodes in this group are the two-way neighbor nodes of the first node.
In an embodiment of the disclosure, the group joining request sent from the first node may be an association request in a case that the first node is associated with the AP, or may be a group joining request for joining into a group sent after the first node is associated with the AP.
In an embodiment of the disclosure, as shown in
S362 may include sending a second grouping poll to each node in the first set of nodes, so that the second node, which may be any node in the first set of nodes, may send a second grouping acknowledgement to the AP, and the node that monitors the second grouping poll and the second grouping acknowledgement in the first set of nodes records the second node into its one-way neighbor node list.
S364 may include receiving the one-way neighbor node list sent from each node in the first set of nodes.
S366 may include grouping the first set of nodes based on the one-way neighbor node list, where the nodes in each group are neighbor nodes with each other.
That is, the AP sends the second grouping poll to each node in the first set of nodes. The second node, which may be any node in the first set of nodes, may send the second grouping acknowledgement to the AP after receiving the second grouping poll. The node that monitors the second grouping poll and the second grouping acknowledgement in the first set of nodes records the second node into its one-way neighbor node list. Each node in the first set of nodes sends the one-way neighbor list to the AP, and then the AP may group the first set of nodes after receiving the one-way neighbor node list sent from each node in the first set of nodes, where the nodes in each group are neighbor nodes with each other.
Therefore, in the embodiment of the disclosure, the time cost of grouping may be reduced by grouping multiple nodes at a time and grouping a single node independently.
In the embodiment of the disclosure, the nodes in each group are neighbor nodes with each other, i.e., each node is the two-way neighbor node of the other node, and there is no hidden terminal between any two nodes.
In an embodiment of the disclosure, the AP may group all the nodes in the first set of nodes after receiving the one-way neighbor node list sent from each node in the first set of nodes, and the process of grouping may include:
a) generating a directed graph based on the received one-way neighbor node lists of all the nodes, and drawing a directed relationship of these nodes in the graph;
b) selecting a node which has the least number of the two-way neighbor nodes from all the nodes based on the directed graph and establishing a first group;
c) selecting the node which has the least number of the two-way neighbor nodes from the rest of the nodes and checking the existing grouping; grouping the node into such a group that all nodes in the group are the two-way neighbor nodes of the node; and in a case that there have multiple groups that all nodes in these groups are the two-way neighbor nodes of the node, grouping the node into a group which has the least number of nodes in the multiple groups; and establishing a new group for the node in a case that there is no such a group that all nodes in the group are the two-way neighbor nodes of the node; and
d) performing step c until all the nodes are grouped.
It should be understood that the foregoing process of grouping is only an embodiment of the disclosure, the disclosure is not limited thereto, and the grouping may be implemented in other ways.
It should be understood that, in an embodiment of the disclosure, the first set of nodes may be grouped in other ways. For example, a node in the first set of nodes may be grouped into a group first, and then S310, S320, S330, S340 and S350 in the method 300 may be performed in sequence, i.e., each node may be grouped respectively. For another example, the second node, which may be any node in the first set of nodes, may collect information of hidden nodes and report the information of hidden nodes to the AP, and then the AP may group the nodes which have no hidden relationship into a group after receiving the information of hidden nodes reported by all the nodes, that is, the nodes in a same group are neighbor nodes with each other.
In an embodiment of the disclosure, the receiving the one-way neighbor node list sent from each node in the first set of nodes may include:
receiving the one-way neighbor node list sent from each node in the first set of nodes in an order that the second grouping poll is received.
That is, each node in the first set of nodes sends to the AP the one-way neighbor node list in an order of being polled, thereby avoiding signaling conflict caused by centralized reporting of the one-way neighbor node lists.
In an embodiment of the disclosure, the sending the first grouping poll to each node in the first set of nodes in S320 includes:
sending, to each node in the first set of nodes, a first grouping poll indicated by a Type field, a Subtype field and a More Frag field included in a control frame.
The receiving the first grouping acknowledgement sent from each node in the second set of nodes to the AP in S330 includes:
receiving the first grouping acknowledgement sent from each node in the second set of nodes to the AP and indicated by a Type field, a Subtype field and a More Frag field included in a control frame.
The sending the second grouping poll to each node in the first set of nodes in S362 includes:
sending, to each node in the first set of nodes, a second grouping poll indicated by a Type field, a Subtype field and a More Frag field included in a control frame.
The second grouping acknowledgement is indicated by a Type field, a Subtype field and a More Frag field included in a control frame.
In an embodiment of the disclosure, the first and the second grouping polls may be indicated by the control frame; and the first and the second grouping acknowledgements may also be indicated by the control frame. For ease of description, the frame configured to indicate the first or the second grouping polls may be referred to as a grouping-poll frame, and the frame configured to indicate the first or the second grouping acknowledgements may be referred to as a grouping-ACK frame. It may be understood that the naming of the grouping-poll frame and the grouping-ACK frame is only for ease of description, and the disclosure is not limited thereto.
In the conventional technology, the control frame generally includes: a Frame Control, a Duration, a RA, a TA and a FCS. The Frame Control includes a Protocol Version, a Type, a Subtype, a to Distributed System (abbreviated as to DS), a From Distributed System (abbreviated as From DS), a More Frag, a Retry, a Power Mangent (abbreviated as Pwr Mgt), a More Data, a Protected Frame and an Order, as shown in
For example, as shown in
In the same way, as shown in
It may be understood that, the values of the foregoing fields are only examples, and the disclosure is not limited thereto.
In an embodiment of the disclosure, the receiving a two-way neighbor node list sent from the first node in S340 includes:
receiving the two-way neighbor node list carried in a data frame and sent from the first node, where a Type field, a Subtype field and a More Data field in the data frame indicate that the data frame carries the two-way neighbor node list.
The receiving the one-way neighbor node list sent from each node in the first set of nodes in S364 includes:
receiving the one-way neighbor node list carried in a data frame and sent from each node in the first set of nodes, where a Type field, a Subtype field and a More Data field in the data frame indicate that the data frame carries the one-way neighbor node list.
In the conventional technology, the data frame generally includes: a Frame Control, a Duration, a RA, a TA, a body and a FCS. The Frame Control includes a Protocol Version, a Type, a Subtype, a to Distributed System (abbreviated as to DS), a From Distributed System (abbreviated as From DS), a More Frag, a Retry, a Power Mangent (abbreviated as Pwr Mgt), a More Data, a Protected Frame and an Order. The More Data field in the data frame sent from the node to the AP is rarely used, so the More Data field is reused as a “More Data/B_Nei Tab” herein, where B_Nei Tab represents the neighbor node list. For example, as shown in
It should be understood that, the values of the foregoing fields are only examples and the disclosure is not limited thereto.
In an embodiment of the disclosure, the AP may inform the node of the group that the node belongs to via a broadcast frame after determining the group that the node belongs to.
The process of grouping provided according to the embodiment of the disclosure is described above, and the normal operation stage of the network after the nodes are grouped is described in detail below.
In an embodiment of the disclosure, the method 300 may further include:
sending to the node an access time period which only includes a CP, where the CP includes the access time divided for each group, so that the node may transmit data with the AP within the access time of the group that the node belongs to.
In an embodiment of the disclosure, before sending to the node the access time period which only includes the CP, the method may further include:
determining that there is a time idle of a sum of DIFS and CWmin in a channel.
In an embodiment of the disclosure, the CP may further include an access time which is not divided for any group, so that in a case that the node determines that the data is delay-sensitive service and transmission of the data is not completed within the access time of the group that the node belongs to in a first access time period, the node may transmit the data with the AP within the access time which is not divided for any group in the first access time period.
In an embodiment of the disclosure, the method 300 may further include:
sending to the node a TIM frame, where the TIM frame carries information of the node which has cache downlink data at the AP in each group.
The normal operation stage of the network after the grouping is described by the method 300, and the details may refer to the description of the normal operation stage of the network in the method 200, and detailed description thereof is omitted herein for concision.
Therefore, in the method for grouping the node provided according to the embodiment of the disclosure, nodes in each group are neighbor nodes with each other by grouping the node based on the two-way neighbor node list of the node, thereby reducing the probability of hidden terminals in the large scale network and solving the problems such as contention conflict and low network efficiency.
The method for grouping the node provided according to the embodiment of the disclosure is described from a perspective of the AP in conjunction with
S410 may include sending to an AP a group joining request, so that the AP may send a first grouping poll to each node in a first set of nodes based on the group joining request and receive a first grouping acknowledgement sent from each node in a second set of nodes, where the first set of nodes is composed of the grouped node in nodes served by the AP, and the second set of nodes is composed of the node that monitors the group joining request in the first set of nodes.
S420 may include monitoring the first grouping acknowledgement sent from each node in the second set of nodes to the AP.
S430 may include sending a two-way neighbor node list to the AP, where the two-way neighbor node list includes a third set of nodes which is composed of the node corresponding to the first grouping acknowledgement that is monitored.
Therefore, in the method for grouping the node provided according to the embodiment of the disclosure, nodes in each group are neighbor nodes with each other by grouping the node based on the two-way neighbor node list of the node, thereby reducing the probability of hidden terminals in the large scale network and solving the problems such as contention conflict and low network efficiency.
In addition, in an embodiment of the disclosure, the neighbor node information may be collected completely by monitoring the grouping acknowledgement sent from the polled node to the AP, thereby reducing the probability of hidden terminals.
In an embodiment of the disclosure, the first grouping poll and the first grouping acknowledgement are carried in a Type field, a Subtype field and a More Data field included in the control frame.
In an embodiment of the disclosure, the sending the two-way neighbor node list to the AP in S430 includes:
sending to the AP the two-way neighbor node list carried in a data frame, where a Type field, a Subtype field and a More Data field in the data frame indicate that the data frame carries the two-way neighbor node list.
The process of grouping provided according to the embodiment of the disclosure is described above, and the normal operation stage of the network after the nodes are grouped is described in detail below.
In an embodiment of the disclosure, the method 400 may further include:
receiving a message including an access time period sent from the AP, where the access time period only includes a CP, and the CP includes the access time divided for each group;
determining the access time of the group that the node belongs to based on the access time period; and
transmitting data with the AP within the access time of the group that the node belongs to.
In an embodiment of the disclosure, the method 400 may further include:
determining that the data is delay-sensitive service and transmission of the data is not completed within the access time of the group that the node belongs to in a first access time period; and
transmitting the data with the AP within an access time which is not divided for any group in the first access time period.
In an embodiment of the disclosure, before transmitting the data with the AP within the access time of the group that the node belongs to, the method further includes:
receiving a TIM frame sent from the AP, where the TIM frame carries information of the node which has cache downlink data at the AP in each group; and
determining that there is downlink cache data at the AP based on the TIM frame.
The normal operation stage of the network is described by the method 400, the details may refer to the description of the normal operation stage of the network in the method 100, and detailed description thereof is omitted herein for concision.
Therefore, in the method for grouping the node provided according to the embodiment of the disclosure, nodes in each group are neighbor node with each other by grouping the node based on the two-way neighbor node list of the node, thereby reducing the probability of hidden terminals in the large scale network and solving the problems such as contention conflict and low network efficiency.
The method for grouping the node provided according to the embodiment of the disclosure is described above in conjunction with
a first receiving module 510, configured to receive a grouping request sent from an AP;
a first acquisition module 520, configured to acquire a RSSI based on the grouping request received by the first receiving module 510; and
a second acquisition module 530, configured to acquire an ID of a group that the node belongs to determined based on the RSSI acquired by the first acquisition module.
Therefore, for the node provided according to the embodiment of the disclosure, by grouping the node based on the RSSI, the problems such as contention conflict and low network efficiency in the large scale network may be solved, and unfair throughput caused by near-far effect may be avoided, thereby reducing the probability of hidden terminals.
Optionally, as shown in
a first sending module 540, configured to send the RSSI to the AP before the ID of the group that the node belongs to is determined based on the RSSI acquired by the first acquisition module 520.
Correspondingly, the second acquiring module 530 includes:
a first receiving unit 534, configured to receive a message including the ID of the group sent from the AP, where the ID of the group is determined by the AP based on the RSSI sent from the first sending module 540 and a preset RSSI grouping range; and
a first acquisition unit 538, configured to acquire the ID of the group from the message including the ID of the group received by the second receiving unit 534.
Optionally, the second acquisition module 530 is configured to:
determine the ID of the group that the node belongs to based on the RSSI acquired by the first acquisition module 520 and the preset RSSI grouping range.
Correspondingly, as shown in
a second sending module 550, configured to send to the AP the message including the ID of the group acquired by the second acquisition module 530.
Optionally, the first receiving module 510 is configured to:
receive the grouping request indicated by a beacon frame and sent from the AP, where the body of the beacon frame carries the preset RSSI grouping range.
Optionally, the second sending module 550 is configured to:
send to the AP the message including the ID of the group within a period of time determined based on the ID of the group, a Distributed Coordination Function Inter-frame Space (DIFS) and a minimum value of Contention Window (CW) CWmin or within a preset Contention Period (CP).
In an embodiment of the disclosure, signaling conflict may be reduced by decentralizing the time when the node reports the ID of the group that the node belongs to.
Optionally, as shown in
a third receiving module 561, configured to receive a message including an access time period sent from the AP, where the access time period only includes a CP, and the CP includes the access time divided for each group;
a first determining module 562, configured to determine the access time of the group that the node belongs to based on the access time period received by the third receiving module 561; and
a first transmitting module 563, configured to transmit data with the AP within the access time of the group that the node belongs to determined by the first determining module 562.
Therefore, in the disclosure, the access time period only includes the CP, thereby avoiding the CFP in the conventional technology, taking full use of time, and reducing the time cost.
Optionally, as shown in
a second determining module 564, configured to determine that the data transmitted by the first transmitting module 563 is delay-sensitive service, and transmission of the data is not completed within the access time of the group that the node belongs to in a first access time period; and
a second transmitting module 565, configured to transmit the data with the AP within the access time which is not divided for any group in the first access time period.
Therefore, in an embodiment of the disclosure, the average end-to-end transmission delay of the delay-sensitive service may be reduced effectively by setting a time for transmitting delay-sensitive service in the CP.
Optionally, as shown in
a fourth receiving module 566, configured to receive a TIM frame sent from the AP before the data is transmitted to the AP within the access time of the group that the node belongs to, where the TIM frame carries information of the node which has cache downlink data at the AP in each group; and
a third determining module 567, configured to determine that there is downlink cache data at the AP based on the TIM frame received by the fourth receiving module 566.
The node 500 provided according to the embodiment of the disclosure may correspond to the node in the method 100 for grouping the node provided according to the embodiment of the disclosure, and the foregoing and other operations and/or functions of modules in the node 500 can realize the corresponding processes in the method 100 shown in
Therefore, for the node provided according to the embodiment of the disclosure, by grouping the nodes based on the RSSI, the problems such as contention conflict and low network efficiency in the large scale network may be solved, and unfair throughput caused by near-far effect may be avoided, thereby reducing the probability of hidden terminals.
The node 500 provided according to the embodiment of the disclosure is described above in conjunction with
a first sending module 610, configured to send to a node a grouping request, so that the node acquires a Received Signal Strength Indicator (RSSI) based on the grouping request; and
a first acquisition module 620, configured to acquire an ID of a group that the node belongs to determined based on the RSSI.
Therefore, for the access point provided according to the embodiment of the disclosure, by grouping the nodes based on the RSSI, the problems such as contention conflict and low network efficiency in the large scale network may be solved, and unfair throughput caused by near-far effect may be avoided, thereby reducing the probability of hidden terminals.
Optionally, as shown in
a first receiving unit 624, configured to receive a message including the ID of the group sent from the node, where the ID of the group is determined by the node based on the RSSI and a preset RSSI grouping range; and
a first acquisition unit 628, configured to acquire the ID of the group from the message including the ID of the group received by the first receiving unit 624.
Optionally, as shown in
a first receiving module 644, configured to receive the RSSI sent from the node before the ID of the group that the node belongs to determined based on the RSSI is acquired by the first acquisition module.
Correspondingly, the first acquisition module 620 is configured to:
determine the ID of the group that the node belongs to based on the RSSI received by the second receiving module 644 and the preset RSSI grouping range.
Correspondingly, as shown in
a second sending module 648, configured to send to the node a message including the ID of the group acquired by the first acquisition module 620.
Optionally, the first sending module 610 is configured to:
send to the node a grouping request indicated by a beacon frame, where the beacon frame carries the preset RSSI grouping range.
Optionally, as shown in
a third sending module 652, configured to send to the node an access time period which only includes a CP, where the CP include the access time divided for each group, so that the node may transmit data with the AP within the access time of the group that the node belongs to.
Therefore, in the disclosure, the access time period only includes the CP, thereby avoiding the CFP in the conventional technology, taking full use of time, and reducing the time cost.
Optionally, as shown in
a first determining module 654, configured to determine there is a time idle of a sum of Distributed Coordination Function Inter-frame Space (DIFS) and a minimum value of Contention Window (CW) CWmin in a channel before the access time period which only includes the CP is sent from the third sending module 652 to the node.
Therefore, the grouping access time may be reset in a case that there is an idle in the group, thereby taking full use of time and reducing the time cost.
Optionally, the CP may further include an access time which is not divided for any group, so that in a case that the node determines that the data is delay-sensitive service and the transmission of the data is not completed within the access time of the group that the node belongs to in a first access time period, the node may transmit the data with the AP within the access time which is not divided for any group in the first access time period.
Therefore, in an embodiment of the disclosure, the average end-to-end transmission delay of the delay-sensitive service may be reduced effectively by setting a time for transmitting the delay-sensitive service in the CP.
Optionally, as shown in
a fourth sending module 656, configured to send to the node a Traffic Indication Map (TIM) frame, where the TIM frame carries information of the node which has cache downlink data at the AP in each group.
The AP 600 provided according to the embodiment of the disclosure may correspond to the AP in the method 200 for grouping the node provided according to the embodiment of the disclosure, and the foregoing and other operations and/or functions of modules in the AP 600 can realize the corresponding processes in the method 200 shown in
Therefore, for the AP provided according to the embodiment of the disclosure, by grouping the nodes based on the RSSI, the problems such as contention conflict and low network efficiency in the large scale network may be solved, and unfair throughput caused by near-far effect may be avoided, thereby reducing the probability of hidden terminals.
An AP 700 provided according to an embodiment of the disclosure is described below in conjunction with
a first receiving module 710, configured to receive a group joining request sent from a first node;
a first sending module 720, configured to send a first grouping poll to each node in a first set of nodes based on the group joining request received by the first receiving module 710, where the first set of nodes is composed of grouped nodes in nodes served by the AP;
a second receiving module 730, configured to receive a first grouping acknowledgement sent from each node in a second set of nodes, where the second set of nodes is composed of the node that monitors the group joining request sent from the first sending module 720 in the first set of nodes;
a third receiving module 740, configured to receive a two-way neighbor node list sent from the first node, where the two-way neighbor node list includes information of a third set of nodes which is composed of the node corresponding to the first grouping acknowledgement monitored by the first node; and
a first grouping module 750, configured to group the first node based on the two-way neighbor node list received by the third receiving module 740.
Therefore, in the method for grouping the node provided according to the embodiment of the disclosure, nodes in each group are neighbor nodes with each other by grouping the node based on the two-way neighbor node list of the node, thereby reducing the probability of hidden terminals in the large scale network and solving the problems such as contention conflict and low network efficiency.
Optionally, as shown in
a second sending module 762, configured to send a second grouping poll to each node in the first set of nodes before the group joining request sent from the first node is received by the first receiving node 710, so that the second node, which may be any node in the first set of nodes, may send a second grouping acknowledgement to the AP, and the node that monitors the second grouping poll and the second grouping acknowledgement in the first set of nodes may record information of the second node into its one-way neighbor node list;
a fourth receiving module 764, configured to receive the one-way neighbor node list sent from each node in the first set of nodes; and
a second grouping module 766, configured to group the first set of nodes based on the one-way neighbor node list received by the fourth receiving module 764, where the nodes in each group are neighbor nodes with each other.
Therefore, in the embodiment of the disclosure, the time cost of grouping may be reduced by grouping multiple nodes at a time and grouping a single node independently.
Optionally, the fourth receiving unit 764 is configured to:
receive the one-way neighbor node list which is sent from each node in the first set of nodes in an order that the second grouping poll sent from the second sending module 762 is received.
Optionally, the first sending module 720 is configured to:
send to each node in the first set of nodes, the first grouping poll indicated by a Type field, a Subtype field and a More Frag file included in a control frame.
The second receiving module 730 is configured to:
receive the first grouping acknowledgement sent from each node in the second set of nodes to the AP and indicated by the Type field, the Subtype field and the More Frag field included in the control frame.
The third receiving module 740 is configured to:
receive the two-way neighbor node list carried in the data frame and sent from the first node, where the Type field, the Subtype field and the More Data field in the data frame indicate that the data frame carries the two-way neighbor node list.
Optionally, the second sending module 762 is configured to:
send, to each node in the first set of nodes, the second grouping poll indicated by a Type field, a Subtype field and a More Frag field included in a control frame.
The second grouping acknowledgement is indicated by a Type field, a Subtype field and a More Frag field included in a control frame.
The fourth receiving module 764 is configured to:
receive the one-way neighbor node list carried in the data frame and sent from each node in the first set of nodes, where the Type field, the Subtype field and the More Data field in the data frame indicate that the data frame carries the one-way neighbor node list.
Optionally, as shown in
a third sending module 772, configured to send to the node an access time period which only includes a CP, where the CP includes the access time divided for each group, so that the node may transmit data with the AP within the access time of the group that the node belongs to.
Therefore, in the disclosure, the access time period only includes the CP, thereby avoiding the CFP in the conventional technology, taking full use of time, and reducing the time cost.
Optionally, as shown in
a first determining module 774, configured to determine a time idle of a sum of Distributed Coordination Function Inter-frame Space (DIFS) and a minimum value of Contention Window (CWmin) in a channel before the access time period which only includes the CP is sent from the third sending module 772 to the node.
Therefore, the grouping access time may be reset in a case that there is an idle in the group, thereby taking full use of time and reducing the time cost.
Optionally, the CP may further include an access time which is not divided for any group, so that in a case that the node determines that the data is delay-sensitive service and the transmission of the data is not completed within the access time of the group that the node belongs to in a first access time period, the node may transmit data with the AP within the access time which is not divided for any group in the first access time period.
Therefore, in the embodiment of the disclosure, the average end-to-end transmission delay of the delay-sensitive service may be reduced effectively by setting a time for transmitting the delay-sensitive service in the CP.
Optionally, as shown in
a fourth sending module 774, configured to send to the node a Traffic Indication Map (TIM) frame, where the TIM frame carries information of the node which has cache downlink data at the AP in each group.
The AP 700 provided according to the embodiment of the disclosure may correspond to the AP in the method 300 for grouping the node provided according to the embodiment of the disclosure, and the foregoing and other operations and/or functions of modules in the AP 700 can realize the corresponding processes in the method 300 shown in
Therefore, in the method for grouping the node provided according to the embodiment of the disclosure, nodes in each group are neighbor nodes with each other by grouping the node based on the two-way neighbor node list of the node, thereby reducing the probability of hidden terminals in the large scale network and solving the problems such as contention conflict and low network efficiency.
a first sending module 810, configured to send to an AP a group joining request, so that the AP may send a first grouping poll to each node in a first set of nodes based on the group joining request and receive a first grouping acknowledgement sent from each node in a second set of nodes, where the first set of nodes is composed of grouped nodes in nodes served by the AP, and the second set of nodes is composed of the node that monitors the group joining request in the first set of nodes;
a first monitoring module 820, configured to monitor the first grouping acknowledgement sent from each node in the second set of nodes to the AP; and
a second sending module 830, configured to send a two-way neighbor node list to the AP, where the two-way neighbor node list includes a third set of nodes which is composed of a node corresponding to the first grouping acknowledgement monitored by the first monitoring module 820.
Therefore, in the method for grouping the node provided according to the embodiment of the disclosure, nodes in each group are neighbor nodes with each other by grouping the node based on the two-way neighbor node list of the node, thereby reducing the probability of hidden terminals in the large scale network and solving the problems such as contention conflict and low network efficiency.
Optionally, the first grouping poll and the first grouping acknowledgement are indicated by the Type field, the Subtype field and the More Data field included in the control frame.
The second sending module 830 is configured to:
send to the AP the two-way neighbor node list carried in the data frame, where the Type field, the Subtype field and the More Data field in the data frame indicate that the data frame carries the two-way neighbor node list.
Optionally, as shown in
a third receiving module 831, configured to receive a message including an access time period sent from the AP, where the access time period only includes a CP, and the CP includes the access time divided for each group;
a first determining module 832, configured to determine the access time of the group that the node belongs to based on the access time period received by the third receiving module 562; and
a first transmitting module 833, configured to transmit data with the AP within the access time of the group that the node belongs to determined by the first determining module 564.
Therefore, in the disclosure, the access time period only includes the CP, thereby avoiding the CFP in the conventional technology, taking full use of time, and reducing the time cost.
Optionally, as shown in
a second determining module 834, configured to determine that the data transmitted by the first transmitting module 833 is delay-sensitive service and transmission of the data is not completed within the access time of the group that the node belongs to in a first access time period; and
a second transmitting module 835, configured to transmit data to the AP within the access time which is not divided for any group in the first access time period.
Therefore, in the embodiment of the disclosure, the average end-to-end transmission delay of the delay-sensitive service may be reduced effectively by setting a time for transmitting the delay-sensitive service in the CP.
Optionally, as shown in
a fourth receiving module 836, configured to receive a Traffic Indication Map (TIM) frame sent from the AP before the data is transmitted to the AP within the access time of the group that the node belongs to, where the TIM frame carries information of the node which has cache downlink data at the AP in each group; and
a third determining module 837, configured to determine that there is downlink cache data at the AP based on the TIM frame received by the fourth receiving module 836.
The node 800 provided according to the embodiment of the disclosure may correspond to the node in the method 400 for grouping the node provided according to the embodiment of the disclosure, and the foregoing and other operations and/or functions of modules in the node 800 can realize the corresponding processes in the method 400 shown in
Therefore, in the method for grouping the node provided according to the embodiment of the disclosure, nodes in each group are neighbor nodes with each other by grouping the node based on the two-way neighbor node list of the node, thereby reducing the probability of hidden terminals in the large scale network and solving the problems such as contention conflict and low network efficiency.
It may be understood by those skilled in the art that, the units and algorithm steps disclosed in the embodiment of the disclosure may be realized by electronic hardware or integration of computer software and electronic hardware. Whether the functions are implemented by electronic hardware or by integration of computer software and electronic hardware is determined based on the specific application and the design constrains of the technical solution. Those skilled in the art may adopt different ways to realize the described functions for each specific application, and the implementation is within the protection scope of the disclosure.
It may be understood by those skilled in the art that, the working process of the foregoing system, apparatus and unit may refer to the corresponding process described in the foregoing method embodiments, and detailed description thereof is omitted herein.
It may be understood that, the disclosed system, apparatus and method provided in the embodiments of the application may be realized in other ways. For example, the apparatus set forth is only an illustrative example. For example, the division of units is only a logical function division, and there may be other divisions in implementation. For example, multiple units or components may be combined or integrated into another system, and certain features may be omitted or not be implemented. In addition, a coupling or a direct coupling or a communication connection described may be an indirect coupling or communication connection via a certain interface, apparatus or unit, which may be an electronic or a mechanical coupling or communication connection, for example.
The units which are described as separated components may be or not be separated physically, and components which are illustrated as units may be or not be physical units, i.e., may be located in a certain position or be distributed in multiple network units. Part or all of the units may be adopted to realize the purpose of the embodiment according to actual needs.
In addition, the functional units in the embodiments of the disclosure may be integrated into a processing unit or may be independent from each other, and two or more units may be integrated into one unit.
The functions may be stored in a computer-readable storage medium in a case that the functions are realized via a software function unit and are sold and used as an independent product. In view of this, the essential technical solution of the disclosure or the part of the disclosure which contributes to the prior art or part of the technical solution may be implemented by a software product. The computer software product may be stored in a storage medium and includes several instructions, to enable a computer device (for example, a personal computer, a server or a network device) to implement all or part of steps of the method provided according to each embodiment of the disclosure. The foregoing storage medium includes medium which can store program codes, such as a USB flash disk, a mobile hard disk drive, a Read-Only Memory (ROM), a Random Access Memory (RAM), a diskette or an optical disk.
The above are only embodiments of the invention, and the protection scope of the invention is not limited thereto. Modifications and substitutions which can be made by those skilled in the art without any creative work within the technical scope of the disclosure all belong to the protection scope of the invention. Therefore, the protection scope of the invention is interpreted by the claims.