Preemptive packet for maintaining contiguity in cyclic...

Multiplex communications – Communication over free space – Having a plurality of contiguous regions served by...

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S348000, C370S444000, C370S448000

Reexamination Certificate

active

08068470

ABSTRACT:
An access point transmits a preemptive peg packet when it has no data to transmit in order to maintain the contiguity of its transmission timing position with respect to the timing position of other contention-free sessions (CFS) transmitted by other access points in an existing, periodic sequence. The cyclic prioritized multiple access (CPMA) method establishes the transmission timing position of contention-free sessions (CFS) between overlapping first and second wireless LAN cells contending for the same medium. Each cell includes a respective plurality of member stations. If an access point has no traffic, it will transmit a short, preemptive pegging packet and reset its backoff timer. In this manner, no gaps longer than the distributed coordination function (DCF) Interframe Space (DIFS) are left idle. This prevents other stations from using DCF contention to seize the channel, until all access points have completed one contention-free session (CFS) per periodic cycle.

REFERENCES:
patent: 4987571 (1991-01-01), Haymond et al.
patent: 5142433 (1992-08-01), Nishibe et al.
patent: 5185739 (1993-02-01), Spear
patent: 5329531 (1994-07-01), Diepstraten et al.
patent: 5353287 (1994-10-01), Kuddes et al.
patent: 5355375 (1994-10-01), Christensen
patent: 5416780 (1995-05-01), Patel
patent: 5471631 (1995-11-01), Beardsley et al.
patent: 5636223 (1997-06-01), Reardon et al.
patent: 5644576 (1997-07-01), Bauchot et al.
patent: 5682381 (1997-10-01), Sekihata et al.
patent: 5768267 (1998-06-01), Raith et al.
patent: 5828663 (1998-10-01), Ikegami
patent: 5852405 (1998-12-01), Yoneda et al.
patent: 5852723 (1998-12-01), Kalkunte et al.
patent: 5892769 (1999-04-01), Lee
patent: 5987033 (1999-11-01), Boer et al.
patent: 5999818 (1999-12-01), Gilbert et al.
patent: 6011784 (2000-01-01), Brown et al.
patent: 6047175 (2000-04-01), Trompower
patent: 6052594 (2000-04-01), Chuang et al.
patent: 6055578 (2000-04-01), Williams et al.
patent: 6067291 (2000-05-01), Kamerman et al.
patent: 6078591 (2000-06-01), Kalkunte et al.
patent: 6199170 (2001-03-01), Dietrich
patent: 6246702 (2001-06-01), Fellman et al.
patent: 6272117 (2001-08-01), Choi et al.
patent: 6343071 (2002-01-01), Lansford
patent: 6418148 (2002-07-01), Kumar et al.
patent: 6434187 (2002-08-01), Beard et al.
patent: 6473414 (2002-10-01), Hartley et al.
patent: 6490727 (2002-12-01), Nazarathy et al.
patent: 6493331 (2002-12-01), Walton et al.
patent: 6614799 (2003-09-01), Gummalla et al.
patent: 6625162 (2003-09-01), Myojo et al.
patent: 6661804 (2003-12-01), Fellman et al.
patent: 6697013 (2004-02-01), McFarland et al.
patent: 6698022 (2004-02-01), Wu
patent: 6754176 (2004-06-01), Gubbi et al.
patent: 6791997 (2004-09-01), Beyer et al.
patent: 6795418 (2004-09-01), Choi
patent: 6832093 (2004-12-01), Ranta
patent: 6865609 (2005-03-01), Gubbi et al.
patent: 6907023 (2005-06-01), McKenna et al.
patent: 6963549 (2005-11-01), Jayaraman et al.
patent: 6985499 (2006-01-01), Elliot
patent: 7024200 (2006-04-01), McKenna et al.
patent: 7095754 (2006-08-01), Benveniste
patent: 7136361 (2006-11-01), Benveniste
patent: 7180905 (2007-02-01), Benveniste
patent: 7221681 (2007-05-01), Choi et al.
patent: 7245604 (2007-07-01), Benveniste
patent: 7245605 (2007-07-01), Benveniste
patent: 7248600 (2007-07-01), Benveniste
patent: 7251232 (2007-07-01), Meier
patent: 7266085 (2007-09-01), Stine
patent: 7277413 (2007-10-01), Benveniste
patent: 7277415 (2007-10-01), Benveniste
patent: 7280517 (2007-10-01), Benveniste
patent: 7286827 (2007-10-01), McKenna et al.
patent: 7379432 (2008-05-01), Benveniste
patent: 7409700 (2008-08-01), Watson
patent: 7773625 (2010-08-01), Benveniste
patent: 2002/0061031 (2002-05-01), Sugar et al.
patent: 2002/0071448 (2002-06-01), Cervello
patent: 2002/0152324 (2002-10-01), Sherman
patent: 2002/0172186 (2002-11-01), Larsson
patent: 2002/0188723 (2002-12-01), Choi et al.
patent: 2003/0013451 (2003-01-01), Walton
patent: 2003/0103521 (2003-06-01), Raphaeli et al.
patent: 2003/0117984 (2003-06-01), Gavette
patent: 2003/0123405 (2003-07-01), Del Prado et al.
patent: 2003/0161340 (2003-08-01), Sherman
patent: 2003/0224787 (2003-12-01), Gandolfo
patent: 2004/0022219 (2004-02-01), Mangold et al.
patent: 2004/0047319 (2004-03-01), Elg
patent: 2006/0002357 (2006-01-01), Sherman
patent: 2006/0041676 (2006-02-01), Sherman
patent: 2007/0263581 (2007-11-01), Benveniste
patent: 2008/0002632 (2008-01-01), Pandey et al.
patent: 2008/0013508 (2008-01-01), Benveniste
patent: 2008/0013515 (2008-01-01), Benveniste
patent: 2008/0013522 (2008-01-01), Benveniste
patent: 2008/0019329 (2008-01-01), Benveniste
patent: 2008/0019343 (2008-01-01), Benveniste
patent: 2008/0291873 (2008-11-01), Benveniste
patent: 0994604 (2000-04-01), None
patent: WO 03-039054 (2003-05-01), None
patent: WO 03/041427 (2003-05-01), None
“Amendment- Radio Equipment and Systems (RES); High Performance Radio Local Area Network (HIPERLAN) Type 1; Functional Specification”, ETSI, ETS 300 652, May 1997, pp. 1-21.
“Broadband Radio Access Network (BRAN); Hiperlan type 2; System Overview”, ETSI, ETSI TR 101 683 VI.1.1 (Feb. 2000), Technical Report, pp. 1-19.
“Broadband Radio Access Networks (BRAN); Hiperlan Type 2; Data Link Control (DLC) Layer; Part 4: Extension for Home Environment” ETSI, ETSI TS 101 761-4 VI.2.1. (Dec. 2000), pp. 1-125.
Diepstraten, “Wireless Access Method and Physical Specification”, IEEE, IEEE P802.11-93/70, May 1993, pp. 1-16 slides 1-6.
White, “Wireless Access Method and Physical Layer Specifications”, IEEE, IEEE P802.11-93/159, Sep. 1993, pp. 1-8.
Diepstraten et al. Wireless Access Method and Physical Specification, IEEE, IEEE O802.11-94/150, Jul. 1994, pp. 1-12, Slides 1-11 & 1-23.
Andrew S. Tanenbaum,Computer Networks, 3ed, 1996 Prentice Hall, Chapter 4, “The Medium Access Sublayer”, pp. 243-338.
James L. Massey, “Collision-Resolution Algorithms and Random-Access Communications, ”Multi-User Communication Systems, edited by G. Long, Universita' di Trieste, 1981 by CISM, Udine, pp. 73-137.
Leonard Kleinrock et al., “Packet Switching in Radio Channels: Part I—Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics,” IEEE Transactions on Communications, vol. Com-23, No. 12, Dec. 1975, pp. 1400-1416.
Ronald L. Rivest, “Network Control by Bayesian Broadcast,” IEEE Transaction on Information Theory, vol. IT-33, May 1987, pp. 323-328.
Phil Karn, “MACA—A New Channel Access Method for Packet Radio,” 9thComputer Networking Conference, ARRL/CRRL Amateur Radio, 1990, pp. 134-140.
Vaduvur Bharghavan et al., “MACAU: A Media Access Protocol for Wireless LAN's”, Computer Communication Review, vol. 24, No. 4, Oct. 1994, pp. 212-225.
The Bluetooth Special Interest group, Specification of Bluetooth System, Version 1.1, Feb. 22, 2001, pp. 41-47.
IEEE Std. 802.11, “Local and Metropolitan Area Networks”, 1997, p. 92.
Bononi, L., et al. “Design and Performance Evaluation of an Asymptotically Optimal Backoff Algorithm for IEEE 802.11 Wireless LANs”, Proceeding of the 33rdHawaii International Conference on System Sciences—2000, Jan. 4-7, 2000, pp. 1-10.
Deng, Dr-Jiunn, et al. “A Priority Scheme for IEEE 802.11 DCFAccess Method”, IEICE Trans. Communication, Jan. 1999, vol. E82-B, No. 1.

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

Preemptive packet for maintaining contiguity in cyclic... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Preemptive packet for maintaining contiguity in cyclic..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Preemptive packet for maintaining contiguity in cyclic... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4309682

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