Bandwidth Efficient Source Tracing (Best) for Wireless Networks

Reduces control overhead to increase available bandwidth and conserve power at mobile stationsStrong results in terms of the throughput seen by the user

This invention has several applications in wireless networks, including: Mobile networks Community and emergency networks Developing countries where no wired infrastructure exists

Scientists at the University of California have developed a novel bandwidth efficient routing protocol for wireless ad-hoc networks. The UC protocol considerably reduces control overhead to increase available bandwidth and conserve power at mobile stations. This new process uses non-optimal routing in table-driven routing protocols to minimize updates and reduce retransmissions. It also provides strong user throughput results.

Patent Number: US7002949B2
Application Number: US2001883082A
Inventor: Garcia Luna Aceves, Jose Joaquin | Raju, Jyoti
Priority Date: 16 Jun 2000
Priority Number: US7002949B2
Application Date: 15 Jun 2001
Publication Date: 21 Feb 2006
IPC Current: H04L001228 | H04L001256
US Class: 370351 | 370400
Assignee Applicant: The Regents of the University of California
Title: Bandwidth efficient source tracing (BEST) routing protocol for wireless networks
Usefulness: Bandwidth efficient source tracing (BEST) routing protocol for wireless networks
Novelty: Bandwidth-efficient source tracing routing protocol for wireless ad hoc networks using a table-driven list vector routing on valid paths and sends updates for invalid paths

信息和通信技術/電信

電信

7002949

Additional Technologies by these Inventors

• Scalable Integrated Services Architecture for Computer Networks
• Scalable Multicast Routing Protocol for Wireless and Mobile Computer Networks
• Receiver Initiated Channel Hopping (RICH)
• On-Demand Loop-Free Multipath Routing
• Differentiating Congestion Vs. Random Loss: A Method For Improving TCP Performance Over Wireless Links
• Improving TCP Congestion Control over Networks with Heterogeneous Transmission Media
• Mpath: A Loop-Free Multipath Routing Algorithm
• Receiver Initiated Multiple Access for Ad Hoc Networks
• Group Coordination Protocol for Networked Multimedia Systems
• System and Method for Ad Hoc Network Access Employing the Distributed Election of a Shared Transmission Schedule
• Tree-Based Ordered Multicasting in Computer Networks
• HIDRA: Method for Hiding Mobility, Multiplexing, and Multi-Homing from Internet Applications

Tech ID/UC Case

10187/2000-350-0

Related Cases

2000-350-0

美國

桌面版