Nearly collision-free channel access system and method

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

C370S347000, C370S442000, C370S458000

Reexamination Certificate

active

07729321

ABSTRACT:
Techniques for controlling access to a communication channel for each of a plurality of nodes in a wireless ad hoc communication network. According to one embodiment, each node uses a predetermined rule, such as a hash function, to compute which of a plurality of time slots during a contention window it is to attempt transmissions. Each node in the network follows the same rule to access the channel and as a result no additional overhead transmissions are required between the nodes. In addition, contention among different nodes is reduced when a node needs to repeat an attempt to make a transmission. When a node has data to transmit on the channel, it determines a time slot in the contention window period during which to attempt the transmission using a computation that is based on a number identifier assigned to the node, the number of time slots in the contention window period and a transmission count value that represents the number of attempts the node has made to make the transmission. According to another embodiment, nodes are assigned to slot groups based on the time slot computation and the groups are assigned to particular slots during successive blocks in a round robin fashion so as to ensure fair access to the communication channel.

REFERENCES:
patent: 5422887 (1995-06-01), Diepstraten et al.
patent: 5509015 (1996-04-01), Tiedemann et al.
patent: 5884196 (1999-03-01), Lekven et al.
patent: 5909651 (1999-06-01), Chander et al.
patent: 6088344 (2000-07-01), Wales et al.
patent: 6418136 (2002-07-01), Naor et al.
patent: 6532224 (2003-03-01), Dailey
patent: 7215681 (2007-05-01), Li
patent: 2002/0067736 (2002-06-01), Garcia-Luna-Aceves et al.
patent: 2002/0136180 (2002-09-01), Asokan
patent: 2003/0067936 (2003-04-01), Amtmann
patent: 2003/0137993 (2003-07-01), Odman
patent: 2005/0238042 (2005-10-01), Hong
patent: 2006/0198346 (2006-09-01), Liu et al.
patent: 2007/0058660 (2007-03-01), Sammour et al.
patent: 2007/0064720 (2007-03-01), Sterenson et al.
patent: 2007/0155398 (2007-07-01), Park et al.
patent: 2008/0132264 (2008-06-01), Krishnamurthy et al.
patent: 2008/0151820 (2008-06-01), Solis et al.
Chenxi Zhu et al. “A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks”. IEEE 1998.
Ji-Her Ju et al. “TDMA Scheduling Design of Multihop Packet Radio Networks Based on Latin Squares”. IEEE Journal on Selected Areas in Communications, vol. 17, No. 8, Aug. 1999.
Lichun Bao et al. “Hybrid Channel Access Scheduling in Ad Hoc Networks”. IEEE 2002.
Long Yang et al. “Node Activation with Polling Channel Access”. IEEE Communications Society, 2004.
Jerzy Konorski et al. “Application of a Hash Function to Discourage MAC-Layer Misbehaviour in Wireless LANs”. Journal of Telecommunications and Information Technology, Feb. 2004.
Imrich Chlamtac et al. “Time-Spread Multiple-Access (TSMA) Protocols for Multihop Mobile Radio Networks”. IEEE/ACM Transactions on Networking, vol. 5, No. 6, December 1997.

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

Nearly collision-free channel access system and method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Nearly collision-free channel access system and method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nearly collision-free channel access system and method will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4167258

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