EP1423944A1 - Procede pour acheminer des communications dans un reseau ad hoc assiste par radio et station reseau permettant la mise en oeuvre de ce procede - Google Patents

Procede pour acheminer des communications dans un reseau ad hoc assiste par radio et station reseau permettant la mise en oeuvre de ce procede

Info

Publication number
EP1423944A1
EP1423944A1 EP02760330A EP02760330A EP1423944A1 EP 1423944 A1 EP1423944 A1 EP 1423944A1 EP 02760330 A EP02760330 A EP 02760330A EP 02760330 A EP02760330 A EP 02760330A EP 1423944 A1 EP1423944 A1 EP 1423944A1
Authority
EP
European Patent Office
Prior art keywords
network
information
network station
station
stations
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
EP02760330A
Other languages
German (de)
English (en)
Inventor
Enric Mitjana
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia Solutions and Networks GmbH and Co KG
Original Assignee
Siemens AG
Nokia Siemens Networks GmbH and Co KG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens AG, Nokia Siemens Networks GmbH and Co KG filed Critical Siemens AG
Priority to EP02760330A priority Critical patent/EP1423944A1/fr
Publication of EP1423944A1 publication Critical patent/EP1423944A1/fr
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/02—Terminal devices
    • H04W88/04—Terminal devices adapted for relaying to or from another terminal or user

Definitions

  • the invention relates to a method for routing connections in an ad hoc network with the preamble features of claim 1 and a network station for performing such a method.
  • a wireless or radio-supported ad hoc network is a type of self-organizing network, in particular a local radio network (WLAN: Wireless Local Area Network).
  • a particular advantage lies in the great mobility, through which the topology of the network can change as desired.
  • this also means that there may be a particularly good connection to a large number of other network stations at certain points in time at certain locations, while it may not be possible to connect to another network station at the same point in time at other times.
  • the situation is similar with the quality of radio connections between individual network stations, so that data rates, delays, quality of service (QoS: Quality of Service) etc. can fluctuate greatly from time to time and from place to place.
  • QoS Quality of Service
  • a network path or a route must be established between network stations communicating with one another, the route possibly passing through a large number of network stations located between them, such transmissions over several stations also being referred to as “hopping” or “hops” ,
  • Simple ad hoc communication systems such as the communication system known under the name “Bluetooth *, serve as a replacement for cable connections, for example as accesses to local networks by means of a notebook and the like.
  • Bluetooth * When two such stations are "discovered", information about the possible services is exchanged between the terminals.
  • These are services that do not change appreciably over time, such as print functions or copy functions, in order to copy data from a notebook into a central memory of a network.
  • functions for setting up a route across several stations are far removed from Bluetooth, as they are direct point-to-point connections.
  • a master station is defined that controls and establishes access to the piconet by mobile stations.
  • the first developments in ad hoc networks come from the military sector, for example to exchange data on a battlefield between appropriately distributed network stations, and from the field of civil protection, in order to be able to set up a large-scale communication network after natural disasters in the event of a destroyed communication structure.
  • the routing is determined and optimized on the basis of GPS-determined (GPS: Global Positioning System) geographic positions of the individual network stations. This procedure is in
  • Positioning is not precise enough for networks, e.g. with 5 terminals in a 50sqm room with GPS accuracies around 100m.
  • the network stations try to establish a distant view by determining information from non-neighboring network stations.
  • the distant view is z. B. built on the basis of anchored geodetic points, the shortest geodetic path being sought and calculated for distant network stations with knowledge of their direction. If there are no network stations on this geodetically shortest route with the possibility of transmitting the data or information further, a path is sought within the smallest possible angle in the destination direction in which network stations with the possibility of relaying are located.
  • a route vector is built up from a list of anchor points and / or network station identification numbers, this list being sent as header information for the subsequent transmission of user data for routing the data.
  • proactive protocols an attempt is made to discover a route, and the discovered routes are constantly checked for their durability, regardless of whether the routes are used or not. Examples of this are the traditionally known link status and distance vector protocols in existing different types of communication systems.
  • the reactive protocols on the other hand, only set up a route if there is a need for it.
  • DSR Dynamic Source Routing
  • AODV Ad-hoc On demand Distance Vector Routing
  • the object of the invention is to propose a method for routing connections in an ad hoc network.
  • connection requests in each individual network station enables simple and effective routing without having to carry routing lists in data packets to be transmitted.
  • an intermediate station fails, it is not necessary to determine complete routes and to exchange them between the end stations.
  • a search for a new intermediate station is carried out only in the affected section of the route.
  • the interposed network stations additionally count up a counting value, so that the receiving network station can use the counting value to recognize how many jumps or hops the network station is away, which is the particular service or that offers special functionality.
  • this enables the selection of a route with as few jumps as possible in the case of several possible routes, and on the other hand also enables an assessment of the security of the connection over a longer period of time and the quality of the connection.
  • Sending messages or information about the special functionality of a network station advantageously supplies surrounding network stations with the necessary data in order to recognize on the one hand that a specific functionality of an external network station can be used and on the other hand which network station and / or services are concerned acts.
  • the forwarding of information present in a network station to a directly adjacent network station which in turn receives this data or information and forwards it as separate data to other network stations directly adjacent to it, enables effective routing, which has advantageous aspects of both conventional short-sighted as well as a conventional far-sighted routing method.
  • each of the network stations knows which functionality the directly neighboring network station itself has or can convey and which connections requested by direct neighboring stations have been forwarded to which direct neighboring stations.
  • identification information is expediently transmitted on the one hand with the routing data and on the other hand stored in the corresponding network station. This enables routing without, on the one hand, regional knowledge of the wider neighborhood and, on the other hand, routing according to the conventional routing method for far-away network stations, each with rigid routes and complex header information with the entire required data of the route.
  • Each network station routes or forwards its own or incoming data packets in accordance with its own current knowledge and can independently search for a new route if a required neighboring station fails.
  • the source network station does not have to enter a detailed route in each individual packet header, which in turn leads to a lower system load.
  • the ratio of information load to payload in the data packets is significantly improved.
  • Under the directly adjacent network station standing understood a network station that can be reached with a direct connection without jumps.
  • Fig. 1 shows an arrangement of ad hoc network stations with connections in between and
  • Fig. 2 information in signaling messages and sections of the data storage area of a preferred network station for storing routing information.
  • an exemplary ad hoc network consists of two or more communicating with one another
  • Network stations Nl - N9 can independently establish connections without the need for a central network device.
  • a connection V3, V7, V8, V9 to a remote network station N9 is to be established starting from a first network station N1.
  • Communication connections V2 to a network station N2, V3 to a network station N3 and V4 to a network station N4 can be set up or set up from the network station N1.
  • a further communication connection V8 leads from the network station N7 to a network station N8, which in turn communicates with the network station N9 via a communication connection V9.
  • the communication connections should each be suitable for different maximum transmission rates.
  • the communication link V5 should only allow a data rate of 100 kbps and the communication link V9 should enable a maximum data rate of 1,000 kbps.
  • the other communication connections V2 - V4, V ⁇ - V8, V10 - V13 should allow maximum data rates of 300 kbps.
  • the individual network stations Nl-N9 in particular also have a memory for storing operationally relevant parameters.
  • data relevant to routing is additionally stored in this or in another memory.
  • the routing is then carried out by the individual network stations N1-N9 themselves, the individual network stations preferably only having knowledge of directly adjacent network stations.
  • a directly adjacent network station is to be understood as a network station that does not have relay stations or intermediate stations, i.e. can be reached without jumps or hops / hopping with a single direct connection.
  • a routing method of a conventional manner can of course be used in parallel or in addition.
  • a suitable route is set up in a first step, with certain performance restrictions or performance Minimum requirements can be specified and taken into account directly.
  • a path or route from the network station N1 requesting communication to the desired communication network station N9 must be set up.
  • the conditions under which a connection can be established are examined. For example, this is a minimum required quality of service (QoS) to ensure packet transmission with the required quality of service.
  • QoS quality of service
  • üs- resources sen along the path to be reserved to allow the connection, and this requirement is not absolutely necessary in the described embodiment, since 'the route in the event of failure of a single intermediate or relay station by the neighboring stations can be set up again on the route.
  • Priorities could preferably be defined in the reservations, which then lead, for example, to restrictions on specific throughputs.
  • the routing should be carried out as simply as possible with a view to the quality of service for the individual network stations N1-N9 or network nodes.
  • the individual network stations Nl-N9 do not have to have detailed knowledge of the network topology, ie of network stations N5, N6-N9, which are not directly adjacent, in order to carry out the method described below. In the preferred exemplary embodiment, this also means in particular that when a network station is added or deleted, only the directly adjacent network stations are informed with a view to the network topology change.
  • the neighboring network stations can also determine themselves when the network stations are removed that the other network station is no longer there, since it no longer reacts to requests, for example because of their failure or unwillingness to continue to be used as a relay station. In particular, it is also not necessary to carry out a position determination via GPS (Global Positioning System) in such mobile environments.
  • GPS Global Positioning System
  • the first network station NI should enable a specific communication connection for its user or the provision of a specific service or functionality.
  • the first network station N1 sends a service or connection request message SA via a communication channel which is monitored by one or more neighboring network stations N2, N3, N4.
  • the communication channel can be an existing communication connection V2 - V4, but can also be a general message channel, in which case the requesting network station N1 or RN (requesting node) does not have to have any knowledge of the other network stations N2 - N4, in principle shouldn't even have known that it itself is part of a network.
  • connection request message SA can carry a large amount of information. In a preferred embodiment, however, it is kept as short as possible, and it should expediently contain some basic information, which is represented in FIG. 2 by the first three fields of the corresponding block diagram.
  • the connection request message SA includes in particular a request identification number R-ID, in the present exemplary embodiment the request identification number R123, a service or connection identification number S-ID for identifying the requested connection or service type and one Node or network station identification number N-ID. Further information can relate to the requested minimum quality of service QoS and the transmission time, for example.
  • the request identification number R-ID should be a unique and unique number or character string in the ad hoc network.
  • This request identification number R-ID serves to uniquely identify the connection request SA for the entire life of this connection request in the network.
  • the service or connection identification number S-ID represents the destination or the destination network station N9, which can offer the desired service or the desired conversation partner (PN: Providing Node).
  • the target can be a network station on the one hand, which can provide a specific service or a gateway function to another communication system, so that a search not only for a specific device number but also for a specific service feature within the ad hoc - Network can be carried out.
  • the destination can also be a specific conversation partner or communication partner who operates a clearly identifiable network station N9 / PN. In this case, it can be, for example, the device number that is unique and assigned to each network station.
  • the service or connection identification number S-ID thus serves neighboring stations or neighboring network stations N2-N4, which receive a connection request message SA from the requesting network station NI / RN, in order to determine whether or not they can offer the desired service they are the network station N9 requested for a communication link.
  • the node or network station identification number N-ID is chosen such that other network stations N2-N4 of the network, when they are known and the possibility of establishing a direct communication connection via a peer-to-peer channel or a point-to-point channel Connection V2 - V4 can communicate with this network station Nl.
  • the communication connections V2-V4 are thus preferably individual communication connections, so that the use of a channel common to all network stations Nl-N9 can be avoided.
  • the network station identification numbers N-ID can either be assigned randomly within the ad hoc network or consist of unique device identification numbers. In the case of free assignment of network station identification numbers N-ID, it is sufficient for the routing method described here that those network stations N1-N3 which are able to establish direct communication connections V2-V4 with one another on the basis of the spatial position, have different network station Identification numbers have N-ID.
  • the transmission of the required quality of service QoS serves to transmit minimum requirements with regard to delays, jitter, bandwidth, permissible probability of packet loss, costs, energy consumption, etc., so that if the quality of service QoS is insufficient, a requested connection establishment is rejected directly can.
  • Another informative criterion in this regard is the number of jumps or hops required along a route V3, V7, V8, V9.
  • the number of jumps No.Hops indicates the number of intermediate or relay stations N3, N7, N8 that lie on the route between the requesting and the serving network station N1 or N9.
  • the greater the number of jumps the greater the risk of the route being interrupted by switching off or removing a mobile network station from the transmission range of the further routes. members.
  • the greater the number of jumps the greater the energy consumption for a transmission can be with regard to the totality of all integrated network stations N1, N3, N7 - N9, since each forwarding station, just like the two actually communicating network stations, does energy for its activity consumed. This is especially true when error correction methods are used.
  • connection request message SA is received by a network station N9 which can provide the corresponding service or can be assigned to the desired interlocutor, this providing network station N9 or destination station PN sends a connection request response message SR to the requesting network station Nl / RN back. If only specific data is requested from the destination network station N9 / PN that is sufficiently specified in the connection request message, then corresponding data packets can also be sent back directly to the requesting network station N1 / RN.
  • Such data packets or, in particular, such a connection request response message SR likewise comprise various information, with an optical separation again being carried out in FIG. 2 between more important and less important information.
  • the more important information is in turn the request identification number R-ID, the service or connection identification number S-ID and the node or network station identification number N-ID.
  • the less important information is in turn information regarding the quality of service QoS that can be provided, the number of hops no. Hops, a status and the transmission time at the location of the forwarding and / or the destination network station N9.
  • the request identification number R-ID is identical to the request identification number R-ID that was contained in the connection request message SA.
  • the Service or connection identification number S-ID also corresponds to the original data and confirms that the providing or destination network station N9 can offer the requested service or communication partner.
  • the field for the node or network station identification number N-ID now corresponds to the number assigned to the target network station N9.
  • This network station identification number N-ID enables the network station N8, which is directly adjacent, to establish or maintain a direct communication connection V9 with the target network station N9.
  • the quality of service information QoS is usually a copy of the original data record that was transmitted by the requesting network station N1. In the event that the target network station N9 cannot offer the requested quality of service QoS, the value is reduced accordingly. After receiving the downgraded quality of service value, the requesting network station N1 can then decide whether the quality of service offered QoS is still sufficient or whether the communication connection to this target network station N9 should not be established.
  • the specification of the number of jumps required corresponds to the value that the target network station N9 received in the connection request message SA.
  • the requesting network station N1 can determine how many jumps are required and, depending on this, decide whether the communication link should be established or not. This is crucial information in particular for real-time services, since connection security and energy consumption, as well as the time delay in the transmission of data, depend directly on the number of jumps.
  • the field for the status information can take four values, for example “00 *,“ 01 *, “10 * and“ 11 *.
  • the status field for each of the requested quality of service parameters take one of the following values.
  • the number "00 *” can represent the general inability to be able to provide the requested service or connection. This value “00” can therefore mean that the requested network station cannot provide the required quality of service QoS or the service as such or that it cannot reach any other network station in its neighborhood that could offer this, in which case the requested station also acts as Intermediate or relay station should be approved and set up.
  • this status value "00 * is not necessary, especially not if other paths or routes to bypass the corresponding station are possible.
  • the status value "01 * can represent, for example, the possibility of providing the requested service or the requested communication connection if all or some of the transmitted requests can be reduced.
  • the status value "01 *" could be transmitted to signal that a requested bandwidth cannot be made available to the requested extent.
  • the status value “10 *” can be used to signal that the requested service or the requested communication connection could in principle be provided, but not at the current time.
  • the cause could be, for example, a momentary overload of the station or a momentary time limitation by the user of the station.
  • the requesting network station N1 receives a status value “10 *, it can make a corresponding note in order to initially search for other network stations with the appropriate capability and, in the event there is generally no possible connection, to try again at a later time to start.
  • the status value "11 *” could be used to signal the requesting network station NI that the provision of the service or the requested communication connection is possible.
  • the specification of a transmission time in the connection request message SA and / or the connection request response message SR serves to determine a lifetime for the messages.
  • the lifetime can be determined on the one hand by the fact that it concerns the actual transmission times, from which a certain period of validity can be assumed, but it can also be a calculated transmission time, i.e. Act an actual airtime plus a lifetime to indicate an endlife. This is e.g. can be implemented by initializing a count value from the transmitting station and adding -1 at each hop by the relay stations. If the count value is 0, the packet is no longer forwarded.
  • the transmission time serves to release or delete corresponding registrations in the memories of the individual network stations N1-N9.
  • connection request message is not received by the destination network station N9 but by another network station N2-N4 which is directly adjacent to the requesting network station N1, the connection request message is sent by this receiving network station N2 - N4 processed further. If the receiving network station N2 - N4 is able to forward the requested services or communication connections, the receiving network station N2 - N4 forwards the connection request message SA to its directly neighboring network stations N5 - N7. This can be done via a shared channel or a direct communication channel. The contents of the new connection request message SA ideally correspond to those of the received connection request message SA. If a field with the information about If the number of hops No.
  • hops is contained in the connection request message, the numerical value entered therein is increased by the value "1 *.
  • the received connection request message SA did not contain any such information, such an information field about the number of hops No. hops required is appended to the forwarded or independently sent new connection request message SA or in this used.
  • the forwarding network station N2-N8 stores the information of the received and the forwarded or sent connection request messages SA in its network station memory M3.
  • An image of the exemplary memory content is shown using the example of network station N3 in FIG. 2.
  • the memory M3 contains in particular the information about the request identification number R-ID, about the neighboring network station N1, N4, N5, N7 from which it was received and about the neighboring network station N7, N4, to which this connection request message SA continues - was directed.
  • information about the requested or possible quality of service QoS, the number of jumps required or jumps made No. hops, the status, the reception time or the transmission time and about the station performed by the present station are also advantageously stored or procedure to be performed.
  • a forwarding network station N2 is not able to offer a certain requested data rate in the event of a further connection to a directly neighboring network station N5
  • a connection request message SA arriving later with a correspondingly higher possible quality of service for a later route can also be provided be used.
  • forwarding again is not expedient.
  • connection request message SA can also be retransmitted at any later times by any station on an existing, established route V3, V7, V8, V9 to its neighboring network stations if the originally established route fails due to the failure of one of the network stations used should be interrupted. In this way, the two network stations between which the route was interrupted can independently search for a new connection.
  • connection request messages SA The process of sending and forwarding connection request messages SA is repeated until a target network station N9 / PN has been found in the ad hoc network or the connection request messages SA based on the original airtime or lifespan are considered invalid.
  • connection request response messages SR are handled in the same way in which connection request messages SA are received and forwarded, in particular redesigned, forwarded by a forwarding or relay network station N2-N8.
  • Reply messages SR receive new entries from the forwarding stations in the field of the network station identification number N-ID.
  • the network station number of the relay station is entered accordingly in this field.
  • the network stations Nl-N9 are able to receive further incoming information, signaling or data packets at a later point in time with the same requirement
  • Each forwarding network station N2-N8 therefore only needs to have knowledge of the received and forwarded data and information with regard to its previous and next network station in the requested connection sequence.
  • the requesting network station N1 / RN does not receive a connection request response message SR within a predefinable period of time, it can conclude that currently no connection or service provision is possible within the ad hoc network.
  • the requesting network station N1 or a forwarding network station N2-N8 a connection request Receiving response message SR in different ways, it can make the decision with regard to the structure of the route for the transmission of data packets depending on the predefined restrictions or possibilities. In order to increase redundancy and diversity, it is also possible to create one
  • the requesting network station NI / RN receives a connection request response message which has a status field as described above, it has various options for reacting.
  • the requesting network station N1 concludes that the provision of the service or a corresponding communication link is generally not possible at the moment.
  • the requesting network station N1 / RN can decide to reduce the quality of service requirements and to restart the procedure described above to determine a suitable route.
  • the knowledge obtained about the previous possible routes can also be used to send out a connection request message SA with a reduced requirement.
  • the requesting network station NI / RN can decide to defer the connection request for a predefinable time and to start the whole process again at a later time.
  • the information already obtained about the Oretically possible routes can be used to send a new connection request message SA.
  • the requesting network station N1 / RN continues the routing process by sending a reservation message about the route, as a result of which the individual relay network stations N2-N8 are informed that the forwarding is carried out accordingly and corresponding resources keep clear for that.
  • This reservation information can be stored in the memory M3 of the relay relay stations N3, N7, N8 concerned by an entry in a use field Use? be made. Data packets with the request identification number R-ID received later in the forwarding network stations are then forwarded directly from network station to network station.
  • the above existing procedure thus solves the routing problem, in particular with a view to a required quality of service QoS, without the individual network stations Nl-N9 the exact topology of the ad hoc network in a closer environment or even the topology of the entire ad hoc network need to know.
  • the routing method thus builds on the possibilities and capabilities of each individual network station Nl-N9.
  • the calculation of complicated route optimization algorithms can be avoided.
  • the repeated updating of the data with regard to the signaling load is negligible.
  • the information in the entire network does not have to be updated accordingly each time.
  • the individual network stations Nl-N9 also have no knowledge of the capabilities of the neighboring or more distant network stations. If one of the receiving a connection request message SA If network stations N2 are unable to offer a corresponding service or to process this received connection request message SA accordingly, this leads to the termination of the route search in the corresponding branch V2 and accordingly to the consideration that is not carried out later this one network station N2. In particular, it is therefore also not critical if a network station N3, N7, N8 on the route should fail at a later point in time or should emigrate from the transmission area. A renewed route definition is then only required for the directly affected area of the route. The application can thus be used particularly advantageously in ad hoc networks with low mobility, for example in mobile computing environments in office buildings.
  • a loop solution can also be avoided by forwarding messages received only for the first time and suppressing the forwarding of identical messages received at a later time.
  • a possible sequence for establishing a communication connection between the first network station N1 and the last network station N9 is described below.
  • a quality of service feature QoS a connection with 300 kbps should be made possible. Instead, the value “Q3 *” is entered in the connection request message SA in FIG. 2.
  • the sequence described below assumes that only the connections V2-V13 shown in FIG. 1 exist or can be built up.
  • the maximum data rates that are made possible by the connections V2-V13 are, as described above, 100, 300 or 1,000 kbps, which is also indicated by the form of representation.
  • the requesting first network station NI / RN sends a connection request message SA with the fields request identification number “R123 *, network station identification number N-ID“ NI * and as a value for the quality of service QoS "Q3 *, which should stand for a data rate of 300 kbps.
  • This connection request message SA is received by the directly adjacent network stations N2, N3 and N4.
  • the following steps are carried out in these three neighboring network stations N2-N4. Since the network station N2 could only establish a connection V5 with a maximum data rate of 100 kbps to the neighboring network station N5, it behaves silently since it cannot meet the quality of service requirement.
  • network station N3 will forward the connection request message to the network stations N1, N4, N5 and N7 which are directly adjacent to it.
  • the network station identification field N-ID is updated to its own address value “N3 *.
  • the other fields of the connection request message SA are not changed when forwarding.
  • the network station N4 forwards the received connection request message SA after the insertion of its network station identification number N-ID “N4 * instead of the previous value to the network stations N1, N3, N6 and N7 adjacent to it.
  • connection request messages SA which were forwarded by the third network station N3 at the second point in time, are first considered.
  • the first network station Nl will ignore the connection request message SA received from the third network station N3, since the most original connection request message SA with the request identification number “R123 * came from itself. However, this reception of the returned Alternatively, the connection request message SA can also be processed as an acknowledgment of receipt in order to register that the third network station N3 has received the original connection request message SA. In order to reduce the general traffic, however, the third network station N3 could have already refrained from a corresponding retransmission during a transmission via direct communication links instead of the transmission via a channel for general access.
  • the fifth network station N5 will likewise no longer take the received, forwarded connection request message SA into account, since it cannot provide a connection with a data rate of 300 kbps for the further connection V5 to the second network station N2.
  • the fourth network station N4 will also ignore the connection request message SA since it had previously received a connection request message SA with the same request identification number “R123 *” from the first network station N1.
  • the seventh network station N7 will generate or forward a connection request message SA after changing the network station identification number N-ID in the connection request message SA to its own value “N7 *.
  • the transmission is received at a later time by the network stations N3, N4, N ⁇ and N8, but in the case of forwarding via direct communication connections, it is preferably only forwarded to certain of the neighboring stations N8, N ⁇ .
  • the forwarded connection request messages SA originating from the fourth network station N4 are handled in the individual neighboring states as follows. In the first network station N1, the received or returned connection request message SA is again ignored or treated as an acknowledgment of receipt, here by the fourth network station N4.
  • the third network station N3 will also ignore the connection request message SA, since it has already received a connection request message SA with the same request identification number “R123 *” from the first network station N1 at an earlier point in time.
  • the seventh network station N7 will also ignore the received, forwarded connection request message SA, since it has already sent the same connection request message SA with the same request
  • the sixth network station N ⁇ will generate and forward a connection request message SA after updating the network station identification number field to its own number N6.
  • the sixth network station N ⁇ will preferably not react, since in the present case it received the connection request message SA with the same request identification number “R123 *” simultaneously from both neighboring network stations N4, N7 that can communicate with it. Otherwise, it could update the network identification number field and forward.
  • the eighth network station N8 receives the connection request message SA and, after the field for the network station identification number has been updated to its own value “N8 *, forwards it to the ninth network station N9 continues.
  • the ninth network station N9 recognizes from the service or connection identification number S1 that it is suitable for responding to the connection request message and for having a corresponding communication connection set up.
  • the ninth requested network station N9 / PN generates a connection request response message SR and sends it via the future route, i.e. the connections V9, V8, V7, V3 or the network stations N8, N7, N3 back to the requesting first network station N1 / RN.
  • the forwarding or returning is carried out by the individual relay network stations N8, N7, N3 on the basis of their previously stored data for receiving and forwarding the connection request message SA.
  • the first network station N1 As soon as the first network station N1 has received the connection request response message SR, it can initiate the reservation of resources on this route, if this has not already been done in connection with the return of the connection request response message SR, and begin to transmit user data.
  • network station N7 use a different connection V12 to set up the route if this appears more suitable due to the parameters stored in the seventh network station N7 from previous receptions of the connection request messages SA. In particular, factors such as the possible quality of service or the number of jumps no. Hops can also be taken into account.
  • the possibility of updating a route in the event of failure of a network station by the directly adjacent network stations is particularly advantageous. These can then either check in their memory M3 whether there is an alternative connection option that was not preferred when the original route was selected, or search for a new route for the missing section of the route by resending the original connection request message SA. As soon as the corresponding network station on the other side of the interruption receives a corresponding connection request message SA, the interruption between these two network stations and thus a reconstruction of a new route can be initiated. In an advantageous manner, the entire route between the requesting first network station N1 and the last network station N9 offering does not need to be reconstructed or completely created. When a connection request message SA is retransmitted, it would also be expedient to transmit a further identification identifier in order to signal the receiving network stations that the original route has to be created again for at least one section.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé pour déterminer et établir un itinéraire entre une première station réseau (N1) requérante et une dernière station réseau (N9) de réponse dans un réseau ad hoc comprenant plusieurs stations réseau (N1 - N9). La première station réseau (N1) requérante envoie une information de demande (SA) correspondante aux stations réseau voisines (N2 - N4), lesquelles font suivre cette information. L'objectif de l'invention est de permettre l'obtention d'un acheminement efficace par l'intermédiaire des stations réseau directement voisines sans que la topologie du réseau soit connue. A cet effet, l'acheminement s'effectue de station réseau à station réseau, chaque station réseau (N1 - N9) transmettant l'information comme information propre (SA) aux autres stations réseau voisines et stockant les données pertinentes (R-ID, S-ID, N-ID, qualité de service, temps d'émission, nombre de sauts) de l'information reçue et de l'information retransmise (SA) en vue d'informations ou de paquets de données arrivant ultérieurement.
EP02760330A 2001-09-04 2002-09-03 Procede pour acheminer des communications dans un reseau ad hoc assiste par radio et station reseau permettant la mise en oeuvre de ce procede Ceased EP1423944A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP02760330A EP1423944A1 (fr) 2001-09-04 2002-09-03 Procede pour acheminer des communications dans un reseau ad hoc assiste par radio et station reseau permettant la mise en oeuvre de ce procede

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
EP01121192A EP1289201A1 (fr) 2001-09-04 2001-09-04 Méthode de routage dans un réseau ad-hoc sans fil et station utilisant cette méthode
EP01121192 2001-09-04
PCT/EP2002/009847 WO2003021885A1 (fr) 2001-09-04 2002-09-03 Procede pour acheminer des communications dans un reseau ad hoc assiste par radio et station reseau permettant la mise en oeuvre de ce procede
EP02760330A EP1423944A1 (fr) 2001-09-04 2002-09-03 Procede pour acheminer des communications dans un reseau ad hoc assiste par radio et station reseau permettant la mise en oeuvre de ce procede

Publications (1)

Publication Number Publication Date
EP1423944A1 true EP1423944A1 (fr) 2004-06-02

Family

ID=8178544

Family Applications (2)

Application Number Title Priority Date Filing Date
EP01121192A Withdrawn EP1289201A1 (fr) 2001-09-04 2001-09-04 Méthode de routage dans un réseau ad-hoc sans fil et station utilisant cette méthode
EP02760330A Ceased EP1423944A1 (fr) 2001-09-04 2002-09-03 Procede pour acheminer des communications dans un reseau ad hoc assiste par radio et station reseau permettant la mise en oeuvre de ce procede

Family Applications Before (1)

Application Number Title Priority Date Filing Date
EP01121192A Withdrawn EP1289201A1 (fr) 2001-09-04 2001-09-04 Méthode de routage dans un réseau ad-hoc sans fil et station utilisant cette méthode

Country Status (2)

Country Link
EP (2) EP1289201A1 (fr)
WO (1) WO2003021885A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2869182B1 (fr) * 2004-04-20 2008-03-28 Thales Sa Procede de routage dans un reseau ad hoc
US7639663B1 (en) 2005-03-04 2009-12-29 Itt Manufacturing Enterprises, Inc. Method and apparatus for dynamic channel access within wireless networks
US7502360B2 (en) 2005-03-04 2009-03-10 Itt Manufacturing Enterprises, Inc. Method and apparatus for dynamic neighbor discovery within wireless networks using time division multiple access (TDMA)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6097718A (en) * 1996-01-02 2000-08-01 Cisco Technology, Inc. Snapshot routing with route aging
CA2356947A1 (fr) * 1998-12-23 2000-07-06 Nokia Wireless Routers, Inc. Plan d'acheminement unifie pour l'interconnexion de reseaux ad hoc
US6836463B2 (en) * 1999-10-15 2004-12-28 Nokia Corporation System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO03021885A1 *

Also Published As

Publication number Publication date
EP1289201A1 (fr) 2003-03-05
WO2003021885A1 (fr) 2003-03-13

Similar Documents

Publication Publication Date Title
DE602005004744T2 (de) Kontrollvorrichtung, mobiles Endgerät und Kommunikationskontrollverfahren
DE60215340T2 (de) Verteiltes Funknetzwerk
DE60318428T2 (de) Verfolgen von verkehr in einem mobil-ad-hoc-netzwerk
DE60224212T2 (de) Netzwerk mit mehreren sub-netzwerken
DE19505905B4 (de) Verfahren und Vorrichtung zur adaptiven Weiterleitung in einem Kommunikationssystem
DE60202491T2 (de) Verfahren und System zum Steuern eines Kommunikationsnetzes und eines im Netz angewandten Routers
DE60123398T2 (de) Verfahren zur Datenkommunikation im selbstorganisierenden Netz mit Enscheidungsvorrichtung
DE112005001581T5 (de) System und Verfahren zum Auswählen von stabilen Routen in drahtlosen Netzwerken
EP1453246A1 (fr) Procédé et station de base pour le transfert des données dans un système de radiocommunication cellulaire étendu par des liaisons "ad-hoc"
EP1678877B1 (fr) Procede pour transmettre des informations dans un systeme de communication a l'aide d'un chemin
EP1678890B1 (fr) Procede et dispositif pour determiner des chemins et attribuer des ressources radio aux chemins determines dans un systeme de communication radio
EP1423948A1 (fr) Procede pour identifier une station a fonctionnalite particuliere dans un reseau ad hoc assiste par radio et station reseau permettant la mise en oeuvre de ce procede
WO2005096563A1 (fr) Procede de communication dans un reseau local sans fil wlan avec un groupe de stations relais et des points d'acces radio
DE10143228B4 (de) Verfahren zum Routen von Verbindungen in einem funkgestützen Ad-hoc-Netz und Netzstation zum Durchführen eines solchen Verfahrens
EP1423944A1 (fr) Procede pour acheminer des communications dans un reseau ad hoc assiste par radio et station reseau permettant la mise en oeuvre de ce procede
DE10103103B4 (de) Verfahren und Vorrichtung zum Wechsel einer mobilen Station zwischen zwei Basisstationen
DE10309108B4 (de) Verfahren und Teilnehmerstation zur Übertragung von Informationen in einem mittels Ad Hoc Verbindungen erweiterten zellularen Funkkommunikationssystem
EP1300990B1 (fr) Procédé et appareil de communication pour fournir une qualité de service en fonction de la distance dans un système de communication
WO2004082223A1 (fr) Procede et dispositif cote reseau pour determiner un chemin dans un systeme de communication radio
DE10143276A1 (de) Verfahren zum Identifizieren einer Station mit besonderer Funktionalität in einem funkgestützten Ad-hoc-Netz und Netzstation zum Durchführen eines solchen Verfahrens
DE10148625B4 (de) Verfahren und Kommunikationsvorrichtung zum Durchführen einer Distanz-bezogenen Dienstegüte in einem Kommunikationssystem
DE10047131B4 (de) Verfahren zum Betreiben eines Zugangsnetzes
DE10350909B4 (de) Verfahren zur Signalisierung eines Pfades an Funkstationen eines Funkkommunikationssystems
WO2005043833A1 (fr) Procede pour determiner un chemin dans un systeme de communication radio ad hoc
EP4064758A1 (fr) Procédé de routage d'au moins un paquet de données d'un émetteur à un récepteur au moyen d'une pluralité de n uds dans un réseau de télécommunication, réseau ou système de télécommunication, noeud de routage et de relais, noeud de relais, détecteur de charge de noeud ou collecteur de charge de n ud, programme informatique et support lisible par ordinateur

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20040211

AK Designated contracting states

Kind code of ref document: A1

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

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG

RAP3 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NOKIA SIEMENS NETWORKS S.P.A.

RAP3 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG

REG Reference to a national code

Ref country code: DE

Ref legal event code: R003

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20110314