CN110351769A - A kind of wideband low noise amplifier circuit of double inverter structures - Google Patents
A kind of wideband low noise amplifier circuit of double inverter structures Download PDFInfo
- Publication number
- CN110351769A CN110351769A CN201810284436.6A CN201810284436A CN110351769A CN 110351769 A CN110351769 A CN 110351769A CN 201810284436 A CN201810284436 A CN 201810284436A CN 110351769 A CN110351769 A CN 110351769A
- Authority
- CN
- China
- Prior art keywords
- node
- amplifier
- oxide
- semiconductor
- type metal
- 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.)
- Pending
Links
- 239000004065 semiconductor Substances 0.000 claims abstract 16
- 239000003990 capacitor Substances 0.000 claims abstract 6
- 230000003321 amplification Effects 0.000 claims abstract 4
- 238000003199 nucleic acid amplification method Methods 0.000 claims abstract 4
- 230000005540 biological transmission Effects 0.000 description 15
- 238000012790 confirmation Methods 0.000 description 13
- 238000000034 method Methods 0.000 description 10
- 230000002452 interceptive effect Effects 0.000 description 9
- 238000004891 communication Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 7
- 238000004364 calculation method Methods 0.000 description 4
- 230000004044 response Effects 0.000 description 4
- 238000012423 maintenance Methods 0.000 description 3
- 239000000203 mixture Substances 0.000 description 3
- 230000006855 networking Effects 0.000 description 3
- IYZMXHQDXZKNCY-UHFFFAOYSA-N 1-n,1-n-diphenyl-4-n,4-n-bis[4-(n-phenylanilino)phenyl]benzene-1,4-diamine Chemical compound C1=CC=CC=C1N(C=1C=CC(=CC=1)N(C=1C=CC(=CC=1)N(C=1C=CC=CC=1)C=1C=CC=CC=1)C=1C=CC(=CC=1)N(C=1C=CC=CC=1)C=1C=CC=CC=1)C1=CC=CC=C1 IYZMXHQDXZKNCY-UHFFFAOYSA-N 0.000 description 2
- 230000004888 barrier function Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 230000002860 competitive effect Effects 0.000 description 2
- 230000007423 decrease Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000003595 spectral effect Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/309—Measuring or estimating channel quality parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
- H04W28/0236—Traffic management, e.g. flow control or congestion control based on communication conditions radio quality, e.g. interference, losses or delay
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0252—Traffic management, e.g. flow control or congestion control per individual bearer or channel
- H04W28/0263—Traffic management, e.g. flow control or congestion control per individual bearer or channel involving mapping traffic to individual bearers or channels, e.g. traffic flow template [TFT]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/10—Small scale networks; Flat hierarchical networks
- H04W84/12—WLAN [Wireless Local Area Networks]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A kind of wideband low noise amplifier circuit of double inverter structures, including first order amplifier, second level amplifier, input matching module, output matching module and biasing module, first order amplifier and second level amplifier are inverter structure, the output node of first order amplifier is connected by coupled capacitor C2 with the input node of second level amplifier, the input node of input matching module connection first order amplifier, the output node of matching module connection second level amplifier is exported, biasing module is set between first order amplifier and second level amplifier.The two-stage amplification module of the circuit is inverter structure, and then constitutes current multiplexing, and realizes identical bandwidth by giving similar metal-oxide-semiconductor parameter.Since first order amplification module and second level amplification module cascade, the superposition of voltage gain may be implemented, while the bandwidth of overall amplifier circuit can be consistent with the bandwidth of every level-one amplifying circuit, so that the wideband low noise of complete pair signals amplifies.
Description
Technical field
The invention belongs to wireless communication technique fields, and in particular to a kind of radio mesh network based on service quality guarantee
Network chance routing algorithm.
Background technique
In traditional WLAN (Wireless LAN), each user can be connected to fixation by Radio Link and connect
Access point (AP:Access Point) mode accesses network, belongs to single-hop networks structure.Although this mode is compared with wired connection side
Formula brings more convenience to user.However, since what is wirelessly communicated between fixed AP and user is limited in scope, and barrier
There is larger impact for point-to-point transmission communication, traditional WLAN is extremely difficult to ideal spreadability and scalability.
Wireless mesh network (WMN:Wireless Mesh Networks) is a kind of typical wireless multi-hop network, it with
The advantages such as self-organization, networking flexibility, compatible with plurality of access modes, it is considered to be most development potentiality in ad-hoc wireless net
One of networking technology, at present urgency communication, in terms of contribution it is huge, have broad application prospects.With biography
System WLAN is compared, and each node both can be used as access point in wireless mesh network, can also be used as router, be ok
It is communicated with one or more of the other peer node, forms multihop network structure.Because of this multihop network structure, wirelessly
Mesh network have support non line of sight transmission characteristic, this characteristic allow transmitted data on network when, barrier can be effectively shielded from,
Clear away the communication blind spot in single-hop networks environment.In addition, the multi-hop transmission structure of wireless mesh network, it can be by choosing a system
Column relay node completes Long-range Data Transmission, and spreadability has compared with conventional WLAN mode larger with scalability
It is promoted.
Wireless multi-hop network can also bring challenges simultaneously to routing Design.Although on networking mode, wireless mesh network
There is certain similarity with ad-hoc network, but tradition ad-hoc network organizing mode more focuses on the feasibility of communication.For
Wireless mesh network, in order to further focus on the QoS requirement of data transmission, applied to the tradition in wireless multi-hop network
Routing Protocol has been unable to meet demand, needs to design new routing algorithm to meet the quality of service requirement of data transmission.
Chance routing (OP:Opportunity Routing) is a kind of road proposed by the researcher of Massachusetts Polytechnics
By strategy, it is suitable for wireless multi-hop network.Different from traditional routing policy, when forwarding data, there is no formed for chance routing
One fixed transmission path, but the broadcast transmission features of wireless network are utilized, give data broadcasting to multiple neighbor nodes, and
According to certain route metric, selects wherein optimal neighbor node and continue to forward data as next-hop.This routing policy
It can be well adapted for the complex environment of wireless network, according to real-time network state, select best next-hop to transmit, largely
Ground improves the routing performance of wireless multi-hop network, has some superiority in reliability and redundancy.
Summary of the invention
It is an object of the invention to: a kind of wireless mesh network chance routing algorithm based on service quality guarantee is provided,
On the basis of chance routes thought, the QoS requirement in conjunction with needed for network real-time status and data transmission effectively improves net
The utilization rate of network resource and the reliability of routing.
In order to reach the goals above, a kind of wireless mesh network chance routing algorithm based on service quality guarantee, including
Following steps:
Each node periodicity interactive information in S1, wireless mesh network, maintenance update neighbor table, obtain next hop neighbor section
The status information of point；
S2, the node broadcasts route requests for needing to forward data, the neighbor node for receiving route requests calculates and purpose
The distance between node, and to the node reverts back route replies for needing to forward data；
S3, it needs to forward the node of data according to the route replies received, the neighbor node group of route replies will be replied
It is chosen suitable at available neighbor node collection according to the difference of itself and destination node distance and neighbor node and destination node distance
Cooperation is the neighbor node of available next-hop node, and composition can use next-hop node collection；
S4, it needs to forward the node of data QoS requirement according to needed for data and believes between available next-hop node
The estimated value of road capacity sets metric for the ratio of channel capacity and information exchange delay to choose candidate next-hop node
Collection, candidate next-hop node, which is concentrated, carries out priority ranking to node according to metric, and forwards data according to priority orders；
S5, each neighbor node for receiving forwarding data, are arranged the timer for returning to confirmation character, according to priority with determination
Start the time of forwarding data；
S6, it needs to forward the node of data to receive the return confirmation character of any candidate next-hop node, then terminates current
Routing daemon；
S7, circulation above-mentioned steps, until routing reaches destination node.
Preferred embodiment of the invention is: each node periodically interaction Hel lo message in wireless mesh network in step S1
Information, to obtain the status information of neighbor node in real time, status information includes the estimated value of interactive information delay and channel capacity.
It is highly preferred that the calculation formula of the estimated value of channel capacity are as follows:
Wherein, i is the node for needing to forward data, and j is adjacent node, and γ is path-loss factor, hijIt indicates to need to turn
The channel gain between the node i and neighbor node j of data is sent out, B is available bandwidth, and P is that node emits signal power, n0/ 2 are
The power spectral density of white noise, Dist (i, j) are to need to forward the distance between node i and neighbor node j of data.
Preferably, in step S2, need to forward the node of data to first determine whether neighbor node has purpose node, if
Have, then directly forwards, otherwise broadcast route request.
Preferably, in step S3, need to forward the node and destination node distance and neighbor node and destination node of data
The formula of the difference of distance are as follows:
Dij=Dist (i, d)-Dist (j, d) (2)
Wherein, Dist (i, d) is to need to forward distance between the node i of data and destination node d, and Dist (j, d) is neighbour
Occupy the distance between node j and destination node d, DijFor distance value；As distance value DijLess than 0, then neighbor node j
Further from destination node d, it is not suitable as available next-hop and selects node；As distance value DijGreater than 0, then neighbor node j is more
Close to destination node d, it is suitable as available next-hop node, and establishment can use next-hop node collection.
Preferably, in step S4,
If can be concentrated with next-hop node without candidate next-hop node, stated number is selected from available neighbor node concentration
The node of amount forms candidate next-hop node collection；
If the defined both candidate nodes number upper limit can be less than or equal to next-hop node centralized node number, directly it is selected to
For candidate next-hop node collection；
If the defined both candidate nodes number upper limit can be greater than with next-hop node centralized node number, pass through heuristic algorithm,
It can be concentrated with next-hop node and candidate next-hop node collection is selected according to link-quality and QoS requirement.
It is highly preferred that service quality includes that successfully forwarded probability and delay, it successfully forwarded probability and pass through formula (1) first and obtain
Volume calculation value of winning the confidence ci,j, as channel capacity estimated value ci,jGreater than needed for business when transmission rate R, neighbor node j could be at
Function forwarding, then successfully forwarded Probability pi,jFor pi,j=P (cij≥R)；
It can be obtained by formula (1), cij>=R is equivalent to:
In the channel for obeying Ruili decline, need to forward the channel gain h between the node i of data and neighbor node jij
It is mutually independent, and | hij|2Obedience parameter is σij -2Exponential distribution；
It enables:
The then probability that node i successfully forwarded by node j are as follows:
Node i forwards the single-hop total delay t of data by neighbor node jKAre as follows:
tK=TC+TH+TDATA+K(TSIFS+TACK) (6)
Wherein, TCFor need to forward data node i competitive channel medium time, THFor interactive information delay, TDATAFor
The time of data transmission, TSIFSFor short interFrameGap, TACKTo send the acknowledgement character response time；
When there are n both candidate nodes in selected candidate next-hop node set F (i), need to forward the node i of data to forward
The single-hop average overall delay E (T (i)) of data, single-hop ergodic capacity E (C (i)) formula are as follows:
Wherein, pi,KIt indicates to need to forward the node i of data to forward successful probability to the node data that priority is K,
ci,KIt indicates to need to forward the node i of data and priority is the channel capacity between the node of K；When the section for needing to forward data
It is L that point i, which is analyzed and determined that traffic delay requires, is R to data transmission rates demands, the communication distance between node is rcWhen, it chooses
Candidate next-hop node collection F (i) conversion are as follows:
s.t.
E(C(i))≥R
Dist(j,k)≤rc,j≠k,j∈F(i),j∈F(i)； (9)
According to channel capacity estimated value ci,jPostpone T with interactive informationHRatio size determine forwarding data priority, than
It is higher to be worth bigger node priority.
Preferably, in step S5, according to priority K, setting returns to the timer K (T of confirmation characterSIFS+TACK), TSIFS
For short interFrameGap, TACKFor the response time for sending confirmation character；
If priority be the Node Timer of K then, also confiscate the higher node of priority and return to forwarding data really
Symbol of reading confirms that then itself repeats step S2-S5 and forward data as next-hop node broadcast acknowledgements character；
If priority be the node of K before the timer expires, have received other node broadcasts and read really symbol, then delete
Forwarding data simultaneously terminate routing daemon.
Preferably, it in step S6, if desired forwards the node of data not receive any node and returns to confirmation character really
Recognize information, then the data for the forwarding that will be hissed using cache resources, temporary cache are repeated step S2-S6 and continue forwarding process, waited
After network state is restored, finds suitable candidate next-hop node and continue to forward data.
The invention has the following beneficial effects: the real-time status of the algorithm combination network link, turns choosing candidate next-hop node
It sends out in data procedures, fully considers quality of service requirement, and priority ranking is done to candidate next-hop node, ensure that data turn
The reliability of hair, so that the QoS requirement of data forwarding be effectively ensured on the basis of raising network real-time utilization efficiency.
Detailed description of the invention
The present invention will be further described below with reference to the drawings.
Fig. 1 is algorithm flow chart of the invention；
Fig. 2 is that the candidate next-hop node of the embodiment of the present invention chooses figure.
Specific embodiment
Embodiment one
Referring to Fig. 1, the present embodiment provides a kind of wireless mesh network chance routing algorithm based on service quality guarantee,
Include the following steps:
Each node periodicity interactive information in S1, wireless mesh network, maintenance update neighbor table, obtain next hop neighbor section
The status information of point；
S2, the node broadcasts route requests for needing to forward data, the neighbor node for receiving route requests calculates and purpose
The distance between node, and to the node reverts back route replies for needing to forward data；
S3, it needs to forward the node of data according to the route replies received, the neighbor node group of route replies will be replied
It is chosen suitable at available neighbor node collection according to the difference of itself and destination node distance and neighbor node and destination node distance
Cooperation is the neighbor node of available next-hop node, and composition can use next-hop node collection；
S4, it needs to forward the node of data QoS requirement according to needed for data and believes between available next-hop node
The estimated value of road capacity sets metric for the ratio of channel capacity and information exchange delay to choose candidate next-hop node
Collection, candidate next-hop node, which is concentrated, carries out priority ranking to node according to metric, and forwards data according to priority orders；
S5, each neighbor node for receiving forwarding data, are arranged the timer for returning to confirmation character, according to priority with determination
Start the time of forwarding data；
S6, it needs to forward the node of data to receive the return confirmation character of any candidate next-hop node, then terminates current
Routing daemon；
S7, circulation above-mentioned steps, until routing reaches destination node.
Each node periodically interaction hello packet information in wireless mesh network in step S1, to obtain neighbours' section in real time
The status information of point, status information include the estimated value of interactive information delay and channel capacity.
The calculation formula of the estimated value of channel capacity are as follows:
Wherein, i is the node for needing to forward data, and j is adjacent node, and γ is path-loss factor, hijIt indicates to need to turn
The channel gain between the node i and neighbor node j of data is sent out, B is available bandwidth, and P is that node emits signal power, n0/ 2 are
The power spectral density of white noise, Dist (i, j) are to need to forward the distance between node i and neighbor node j of data.
In step S2, need to forward the node of data to first determine whether neighbor node has purpose node, if so, then directly
It forwards, otherwise broadcast route request.
In step S3, need to forward the node of data and the difference of destination node distance and neighbor node and destination node distance
The formula of value are as follows:
Dij=Dist (i, d)-Dist (j, d) (2)
Wherein, Dist (i, d) is to need to forward distance between the node i of data and destination node d, and Dist (j, d) is neighbour
Occupy the distance between node j and destination node d, DijFor distance value；As distance value DijLess than 0, then neighbor node j
Further from destination node d, it is not suitable as available next-hop and selects node；As distance value DijGreater than 0, then neighbor node j is more
Close to destination node d, it is suitable as available next-hop node, and establishment can use next-hop node collection.
In step S4, if can be concentrated with next-hop node without candidate next-hop node, concentrated from available neighbor node
The node for selecting specified quantity forms candidate next-hop node collection；
If the defined both candidate nodes number upper limit can be less than or equal to next-hop node centralized node number, directly it is selected to
For candidate next-hop node collection；
If the defined both candidate nodes number upper limit can be greater than with next-hop node centralized node number, pass through heuristic algorithm,
It can be concentrated with next-hop node and candidate next-hop node collection is selected according to link-quality and QoS requirement.
Service quality includes that successfully forwarded probability and delay, successfully forwarded probability and passes through formula (1) acquisition channel appearance first
Measure estimated value ci,j, as channel capacity estimated value ci,jGreater than when transmission rate R, neighbor node j can just be successfully forwarded needed for business,
It then successfully forwarded Probability pi,jFor pi,j=P (cij≥R)；
It can be obtained by formula (1), cij>=R is equivalent to:
In the channel for obeying Ruili decline, need to forward the channel gain h between the node i of data and neighbor node jij
It is mutually independent, and | hij|2Obeying parameter isExponential distribution；
It enables:
The then probability that node i successfully forwarded by node j are as follows:
Node i forwards the single-hop total delay t of data by neighbor node jKAre as follows:
tK=TC+TH+TDATA+K(TSIFS+TACK) (6)
Wherein, TCFor need to forward data node i competitive channel medium time, THFor interactive information delay, TDATAFor
The time of data transmission, TSIFSFor short interFrameGap, TACKTo send the acknowledgement character response time；
When there are n both candidate nodes in selected candidate next-hop node set F (i), need to forward the node i of data to forward
The single-hop average overall delay E (T (i)) of data, single-hop ergodic capacity E (C (i)) formula are as follows:
Wherein, pi,KIt indicates to need to forward the node i of data to forward successful probability to the node data that priority is K,
ci,KIt indicates to need to forward the node i of data and priority is the channel capacity between the node of K；When the section for needing to forward data
It is L that point i, which is analyzed and determined that traffic delay requires, is R to data transmission rates demands, the communication distance between node is rcWhen, it chooses
Candidate next-hop node collection F (i) conversion are as follows:
s.t.
E(C(i))≥R
Dist(j,k)≤rc,j≠k,j∈F(i),j∈F(i)； (9)
According to channel capacity estimated value ci,jPostpone T with interactive informationHRatio size determine forwarding data priority, than
It is higher to be worth bigger node priority.
In step S5, according to priority K, setting returns to the timer K (T of confirmation characterSIFS+TACK), TSIFSFor short interframe
Interval, TACKFor the response time for sending confirmation character；
If priority be the Node Timer of K then, also confiscate the higher node of priority and return to forwarding data really
Symbol of reading confirms that then itself repeats step S2-S5 and forward data as next-hop node broadcast acknowledgements character；
If priority be the node of K before the timer expires, have received other node broadcasts and read really symbol, then delete
Forwarding data simultaneously terminate routing daemon.
In step S6, if desired the node of data is forwarded not receive the confirmation message that any node returns to confirmation character,
Cache resources will then be utilized, temporary cache hiss the data of forwarding, repeat step S2-S6 and continue forwarding process, wait network state
After recovery, finds suitable candidate next-hop node and continue to forward data.
The present embodiment is as shown in Fig. 2, there is node: i, h, j, k, l, u, v, d, wherein node i is just in forwarding number evidence
Node, d are the destination node for forwarding data.Assuming that the communication distance of each node is r in networkc.By periodically interacting
Hello packet information, node i obtain and update the status information of a hop neighbor node, including interactive information postpones TH, can with letter
Road volume calculation value c, and these maintenances of information in neighbor table.As in Fig. 2 1. shown in, node h, j, k, l are node i
A hop neighbor node.
It is as follows that candidate next-hop node process is chosen from the neighbor node of node i:
(1) node i first determines whether there is purpose node d in neighbor node, and destination node d is not in this example
The neighbor node of node i, then node i meeting broadcast route request (RREQ).The neighbor node j for receiving route requests can be according to geography
Location information calculates the distance between destination node Dist (j, d), and replys route replies (RREP) information to node i,
It include the distance between destination node information Dist (j, d) in route replies information.
(2) node i extracts the distance between neighbours and destination node information by the route replies (RREP) received, and
By calculating and destination node distance Dist (i, d), distance value D is definedij, i.e., distance between node i and destination node d
The difference of distance between neighbor node and destination node d.As in Fig. 2 2. shown in, the distance of node i and node j are fixed
Justice is the difference of Dist (i, d) and Dist (j, d).Because node i and the value of node j, k, l are greater than 0, node j, k, l then become
The available next-hop node of node i, forms the available next-hop node collection V (i) of node i, and node h will not then be considered next
Jump, as in Fig. 2 3. shown in.
(3) node i handles and analyzes business datum, determines the corresponding QoS demand of business, believes in conjunction with real-time network state
Breath estimation available channel quality selects candidate next-hop node in available next-hop node collection V (i) by heuritic approach
Collect F (i).The node number n in candidate next-hop node collection F (i) is determined first, n value is set as 2 in this example, then node k
A kind of combination as F (i) is likely to node j, node k and node l, node j and node l.Node j, k, l can
In the case where meeting data forwarding service quality requirement, since node k and node l is not mutually neighbor node, i.e. Dist (j, d) >
rc, the third constraint item being unsatisfactory in formula (11), so that mutual ACK message cannot be received, discomfort is combined into candidate next
Hop node collection F (i)；It is average according to the single-hop average overall delay E (T (i)) and single-hop of node k and node j, node j and node l
The ratio size of channel capacity E (C (i)) chooses egress j and node l composition candidate next-hop node collection F (i), in Fig. 2
4. shown in.Priority ranking is carried out according to certain metric to F (i) interior joint again, data and priority are transmitted to F (i)
In node j and node l.
(4) the node j and node l for receiving node i forwarding data, according to priority, setting returns to the timer of ACK.By
It is higher in the priority of node j, so its timer is set as (TSIFS+TACK)；And the timer of node l is set as 2 (TSIFS+TACK),
It can start the time of forwarding data with determination；
If 1) timer of node l is then, the ACK that the higher node j of priority returns to forwarding data is also confiscated, then
Oneself broadcasts ACK as next-hop node, repeats the above process and continues to forward data；
If 2) node l is before the timer expires, the ACK of node j broadcast is had received, then delete forwarding data and is terminated
Routing daemon；
(5) if node i receives the ACK that some candidate next-hop node (one of node j and node l) returns
Confirmation message then terminates current routing daemon；If node i does not receive any node and returns to ACK confirmation message, will utilize
Storage resource, temporarily storage needs the data forwarded, repeats the above process the forwarding process that continues, after waiting network state to restore,
Find suitable neighbor node forwarding data；
(6) according to above-mentioned route finding process until routing reaches destination node d.
In addition to the implementation, the present invention can also have other embodiments.It is all to use equivalent substitution or equivalent transformation shape
At technical solution, fall within the scope of protection required by the present invention.
Claims (7)
1. a kind of wideband low noise amplifier circuit of double inverter structures, which is characterized in that including first order amplifier, second
Grade amplifier, input matching module, output matching module and biasing module, the first order amplifier and second level amplification
Device is inverter structure, and the output node of the first order amplifier passes through coupled capacitor C2 and the second level amplifier
Input node is connected, and the input matching module connects the input node of the first order amplifier, the output matching module
The output node of the second level amplifier is connected, the biasing module is set to the first order amplifier and the second level
Between amplifier.
2. a kind of wideband low noise amplifier circuit of double inverter structures according to claim 1, which is characterized in that institute
Stating first order amplifier includes the first N-type metal-oxide-semiconductor NM1, feedback resistance RfWith the first p-type metal-oxide-semiconductor PM1, the first N-type MOS
The grid of pipe NM1 is connected with the grid of the first p-type metal-oxide-semiconductor PM1, the drain electrode of the first N-type metal-oxide-semiconductor NM1 and described the
The drain electrode of one p-type metal-oxide-semiconductor PM1 is connected, and the input node of the first order amplifier is equipped between two grids, is set between two drain electrodes
There is the output node of the first order amplifier, the input node of the first order amplifier passes through the feedback resistance RfWith institute
The output node for stating first order amplifier is connected, the source electrode ground connection of the first N-type metal-oxide-semiconductor NM1, the first p-type metal-oxide-semiconductor
The source electrode of PM1 connects power end.
3. a kind of wideband low noise amplifier circuit of double inverter structures according to claim 1, which is characterized in that institute
Stating second level amplifier includes the second N-type metal-oxide-semiconductor NM2 and the second p-type metal-oxide-semiconductor PM2, the grid of the second N-type metal-oxide-semiconductor NM2
It is connected with the grid of the second p-type metal-oxide-semiconductor PM2, the drain electrode of the second N-type metal-oxide-semiconductor NM2 and the second p-type metal-oxide-semiconductor
The drain electrode of PM2 is connected；It is equipped with the input node of the second level amplifier between two grids, is equipped with described second between two drain electrodes
The output node of grade amplifier, the source electrode ground connection of the second N-type metal-oxide-semiconductor NM2, the source electrode of the second p-type metal-oxide-semiconductor PM2 connect
Power end.
4. a kind of wideband low noise amplifier circuit of double inverter structures according to claim 1, which is characterized in that institute
Stating biasing module includes first resistor R1 and second resistance R2, and the first resistor R1 connects with the second point R2, bias point
Between first resistor R1 and second resistance R2, and respectively with the output node of first order amplifier and second level amplifier
Input node is connected.
5. a kind of wideband low noise amplifier circuit of double inverter structures according to claim 1, which is characterized in that institute
State one end connection rf input interface that input matching module includes first capacitor C1 and the first inductance L1, the first inductance L1
RFin, the other end are connected by capacitor C1 with the input node of first order amplifier.
6. a kind of wideband low noise amplifier circuit of double inverter structures according to claim 1, which is characterized in that institute
State one end connection second level amplifier that output matching module includes the second capacitor C3 and the second inductance L2, the second capacitor C3
Output node, the other end is connected by the second inductance L2 with radio frequency output interface.
7. a kind of wideband low noise amplifier circuit of double inverter structures according to claim 1, which is characterized in that institute
Stating the first inductance L1 and the second inductance L2 is bond-wire inductor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810284436.6A CN110351769A (en) | 2018-04-02 | 2018-04-02 | A kind of wideband low noise amplifier circuit of double inverter structures |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810284436.6A CN110351769A (en) | 2018-04-02 | 2018-04-02 | A kind of wideband low noise amplifier circuit of double inverter structures |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110351769A true CN110351769A (en) | 2019-10-18 |
Family
ID=68173506
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810284436.6A Pending CN110351769A (en) | 2018-04-02 | 2018-04-02 | A kind of wideband low noise amplifier circuit of double inverter structures |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110351769A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101425780A (en) * | 2007-11-02 | 2009-05-06 | 锐迪科微电子（上海）有限公司 | Low-noise wide-band amplifier circuit |
| CN103199807A (en) * | 2013-03-26 | 2013-07-10 | 电子科技大学 | Split compensation two-stage operational amplifier based on inverter input structure |
| US20160087587A1 (en) * | 2014-09-19 | 2016-03-24 | Qualcomm Incorporated | Dual stage low noise amplifier for multiband receiver |
-
2018
- 2018-04-02 CN CN201810284436.6A patent/CN110351769A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101425780A (en) * | 2007-11-02 | 2009-05-06 | 锐迪科微电子（上海）有限公司 | Low-noise wide-band amplifier circuit |
| CN103199807A (en) * | 2013-03-26 | 2013-07-10 | 电子科技大学 | Split compensation two-stage operational amplifier based on inverter input structure |
| US20160087587A1 (en) * | 2014-09-19 | 2016-03-24 | Qualcomm Incorporated | Dual stage low noise amplifier for multiband receiver |
Non-Patent Citations (1)
| Title |
|---|
| 李相敏等: "新型高性能超宽带低噪声放大器设计", 《中国电子科学研究院学报》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109936866A (en) | A kind of wireless mesh network chance routing algorithm based on service quality guarantee | |
| Wu et al. | QoS multicast routing by using multiple paths/trees in wireless ad hoc networks | |
| CN101945432B (en) | A kind of multi tate chance method for routing for wireless mesh network | |
| CN101883330B (en) | Network coding-based multicast routing method applied to vehicular ad hoc network | |
| US20100157889A1 (en) | System and method for improving efficiency of broadcast communications in a multi-hop wireless mesh network | |
| Ramachandran et al. | Received signal strength-based cross-layer designs for mobile ad hoc networks | |
| Ali et al. | An on-demand power and load-aware multi-path node-disjoint source routing scheme implementation using NS-2 for mobile ad-hoc networks | |
| Radi et al. | IM2PR: interference-minimized multipath routing protocol for wireless sensor networks | |
| Giruka et al. | A self-healing on-demand geographic path routing protocol for mobile ad-hoc networks | |
| Lipman et al. | Broadcast in ad hoc networks | |
| CN104053208B (en) | Method for routing based on channel distribution, device in wireless self-networking | |
| Sun et al. | A multipath on-demand routing with path selection entropy for ad hoc networks | |
| Tan et al. | Queue management for network coding in ad hoc networks | |
| Sarkar et al. | A survey on power aware routing protocols for mobile ad-hoc network | |
| Kumar et al. | Comparative analysis of CBRP, DSR, AODV routing protocol in MANET | |
| CN110351769A (en) | A kind of wideband low noise amplifier circuit of double inverter structures | |
| Sharma et al. | Routing protocol for wireless mesh network-a survey | |
| Rodrigue et al. | Routing protocols: When to use it in terms of energy? | |
| Khosroabadi et al. | An overview of some of the QoS routing protocols in wireless sensor networks | |
| Tabatabaei et al. | Routing and quality of service support for mobile ad hoc networks | |
| Goyal et al. | AntSens: an ant routing protocol for large scale wireless sensor networks | |
| Guirguis et al. | Primary user-aware network coding for multi-hop cognitive radio networks | |
| Suganthi | A dynamic neighbor aware routing protocol for Mobile Ad hoc Networks | |
| Almazmoomi et al. | BIRA: a bee inspired routing algorithm for device-to-device communication in the internet of things | |
| Paoliello Guimarães et al. | Improving reactive routing on wireless multirate ad-hoc networks |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191018 |
|
| RJ01 | Rejection of invention patent application after publication |