Method of Detecting an Analyte in a Sample
US-2018356405-A1 · Dec 13, 2018 · US
US10686691B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10686691-B2 |
| Application number | US-201816033760-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 12, 2018 |
| Priority date | Jul 12, 2017 |
| Publication date | Jun 16, 2020 |
| Grant date | Jun 16, 2020 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Disclosed and described herein are smart, high-speed UV communication protocols, inspired by the biological principles. The disclosed and described protocols use a ‘pipe’ routing topology to deliver large amount of data among the UVs equipped with multi-beam antennas. The disclosed and described embodiments include bio-inspired pipe routing and adaptive batch coding (ABC) based congestion control. In regard to bio-inspired pipe routing, a human's brain uses highly cooperative neuro cells to memorize everything. Inspired by neuro networks, a pipe architecture with high-throughput node-to-node data delivery is disclosed and described herein. The pipe routing uses multi-beam antennas to achieve parallel data transmission. In regard to ABC based congestion control, a new network coding called ABC is disclosed, which can minimize traffic congestion occurrences in the above pipe routing. The disclosed and described transport layer protocol includes both end-to-end reliability and congestion control.
Opening claim text (preview).
What is claimed is: 1. A method for routing communication in a hierarchical hybrid wireless network (H 2 WN) comprising: providing the H 2 WN comprised of at least two levels, a higher level and a lower level, wherein each level is comprised of a plurality of nodes and each of the plurality of nodes comprise a multi-beam smart antenna (MBSA); providing bio-inspired communication routing in each of the higher level and the lower level of the H 2 WN; and providing congestion control in the communication routing, wherein the congestion control comprises a transport layer protocol that considers characteristics of MBSAs, and the transport layer protocol comprises adaptive batch coding (ABC). 2. The method of claim 1 , wherein providing the bio-inspired communication routing in each of the higher level and the lower level of the H 2 WN comprise providing one or more of neuron-inspired higher level network routing, moth-inspired lower level network routing, and ant-inspired cross-level routing. 3. The method of claim 2 , wherein the neuron-inspired higher level network routing comprises utilizing a fence routing algorithm to dispatch data to multiple beams of one or more of the MBSAs that comprise the higher level network. 4. The method of claim 2 , wherein the moth-inspired lower level network routing comprises utilizing a line-fan-ring (LFR) routing search algorithm to handle a sink's singular mobility issue in the lower level network. 5. The method of claim 2 , wherein the ant-inspired cross-level routing comprises one or more lower level nodes recording a trajectory of a commander node that is in the higher level network, and creating a time-decaying routing path to reach the commander node from any place in the low-level network. 6. The method of claim 1 , wherein the ABC comprises automatically adjusting a size of a redundancy matrix size based on congestion control levels, wherein the ABC adaptively adds low redundancy to data in order to resist general loss due to allow level of congestion and adopts fast retransmission and shrinks a coding batch size during high congestion situations. 7. A hierarchical hybrid wireless network (H 2 WN) comprising: a plurality of nodes arranged into a higher level and a lower level, wherein each of the plurality of nodes comprise a multi-beam smart antenna (MBSA), each MBSA comprising a processor, a transmitter, and a receiver, wherein the processor implements: a bio-inspired communication routing protocol in each of the higher and lower levels of the H 2 WN to route communications from a source to a destination; and a congestion control protocol, wherein the congestion control protocol provides congestion control of the communications among the plurality of nodes when routing the communications from the source to the destination, wherein the congestion control protocol comprises a transport layer protocol that considers characteristics of MBSAs, and the transport layer protocol comprises adaptive batch coding (ABC). 8. The H 2 WN of claim 7 , wherein the bio-inspired communication routing in each of the higher level and the lower level of the H 2 WN comprise one or more of neuron-inspired higher level network routing, moth-inspired lower level network routing, and ant-inspired cross-level routing. 9. The H 2 WN of claim 8 , wherein the neuron-inspired higher level network routing comprises utilizing a fence routing algorithm to dispatch data to multiple beams of one or more of the MBSAs that comprise the higher level network. 10. The H 2 WN of claim 8 , wherein the moth-inspired lower level network routing comprises utilizing a line-fan-ring (LFR) routing search algorithm to handle a sink's singular mobility issue in the lower level network. 11. The H 2 WN of claim 8 , wherein the ant-inspired cross-level routing comprises one or more lower level nodes recording a trajectory of a commander node that is in the higher level network, and creating a time-decaying routing path to reach the commander node from any place in the low-level network. 12. The H 2 WN of claim 7 , wherein the ABC comprises automatically adjusting a size of a redundancy matrix size based on congestion control levels, wherein the ABC adaptively adds low redundancy to data in order to resist general loss due to allow level of congestion and adopts fast retransmission and shrinks a coding batch size during high congestion situations. 13. A non-transitory computer program product comprised of computer-executable code sections on a computer-readable medium, said code sections for performing a method for routing communication in a hierarchical hybrid wireless network (H 2 WN), said method comprising: executing a bio-inspired communication routing protocol in each of a higher level and a lower level of the H 2 WN, wherein each level of the H 2 WN is comprised of a plurality of nodes and each of the plurality of nodes comprise a multi-beam smart antenna (MBSA); and performing congestion control in the communication routing, wherein the congestion control comprises a transport layer protocol that considers characteristics of MBSAs, and the transport layer protocol comprises adaptive batch coding (ABC). 14. The non-transitory computer program product of claim 13 , wherein executing the bio-inspired communication routing in each of the higher level and the lower level of the H 2 WN comprise executing one or more of neuron-inspired higher level network routing, moth-inspired lower level network routing, and ant-inspired cross-level routing. 15. The non-transitory computer program product of claim 14 , wherein the neuron-inspired higher level network routing comprises utilizing a fence routing algorithm to dispatch data to multiple beams of one or more of the MBSAs that comprise the higher level network. 16. The non-transitory computer program product of claim 14 , wherein the moth-inspired lower level network routing comprises utilizing a line-fan-ring (LFR) routing search algorithm to handle a sink's singular mobility issue in the lower level network. 17. The non-transitory computer program product of claim 14 , wherein the ant-inspired cross-level routing comprises one or more lower level nodes recording a trajectory of a commander node that is in the higher level network, and creating a time-decaying routing path to reach the commander node from any place in the low-level network. 18. The non-transitory computer program product of claim 13 , wherein the ABC comprises automatically adjusting a size of a redundancy matrix size based on congestion control levels, wherein the ABC adaptively adds low redundancy to data in order to resist general loss due to allow level of congestion and adopts fast retransmission and shrinks a coding batch size during high congestion situations.
Distributed coding, e.g. network coding, involving channel coding (coding in both space and time H04L1/0618; cooperative diversity H04B7/022) · CPC title
Error control systems characterised by the topology of the transmission link · CPC title
Details of sliding window management · CPC title
Airborne or Satellite Networks (space-based or airborne stations H04B7/185) · CPC title
Self-organising networks, e.g. ad-hoc networks or sensor networks · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.