ROUTING OF A COMMUNICATION IN A WIRELESS TELECOMMUNICATIONS NETWORK

• US 20100303077A1
• Filed: 09/16/2008
• Published: 12/02/2010
• Est. Priority Date: 09/21/2007
• Status: Abandoned Application

• Current Assignee: Selex Communications SPA (Leonardo S.p.A.)
• Original Assignee: Selex Communications SPA (Leonardo S.p.A.)
• Inventors: Poggi, Maurizio, Bruno, Vittorio, De Domenico, Maurizio, Tittoni, Patrizia, Carriero, Michele
• Application Number:
  US12/678,132
• Publication Number:
  US 20100303077A1
• Time in Patent Office: Days
• US Class Current: 370/392
• CPC Class Codes: H04L 45/16 Multipoint routing
• CPC Class Codes: H04L 45/308 Route determination based on user's profile, e.g. premium users
• CPC Class Codes: H04W 40/04 based on wireless node resources
• CPC Class Codes: H04W 40/12 based on transmission quality or channel quality

Abstract

A method for routing data packets in a network including a plurality of nodes (2); the method comprises the operations of arranging in each node (2) transceiver units (4, 6, 8, 10) to transmit and receive the data packets and arranging processing means to process message data comprising attributes for identifying at least one transmitter node (20) and at least one receiver node (22). The method further comprises the operations of defining for each node (2) a plurality of static criteria, indicative of nominal configuration parameters for the nodes (2), and dynamic criteria, indicative of current operational conditions of the nodes (2), and sending from the transmitter node (20) to a plurality of intermediate receiver nodes (2) query data to search for at least one transmission route. Subsequent operations are: repeating the sending of the query data from at least one of the intermediate receiver nodes (2), selected according to the static and dynamic criteria, to successive nodes in order to reach the receiver node (22) thus defining an optimal route (24), receiving at the transmitter node (20) response data originating from the receiver node (22), and routing the message data along the optimal route (24), from the transmitter node (20) to the receiver node (22).

Claims

1. A method for routing a communication comprising data packets in a mesh wireless telecommunication network including a plurality of communication nodes (2), the method comprising in combination the operations of:

arranging in each node (2) a plurality of transceiver units (4, 6, 8, 10) arranged to transmit and receive the data packets using a pre-established transmission channel;

arranging processing means, associated with each node (2) and able to process message data comprising attributes for identifying at least one transmitter node (20) and at least one receiver node (22) of the message;

defining for each node (2) a plurality of static criteria indicative of nominal configuration parameters of the nodes (2) and dynamic criteria indicative of current operational conditions of the nodes (2);

sending from the transmitter node (20) to a plurality of intermediate receiver nodes (2) data querying the nodes (2) to search for at least one transmission route for the message data to the at least one receiver node (22);

repeating the sending of the query data from at least one of the intermediate receiver nodes (2), selected according to the static and dynamic criteria, to successive nodes in order to reach the at least one receiver node (22) thus defining an optimal route (24);

receiving at the transmitter node (20), along the optimal route (24), response data originating from the at least one receiver node (22);

routing the message data along the optimal route (24), from the transmitter node (20) to the receiver node (22).

2. The method for routing a communication according to claim 1, further comprising the operation of:

encrypting the message data in a symmetric modality.

3. The method for routing a communication according to claim 1, further comprising the operation of:

encrypting the message data in an asymmetric modality.

4. The method for routing a communication according to any one of the preceding claims, further comprising the operation of:

calculating and attaching a digital signature to the message data.

5. The method for routing a communication according to any one of the preceding claims, the communication comprising voice signals able to be exchanged between the nodes (2).

6. The method for routing a communication according to any one of the preceding claims, wherein said static criteria are at least one among:

availability of the transceiver units (4, 6, 8, 10), priority of use of the transceiver units (4, 6, 8, 10) and number of predefined attempts for the communication.

7. The method for routing a communication according to any one of the preceding claims, wherein the dynamic criteria are at least one among:

priority of the message data, size of the message data, distance between the nodes (2), state of the transceiver units (4, 6, 8, 10), priority of the nodes (2), historic record of a previous communication.

8. The method for routing a communication according to any one of the preceding claims, the nodes comprising transceiver units (4, 6, 8, 10) arranged to transmit and receive the data packets using a different pre-established transmission channel, including HF, VHF, UHF, satellite terminal and wireless telephone.

9. A data packet routing system arranged to execute the method as claimed in any one of claims 1 to 8.

10. A communication network arranged to operate according to the method as claimed in any one of claims 1 to 8.

11. A network node comprising a radio base station and a mobile terminal station arranged to operate according to the method as claimed in any one of claims 1 to 8.

12. A processing program or group of programs, which can be executed by a processing system, and which comprise(s) one or more code modules for implementing a method for routing data packets according to any one of claims 1 to 8.