Scalable, self-organizing packet radio network having decentralized channel management providing collision-free packet transfer
First Claim
1. A scalable, self-organizing packet radio network station providing decentralized collision-free packet transfer between stations, comprising:
- first means for eliminating at each station packet loss from contention appearing as background noise that arises from all of the stations that may be on the network at any given time; and
second means for eliminating at each station packet loss caused by its own transmitter contending with, at its own receiver, receptions of packets from one or more neighboring stations;
wherein said second means includes a processor implemented first scheduling technique; and
wherein the processor implemented first scheduling technique (i) generates at each station a schedule of transmit opportunities and receive opportunities during which it obliges itself to listen, which schedule is unique to each station and asynchronous with that of other stations, (ii) publishes its unique schedule to the other neighboring stations, (iii) compares its unique schedule of transmit and receive opportunities with that of a neighboring station intended to receive the transmission to determine when packets may be transferred thereto during a receive opportunity thereof without collision and (iv) transmits its packets thereto at such times.
1 Assignment
0 Petitions
Accused Products
Abstract
A scalable, self-organizing packet radio network providing decentralized collision-free packet transfer is disclosed having spread-spectrum transmitters and receivers for eliminating contention from background noise, spread-spectrum receivers with multiple tracking and despreading channels for eliminating contention from multiple transmitters contending for the same receiver at the same time, and a processor implemented scheduling technique for eliminating contention arising both from self-contention and from comparatively-high power transmissions of neighboring stations. In the preferred embodiments, the processor implemented scheduling technique randomly provides a unique schedule of transmit and receive opportunities for each station. In accord therewith, each station obliges itself to listen and publishes the unique schedule of each station to every neighboring station. To avoid self-contention, a packet is transmitted to an intended station at a time that corresponds to the first available listening opportunity thereof that is long enough to receive the packet. To avoid contention arising from comparatively-high power transmissions of neighboring stations, a packet is transmitted to an intended station at a time that corresponds to the first available transmit opportunity thereof that does not overlap with the receive windows of any neighboring station. In the preferred embodiments, a processor implemented power control technique is disclosed which so varies transmitter power as to provide a fixed level of power at any intended recipient station. In the preferred embodiments, minimum energy routing is employed for specifying intended stations for multi-hop packet transfer. In the presently preferred embodiments, the random generation at each station of its unique schedule is implemented by a pseudo-random schedule generator common to all stations and by a pseudo-random clock unique to each station. In the presently preferred embodiment, neighboring stations periodically exchange rendezvous packets that include information representative of each station'"'"'s pseudo-random clock, transmitted power and station identity.
-
Citations
24 Claims
-
1. A scalable, self-organizing packet radio network station providing decentralized collision-free packet transfer between stations, comprising:
-
first means for eliminating at each station packet loss from contention appearing as background noise that arises from all of the stations that may be on the network at any given time; and second means for eliminating at each station packet loss caused by its own transmitter contending with, at its own receiver, receptions of packets from one or more neighboring stations; wherein said second means includes a processor implemented first scheduling technique; and wherein the processor implemented first scheduling technique (i) generates at each station a schedule of transmit opportunities and receive opportunities during which it obliges itself to listen, which schedule is unique to each station and asynchronous with that of other stations, (ii) publishes its unique schedule to the other neighboring stations, (iii) compares its unique schedule of transmit and receive opportunities with that of a neighboring station intended to receive the transmission to determine when packets may be transferred thereto during a receive opportunity thereof without collision and (iv) transmits its packets thereto at such times. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24)
-
-
23. A self-organizing packet radio network station providing decentralized packet transfer between stations, comprising:
-
a processor; and a processor implemented first scheduling technique which (i) generates at each station a schedule of transmit opportunities and receive opportunities during which it obliges itself to listen, which schedule is unique to each station and asynchronous with that of other stations, (ii) publishes its unique schedule to the other neighboring stations, (iii) compares its unique schedule of transmit and receive opportunities with that of a neighboring station intended to receive the transmission to determine when packets may be transferred thereto during a receive opportunity thereof without collision and (iv) transmits its packets thereto at such times.
-
Specification