CN109392054A - A method of applied in wireless network collaboration multichannel and chance routing - Google Patents
A method of applied in wireless network collaboration multichannel and chance routing Download PDFInfo
- Publication number
- CN109392054A CN109392054A CN201811345795.4A CN201811345795A CN109392054A CN 109392054 A CN109392054 A CN 109392054A CN 201811345795 A CN201811345795 A CN 201811345795A CN 109392054 A CN109392054 A CN 109392054A
- Authority
- CN
- China
- Prior art keywords
- channel
- sender
- recipient
- wireless network
- multichannel
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/08—Testing, supervising or monitoring using real traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/16—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on interference
Abstract
The invention discloses the methods of a kind of the collaboration multichannel applied in wireless network and chance routing, and this method assesses the quality of all available channels by sender, by channel ranking information paIt is sent out by way of anycast, then after recipient receives channel ranking, calculates income/cost of channel communication than carrying out channel and the selection of sender cooperated therewith；It carries out voting in other non-selected senders again, sender starts to calculate additional expection the number of transmissions cETX to select suitable channel, the method for using trip agreement has comprehensively considered efficiency of transmission and conflict situations, and test discovery method is greatly improved to the transmission performance of wireless network.
Description
Technical field
The present invention relates to wireless communication research fields, and in particular, to a kind of collaboration applied in wireless network is believed more
The method in road and chance routing.
Background technique
In low-consumption wireless net field, signal interference is critically important problem, chance routing and multichannel communication be all for
The method for solving signal interference and proposing, combining both is the important method for improving communication performance.However, current
Work is that distribution channel respectively and selection turn originator, and income is very limited.Existing method is first hair according to link-quality
The person of sending distributes multiple channels, then finds transponder collection for each sender.It is exactly independent to consider two methods, not
Dynamically combine
In conclusion present inventor has found above-mentioned technology extremely during realizing the present application technical solution
It has the following technical problems less:
Although chance routing is established in multichannel environment, performance is almost without improve, because working as transponder quilt
When being assigned with different channels, router also can have been determined partly, this is because the transponder of lost data packets can not simultaneously
Different channels can be divided into and the same transponder cannot be included in and concentrated.Then, the group of chance routing and multichannel communication
Conjunction belongs to following antinomy: if the channel that sender and forwarding side use does not determine, can not determine the transponder of each sender
Collection.If not being determined as the transponder of each sender's setting, will be unable to determine which channel has optimum performance.Therefore at present
Method income it is limited.
Summary of the invention
The present invention provides the methods of a kind of the collaboration multichannel applied in wireless network and chance routing, solve existing
The limited technical problem of some method incomes, this method have comprehensively considered efficiency of transmission and conflict feelings using the method for trip agreement
Condition is greatly improved to the transmission performance of wireless network.
For achieving the above object, this application provides a kind of collaboration multichannels and chance applied in wireless network
The method of routing, which comprises
Step 1: each sender sends beacon to all potential recipients, receives the bitmap returned from recipient；
Step 2: sender according to step 1 Bitmap, using the router based on channel can size by all possibility
Channel be ranked up, and send；
Step 3: after each recipient receives channel collating sequence, by calculating income/cost ratio size ρiTo select
The sender cooperated therewith is selected, sender's selection has maximum ρiSender and channel as working channel；
Step 4: reciever selects remaining not selected sender and channel；
Step 5: after the selection work of recipient's completion channel and sender, sender is by calculating additional expected biography
The size of defeated number cETX, to determine sender's channel to be used and turn originator.
The application proposes a kind of method that asynchronous multichannel machine can route, and is assessed before this by sender all available
The quality of channel, by channel ranking information paSent out by way of anycast, then recipient receive channel ranking it
Afterwards, income/cost of channel communication is calculated than carrying out channel and the selection of sender cooperated therewith；It is voted in again
Other non-selected senders.Later, sender starts to calculate additional expection the number of transmissions cETX to select suitably to believe
Road.The method that this method uses trip agreement has comprehensively considered efficiency of transmission and conflict situations, our side of test discovery
Method is greatly improved to the transmission performance of wireless network.
Further, 1 expression data packet receives in bitmap, and 0 indicates the loss of data packet.
Further, the method also includes steps 6: the conflict for solving channel is corrected using method of adjustment.
Further, this method is using the chance of average routing as the router meeting of a sender, the machine averagely routed
Meeting calculation formula are as follows:
Wherein, paRepresent the data packet reception rate of anycast, paThe data packet reception rate of anycast is represented, N is the number of outbound link
Amount, SNFor a subset of N number of outbound link；N represents n outbound link, and Sn is the subset of this n link；
Wherein,Indicate step-by-step xor operation, | b | indicate in bitmap b 1 quantity, m represents the sets of bit-maps Bs of sender s
Bitmap length, BsIndicate the sets of bit-maps of sender s, m indicates BsIn bitmap length, b indicate bitmap.
Further, recipient selects working channel and sender, by calculating income/cost ratio ρiTo determine:
ρi=pa(i,j)/nc(i)
Wherein, pa(i, j) indicates the chance size routed in channel i calculated by sender j, nc(i) it indicates
The quantity of sender on channel i.
Further, after recipient selects a channel and sender, voting mechanism is taken to select other senders, it is right
Each channel records the ranking of different senders, the channel most possibly selected is checked, if the ranking ranking of a channel
It is minimum, then the channel is selected, and in the channel, if there is different senders to select the channel, selected in the channel
Ranking is ranked near preceding sender.
Further, sender selects channel after the sender that recipient selects channel and cooperation, is touched by considering
Possibility is hit, additional expection the number of transmissions is calculated, selects the smallest cETX, specifically:
CETX=ETX × (1+qcollision)
Wherein, qcollisionFor the probability of collision, calculation formula are as follows: qcollision=1-pst-pnt, pstRepresent Successful transmissions
Probability, pntThe probability that no sender attempts transmission is represented, is calculated as follows respectively:
Wherein,TtransIndicate the back-off timer of data transmission.
Further, problem unmatched for the channel of receiving side, when associated sender is from the channel of recipient
When having selected different channels, reciever its main channel of sender's channel change based on the received；Recipient can be changed to two kinds
Situation: recipient includes channel in sender's bitmap or recipient includes sender's currently chain in other optional channels
The top-quality channel in road.
The present invention provides the method for a kind of the collaboration multichannel applied in wireless network and chance routing, this method is same
When consider that the efficiency of transmission of sender and the conflict situations of recipient, this method had both remained chance routing low latency and high energy efficiency
Characteristic also remain the jamproof characteristic of multichannel communication.
This method first allows sender to send beacon message and is sent to all possible recipient by the feedback of recipient
The quality of side's assessment channel, then sent channel Ranking Information in the form of anycast, then recipient can be by coming
From the information of the channel ranking of sender, to calculate oneself, how this selects channel and the desired sender cooperated therewith, specifically
, recipient selects the channel that channel is in the top and interference is less, assesses sender by calculating income/cost ratio
In the router meeting of a certain channel, maximum value/cost ratio is selected, it then, will by the voting mechanism of a lightweight
Other not selected sender-selected corresponding channels, so far, recipient has chosen channel and sender；It is finally to send
Side selects channel, and sender is by comprehensively considering expected the number of transmissions ETX and the possibility that conflicts calculates additional expected pass
Defeated number cETX, selects channel by cETX from big to small.When the sender-selected channel of appearance and recipient select channel different
When sample, recipient changes its main channel according to the channel of sender.
The present invention is asynchronous multichannel machine meeting routing policy, assesses the router meeting of each channel, uses tripartite consultation
Mechanism selects optimal sender, turns originator and channel combination.
One or more technical solution provided by the present application, has at least the following technical effects or advantages:
The method for devising the operating mode of a tripartite consultation, bonding machine can route with multichannel communication strategy, connecing
The advantages of debit and sender select channel respectively and turn originator, remain chance routing and multichannel communication.
The evaluation mechanism of the router meeting an of lightweight is proposed, accurate channel is supported and turns the selection of originator.
Method is tested, this method has better link-quality and network performance as the result is shown.
Detailed description of the invention
Attached drawing described herein is used to provide to further understand the embodiment of the present invention, constitutes one of the application
Point, do not constitute the restriction to the embodiment of the present invention；
Fig. 1 is the process signal of the method for the collaboration multichannel being applied in wireless network in the application and chance routing
Figure.
Specific embodiment
The present invention provides the method for a kind of the collaboration multichannel applied in wireless network and chance routing, this method is same
When consider sender efficiency of transmission and recipient conflict situations, combine multichannel communication and chance routing both spy
Point, while the advantages of remain them, improve the validity of low-consumption wireless net transmission.
To better understand the objects, features and advantages of the present invention, with reference to the accompanying drawing and specific real
Applying mode, the present invention is further described in detail.It should be noted that in the case where not conflicting mutually, the application's
Feature in embodiment and embodiment can be combined with each other.
In the following description, numerous specific details are set forth in order to facilitate a full understanding of the present invention, still, the present invention may be used also
Implemented with being different from the other modes being described herein in range using other, therefore, protection scope of the present invention is not by under
The limitation of specific embodiment disclosed in face.
Referring to FIG. 1, this application provides the present invention to distribute the method key step of channel successively are as follows: each sender's hair
Mark deliver letters to all potential recipients, receives the bitmap returned from recipient, " 1 " is indicated into receiving for data packet, by " 0 "
Indicate the loss of data packet；Sender according to step 1 Bitmap, using the router based on channel can method by it is all can
The channel of energy is ranked up, and is sent；After each recipient receives channel collating sequence, by calculating income/cost
The size ρ of ratioiSelect the sender cooperated therewith, simultaneous selection channel, which ranks, forward is used as working channel；Reciever is adopted
With a kind of voting mechanism of lightweight, remaining not selected sender and channel are selected；Recipient completes channel and transmission
After the selection work of person, sender passes through the size for calculating additional expection the number of transmissions cETX, to determine that it is to be used
Channel and turn originator；If sender and the channel that recipient selects are inconsistent, recipient changes according to the channel selection of sender
Become its prevailing channel.Wherein,
A. sender sends beacon to all potential recipients and receives the information of return:
1) we are by receiving of wrapping in link and loss is converted into bitmap, " 1 " are indicated receiving for data packet, by " 0 " table
Show the loss of data packet.
B. sender is ranked up all possible channel according to the information of return, and will sequence in the form of anycast
As a result it sends out:
1) by the chance of average routing as the router meeting of a sender, the chance calculation formula that averagely routes
Are as follows:
Wherein paThe data packet reception rate of anycast is represented,Wherein,Indicate step-by-step xor operation, | b | table
Show in bitmap b the quantity of " 1 ", m represents the length of the bitmap of the sets of bit-maps Bs of sender s.Thus we can calculate each letter
The size of average router meeting on road.
2) after sender sorts all channel situations, the information of sequence is sent to all possible recipient,
So that recipient selects suitable channel and sender.
C. by receiving after the channel sequencing information that all potential senders send, each recipient is just determined
Select a working channel and a desired sender cooperated therewith.Specifically, recipient by calculate an income/
Cost ratio determines to select the sender of which channel and cooperation:
ρi=pa(i,j)/nc(i)
Wherein, pa(i, j) indicates the chance size routed in channel i calculated by sender j, nc(i) it indicates
The quantity of sender on channel i.In this way, have the sender of maximum ρ and channel will be selected as working channel and
Sender.
D. after recipient has selected main channel and corresponding sender, there are also other non-selected senders, here
Pass through the voting mechanism of a lightweight: to each channel, we record their ranking informations and inspection in different senders
Look into which channel is most possibly selected, if a channel is more likely selected in the ranking of lower channel, I
Just preferentially select this channel, and select highest rank sender.
E. recipient completes the selection of channel and corresponding sender, and has voted in other not by first choice
After sender and channel, sender is taken turns to determine the channel oneself to be worked.Here, our comprehensive considerations minimize pre-
A possibility that phase the number of transmissions ETX and channel generate conflict selects channel by calculating additional expection the number of transmissions cETX:
CETX=ETX × (1+qcollision)
Wherein, qcollisionIt is the probability of collision, calculation formula are as follows:
qcollision=1-pst-pnt
pstA possibility that indicating a Successful transmissions, pntIndicate a possibility that no sender attempts transmission, calculation formula
It is as follows:
N is the quantity of outbound link, ptaIt is the trial probability of transmission.ptaCalculation formula are as follows:
Wherein, TtransIndicate the back-off timer of data transmission.
In this way, we can calculate additional expection the number of transmissions, thus allow sender select suitable channel into
Row work.
F. if the channel difference that sender and recipients respectively select, it is proposed that a kind of refining correcting method: receiving
Person changes the main channel of oneself according to the channel that sender selects.Since the channel of all senders at this time has determined that,
Recipient has change channel: 1, channel is included in the bitmap of sender, 2, from the link-quality of sender than other senders
It is good.
Although preferred embodiments of the present invention have been described, it is created once a person skilled in the art knows basic
Property concept, then additional changes and modifications may be made to these embodiments.So it includes excellent that the following claims are intended to be interpreted as
It selects embodiment and falls into all change and modification of the scope of the invention.
Obviously, various changes and modifications can be made to the invention without departing from essence of the invention by those skilled in the art
Mind and range.In this way, if these modifications and changes of the present invention belongs to the range of the claims in the present invention and its equivalent technologies
Within, then the present invention is also intended to include these modifications and variations.
Claims (8)
1. a kind of method of collaboration multichannel and chance routing applied in wireless network, which is characterized in that the method packet
It includes:
Step 1: each sender sends beacon to all potential recipients, receives the bitmap returned from recipient；
Step 2: sender according to step 1 Bitmap, using based on the router of channel can size come by all possible letter
Road is ranked up, and is sent；
Step 3: after each recipient receives channel collating sequence, by calculating income/cost ratio size ρiTo select therewith
The sender of cooperation, sender's selection have maximum ρiSender and channel as working channel；
Step 4: reciever selects remaining not selected sender and channel；
Step 5: after recipient completes the selection work of channel and sender, sender is by calculating additional expected transmission time
The size of number cETX, to determine sender's channel to be used and turn originator.
2. the method for the collaboration multichannel and chance routing according to claim 1 applied in wireless network, feature
It is, 1 indicates receiving for data packet in bitmap, and 0 indicates the loss of data packet.
3. the method for the collaboration multichannel and chance routing according to claim 1 applied in wireless network, feature
It is, the method also includes steps 6: corrects the conflict for solving channel using method of adjustment.
4. the method for the collaboration multichannel and chance routing according to claim 1 applied in wireless network, feature
It is, this method is using the chance of average routing as the router meeting of a sender, the chance calculation formula that averagely routes are as follows:
Wherein, paThe data packet reception rate of anycast is represented, N is the quantity of outbound link, SNFor a subset of N number of outbound link；
N represents n outbound link, and Sn is the subset of this n link；
Wherein,Indicate step-by-step xor operation, | b | indicate in bitmap b 1 quantity, m represents the bitmap of the sets of bit-maps Bs of sender s
Length, BsIndicate the sets of bit-maps of sender s, m indicates BsIn bitmap length, b indicate bitmap.
5. the method for the collaboration multichannel and chance routing according to claim 1 applied in wireless network, feature
It is, recipient selects working channel and sender, by calculating income/cost ratio ρiTo determine:
ρi=pa(i,j)/nc(i)
Wherein, pa(i, j) indicates the chance size routed in channel i calculated by sender j, nc(i) it indicates believing
The quantity of sender on road i.
6. the method for the collaboration multichannel and chance routing according to claim 1 applied in wireless network, feature
It is, after recipient selects a channel and sender, takes voting mechanism to select other senders, to each channel,
The ranking of different senders is recorded, checks that the channel most possibly selected selects if the ranking ranking of a channel is minimum
The channel, and in the channel, if there is different senders to select the channel, select to rank in the channel ranking near
Preceding sender.
7. the method for the collaboration multichannel and chance routing according to claim 1 applied in wireless network, feature
It is, sender selects channel after the sender that recipient selects channel and cooperation, collides possibility by considering, calculates
Additional expection the number of transmissions, selects the smallest cETX, specifically:
CETX=ETX × (1+qcollision)
Wherein, qcollisionFor the probability of collision, calculation formula are as follows: qcollision=1-pst-pnt, pstRepresent the general of Successful transmissions
Rate, pntThe probability that no sender attempts transmission is represented, is calculated as follows respectively:
Wherein,TtransIndicate the back-off timer of data transmission.
8. the method for the collaboration multichannel and chance routing according to claim 3 applied in wireless network, feature
It is, problem unmatched for the channel of receiving side, when associated sender has selected different letters from the channel of recipient
When road, reciever its main channel of sender's channel change based on the received；Recipient can be changed to two kinds of situations: recipient's packet
The channel or recipient being contained in sender's bitmap include that currently link-quality is best in other optional channels by sender
Channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811345795.4A CN109392054B (en) | 2018-11-13 | 2018-11-13 | Method for cooperative multi-channel and opportunistic routing in wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811345795.4A CN109392054B (en) | 2018-11-13 | 2018-11-13 | Method for cooperative multi-channel and opportunistic routing in wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109392054A true CN109392054A (en) | 2019-02-26 |
| CN109392054B CN109392054B (en) | 2020-06-02 |
Family
ID=65428688
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811345795.4A Active CN109392054B (en) | 2018-11-13 | 2018-11-13 | Method for cooperative multi-channel and opportunistic routing in wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109392054B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102137465A (en) * | 2011-03-08 | 2011-07-27 | 湖南大学 | Channel allocation method suitable for opportunistic routing in multi-radio frequency multi-channel wireless mesh network |
| US20120002115A1 (en) * | 2010-06-30 | 2012-01-05 | Cable Television Laboratories, Inc. | Location-based tuner |
| US20130059614A1 (en) * | 2011-09-06 | 2013-03-07 | Qualcomm Incorporated | Methods and apparatus for identifying and/or selecting channels |
| CN103607745A (en) * | 2013-12-04 | 2014-02-26 | 湖南大学 | Method for combining opportunistic routing selection and channel allocation in wireless network |
| CN103781145A (en) * | 2012-10-25 | 2014-05-07 | 上海交通大学 | Method for designing multi-channel opportunistic routing protocol (MCORP) in cognitive radio sensing network (CRSN) |
-
2018
- 2018-11-13 CN CN201811345795.4A patent/CN109392054B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120002115A1 (en) * | 2010-06-30 | 2012-01-05 | Cable Television Laboratories, Inc. | Location-based tuner |
| CN102137465A (en) * | 2011-03-08 | 2011-07-27 | 湖南大学 | Channel allocation method suitable for opportunistic routing in multi-radio frequency multi-channel wireless mesh network |
| US20130059614A1 (en) * | 2011-09-06 | 2013-03-07 | Qualcomm Incorporated | Methods and apparatus for identifying and/or selecting channels |
| CN103781145A (en) * | 2012-10-25 | 2014-05-07 | 上海交通大学 | Method for designing multi-channel opportunistic routing protocol (MCORP) in cognitive radio sensing network (CRSN) |
| CN103607745A (en) * | 2013-12-04 | 2014-02-26 | 湖南大学 | Method for combining opportunistic routing selection and channel allocation in wireless network |
Non-Patent Citations (2)
| Title |
|---|
| GAO WEIFENG: ""Reliable Channel Allocation for Mission Oriented Low-power Wireless Networks"", 《WEB OF SCIENCE》 * |
| 李俊博: ""无线协作通信系统中的中继路由选择机制研究"", 《信息科技辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109392054B (en) | 2020-06-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Dong et al. | Performance analysis of multihop-diversity-aided multihop links | |
| Beimel et al. | Buses for anonymous message delivery | |
| EP3148128B1 (en) | Information-centric networking with small multi-path or single-path forwarding state | |
| Ma et al. | A cooperative cache-based content delivery framework for intermittently connected mobile ad hoc networks | |
| CN101594658B (en) | Routing method for 802.11 multi-interface wideband wireless mesh network | |
| CN104618236A (en) | Parallel data transmission system and method of acceleration network | |
| CN101965031B (en) | Maximum probability-based cognitive radio multi-path multicast routing method | |
| CN108391300B (en) | Credibility-based credible routing algorithm in opportunity network | |
| US20090086664A1 (en) | Packet forwarding in multi-radio multi-hop wireless networks | |
| CN101485213A (en) | Method, network nodes, and system for broadcast transmission of data | |
| CN105872008A (en) | System and method for on-demand content exchange with adaptive naming in information-centric networks | |
| Nunes et al. | Leveraging D2D multihop communication through social group meeting awareness | |
| CN111047439A (en) | Transaction processing method based on block chain | |
| CN105979562B (en) | It can guarantee the relay node selecting method of global bit error rate performance in collaboration communication | |
| CN103250452B (en) | The neighbouring sending method of identity indication code, subscriber equipment and base station | |
| CN102821438A (en) | Opportunistic routing method for wireless Mesh networks and router | |
| CN109392054A (en) | A method of applied in wireless network collaboration multichannel and chance routing | |
| CN101371531B (en) | Improved route determining methods for a network | |
| CN109688614A (en) | Realization method and system for high dynamic unmanned plane Routing for On-Demand Protocol in MANET | |
| CN104702323A (en) | Antenna selection method based on GA (Genetic Algorithm) | |
| CN104378426A (en) | Load balancing method for real-time information distribution system | |
| Abbate | Cold war and white heat: The origins and meanings of packet switching | |
| CN108834194A (en) | Selection collaboration method under multi-source multi-target network based on packet aggregation | |
| CN107241156A (en) | A kind of cell order maintaining method and device | |
| CN103607744B (en) | A kind of chance method for routing of many radio frequencies multi-channel wireless net mesh network channel-aware |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |