Selection of path in wireless networks

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to wireless cellular/self-organizing (ad hoc) networks, particularly, to processing of route request messages at routing protocols to request. Proposed is the method of detection of route between source node and destination node including intermediate replay flag of reply of route request message by source node, avalanche distribution in said wireless network and reply to said request by means of the first intermediate node and having an actual route to destination node. Described are system and method for detection of the best route. Note here that route reply message becomes the first route message. Here, selection of the best route is effected between them and source node on the basis of cumulative metrics received in route request messages receive by destination node. Extra route reply message is created to perform single-address transmission thereof to source node.

EFFECT: fast detection of the route with optimum metrics between source node and one or more destination nodes.

26 cl, 6 dwg

 

Area of technology

The present invention relates to wireless networks and, in particular, to wireless networks cellular structure. More specifically, the present invention relates to a message processing request for a route in the routing protocols on demand.

Prior art

Routing protocols on-demand, such as routing Protocol with a self-organising distance vector on-demand (AODV) MANET working group in IETF, uses the mechanism of route requests and route replies to establish routes between two nodes in wireless mesh/randomly organised (ad hoc) networks. When the source node wants to send packets/frames of data to the destination node, the source node discovers a route to the destination through broadcast avalanche mailing messages route request (RREQ) in the network if the source node does not and requires a valid route to the destination node. The return route back to the source generated by the nodes in the network as they accept and forward RREQ. When a node receives RREQ, the receiving node responds to this request by generating a response message of the route (RREP) if: (1) either the host node itself is the destination, (2) any receiving node has d�istically route to the destination node and only flag the destination node (D) in RREQ is NOT installed. RREP is sent in unicast mode to the source node through the established reverse route, and thereby creates a direct route to the destination node in the intermediate nodes and eventually to the source node. The established routes are terminated with the expiration of the term if they are not used during the lifetime of the route.

In AODV only flag the destination node of RREQ message is set by the source node and is not modified by intermediate nodes. If the flag is "only the destination node" is set in the RREQ source node, the intermediate node does not respond to the RREQ RREP message, even if the intermediate/receiving node has a valid route to the destination node. It redirects/avalanche sends RREQ to its neighbors. Only the destination node will respond to this RREQ. In this operation mode, the delay of route discovery can be quite significant, although actual optimal route between the source node and the destination node is eventually detected in the process. Low latency is very important for real time applications such as voice and video.

If the flag is "only the destination node is not installed on the source node, then any intermediate node with the correct route to the destination node responds to the RREQ RREP message. The RREP message is sent back to the node IP�of Ocnita in unicast mode and establishes a direct route to the destination node. If the flag is "voluntary RREP" (G) in the RREQ is set, the intermediate node also transmits in mode unicast a gratuitous RREP to the destination node, the destination node has learned the routes to the source node. However,inAODV, if the intermediate node generates a RREP (as an intermediate node has a valid route to the destination node), then the intermediate node discards the RREQ. In this approach, the source node can find a route to the destination node more quickly, because the source node does not need to wait for the response of the destination node. However, the optimal end-to-end route may not be detected because the route is listed in the intermediate node, may not be the route with the best metric to the destination node. Metrics may have changed due to the dynamics of wireless networks, making the cached route is less desirable. I.e. due to changes in network topology, routing metrics, etc. it is possible that the route is cached in the intermediate node, may become worse, or that other through routes with the best metric may become available, making other routes more desirable.

Problem to be solved by the present invention, is how to use the mechanism of RREQ and RREP in order to quickly detect the route with the best metric int� the source node and one or more destination nodes.

Summary of the invention

The present invention discloses a method and a system for processing/sending of messages, route request (RREQ) and the formation of the message route reply (RREP) to the routing protocols on-demand, exemplified by the AODV, the route with the optimal metric can be detected without the occurrence of significant delay/latency of route discovery in wireless mesh/randomly organized networks. In particular, when the source node wants to discover a route to the destination node, the source node avalanche broadcasts in the network, the RREQ message to the destination node specified in the destination list, and the metrics are initialized as 0. The RREQ message contains the new flag "interim response (IR) for each destination node. The source node sets a flag corresponding to the destination node in the RREQ when it initiates an avalanche newsletter RREQ to discover a route to node(s) of destination. In the avalanche distribution first RREQ an intermediate node with a valid route to the destination node responds to the RREQ RREP message. The RREP message is transmitted in unicast mode to the source node and thereby quickly establish a temporary direct route to the destination. Thus, the source node can use this temporary direct�route for transmission of packets/frames of data with low latency/delay of the route discovery. The first intermediate node resets/clears the IR flag in the RREQ message and sends the updated RREQ message further in the direction of the destination node. Since the IR flag in the RREQ is cleared, subsequent intermediate nodes do not have to reply to this RREQ and only spread it, even if the subsequent intermediate nodes have a valid route to node(s) of destination. RREQ to reach the end node(s) of destination. The node(s) of destination can choose the route/path with the optimal metric based end-to-end metrics and pass a new RREP back to the source node to establish a route with the best metric between the source node and the destination node. If the optimal path is different from the temporary direct path, which is set by RREP from the intermediate node, the source node switches to the optimal path after the optimal path is selected.

The described system and method for route discovery between the source node and the destination node in a wireless network, includes the installation of an interim flag response to the request message route by the source node, avalanche newsletter in the wireless network a request message of route response to the request message, the route reply message route through the first intermediate node having a valid route to the destination node. System isposal then upgrade request messages and re-route the avalanche newsletter in the wireless network a request message route. The phase response of the mentioned phase response thereby establishes a temporary direct route between the source node and the destination node of the wireless network. Also described is a system and method of detecting the route with the best metric, wherein the response message route becomes the first response message route. The system and method of detecting the route with the best metric includes selecting a destination node of the route with the best metric between itself and the source node based on cumulative metrics received in route request received by the destination node, the creation of additional response message unicast route and additional transmission response message to the source node. If the temporal the direct route is the route with the best metric, then the additional response message route serves as a confirmation and if the temporal the direct route is not the route with the best metric, then the additional response message of route was to establish a route with the best metric when receiving additional response message route by the source node.

Brief description of the drawings

The present invention is most easily understood from the following detailed description illustrated by the attached drawings, in which following�:

Fig.1 is an exemplary format of the RREQ message.

Fig.2 is a schematic representation of a wireless mesh network in accordance with the principles of the present invention.

Fig.3 is a schematic representation of a wireless mesh network in accordance with the principles of the present invention.

Fig.4 is a block diagram of the sequence of operations of a method of routing Protocol on demand, showing that, when the present invention is used.

Fig.5 is a block diagram of the sequence of operations of the method of the present invention.

Fig.6 is a block diagram of a node in accordance with the principles of the present invention.

Detailed description of preferred embodiments

When the source node/grid point wants to transmit packets/frames of data to some destination node, it checks its routing table for the route. If there is a valid route, it transmits the packets/frames into a single next hop (relay) the land specified in the routing table for the destination node. If no valid route, the source node initiates the route discovery by an avalanche of messages to the distribution of route request (RREQ) over a wireless mesh/randomly organized network. Packets/frames of data may come from the host or from the stations associated with the node if the node is a m�is a wireless access point. It is possible that the source node needs to detect the routes/paths to multiple destination nodes. The source node may propagate RREQ for each of the assignments or to reduce the service load routing, avalanche to send to the network a single RREQ message having a list of multiple addresses of the destination nodes attached to it.

Fig.1 is an exemplary format of the RREQ message, when other formats. The RREQ message contains, for example, the address of the start node (source, ordinal Creator, the address of the destination node and the sequence number of the destination (or the number of appointments and the address list of assignments and their sequence numbers), RREQ ID, message ID, message length, time-to-live (TTL), number of hops, the routing metric, flags, and other information. In addition to flags only the destination node (D) and "voluntary RREP" (G), a new flag called flag "interim response" (IR) in this document, is contained in the RREQ message. The flags D and G are contained in the quality inherited from the traditional AODV. These two flags are not set/used by the source node and ignored by the intermediate nodes and the destination nodes. One alternative implementation is that the RREQ message does not contain the flags D and G. If the RREQ message carries a list and�destination addresses, several flags "intermediate response" included in the RREQ message, each of which corresponds to the destination address. When the source node wants to discover a route to one or more destination addresses, it sets a flag(and) "interim response" (IR) corresponding to the address(s) of destination. It should be noted that the address(es) of the destination node may be the address(es) of the Internet Protocol (IP) or address(es) tier 2 (control of access to the transmission medium transmission, the MAC). To adapt to changes in network conditions and to maintain the route with the best metric between nodes, each active source node optional avalanche can be distributed in a wireless cellular/randomly organized network periodic RREQ message (merchant RREQ) for the address(s) of destination, to which(s) he communicates. The IR flag in the servicing RREQ is not installed. The intermediate nodes and the destination nodes process serving RREQ in accordance with the same rules as used for processing neobsluzhvane RREQ in the discovery phase.

Thus, it can be seen that the spread poslujivshih and maintenance RREQ messages in a wireless mesh/randomly organized network leads to build/update a reverse route to the Creator (the source node) in RREQ intermediate�x nodes and the destination nodes. Distribution poslujivshih message also initiates RREQ RREP message from the destination nodes and possibly intermediate nodes. Distributing service messages initiates RREQ RREP message from the destination nodes.

When an intermediate node or the destination node receives the RREQ message, it creates a reverse route to the source node or updates the current return route, if the RREQ message transmitted by means of the route/path that offered a better metric than the current return route to the source node. It should be noted that each node may receive multiple copies of the same RREQ message (starting with one source node and having the same RREQ ID), and each message RREQ passes a different path from the source node to the receiving node/intermediate node/destination node. If the reverse route is created or modified this is a "first copy" of the message RREQ, the RREQ message is sent (avalanche sent). "The first copy" is used herein to indicate that this copy of the RREQ message is the first copy or the time when the receiving unit/intermediate unit/destination node received or saw this particular RREQ message identified by the address of the Creator and RREQ ID. When an intermediate node tselesoobraznee RREQ, field metric in the RREQ message is updated to reflect the cumulative metric of the route to the source node RREQ from the intermediate node. In addition, if the IR flag for the destination node in the list of destination nodes of the message received RREQ is set, and the intermediate node has a valid route to the destination node, the intermediate node responds to the RREQ message, the response message RREP route. This is the response message of route is transmitted to the source node in unicast mode and sets a direct path to the destination node. The source node can then use this route to send the frames/packets to the destination node directly. If the intermediate node responds to the RREQ message by the message RREP to the destination node in the list of destination nodes RREQ, it resets/clears the IR flag for the destination node in the RREQ message before re-avalanche distribution in the network is updated RREQ message. The reason to reset IR flag after transmitting the RREP message is to suppress all messages RREP subsequent intermediate nodes. Only the first intermediate node with a valid route to the destination node along the route traversed by the avalanche distribution of the RREQ message, it responds with a RREP message for that destination node. If the IR flag for the destination is reset/cleared in the RREQ message, �romioconty node must not respond with a RREP message, even if it has a valid route to the destination node.

After creating/establishing or updating a reverse route to the source node, the destination node sends a unicast RREP message back to the source node. Intermediate nodes add direct routes to the node(s) of destination when receiving a RREP message and sends a RREP message to the source node. When the source node receives the RREP message, it creates a direct route to the destination node. If the destination node receives additional messages RREQ with better metrics, the destination node updates its route to the source node in the new route, and sends a new message RREP back to the source node to the updated route. New message RREP more optimal sets (updated) direct route from the source node to the destination node in the intermediate nodes and eventually to the source node. After this more optimal direct route is selected, the source node uses it for data transfer. In the end, bidirectional end-to-end route with the best metric is established between the source node and the destination node. Using this approach, the source node can quickly obtain a route to the destination node, which is installed by using the RREP message that is answered by an intermediate node with days�conscious people route to the destination node. If this route is not a through route with the best metric between the source node and the destination node, the route updates until then the route with the best metric.

Fig.2 illustrates avalanche distribution in wireless cellular/randomly organized network messages route request (RREQ) and intermediate node B with a valid route to the destination node E, and responding to the message RREQ RREP message. Consider an example in which A source node tries to discover a route to the destination node E. Node A source avalanche sends messages route request (RREQ) with the IR flag set in wireless mesh/randomly organized network. Suppose that an intermediate node B already has a valid route B-C-D-E to the destination node E. When the intermediate node B receives the RREQ, it creates a reverse route to the source node from which it receives RREQ as the next hop (the source node (A) return of the route/path. Intermediate node B responds to RREQ RREP in unicast mode, because it has a valid route to the destination E, and the IR flag in the RREQ is set.

RREP establishes a direct route to the destination node E in the source node A. once the source node creates A route/path to the destination node E using RREP from the intermediate node B, Uzes� source A may start the transmission of packets/frames of data to the destination node E via the route A-B-C-D-E. Intermediate node B clears the IR flag in the RREQ message and sends it on. The reason for the reset IR flag is to restrict the answers to avalanche newsletter only the first RREQ, the intermediate node with a valid route to the destination node. Other intermediate nodes further, for example, C and D, should not respond to this RREQ with RREP, since the IR flag is not set. Assume that the intermediate nodes F, G and H do not have a valid route to the destination node E. When the intermediate nodes F, G and H take the avalanche sent the RREQ message, they create a reverse route to the source node a with the node from which each of the intermediate nodes F, G and H accepts the RREQ as the next hop of the reverse route. Each of the intermediate nodes F, G and H then sends a RREQ message.

In this example, the destination node E receives two copies of this RREQ, each of which passes a different path: A-B-C-D-E, A-F-G-H-E. provided that two RREQ has reached the destination node E in the following order: A-B-C-D-E and then A-F-G-H-E, the destination node E first creates a route to the source node through A intermediate node D, once the destination node E receives the RREQ route/path A-B-C-D-E. At this point the reverse route to the source node A is selected in the intermediate nodes B, C and D. the destination Node E sends a RREP along the route E-D-C-B-A. RREP pros�updates about the route A-B-C-D-E. If there is any node(s) of destination in the RREQ destination list, for example, a node I, the destination node E removes itself from the destination list and then sends a RREQ further (for example, node I). If no other node(s) of destination in the destination list RREQ, the RREQ is not sent.

Fig.3 illustrates a wireless local area mesh network, indicating that the destination node E responds with RREP (1) when receiving a RREQ by A-B-C-D-E and transmits a new RREP, (2) to establish a more optimal direct route/path after receiving a RREQ by A-F-G-H-E. When the destination node E receives RREQ, which passed on A-F-G-H-E, the destination node E determines that this RREQ was on the way with better metric to A, than the temporary reference route/path A-B-C-D-E. Thus, the destination node E modifies/updates the next hop from the intermediate node D to the intermediate node H and updates the metric. After that, the destination node E transmits a RREP unicast mode transmission back to A source node through intermediate node H, and updates and sends RREQ, if there is one or more other destination nodes in the destination list RREQ. RREP establishes a route to A source node through intermediate nodes H, G and F. When A source node receives this RREP, it modifies/updates the next hop for destination node EOT intermediate node B to the intermediate node F. The route to the destination node E is changed to A-F-G-H-E.

Fig.4 shows a block diagram of the sequence of processing operations of the RREQ message. When a node receives a RREQ message, it first creates/installs or updates a reverse route to the previous transit station, from which the node received the RREQ message, if necessary, in step 410. Intermediate/receiving node can then create or update a reverse route to the Creator of the RREQ as follows. If the reverse route to the originator of RREQ message is missing in the routing table is invalid or in step 415 and 420, it is created or updated. The next transit in the routing table for a reverse route to the Creator of the RREQ becomes previous transit station (the node from which RREQ message received). If a valid route back to the Creator of the RREQ exists, the source sequence number in the RREQ message is compared with the sequence number of the route entry in the routing table in step 425 for a reverse route. If the sequence number in the RREQ message is older, he is discarded and no additional processing is performed in step 445. Otherwise, the current return route to the Creator modified, if the new metric is more optimal than the current route metric to the Creator in the routing table on the stage 30. The new metric is defined as the metric in the RREQ message plus linking metric between the node from which it received the RREQ message, and themselves. If the new metric is more optimal than the current metric of the reverse route entry in the routing table, but the source sequence number in the RREQ is greater (newer) sequence numbers in the routing table for the reverse route in step 435, the intermediate node checks the supported optional features of the hysteresis processing and caching of route candidate with the optimal metric through a wire mesh, in step 450. If these optional processing functions are not supported, the return route to the Creator of the RREQ is updated in step 455. When a reverse route is created or modified, the sequence number in the routing table for the reverse route is installed on the source sequence number in the RREQ message, the next transit becomes the node from which RREQ message received, the metric is set to the new metric, and the number of hops is set equal to one greater than the number of hops the RREQ message.

If the reverse route to the source node created or modified, or the RREQ message was the first copy of a new message RREQ (RREQ ID is not visible from the source previously) in step 420 and 440, the procedure is forwarded�I RREQ and the formation of a RREP, described in this document is executed in step 475. There may be other cases when the procedure of sending RREQ and the formation of a RREP, described herein, shall be enforced by the node. For example, some way of caching the route candidate with the optimal metric RREQ messages can be stored in the waiting queue with a timer during the caching of route options. When the timer turns out, the procedure of sending RREQ and the formation of the RREP is to be executed.

The source node can transmit periodic maintenance RREQ message to update your active forward and reverse route. Every time the source sends the merchant RREQ message is called the refresh cycle route. It is possible that the nodes that already have a return route with the best metric to the source node, receive the RREQ message with new sequence number, but the route with the worse metric to the source node until the reception of the RREQ message by the current route with the best metric. Additionally, a copy of the RREQ message, distributed by the current route with the best metric may be lost in the avalanche distribution. These events can result in a swing route. To reduce the fluctuation of the route and select the route with the best metric during each qi�La route updates, can be used some type of hysteresis mechanism and caching of routes candidates with the optimal metric. If at step 460 it is determined that a variant of hysteresis and caching the optimal route option is implemented via a cellular network, the intermediate node updates the routing table and modifies the return route, if the source sequence number in the RREQ message is greater (newer) sequence number to entries of the routing table to a value greater than the threshold value. Otherwise, the return route can be cached as a potential alternative route option in step 465.

If the node subsequently learns that the current return route got worse and worse options return route, it can change on an option route, defined earlier in the same update cycle. The present invention describes a method and system to send the RREQ message and generate a RREP message to discover a route with the best metric without causing a large delay/latency of route discovery in wireless mesh networks. The method of the present invention works with or without hysteresis and caching of optimal variants/alternative routes.

Fig.5 presents a block diagram of the sequence of operations illustrating STRs�about sending RREQ and the formation of the RREP of the present invention, in which the node determines whether it is the destination node, i.e., whether one or more addresses of the node (self_addr) the requested destination address in a destination list, the message RREQ rreq.dest, in step 505. It should be noted that the node itself can have multiple addresses, or can act as a proxy (intermediary) for other nodes. For example, a node may be an access point, and generate/manage routing messages on behalf of legacy stations associated with it (proxy for stations). The functionality for this case is similar to the situation when a node has multiple addresses. The destination address associated stations can be considered as the alias for the access point. The node is the destination node, if one or more addresses specified in the assignment list of the RREQ message belongs to him or one of the nodes that use it as a proxy. When a node receives a RREQ message in which the destination node is a node that uses it as a proxy server it needs to process the RREQ message, as if the address of the destination node was his address. Moreover, a node may be a destination node for the requested addresses in the list, the destination of the RREQ message, the intermediate node for another requested address in the destination list of the RREQ message.

If one or more node addresses corresponds to supersensualism destination in the destination list of the RREQ message, the node generates and transmits the RREP message in unicast mode to the Creator of the message RREQ for those matching the destination address in step 510. The destination node removes its own/used to proxy the address(es) from the list of destination RREQ message in step 515. After that, if there is no remaining requested addresses in the destination list of the RREQ message at step 520, the RREQ message is discarded in step 525. If the node is not the destination node for any of the requested address in the destination list of the RREQ message (505) or are there any other requested destination address in the destination list of the RREQ message, along with the addresses of the node, i.e. if the node is an intermediate node for one or more addresses in the destination list of the RREQ message, the node checks the remaining addresses in the destination list of the RREQ message as follows. Suppose that rreq.dest[i] represents the (i+1)-th address in the destination list of the RREQ message. The node initializes the index (for example, (i) in step 545 and checks the rreq.dest[i], i.e. the first address in the destination list of the RREQ message to determine whether active direct route to the destination node, represented by a rreq.dest[i], in step 550. If the intermediate node has an active route to the destination, a route to the destination node is valid (555), the sequence number at least as large as specified in the outcome�the first RREQ message (560), and flag an interim response (IR)" is specified (570), the intermediate node generates a RREP message to the requested destination address in step 575, and transmits the generated RREP message in unicast mode to the Creator of the message RREQ current reverse route. The IR flag for this requested destination in the RREQ message is discarded in step 580. The node increments the index (e.g., one) and checks whether there are any additional addresses in the destination list of the RREQ message, in step 590. If there is any additional addresses in the destination list of the RREQ message, the execution of the above-described cycle is repeated starting with step 550. I.e. the cycle is repeated if the RREP message must be sent to the next requested destination. The cycle is repeated until, until all the addresses in the destination list of the RREQ message will not be checked.

Initial incoming RREQ message is checked to determine whether more 1 value time-to-live (TTL), in step 530. If the TTL value is greater than one, then the information in the original RREQ message is updated, including decreasing the TTL value in the outgoing RREQ message, for example, per unit in step 535. Sequence number, metric and the number of hops of the source is also set equal to the corresponding information in the updated route entry for the source on the e�APE 535. The updated RREQ message is sent in step 540.

Note that the destination node can be used as a proxy for one or more addresses, and intermediate node may have a valid(s) route(s) to one or more destination addresses. The RREQ message can carry one or more destination addresses in the destination address list. Processing unit/intermediate unit/destination node can satisfy the aforesaid conditions and send the RREP message requested for multiple addresses in the destination list of the RREQ message. If the node sends a RREP message to several destinations, it can send multiple RREP messages, one for each destination, or it can send a single aggregated message RREP with multiple destination addresses in the address list.

Fig.6 is a block diagram illustrating details of a node 600 of the present invention. The node includes a module 605 for measuring the quality and load of the communication line, the module 610 calculate metrics routing module 615 routing and the communication module 620. The module 605 measuring the quality and the load line measures the communication quality and load line connection/channel with each of its neighbors. It provides the measurement results in the module 610 compute routing metrics so that the module 610 compute routing metrics could detect�pouring cost/metric lines of communication for each of its neighbors. Note that a node can have multiple neighbors, multiple radio interfaces and multiple physical/logical channels/lines. All of them should be measured. The module 610 calculate metrics routing, each node uses the measurement performed by the measurement module of the quality and load of the communication line, along with other information to calculate the routing metric for each node with which it communicates. The routing metric is updated periodically. Module 615 routing determines/selects the route/path / to send/to transmit data to the destination node, based on the calculated routing metrics. Module 615 routing messages routing and data with other nodes in a mesh network through the communication module 620. It should be noted that a node may have one or more interfaces of radio communication and other communication interfaces. It should be understood that the module routing may actually be composed of several smaller units or combined with other modules described in this document. Additionally, it should be understood that the processes described in this document (especially in relation to Fig.3 and 4), can be software, hardware, firmware or any combination viseaza�enny, enforced in or via the automatic route selection.

It should be understood that the present invention can be implemented in various forms of hardware, software, firmware, special purpose processors, or a combination of the above, for example, in the mobile terminal, the access point or cellular network. Preferably, the present invention is implemented as a combination of hardware and software. Moreover, the software is preferably implemented as an application program, the material implemented in the program store device. The application program can be loaded or executed by a machine containing any appropriate architecture. Preferably, the machine is implemented on a computing platform having hardware such as one or more Central processing units (CPU), random access memory (RAM) and interfaces input / output. The computing platform also includes an operating system and code of microinstructions. Various processes and functions described herein may either be part of the code of microinstructions or part of the application program (or a combination of the above), which is enforced by operating with�system. In addition, various other peripheral devices may be connected to a computing platform such as an additional data storage device and printing device.

Additionally, it should be understood that because some of the constituent system components and the method steps depicted in the accompanying drawings are preferably implemented in software, the actual connections between the system components (or the process steps) may differ depending upon the manner in which the present invention is programmed. Taking into account proposed in this document methods, specialists in the art will be able to consider these and similar implementations or configurations of the present invention.

1. A method of route discovery between the source node and the destination node in a wireless network on-demand, comprising stages on which:
accept the request message route from the source node; and
respond to the said request message route reply message route through the first intermediate node having a valid route to the destination node, wherein said intermediate node responds to the request message of the route, when the flag in the request message route is selected, and womenusually intermediate node resets mentioned the flag and avalanche circulate in said wireless network referred to the request message, the route is flushed with the mentioned flag.

2. A method according to claim 1, additionally containing phases in which:
update referred to the request message of the route; and
avalanche send mentioned in the wireless network according to the requirement referred to the updated request message route.

3. A method according to claim 1, wherein by the above-mentioned reply have a temporary direct route between the source node and the destination node mentioned wireless network on-demand.

4. A method according to claim 2, wherein the said step of updating further comprises the step in which update mentioned the flag and update the metrics in said request message route using summary metrics the route between the source node and the said intermediate node.

5. A method according to claim 1, in which referred to the wireless network on demand is a wireless mesh network.

6. A method according to claim 1, wherein the said response message route mentioned phase response transmit in unicast mode to the source node.

7. A method according to claim 1, in which the address referred to on the destination node is one of the address of the Internet Protocol and the address control access to the transmission medium.

8. A method according to claim 1, wherein the said destination node includes the destination nodes associated with one of: procs� and access points.

9. A method according to claim 1, further comprising a response to the merchant request message route, as if it was referred to by the request message of the route.

10. A method according to claim 3, in which the mentioned temporary direct route available for data transmission when receiving the above-mentioned response message route through the mentioned source node.

11. A method according to claim 3, in which the mentioned route is the optimal route, and in which, further, the said response message route is the first response message to the route.

12. A method according to claim 11, additionally containing a stage at which accept the additional response message of route to said destination node, wherein the additional response message route includes the best route between the destination node and the source node based on cumulative metrics in the request messages of the route taken by the destination host.

13. A method according to claim 12, wherein, if said temporary direct route is the best route, then the additional response message route serves as a confirmation, and if the temporary direct route is the best route, then the additional response message of route�with for to set the optimum route when receiving the additional response message route through the mentioned source node.

14. Apparatus for route discovery between the source node and the destination node in a wireless network, the request containing:
means for receiving a request message route from the source node; and
means for response to the request message of route response message route through the first intermediate node having a valid route to the destination node, wherein said first intermediate node responds to the request message of the route, when the flag in the request message route is selected, and the said first intermediate node resets mentioned the flag and re-avalanche send mentioned in the wireless network mentioned the request message route with reset mentioned flag.

15. The device according to claim 14, further comprising: means for updating the said request message route; and means for avalanche distribution in said wireless network according to the requirement mentioned updated request message route.

16. The device according to claim 14 in which the said means for response sets temporary direct marshrutki mentioned by the source node and the destination node mentioned wireless network on-demand.

17. The device according to claim 15, in which the said means for updating further comprises means for updating the above-mentioned flag and a means to update the metrics in said request message route using summary metrics the route between the source node and the said intermediate node.

18. The device according to claim 14, which referred to the wireless network on demand is a wireless mesh network.

19. The device according to claim 14, in which is mentioned the response message of route mentioned means to respond is transmitted in the unicast mode in the source node.

20. The device according to claim 14, in which the address referred to on the destination node is one of the address of the Internet Protocol and the address control access to the transmission medium.

21. The device according to claim 14 in which the said destination node includes the destination nodes associated with one of: a proxy and access point.

22. The device according to claim 14, further comprising means for response to the merchant request message route, as if it was referred to by the request message of the route.

23. The device according to claim 16, in which the mentioned temporary direct route available to transmit data frames when receiving the above-mentioned response message route through the mentioned source node.

24. The device according to claim 16, in which the mentioned route is the optimal route, and in which, further, the said response message route is the first response message to the route.

25. The device according to claim 24, which further comprises means for receiving additional response message of route to said destination node, wherein the additional response message route includes the best route between the destination node and the source node based on cumulative metrics in the request messages of the route taken by the destination host.

26. The device according to claim 25, in which if said temporary direct route is the best route, then the additional response message route serves as a confirmation, and if the temporary direct route is the best route, then the additional response message route is used in order to set the optimum route when receiving the additional response message route through the mentioned source node.



 

Same patents:

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to a wireless communication device which employs a communication protocol for transmitting and receiving data using a data validation bit. The device includes a unit for determining received data, which performs data validation for received data using a data validation bit for determining whether data are erroneous; a unit for transmitting received results which, if it is determined that the data are erroneous, discards the data and transmits a retransmit request to another wireless communication device of a transmission source, while if it is determined that the data are not erroneous, transmits a message indicating that the data are valid to another wireless communication device of the transmission source; and a retransmission request unit which determines whether the data format is right or wrong, and if it is determined that the data format is right, forwards the data for given processing, while if it is determined that the data format is wrong, discards the data and transmits a request to the unit for transmitting received results to request data retransmission.

EFFECT: high transmission throughput.

11 dwg

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to communication. The present invention discloses a method and a system for processing uplink control signalling feedback. Said method includes: a base station configuring a feedback mode of uplink control signalling for user equipment, wherein the feedback mode is used for instructing the user equipment how to transmit the uplink control signalling on a physical uplink control channel (PUCCH) and/or a physical uplink shared channel (PUSCH); and the user equipment transmitting the uplink control signalling according to the feedback mode.

EFFECT: present invention ensures that the base station can correctly demodulate the uplink control signalling.

16 cl, 14 dwg

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to wireless communication. The proposed method transmits, during single-user transmission, a portion of the basic service set identifier (BSSID) of an access point in a field of a header that is usually used to indicate the number of space time streams (Nsts).

EFFECT: transmitting information in unused fields of a physical layer header to improve performance of the system.

14 cl, 10 dwg

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to mobile communication systems. A mobile communication method according to the present invention includes, in the presence of multiple relay nodes RN#1-#3 connected to a radio base station DeNB, a step of transmitting, by the radio base station DeNB to a radio base station eNB, identification information (PCI or ECGI) of cells #1-#3 operating under control of relay nodes RN#1-#3, as identification information of cells operating under control of the radio base station DeNB.

EFFECT: generating control information in a radio base station eNB when a mobile station UE performs handover to a cell operating under control of a relay node RN.

2 cl, 9 dwg

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to a communication device for the establishment of an indirect communication channel between this communication device and at least another communication device. A data transmission service chosen out of a set of data transmission services is associated with an identification code. The latter identifies the communication device. The data related to the identification code is sent to a server. The data is transmitted preferably through a radio-frequency communication interface. The identification code is transmitted in a broadcasting mode during the pre-set time interval to be received at least with another communication device. Transmission in the broadcasting mode is performed preferably through a non-radio-frequency interface of near communication.

EFFECT: technical result of the invention consists in simple, intuitive and instantaneous initiation of communication between two communication devices.

21 cl, 6 dwg

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to means of receiving/transmitting data in a wireless communication system. The method includes fragmenting a data packet into two or more fragments; configuring a medium access control protocol data unit (MAC PDU), the MAC PDU including at least one of the two or more fragments, a first header containing control information about the MAC PDU which includes the at least one of the two or more fragments, and a fragmentation extended header (FEH) providing information on the data packet fragment, wherein the first header contains an indicator indicating that the FEH is present following the first header, wherein the FEH contains a type field identifying a type of the FEH and the FEH has a variable length depending on whether the fragmented data packet is a real-time data packet or not, and wherein the FEH has a shorter length when the fragmented data packet is a real-time data packet than when the fragmented data packet is a non-real-time data packet; and transmitting the configured MAC PDU to a receiving side.

EFFECT: shorter header processing time.

12 cl, 13 dwg, 17 tbl

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to mobile communication and particularly to a method, an apparatus and a system for configuring a codebook. The technical result is achieved through a method which includes the transmitting side selecting a limited subset of codewords and informing the receiving side on the limited subset of codewords, wherein the limited subset of codewords contains part or all codewords in a first codebook and/or a second codebook; and the receiving side selecting an optimum precoded word from the limited subset of codewords and informing the receiving side on the index of the optimum precoded word.

EFFECT: easier computation performed by the receiving side when selecting a codeword and fewer cases when the receiving side erroneously selects a codeword.

9 cl, 2 dwg, 8 tbl

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to mobile communication. mobile communication method includes a step of selecting, by a radio base station eNB#10, when a subframe designated by a sequence of an almost blank subframe (ABS), the sequence being sent from a radio base station eNB#1, matches a subframe selected as a multicast broadcast single frequency network (MBSFN) subframe, the matching subframe being selected as an MBSFN subframe used for enhanced inter-cell interference coordination (eICIC).

EFFECT: enabling change of selection of an MBSFN subframe which is not used for eICIC and selection of an ABS and an MBSFN subframe used for eICIC.

2 cl, 13 dwg

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to wireless communication and can be used for efficient physical uplink control channel resource allocation for carrier aggregation. A base station receives control information from a user terminal in a first set of radio resources at an uplink primary component carrier associated with a first downlink component carrier if the user terminal is scheduled to receive downlink transmission at a first single downlink component carrier, and on a second set of radio resources at an uplink primary component carrier, wherein said resources in the second set are additional radio resources compared to resources in said first set, if the user terminal is scheduled to receive downlink transmission at a second single downlink component carrier or multiple downlink component carriers.

EFFECT: facilitating adaptive switching between two sets of different resources depending on downlink allocation.

34 cl, 13 dwg

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to radio communication. The technical result is achieved due to that, when determining frequencies used by a relay station in a system for assigning cut-off frequencies, the centre frequencies most susceptible to interference from signals of the relay station are determined in order to avoid assigning corresponding frequencies. In an alternative version, the centre frequency of an adjacent cell which can be affected by interference from the signal of the relay station is changed depending on the location of the relay station and the number of positions in which the probability of interference with the centre frequency of the neighbour cell is high is reduced by establishing a region of cut-off frequencies available for assignment to the relay station, depending on the location of said relay station.

EFFECT: matching interference between cells.

24 cl, 29 dwg

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to means of receiving/transmitting data in a wireless communication system. The method includes fragmenting a data packet into two or more fragments; configuring a medium access control protocol data unit (MAC PDU), the MAC PDU including at least one of the two or more fragments, a first header containing control information about the MAC PDU which includes the at least one of the two or more fragments, and a fragmentation extended header (FEH) providing information on the data packet fragment, wherein the first header contains an indicator indicating that the FEH is present following the first header, wherein the FEH contains a type field identifying a type of the FEH and the FEH has a variable length depending on whether the fragmented data packet is a real-time data packet or not, and wherein the FEH has a shorter length when the fragmented data packet is a real-time data packet than when the fragmented data packet is a non-real-time data packet; and transmitting the configured MAC PDU to a receiving side.

EFFECT: shorter header processing time.

12 cl, 13 dwg, 17 tbl

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to Internet communication. The system employs network elements, which include an acceleration server, clients, agents and peers, where communication requests generated by applications are intercepted by a client in the same computer. The IP address of the server is transmitted to the acceleration server, which provides a list of agents for use for said IP address. One or more agents respond with a list of peers who previously possessed some or all of the content, which is a response to said request. The client then downloads data from said peers in parallel and in parts.

EFFECT: reducing network overload for content owners and Internet service providers.

16 cl, 15 dwg

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to handover between technologies for multi-mode mobile devices and is designed for handover of a multi-mode mobile device from a first network technology to a second network technology. The method includes initiating by the multi-mode mobile device a first packet session in a first wireless network in an area of multi-technology wireless coverage and detecting by a multi-mode mobile device a second wireless network supporting a different access network technology than the first wireless network; determining a quality of service requirement for services supported by the session, and completing initial network entry and session establishment procedures by the multi-mode mobile device for a second session in the second wireless network when the first session includes at least one of a QoS sensitive service and real time service by the first wireless network and mobile device, and not completing initial network entry and session establishment procedures by the multi-mode mobile device when no QoS sensitive service and real time services are supported by the mobile device and first wireless network.

EFFECT: high throughput.

8 cl, 4 dwg

FIELD: measurement equipment.

SUBSTANCE: invention relates to drilling equipment, namely, to devices of sensor switching, which measure drilling parameters directly in process of drilling within a telemetering system. The device comprises a body and contact elements, is located inside a drilling pipe and made in the form of a jet element, including a supply balloon with compressed gas, a jet unit of command signal generation, jet triggers with a count input, jet units of inverters, jet logical elements "AND" and "OR" and a jet unit of output signal generation, besides, the output of the jet unit of command signal generation is connected with the input of jet triggers, outputs of which are connected with inputs of the jet unit of inverters, and outputs of inverters are connected with inputs of jet logical elements "AND" connected to outlets of bottomhole sensors, outputs of elements "AND" are connected with inputs of the logical element "OR", the output of which is connected to the input of the jet unit of output signal generation.

EFFECT: increased reliability of bottomhole sensor switching within a telemetering system.

1 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to data transmission systems. A transmission system (1) transmits and receives basic data needed to reproduce an image or audio and extended data used to improve image and audio quality through a communication network (2) between transmission terminals (10). The transmission system (1) includes: a basic data relay system (40) which includes: a plurality of basic data relay modules (430) for relaying basic data transmitted from a source transmission terminal from among transmission terminals (10) to a target transmission terminal from among transmission terminals (10); and a selection module which selects one basic data relay module (430) from among basic data relay modules (430) for each communication between transmission terminals (10); and an extended data relay system which includes: an extended data relay module (36) for relaying extended data transmitted from a source transmission terminal to a target transmission terminal.

EFFECT: reduced load on a specific relay server when transmitting images and audio.

10 cl, 29 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to multiservice communication networks. The method includes setting a table of priorities, wherein each user terminal is assigned a priority at its static IP address; determining the priority of a new connection from the table of priorities in accordance with the IP address of the sender terminal; reading values of the required resource for the new connection from the header of its IP address; calculating free access network resources; determining if there are existing open connections with a lower priority than the new connection; comparing their overall resource with the required resource for the new connection; if insufficient, the connection is denied service; if sufficient, the relative resource consumption of said connections is calculated; ordering the selected open connections; selecting from the ordered open connections one or more connections, starting with the connection with the maximum value, after which said connections are terminated, and the freed resource is provided to the new connection.

EFFECT: high efficiency of using communication resources in multiservice networks.

1 cl, 3 dwg

FIELD: physics, computer engineering.

SUBSTANCE: group of inventions relates to means of controlling data streams in secure distributed information systems. The method includes specifying a table of reference routing files of a distributed information system in test operating mode thereof, consisting of reference routing files for all authorised users when said users access information resources and services of certain network nodes of the distributed information system. After permission to transmit a data stream in a switching unit at a certain network node, routing files are generated thereon when the i-th user accesses information resources and services of the j-th network node of the distributed information system; the obtained routing files are transmitted to an access control centre. The obtained routing files are compared with reference values; the j-th network node of the distributed information system is remembered when accessed by the i-th user if the routing files do not match. The switching table is then corrected and, using the new network interaction parameters, said data stream is blocked, and transmission continues in case of a match.

EFFECT: improved security of distributed information systems.

2 cl, 4 dwg

FIELD: information technologies.

SUBSTANCE: reception of a coded voice signal transmitted by user equipment. A coded voice signal comprises the first subflow, the second subflow and the third subflow, and to the first subflow a segment of cyclic redundant code (CRC) control is connected. Processing by decoding of the first subflow, the second subflow and the third subflow by application of the decoding logic. The decoding logic based on the auxiliary solution according to CRC is adapted to perform processing by decoding of the first subflow. Transmission of decoding results of the first subflow, the second subflow and the third subflow into a controller of base stations. The result of decoding of the first subflow includes a decoded bit stream and CRC result.

EFFECT: increased quality of a voice signal.

20 cl, 20 dwg

FIELD: physics, communication.

SUBSTANCE: invention relates to wireless networks of cellular structure with processing of messages of route request in on-demand routing protocols. The technical result is achieved by the fact that location of the actual route is detected between a source unit and a destination unit on the basis of the first intermediate unit responding to the message of route request by means of the route response message, having the actual route to the unit of destination, besides, the intermediate unit responds to the message of route request on the basis of flag condition in the message route request, and the first intermediate unit resets the specified flag; a connection is established between the source unit and the destination unit using the actual route; location of a more optimal route is detected between the source unit and the destination unit, when the destination unit selects a more optimal route on the basis of summary through metrics of routing; and a connection is established between the source unit and the destination unit using the more optimal route.

EFFECT: technical result is detection of a route with an optimal metric without delay in route detection in wireless cellular/randomly organising networks.

2 cl, 6 dwg

FIELD: radio engineering, communication.

SUBSTANCE: method for automatic configuration of OpenFlow switches and OpenFlow routers comprises modifying network traffic tables of OpenFlow equipment. A network packet is forwarded to the controller of a software-configurable network with an included module for determining the write priority in the network traffic table, wherein the set of quality parameters of the network traffic is determined using parameters which correspond to a class of traffic with which said packet is associated, and the priority of the packet specified by the first three bits of the ToS byte; if the ToS byte is not specified in the network packet, the entry corresponding to the network packet in the network traffic table is assigned the lowest priority; if the ToS byte is specified in the network packet, the packet is associated with one of three traffic classes, and the packet is then assigned a write priority in the network traffic table, calculation of which is carried out based on a weight coefficient and an OpenFlow statistics parameter corresponding to a selected traffic class, and also based on the packet priority specified by the first three bits of the ToS byte; the controller of the software-configurable network, in accordance with the OpenFlow protocol, then generates an instruction to add a new entry into the network traffic table of the OpenFlow switch or OpenFlow router.

EFFECT: faster operation of OpenFlow switches and OpenFlow routers when processing network packets.

2 dwg

FIELD: computer science, in particular, engineering of device for input-output of information in electronic computing machine, transferred along communication channels for transferring information; in particular, device is meant for acting as an intellectual multi-port telecommunication port of personal computer, used in mode of central transport station in data transfer networks for specialized use.

SUBSTANCE: multiplexer has system block, wherein four-channeled telegraph one-polar and two-polar modules are positioned, as well as four-channeled standard-joint C2 module, bi-impulse one-channeled and two-channeled modules, one-channeled telephone module, m modules of four-channeled asynchronous adapter, group control electronic board, and also block for adjustment and control, and combination board.

EFFECT: expanded functional capabilities, possible increase of number and types of connected input-output channels, possible synchronization with several types of specialized equipment.

4 cl, 4 dwg, 1 tbl

Up!