CN101262625B - A method for reducing signaling consumption based on multi-source relay wireless network - Google Patents
A method for reducing signaling consumption based on multi-source relay wireless network Download PDFInfo
- Publication number
- CN101262625B CN101262625B CN2008100363512A CN200810036351A CN101262625B CN 101262625 B CN101262625 B CN 101262625B CN 2008100363512 A CN2008100363512 A CN 2008100363512A CN 200810036351 A CN200810036351 A CN 200810036351A CN 101262625 B CN101262625 B CN 101262625B
- Authority
- CN
- China
- Prior art keywords
- node
- source node
- source
- information
- destination
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method for reducing signaling overhead based on a multi-source relay wireless network. The method comprises the steps that a source node broadcasts the identity information and the service quality of the source node, a relay node and a target node receive information coming from the source node; the target node judges Ns source nodes requiring the relay node to provide service according to the information coming from the source node received in step A and broadcasts the identity information of the Ns source nodes; each relay node which can provide service correspondingly transmits the index of the source node, to which the relay node can provide the service and the signal channel quality indicator according to the order of the identity information of the source node broadcasted by the target node in step B; the target node selects paths for the source node according to the information sent by the source node and the relay node. The method is applied to the communication link selection of the source node and the target node of the next generation wireless mobile communication which is based on the relay technology, thus effectively reducing the signaling overhead during the selection of the communication links.
Description
Technical field
The invention belongs to communication information technical field, relate to a kind of communication means of wireless network, relate in particular to a kind of method of the minimizing signaling consumption based on the multi-source trunked radio network.
Background technology
In the next generation wireless communication system, for the transmission rate higher than existing wireless communications system is provided, improve the possibility of Cell Edge User access network, multi-hop wireless network based on relaying is considered to a kind of feasible solution, and attracted a large amount of academias and the concern of industrial quarters in the recent period, how tame normal structure has been arranged at the standardization effort of being devoted to based on the relaying scene.
In the multi-hop wireless network scene of multi-source relaying, destination node (DN) need be according to the link condition of source node (SN) and via node (RN), the link condition of via node (RN) and destination node (DN), the direct link situation of source node (RN) and destination node (DN) decides source node (SN) whether to need relay services, the words of relay services if desired, then determining source node (SN) by which via node (RN) is served, therefore, the Signalling exchange expense is huger, this patent proposes a kind of advanced person's Signalling exchange scheme at this shortcoming, compare with traditional scheme, signaling consumption has had very big minimizing.
In the trunked radio network of traditional centralized control, some source nodes (SN) are poor with the direct link situation of destination node (DN), can not communicate with destination node (DN) reliably, so need suitable via node (RN) that relay services is provided, help source node (SN) to set up and communicate by letter with destination node (DN).But destination node (DN) need be known the link condition between source node (SN) and the via node (RN) and select suitable via node (RN) to be source node (SN) service.Concrete steps are as follows:
The first step: source node (SN) is broadcasted their identification information (SN ID), service quality (QoS).Via node (RN) and destination node (DN) receive the information from source node (SN) simultaneously.
Second step: after can providing the via node (RN) of service to receive information from source node (SN), help their transmission channel quality designators (CQI) and service quality (QoS) to arrive destination node (DN), the signaling transformat can be as shown in Figure 1.
The 3rd step: the information that destination node (DN) is sent out according to via node (RN) and source node (SN) is the suitable communication link (source node is communicated by letter with destination node by via node with destination node direct communication or source node) of source node (SN) selection.
In traditional scheme, if a plurality of via nodes provide service can for same source node, second step, the identification information of this source node (SN ID) can be passed to destination node by a plurality of via nodes, has so just caused the signaling consumption that there is no need so.
Summary of the invention
Technical problem to be solved by this invention is: a kind of wireless network communication method that can effectively reduce at the signaling consumption of communication link selection course is provided.
For solving the problems of the technologies described above, the present invention adopts following technical scheme:
A kind of method of the minimizing signaling consumption based on the multi-source trunked radio network comprises some source nodes, some via nodes, at least one destination node in this wireless network; This method comprises the steps:
Identification information, the service quality of steps A, described source node broadcast source node, via node and destination node receive the information from source node;
Step B, destination node come from the information that source node sends according to receiving in the steps A, and judging needs via node that Ns source node of service is provided, and broadcast the identification information of this Ns source node;
Step C, service can be provided each via node based on the order of the source node identification information of destination node broadcasting among the step B, help can use the source node transmission information of relay services to destination node;
The information that step D, destination node send according to source node and via node is for source node carries out Path selection.
As a preferred embodiment of the present invention, among the described step D, the path comprises: source node is communicated by letter with destination node by via node with destination node direct communication or source node.Described source node comprises source node that needs relay services and the source node that does not need relay services.
As a preferred embodiment of the present invention, among the described step C, each via node is based on the order of the source node identification information of destination node broadcasting among the step B, and transmission accordingly can be used the CQI of the source node of relay services.Described each via node will take M * N
SThe resource of bit; Wherein, M is the size of CQI, and unit is a bit.
As a preferred embodiment of the present invention, among the described step C, each via node is based on the order of the identification information of the source node of destination node broadcasting among the step B, transmission reflection accordingly can be used the index and the corresponding CQI of L source node of relay services, and wherein L is the maximum source node number that via node can be served.In the described method, can be used to refer to source node with the indication information of 1 bit be served by this via node, indication information is 0,1 code, and wherein the corresponding source node of " 1 " expression can be served by this via node, and the corresponding source node of " 0 " expression can not be served by this via node; Each via node needs (N
SThe bit of+M * L) transmits the CQI of the source node that source node index information and it can serve.
As a preferred embodiment of the present invention, described source node index information is compressed to compressed index.Described each via node needs (M * L+N
C) bit transmits the CQI of source node compressed index information and its source node that can serve, wherein
It is bit map; That is: need from Ns source node, select the possibility of the source node that L can serve, represent with the Nc bit.
Beneficial effect of the present invention is: the present invention is applied to select based on the communication link of source node in the wireless mobile communications of future generation of relaying technique and destination node, has effectively reduced the signaling consumption in the communication link selection course.
Description of drawings
Fig. 1 is the signaling transformat of via node in the traditional scheme.
Fig. 2 is the flow chart of communication means of the present invention.
Fig. 3 is the signaling transformat of destination node broadcast message.
Fig. 4 is the signaling transformat of the via node in the form 1.
Fig. 5 is the signaling transformat of the via node in the form 2.
Fig. 6 is the signaling transformat of the via node in the form 3.
Fig. 7 is the comparison diagram of total signaling consumption.
Fig. 8 is the comparison diagram of up signaling consumption.
Embodiment
Describe the preferred embodiments of the present invention in detail below in conjunction with accompanying drawing.
Embodiment one
See also Fig. 2, the present invention has disclosed a kind of method of the minimizing signaling consumption based on the multi-source trunked radio network.The present invention is based on traditional double bounce (two-hop) relay system model, comprise Ns source node (SN) that needs relay services, a destination node (DN), and N
RIndividual via node (RN) supposes that in same sub-district destination node (DN) can receive all signaling informations from source node (SN).In the present embodiment, suppose that each via node can serve L source node at most.This method comprises the steps:
Steps A: source node is broadcasted (comprising the source node that needs relay services) their identification information (SN ID), service quality (QoS).Via node (RN) and destination node (DN) receive the information from source node (SN) simultaneously.
Step B: destination node (DN) comes from the information that source node (SN) sends according to receiving in the first step, and judging has Ns source node (SN) to need via node (RN) that service is provided, and broadcasting N
SThe individual identification information (SNID) that needs the source node (SN) of relay services, the signaling transformat can be as shown in Figure 3.
Step C: the via node (RN) of service can be provided, and based on the order of the source node identification information (SN ID) of destination node (DN) broadcasting among the step B, help can use the source node transmission information of relay services to destination node.
Step D: the information that destination node (DN) is sent according to source node (SN) and via node (RN), for source node carries out Path selection (source node is communicated by letter with destination node by via node with destination node direct communication or source node).
In step C, source node (SN) the transmission information that via node (RN) helps to use relay services has following three kinds of forms to the mode of destination node (DN):
Form 1:
Each via node (RN) is based on the order of source node (SN) identification information (SN ID) of destination node (DN) broadcasting among the step B, and transmission accordingly can be used the CQI (CQI) of the source node (SN) of relay services.The signaling transformat can be as shown in Figure 4.
If the size of CQI (CQI) is the M bit, each via node (RN) will take M * N
SThe resource of bit is used for transmitting N
SThe quality indicator of individual source node (CQI).
Form 2:
Each via node (RN) is based on the order of the identification information (SN ID) of the source node (SN) of destination node (DN) broadcasting among the step B, and transmission reflection accordingly can be used the index (IND) and the corresponding CQI (CQI) of L source node of relay services; The signaling transformat can comprise the CQI information 22 of the source node of index 21, a L service as shown in Figure 5.
Can be used to refer to source node (SN) with the indication information (IND) of 1 bit be served by this via node, and indication information is 0,1 code, and wherein, the corresponding source node (SN) of " 1 " expression can be served by this via node (RN).The corresponding source node (SN) of " 0 " expression can not be served by this via node (RN).Therefore each via node (RN) needs (N
SThe bit of+M * L) transmits the CQI (CQI) of the source node (SN) that source node index information and it can serve.
Form 3:
The index of the source node of the present invention in can compressed format 2, the signaling transformat can comprise the CQI information 32 of the source node of compressed index 31, a L service as shown in Figure 6.
Contraction principle: each via node needs (M * L+N
C) bit transmits the CQI (CQI) of the source node that source node index information and it can serve, wherein
Be bit map, that is to say, need be from N
SSelect the possibility of L the source node that can serve in the individual source node, use N
CBit is represented.The detailed contraction principle of describing form 3 in " Unified uplink CQI signalingby efficient labeling " (source " Huawei, R1-061246,3GPP TSG RAN WG1; Shanghai; China, May8th-12th, 2006 ") literary composition.
The present invention is applied to select based on the communication link of source node in the wireless mobile communications of future generation of relaying technique and destination node, has effectively reduced the signaling consumption in the communication link selection course.
Embodiment two
See also table 1, the concrete parameter of signaling transformat of the present invention is as shown in table 1, comprises source node identification information ID
SN, need the number N s of the source node of relay services, the number N of via node
R, source node feedback the big or small M, the maximum source node that via node can be served of CQI value count L, bit map Nc.
The setting of table 1 parameter
Below by traditional scheme and the present invention are compared, superiority of the present invention is described.In table 2, the communication means of traditional scheme is summarized with the communication means that adopts above-mentioned three kinds of forms of the present invention, and represents with corresponding formulas.
The formula of table 2 signaling consumption calculates
See also table 3, table 4, wherein, in the communication means that table 3 has been introduced traditional scheme and the communication means that adopts above-mentioned three kinds of forms of the present invention total signaling consumption relatively, the up signaling consumption that table 4 item has been introduced above-mentioned four schemes is relatively.Fig. 7 and Fig. 8 show the comparative result of each scheme in table 3 and the table 4 respectively with mode more intuitively.Fig. 7 is the comparison diagram of total signaling consumption, and Fig. 8 is the comparison diagram of up signaling consumption, the up transmission direction that is meant from the source node to the destination node.
| L | CQI | Traditional scheme | The solution of the present invention (bit) |
The total signaling consumption of table 3 compares
The up signaling consumption of table 4 relatively
Above embodiment is the unrestricted technical scheme of the present invention in order to explanation only.Any modification or partial replacement that does not break away from spirit and scope of the invention all should be encompassed in the middle of the claim scope of the present invention.
Claims (9)
1. the method based on the minimizing signaling consumption of multi-source trunked radio network comprises some source nodes, at least one via node, a destination node in this wireless network; It is characterized in that this method comprises the steps:
Identification information, the service quality of steps A, described source node broadcast source node, via node and destination node receive the information from source node;
Step B, destination node come from the information that source node sends according to receiving in the steps A, and judging needs via node that Ns source node of service is provided, and broadcast the identification information of this Ns source node;
Step C, service available each via node are based on the order of the source node identification information of destination node broadcasting among the step B, and help can use the source node transmission information of relay services to destination node;
The information that step D, destination node send according to source node and via node is for source node carries out Path selection.
2. method according to claim 1 is characterized in that: among the described step D, the path comprises: source node is communicated by letter with destination node by via node with destination node direct communication or source node.
3. method according to claim 1 is characterized in that: described source node comprises source node that needs relay services and the source node that does not need relay services.
4. according to claim 1 or 2 or 3 described methods, it is characterized in that: among the described step C, each via node is based on the order of the source node identification information of destination node broadcasting among the step B, and transmission accordingly can be used the CQI of the source node of relay services;
Described each via node will take M * N
sThe resource of bit; Wherein, M is the size of CQI, and unit is a bit.
5. according to claim 1 or 2 or 3 described methods, it is characterized in that: among the described step C, each via node is based on the order of the identification information of the source node of destination node broadcasting among the step B, transmission reflection accordingly can be used the index and the corresponding CQI of L source node of relay services, and wherein L is the maximum source node number that via node can be served.
6. method according to claim 5, it is characterized in that: in the described method, can be used to refer to source node with the indication information of 1 bit be served by this via node, indication information is 0,1 code, wherein the corresponding source node of " 1 " expression can be served by this via node, and the corresponding source node of " 0 " expression can not be served by this via node; Each via node needs (N
sThe bit of+M * L) transmits the CQI of the source node that source node index information and it can serve.
7. method according to claim 6 is characterized in that: described source node index information is compressed to compressed index.
8. method according to claim 7 is characterized in that: described each via node needs (M * L+N
c) bit transmits source node compressed index information and the CQI of the source node that can serve, wherein
Be bit map; That is: need from Ns source node, select the possibility of the source node that L can serve, use N
cBit is represented.
9. according to claim 1 or 2 or 3 described methods, it is characterized in that: described via node is a plurality of.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100363512A CN101262625B (en) | 2008-04-21 | 2008-04-21 | A method for reducing signaling consumption based on multi-source relay wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100363512A CN101262625B (en) | 2008-04-21 | 2008-04-21 | A method for reducing signaling consumption based on multi-source relay wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101262625A CN101262625A (en) | 2008-09-10 |
| CN101262625B true CN101262625B (en) | 2011-01-12 |
Family
ID=39962781
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100363512A Expired - Fee Related CN101262625B (en) | 2008-04-21 | 2008-04-21 | A method for reducing signaling consumption based on multi-source relay wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101262625B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116762421A (en) * | 2021-02-13 | 2023-09-15 | 上海朗帛通信技术有限公司 | Method and apparatus for use in relay wireless communication |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1442961A (en) * | 2002-03-01 | 2003-09-17 | 株式会社Ntt都科摩 | Multi jump connection radio communication system and source station, srunk station, destination station and control signal |
| CN1471776A (en) * | 2000-10-27 | 2004-01-28 | ����ɭ�绰�ɷ�����˾ | Method for forwarding in multihop networks |
| EP1804441A1 (en) * | 2006-01-03 | 2007-07-04 | Samsung Electronics Co., Ltd. | Method and apparatus for managing connection identifiers in a multi-hop relay wireless access communication system |
-
2008
- 2008-04-21 CN CN2008100363512A patent/CN101262625B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1471776A (en) * | 2000-10-27 | 2004-01-28 | ����ɭ�绰�ɷ�����˾ | Method for forwarding in multihop networks |
| CN1442961A (en) * | 2002-03-01 | 2003-09-17 | 株式会社Ntt都科摩 | Multi jump connection radio communication system and source station, srunk station, destination station and control signal |
| EP1804441A1 (en) * | 2006-01-03 | 2007-07-04 | Samsung Electronics Co., Ltd. | Method and apparatus for managing connection identifiers in a multi-hop relay wireless access communication system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101262625A (en) | 2008-09-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102340829B (en) | Data sharing method in D2D bunch under cellular environment | |
| KR101413518B1 (en) | Multi-hop wireless communication system and relay method and relay station therein | |
| US7929477B2 (en) | Method, apparatus and system for data transmission in radio communication network | |
| CA2542168C (en) | Method for direct link in wireless communication system | |
| EP3493630A1 (en) | Method, system and device for distributing resource of base station node | |
| CN102655677A (en) | Mobile communication system and far-end radio frequency unit clustering method thereof | |
| CN101753274B (en) | Resource scheduling method, system and equipment in time division duplex high speed downlink packet access (TDD HSDPA) system | |
| CN101291169B (en) | Selection method of wireless relay station | |
| CN101965741A (en) | Method of wireless communication and equipment are used to cooperate | |
| CN105764061A (en) | D2D (Device-to-Device) communication resource allocation method in wireless cellular network | |
| CN102143596A (en) | Wireless resource scheduling method and wireless resource scheduling system | |
| CN101527587A (en) | Method, system and relay equipment for power control | |
| CN102484527A (en) | Method of updating bs system information of a relay station in a broadband wireless access system | |
| CN101155395A (en) | Band width distribution method, system and device based on wireless system | |
| CN102497619B (en) | Wireless multicast transmission and rate adaptation method during train-ground communication and system thereof | |
| CN101521909A (en) | Signaling forwarding method for communication between base stations based on terminal relays | |
| CN101626607B (en) | Method and system for terminal switching under relay scene in wireless communication system | |
| CN104284405A (en) | Cellular network base station and relay station united dormancy scheduling method based on multi-agent system | |
| CN101409927A (en) | Method and system for sending and obtaining base station information, and base station and access equipment | |
| CN101404530A (en) | Power distribution method for reducing symbol error rate in AF cooperation communication system | |
| CN101262625B (en) | A method for reducing signaling consumption based on multi-source relay wireless network | |
| CN101925003A (en) | Method, base station and system for distributing multicast broadcast single frequency network subframe | |
| CN101331709A (en) | Method, system and node for forwarding data packet | |
| CN101364884A (en) | Method and apparatus transmitting multimedia broadcast and multicast service data packet | |
| CN102158323A (en) | Backhaul signal relay transmission method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110112 Termination date: 20190421 |