Schemes to determine presence of hidden terminals in wireless networks environment and to switch between them

• US 5,661,727 A
• Filed: 06/12/1996
• Issued: 08/26/1997
• Est. Priority Date: 06/12/1996
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Rezvani, Babak, Novak, Frank Peter, Naghshineh, Mahmoud, Kermani, Parviz, McKay, Danny N.
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): Patel, Ajit
• Application Number:
  US08/662,840
• Time in Patent Office: 440 Days
• Field of Search: 370/85.3, 370/95.1, 370/95.3, 370/85.2, 370/85.7, 370/85.13, 370/445, 370/446, 370/447, 370/448, 370/310, 370/329, 370/330
• US Class Current: 370/445
• CPC Class Codes: H04W 24/00 Supervisory, monitoring or testing arrangements
• CPC Class Codes: H04W 48/18 Selecting a network or a communication service
• CPC Class Codes: H04W 74/0808 using carrier sensing, e.g. carrier sense multiple access [CSMA]

Abstract

A method of delievering data in a wireless communications network using a combination of collision sensing and collision avoiidance protocols. More precisely, if there are no hidden nodes detected in the network, a collision sensing protocol is used; however, if there are hidden nodes, then a collision avoidance protocol is used. This invention also deals with methods of determining the presence or absence of hidden nodes.

Claims

1. In a wireless communications network having a plurality of transceiver nodes, a method of accessing said network said method comprising:

a. determining if there are hidden nodes among said nodes in said network; and

b. dynamically selecting an access protocol based upon said determining, whereby said network is accessed with one of a first class of access protocols if there are determined to be no hidden nodes among said nodes and said network is accessed with one of a second class of access protocols if it is determined that there are hidden nodes among said nodes.

2. In a wireless communications network having a plurality of transceiver nodes, a method of accessing said network said method comprising:

a. determining if there are hidden nodes among said nodes in said network; and

b. dynamically selecting an access protocol based upon said determining, whereby said network is accessed with a carrier sense multiple access protocol if there are determined to be no hidden nodes among said nodes and said network is accessed with a collision avoidance access protocol if it is determined that there are hidden nodes among said nodes.

3. A method as recited in claim 2, wherein each access protocol will be used for at least a minimum time period before being changed to another access protocol.

4. In a communications network having a plurality of nodes, a method of determining the presence or absence of hidden nodes in said network, said method comprising:

a. monitoring each frame transmitted in said network for its source address and destination address, and monitoring each frame transmitted in said network to determine whether it is a data frame or an acknowledgement frame;

b. maintaining a table indicating whether a node of said nodes is hidden; and

c. updating said table when receiving each data frame, wherein an entry in said table corresponding to said source address in each data frame is updated to indicate that one of said nodes corresponding to said source address is not hidden, and wherein each entry in said table corresponding to said destination address in each data frame is updated to indicate that one of said nodes corresponding to said destination address is a hidden node; and

d. updating said table when receiving each acknowledgement frame, wherein an entry in said table corresponding to said source address in each acknowledgement frame is either added or updated to indicate that one of said nodes corresponding to said source address in each acknowledgement frame is not hidden, and where each entry in said table corresponding to said destination address in each acknowledgement frame is added to indicate that one of said nodes corresponding to said destination address in each acknowledgement frame is a hidden node if said destination address in each acknowledgement frame was not previously in said table.

5. A method as recited in claim 4, wherein each entry in said table will remain in said table for at most a threshold time period.

6. In a communications network having a plurality of nodes, a method of detecting the presence of hidden nodes by each node n of said nodes, said method comprising:

a. monitoring each frame transmitted in said network for its source and destination address;

b. maintaining a table indicating whether a transmission between two nodes that is heard by said node n; and

c. updating said table in each node that monitors a frame being transmitted from any node i to any node j, said entry corresponding to the tuplet (i,j) being updated to indicate that a transmission from node i to node j can be heard, wherein an indication in said table that a transmission from node i to node j was heard while there was no transmission heard from node j to node i indicates that there is at least one node that is hidden from node n.

7. A method as recited in claim 6, wherein each entry in said table will remain in said table for at most a threshold time period.

8. In a wireless communications network having a plurality of transceiver nodes, a method of accessing said network said method comprising:

a. monitoring each frame transmitted in said network for its source address and destination address, and monitoring each frame transmitted in said network to determine whether it is a data frame or an acknowledgement frame;

b. maintaining a table indicating whether a node of said nodes is hidden; and

c. updating said table when receiving each data frame, wherein an entry in said table corresponding to said source address in each data frame is updated to indicate that one of said nodes corresponding to said source address is not hidden, and wherein each entry in said table corresponding to said destination address in each data frame is updated to indicate that one of said nodes corresponding to said destination address is a hidden node; and

d. updating said table when receiving each acknowledgment frame, wherein an entry in said table corresponding to said source address in each acknowledgement frame is either added or updated to indicate that one of said nodes corresponding to said source address is not hidden, and where each entry in said table corresponding to said destination address in each acknowledgment frame is added to indicate that one of said nodes corresponding to said destination address in said acknowledgement frame is a hidden node if said destination address in each acknowledgement frame was not previously in said table;

e. accessing said network with a carrier sense multiple access protocol if there are determined to be no hidden nodes among said nodes; and

f. accessing said network with collision avidance access protocol if it is determined that there are hidden nodes.