Dynamic search tree for resolution of contention between transmi

Multiplex communications – Channel assignment techniques – Carrier sense multiple access

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

370461, H04J 300

Patent

active

06002691&

ABSTRACT:
In a contention resolution system for use in connection with transmitting and receiving data over a communication medium, a first station determines a contention based variable E for a future upstream data frame. The variable E indicates a number of resolution slots (i) which result from expansion of a contention slot of a previous upstream data frame containing contention between the second station and other stations, and (ii) within which previously contending data may be re-transmitted by the second station. The first station inserts the variable E in a downstream data frame for transmission over the communication medium to the second station. The second station receives the variable E from the downstream data frame. The second station randomly selects one of the E resolution slots, and the second station inserts the previously contending data in the randomly selected resolution slot for re-transmission in an upstream data frame.

REFERENCES:
patent: 4907224 (1990-03-01), Scoles et al.
patent: 5303234 (1994-04-01), Kou
patent: 5384777 (1995-01-01), Ahmadi et al.
patent: 5590131 (1996-12-01), Kabatepe
patent: 5615212 (1997-03-01), Ruszczyk et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Dynamic search tree for resolution of contention between transmi does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic search tree for resolution of contention between transmi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic search tree for resolution of contention between transmi will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-870289

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.