Method and apparatus for implementing self-organization in a wireless local area network

• US 5,515,509 A
• Filed: 02/15/1995
• Issued: 05/07/1996
• Est. Priority Date: 07/17/1992
• Status: Expired due to Term

• Current Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Rom, Raphael
• Primary Examiner(s): Harrell, Robert B.
• Application Number:
  US08/389,735
• Time in Patent Office: 447 Days
• Field of Search: 364/DIG. 1 MS File, 364/DIG. 2 MS File, 370/60.1, 370/85.2, 370/110.1, 379/57, 455/33, 455/39, 395/200.1, 395/200.2, 395/200.6, 395/200.11, 395/200.12, 395/200.13, 395/200.14, 395/200.15
• US Class Current: 709/228
• CPC Class Codes: H04L 9/40 Network security protocols
• CPC Class Codes: H04W 8/005 Discovery of network devices, e.g. terminals
• CPC Class Codes: H04W 84/22 with access to wired networks

Abstract

A method and apparatus for implementing self-organization in a wireless local area network ("LAN"). Each LAN is divided into a plurality of cells. Each cell is occupied by a number of nodes and one or more relay points (RPs) for communicating information within and among cells. Two separate channels are provided. The first channel, the control channel, is common to all RPs and accessible by all nodes and is utilized for communication of control information such as signal strengths of the RPs and the operating parameters of the selected RP. The second channel, the data channel, is utilized for normal communications between the selected RP and the node, and is specific to the RP. To initiate the self-organization process, the node identifies relay points in the LAN by acquiring identification information transmitted by the relay points across a common control channel. The node selects one of the relay points for communication with the node, and issues a message over the control channel requesting that the selected relay point transfer operating parameters from the relay point to the node. In response, the operating parameters are conveyed to the node. The operating parameters of the node are conformed to those of the selected relay point so that the node can communicate in the context of the selected relay point over the data channel unique to the cell, and through the selected relay point to other nodes within the same cell or to the network.

Claims

1. In a wireless local area network (LAN) comprising a plurality of cells, each cell comprising at least one node and at least one relay point for communicating information between nodes wherein the nodes and relay points in the local area network are not necessarily uniform and distributed, specifically wherein at least one node operates differently from the other nodes and at least one relay point operates differently from the other relay points of the local area network, a method for the node to implement self-organization comprising the steps of:

a first node communicating with the relay points over a common control channel to acquire identification information from the relay points of the local area network, wherein the first node resides in at least a first cell and the relay points reside in at least the first cell;

the first node selecting one of the identified relay points for communication with the first node;

the first node issuing a request over said control channel requesting that the selected relay point transfer operating parameters of the selected relay point to the first node;

the selected relay point transferring the operating parameters over said control channel to the first node; and

conforming the first node to the operating parameters of the selected relay point such that the first node is prepared to communicate with the selected relay point.

2. The method as set forth in claim 1, further comprising the step of said selected relay point determining whether to accept or reject said request from the first node.

3. The method as set forth in claim 2, further comprising the step of repeating said communicating, selecting, issuing, transferring, and conforming steps if said selected relay point determines to reject said request.

4. The method as set forth in claim 1, wherein the first node communicates with the selected relay point on a data channel, unique to the cell corresponding to the selected relay point.

5. The method as set forth in claim 1, wherein said step of communicating further comprises the steps of:

issuing a message from the first node over said control channel requesting that each relay point transmit identification information to said first node over said control channel; and

transmitting said identification information from the relay points to the first node over said control channel.

6. The method as set forth in claim 1, wherein each of the relay points intermittently transmits identification information over the control channel, said first node polling the control channel for identification information for each relay point.

7. The method as set forth in claim 1, wherein said selecting step further comprises the step of determining that a relay point satisfies performance-related criteria.

8. The method as set forth in claim 1, wherein said selecting step further comprises the step of determining that a relay point satisfies administrative criteria.

9. The method as set forth in claim 1, wherein said identification information comprises performance-related information concerning each said relay point.

10. The method as set forth in claim 1, wherein said identification information comprises administrative information concerning each said relay point.

11. In a wireless local area network comprising a plurality of cells, each cell comprising at least one node and at least one relay point for communicating information between nodes wherein the nodes and relay points in the local area network are not necessarily uniform and distributed, specifically wherein at least one node operates differently from the other nodes and at least one relay point operates differently from the other relay points of the local area network, a method for the node to implement self-organization comprising the steps of:

a first node communicating a message over said control channel requesting that each relay point transmit identification information to the node over said control channel;

each relay point transmitting identification information to the first node over said control channel;

the first node selecting one of the identified relay points for communication with the first node;

the first node issuing a request over said control channel requesting that the selected relay point transfer operating parameters of the selected relay point to the first node;

the selected relay point determining whether to accept or reject the request;

if the selected relay point determines to accept the request;

the selected relay point transferring the operating parameters over said control channel to the first node;

conforming the first node to the operating parameters of the selected relay point, such that the first node is prepared to communicate with the selected relay point;

the first node communicating with the selected relay point on a data channel unique to the cell corresponding to the selected relay point; and

if the selected relay point determines to reject the request, repeating said communicating, transmitting, selecting, issuing, and determining steps.

12. In a wireless local area network (LAN) comprising a plurality of cells, each cell comprising at least one node and at least one relay point for communicating information between said nodes wherein the nodes and relay points in the local area network are not necessarily uniform and distributed, specifically wherein at least one node operates differently from the other nodes and at least one relay point operates differently from the other relay points of the local area network, an apparatus for the node to implement self-organization comprising:

(a) a common control channel over which said nodes and said relay points communicate information, wherein said common control channel is common to said plurality of cells;

(b) at least one data channel, unique to each of said cells, over which a node and a relay point communicate information;

(c) each node comprising;

(i) identification means for identifying relay points by acquiring identification information transmitted by said relay points across said common control channel, wherein said relay points reside in at least the same cell as said each node;

(ii) selection means for selecting one of said relay points for communication with said node;

(iii) first requesting means for issuing a message over said control channel requesting that said selected relay point transfer operating parameters of the selected relay point from said relay point to said node; and

(iv) conforming means for conforming the node to the operating parameters received from the selected relay point; and

(d) each relay point comprising transfer means for transferring said operating parameters over said control channel from said selected relay point to said node.

13. The apparatus as set forth in claim 12, wherein said relay point further comprises determining means for determining whether said relay point will accept or reject said request.

14. The apparatus as set forth in claim 13, wherein said node further comprises a control means for controlling said identification means, selection means and first requesting means to execute if the selected relay point determines to reject the request of the node for the operating parameters of the relay point such that an alternate relay point is selected.

15. The apparatus as set forth in claim 12,

each node further comprising node communications means for communicating with a relay point over a data channel indicated by the operating parameters transferred by the relay point, and

each relay point further comprising relay point communication means for communicating with a node over the data channel in accordance with the operating parameters of the relay point.

16. The apparatus as set forth in claim 12, wherein said identification means further comprises a second requesting means for issuing a message over the control channel requesting that each relay point transmit identification information to the node over said control channel.

17. The apparatus as set forth in claim 12, wherein

each relay point further comprises means for intermittently transmitting identification information from said relay point over said control channel;

and

said identification means further comprises polling means for polling the control channel for the identification information from said relay point.

18. The apparatus as set forth in claim 12, wherein said selection means further comprises means for determining that a relay point satisfies performance-related criteria.

19. The apparatus as set forth in claim 12, wherein said selection means further comprises means for determining that a relay point satisfies administrative criteria.

20. The method as set forth in claim 12, wherein said identification information comprises performance-related information concerning each said relay point.

21. The method as set forth in claim 12, wherein said identification information comprises administrative information concerning each said relay point.