CN1770731A - Channel assigning method in special peer-to-peer network - Google Patents
Channel assigning method in special peer-to-peer network Download PDFInfo
- Publication number
- CN1770731A CN1770731A CNA2004100871615A CN200410087161A CN1770731A CN 1770731 A CN1770731 A CN 1770731A CN A2004100871615 A CNA2004100871615 A CN A2004100871615A CN 200410087161 A CN200410087161 A CN 200410087161A CN 1770731 A CN1770731 A CN 1770731A
- Authority
- CN
- China
- Prior art keywords
- node
- stage
- package
- information
- designated code
- 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.)
- Granted
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
This invention relates to special ad hoc networks channel dispatching method, which is through intra-cluster remain requirements, remain responding, codes dispatching, codes collusion testing, codes collusion repay and codes confirming , six phases remain programs and RTS-CTS dialogue agreement and establishes multi-address time groove and codes to realize the real time communication to provide QoS insurance.
Description
Technical field
The present invention relates to the technical field of special peer-to-peer network, refer to a kind of channel assigning method of in special peer-to-peer network, supporting instant messaging (Real-Time Traffic) that is applicable to especially.
Background technology
Wireless network (Wireless networks) is flourish in recent years, and one of wherein with the fastest developing speed be to move special peer-to-peer network (Mobile Ad Hoc Networks), actual, special peer-to-peer network is to be distributed in everywhere and mobile node (mobile nodes) that shared radio band is linked up is constituted by a plurality of, with respect to other network (for example mobile telephone network or satellite network), the characteristics of special peer-to-peer network maximum are not have fixing capital construction (infrastructure), because special peer-to-peer network only includes mobile node, under each node transmission range condition of limited, all nodes all can help its contiguous node transmission (relay) data, therefore network is to constitute by the communication between mobile node, and topology network (Topology) will or leave and dynamically change along with the adding of some mobile node, therefore, special peer-to-peer network has suitable elasticity and robustness, in its adverse circumstances that can't use applicable to the immobilizing foundation construction, for example in the battlefield or the zone that destroyed by natural disaster such as for example earthquake, special peer-to-peer network can be laid fast so that required Communications service to be provided.
In aforesaid special peer-to-peer network, effective communication distance between one mobile node and another mobile node is referred to as a step journey (hop), and because the restriction of the effective communication distance of each mobile node, so when online when carrying out communication at a distance of setting up greater than two nodes of effective communication distance such as desire, must be with the relaying of other mobile node transmitting (relay) data, thereby constituted the environment of a multistep journey (multi-hop).Can learn the communication need of all mobile radio stations and realize that at an easy rate frequency range keeps (bandwidth reservation) via base station (base station) with respect to the wireless network that capital construction (infrastructure) arranged (for example mobile telephone network), in this special peer-to-peer network, obtain and dispose allotment for channel, owing to do not have the distribution that resource is coordinated in centralized control, so its scheduling (scheduling) complexity, adding wireless communication platform is an open space, at any time all might produce interference, therefore, desire in multistep journey (multi-hop) network, to set up one online, and the reservation frequency range reaches promptly difficult realization of assurance of service quality (QoS) to support instant messaging (Real-Time Traffic), in special peer-to-peer network, must realize required controlled function with Distributed Calculation, and the tissue that network rack constitutes the single order laminar is become the problem of the required solution of Distributed Calculation, wherein, mobile node hived off and the special peer-to-peer network of the formula of gathering together that framework goes out extensively is used, as shown in Figure 1, each 11 (cluster) that gather together generally is made up of the comparatively approaching a plurality of mobile nodes 12 in geographical position, same mobile nodes 12 of gathering together in 11 can communicate with one another each other, and adjacent two gather together 11 wherein one gather together 11 have at least one can with gateway (gateway) node 12 of another communication of 11 of gathering together.
The radio channel of being shared between the mobile node 12 of aforementioned special peer-to-peer network is to adopt the mode of TDMA (Time Division Multiple Access) and CDMA (Code Division MultipleAccess) to distribute frequency range, that is one passage comprise in fact a time slot (Time slot) and one the coding (Code), when a link (link) when setting up, transmission node 121 uses identical coding to link up in the time slot of a configuration with receiving node 123, that is transmits and receive package.A major challenge of the special peer-to-peer network of this kind is how suitably to distribute passage in gathering together 11, can not produce collision to guarantee successfully to transmit data, the repeat usage that improves passage simultaneously comes the usefulness of elevator system.
Be configuration one passage between mobile node 12, the pairing that need select for use a coding to give this mobile node 12, if the number of the coding that can Gong select for use is more than the number of mobile node 12, then each mobile node 12 all can be assigned a specific coding, in the case, the mode of linking up has two kinds: one is RCA (Receiver-based code assignment), that is the transmission end is according to coding and its communication of receiving terminal; Another kind is TCA (Transmitter-based code assignment), and its receiving terminal uses the coding of transmission end to receive data.Yet in general special peer-to-peer network, because available coding number is less than the number of mobile node 12, therefore how reusing coding efficiently just becomes an epochmaking problem.
Again, among special peer-to-peer network, as shown in Figure 1, might have two nodes 121 and 122 that exceed communication context each other and transmit package simultaneously to same other node 123, and cause head-on crash (Head-on collision) at node 123, or transmit packages for node 124 and node 122 because of node 121 transmission packages and give node 123, and cause side collision (Side-way collision) at node 123, thereby cause so-called hiding end points (hidden terminal) problem, and must when system design, be solved.
Summary of the invention
An object of the present invention is to provide a kind of channel assigning method, in special peer-to-peer network, to support real-time transmission.
Another object of the present invention provides a kind of channel assigning method, and it can guarantee the conflict that can not encode and the problem of hiding end points, and avoids any interference fully, and can reach preferable coding service efficiency.
For reaching above-mentioned purpose, the present invention proposes a kind of channel assigning method in special peer-to-peer network, wherein, this special peer-to-peer network has a plurality of mobile nodes, it forms some gathering together, definition has a Control Node in each node of gathering together, arbitrary node in this Control Node and same the gathering together is all at a distance of a step journey, in each definition of gathering together make code is altogether arranged again, so that all nodes in this is gathered together all can be with this common sign indicating number sending and receiving package of encoding, this method comprises: one gather together in the step and of channel assignments keep the step of frequency range between gathering together.The step that this mid band of gathering together is assigned comprises: in a beachhead demand (RREQ) stage, send a RREQ package to keep the information time slot by the defeated node of a tendency to develop; One keeps response (RRSP) stage, is to receive the RREQ package by receiving node repayment; One code assignment (CASN) stage is to choose a designated code to be assigned to defeated node of these tendencies to develop and receiving node from its coding schedule by the Control Node of the transmission that detects the RRSP package; Generation code conflicts detects (CCD) stage, is to be failed node or used this designated code to transmit a greeting information (hello) to receiving node at the node that transmits by the tendency to develop that is assigned designated code, assigns the collision of conflict to test possible designated code; Generation code conflicts repayment (CCR) stage is to repay the collision that this possible designated code is assigned conflict by receiving node; And a code is confirmed (CCFM) stage, be to repay a confirmation by the defeated node of the tendency to develop that does not produce collision in the affiliated receiving node to give its Control Node to set up the passage that keeps, if receive the CCR package, then the designated code that will originally assign of Control Node discharges back in the coding schedule.The step that keeps frequency range between this is gathered together comprises: one requires to transmit (RTS) stage, is to send a RTS information to adjacent this receiving node of gathering together by the defeated node of a tendency to develop with the common sign indicating number of a receiving node; And transmit at the beginning (CTS) stage, when this receiving node is received unique RTS information, send a CTS information by this receiving node with its common sign indicating number and inform that with response success receives RTS, and set up the frequency range that keeps.
Description of drawings
Fig. 1 is for showing a known special peer-to-peer network of gathering together.
Fig. 2 is for showing the system architecture of implementing the channel assigning method in special peer-to-peer network of the present invention.
Fig. 3 is for showing the defined frame framework of sequential according to method of the present invention.
Fig. 4 is for showing the flow process of carrying out channel assignments according to method of the present invention in time control time slot of a zone.
Fig. 5 carries out flow process that frequency range keep adjacent gathering together for showing according to method of the present invention in a universe time control time slot.
Fig. 6 is for showing that one carries out the example of the special peer-to-peer network of channel assigning method of the present invention.
Fig. 7 shows that one carries out the example of the special peer-to-peer network of channel assigning method of the present invention.
Fig. 8 shows according to the special peer-to-peer network of the present invention example operation in six stages of time control time slot in a zone
Fig. 9 shows the various possibility schemes that are relevant to the RREQ of two internal chainings of gathering together according to Control Node of the present invention.
Figure 10 shows that method of the present invention sets up the various situations of passage when having the adjacent internal chaining of gathering together of gathering together to disturb.
Embodiment
Relevant channel assigning method in special peer-to-peer network of the present invention, please be earlier with reference to the system architecture diagram of enforcement shown in Figure 2 method of the present invention, wherein, mobile node 20 (the Mobile Node of all special peer-to-peer networks, MN) form some 21 (cluster) that gather together, each node 20 of 21 of gathering together can be divided into three kinds of roles: Control Node (Cluster-head), gateway node (Gatewaynode) and general node.Each is gathered together and 21 has a Control Node 22, this Control Node 22 with same gather together in 21 arbitrary node 20 all only at a distance of a step journey, that is, gather together in 21 one, arbitrary node 20 and other node 20 are at most at a distance of two step journeys (two-hop).Again each gather together 21 all definition altogether make code (common code) is arranged, so that these all nodes 20 in 21 of gathering together all can be with this common sign indicating number encode and transmit package and give other at same node 20 of gathering together in 21, and adjacent common sign indicating number of gathering together is inequality, to avoid interfering with each other each other.Gather together in 211 and 212 adjacent two, wherein one gather together 211 have at least one can with the gateway node 203 of another node 20 communications of 212 of gathering together (that is gateway node 203 and adjacent 212 at least one node 20 of gathering together are at a distance of a step journey).In addition, be to transmit at the mobile node 20 of this special peer-to-peer network, that is arbitrary mobile node 20 can only transmit package at one time or receive package with half-duplex (half-duplex) pattern.
In aforesaid special peer-to-peer network, come the sending and receiving package by a radio channel of dynamically setting up between the node 20, this passage is defined by a time slot (Time slot) and a coding (Code), time slot wherein is by control time slot (control slot, CS) and information time slot (information slot, IFS) form, and aforementioned time slot is defined in the sequential, to follow this sequential to receive and dispatch by all nodes 20, Fig. 3 shows according to the defined frame framework of aforementioned sequential (frame structure), it is continued by control time slot (CS) and information time slot (IFS) and is formed, wherein, in the control time slot, node 20 can be received and dispatched the control package, and in the information time slot, but node 20 transceive data packages, as shown in Figure 3, the control time slot further comprises a plurality of universes time control time slot G (i), i=1..M (being used to gather together 21) and a plurality of zone time control time slot L (j), j=1..N (be used to gather together 21 in), each universe time control time slot G comprises one and requires to transmit (Request To Send, RTS) and at the beginning transmit (Clear ToSend, CTS) stage (phase), each zone time control time slot L then comprises beachhead demand (Reservation Request, RREQ), keep response (ReservationResponse, RRSP), code assignment (Code Assignment, CASN), code collision detection (Code Conflict Detection, CCD), code conflict repayment (Code Conflict Report, CCR), and code confirms that (Code Conform CCFM) waits six stages.
Fig. 4 shows the flow process of the decentralized algorithm channel assigning method in special peer-to-peer network of the present invention, and please refer to system architecture diagram shown in Figure 2, when a mobile node 20 desires are set up link (link) with the transmission data, belong to same as the link of being set up and gather together 21, (intra-cluster) program transmits data with information time slot (IFS) again to use zone time control time slot L and compete and to set up passage by the victor in then carrying out gathering together; Do not belong to same as the link of being set up and gather together 21, (inter-cluster) program transmits data with information time slot (IFS) again to use universe time control time slot G and compete and to set up passage by the victor between then carrying out gathering together.Fig. 5 is presented at the node of desiring to transmit 201 of gathering together in 21 and gathers together internal program and carry out the flow process of channel assignments in time control time slot L of a zone with aforementioned, at first, in the RREQ stage, the defeated node 201 of tendency to develop is sent a RREQ package to keep the information time slot.Detailed speech, the defeated node 201 of this tendency to develop will transmit a RREQ package with its common sign indicating number coding and give a receiving node 202, other node that does not transmit 20 is then compiled with common sign indicating number and is received the RREQ package, it may not received the RREQ package or receive a RREQ package or more than one RREQ package by adjacent node, as receive more than one RREQ package, then produce one the collision and all RREQ packages all lost efficacy.
Secondly, in the RRSP stage, be to receive the RREQ package of previous stage by receiving node 202 repayment.That is, receive single RREQ package as receiving node 202 with its common sign indicating number, then receiving node 202 is sent out a RRSP package with its common sign indicating number coding, to represent that it successfully receives the RREQ package, in addition also receive this RRSP package with its common sign indicating number in the Control Node 22 of gathering together in 21, so whether the defeated node 201 of tendency to develop can be received the RRSP package and determine the whether success of its RREQ package that transmits according to having in this stage, if the defeated node 201 of tendency to develop is not received the RRSP package, then represent the transmission failure of RREQ package.
In the CASN stage, the Control Node 22 that detects the transmission of RRSP package previous stage can assign a designated code to give to complete successfully RREQ and the node in RRSP stage is right.In detail speech had before been received at least one RRSP package or had been sent out a RRSP package as Control Node 22, and then this Control Node 22 is chosen suitable designated code, for example a C in it gathers together 211 affiliated coding schedules 213
1, and with this designated code C
1Assignment information send out with its common sign indicating number encoded broadcast, and defeated node 201 of this tendency to develop and receiving node 202 will receive this designated code with its common sign indicating number.
In the CCD stage, be to use this designated code to transmit a greeting information (hello) by the transmission node 201 that has been assigned designated code in previous stage to give receiving node 202, and receiving node 202 needs to receive package with this designated code, to test the conflict that possible designated code is assigned, other does not have then idle being failure to actuate of node of any task.Detailed speech, the defeated node 201 of tendency to develop is with this designated code C
1Send a greeting information (hello), any in transmission range and use designated code C
1The node of communication also can receive this greeting information, and simultaneously, the transmitting terminal of any link of having set up in network also can be with its employed designated code C
XSend a greeting information, receiving node 202 may be received one or more greeting information, wherein, receive the conflict that more than one greeting information representation one designated code is assigned, its representative belongs to an adjacent at least one node of gathering together to also being assigned identical designated code, the collision of the hiding end points between this is equivalent to gather together.
In the CCR stage, be the collision that takes place in previous stage by receiving node 202 repayment.That is, if receiving node 202 is with designated code C
1Receive two or more greeting information (hello), then receiving node 202 is with designated code C
1Send a collision information (collision), the defeated node 201 of tendency to develop can learn whether its designated code meets with the conflict between gathering together by whether receive collision information in this stage.
In the CCFM stage, be to give its Control Node 22 to set up the passage that keeps by defeated node 201 repayment of the tendency to develop that does not produce collision in previous stage one confirmation.That is if the defeated node 201 of tendency to develop is not received collision information (collision), then the defeated node 201 of tendency to develop transmits a confirmation (ack) with its common sign indicating number coding, and Control Node 22 is received this confirmation with its common sign indicating number, and can determine this designated code C
1Successfully be assigned to defeated node 201 of tendency to develop and receiving node 202, and will discharge in the self-editing code table of this designated code, therefore, transmission node 201 can use this designated code C at information time slot (IFS) with receiving node 202
1Carry out data packet transmission and reception, and can not cause the interference of other link.
Fig. 6 shows that node 202 211 and 212 carries out the flow processs that frequency range keeps adjacent gathering together in a universe time control time slot G, at first, in the RTS stage, as the defeated node 203 of 211 the tendency to develop of gathering together (it is gateway node or Control Node) will transmit package to adjacent 212 the receiving node 204 of gathering together, then the defeated node 203 of tendency to develop will send a RTS information to receiving node 204 by the common sign indicating number with receiving node 204 when the inferior control of next universe time slot, and all the other do not receive the node 20 of data, then receive package with its common sign indicating number of gathering together under separately.
If transmission node that another is gathered together or identical transmission node of gathering together also transmit RTS information at this universe time control time slot, then produce a collision and the inefficacy that causes transmitting at receiving node 204, the defeated node 203 of tendency to develop will be gone in next chance again and be competed, for example, when the inferior control of next universe time slot, resend a RTS information.
In the CTS stage, if receiving node 204 is received unique RTS, then send a CTS information and inform that with response success receives RTS with its common sign indicating number, 203 common sign indicating numbers with receiving node 204 of the defeated node of tendency to develop of having sent RTS information receive package, and when receiving CTS information, confirm to set up the frequency range that keeps, and transmit data with the common sign indicating number of this receiving node.
Fig. 7 shows that one carries out the example of the special peer-to-peer network of channel assigning method of the present invention, it includes four and gathers together 61～64, gather together and 61 comprise node N1, N2 and N3 (N3 is a gateway node), gather together and 62 comprise node N4 and N5, gather together and 63 comprise node N6, N7 and N8 (N6 is a gateway node), gathering together 64 comprises node N9, N10 and N11 (N9 is a gateway node), and gathers together 61～64 respectively with CC
1～CC
4Be its common sign indicating number, node N2, N4, N7 and N10 are respectively 61～64 the Control Node of gathering together.
Fig. 8 shows aforementioned special peer-to-peer network in the inferior example operation of controlling six stages such as RREQ, RRSP, CASN, CCD, CCR and CCFM of time slot L in a zone, and at first, in the RREQ stage, node N1 is with common sign indicating number CC
1Coding transmit the RREQ package to node N2, node N3 with common sign indicating number CC
1Coding transmit the RREQ package to node N2, node N5 with common sign indicating number CC
2Coding transmit the RREQ package to node N4, node N6 with common sign indicating number CC
3Coding transmit the RREQ package to node N7, node N10 with common sign indicating number CC
4Coding transmit the RREQ package to node N11, node N9 with common sign indicating number CC
4Coding transmits the RREQ package to node N10 (because node N10 also transmits the RREQ package, under semiduplex mode, it does not receive the RREQ package that is transmitted by N9), and hence one can see that node N2, N4, N7 and N11 are receiving node.
In the RRSP stage, because receiving node N2 receives two RRSP packages, therefore be judged to be inefficacy, and other receiving node N4, N7 and N11 all receive unique RREQ package, so node N4 is with common sign indicating number CC
2Coding transmits a RRSP package, and is received by the node N5 at a distance of a step journey; Node N7 is with common sign indicating number CC
3Coding transmits a RRSP package, and is received by node N6 and the N8 at a distance of a step journey; Node N11 is with common sign indicating number CC
4Coding transmits a RRSP package, and is received by the node N10 at a distance of a step journey.
In the CASN stage, before there had been the Control Node N4 that sends out a RRSP package in its coding schedule 621, to find out a designated code C
1, and with this designated code C
1Information with common sign indicating number CC
2Coding sends out, and is received by the node N5 at a distance of a step journey.Before there had been the Control Node N7 that sends out a RRSP package to find out a designated code C
1, and with this designated code C
1With common sign indicating number CC
3Coding sends out, and is received by node N6 and the N8 at a distance of a step journey.Before there had been the Control Node N10 that receives a RRSP package to find out a designated code C
2, and with this designated code C
2With common sign indicating number CC
4Coding sends out, and is received by node N9 and the N11 at a distance of a step journey.
In the CCD stage, the defeated node N5 of tendency to develop is with designated code C
1Send a greeting information (hello), and by the node N4 in one step journey with designated code C
1Receive this greeting information.The defeated node N6 of tendency to develop is with designated code C
1Send a greeting information, and receive this greeting information by node N4 and the N7 in one step journey.The defeated node N10 of tendency to develop is with designated code C
2Send a greeting information, and receive this greeting information by the node N11 in one step journey, all the other without any nodes of task all idle (idle) be failure to actuate.
In the CCR stage, because receiving node N4 is with designated code C
1Receive two greeting information (hello), so receiving node N4 is with designated code C
1Send a collision information (collision) and give apart the node N5 and the N6 of a step journey, wherein, but node N5 and N6 determine the node of a communication via a collision analysis program, for example, have precedence over general node or set up the rule that the node that links has precedence over the node that sends collision information earlier according to Control Node, and select node N6.
In the CCFM stage, because the defeated node N6 of tendency to develop does not receive collision information (collision) because of the selection of priority can be considered, so the defeated node N6 of tendency to develop is with common yard CC
3Coding transmits a confirmation (ack), and is received by Control Node N7, and Control Node N7 confirms designated code C
1There is no conflict, and with this designated code C
1Be assigned between defeated node N6 of tendency to develop and the receiving node N7 and carry out the package transmission.In addition, the defeated node N10 of tendency to develop does not receive collision information (collision), so the defeated node N10 of tendency to develop is with common sign indicating number CC
4Coding transmits a confirmation, and is received by node N9 and N11, because the defeated node N10 of tendency to develop itself is Control Node, so it confirms designated code C
2There is no conflict, and with this designated code C
2Be assigned between defeated node N10 of tendency to develop and the receiving node N11 and carry out the package transmission.
With aforementioned method of the present invention can guarantee gather together interior or gather together between can not produce common road and disturb (co-channel interference) or hiding end points (hidden terminal) problem, for this effect is described, Fig. 9 shows that Control Node H is relevant to the various possibility schemes of the RREQ of two internal chainings of gathering together, for each scheme, the behavior of Control Node is shown in first three stage (RREQ, RRSR CASN), wherein, among Fig. 9 (A), in the RREQ stage, node N1 and N3 all transmit the RREQ package and give node N2, so Control Node H receives two RREQ packages; In the RRSP stage, owing to receiving two RREQ packages, collides node N2, so having, Control Node H do not receive any RRSP package; Thereby, in the CASN stage, do not have any action.
Among Fig. 9 (B), in the RREQ stage, Control Node H transmits the RREQ package and gives node N1 (node N2 also transmits the RREQ package and gives node N1); In the RRSP stage, owing to receiving two RREQ packages, collides node N1, so having, Control Node H do not receive any RRSP package; Thereby, in the CASN stage, do not have any action.
Among Fig. 9 (C), in the RREQ stage, node N1 and N2 all transmit the RREQ package and give Control Node H, so Control Node H receives two RREQ packages; In the RRSP stage, owing to receiving two RREQ packages, collides Control Node H, so Control Node H can not send any RRSP package; Thereby, in the CASN stage, do not have any action.
Among Fig. 9 (D), in the RREQ stage, node N1 transmits the RREQ package and transmits the RREQ package to Control Node H, so Control Node H receives two RREQ packages for node N3 and node N2; In the RRSP stage, owing to receiving two RREQ packages, collides Control Node H, so Control Node H can not send any RRSP package, but node N1 can send a RRSP package and be received by Control Node H; Thereby in the CASN stage, Control Node H can assign designated code to give linking between node N1 and node N3.
Among Fig. 9 (E), in the RREQ stage, Control Node H transmits the RREQ package and gives node N1 (node N3 also transmits the RREQ package and gives node N2); In the RRSP stage, node N2 receives two RREQ packages and collides that Control Node H only receives the RRSP package that is transmitted by node N1; Thereby in the CASN stage, Control Node H can assign designated code to give linking between Control Node H and node N1.
Among Fig. 9 (F), in the RREQ stage, node N1 transmits the RREQ package and transmits the RREQ package to node N2, so Control Node H receives two RREQ packages for node N4 and node N3; In the RRSP stage, node N2 receives two RREQ packages and collides that Control Node H only receives the RRSP package that is transmitted by node N4; Thereby in the CASN stage, Control Node H can assign designated code to give linking between node N1 and node N4.
In Fig. 9 (G), in the RREQ stage, Control Node H transmits the RREQ package and gives node N2 (node N1 also transmits the RREQ package and gives Control Node H); In the RRSP stage, Control Node H only receives the RRSP package that is transmitted by node N2; Thereby in the CASN stage, Control Node H can assign designated code to give linking between Control Node H and node N2.
Among Fig. 9 (H), in the RREQ stage, node N2 transmits the RREQ package and transmits the RREQ package to node N2, so Control Node H receives two RREQ packages for node N1 and node N3; In the RRSP stage, Control Node H only receives the RRSP package that is transmitted by node N1; Thereby in the CASN stage, Control Node H can assign designated code to give linking between node N1 and node N2.
Among Fig. 9 (I), in the RREQ stage, node N2 transmits the RREQ package and transmits the RREQ package to node N3, so Control Node H receives two RREQ packages for node N1 and node N4; In the RRSP stage, Control Node H receives the RRSP package that is transmitted by node N3 and N2; Thereby, in the CASN stage, Control Node H can assign designated code give between node N1 and node N2 link and node N3 and node N4 between link.Present case mainly is linked in same the gathering together two of explanations, but can not interfere with each other each other, utilizes this channel assigning method also can reach the effect of coexistence.
By above-mentioned Fig. 9 (A)～(I) as can be known, first three stage of method of the present invention can be got rid of the collision that is caused by the internal chaining interference of gathering together, and after having got rid of the internal chaining of gathering together and disturbing the collision caused, need further avoid disturbing the collision that is caused by link between gathering together, Figure 10 is presented at the various situations of setting up passage when the adjacent internal chaining of gathering together of gathering together is disturbed, Figure 10 (A) shows adjacent two I that gather together, the node N1-N2 link of J and N3-N4 link and produce an interference, under the situation that this two link is set up simultaneously, detect collision through the CCD stage, N3-N4 links successfully at CCR phase judgement node, and can confirm to be assigned to the designated code of node N3-N4 link in the CCFM stage; And under the situation that this two link is not set up simultaneously, link is early set up as node N1-N2, detect collision through the CCD stage, receive collision information and make node N3-N4 link failure (but node N1-N2 link still exists) at CCR stage node N4, and do not have any action in the CCFM stage, early set up for another node N3-N4 link, detect collision through the CCD stage, receive collision information and make node N1-N2 link fail (but node N3-N4 link still exists) at CCR stage node N1, and do not have any action in the CCFM stage.
Figure 10 (B) shows adjacent two I that gather together, the node N1-N2 link of J and N4-N3 link and produce two interference, under the situation that this two link is set up simultaneously, detect collision through the CCD stage, link all failures in CCR phase judgement node N1-N2 link with node N3-N4, and do not have any action in the CCFM stage; And under the situation that this two link is not set up simultaneously, link is early set up as node N1-N2, detect collision through the CCD stage, receive collision information and make node N3-N4 link failure (but node N1-N2 link still exists) at CCR stage node N1 and N4, and do not have any action in the CCFM stage, early set up for another node N3-N4 link, detect collision through the CCD stage, receive collision information and make node N1-N2 link failure (but node N3-N4 link still exists) at CCR stage node N1 and N4, and do not have any action in the CCFM stage.
Reach (B) as can be known by above-mentioned Figure 10 (A), using in the adjacent internal chaining of gathering together of gathering together because of identical designated code when disturbing, method of the present invention can be at back three stages (CCD, CCR, therefore CCFM) reject problematic designated code, set up passage and do not produce collision.
By above-mentioned explanation as can be known, channel assigning method of the present invention reaches the RTS-CTS session protocol of between gathering together (inter-cluster) by the six stage prewired programs that use in gathering together (intra-cluster), to set up time division multiple access (TDMA) time slot and to select designated code for use, and can be implemented in the purpose of supporting real-time Transmission in the special peer-to-peer network of multistep journey, wherein, collision in first three stage of six stage prewired programs can solve and gather together, then three stages are then in order to solve the collision that causes because of selecting for use of designated code between gathering together, therefore, the problem that can guarantee that the conflict of designated code can not take place and hide end points, and avoid any interference fully, and provide the assurance of QoS.Again, because decentralized algorithm channel assigning method of the present invention is dynamically to select designated code for use, so can reach preferable designated code service efficiency.
The foregoing description only is to give an example for convenience of description, and the interest field that the present invention advocated should be as the criterion so that the claim scope is described certainly, but not only limits to the foregoing description.
Claims (16)
1. decentralized algorithm channel assigning method in special peer-to-peer network, wherein, this special peer-to-peer network has a plurality of mobile nodes, it forms some gathering together, definition has a Control Node in each node of gathering together, arbitrary node in this Control Node and same the gathering together is all at a distance of a step journey, come the sending and receiving package by a radio channel between the node, this passage is defined by a time slot and a coding, this time slot is formed by control time slot and information time slot, in the control time slot, node can be received and dispatched the control package and compete with transceive data package in the information time slot, in each definition of gathering together altogether make code is arranged again, in order to do making all nodes in this is gathered together all can the common yard sending and receiving package of encoding, when a mobile node tendency to develop transmission of data to same mobile node of gathering together, this method is carried out the following internal program of gathering together:
Beachhead demand stage RREQ sends a RREQ package to keep the information time slot by the defeated node of a tendency to develop;
One keeps response phase RRSP, is to receive the RREQ package by receiving node repayment;
One code assignment stage CASN is to assign a designated code to give defeated node of these tendencies to develop and receiving node by the Control Node of the transmission that detects the RRSP package;
Generation code conflicts detection-phase CCD is to use this designated code to transmit a greeting information by the defeated node of the tendency to develop that is assigned designated code to give receiving node, assign the collision of conflict to test possible designated code;
Generation code conflicts repayment stage CCR is to repay the collision that this possible designated code is assigned conflict by receiving node; And
One code the stage of recognition CCFM is to repay a confirmation by the defeated node of the tendency to develop that does not produce collision to give its Control Node to confirm that designated code is errorless and to set up the passage that keeps.
2. the method for claim 1, wherein in this RREQ in the stage, the defeated node of this tendency to develop transmits RREQ package with its common sign indicating number coding and gives this receiving node.
3. method as claimed in claim 2, wherein, in this RREQ stage, other node that does not transmit is compiled with the common sign indicating number of gathering together under it and is received package.
4. the method for claim 1, wherein, in the stage, receive unique RREQ package with its common sign indicating number in this RRSP as this receiving node, then this receiving node is sent out a RRSP package with its common sign indicating number coding, and the Control Node in it is gathered together also receives this RRSP package with its common sign indicating number.
5. the method for claim 1, wherein, in this CASN in the stage, before received at least one RRSP package or sent out a RRSP package as Control Node, then find out a designated code the coding schedule of this Control Node under it is gathered together, and this designated code information sent out with its common sign indicating number coding, and defeated node of this tendency to develop and receiving node will receive this designated code with its common sign indicating number.
6. the method for claim 1, wherein in this CCD in the stage, the defeated node of tendency to develop is sent a greeting information with this designated code, and the transmitting terminal of any link of having set up in network also can be sent a greeting information with its employed designated code.
7. method as claimed in claim 6, wherein, in the CCD stage, all the other are failure to actuate for idle without any the node of task.
8. the method for claim 1, wherein in this CCR in the stage, if receiving node is received two or more greeting information with designated code, then this receiving node is sent a collision information with designated code.
9. method as claimed in claim 8 wherein, in the stage, is received two or more greeting information if set up the node of link earlier with designated code in this CCR, and then this node of setting up link is earlier sent a collision information with designated code.
10. method as claimed in claim 9, wherein, in this CCR stage, but the node of the information that bumps is the node that determines a communication via a collision analysis program.
11. method as claimed in claim 10, wherein, this analysis program has precedence over the rule of the node that sends collision information and selects node according to the node that connects earlier.
12. method as claimed in claim 10, wherein, this analysis program has precedence over the rule of general node and selects node according to Control Node.
13. the method for claim 1, wherein, confirm that in this code CCFM is in the stage, if the defeated node of tendency to develop is not received collision information, then the defeated node of tendency to develop transmits a confirmation with its common sign indicating number coding, Control Node is received this confirmation with its common sign indicating number, carries out package between defeated node of tendency to develop and the receiving node and transmits and confirm this designated code is assigned to, and this designated code is discharged from code table.
14. the method for claim 1, wherein when the extremely different mobile nodes of gathering together of a mobile node tendency to develop transmission of data, this method is carried out a following program of gathering together:
One require to transmit the RTS stage, is to send a RTS information to adjacent this receiving node of gathering together by the defeated node of a tendency to develop with the common sign indicating number of a receiving node; And
Transmit (CTS) stage at the beginning, when this receiving node is received unique RTS information, send a CTS information by this receiving node with its common sign indicating number and inform that with response success receives RTS, and set up the frequency range that keeps.
15. method as claimed in claim 14, wherein, in the stage, all the other nodes that do not transmit data receive package with its common sign indicating number in this RTS.
16. the method for claim 1, wherein adjacent common sign indicating number that is defined of gathering together is inequality.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100871615A CN100448222C (en) | 2004-11-01 | 2004-11-01 | Channel assigning method in special peer-to-peer network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100871615A CN100448222C (en) | 2004-11-01 | 2004-11-01 | Channel assigning method in special peer-to-peer network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1770731A true CN1770731A (en) | 2006-05-10 |
| CN100448222C CN100448222C (en) | 2008-12-31 |
Family
ID=36751739
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100871615A Expired - Fee Related CN100448222C (en) | 2004-11-01 | 2004-11-01 | Channel assigning method in special peer-to-peer network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100448222C (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015123822A1 (en) * | 2014-02-19 | 2015-08-27 | 华为技术有限公司 | Method, device and system for establishing data channel |
| TWI575989B (en) * | 2014-10-31 | 2017-03-21 | 瑞昱半導體股份有限公司 | Wireless communication system, method and device under contention-based protocol |
| US10271352B2 (en) | 2016-07-19 | 2019-04-23 | Realtek Semiconductor Corp. | Wireless communication system and associated wireless communication method and wireless device having efficient polling mechanism in overlapping network environments |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2094409C (en) * | 1992-06-18 | 1998-07-14 | Joshua Seth Auerbach | Multicast communication tree creation and control method and apparatus |
| US6807165B2 (en) * | 2000-11-08 | 2004-10-19 | Meshnetworks, Inc. | Time division protocol for an ad-hoc, peer-to-peer radio network having coordinating channel access to shared parallel data channels with separate reservation channel |
| WO2002039668A2 (en) * | 2000-11-09 | 2002-05-16 | Hrl Laboratories, Llc | Method and apparatus for adaptive bandwidth reservation in wireless ad-hoc networks |
| US7266107B2 (en) * | 2000-11-23 | 2007-09-04 | Samsung Electronics Co., Ltd. | Apparatus and method for allocating a common channel in a CDMA mobile communication system |
| AU2003237454A1 (en) * | 2002-06-06 | 2003-12-22 | Motorola, Inc., A Corporation Of The State Of Delaware | Protocol and structure for mobile nodes in a self-organizing communication network |
| US7580394B2 (en) * | 2002-11-27 | 2009-08-25 | Nokia Corporation | System and method for collision-free transmission scheduling in a network |
-
2004
- 2004-11-01 CN CNB2004100871615A patent/CN100448222C/en not_active Expired - Fee Related
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015123822A1 (en) * | 2014-02-19 | 2015-08-27 | 华为技术有限公司 | Method, device and system for establishing data channel |
| CN104995898A (en) * | 2014-02-19 | 2015-10-21 | 华为技术有限公司 | Method, device and system for establishing data channel |
| CN104995898B (en) * | 2014-02-19 | 2018-06-05 | 华为技术有限公司 | A kind of methods, devices and systems for establishing data channel |
| TWI575989B (en) * | 2014-10-31 | 2017-03-21 | 瑞昱半導體股份有限公司 | Wireless communication system, method and device under contention-based protocol |
| US9848423B2 (en) | 2014-10-31 | 2017-12-19 | Realtek Semiconductor Corp. | Wireless communication system and associated wireless communication method |
| US10390341B2 (en) | 2014-10-31 | 2019-08-20 | Realtek Semiconductor Corp. | Wireless communication system and associated wireless communication method |
| US10271352B2 (en) | 2016-07-19 | 2019-04-23 | Realtek Semiconductor Corp. | Wireless communication system and associated wireless communication method and wireless device having efficient polling mechanism in overlapping network environments |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100448222C (en) | 2008-12-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6505884B2 (en) | Method for scheduling transmissions in a wireless network | |
| JP6530523B2 (en) | Method for scheduling closed loop information in a wireless network | |
| US7376100B2 (en) | Channel assigning method for ad-hoc network | |
| Farnoud et al. | Reliable broadcast of safety messages in vehicular ad hoc networks | |
| US10368349B2 (en) | Method for assisting bidirectional communication in wireless networks | |
| EP2253174B1 (en) | Method for communicating in a wireless network including a plurality of nodes | |
| US7924766B2 (en) | Hybrid multiple access method and system in wireless networks | |
| US20080170544A1 (en) | Method of transmitting between two nodes | |
| CN103220801B (en) | The method of wireless data transmission | |
| JP2009543478A (en) | TDMA channel access scheduling using adjacent indirect acknowledgment algorithm (NbIA) for ad hoc networks | |
| CN1878120A (en) | Distributed medium access protocol for wireless mesh networks | |
| CN1957562A (en) | Method for signal transmission in a radio communication system | |
| WO2007008174A1 (en) | Method and system of wireless communication between devices | |
| US20080175191A1 (en) | Method, Intermediate Station and Central Control Unit For the Packet-Switched Data Transmission in a Self-Organizing Radio Network | |
| US20070066319A1 (en) | Network configuration method allotting channels to wireless stations by generating a broadcast tree | |
| CN100448222C (en) | Channel assigning method in special peer-to-peer network | |
| KR101032604B1 (en) | Method for slots reservation in the distributed time division multiple access ad-hoc network | |
| EP2289276A1 (en) | Communication devices and methods for scheduling and allocating of radio resources and communication devices and methods for routing in a communication network | |
| CN101193033B (en) | Alternative scheduling method for mesh network | |
| RU2358396C2 (en) | Method, intermediate station and central control device for transmitting data with packet switching in self-organising wireless communication network | |
| CN103731835A (en) | Multiple input multiple output medium access control (MIMO MAC) protocol method for achieving singlecast and broadcast | |
| KR101268759B1 (en) | Apparatus and method to pseudo centeralized beacorning in wireless distributed beacorning system | |
| CN1327721C (en) | Method of communication of mobile terminal | |
| Gállego et al. | Performance evaluation of point-to-point scheduling strategies for the ADHOC MAC protocol | |
| KR101268628B1 (en) | Method and Apparatus for parallel beaconing operation in wireless distributed beaconing network |
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: 20081231 Termination date: 20161101 |