System and Method for Ad Hoc Network Access Employing the Distributed Election of a Shared Transmission Schedule
- Technology Benefits
- Increases bandwidth utilization via competition for empty-time slotsProvides collision-free access and priority-based channel access within ad hoc networks for high performance
- Technology Application
- Communication networks: a system that allows collision-free channel access within an ad hoc network while maximizing the use of available bandwidth
- Detailed Technology Description
- Scientists at the University of California, Santa Cruz have developed a novel topology-dependant TDMA method that acts as a collision-free medium access control (MAC) protocol that resolves contentions for time division multiple access (TDMA) for a single communication channel. By employing distributed election of a shared transmission schedule, the system can allow for collision-free access and increase the use of bandwidth.
- Supplementary Information
- Patent Number: US7046639B2
Application Number: US2001967901A
Inventor: Garcia Luna Aceves, J. J. | Bao, Lichun
Priority Date: 29 Sep 2000
Priority Number: US7046639B2
Application Date: 28 Sep 2001
Publication Date: 16 May 2006
IPC Current: H04L001256 | H04W007212
US Class: 370314 | 370445
Assignee Applicant: The Regents of the University of California
Title: System and method for ad hoc network access employing the distributed election of a shared transmission schedule
Usefulness: System and method for ad hoc network access employing the distributed election of a shared transmission schedule
Summary: In medium access control (MAC) to provide collision-free access within the ad hoc network.
Novelty: Scheduling collision-free topology-dependent TDMA data transmission on channel having time-slots within give block by transmitting one or more data frames within given time-slot by node selected according to random permutation
- Industry
- ICT/Telecom
- Sub Category
- Telecommunication
- Application No.
- 7046639
- Others
-
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)
- Bandwidth Efficient Source Tracing (Best) for Wireless Networks
- 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
- Tree-Based Ordered Multicasting in Computer Networks
- HIDRA: Method for Hiding Mobility, Multiplexing, and Multi-Homing from Internet Applications
Tech ID/UC Case
10196/2000-383-0
Related Cases
2000-383-0
- *Abstract
-
Many scheduling algorithms for time division multiple access (TDMA) have proposed to achieve collision-free transmissions of data frames within each time-slot of a single communication channel in multi-hop packet radio networks. A scheduled-access approach consists of establishing transmission schedules in a way that eliminates collisions and achieving efficient spatial reuse of the available bandwidth. Efficient scheduling with channel reuse can render much higher channel utilization than fixed assignment approaches, such as TDMA and frequency division multiple access (FDMA).
- *IP Issue Date
- May 16, 2006
- *Principal Investigator
-
Name: Lichun Bao
Department:
Name: Jose Joaquin(JJ Garcia-Luna-Aceves
Department:
- Country/Region
- USA
