KR20010087367A - Broadband wireless mesh topology network - Google Patents

Abstract

A broadband wireless network based on a mesh topology is a neighborhood, a small company and a large corporation predicated on the use of data interface such as IP standard interface and neighboring multimedia digital bus interface (BAP-1, BAP-2) , Voice and multimedia transports. Neighbors use wireless transport radio transceivers (SR 10 to SR 21) to add and drop data through standard interfaces, as well as improve the availability and reliability of networked networks using router transport, It is assumed to route the data.

Description

Broadband wireless mesh topology network {BROADBAND WIRELESS MESH TOPOLOGY NETWORK}

A high-capacity broadband system has a transmission rate per link of at least T1 (1.5 MB / s) or E1 (2 MB / s), typically at least 100 MB / s, and a frequency range of at least 6 GHz, typically 10.15 to 10.65 GHz, 24 to 31 GHz, and 37 to 41 GHz spectrum. Furthermore, the new band will be open at 40 to 60 GHz and will be available for unlicensed use. At this frequency, strong transmission is achieved through a clear line of sight (LOS) existing between the transmitting and receiving radios.

Wireless communication networks enable competitive access to fiber optics, hybrid fiber optics, coaxial cable, and twisted pair networks. A low bit rate wireless system having a maximum T1 (1.5 MB / s) and E1 (2 MB / s) bit rate has been developed and used. This wireless system is used in low-spectral areas below 6 GHz, where the licensed bandwidth is generally limited. Examples of such systems include a 900 MHz, 1.8 to 2 GHz cell-based system, a 2.3 GHz Wireless Local Loop (WLL), and a 900 MHz, 2.4 and 5.7 GHz Industrial, Scientific and Medical (ISM) There is a licensed wireless system. Because of the limited bandwidth within these bands, the systems operate at narrow bandwidth and low capacity per link. The demand for high capacity (1 to 2 MB / s or more) is not only in the dissemination of Internet services, but also in the mitigation of regulations in the telecommunications industry, where Competitive Local Exchange Carriers (CELEC) And has increased significantly in recent years. As a result, world regulations have been introduced to use new bands above 10 GHz. These bands are generally allowed to be used by a single operator in a given area. This operator can deploy his or her wireless system in the topology he or she chooses as the implementation method, unlike the previous situation where the laws of each country require prior approval from a communications authority such as the US FCC. The assignment of frequency per point (PP) link and allocation of the broadband spectral range per zone defined by one operator for use and this important operational difference maximizes the operator's use of his spectrum, It opens up a market for the implementation of innovative new topologies that can create high-capacity, more advanced wireless networks in the spectrum. Some of this spectrum is referred to in the literature as Local Multipoint Distribution System (LMDS) or Local Multipoint Communication System (LMCS) or Point-to-Multipoint (PMP) systems . The present invention relates to a new topology in which leverage from this spectrum range is licensed on a zone-by-zone basis, wherein the radio of the new customer can be added to the system at any location without prior approval.

A typical state of a conventional topology for a broadband wireless communication network is shown in FIG. Each base station covers 360 degrees using four 90 degree sectors. The two base stations are connected by radio connection to the position of another base station transmitting information from all the base stations to the main switch by optical fiber connection. The main switch connects other subscribers in the same area or remote area via a fiber-optic transit system (SONET or SDH), as well as subscribers in a wirelessly accessible area. The network is based on a point-to-multipoint (PMP) access network that is connected via a point-to-point (PP) link, such as a wireless link 9 or 10 or a fiber optic link 8. In FIG. 1, the base stations BS 11, BS 12 and BS 13 are installed in a geographically elevated position to obtain a line of sight (LOS) to the subscriber's radio radio SR 14 to SR 18. Each base station includes a number of sector antennas that transmit on well-fixed sectors, such as those indicated at 19, 20, and 21. To avoid interference between adjacent sectors, sectors that may interfere with each other are assigned different frequencies. Therefore, when the sector 20 uses the frequency 122, the adjacent sector 19 uses the different frequency 121, and the frequencies 121 and 122 are arbitrary frequencies. A sector 21 belonging to another base station will be assigned a frequency 111 different from the frequency 122 in order to prevent a signal from the sector 21 from interfering with communication in the sector 20 under certain conditions. However, under certain conditions, the frequency 111 may be similar to the frequency 121 if interference does not occur. Most locations do not have a visibility line (LOS) as SR 18 is located behind SR 17.

Subscriber SR 17 of sector 21 is able to communicate with subscriber SR 16 of neighboring sector 24, from SR 17 to BS 11, via link 10 to BS 13, via link 8 to switch 22, , The BS 13, the link 10, and the BS 11 to the SR 16. Similarly, subscriber SR 17 in sector 21 can communicate with subscriber SR 23 of sector 20 in another base station, from SR 17 to BS 11, via link 10 to BS 13, via link 8 to switch 22 And again via link 8 to BS 13, via link 9 through BS 12, to SR 23 in sector 20 via the circuit assigned by switch 22.

In all of these cases, a central switch, such as the Asynchronous Transfer Mode (ATM) switch 22, can function as the center of the switch fabric that all traffic must go through. These switches may include additional ports that are connected via a fiber optic link 7 to a trunk line wide area network (WAN) backbone. Accordingly, subscribers using the wireless PMP access system can be connected to various places in the world. The base station can convert the wireless protocol used for communicating with the subscriber through the airwave to a standard transmission protocol such as ATM.

The data from the base station to the subscriber radio (downlink) is transmitted in broadcast mode through sector antennas toward a number of subscribers located in each sector of a well-fixed angle sector, e.g., between 15 and 90 degrees. This data is assigned to a particular customer, for example, by assigning different addresses to each data packet using Time Division Multiple Access (TMDA) within a particular broadband frequency. In another conventional technique, the PMP system assigns a specific narrow frequency within the operating spectrum band for each subscriber while communicating with that subscriber. To maintain transmission in the upstream direction, each base station synchronizes the uplink transmissions from multiple subscribers in each sector. The scheduling algorithm defines the transmit packet timing and length for each subscriber radio at a well-defined frequency (TMDA). This synchronizes the arrival of packets to the base station in sequence from other subscribers. In a frequency division multiple access (FDMA) scheme, which is a different conventional scheme, a base station assigns a specific frequency channel having a bandwidth defined for each subscriber based on a transmission request and priority scheduling received on a service channel do. Other operating modes such as code division multiple access (CDMA) may also be used for the PMP system.

Consider the advantages of the conventional wireless PMP system technology;

1. Subscriber unit cost is low. The control information and the system information are mostly located in the base station.

2. The media access control (MAC) layer is simple. Especially in virtual circuit designation systems such as ATM or frequency allocation.

3. The base station is simplified. It acts as a smart multiplexer of data from a known subscriber to an external switch (e.g., ATM) and data from the external switch.

4. Replace the current standard technology for switching. That is, this switch (ATM) is located outside the system.

Disadvantages of conventional PMP wireless systems are:

1. The base station radio should be located in a high position (high cost) to maximize LOS coverage.

2. Only the partial coverage can be obtained due to the shadow effect of trees and buildings.

3. The cost of acquiring and maintaining base station equipment and location is high.

4. Trunking cost problem between base station and switch.

5. One or more base switches are required to make system connections between subscribers or to the outside world.

6. The bandwidth per subscriber decreases as the number of subscribers in a sector increases.

7. The utilization of sectors is limited based on the longest link from the base station. A further distance means that there are fewer received signals from the subscriber, and thus the packet signal level changes significantly.

8. The base station must be connected to the switch over an expensive high capacity link, ie, a wireless or fiber-optic CO-3 or higher link.

9. A switch is needed to make the connection.

10. Each packet of data must go through all the paths of the switch and the return, so the system's excessive bandwidth resources are consumed.

11. The capacity of the base station is limited. The current state of conventional capacity is less than 155 MB / s per base station.

12. There is no route diversity.

13. There is no repeater function. All units communicate with centrally located base stations.

14. As the need for high-capacity radio access increases, more base stations must be installed closer together in the same area, so that the same frequency can be reused repeatedly.

The present invention relates generally to the field of wireless communications and more particularly to the field of high capacity broadband wireless networks designed for packet data transmission in the high frequency bands of the spectrum.

BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a schematic diagram illustrating an area covered by three PMP (prior art) base stations.

2 is a schematic diagram illustrating a broadband wireless mesh topology according to the present invention;

3 is a schematic diagram of a TDD (Time Division Duplex) wireless radio usable as an SR (Subscriber Radio) in the present invention.

FIG. 4 is a schematic diagram of a mesh radio network that enables simultaneous spatial flow of information between node 2 and node 0 as well as so-called node 1 and node 4;

5 is a schematic diagram illustrating the relationship between PHY, MAC, and LLC protocol layers;

6 is a schematic diagram showing a 25 node mesh.

7 is a flow diagram of a high level scheduling FSM executed by a finite state machine;

8 is a flow diagram of an acknowledged FSM finite state machine processing of a mesh network node;

9 is a schematic diagram of a wireless radio mesh network configured as a virtual router with local interface ports and dynamic spatial route selection capabilities at a radio node;

The wireless network of the present invention includes a plurality of nodes, each of which includes a radio frequency transmitting circuit and a radio frequency receiving circuit. Each node further includes a local port for connecting to a user-provided system, including a LAN or WAN connection, or a computer system. Each node further includes a data processing unit coupled to the transmit and receive circuitry and coupled to the local port for exchanging data between the circuitry and the local port. There is a spatial flow determining means for transmitting and receiving data stream transmissions from a particular node of the network. In particular, each node is in a line of sight relation to a subset of nodes in the network. The spatial flow determining means for a given node selects whether the data stream is for transmission, receiving, or both of the subset nodes. The data processing unit includes extraction means for extracting selected data from the targeted incoming transmission for a given node. The remaining data stream is then transmitted to the next node (s). Similarly, there is an insertion means for inserting data into the stream to be transmitted. In this way, the incoming data stream can have the extracted (dropped) data at the node and output at its local port, while at the same time the data from the given node is inserted (appended) to the data stream at the time of transmission.

In a preferred embodiment of the present invention, at least some nodes include status information for other nodes of the network. In this way, the node has certain information about the network. This information is provided to the space flow determination means and selects a transmitting node or a receiving node based on this information.

Also, at least the given node has means for evaluating the characteristics of the received transmission. Means are provided for transmitting information about the characteristic to the calling node. The originating node adjusts its own transmission parameters in response to the information.

A node includes means for providing a hybrid transmission that transmits unconnected data, connection-oriented data transmission, or a combination thereof, i.e., a portion of the network is disconnected and the other portion is connection-oriented.

In FIG. 2, a mesh topology wireless network is assumed based on operation at millimeter wavelength frequencies. The wireless network is composed of an optimized radio designed to operate in a wireless mesh network and a medium access layer (MAC), which enables packet transmission over a mesh network, for transmission of ultra high capacity packets based on the implementation of the network topology. It is optimized. According to the present invention, a network includes a subscriber-provided internal data system such as a Local Area Network (LAN), a Wide Area Network (WAN) or a typical PC, and a plurality of subscriber radio (SR) do. A direct line of sight (LOS) between subscribers exists between each node and a subset of nodes in the topology. Complex reflections can be ignored. The SR node acts as a network node with the ability to receive data packets from neighboring nodes and analyze the destination of the data packets. An SR node can drop data addressed to one or more local ports and add data from that local port. The SR node sends a received data packet addressed to another network and the packet received from its local port to its neighboring node based on the selection of a route available in the network towards the final destination of the packet. A node continually receives state information from other nodes and thereby develops a scheduling mechanism for real-time wireless virtual routing of data packets over the mesh network.

Therefore, the mesh network is regarded as a virtual router, and the SR local port is distributed over various areas in the topology that is the router port. An important feature of the present invention resides in the ability of a node to determine data routing of a received data packet by sharing state information among the nodes through a real time scheduling algorithm. With this scheduling algorithm, the SR node can select an available packet route at each instant. For example, packets between the same source and destination may travel through multiple different routes or over the same route depending on route availability. To overcome various delays due to different routing, the SR node may rearrange the order of the specific data packets arriving at different times to generate a well-defined data stream at the local port.

Another important feature of the present invention resides in the automatic acknowledgment processing for a new node that combines a system that was not originally associated with the network. An SR node has the ability to learn its local area and to discover an SR node that can create a communication link with it. The SR node periodically updates its state information associated with the neighboring node that is performing the LOS communication.

An SR node can communicate directionally with a specific node when other nodes in close proximity communicate with other nodes. The directionality of this data transmission / reception is achieved by combining time division access mixed with transmission in the selected sector area. This choice is accomplished by using sector angles (30 °, 45 °, 90 °) of fixed angles, using beam steering capabilities through selection of sector antennas, or using phased array antennas, A one-dimensional antenna for use, or a two-dimensional antenna for use at very high altitudes above the ground, or for outdoor space use.

Subscriber radio (SR) . Each subscriber radio (SR) acts as a network node and has a unique ability to communicate at high frequencies (greater than 6 GHz) with at least two other SR nodes present in the LOS, in accordance with the present invention. For example, SR 16 communicates with SR 17, SR 18, SR 19, and SR 20; therefore, this is from WAN Access Back Bone Access Point (BAP-1) to SR 18 or from SR 17 to SR 19 It acts as a relay for the information to be transmitted. An SR network node may also add or drop data packets over a local interface, such as a 100/10 Base T, IEEE 1394, or other standard interface. In another variation of the invention, the SR may change its frequency channel when communicating with surrounding different SRs. This reduces the mutual interference and increases the throughput of the network. (Details of the reduction example for executing subscriber radio will be described later with reference to Fig. 3).

City Line (LOS) . In current wireless mesh topologies, the SR can perform the functions of bridging and partial routing of data packets. As a result, data can be routed from one SR to another. Therefore, the SR must be maintained in at least one other SR and visibility. This network topology allows subscriber access to configure a new type of wireless network achieved by bypassing the LOS blockage. In Figure 2, for example, if SR 18 does not have an LOS with SR 19, communication with BAP 1 may still be established with SR 16 through SR 19, or another route with SR 20 through SR 15 There will be. This configuration has the advantage that the ability to build LOS or multiple LOS for each subscriber is increased when the density of the system is increased. When the initial network deployment begins, it may be advantageous to initially seed an area with a certain amount of SRs in a visible location with respect to each other.

Throughput . The throughput of the wireless mesh network of the present invention has a unique characteristic that increases as the density of the subscriber increases. The cause of the increase in capacity is in the addition of available high-speed links that enable routing of data packets among multiple paths within the network. This phenomenon is unique only to the high frequency millimeter wave network of the present invention, and multiple links operating at the same millimeter wave frequency can operate in the same area where the MAC layers are synchronizing their beams to avoid mutual spatial interference. The MAC layer is also located in the same area and operates at the same frequency to synchronize the mutual transmission times of potentially interfering SRs and to prevent temporal interference by overlapping the same beams. The present invention is advantageous in that it requires direct LOS between nodes for such high frequency beam propagation. As a result, all reflected beams are absorbed and therefore do not interfere with network operation. This also has great advantages over the installation of a wireless mesh topology at low frequencies, for example below 6 GHz, preferably below 3 GHz, where multiple reflections due to non-tie-line reception significantly disturb network performance, Reduces the capacity of the network when the number of subscribers increases. Another significant advantage also appears in comparison with conventional PMP wireless networks at millimeter wavelengths. In conventional systems, the throughput per sector is fixed, and the capacity of the network per subscriber is linearly reduced when additional subscribers connect to the network.

MAC layer . According to the present invention, the subscriber radio includes a MAC layer, which identifies the location and address of the neighboring SRs taking into account the network topology around the layer. The MAC layer of each SR reads the packets received from each surrounding SR network node and from the SR local interface port. For packets arriving from this local port, the MAC layer defines the routing of each packet based on the destination address of the packet. If necessary, a bit of more information is added via air encryption to be used for FEC (Forward Error Correction). Data packets arriving from the neighboring SR through the wait are analyzed on their own address, and are either locally retransmitted or dropped. A possible arrangement for broadcast transmission, for example from SR 16 to SR 17 and SR 18, can be achieved at the same time by repeating the transmission in the direction of each SR or by a single transmission where both SRs are located in the same beam trace have. This unique combination of wireless packet radio and internal packet data routing and / or bridging capabilities enables the implementation of a wireless mesh network topology.

Variety of routes . The MAC layer also serves to determine the available routing path from its own address to the destination address. In the case of an interrupted route, the MAC layer may route the packet over the selected route. For example, SR 15 can receive data from BAP-1 through SR 12 and SR 13, through SR 19 and SR 16, or through SR 21. It can also communicate with the outside of the network through multiple BAPs such as BAP-1 and BAP-2. This provides a dramatic increase in network reliability and resistance to weather rain fading that can block certain paths for a short time.

Automatic approval . By using acknowledgment processing, the SR that connects the network will scan the frequency channels and spatially different directions if it has beam steering capabilities. This will be attempted to be accommodated in the network. If the SR is registered with the system as a legitimate network node, the network will allow it to connect and update its information at the other node.

Channel selection . The network can select a particular frequency channel for different regions or links. In addition, the arrangement of the optimized spectrum can be downloaded from the NMS (Network Management System) based on the network data flow information observed and learned by the external system. This input allows for better optimization and manual definition of the channels used in different regions. In FIG. 2, the link from SR 12 may be located in frequency channel 102, and SR 15 may use frequency channel 101 to communicate with SR 21, where frequency channels 101 and 102 are in any frequency band.

Multiple WAN access . The network is designed to operate with multiple WAN accesses such as BAP-1 and BAP-2 shown in FIG. This is because, in contrast to the PMP architecture, where the backbone repeater system (SONET / SDH) is constantly demanding to be directed to a base station that is generally topologically positioned at a higher location, everything that is needed is a convenient access to a mesh wireless network . One advantage over the prior art is that multiple, high-speed relay connections can now be used to increase the overall flow of data in and out of the network, thereby greatly increasing its overall throughput capability. Route diversity inside and outside the network is another byproduct of multiple WAN access points.

Frequency reuse . As a result of operating through near neighbors, the likelihood of frequency reuse is significantly increased. This enables a significant increase in bandwidth compared to low frequency (less than 6 GHz) non-LOS systems and PMP systems where transmissions occur within a large sector area.

High bandwidth per link . Due to the shorter distance between subscribers as the density increases, the strength of the signal arriving at the receiver is significantly higher compared to the PMP system. As a result, the radio link can operate at a higher bit rate within the same frequency band. This can be achieved by using a high QAM modulation technique. In addition, the operation of one link is independent of the neighbor link, and each link can adjust its bit rate to optimize the BER (Bit Error Rate) based on the level of the received signal every moment. This contrasts with the PMP system, which defines the bit rate within a sector based on the longest link in the sector.

Availability of mesh networks . The availability of the wireless mesh network according to the present invention increases significantly compared to other topologies (e.g., PMP) due to the shortened distance between multiple SRs. Another increase in availability is due to the ability of the network to change (increase) the power transmitted from each part of the network, regardless of other parts of the network. In addition, the network can increase the sensitivity (and reduce the bit rate) of each part of the network without a significant change in overall network performance. Thus, for example, when a strong lane generates fading propagating through a mesh network, a given link will increase its power to increase the strength of the signal, and to increase its bit rate Will also increase the sensitivity. As a result, the SR will receive its data packets from the same link (possibly at a lower bit rate) or from other links that are less affected by lane fading.

Reliability of mesh networks . The mesh network according to the present invention can operate simultaneously through multiple routes by allowing each SR to receive a stream of packets from multiple directions. Through its MAC layer, the SR can rearrange the arriving data to arrive through the longer route so that the packets are dropped in the correct order. As a result of such a balance capability of the route, the network can reliably operate even at a predetermined node operation.

Backup . Increased local reliability is achieved by using more than one SR at the same location (node) that is connected to the same subscriber LAN. For example, two SRs may operate simultaneously to route information to the same location. If one SR fails, the second SR continues to operate at the increased bit rate to compensate for the loss of the first radio.

Increased WAN access capacity . If the capacity from the mesh to the BAP is to be increased, additional SRs can be added at the same location by connecting their local interface to the second 100 Base T interface of the WAN router located in the BAP. In this case, the dual SR provides an increase in the bit rate from the wireless network to the wireless network in addition to providing backup redundancy if one of them fails.

Low orbit satellites and high-flying communication transponders . The mesh wireless topology can also be used to communicate with a slowly moving network radio in a given orbit on Earth. These low orbit satellites, or high-flying transponders located on airplanes, can operate as repeaters / routers and thus can be accessed at multiple points within the mesh network. For this operation, the radio can communicate with the satellite by adjusting its beam to scan a known orbit of the window. One advantage is the ability to configure the LOS to almost any location.

Polarization Diversity . The system may use different signal polarization (vertical or horizontal) for different subgroups within the same coverage area to increase overall capacity and / or improve interference immunity.

Reference is now made to Fig. 3 for a further description of a subscriber radio (SR) in accordance with the present invention. SR includes the components shown in the schematic view of FIG. As can be seen in FIG. 3, the radio uses a time division duplex (TDD) scheme. One of the main advantages of using TDD radios in a mesh topology is that the TDD radio can operate asymmetrically with different rates of instantaneous propagation and reception, which is more suitable for the packet network of the present invention. Since data packets can flow in different directions, higher capacity is required for transmission in a particular direction at a particular portion during a time period higher than the reverse. The TDD radio does not have a diplexer that separates the transmitted and received signals at two different frequencies. Thus, the radio can scan and magnify the spectrum. By eliminating the diplexer, the cost of the SR is reduced as compared to the FDD scheme requiring a duplexer.

The main components of the TDD radio, as shown in Figure 3, are as follows:

R10 drop interface. This is the local interface port to the customer premises. The local port may include a 10 / 100Base-T, ATM, IEEE 1394, or custom interface for connecting to a LAN or WAN or a computer. In addition, power can be applied on the same cable.

R20 cable interface. It provides safety protection and power regulation circuitry.

R30 digital transmitter. This typically involves standard circuits known in the art. This includes a variable-level modulator, an FEC encoder, and a channel combining circuit.

R40 mesh radio media access controller and link layer controller. This layer provides link layer ARQ, packet sizing, priority queuing, scheduling and routing of virtual circuits, selective encryption of data from the local port, and decryption of data dropped to the local port.

R50 digital receiver. This typically involves standard circuits known in the art. This includes a digital tuner, a variable-level demodulator and an FEC decoder circuit.

R60 Digital-to-Analog Converter

R70 transmit / receive TDD switch. This switch, along with switch R130, performs radio switching between transmit and receive modes.

R80 Analog to Digital Converter

R90 mixer.

R100 linear power amplifier

R110 local oscillator

R120 Low-Noise Amplifier

R130 transmit / receive TDD switch. This switch, together with switch R70, performs switching of the radio between the transmit mode and the receive mode.

R140 antenna selection switch. This switch controls the spatial flow (direction) of the data stream transmission under the control of the MRMAC routing circuitry; That is, directional transmission from a particular node and to a particular node in a manner such that no other neighboring node receives the transmission.

ANT1 to ANT5 antennas. These antennas are directional antennas or sector antennas, providing narrow beam transmission and reception from selected spatial orientations, or providing altitude in the case of satellite communications. Although FIG. 3 shows five antennas for illustrative purposes only, the present invention is not limited by the number of antennas. In the case of phased array antennas, different circuits are needed to control the relative phase shifts of the components that make up such an antenna to provide beam steering capability. Directional transmission capabilities are known in the art. In addition to the above, any equivalent selective transmission scheme works equally well in the present invention.

Media access control (MAC) layer . The implementation of the present invention is based on the introduction of a new MAC layer designed and specified to accommodate the requirements of a wireless mesh network. An overview of the operational requirements and major operating modes of the MAC layer is given below.

Figure 4 illustrates how a radio communicates in a large sector by either scanning its own beam, such as by use of a directional antenna as described above or by using a phased array antenna, or alternatively by creating communication with one of the SRs in its sector ≪ / RTI > illustrates the principles that control the operation of a radio mesh network. Other SRs in a sector that may interfere with communication are controlled by the MAC layer to remain silent during the schedule transmission.

The high-level MAC layer of the present invention and its main definition are described below:

Directional transmission . Each node can select a spatial direction to transmit based on the location of the receiving node in its LOS. The receiving node selects the receiving direction based on the position of the transmitting node in its LOS.

Schedule transmission . Each node can transmit only when its transmission can not interfere with other transmissions. The transmission schedule established at each node serves to synchronize such transmissions.

Simultaneous transmission . Multiple radio nodes may transmit simultaneously when they do not cause interference. In FIG. 4, while radio node 4 is transmitting to radio node 1, radio node 2 may transmit to radio node 0.

Meshed Radio Media Access Control (MRMAC) . MRMAC is a set of procedures and algorithms that serve as routing and scheduling packet transmissions in the mesh radio network of the present invention. All radio nodes involved in the radio mesh network perform the functions of MRMAC. MRMAC is a distributed intelligence that binds the collection of radio nodes into a highly efficient radio packet network.

Meshed Radio Physical Layer (MRPHY) . MRPHY is a radio physical layer compatible with MRMAC and provides the necessary capability to allow the transmission and routing of data packets within a mesh radio network.

Meshed Radio Link Layer Control (MRLLC) . MRLLC is a protocol layer that coordinates user protocol transmission to MRMAC. It performs functions such as priority classification, automatic retransmission request (ARQ) and packet size adjustment.

Protocol data unit . MRMAC is a protocol layer placed between MRPHY and MRLLC as shown in FIG. Figure 5 shows the relationship between PHY, MAC and LLC protocol layers.

MRMAC requirements . Support for high layer transport protocols. MRMAC supports both fixed PDU and variable PDU transport protocols such as ATM, Frame Relay and IP. MRMAC provides quality of service (QoS) provisioning for ATM and IP.

Transmission type . Both asynchronous and isochronous transmissions are supported.

Transfer size . MRMAC supports both fixed size packet transmission and variable size packet transmission. The minimum packet size is 48 octets and the maximum packet size is 2000 octets.

Throughput . The throughput of MRMAC is at least 80% of MRPHY capacity. In the special case where all radio mesh traffic is directed to / from one radio node attached to the WAN backbone (BAP), the throughput is at least 80% of the WAN link capacity.

Delay . The isochronous delay for any node in the subnet to / from BAP is less than 6 ms. The asynchronous delay is less than 15 ms.

Delay variation . The delay variation of isochronous transmission does not exceed 2 ms.

Radio mesh layout . MRMAC accommodates radio nodes that combine and disassemble a radio mesh network without causing excessive interference.

Optimization . The radio nodes must be able to organize themselves in a sufficiently optimized manner, without the need for external interference. A radio node will have an interface that allows centralized control to further optimize its topology and routing selection.

Path diversity . The available optional physical paths will be used for redundancy and load balancing.

Plug and play . The installation of the new node will not require alignment provided by the field installer.

The following description is an example of an MRMAC implementation:

Radio node initialization processing.

Neighbors . Each node contains a map of all other nodes in the subnet that are capable of direct (LOS) communication. The information is as follows:

data note Node ID It can be changed with nodes joining and disassembling subnets. condition Beam direction 1 of 16 possible beam azimuths Interference-capable nodes List of directional node pairs that can experience interference when transmitting in this direction Next Receive Time Next received from the neighboring node Next transmission time Scheduled next transmission to neighboring node Link parameter for data Power, time, ratio, FEC, modulation, etc. Status link parameter It may be different for atmospheric reduction.

Route . Each node has a route table that shows how to get a packet for any MAC destination.

data note Destination node First hop node ID Preferred weight When multiple routes are available

Overview of processing . After initialization of the nodes and the radio mesh network, each node has the information shown in Tables 1 and 2. Packet queues are formed at each node from node-oriented traffic and traffic sent through the node at its local port. The node refers to its table for each packet destination based on a scheduled handshake and priority weighting to determine where the packet transmission should go and when the transmission should be attempted. At the time of the schedule signal change, the radio nodes reach a mutual decision and the transmission is scheduled. This decision will consider the potential interface between nodes. It is useful to include a neighboring schedule signal change at each node. This can advance the interference avoidance procedure.

Quantitative consideration.

Handshake . The handshake procedure includes 62 octets from the originator to the responder, another 64 octets from the responder to the originator, and the final 62 octets from the originator to the responder. There will be a guard time of two octets between transmissions. The 62-octet handshake packet includes FEC and other overhead. The total time of the handshake will be 192 octets equal to 11.71875 seconds. The frequency of the handshake will depend on the number of neighbors, loads and other factors. It is clear that the optimal frequency will be maintained to maximize throughput.

Payload packet size . The asynchronous transport packet size will vary between 72 and 1784 octets, including FEC and other overhead. The isochronous packet size will vary between 64 and 256 octets, including FEC and overhead. The time range is as follows:

type size Time at 128 Mbit Asynchronous 17 to 1784 octets 4.39453125 to 108.88671875 μs Isometric 64 to 256 octets 3.90625 to 15.625 μs Handshake 192 octets 11.71875 μs

Table 3 shows that if all packet transmissions require a handshake, throughput through the node will be properly averaged to 90% or less of the link. Obviously, a certain amount of free scheduling will be required. On the other hand, assuming a predetermined queuing of, for example, 500 [mu] s, the throughput will become more suitable.

Handshake timing . The handshake may vary based on the queue size of the neighboring node. Packet transmission can convey the same type of information as handshake processing, and periodic handshaking should be scheduled only when the link between neighboring nodes is monotonically used.

Preference weight . Each node can maintain its own route preference weights to reflect the route state with good accuracy. Long-term monitoring processing outside the radio mesh network can be used to further optimize routing preference weights.

Handshake scheduling . We want to have a simple way to schedule handshaking between neighboring neighbors. Let us first suppose we need to support variable length packets. We face this problem immediately. If the handshake with the neighbor neighbor is prescheduled, the interval should allow maximum length packet transmission. However, this may cause nodes to spend a lot of time, i.e. bandwidth, between handshakes when some handshake intervals do not require packet transmission. A good solution is to have the scheduled handshake at high frequencies, but allow the nodes to miss the handshake. The handshake scheduling algorithm of the present invention allows a radio node to miss an appointment with some other neighbor when it is involved in packet transmission with some neighbor. When the packet transmission is complete, the affected node will continue its schedule and the delay node will resume its handshaking schedule.

Figure 6 shows a 25 node mesh with up to 8 connections, with each node connected to up to 8 neighbor nodes. Each node is Every two seconds a handshake with one of his neighbors is made and the entire handshake cycle is 8 It assumes that it takes seconds. In order to satisfy the isochronous requirement, .

Node Scheduled Neighbors 0 2 3 4 5 6 7 0 One 5 6 One 0 5 6 7 2 2 6 7 8 3 One 3 7 8 4 2 9 4 9 3 8 5 11 One 0 10 6 6 2 10 7 One 11 0 5 12 7 3 2 6 11 One 8 12 13 8 13 3 9 2 12 7 4 14 9 4 8 13 14 3 10 6 11 5 15 16 11 5 12 10 7 6 17 16 15 12 17 11 13 16 8 18 7 6 13 8 14 12 9 17 19 18 7 14 18 13 19 9 8 15 16 20 21 10 11 16 21 15 17 12 22 20 11 10 17 12 18 16 21 13 11 22 23 18 14 17 19 22 23 12 13 24 19 24 18 14 13 23 20 15 16 21 21 16 22 17 15 20 22 23 21 18 16 17 23 22 24 18 19 17 24 19 23 18

Table 4 describes possible handshaking schedules for the mesh shown in FIG. The scheduling algorithm prevents the node from missing a neighbor for too long.

A high-level node scheduling finite state machine (FSM)

The finite state machine diagram is shown in Fig. Each state and change is described below:

State A0 Idle state . This is the MRMAC default state. The MRMAC stays in this state to trigger a change to one of the other states and then changes to another state after waiting for some external event or timer expiration. IdleAction () is a procedure to be executed when entering the idle state, and performs housekeeping operations such as timer initialization, table initialization, and the like.

A0 = > A2. The Neighbor Designation Timer triggers this change. This change will occur for neighboring assignments that were previously scheduled to receive packets from the neighboring node.

A0 = > A3. The Neighbor Designation Timer triggers this change. This change will occur for neighboring assignments that were previously scheduled to send packets to the neighboring node.

A0 = > A0a. The MRLLC triggers this change by using the Mac.Tx () procedure to request the transmission of the packet. The QueuePkt () procedure performs queuing of packets according to the requested priority. The good route is then associated with a packet based on routing and state information obtained from the radio network. This route is assumed to be the best route based on the load factor at the neighbor node. The quality of the radio link with the neighbor and the priority of the packet are taken into account when selecting a good route. The nature of the requested transmission, i.e. whether it is isochronous or asynchronous, determines the scheduling priority.

A0 = > A1. The Neighbor Designation Timer triggers this change. This change may occur for neighboring assignments that were previously scheduled for state exchange with neighboring nodes.

Status A1 Handshake status. In this state, the node is involved in state exchange with the neighboring node. The exchange updates the viewpoints of the two nodes in different states, including packet queues, route availability, and future schedules. The HandShakeActions () procedure is performed when entering this state and performs all related housekeeping operations.

A1 => A0a. This change is triggered by a failure occurrence in the handshake process. The UpdateNeighborTables () procedure is initiated to record these failures and to schedule future handshake assignments.

A1 => A0b and A1 => A0c. This change is triggered by a successful handshake exchange. Procedures ScheduleRx () and Schedule Tx () will start and schedule future assignments for sending or receiving packets. UpdateNeighborTables () starts and records the updated neighbor state information.

Status A2 Receive status. The node enters this state when it is ready to receive a previously scheduled packet transmission. Procedures ReceiveAction () is started and performs necessary housekeeping functions such as buffer allocation and timer maintenance.

A2 => A1. This change is triggered by the successful reception of a schedule packet containing a status update. The Link.Ind () procedure starts and indicates to the MRLLC that the packet has arrived.

A2 => A0a. This change is triggered by the failure to receive the scheduled packet. The UpdateNeighborTables () procedure starts and records this and allows you to schedule another assignment with the neighbor.

A2 => A0b. This change is triggered by the successful reception of a schedule packet that does not include a status update. The Link.Ind () procedure starts and indicates to the MRLLC that the packet has arrived.

A3 Transmission status. The node enters this state when the scheduling has arrived to send the packet to the neighbor. The TransmitAction () procedure is started and performs necessary housekeeping functions such as buffer and timer management.

A3 => A1. This change is triggered by a successful transmission and involves the exchange of updated status information.

A3 => A0a. This change is triggered by the failure of packet transmission. The UpdatedNeighbortables () procedure is initiated to record the failure and schedule future attempts to send the packet.

A3 => A0b. This change is triggered by a successful transmission and does not involve the exchange of updated state information.

Approval Processing

Meshed radio networks incorporate distributed authorization protocols. The purpose of the authorization protocol is to allow the radio node to be coupled to the network and effectively participate in the mesh-radio-packet-transmission without interfering with the ongoing packet transmission.

Overview of Approval Processing

When the radio node is powered up and found to be unrelated to the radio mesh, it will change to an Admission-Pending state. The radio node negotiates with its deployment database stored in non-volatile RAM to determine its mesh radio subscription. In the pending acknowledgment state, the radio node will listen to an acknowledgment signal from a potential neighbor. Once the radio receives the guidance signal, the radio will begin to exchange state information with its first neighbor, through which it will directly learn about the neighbor's schedule and thus begin to exchange state information with additional neighbors. Once the radio node accumulates sufficient routing and scheduling knowledge through its exchange with its neighbors, it will be prepared for regular packet transmission and will therefore transition to the normal scheduling state.

Figure 8 shows the order in which unrelated nodes are powered up and caused to attempt to connect to the network. The following describes states and changes involving an ordering finite state machine. The radio node begins by scanning the neighbor for an acknowledgment signal. Thereafter, a connection with the neighbor is attempted and continues learning on the neighbor by establishing a state exchange schedule through its initial connection.

I0 Listening. This is the initial state in the acknowledgment FSM, and unrelated radio nodes enter this state from the power-up process. The ListenActions () procedure performs housekeeping functions such as table initialization and scan processing settings in frequency and spatial domains.

I0 = > I1. The scan timer triggers this change. The radio node listens to guidance signals of spatial orientation at a given frequency for a sufficient length of time. If no guidance signal is received, the radio node must scan for the next frequency and orientation.

I0 = > I2. Reception of the guidance signal triggers this change. The radio node receives the guidance including the schedule for the first exchange with the guide radio node.

I1 Scan - The radio node enters this state when its scan timer expires. And then sets up his next listening frequency and spatial bearing.

I1 = > I0. When the radio node sets its next listening parameter, it changes back to the listening state.

I2 connection. The radio node enters this state when it receives an announcement signal from its first neighbor. Data exchange from the first neighbor to the new node occurs.

I2 = > I2a. The end of the exchange timer triggers this change. This timer is set by ConnectActions () based on the initial schedule received as part of the announcement signal. The radio node attempts to exchange state information and route information with its neighbors.

I2 = > I0. Failure of the initial exchange triggers this change. The radio node returns to the listening state.

I2 = > I3. A successful initial exchange triggers this change. The radio node updates its out and route tables to the learning state based on the information obtained from the initial exchange and change.

I3 learning. The radio node enters this state after successful completion of the first exchange with the neighbor. The LearnActions () procedure schedules subsequent exchanges with other radio nodes in the neighborhood using route, status, and schedule information obtained from the first exchange.

I3 = > I3a. The exchange timer triggers this change. The radio node performs an initial exchange with a potential new neighbor via some other neighbor whose schedule is already established. When a successful first exchange with a new neighbor is made, the radio node updates its table to reflect neighbor state, routing and scheduling information.

I3 => A0. The termination of the learning process triggers this change with the node scheduling FSM of FIG. The radio node is now part of the radio mesh upon completion of the authorization sequence and is ready to begin the prescribed packet transmission.

A radio radio network as a virtual router with a local interface port at the radio node (see Figure 9)

Figure 9 describes a radio mesh as a virtual router with an interface at each radio node. The radio mesh represents the appearance of the router and the details of packet transmission between the radio nodes are managed by the network topology inside the mesh radio. Each of the radio nodes may be capable of narrow beam transmission to a neighbor with a timeline (LOS) having a local port. This is illustrated by the line between the nodes. The above-described beam-modulated phased array antenna or switched antenna selection scheme accomplishes this. The fan shape represents the radio node coverage, and the radial line inside the fan represents the directional antenna beam feasibility that exists between the radial lines.

Functional

The external operation of the radio mesh (this is also referred to as a "virtual router") meets IETF RFC-1812 (IP Version 4 router requirements). The virtual router transmits IP packets between its interfaces using a mesh-like radio medium access control (MRMAC) protocol and a mesh-like radio link layer control (MRLLC) protocol.

The Internet architecture is the same as in RFC-1812.

The link layer is the same as in RFC-1812.

The Internet layer-protocol is the same as in RFC-1812.

Internet layer-transmission is the same as in RFC-1812.

The transport layer is the same as in RFC-1812.

The application layer-routing protocol is the same as in RFC-1812.

Load adjustment

1. Internal mesh load adjustment. MRMAC incorporates a robust mechanism for scheduling packet transmissions based on neighbor node load status and IP type services and priorities.

2. External interface load adjustment. The Virtual Radio Network Router (VRMR) is a policy based routing that includes load balancing between interfaces when multiple routers are available over different interfaces using standard routing protocols such as BGP-4 (IETF RFC-1771) .

Route diversity and self-healing

1. Mesh Inside Route Diversity. MRMAC integrates the availability of radio links with robust mechanisms for scheduling IP type services and priority packet transmissions.

2. External interface route diversity. The Virtual Radio Network Router (VRMR) learns the availability of alternate routes from its peers using standard routing protocols such as BGP-4 (IETF RFC-1771).

In conclusion, the wireless mesh topology network of the present invention has the following unique advantages:

The timeline (LOS) can be obtained via neighboring neighbor radios by routing data packets over multiple hops. Thus, the coverage area can be significantly higher than in a point-to-multipoint cell topology. Wireless mesh network bit rate capacity and availability increase with increasing subscriber density.

Each connection can carry a larger amount of data because of the shorter distance between the radios. The signal-to-noise ratio received by the radio is improved and the enhanced modulation technique can be used to achieve higher bit-rate transmission.

Multiple relay. WAN access to the mesh network. The SR network node can act as a WAN access point through its local interface port, for example, 100 Base T. This connectivity increases the total network capacity by simultaneously sending data out of the network through the WAN access point. (See Figure 2. - WAN access point 1 at SR 14 and WAN access point 2 at SR 10). The access point will include at least one port connected to the radio network node via a 100 base T interface and a standard Internet router having other nodes connected to the WAN domain via OC-3 or OC-48 IP of ATM.

Router diversity may be achieved through the use of a MAC layer capable of routing packets between radios based on available routes within the network.

Claims (49)

In a wireless communication network, And a plurality of communication nodes each maintaining a relationship of a corresponding subset node and a timeline (LOS), each communication node A radio frequency transmit circuit for transmitting a data stream transmission to another node; A radio frequency receiving circuit for receiving a data stream transmission from another node; A local port for connection to a data system provided by the user; A data processing unit coupled to the transmitting circuit and the receiving circuit and to the local port; And spatial flow determining means coupled to the transmitting circuit and for transmitting a data stream only to selected nodes in a subset of the nodes; The spatial flow determining means is also coupled to the receiving circuit to receive a data stream transmission only from selected nodes in a corresponding subset of the nodes; The data processing unit comprises extracting means for extracting selected data from a received data stream to generate a second data stream and providing the selected data to the local port; Wherein the data processing unit further comprises an insertion means for inserting data received at the local port into the second data stream to generate a third data stream and providing the third data stream to the transmission circuit for transmission And the wireless communication network. 2. The method of claim 1, wherein at least a portion of the node comprises status information and scheduling information of another node, and the spatial flow determining means determines the spatial flow of the node based on the status information and the scheduling information, And to select nodes from the corresponding subset to cause communications between the nodes to occur without conflict. 3. The wireless communications network of claim 2, wherein at least some of the nodes further comprise means for periodically transmitting local node information to each other to continuously update status information and scheduling information. 2. The apparatus of claim 1, wherein the data processing unit for a portion of the node comprises: means for evaluating characteristics of a data stream transmission received from a first node; Means for communicating with the first node information associated with the characteristic; And means for adjusting operating parameters of the transmitting and receiving circuit to cause a change in characteristics of the data stream transmission in response to receiving the information from the first node. 5. The method of claim 4, wherein the operating parameters of the transmit and receive circuitry comprise at least one of frequency channel allocation, spatial direction, symbol rate, modulation level, modulation rate, power level, beam width, forward error correction (FEC) And a wireless communication network. 2. The method of claim 1, wherein the data stream is comprised of a data packet, wherein at least a portion of the node is connected between the first and second nodes in a connectionless, connection-oriented manner, And transmitting mode data for transmitting the data packet in any one of the following modes: transmitting data packets in a connection-oriented manner, and transmitting the remaining data packets in an access-oriented manner. 2. The wireless communications network of claim 1, wherein the portion of the node comprises a medium access control (MAC) layer enabling two modes of packet switching mode, circuit switching mode, or data stream transmission. 8. The wireless communications network of claim 7, wherein the MAC layer is further capable of asynchronous packet and isochronous packet transmission. 2. The wireless communications network of claim 1, wherein at least some of the nodes communicate using both an isochronous transmission mode, an asynchronous transmission mode, or an isochronous and asynchronous transmission mode. 10. The wireless communications network of claim 9, wherein the nodes transmit information using a MAC layer capable of isochronous transmission to a mapping of quality of service (QoS) of Internet Protocol services. 2. The method of claim 1, wherein the data stream comprises one or more data packets, and wherein at least some data packets of the node may be selectively transmitted based on an isochronous transmission scheme or an asynchronous transmission scheme. Communication network. 2. The wireless communications network of claim 1, wherein the data stream transmission of at least a portion of the node is based on a time division duplex scheme. 2. The wireless communications network of claim 1, wherein the data stream transmission of at least a portion of the nodes is based on a code division multiple access approach. 2. The method of claim 1, wherein for each node in a first subset of nodes the transmitting circuit operates at a first frequency and the receiving circuit operates at a second frequency; For each node in a second subset of nodes, the transmitting circuit operates at the second frequency and the receiving circuit operates at the first frequency; Wherein the data stream transmission between a node in the first subset and a node in the second subset is based on a frequency division duplex scheme. 7. The method of any one of claims 1, 2, 4, and 6, wherein one of the local ports is a local area network (LAN), a wide area network (WAN), a multimedia bus, And the wireless communication network. 7. The wireless communication network of any one of claims 1, 2, 4, and 6, wherein one of the local ports is coupled to an ATM switch, an IP router, an IP switch, or an Ethernet hub. 7. The wireless communications network of any one of claims 1, 2, 4, and 6, wherein the transmitting circuit and the receiving circuit operate at a frequency between 0.5 GHz and 1000 GHz. The method of any one of claims 1, 2, 4, and 6, wherein at least one of the nodes adjusts the bit rate of its data stream transmission based on state information associated with the subset of nodes And means for communicating with the wireless communication network. 7. The method of claim 1, 2, 4, or 6, wherein the transmitting circuit and the receiving circuit include a circuit that adjusts the operating frequency spectrum in real time to reduce interference and increase frequency reuse Lt; / RTI > 7. The method according to any one of claims 1, 2, 4, and 6, wherein the data stream is comprised of a plurality of data packets, Selects a node from the corresponding subset of nodes based on information contained in the node. 7. The wireless communications network of any one of claims 1, 2, 4, and 6, wherein the local port comprises a 10/100 Base-T interface or an IEEE 1394 interface. 7. A method according to any one of claims 1, 2, 4, and 6, wherein one of the nodes is connected to a separate cable, through a separate wire inside the cable, Wherein the wireless communication network is capable of receiving power. 7. A method according to any one of claims 1, 2, 4, and 6, wherein the data stream includes routing information, and wherein the spatial flow determining means determines, based on the routing information, Wherein the network operates as a virtual wireless router. 7. A method according to any one of claims 1, 2, 4, and 6, wherein the spatial flow determining means determines the spatial flow of the node based on external information transmitted from another of the nodes or provided from the local port. And selects a node from the corresponding subset. 25. The wireless communications network of claim 24, wherein the local port is coupled to a network management system to define and optimize system parameters. The wireless communication network according to any one of claims 1, 2, 4, and 6, wherein the spatial flow determining means is connected to a beam-coordinated phased array antenna and a multi-sector antenna array. 27. The system of claim 26, wherein the beam-modulated phased array antenna comprises a one-dimensional antenna array to define beam steering in a single plane and the multi-sector antenna array includes a one-dimensional antenna array to define beam steering in a single plane Lt; / RTI > 27. The wireless communications network of claim 26, wherein the beam steering phased array antenna comprises means for rapidly changing the phase coefficient of the element comprising the array antenna to change its steering direction. 27. The wireless communications network of claim 26, wherein the plane of the generated beam includes at least one low orbit satellite orbit. 7. The apparatus according to any one of claims 1, 2, 4, and 6, wherein the spatial flow determining means comprises a first beam having a first angle and propagating in a first plane, And a beam circuit for generating a second beam that propagates in a plane different from said first plane. 31. The wireless communications network of claim 30, wherein the plane of one of the first beam and the second beam includes at least one orbital of low- 7. A wireless communication system according to any one of claims 1, 2, 4, and 6, wherein at least one of the transmitting circuits of the node comprises circuitry for selecting a polarity of a data stream transmission. . 7. A method according to any one of claims 1, 2, 4, and 6, wherein a portion of the node comprises means for recording routing information over the network, And selecting a node from a corresponding subset of the node in response to the request to complete the routing operation including load balancing and self healing. The wireless communications network of any one of claims 1, 2, 4, and 6, wherein the data stream comprises a data packet in an Internet Protocol data format. The method of any one of claims 1, 2, 4, and 6, wherein the data stream comprises a data packet of an Internet Protocol data format and at least a portion of the node is a transmission of the IP data And a wireless MAC layer for coordinating the wireless network. The wireless communication network according to any one of claims 1, 2, 4, and 6, wherein the data processing unit includes means for encrypting the data stream and means for decrypting the data stream. 7. The method of claim 1, 2, 4, or 6, wherein the portion of the node comprises means for decrypting the selection data passed to the local port and means for encrypting the data received from the local port Wherein the wireless communication network further comprises means for communicating with the wireless network. 7. A method according to any one of claims 1, 2, 4, and 6, wherein at least one of the nodes comprises means for establishing communication with a new node and means for exchanging information with the new node , Whereby the new node learns about the network based on information obtained from the at least one node. 7. A method according to any one of claims 1, 2, 4, and 6, wherein the data processing unit of the subset of nodes comprises means for receiving externally provided information to construct a subset of the nodes The wireless communication network. WHAT IS CLAIMED IS: Wherein each wireless radio node comprises a plurality of spaced-apart wireless radio nodes, each of which comprises a transmitter, a receiver, a cross-connected data switch and a router, a) at least a first port, a second port and a third port comprising a first port associated with a local user and a second and a third port communicating with the remote radio node; b) a user-provided data system coupled to the first port and having a communication link to the second and third ports; c) a first directional antenna element coupled to the second port and oriented to have a timeline relationship at the first remote radio port, for communicating data packets therebetween; d) a second directional antenna element coupled to the third port and directed to have a timeline relation at the second remote radio node, for transmitting a data packet communicated from the first port and the second port; e) reading the data packet associated with each router, including synchronous information and addresses coordinated with other nodes in the data packet exchanged between the nodes, and if the associated data in the packet is extracted and sent to the first port Or to the remote radio node via the second port or the third port; f) insert data from the first port to include address and synchronization information and form a data packet associated with each router, to be routed through one of the second and third ports to a remote node, Means for receiving data from a radio node communicating with the second port and the third port to be routed to a port communicating with the second port and / or the third port; g) providing a directional and synchronizability to the cross-connect data switch using synchronization information to prevent collision of data packets so that the data switch is capable of providing an address of a data packet input from the second port or the third port, To couple the address of a data packet output from one of the three ports to another suitable one of the three ports, to couple to a first port, or to a second port or to a third port on the other hand, / RTI > Whereby each node communicates with another node in a timeline relationship to exchange data packets for the local user at that node or relay packets to / from another node. 41. The wireless mesh network of claim 40, wherein the antenna element is part of an antenna arrangement or a multi-sector antenna of a plurality of antenna elements having a narrow angular sensitivity pattern spanning a wide angle. 42. The apparatus of claim 41, wherein the cross-connect data switch assembler has m inputs and n outputs coupled to a transmitter and a receiver of a radio node and includes a plurality of small switches connected to n antenna elements of the plurality of antenna elements, Wherein the wireless network is a wireless network. 41. The method of claim 40, wherein the first and second directional antenna elements of the selected node are grouped in one sector, and wherein the nodes in the one sector have a second port and a third port coupled to radio communication Meshed wireless networks. 44. The network of claim 43, wherein the nodes grouped in the one sector are grouped into a time division duplex communication array. 45. The wireless mesh network of claim 44, wherein the nodes grouped in the one sector are grouped into a frequency division duplex array. A wireless packet radio communication method comprising: Providing a plurality of spaced apart wireless packet radio nodes in a mesh array; Routing the packets between each node by one packet to accommodate the traffic flow rate and the difference in flow towards different directions to allow instant connection between the various nodes to drop, receive and transmit packets / RTI > 47. The method of claim 46, further comprising providing each node with three ports including a first port associated with a local user and a second and a third port associated with a directional antenna element directed at another node as a timeline communication relationship / RTI > 48. The method of claim 47, wherein the plurality of nodes have directional antenna elements that provide radio coverage over spatial sectors. 50. The method of claim 47, further comprising routing data packets arriving from the first, second and third ports to the other port based on the address and schedule information.