WO2000025485A1 - Reseau a topologie maillee sans fil large bande - Google Patents

Reseau a topologie maillee sans fil large bande Download PDF

Info

Publication number
WO2000025485A1
WO2000025485A1 PCT/US1999/024585 US9924585W WO0025485A1 WO 2000025485 A1 WO2000025485 A1 WO 2000025485A1 US 9924585 W US9924585 W US 9924585W WO 0025485 A1 WO0025485 A1 WO 0025485A1
Authority
WO
WIPO (PCT)
Prior art keywords
nodes
data
node
network
wireless network
Prior art date
Application number
PCT/US1999/024585
Other languages
English (en)
Other versions
WO2000025485B1 (fr
Inventor
Josef Berger
Itai Aaronson
Original Assignee
Caly Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Caly Corporation filed Critical Caly Corporation
Priority to JP2000578964A priority Critical patent/JP2002529017A/ja
Priority to KR1020017004520A priority patent/KR20010087367A/ko
Priority to BR9913999-5A priority patent/BR9913999A/pt
Priority to EP99971180A priority patent/EP1123608A1/fr
Publication of WO2000025485A1 publication Critical patent/WO2000025485A1/fr
Publication of WO2000025485B1 publication Critical patent/WO2000025485B1/fr
Priority to HK02100837.5A priority patent/HK1039422A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections

Definitions

  • the present invention relates to the field of wireless communications in general and in particular to the field of high capacity broadband wireless networks designed for packet data transmission in the high fre- quency bands of the spectrum.
  • high capacity broadband system is related to a system that operates at transmis- sion rates above Tl (1.5MB/S) or El (2MB/s) , usually up to lOOMB/s or more per link and in frequency range above the 6GHz, typically in the licensed bands at 10.15GHz to 10.65GHz, 24 to 31 GHz and 37 to 41 GHz part of the spectrum. New bands will be opened at 40GHz to 60 GHz as well and might also be available for unlicensed use. In those frequencies, robust transmission is achieved via a clear line of sight (LOS) between the transmitting and receiving radios.
  • LOS line of sight
  • Wireless communication networks enable competi- tive access to fiber, hybrid fiber, coax and twisted pair networks.
  • Low bit rate wireless systems with rates up to Tl (1.5MB/S - US) and El (2MB/s - ETSI) have been developed and deployed. These wireless systems are used in the low part of the spectrum, usually below 6 GHz where the bandwidth allowed to be used is limited. Examples of such systems include cellular systems at 900 MHz 1.8 to 2 GHz, WLL (Wireless Local Loop) at 2.3 GHz and unlicensed wireless systems in the ISM (Industrial, Scientific and Medical) bands at 900 MHz, 2.4 and 5.7GHz. Due to limited bandwidth in these bands, such systems operate in narrow bands and low capacity per link.
  • FIG. 1 A typical state of the art topology for broadband wireless communication network is shown in Fig. 1.
  • Each one of the base stations covers a 360 degrees using 4 sectors of 90 degrees.
  • Two of the base stations are connected via wireless connection to the location of the other base station where a fiber connection transfers the information from all the base stations to a main switch.
  • the main switch acts to create a connection between subscribers in the wireless access covered area as well as other subscribers either in the same area or in remote external areas via fiber trunking system (SONET or SDH) .
  • SONET or SDH fiber trunking system
  • the network is based on Point to Multi Point (PMP) access network connected via point to point (PP) links, such as wireless links 9, 10, or fiber (link 8).
  • PMP Point to Multi Point
  • PP point to point
  • each base station comprises a multiplicity of sectorial antennas that transmit to a well defined fixed sectors such as 19, 20 and 21.
  • sectors 20 will use frequency 122, where adjacent sector 19 will use a different frequency 121, where frequencies 121 and 122 are arbitrary frequen- cies.
  • Sector 21 which belongs to a different base station would be assigned frequency 111 that, in certain conditions, should differ from frequency 122 to avoid signals from sector 21 interfering with the communication in sector 20. However, under the right conditions, frequency 111 could be similar to frequency 121 if no interference is going occur.
  • Many locations do not have LOS, such as SR 18 which is located behind SR 17.
  • Subscriber SR 17 in sector 21 can communicate with subscriber SR 16 in a nearby sector 24 via a circuit which follows the path from SR 17 to BS 11, through link 10 to BS 13, through link 8 to switch 22, and back via link 8, BS 13, link 10, BS 11 to SR 16.
  • subscriber SR 17 in sector 21 can communicate with subscriber SR 23 in sector 20 at a different base station via a circuit assigned by switch 22 from SR 17 to BS 11, through link 10 to BS 13, through link 8 to switch 22, and back via link 8 to BS 13, link 9 to BS 12 to SR 23 in sector 20.
  • a central switch such as an asynchronous transfer mode (ATM) switch 22 may function as the center for the switching fabric through which all the traffic must pass.
  • ATM asynchronous transfer mode
  • the same switch may include additional ports connected to fiber link 7 to a trunking WAN (Wide Area Network) backbone.
  • WAN Wide Area Network
  • a subscriber served by the wireless PMP access system can be connected to the rest of the world.
  • the base station can convert the wireless protocol used for communicating over the air with its subscriber to a standard transmission protocol such as ATM.
  • Data from the base stations to the subscriber radios is transmitted in a broadcast mode via sectorial antennas toward many subscribers located in well defined fixed angle sectors, say for example between 15 degrees to 90 degrees.
  • the data is addressed to specific customers by assigning different addresses to each one of the data packets, using for example a TDMA (Time Division Multiple Access) scheme in a specific broadband frequency.
  • PMP systems assign a specific narrower frequency inside the operational spectral band for each subscriber for the duration of the communication with that subscriber.
  • each base station synchronizes the up link transmission from each one of the multiplicity of subscribers in each sector.
  • the scheduling algorithm defines for each individual subscriber radio the transmission packet timing, and length, at a well defined frequency (TDMA) . This synchronizes the arrival of packets from different subscribers, one after the other, in the base station.
  • TDMA Time Division Multiple Access
  • the base station assigns a specific frequency channel with defined bandwidth for each subscriber based on a request for transmission received on a service channel and priority scheduling algorithm.
  • Other modes of operation such as code division multiple access (CDMA) could also be used for PMP systems.
  • CDMA code division multiple access
  • the advantages of the prior art wireless PMP systems are: 1. Low cost for the subscriber unit. Most of the control and system intelligence is located in the base station.
  • MAC Simple media access control
  • Base station radio has to be located in an elevated location (expensive) to maximize LOS coverage.
  • the base station needs to be connected to the switch via expensive high capacity links, e.g. wireless or fiber OC- 3 or higher.
  • the base station needs to be connected to the switch via expensive high capacity links, e.g. wireless or fiber OC- 3 or higher.
  • Each packet of data needs to be routed all the way to a switch and back, thus consuming large bandwidth resources of the system.
  • the wireless mesh network of the present invention comprises a plurality of nodes, each node comprising a radio frequency transmit circuit and a radio frequency receive circuit.
  • Each node further includes a local port for connection to a user-provided system, including a LAN or a WAN connection, or a computing system.
  • Each node further includes a data processing unit coupled to the transmit and receive circuitry and to the local port for exchanging data among the circuitry and the local port.
  • each node is in line of sight relation to a subset of nodes in the network.
  • the spatial flow deter- mination means for a given node selects from among its subset nodes either for transmission or reception of a data stream, or both.
  • the data processing unit includes extraction means for extracting selected data from an incoming transmission that is targeted for the given node. The remaining data stream is then transmitted to the next node or nodes. Similarly, there is insertion means for inserting data into a stream being transmitted. In this way, an incoming data stream can have data extracted (dropped) into the node and output at its local port, while at the same time the data stream is inserted (added) with data from the given node as it is being transmitted.
  • At least some of the nodes include status information about other nodes in the network.
  • a node has some information about the network. This information feeds into the spatial flow determination means and selects nodes for transmission thereto or reception therefrom based on such information.
  • At least some of the nodes also have means for assessing a characteristic of a received transmission.
  • a means is provided for transmitting information relating to this characteristic to the sending node.
  • the sending node adjusts its transmission parameters in response to such information.
  • the nodes include means for providing connectionless transmission of data, connection-oriented transmission of data, or a combination where one segment of the network is connectionless and another segment is connection-oriented.
  • Fig. 1 is a top plan schematic view of an area covered by three PMP (prior art) base stations.
  • Fig. 2 is a top plan schematic view of a broadband wireless mesh topology network in accord with the current invention.
  • Fig. 3 is a schematic diagram of a TDD (Time Division Duplex) wireless radio that can be used as SR (Subscriber Radio) at the current invention.
  • TDD Time Division Duplex
  • SR Subscriber Radio
  • Fig. 4 is a schematic diagram of the Mesh Radio Network which allows spatial flow of information simultaneously between say node 1 and 4 as well as node 2 and node 0.
  • Fig. 5 is schematic diagram depicting the relationships between the PHY, MAC, and LLC protocol layers.
  • Fig. 6 is a schematic diagram of a mesh of 25 nodes.
  • Fig. 7 is a flow chart of the high level node scheduling FSM implemented by a finite state machine.
  • Fig. 8 is a flow chart of the admission FSM finite state machine process of the mesh network nodes.
  • Fig. 9 is a schematic diagram of a wireless radio mesh network configured as a virtual router with local interface ports at the radio nodes and dynamic spatial route selection capability.
  • the network comprises a multiplicity of subscriber radio (SR) nodes deployed in the vicinity of the customer's premises and communicating with each other as well as a subscriber-provided internal data system such as LAN (Local AREA Network) , WAN (Wide Area Network) or a typical PC. Direct Line Of Sight (LOS) between subscribers exists between each node in the topology and a subset of the nodes.
  • SR subscriber radio
  • LAN Local AREA Network
  • WAN Wide Area Network
  • LOS Direct Line Of Sight
  • the SR node acts as a network node with the ability to receive data packets from neighboring nodes and to analyze the desti- nations of the packets of data.
  • the SR node can drop data addressed to its one or more local ports and add data from its local ports.
  • the SR node directs received data packets addressed to other network nodes as well as packets received from its local ports to its neighboring nodes based on selection of routes available in the network towards the packets final destinations.
  • the nodes constantly receive status information from other nodes, thus allowing them to develop a scheduling mechanism for real time wireless virtual routing of data packets over the mesh network.
  • the mesh network can therefore be viewed as a virtual router, being distributed over a topographically diverse area where the SR local ports are the router ports.
  • An important aspect of the invention is the ability of the nodes to decide data routing of received data packets by sharing status information among themselves via a real time scheduling algorithm.
  • This scheduling algorithm allows the SR node to select available packets routes at each moment. For example, the packets between the same source and destination may travel via multiple different routes or via the same route depending on route availability.
  • the SR node may rearrange the order of certain data packets arriving at different times in order to create a well defined data stream at the local ports.
  • the SR nodes have the ability to study their local area and find those SR nodes with whom they can create a communication link.
  • the SR nodes periodically update their own status information relating to the surrounding nodes with which they have LOS communication.
  • the SR nodes can create directional communication with certain nodes simultaneously as other nodes in the surrounding vicinity communicate with other nodes. This directionality of receiving data and transmitting data is accomplished by a combination of time division access combined with transmission in a selected sectorial region.
  • the selection is accomplished by either by using a fixed angle sectorial antenna (30, 45, 90 degrees), by using beam steering capability via selection of sectorial antennas, or by using a phased array antenna, which could be one-dimensional antenna only for terrestrial use or a two dimensional for terrestrial and very high altitude or outer space use.
  • Each subscriber radio acts as a network node and has the unique capability, per the current invention, to communicate at high frequency (above say 6 GHz) with at least two other SR network nodes with which LOS exists.
  • SR 16 for example may communicate with SR 17, SR 18, SR 19 and SR 20, thus acting as a repeater for an information transmitted say from WAN access BAP-1 (Back Bone Access Point) to SR 18, or from SR 17 to SR 19.
  • the SR network nodes can also add and drop packets of data via a local interface, such as 100/10 Base T, IEEE 1394, or other standard interfaces.
  • the SR may change its frequency channel when it communicates with different SR's around it.
  • LOS Line Of Sight
  • the SR can perform the functionality of bridging and partial routing of data packets. As a result, data can be routed from one SR to another. Thus, an SR should be in line of sight with at least one other SR.
  • This network topology enables the construction of a new type of wireless network where subscriber access is achieved by bypassing LOS obstacles. In Fig.
  • This phenomena is unique to the high frequency millimeter wave MESH network of the current invention, where multiple links operating at the same millimeter wave frequency can operate in the same region where the MAC layer synchronizes their beams to avoid mutual spatial interference.
  • the MAC layer also prevents temporal interference by synchronizing the mutual transmission timing of potentially interfering SR's located in the same area and operating in the same frequency and with the same beam overlapping.
  • the current invention is advantageous in that propagation of these high frequency beams demand direct LOS between nodes. Consequently, all reflected beams are absorbed and thus do not interfere with the network operation.
  • the subscriber radio comprises a MAC layer, per the current invention, that takes into account the network topology in its surroundings, identi- fies the locations of nearby SRs and their addresses.
  • the MAC layer in each SR reads the packets received from each of the SR network nodes around it as well as from the SR local interface port. For packets arriving from its local port, the MAC layer defines each packet's routing based on the packet destination address. It adds more bits of information to be used for FEC (Forward Error Correction) and over the air encryption, if required. Data packets arriving over the air from a nearby SR are analyzed based on their addresses, and are retransmitted or dropped locally.
  • FEC Forward Error Correction
  • a possible arrangement for broadcast transmission from say SR 16 towards SR17 and SR 18 simultaneously could be accomplished by a single transmission where both SR's are located in the same beam footprint or by repeating transmission in the direction of each one of those SR's.
  • This unique combination of wireless packet radio with internal packet data routing and/or bridging capability enables the implementation of the wireless mesh network topology.
  • Route Diversity The MAC layer is also responsible for identifying the routing paths available from its address to the destination address. In the case of routes which are blocked, the MAC layer may route the packets via alternative routes.
  • SR 15 may receive data from BAP 1 via SR 12 and SR 13 or via SR 19 and SR 16, or via SR 21. It can also communicate outside of the network via multiple BAP's such as BAP-1 and BAP- 2. This provides a dramatic increase in network reliability, and resistance to weather rain fading that may block certain paths for a short time.
  • An SR joining the network by using an admitting process will scan the frequency channels as well as the spatially different directions if it is equipped with a beam steering capa- bility. It will try to be accepted to the network. If it is registered in the system as a legitimate network node, the network will allow it to join and will update its information in the other nodes.
  • Channel selection The network may select specific frequency channels for different areas or links.
  • an optimized spectrum allocation could be downloaded from the NMS (Network Management System) based on network data flow information observed and studied by an external system. This input allows better optimization as well as manual definition of the channels used in different areas.
  • the links from SR 12 may be allocated frequency channel 102, where SR 15 may use frequency channel 101 for communicating with SR 21, where channels 101 and 102 are arbitrary frequency bands.
  • the network is designed to operate with a multiplicity of WAN Accesses such as BAP-1 and Bap-2 , shown in Fig. 2. This allows convenient access to the mesh wireless network where all that is needed is adding a SR at the BAP's, versus a PMP architecture where there is a need to continue the backbone trunking system (SONET/SDH) towards the base stations, typically located in topographically elevated locations.
  • SONET/SDH backbone trunking system
  • An advantage over the prior arises from the fact that multiple high-speed trunking connections can now be used to increase the total flow of data in and out of the network, thus dramatically increasing its total throughput capacity. Route diversity in and out of the network is another by-product of the multiple WAN access points.
  • Frequency reuse As a consequence of operation via nearby neighbors, the possibility of frequency reuse is significantly increased. This allows dramatic bandwidth increase versus non-LOS systems at lower frequen- cies ( ⁇ 6 GHz) as well as versus PMP systems where transmission is done into a wide sectorial region.
  • each link can adjust its bit rate to optimize the BER (Bit Error Rate) based on the signal level received at each moment. This is in con- trast to PMP systems where the Bit rate in the sector is defined based on the longest link in the sector.
  • Wireless mesh network availability per the current invention increases significantly versus other topologies (e.g. PMP) due to the shorter distances between the multiplicity of the SRs.
  • Another increase in availability is due to the network's ability to change (increase) the power transmitted at each segment of the network independently of other segments of the network.
  • the network can the increase sensitivity of each segment of the network (and reducing the bit rate) without significant change of total network performance.
  • some links will increase their power to boost signal strength, and may also increase sensitivity by reducing their bit rate to improve reliability.
  • the SR will get its data packets from the same links (maybe at lower bit rate) or from other links which are less influenced by the rain fading.
  • Mesh network reliability The current invention mesh network can operate via multiple routes simultaneously by enabling each SR to receive a stream of packets from multiple directions. Via its MAC layer, the SR can rearrange the order of the arriving data to allow packets arriving via longer routes to be dropped in the right order. As a result of this route balancing capability, the network can operate reliably even when some nodes are non-operational.
  • An increase in local reliability can be implemented by using more than one SR in the same location (node) connecting to the same subscriber LAN.
  • the two SRs can operate simultaneously and route information to the same location. In the case that one SR fails, the second continues to operate with increased bit rate to compensate for the loss of the first radio.
  • Increase WAN access capacity If the capacity from the mesh to the BAP needed to be increased, an additional SR could be added at the same location by connecting its local interface to a second 100 Base T interface of the WAN router located at the BAP.
  • the dual SRs provide an increase in the bit rate from and to the wireless mesh, in addition to providing backup redundancy in case one of them fails.
  • Low orbit satellite and high-flying communication transponders can also be used to communicate with network radios that move slowly in a specified trajectory over the Earth.
  • Those low orbit satellites, or high-flying transponders located in airplanes can act as repeaters/routers and thus enable access to multiple points in the mesh network.
  • the radio may communicate with the satellite by adjusting its beam to scan known trajectories in the sky.
  • Polarization diversity The system may use different signal polarizations (vertical or horizontal) for different sub groups in the same coverage area to increase total capacity and/or improve interference immunity.
  • the SR includes the components as described in the schematic diagram of Fig. 3.
  • the radio uses a time division duplex (TDD) scheme.
  • TDD time division duplex
  • One of the main advantages of using TDD radios in the mesh topology is that a TDD radio can operate asymmetrically, i.e. transmit and receive rates are different, which is better suited for the packet network of this invention. Data packets may flow in different directions and thus higher capacity may be needed for transmission on certain segments in certain directions for higher period of time than in the reverse direction.
  • TDD radios have no diplexer to separate the transmit and receive signals in two different frequencies. Thus, the radio can scan larger a spectrum. By eliminating the diplexer, this reduces the SR cost as compared to FDD schemes which requires a diplexer.
  • the main components of a TDD radio as shown in Fig. 3 are:
  • the local port may include a 10/100Base-T, ATM, IEEE 1394 or a custom interface, for connection to a LAN or WAN or to a computer. In addition power can be provided on the same cable.
  • R20 Cable Interface This provides safety protection and power regulation circuitry.
  • R30 Digital Transmitter This typically comprises standard circuitry known in the art. They include a variable level modulator, FEC encoder and channel synthesis circuitry.
  • R40 Mesh Radio Media Access Controller and Link Layer Controller This layer provides link layer ARQ, packet size adaptation, priority queuing, scheduling and routing of virtual circuits and optional encryption of data from the local port and decryption of data dropped to the local port.
  • R50 Digital Receiver This typically comprises standard circuitry known in the art. They include a digital tuner, variable level demodulator and FEC decoder circuitry.
  • R60 Digital to Analog Converter.
  • R70 Transmit/Receive TDD Switch. This switch together with switch R130 perform the switching of the radio between transmit and receive modes.
  • R80 Analog to Digital Converter.
  • R90 Mixer The mixer.
  • R100 Linear Power Amplifier.
  • R140 Antenna Selection Switch This switch, under the control of the MRMAC routing circuit, performs directional antenna selection to provide spatial flow (direction) control of data stream transmissions; i.e. directed transmissions to and from specific nodes in such a manner that other nearby nodes do not receive such transmissions.
  • ANT1 through ANT5 Antennas These antennas are directional, i.e. sectorial, and provide narrow beam transmission and reception from a selected spatial azimuth, or elevation - in case of satellite communication.
  • Fig. 3 shows five antennas for illustration purposes only.
  • the present invention is intended to support any number of antennas.
  • different circuitry is required to control the relative phase shifts of the elements comprising such an antenna to provide beam steering capability.
  • Directed transmission capability is known in the art. Any equivalent selective transmission scheme, in addition to the above, discusses schemes would work equally well in the present invention.
  • MAC (Media Access Control) Layer The current invention implementation is based on the introduction of a new MAC layer designed and specified to accommodate the wireless mesh network requirement. A summary of the MAC layer operational requirements and the main scheme of operation is given below.
  • Fig. 4 illustrates some of the principles that govern the operation of a radio mesh network, assuming a radio with ability to communicate in a large sector either by scanning its beam or by selectively creating a communication with one of the SRs in its sector, such as by the use of a directional antenna or a phased array antenna as discussed above.
  • the other SRs in the sector that might interfere with the communication are controlled by the MAC layer to remain silent during the scheduled transmission.
  • the current invention high level MAC layer and its main definitions are described below:
  • Each node can choose a spatial direction in which to transmit based on the locations of the receiving nodes in its LOS.
  • the receiv- ing nodes select the direction from which to receive based on the location of the transmitting nodes in its LOS.
  • Each node can transmit only when their transmission cannot cause interference to other transmissions.
  • a transmission schedule established at every node serves to synchronize such transmissions.
  • Radio nodes can transmit concurrently when they will not cause interference.
  • radio node 2 can transmit to radio node 0, while radio node 4 is transmitting to radio node 1.
  • the MRMAC is a set of procedures and algorithms responsible for routing and scheduling packet transmission in the mesh radio network of the present invention. All the radio nodes that participate in the radio mesh network implement the MRMAC functionality. MRMAC is the distributed intelligence that binds a collection of radio nodes into a highly efficient radio packet network.
  • the MRPHY is a radio physical layer which is compatible with the MRMAC and provides the necessary capabilities to allow scheduled transmissions and routing of data packets in a mesh radio network.
  • the MRLLC is the protocol layer responsible for adapting user protocol transfers to the MRMAC. It performs such functions as priority classification, automatic re-transmission requests (ARQ) and packet size adaptations. Protocol Data Units.
  • the MRMAC is a protocol layer that lies between the MRPHY and the MRLLC as described in Fig. 5. Fig. 5 depicts the relationships between the PHY, MAC and LLC protocol layers. MRMAC Requirements. Support of higher layer transport protocols.
  • the MRMAC supports both fixed PDU and variable PDU transport protocols such as ATM, Frame Relay and IP.
  • the MRMAC provides QoS (quality of service) provisions suitable for ATM and IP. Transfer types. Both asynchronous and isochronous transfers are supported.
  • the MRMAC supports both fixed size and variable size packet transfers.
  • the minimal packet size is 48 octets and the maximum packet size is 2000 octets.
  • the MRMAC throughput is at least 80% of the MRPHY capacity.
  • the throughput is at least 80% of the WAN link capacity.
  • the isochronous delay for any node in the sub-net to and from the BAP is less than 6ms.
  • the asynchronous delay is less than 15ms.
  • Delay variation Delay variation for isochro-
  • the MRMAC accommodates radio nodes joining and leaving the radio mesh network without causing undue disruption.
  • Radio nodes should be able to self organize in a sufficiently optimized manner, without the need for external intervention.
  • the radio nodes shall have interfaces that allow a centralized control function to further optimize their topology and routing selection. Path diversity. Available alternative physical paths shall be utilized for redundancy and load balancing. Plug and Play. Installation of new nodes shall not require alignment of provisioning by the field installer.
  • Each node contains a map of all other nodes in the sub-net with which it can have direct (LOS) communication.
  • the information includes:
  • Each node has a route table describing how to get a packet to any MAC destination.
  • the information includes:
  • each node After initialization of the nodes and the radio mesh network, each node possesses the information described in Tables 1 and 2. Packet queues are formed at each node from both node-originated traffic and traffic that is being forwarded through the node at its local port. A node will consult its tables for each packet destination and decide, based on scheduled handshakes and preference weighting, where a packet transmission is to go and when such transmission is to be attempted. At the scheduled handshake times, the radio nodes arrive at a mutual decision and the transmission is scheduled. That decision will take into account potential interference between nodes. It is beneficial to include the neighbors' scheduled handshakes in each node. This will expedite interference avoidance procedures.
  • Handshake The handshake procedure involves transmission of 62 octets from originator to responder, another 64 octets from responder to originator and a final 62-octet packet from originator to responder. There will be two octets of guard time between transmissions.
  • the 62-octet handshake packet includes FEC and other overhead. Total time for handshake will be 192-octet that is equal to 11.71875 (Sec.
  • the frequency of handshakes will depend on the number of neighbors, load and other factors. It is clear that an optimum frequency will be maintained in order to maximize throughput. Payload packet size.
  • Asynchronous transfer packet size will vary between 72 and 1784 octets inclusive of FEC and other overhead.
  • Isochronous packet size will vary between 64 and 256 octets inclusive of FEC and overhead.
  • the timing ranges will be: Table 3
  • Table 3 indicates that if every packet transfer requires a handshake, the throughput through a node will average well below 90% of the link. Clearly some degree of pre-scheduling will be required. On the other hand, if we assume some queuing of say 500 Sec, the throughput will be more reasonable.
  • Handshake timing will vary based on the size of the queues of the neighboring nodes.
  • Packet transfers will carry the same type of information as the handshake process, the periodic handshakes need to be scheduled only when the link between neighboring nodes quiet uses. Preference weights. Each node can maintain its route preference weights to reflect route conditions with a good degree of accuracy. Long term monitoring processes that are external to the radio mesh network will be used to further optimize the routing preference weights.
  • Handshake scheduling We would like to have a simple scheme for scheduling handshakes between near neighbors, let us first assume that we need to support variable length packets. We are immediately faced with a problem. If the handshakes with near neighbors are pre-scheduled, then the interval has to allow the maximum-length packet transfer. However, that may cause the nodes to waste much time, i.e. bandwidth, between handshakes when some of the handshake intervals do not require packet transfers.
  • the preferred approach is to have handshakes scheduled at a high frequency, but to allow nodes to miss handshakes.
  • the handshake schedul- ing-algorithm of the invention will allow a radio node to miss its appointment with some neighbors when it is involved in a packet transfer with some other neighbor. The affected node will continue with its schedule and the tardy node will resume its handshaking schedule, when its packet transfer is complete.
  • Fig. 6 depicts a mesh of 25 nodes with a maximum connectivity of eight, each node is connected with a maximum of eight neighboring nodes. Assume that each node handshakes with one of its neighbors every T seconds and that a full handshake cycle takes 8r seconds. To satisfy the isochronous requirements we shall make 8 ⁇ equal to some integer multiple of 125 ⁇ seconds.
  • Table 4 lists a possible handshaking schedule for the mesh depicted in Fig. 6.
  • the scheduling algorithm will prevent a node from missing a neighbor too many times.
  • Fig. 7 shows a finite state machine chart. Each state and transition is explained below:
  • the IdleAction() is a procedure that is executed upon entry to the Idle state and performs such housekeeping tasks as timer initialization, table initialization, etc.
  • a neighbor appointment schedule timer triggers this transition. This transition will happen for a neighbor appointment that had been previously scheduled for receiving a packet from the neighboring node.
  • a neighbor appointment schedule timer triggers this transition. This transition will happen for a neighbor appointment that had been previously scheduled for transmitting a packet to the neighboring node.
  • the MRLLC triggers this transition by using the Mac.Tx() procedure to request transmission of a packet.
  • the QueuePkt() procedure performs the queuing of the packet according to the required priority.
  • a preferred route is associated with the packet based on the routing and status information gathered from the radio mesh. This route is the assumed to be the best route based on load factors that exist in the neighboring nodes. The quality of the radio links with the neighbors, as well as the priority of the packet, are taken into account when the preferred route is chosen.
  • the nature of the requested transfer isochronous or asynchronous, determines the scheduling priority.
  • AO > Al.
  • a neighbor appointment schedule timer triggers this transition. This transition will happen for a neighbor appointment that had been previously scheduled for exchange of status with a neighboring node.
  • State Al the HANDSHAKE state. In this state, the node engages in a status exchange with a neighboring node. The exchange updates both nodes' view of the other's status, including packet queues, route availabil- ity and future schedules.
  • the HandShakeActions() procedure is performed upon entry into this state and performs all the relevant housekeeping tasks.
  • the procedures ScheduleRx() and Schedule Tx() may be invoked to schedule future appointments for transmission or reception of packets.
  • the UpdateNeighborTables () is invoked to record the updated neighbor status information. State A2 the RECEIVE state. A node enters this state when it is ready to receive a previously scheduled packet transmission.
  • the procedure ReceiveActions () is invoked to perform the necessary housekeeping functions such as buffer allocation and timer maintenance.
  • the Link.IndQ procedure is invoked to indicate to the MRLLC that a packet has arrived.
  • the UpdateNeighborTables() procedure is invoked to record this and to possibly schedule another appointment with this neighbor.
  • the Link.IndQ procedure is invoked to indicate to the MRLLC that a packet has arrived.
  • A3 the TRANSMIT state.
  • a node enters this state when a scheduled appointment to transmit a packet to a neighbor, has arrived.
  • the TransmitActions () procedure is invoked to perform the necessary housekeeping functions such as buffer and timer management.
  • UpdateNeighbortables() procedure in invoked to record the failure and possibly schedule a future attempt to transmit the packet.
  • A3 > AOb. This transition is triggered by a successful transmission, which did not include the exchange of updated status information.
  • the mesh radio network incorporates a distributed admission protocol.
  • the purpose of the admission protocol is to enable radio nodes to join the network and become an efficient participant in the mesh- radio packet-transfers, without interfering with ongoing packet transfers.
  • a radio node When a radio node powers-up and discovers that it is not affiliated with a radio mesh, it shall transition into the Admission-Pending State.
  • the radio node consults its configuration database that is stored in non-volatile RAM to determine its mesh radio affiliation.
  • the radio node In the Admission-Pending State, the radio node shall listen for admission invitation signals from potential neighbors. Once the radio receives an invitation signal, it will begin exchanging status information with its first neighbor and through it, learn about the schedules of the immediate neighborhood and thus begin to exchange status information with additional neighbors. Once the radio node accumulates sufficient routing and scheduling knowledge through its exchanges with its neighbors, it will become ready for normal packet transfers and thus transition to the normal scheduling state.
  • Fig. 8 shows the sequencing which occurs when an unaffiliated node powers up and attempts to join the network. Following is a description of the states and the transitions comprising the admission finite state machine which defines the sequence.
  • the radio node begins by scanning the neighborhood for admission invitation signals. It then attempts to connect with a neighbor and continues learning the neighborhood by establishing status exchange schedules through its first contact. 10 LISTEN. This is the initial state in the admission FSM, an unaffiliated radio node enters this state from the power-up process.
  • the ListenActions() procedure performs housekeeping functions such as table initialization and setting up the scanning process in the frequency and spatial domains.
  • the scan timer triggers this transition.
  • the radio node listens for an invitation signal in a spatial azimuth at a given frequency for a sufficient length of time. Having not received an invitation signal, it has to scan to the next frequency and azimuth.
  • the radio node receives an invita- tion which includes a schedule for the first exchange with the inviting radio node.
  • the radio node enters this state upon reception of an invitation signal from its first neigh- bor. An exchange of data from the first neighbor to the new node occurs.
  • ConnectActionsQ procedure based on the initial schedule received as part of the invitation signal.
  • the radio node attempts to exchange status and route information with its neighbor.
  • the radio node updates its neighbor and route tables based on the information gathered in the first exchange and transitions to the LEARN state. 13 LEARN.
  • the radio node enters this state after the successful completion of its first exchange with a neighbor.
  • the LearnActions () procedure uses the route, status and schedule information that was gathered in the first exchange to schedule subsequent exchanges with other radio nodes in the neighborhood.
  • the exchange timer triggers this transition.
  • the radio node performs an initial exchange with a potential new neighbor through some other neighbor with whom it has already established a schedule.
  • the conclusion of the learning process triggers this transition to the node scheduling FSM of Fig. 7.
  • the radio node has finished the admission sequence and is now part of the radio mesh, and is ready to begin normal packet transfer.
  • Fig. 9 depicts the radio mesh as a virtual router with an interface at each radio node.
  • the radio mesh presents an external view of a router and the details of transferring packets between the radio nodes are managed by the mesh radio internal protocols.
  • Each one of the radio nodes has a local port and is capable of narrow beam transmission to neighbors to which it has line of sight (LOS) . This is shown by lines between the nodes.
  • LOS line of sight
  • the fan shape indicates node radio coverage, and the radial lines within the fan indicate directional antenna beam possibilities existing between the radial lines.
  • the external behavior of the radio mesh (also referred to as a "virtual router") is compliant with IETF RFC-1812 (Requirements for IP Version 4 Routers) .
  • the virtual router uses the Mesh Radio Media Access Control (MRMAC) protocol and the Mesh Radio Link Layer Control (MRLLC) protocol, to transfer IP packets between its interfaces.
  • MRMAC Mesh Radio Media Access Control
  • MLLC Mesh Radio Link Layer Control
  • the MRMAC incorporates a powerful mechanism for scheduling packet transfers according to neighboring node load conditions as well as IP type of service and priority.
  • VRMR Virtual Radio Mesh Router
  • BGP-4 IETF RFC-1771
  • the MRMAC incorporates a powerful mechanism for scheduling packet transfers according to radio link availability as well as IP type of service and priority.
  • the Virtual Radio Mesh Router uses standard routing protocols such as BGP-4 (IETF RFC-1771) to learn from its peers the availability of alternative routes.
  • BGP-4 IETF RFC-1771
  • Line of sight can be achieved via nearby neighboring radios, by routing packets of data via multiple hops.
  • the coverage area could be significantly higher than in point to multi point cell topology.
  • the wireless mesh network bit rate capacity and availability increases as subscriber density increases. Each connection can deliver larger amounts of data due to shorter distances between the radios. The radio-received signal to noise ratio is improved and higher modulation techniques can be used to enable higher bit rate transfers. Multiple trunking.
  • An SR network node can act as WAN access point via its local interface port, via 100 Base T for example. This connectivity increases total network capacity by simultaneously transmitting data in and out of the mesh via the WAN access point. (See Fig.
  • the access point may include a standard Internet® router with at least one port connected to the radio network node via a 100 base T interface and other nodes connected to the WAN area via OC-3 or OC-48 IP over ATM.
  • Route diversity is achieved via the use a MAC layer which can route the packets between the radios based on the available route in the network.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)
  • Radio Relay Systems (AREA)

Abstract

Cette invention porte sur un réseau sans fil, large bande, à topologie maillée, optimisé pour la transmission de données, Internet®, les sorties vocales et multimédia vers des consommateurs, des petits bureaux et des grands locaux de compagnies utilisant des interfaces de données telles que l'interface standard IP et l'interface de bus numérique multimédia consommateur (BAP-1, BAP-2). Cette invention comprend des émetteurs-récepteurs (SR10 SR21) sans fil de locaux clients qui ont la capacité d'ajouter et d'éliminer des données par l'interface standard, et d'acheminer les données entre des noeuds sans fil multiples à l'aide d'une diversité d'itinéraires qui améliore la disponibilité, la fiabilité du réseau maillé et favorise l'équilibrage des charges.
PCT/US1999/024585 1998-10-23 1999-10-20 Reseau a topologie maillee sans fil large bande WO2000025485A1 (fr)

Priority Applications (5)

Application Number Priority Date Filing Date Title
JP2000578964A JP2002529017A (ja) 1998-10-23 1999-10-20 広帯域無線メッシュ型トポロジーネットワーク
KR1020017004520A KR20010087367A (ko) 1998-10-23 1999-10-20 광대역 무선 망사형 토폴로지 네트워크
BR9913999-5A BR9913999A (pt) 1998-10-23 1999-10-20 Rede sem fio de banda larga de alta capacidade
EP99971180A EP1123608A1 (fr) 1998-10-23 1999-10-20 Reseau a topologie maillee sans fil large bande
HK02100837.5A HK1039422A1 (zh) 1998-10-23 2002-02-04 寬帶無線網狀拓撲網

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US10547698P 1998-10-23 1998-10-23
US60/105,476 1998-10-23
US18766598A 1998-11-05 1998-11-05
US09/187,665 1998-11-05

Publications (2)

Publication Number Publication Date
WO2000025485A1 true WO2000025485A1 (fr) 2000-05-04
WO2000025485B1 WO2000025485B1 (fr) 2000-06-15

Family

ID=26802630

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1999/024585 WO2000025485A1 (fr) 1998-10-23 1999-10-20 Reseau a topologie maillee sans fil large bande

Country Status (7)

Country Link
EP (1) EP1123608A1 (fr)
JP (1) JP2002529017A (fr)
KR (1) KR20010087367A (fr)
CN (1) CN1321381A (fr)
BR (1) BR9913999A (fr)
HK (1) HK1039422A1 (fr)
WO (1) WO2000025485A1 (fr)

Cited By (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6462717B1 (en) 2001-08-10 2002-10-08 Caly Corporation Enclosure for microwave radio transceiver with integral refractive antenna
US6553020B1 (en) 1996-12-18 2003-04-22 Radiant Networks Plc Communications system and method
US6583767B1 (en) 1998-06-09 2003-06-24 Radiant Networks Plc Transmitter, receiver and transceiver apparatus
DE10220749A1 (de) * 2002-02-07 2003-08-28 Gerd Kaap Drahtloser lokaler multimedialer Zugang
EP1402688A2 (fr) * 2000-10-30 2004-03-31 Radiant Networks Plc Procede de jointure permettant d'admettre un noeud dans un reseau maille sans fil
US7746816B2 (en) 2003-03-13 2010-06-29 Qualcomm Incorporated Method and system for a power control in a communication system
US7769040B2 (en) * 2000-12-29 2010-08-03 Tropos Networks, Inc. Multi-channel mesh network
US8032124B2 (en) 2007-02-28 2011-10-04 Microsoft Corporation Health-related opportunistic networking
US8165148B2 (en) 2003-01-13 2012-04-24 Qualcomm Incorporated System and method for rate assignment
US8285259B2 (en) 2007-05-29 2012-10-09 Microsoft Corporation Resource aggregation in an opportunistic network
US8315327B2 (en) 2000-06-13 2012-11-20 Aloft Media, Llc Apparatus for transmitting a signal including transmit data to a multiple-input capable node
US8504054B2 (en) 2002-09-10 2013-08-06 Qualcomm Incorporated System and method for multilevel scheduling
US8787180B2 (en) 2002-09-10 2014-07-22 Qualcomm Incorporated System and method for rate assignment
US20150242244A1 (en) * 2004-08-20 2015-08-27 Adaptive Computing Enterprises, Inc. System and Method For a Workload Management and Scheduling Module to Manage Access to a Compute Environment According to Local and Non-Local User Identity Information
US9778959B2 (en) 2004-03-13 2017-10-03 Iii Holdings 12, Llc System and method of performing a pre-reservation analysis to yield an improved fit of workload with the compute environment
US9785479B2 (en) 2004-03-13 2017-10-10 Iii Holdings 12, Llc Co-allocating a reservation spanning different compute resources types
US9886322B2 (en) 2004-03-13 2018-02-06 Iii Holdings 12, Llc System and method for providing advanced reservations in a compute environment
US9959141B2 (en) 2004-03-13 2018-05-01 Iii Holdings 12, Llc System and method of providing a self-optimizing reservation in space of compute resources
US9959140B2 (en) 2004-03-13 2018-05-01 Iii Holdings 12, Llc System and method of co-allocating a reservation spanning different compute resources types
US10951487B2 (en) 2004-06-18 2021-03-16 Iii Holdings 12, Llc System and method for providing dynamic provisioning within a compute environment
US11494235B2 (en) 2004-11-08 2022-11-08 Iii Holdings 12, Llc System and method of providing system jobs within a compute environment
US11496415B2 (en) 2005-04-07 2022-11-08 Iii Holdings 12, Llc On-demand access to compute resources
US11522952B2 (en) 2007-09-24 2022-12-06 The Research Foundation For The State University Of New York Automatic clustering for self-organizing grids
US11526304B2 (en) 2009-10-30 2022-12-13 Iii Holdings 2, Llc Memcached server functionality in a cluster of data processing nodes
US11650857B2 (en) 2006-03-16 2023-05-16 Iii Holdings 12, Llc System and method for managing a hybrid computer environment
US11658916B2 (en) 2005-03-16 2023-05-23 Iii Holdings 12, Llc Simple integration of an on-demand compute environment
US11720290B2 (en) 2009-10-30 2023-08-08 Iii Holdings 2, Llc Memcached server functionality in a cluster of data processing nodes

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7995489B2 (en) * 2004-06-14 2011-08-09 The Boeing Company Topology and quality of service management apparatus and methods for communication networks
CN100417118C (zh) * 2005-10-28 2008-09-03 华为技术有限公司 一种无线网状网中网络移动节点的位置更新系统和方法
CN101150834B (zh) * 2006-09-20 2014-03-26 上海贝尔阿尔卡特股份有限公司 用于拓扑学习和更新的方法和装置
CN101394270B (zh) * 2008-09-27 2011-01-19 上海交通大学 基于模块化路由的无线网状网络链路层加密方法
US9247549B2 (en) 2012-01-25 2016-01-26 Electronics And Telecommunications Research Institute Apparatus and method for SHF/EHF band wireless transmission on multi-level cell configuration
CN104729007B (zh) * 2013-12-24 2018-04-13 珠海格力电器股份有限公司 空调系统中各个连接点的信息处理方法及装置
US10942251B2 (en) 2014-09-03 2021-03-09 CloudLeaf, Inc. Asset location and management system with distributed processing
US10681490B2 (en) 2014-09-03 2020-06-09 CloudLeaf, Inc. Events based asset location and management system
CA2959044C (fr) * 2014-09-03 2021-10-26 CloudLeaf, Inc. Systemes, procedes et dispositifs de determination d'etat d'actifs
US11436544B2 (en) 2014-09-03 2022-09-06 CloudLeaf, Inc. System for managing an industrial workflow
TWI784524B (zh) * 2021-05-17 2022-11-21 淡江大學學校財團法人淡江大學 智慧型集線器

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5353333A (en) * 1992-12-30 1994-10-04 At&T Bell Laboratories Small wireless telecommunications system
US5642353A (en) * 1991-12-12 1997-06-24 Arraycomm, Incorporated Spatial division multiple access wireless communication systems
US5719868A (en) * 1995-10-05 1998-02-17 Rockwell International Dynamic distributed, multi-channel time division multiple access slot assignment method for a network of nodes
US5787080A (en) * 1996-06-03 1998-07-28 Philips Electronics North America Corporation Method and apparatus for reservation-based wireless-ATM local area network
US6016313A (en) * 1996-11-07 2000-01-18 Wavtrace, Inc. System and method for broadband millimeter wave data communication

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5642353A (en) * 1991-12-12 1997-06-24 Arraycomm, Incorporated Spatial division multiple access wireless communication systems
US5353333A (en) * 1992-12-30 1994-10-04 At&T Bell Laboratories Small wireless telecommunications system
US5719868A (en) * 1995-10-05 1998-02-17 Rockwell International Dynamic distributed, multi-channel time division multiple access slot assignment method for a network of nodes
US5787080A (en) * 1996-06-03 1998-07-28 Philips Electronics North America Corporation Method and apparatus for reservation-based wireless-ATM local area network
US6016313A (en) * 1996-11-07 2000-01-18 Wavtrace, Inc. System and method for broadband millimeter wave data communication

Cited By (75)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7061883B2 (en) 1996-12-18 2006-06-13 Radiant Networks Plc Communications system and method
US6553020B1 (en) 1996-12-18 2003-04-22 Radiant Networks Plc Communications system and method
US7099297B2 (en) 1996-12-18 2006-08-29 Radiant Networks Pc Communications system and method
US7082112B2 (en) 1996-12-18 2006-07-25 Radiant Networks Plc Communications system and method
US6583767B1 (en) 1998-06-09 2003-06-24 Radiant Networks Plc Transmitter, receiver and transceiver apparatus
US9401783B1 (en) 2000-06-13 2016-07-26 Comcast Cable Communications, Llc Transmission of data to multiple nodes
US9515788B2 (en) 2000-06-13 2016-12-06 Comcast Cable Communications, Llc Originator and recipient based transmissions in wireless communications
US9209871B2 (en) 2000-06-13 2015-12-08 Comcast Cable Communications, Llc Network communication using diversity
US9197297B2 (en) 2000-06-13 2015-11-24 Comcast Cable Communications, Llc Network communication using diversity
USRE45807E1 (en) 2000-06-13 2015-11-17 Comcast Cable Communications, Llc Apparatus for transmitting a signal including transmit data to a multiple-input capable node
US10349332B2 (en) 2000-06-13 2019-07-09 Comcast Cable Communications, Llc Network communication using selected resources
US10257765B2 (en) 2000-06-13 2019-04-09 Comcast Cable Communications, Llc Transmission of OFDM symbols
USRE45775E1 (en) 2000-06-13 2015-10-20 Comcast Cable Communications, Llc Method and system for robust, secure, and high-efficiency voice and packet transmission over ad-hoc, mesh, and MIMO communication networks
US9722842B2 (en) 2000-06-13 2017-08-01 Comcast Cable Communications, Llc Transmission of data using a plurality of radio frequency channels
US9820209B1 (en) 2000-06-13 2017-11-14 Comcast Cable Communications, Llc Data routing for OFDM transmissions
US9106286B2 (en) 2000-06-13 2015-08-11 Comcast Cable Communications, Llc Network communication using diversity
US9356666B1 (en) 2000-06-13 2016-05-31 Comcast Cable Communications, Llc Originator and recipient based transmissions in wireless communications
US9654323B2 (en) 2000-06-13 2017-05-16 Comcast Cable Communications, Llc Data routing for OFDM transmission based on observed node capacities
US8315327B2 (en) 2000-06-13 2012-11-20 Aloft Media, Llc Apparatus for transmitting a signal including transmit data to a multiple-input capable node
US8315326B2 (en) 2000-06-13 2012-11-20 Aloft Media, Llc Apparatus for generating at least one signal based on at least one aspect of at least two received signals
US9391745B2 (en) 2000-06-13 2016-07-12 Comcast Cable Communications, Llc Multi-user transmissions
US8451929B2 (en) 2000-06-13 2013-05-28 Aloft Media, Llc Apparatus for calculating weights associated with a received signal and applying the weights to transmit data
US8451928B2 (en) 2000-06-13 2013-05-28 Aloft Media, Llc Apparatus for calculating weights associated with a first signal and applying the weights to a second signal
US9344233B2 (en) 2000-06-13 2016-05-17 Comcast Cable Communications, Llc Originator and recipient based transmissions in wireless communications
US6850502B1 (en) * 2000-10-30 2005-02-01 Radiant Networks, Plc Join process method for admitting a node to a wireless mesh network
CN100391194C (zh) * 2000-10-30 2008-05-28 英特尔公司 用于无线网孔状网络准许加入节点的加入过程方法
EP1402688A4 (fr) * 2000-10-30 2010-07-14 Intel Corp Procede de jointure permettant d'admettre un noeud dans un reseau maille sans fil
EP1402688A2 (fr) * 2000-10-30 2004-03-31 Radiant Networks Plc Procede de jointure permettant d'admettre un noeud dans un reseau maille sans fil
JP2004528743A (ja) * 2000-10-30 2004-09-16 ラディアント　ネットワークス　ピーエルシー ノードをワイヤレス・メッシュ・ネットワークに入場許可するための結合プロセス方法
US7769040B2 (en) * 2000-12-29 2010-08-03 Tropos Networks, Inc. Multi-channel mesh network
US8363744B2 (en) 2001-06-10 2013-01-29 Aloft Media, Llc Method and system for robust, secure, and high-efficiency voice and packet transmission over ad-hoc, mesh, and MIMO communication networks
US6462717B1 (en) 2001-08-10 2002-10-08 Caly Corporation Enclosure for microwave radio transceiver with integral refractive antenna
DE10220749A1 (de) * 2002-02-07 2003-08-28 Gerd Kaap Drahtloser lokaler multimedialer Zugang
US8504054B2 (en) 2002-09-10 2013-08-06 Qualcomm Incorporated System and method for multilevel scheduling
US8787180B2 (en) 2002-09-10 2014-07-22 Qualcomm Incorporated System and method for rate assignment
US8504047B2 (en) 2002-09-10 2013-08-06 Qualcomm Incorporated System and method for multilevel scheduling
US8165148B2 (en) 2003-01-13 2012-04-24 Qualcomm Incorporated System and method for rate assignment
US8514832B2 (en) 2003-03-13 2013-08-20 Qualcomm Incorporated Methods and apparatus enabling increased throughput on the reverse link
US7746816B2 (en) 2003-03-13 2010-06-29 Qualcomm Incorporated Method and system for a power control in a communication system
US10445148B2 (en) 2004-03-13 2019-10-15 Iii Holdings 12, Llc System and method of performing a pre-reservation analysis to yield an improved fit of workload with the compute environment
US11960937B2 (en) 2004-03-13 2024-04-16 Iii Holdings 12, Llc System and method for an optimizing reservation in time of compute resources based on prioritization function and reservation policy parameter
US11467883B2 (en) 2004-03-13 2022-10-11 Iii Holdings 12, Llc Co-allocating a reservation spanning different compute resources types
US10871999B2 (en) 2004-03-13 2020-12-22 Iii Holdings 12, Llc System and method for a self-optimizing reservation in time of compute resources
US9886322B2 (en) 2004-03-13 2018-02-06 Iii Holdings 12, Llc System and method for providing advanced reservations in a compute environment
US9959141B2 (en) 2004-03-13 2018-05-01 Iii Holdings 12, Llc System and method of providing a self-optimizing reservation in space of compute resources
US9959140B2 (en) 2004-03-13 2018-05-01 Iii Holdings 12, Llc System and method of co-allocating a reservation spanning different compute resources types
US9785479B2 (en) 2004-03-13 2017-10-10 Iii Holdings 12, Llc Co-allocating a reservation spanning different compute resources types
US9778959B2 (en) 2004-03-13 2017-10-03 Iii Holdings 12, Llc System and method of performing a pre-reservation analysis to yield an improved fit of workload with the compute environment
US10733028B2 (en) 2004-03-13 2020-08-04 Iii Holdings 12, Llc Co-allocating a reservation spanning different compute resources types
US10951487B2 (en) 2004-06-18 2021-03-16 Iii Holdings 12, Llc System and method for providing dynamic provisioning within a compute environment
US11652706B2 (en) 2004-06-18 2023-05-16 Iii Holdings 12, Llc System and method for providing dynamic provisioning within a compute environment
US20150242244A1 (en) * 2004-08-20 2015-08-27 Adaptive Computing Enterprises, Inc. System and Method For a Workload Management and Scheduling Module to Manage Access to a Compute Environment According to Local and Non-Local User Identity Information
US10379909B2 (en) * 2004-08-20 2019-08-13 Iii Holdings 12, Llc System and method for a workload management and scheduling module to manage access to a compute environment according to local and non-local user identity information
US11630704B2 (en) 2004-08-20 2023-04-18 Iii Holdings 12, Llc System and method for a workload management and scheduling module to manage access to a compute environment according to local and non-local user identity information
US11494235B2 (en) 2004-11-08 2022-11-08 Iii Holdings 12, Llc System and method of providing system jobs within a compute environment
US11656907B2 (en) 2004-11-08 2023-05-23 Iii Holdings 12, Llc System and method of providing system jobs within a compute environment
US11886915B2 (en) 2004-11-08 2024-01-30 Iii Holdings 12, Llc System and method of providing system jobs within a compute environment
US11861404B2 (en) 2004-11-08 2024-01-02 Iii Holdings 12, Llc System and method of providing system jobs within a compute environment
US11762694B2 (en) 2004-11-08 2023-09-19 Iii Holdings 12, Llc System and method of providing system jobs within a compute environment
US11709709B2 (en) 2004-11-08 2023-07-25 Iii Holdings 12, Llc System and method of providing system jobs within a compute environment
US11537434B2 (en) 2004-11-08 2022-12-27 Iii Holdings 12, Llc System and method of providing system jobs within a compute environment
US11537435B2 (en) 2004-11-08 2022-12-27 Iii Holdings 12, Llc System and method of providing system jobs within a compute environment
US11658916B2 (en) 2005-03-16 2023-05-23 Iii Holdings 12, Llc Simple integration of an on-demand compute environment
US11831564B2 (en) 2005-04-07 2023-11-28 Iii Holdings 12, Llc On-demand access to compute resources
US11496415B2 (en) 2005-04-07 2022-11-08 Iii Holdings 12, Llc On-demand access to compute resources
US11533274B2 (en) 2005-04-07 2022-12-20 Iii Holdings 12, Llc On-demand access to compute resources
US11765101B2 (en) 2005-04-07 2023-09-19 Iii Holdings 12, Llc On-demand access to compute resources
US11522811B2 (en) 2005-04-07 2022-12-06 Iii Holdings 12, Llc On-demand access to compute resources
US11650857B2 (en) 2006-03-16 2023-05-16 Iii Holdings 12, Llc System and method for managing a hybrid computer environment
US8260272B2 (en) 2007-02-28 2012-09-04 Microsoft Corporation Health-related opportunistic networking
US8032124B2 (en) 2007-02-28 2011-10-04 Microsoft Corporation Health-related opportunistic networking
US8285259B2 (en) 2007-05-29 2012-10-09 Microsoft Corporation Resource aggregation in an opportunistic network
US11522952B2 (en) 2007-09-24 2022-12-06 The Research Foundation For The State University Of New York Automatic clustering for self-organizing grids
US11720290B2 (en) 2009-10-30 2023-08-08 Iii Holdings 2, Llc Memcached server functionality in a cluster of data processing nodes
US11526304B2 (en) 2009-10-30 2022-12-13 Iii Holdings 2, Llc Memcached server functionality in a cluster of data processing nodes

Also Published As

Publication number Publication date
EP1123608A1 (fr) 2001-08-16
WO2000025485B1 (fr) 2000-06-15
BR9913999A (pt) 2001-07-03
HK1039422A1 (zh) 2002-04-19
KR20010087367A (ko) 2001-09-15
CN1321381A (zh) 2001-11-07
JP2002529017A (ja) 2002-09-03

Similar Documents

Publication Publication Date Title
EP0999717A2 (fr) Réseau à large bande avec une topologie maillée
EP1123608A1 (fr) Reseau a topologie maillee sans fil large bande
KR100591884B1 (ko) 동적 비대칭을 채택한 시분할 이중화 시스템에서 효율극대화 시스템 및 방법
US7433332B2 (en) Managed microcell wireless mesh network architecture
AU751788B2 (en) A wireless system for providing symmetrical, bidirectional broadband telecommunications and multimedia services employing a computer-controlled radio system
CA2723009C (fr) Reseau maille sans fil et noeud de reseau
KR100532073B1 (ko) 광대역 밀리미터파 데이터 통신을 위한 시스템과 방법
US20010045914A1 (en) Device and system for providing a wireless high-speed communications network
IL146722A (en) Communication protocol for a data unit especially in wireless network topology networks
CA2270830A1 (fr) Station cellulaire de base a acces radio multipoint integre et liaison intercellulaire
WO2001024600A9 (fr) Agencement de reseau, station pour commutation hertzienne et unite de port les concernant
Grondalen Next generation broadband wireless access systems
EP0993721A1 (fr) Reseau de radiotransmission
Ohata et al. Bi-directional multimedia satellite communication system using ultrasmall user terminals
MXPA99004266A (en) System and method for broadband millimeter wave data communication
RU2001113741A (ru) Широкополосная беспроводная сотовая топологическая сеть связи

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 99811658.0

Country of ref document: CN

AK Designated states

Kind code of ref document: A1

Designated state(s): BR CN IL JP KR RU

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

AK Designated states

Kind code of ref document: B1

Designated state(s): BR CN IL JP KR RU

AL Designated countries for regional patents

Kind code of ref document: B1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

B Later publication of amended claims
121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 1999971180

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 1020017004520

Country of ref document: KR

WWE Wipo information: entry into national phase

Ref document number: 142615

Country of ref document: IL

ENP Entry into the national phase

Ref document number: 2000 578964

Country of ref document: JP

Kind code of ref document: A

WWP Wipo information: published in national office

Ref document number: 1999971180

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1020017004520

Country of ref document: KR

WWW Wipo information: withdrawn in national office

Ref document number: 1999971180

Country of ref document: EP

WWW Wipo information: withdrawn in national office

Ref document number: 1020017004520

Country of ref document: KR