Group randomly addressed polling method

• US 5,373,503 A
• Filed: 04/30/1993
• Issued: 12/13/1994
• Est. Priority Date: 04/30/1993
• Status: Expired due to Fees

• Current Assignee: Information Technology Incorporated (Fiserv Incorporated)
• Original Assignee: Information Technology Incorporated (Fiserv Incorporated)
• Inventors: Chen, Kwang-Cheng
• Primary Examiner(s): Chin, Wellington
• Application Number:
  US08/056,223
• Time in Patent Office: 592 Days
• Field of Search: 370/18, 370/94.1, 370/94.2, 370/95.1, 370/95.2, 370/95.3, 370/858, 340/825.54, 340/825.07, 340/825.08, 375/1, 371/32, 371/33, 379/60, 379/63, 455/32.1, 455/38.1, 455/53.1, 455/54.1, 455/56.1, 455/54.2
• US Class Current: 370/346
• CPC Class Codes: H04L 1/1607 Details of the supervisory signal
• CPC Class Codes: H04W 48/08 Access restriction or access information delivery, e.g. discovery data delivery signalling during connection H04W76/00
• CPC Class Codes: H04W 74/06 using polling
• CPC Class Codes: H04W 74/0833 Random access procedures, e.g. with 4-step access
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support
• CPC Class Codes: H04W 84/12 WLAN [Wireless Local Area Networks]

Abstract

A randomly addressed polling (RAP) method for wireless networks is proposed to meet the requirements for wireless LANs which remain open to the research community. The RAP method has the following steps: When a base station is ready to conduct an up-link communication, it broadcasts a ready message to all users under its coverage; each user whenever has a packet to transmit generates a random number; all random numbers are simultaneously transmitted to the base station in response to the ready message; base station collects the random numbers, and polls the active users according to the collected random numbers; and when the base station successfully/unsuccessfully receives the packet from the user, it sends a positive/negative acknowledgment to the user.

Claims

1. A randomly addressed polling method for a network having a plurality of users and base stations, each base station being capable of conducting an up-link communication and a down-link communication under its coverages with said users, and each user being capable of becoming active when it has a packet to transmit, said randomly addressed polling method comprising the following steps of:

(a) when a respective base station is ready to conduct said up-link communication, said base station broadcasting a ready message to all users under its coverage;

(b) each user generating at least one random number whenever becoming active;

(c) all active users under the coverage of said base station simultaneously transmitting their random numbers to said base station in response to said ready message;

(d) said base station collecting said random numbers, and polling said active users according to said collected random numbers;

(e) when said base station successfully receives the packet of a respective active user, said base station sending a positive acknowledgment to said active user; and

(f) when said base station unsuccessfully receives the packet of a respective active user, said base station sending a negative acknowledgment to said active user.

2. A randomly addressed polling method as claimed in claim 1, wherein the step (b) includes the step of each active user generating two random numbers respectively at two stages;

and wherein the step (d) includes the steps of said base station respectively collecting said two-stage random numbers, deciding which one of said stages has the most. number of distinctly collected random numbers, and polling said active users according to said random numbers at said one decided stage.

3. A randomly addressed polling method as claimed in claim 2, wherein each base station includes a super-frame structure consisting of a plurality of first frames and a second frame, and each of said first and second frames polls said active users individually;

and wherein those of said active users which had successfully sent the packets to said base station are grouped respectively into said first frames according to their previous random numbers for respective polling, and the other active users which have not successfully sent the packets to said base station are grouped into said second frame for polling.

4. A randomly addressed polling method as claimed in claim 3, wherein each user is mobile among the coverages of said base stations.

5. A randomly addressed polling method as claimed in claim 4, wherein each base station has a representing address, and the step (a) further includes the step of said base station broadcasting its representing address to all users under its coverage;

and wherein each user is assigned a PBS location in said network to store the representing address of one of said base stations currently covering said user, and when said user learns that it is under the coverage of another base station, said user sends the representing address of said another base station to its PBS location for changing.

6. A randomly addressed polling method as claimed in claim 5, further comprising the following steps of:

(g) when there is a packet intending to be sent to one of said users in said down-link communication of said network, retrieving the representing address stored in the PBS location of said one user;

(h) sending the packet to one of said base stations corresponding to said retrieved representing address; and

(i) said one base station broadcasting and sending the packet to said one user.

7. A randomly addressed polling method as claimed in claim 6, wherein the adjacent coverages of said base stations are appropriately overlapped;

and wherein when said active mobile user moves to the overlapped coverage, said active user monitors the signal strengths from the relative base stations, and selects the strongest signal strength to follow.

8. A randomly addressed polling method as claimed in claim 7, wherein said ready message is an end-of-file message of a previous transmission of said base station.

9. A randomly addressed polling method as claimed in claim 7, wherein said ready message is an end-of-broadcasting message of each frame of said super-frame structure.

10. A randomly addressed polling method as claimed in claim 7, wherein all of said random numbers are transmitted orthogonally.

11. A randomly addressed polling method as claimed in claim 10, wherein each random number is selected from a Galois Field.

12. A randomly addressed polling method as claimed in claim 10, wherein each random number is a noncoherent sequence.

13. A randomly addressed polling method as claimed in claim 12, wherein each random number is a binary prime sequence.

14. A randomly addressed polling method as claimed in claim 10, wherein the transmission of said random numbers may utilize a signaling system wherein transmission in a time slot is as "1" and no transmission in a time slot as "0".

15. A randomly addressed polling method as claimed in claim 7, wherein each random number is transmitted several times;

and wherein said base station utilizes a majority-vote policy to decide the correctly transmitted random numbers.

16. A randomly addressed polling method as claimed in claim 7, wherein each base station includes a plurality of random number detectors to collect said random numbers.

17. A randomly addressed polling method as claimed in claim 7, wherein said network is a wireless local area network.

18. A randomly addressed polling method as claimed in claim 7, wherein said network is a wireless network with multiple-cell coverage.

19. A randomly addressed polling method as claimed in claim 7, wherein said network is a personal communication network through wireless medium.

20. A randomly addressed polling method as claimed in claim 7, wherein said network is an integrated service network through wired medium.

21. A randomly addressed polling method as claimed in claim 7, wherein said random numbers able to be generated by said users include some lower-priority random numbers, and wherein said users include some lower-priority users, and said lower-priority users are limited to be able to only generate said lower-priority random numbers.

22. A randomly addressed polling method as claimed in claim 6, wherein the step (i) includes the step of said one base station broadcasting the packet several times to support a multi-cast function of said randomly addressed polling method.

23. A randomly addressed polling method as claimed in claim 3, wherein the active user in one of said frames may be scheduled to a next frame after a predetermined delay in polling contention.