Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS7349339 B2
Publication typeGrant
Application numberUS 10/450,690
PCT numberPCT/EP2001/014739
Publication dateMar 25, 2008
Filing dateDec 14, 2001
Priority dateDec 14, 2000
Fee statusPaid
Also published asCN1279726C, CN1575568A, DE10062303A1, DE10062303C2, DE50110651D1, EP1472817A2, EP1472817B1, US20040063401, WO2002049274A2, WO2002049274A3
Publication number10450690, 450690, PCT/2001/14739, PCT/EP/1/014739, PCT/EP/1/14739, PCT/EP/2001/014739, PCT/EP/2001/14739, PCT/EP1/014739, PCT/EP1/14739, PCT/EP1014739, PCT/EP114739, PCT/EP2001/014739, PCT/EP2001/14739, PCT/EP2001014739, PCT/EP200114739, US 7349339 B2, US 7349339B2, US-B2-7349339, US7349339 B2, US7349339B2
InventorsHans-Jürgen Meckelburg, Michael Horn
Original Assignee7 Layers Ag
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Method for operating an ad-hoc network for the wireless data transmissions of synchronous and asynchronous messages
US 7349339 B2
Abstract
A method for operating an ad-hoc network for the wireless data transmission of synchronous and asynchronous messages synchronizes the transmitters and receivers of neighboring nodes on a transmission path using cyclically transmitted identifiers, whose intervals define a time frame. The nodes of the transmission path reserve time slots within the time frame for the transmission of data packets of a virtual connection that are to transmitted synchronously. A start signal is transmitted at the stars of the synchronous transmission of a virtual connection, the data packets are then transmitted in the previously defined time slots and the synchronous transmission is concluded by a stop signal. Free time slots in the nodes are filled with data packets that can be transmitted asynchronously, the packets being read from an output buffer memory of the node.
Images(5)
Previous page
Next page
Claims(5)
1. A method for the operation of an ad hoc network for wireless transmission of synchronous and asynchronous messages,
where the network is composed of network nodes that are distributed in any desired manner, each of which has a receiving device having an input controller, a switching station, and a transmitting device having an output controller,
where transmission paths for logical connections to be transmitted from a starting node to a target node are established by way of intermediate nodes, according to a routing method, and
where the nodes administer local address and control data (LCI) that are assigned to the logical connections and are reported to a preceding node of the transmission path,
wherein
the messages are transmitted according to a frequency multiplex method, in the form of symbol vectors, which comprise a fixed, predetermined number of symbols transmitted in parallel,
the transmitting and receiving devices of adjacent nodes of a transmission path are synchronized, using cyclically transmitted identifiers whose periodicities define a time frame,
the nodes of the transmission path reserve time slots within the time frame, for transmitting symbol vectors of a logical connection to be transmitted synchronously, where a start signal is sent a synchronous transmission of the logical connection begins, subsequently data packets are transmitted in the reserved time slots, and the synchronous transmission is terminated by a stop signal,
after determination of a transmission path for a logical connection to be transmitted synchronously, a check is made as to whether the time slots required for the synchronous transmission are available on radio channels, whether all the nodes of the transmission path reserve the time slots, and whether a preceding node reports the local address data and the reserved time slot,
in the determination of the transmission path and the time slots for a connection to be transmitted synchronously, a time delay is proposed at a node whenever two independent logical connections between two nodes claim the same time slot, where all time delays of the transmission path, from the starting node to the target node, are added to obtain a total time delay, the total time delay for the synchronous transmission not being allowed to exceed a predetermined value,
if the total time delay is less than or equal to the predetermined value, synchronous transmission is permitted for the connection and if the total time delay exceeds the predetermined value, synchronous transmission is not established for the connection, and
any free time slots in the nodes are filled up with messages transmitted asynchronously, in a form of symbol vectors, each symbol vector having a respective header for identifying the symbol vector and being read out from an output buffer of the node.
2. The method according to claim 1, wherein system-specific symbol vectors for synchronization of the transmitting and receiving device of adjacent nodes along a transmission path are transmitted within the established time frame.
3. The method according to claim 2, wherein a number of empty vectors is transmitted within the time frame, which are removed in a node, as needed, in order to eliminate synchronicity errors between the receiving devices and transmitting devices of the adjacent nodes.
4. The method according to claim 1, wherein an error recognition and correction via a symbol vector or via a symbol stream that is transmitted in parallel takes place.
5. The method according to claim 1, wherein the symbol vectors of a receiving channel that arrive at a node are switched to a transmitting channel that is different from the receiving channel, where the symbols associated with a symbol vector are forwarded and transmitted in parallel.
Description
CROSS REFERENCE TO RELATED APPLICATIONS

Applicants claim priority under 35 U.S.C. §119 of GERMANY Application No. 100 62 303.4 filed on 14 Dec. 2000. Applicants also claim priority under 35 U.S.C. §365 of PCT/EP01/14739 filed on 14 Dec. 2001. The international application under PCT article 21(2) was not published in English.

The invention relates to a method for operation of an ad hoc network for wireless transmission of synchronous and asynchronous messages,

    • whereby the network is composed of network nodes that are distributed in any desired manner, each of which has a receiving device having an input controller, a switching station, and a transmitting device having an output controller,
    • whereby transmission paths for logical connections to be transmitted from a starting node to a target node are established by way of intermediate nodes, according to a routing method, and
    • whereby the nodes administer local address and control data (LCI) that are assigned to the logical connections and are reported to the preceding node of the transmission path.

An ad hoc network makes do without central network elements. It is formed by randomly distributed network nodes, which assure the data transmission. Every new node that is added is integrated into the network according to an established procedure, and the network organizes itself without any organizational sequences. The network nodes on the transmission path between a starting node and a target node take on the tasks of a transfer node having a switching station (switch). The nodes receive a message block (symbol vector) and transmit it to the next most advantageous node, until the message has finally been received at the target node.

In a method for the operation of an ad hoc network known from DE-C 197 37 897, the signals received by the nodes are transferred from the channel in question to a transmitting channel that is different from the former, whereby the transfer of the symbol stream that arrives at the receiving channel to the transmitting channel takes place symbol by symbol. Symbol-by-symbol transfer means that only a delay on the order of a symbol digit of the symbol stream is required at every node. The delay is connected with the fact that there is normally no synchronization of the symbol sequence on the incoming channels and the outgoing channels, so that a certain waiting time is required until the outgoing signal can be sent out in synchronization with the transmitting channels. The delay amounts to one to two symbol digits, which add up over the transmission path.

Furthermore, packet-by-packet transmission between the stations of a data transmission network is known from the Internet. Here, data are bundled in packets, which are transmitted by way of the most advantageous transmission path in each instance. Packet-by-packet transmission allows the transmission of large data amounts. However, rapid data transmission with a constant and small time delay is not assured.

The invention is based on the task of indicating a method for operation of an ad hoc network for wireless transmission, which can be used to very quickly and flexibly transmit data packets on the basis of the Internet protocol (IP) or the Asynchronous Transfer Mode Standard (ATM), in a linked network configuration.

Proceeding from a method with the characteristics as described initially, this task is accomplished, according to the invention, in that

    • the transmitting and receiving devices of adjacent nodes of a transmission path are synchronized, using cyclically transmitted identifiers, the distances between which define a time frame,
    • that the nodes of the transmission path reserve time slots within the time frame, for the transmission of data packets of a logical connection to be transmitted synchronously, whereby a start signal is sent at the beginning of a synchronous transmission of the logical connection, subsequently the data packets are transmitted in the previously determined time slots, and the synchronous transmission is concluded with a stop signal, and that free time slots in the nodes are filled up with data packets transmitted asynchronous, which are read out from an output buffer of the node.

According to a preferred embodiment of the invention, the data packets are transmitted in the form of symbol vectors that consist of a fixed, predetermined number of symbols transmitted in parallel, and a header for identification of the symbol vector. For one thing, the symbol vectors contain the data package having the maximum transmission size (Maximum Transmission Unit MTU) and a minimal header (Header) for identification of the symbol vector. Furthermore, the symbol vectors can also contain elements for signaling. The individual symbol vectors of the different logical connections are processed into the node, one after the other, and transmitted from one network node to another network node, preferably according to a frequency multiplex method that is known, as such, under the term Orthogonal Frequency Division Multiplex (OFDM). The symbol stream of the data and message blocks used for this purpose is divided up into a defined number of partial streams, which then are digitally modulated onto a corresponding number of carriers.

System-specific symbol vectors for synchronization of the transmitting and receiving devices of adjacent nodes are also transmitted in the established time frame. The system-specific symbol vectors carry a known sequence, e.g. M sequence, which is transmitted cyclically, and the distance between which forms the time frame, also called “hyperframe.” The transmitting and receiving devices of the nodes can measure radio channel parameters with the M sequence, and adjust the modulation, as well as calculate and balance out synchronicity errors between the nodes. Furthermore, it is practical if a number of empty vectors is transmitted within the time frame, which are removed in a node, as needed, in order to eliminate synchronicity errors between the receiving and transmitting devices of adjacent nodes.

Error recognition and correction can take place using Forward Error Connection (FEC) measures, both by way of a symbol vector and by way of every symbol stream that runs in parallel.

The method according to the invention combines the advantages of network structures that work asynchronous with the advantages of network structures that work synchronously. While network structures that work asynchronous yield optimum results for packet-oriented applications, which have no time reference for data transmissions, real-time applications such as “Voice Over IP” or “Video On Demand” need the guarantee that the data packets are transmitted during a defined period of time, and that delays will not vary disproportionately. According to the invention, data packets that do not permit any disproportional delay are transmitted synchronously, whereby all the nodes of the network reserve appropriate time slots for the logical connection, in each instance, on the transmission path, by means of a routing method. After determination of the transmission path for a logical connection that is transmitted synchronously, a check is made as to whether the time slots required for the synchronous transmission are available on radio channels. All the nodes of the transmission path reserve the time slots, and report the address data and the reserved time slot to the preceding nodes. In the determination of the transmission path and the time slots for a connection that is to be transmitted synchronously, the case can occur that two independent logical connections coincidentally claim the same time slot between two nodes. In this case, a time delay is proposed at a node for one of the connections, whereby all the time delays of the transmission path, from the starting node to the target node, are added, and the sum of the time delay for the synchronous transmission is not allowed to exceed a predetermined value, preferably 150 milliseconds. If the limit value is adhered to, the constellation can be utilized. If the time delay is not acceptable, then the routing method must search for an alternative path, or must reject the request, so that synchronous data transmission is not established for the logical connection.

In the case of packet-oriented applications that have no time reference to the data transmission, the upcoming data packets are divided up into appropriately small symbol vectors. These symbol vectors are transmitted asynchronous, on a transmission path established by the routing method. In the case of asynchronous transmission, time delays at the nodes are considered acceptable.

According to the invention, free time slots that are not reserved for synchronous transmissions are filled up in the nodes with the symbol vectors that can be transmitted asynchronous. In this manner, the available network capacity can be fully utilized, without any impairment of the transmission speed of the time-critical data that must be transmitted synchronously.

The method according to the invention combines the advantages of asynchronous transmission technology, e.g. ATM, and synchronous transmission technology, e.g. Telekom Net, with the extraordinary advantages of a decentralized radio-based network structure.

In the following, the invention will be explained using a drawing that shows an embodiment intended only as an example. The drawing schematically shows:

FIG. 1 the structure of an ad hoc network,

FIG. 2 the structure of the data packets transmitted according to the invention,

FIG. 3 the transmission of the data packets at the nodes of the network,

FIG. 4 the principle of data transmission according to the method according to the invention.

The network shown in FIG. 1 is composed of network nodes N that are distributed in any desired manner, each of which has a receiving device having an input controller, a switching station, and a transmitting device having an output controller. The network organizes the sequences itself, whereby additional nodes are integrated into the network according to an established procedure. The nodes N have defined service interfaces (SAP) for connecting different applications 1.

For a logical connection to be transmitted, the transmission path 2 from a starting node N1 to a target node N4 is established by way of intermediate nodes N6, N7, according to a routing method, whereby the nodes administer local address and control data (Local Connection Identifier LCI) that are assigned to the logical connections and are reported to the preceding nodes of the transmission path.

In the method according to the invention, the transmitting and receiving devices of adjacent nodes of a transmission path are synchronized using cyclically transmitted identifiers 3, the distances between which define a time frame Z. The data packets are transmitted according to a frequency multiplex method, in the form of symbol vectors 4, which consists of a fixed, predetermined number of symbols S transmitted in parallel, and a header (Header H) for identifying the symbol vector. The Payload region (PI) is available for transmission of the content data. Furthermore, the symbol vector can have an element SCH for signal control, which control is formed over several vectors and serves for signaling between two connected nodes (FIG. 2).

System-specific symbol vectors 5 for synchronization of the transmitting and receiving devices of adjacent nodes are also transmitted in the established time frame Z. The system-specific symbol vectors 5 carry a known sequence, e.g. M sequence, which is transmitted cyclically and the distance between which defines the time frame Z. The transmitting and receiving devices of the nodes can measure radio channel parameters with the M sequence, and adjust the modulation, as well as calculate and balance out synchronicity errors between the nodes. Furthermore, empty vectors 6 are built in within the time frame Z, which is also referred to as a “hyperframe.” These carry no data and serve to balance out running time differences in the nodes. As needed, such empty vectors 6 are removed in a node, in order to eliminate synchronicity errors between the receiving and transmitting devices of adjacent nodes.

FIG. 3 shows that the symbol vectors 4 of logical connections A, B or a receiving channel that arrive at a node are switched to a transmitting channel that differs from the former, whereby the symbols S1 . . . Sn that belong to a symbol vector 4 are switched further in parallel and transmitted.

The nodes of the transmission path reserve time slots within the time frame for the transmission of data packets of a logical connection to be transmitted synchronously, whereby a start signal is transmitted at the beginning of a synchronous transmission of the logical connection, subsequently the data packets are transmitted in the previously established time slots, and the synchronous transmission is interrupted with a stop signal. In the determination of a transmission path for a logical connection to be transmitted synchronously, a check is made as to whether the time slots required for the synchronous transmission are available on radio channels. All the nodes of the transmission path then reserve the time slots and report the address data and the reserved time slot to the preceding nodes. Depending on the system, several applications can competitively require radio resources at the same time, in an ad hoc network. Two independent logical connections can therefore coincidentally claim the same time slots between two nodes.

In the determination of the transmission path and the time slots for a connection to be transmitted synchronously, a time delay is proposed at a node if two independent logical connections between two nodes claim the same time slots, whereby all the time delays of the transmission path, from the starting node to the target node, are added, and the sum of the time delay for the synchronous transmission is not allowed to exceed the predetermined value. This will be explained using the example shown in FIG. 4.

The figure shows a typical implementation with two competitive applications. In the example, the application A is transmitting two symbol vectors 4 by way of nodes N1, N3, and N4, and the application B is transmitting three symbol vectors 4′ by way of the nodes N2, N1, and N3. The time frames Z are synchronized, i.e. all the M sequence vectors are starting at the same time.

As a function of the system, the symbol vectors 4, 4′ of the applications A and B cannot be transmitted on the channel C4 at the same time, therefore the application B is delayed in the node N1. For the constellation shown, there is a total of three delay units TS for the application A, and a total of four delay units TS for the application B.

FIG. 4 shows that free time slots 7 are available, which are not needed for data packets to be transmitted synchronously. These free time slots are filled up, in the nodes, with data packets to be transmitted asynchronously, which are read out from an output buffer of the nodes. The asynchronous data transmission, using free time slots, is utilized for all the packet-oriented applications that do not have any time reference to the data transmission. The synchronous transmission is reserved for real-time applications such as “Voice Over IP” or “Video On Demand.” Here, the entire capacity of a symbol vector can be used for transmission of the content data.

Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US5987011 *Aug 30, 1996Nov 16, 1999Chai-Keong TohRouting method for Ad-Hoc mobile networks
US5987018 *May 2, 1996Nov 16, 1999Motorola, IncRadio unit, method of communicating between radio units over a communications channel and method of preparing a sequence of data cells for transmission over a radio channel
US5987024May 9, 1997Nov 16, 1999Motorola, Inc.Self synchronizing network protocol
US6028853 *Jun 6, 1997Feb 22, 2000Telefonaktiebolaget Lm EricssonMethod and arrangement for radio communication
US6590928 *Sep 17, 1997Jul 8, 2003Telefonaktiebolaget Lm Ericsson (Publ)Frequency hopping piconets in an uncoordinated wireless multi-user system
US6665311 *Nov 9, 2001Dec 16, 2003Hrl Laboratories, LlcMethod and apparatus for adaptive bandwidth reservation in wireless ad-hoc networks
US6754176 *Jul 12, 2000Jun 22, 2004Sharewave, Inc.Scheme for managing overlapping wireless computer networks
US6788702 *Oct 15, 1999Sep 7, 2004Nokia Wireless Routers, Inc.Protocol for neighborhood-established transmission scheduling
US6928061 *Oct 31, 2000Aug 9, 2005Nokia, Inc.Transmission-scheduling coordination among collocated internet radios
US6975613 *Dec 6, 1999Dec 13, 2005Telefonaktiebolaget L M Ericsson (Publ)System and method for scheduling communication sessions in an ad-hoc network
US7050452 *Oct 5, 2001May 23, 2006Cognio, Inc.Systems and methods for interference mitigation among multiple WLAN protocols
US7114010 *May 25, 2001Sep 26, 2006Broadcom CorporationMulti-mode controller
US7158484 *Feb 25, 2000Jan 2, 2007Lucent Technologies Inc.Methods and apparatus for topology sensing in networks with mobile nodes
US7184413 *Feb 10, 1999Feb 27, 2007Nokia Inc.Adaptive communication protocol for wireless networks
US20040095907 *Jun 10, 2001May 20, 2004Agee Brian G.Method and apparatus for optimization of wireless multipoint electromagnetic communication networks
CA2302501A1Aug 27, 1998Mar 11, 1999Dirc Technologie Gmbh & Co. KgData transmission system with relay stations between a source station and a target station
DE19737897A1Aug 29, 1997Mar 25, 1999Dirc Gmbh & Co KgDatenübertragungssystem
EP0999717A2Dec 14, 1998May 10, 2000Caly, Inc.Broadband wireless mesh topology network
Non-Patent Citations
Reference
1"Asynchronous Multimedia Multihop Wireless Networks", by Chunhung Richard Lin and Mario Gerla, Computer Aided Design of Hig Performance Wireless Network Systems 1997 IEEEE-pp. 118-125-Int'l. Search Rept.
2"Bluetooth-The universal radio interface for ad hoc, wireless connectivity" by Jaap Haartsen. Ericcson Review No. 3, 1998, pp. 110-117-Int'l. Search Rept.
3"Feasibility Questions of Synchronous Multi-hop Ad-hoc Networks" by Dániel Hollós- opinion dated Dec. 12, 2001-(German Priority Application).
4"Synchronisation of Fully Distributed Adhoc Multi-Hop Wireless Networks" by Dàniel Hollòs-Technical University of Budapest, Department of Telecommunications-three pages -(German Priority Application).
5"The challenges of voice-over-IP-over wireless" by Göran AP Eriksson, et al, Ericsson Review No. 1, 2000 pp. 20-31 (German Priority Application).
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US7596151 *Apr 29, 2004Sep 29, 2009Samsung Electronics Co., Ltd.System and method for discovering path MTU in ad hoc network
US7835404 *Oct 11, 2005Nov 16, 2010Bosch Rexroth AgMethod for synchronization in a redundant communication system
US8315274 *Mar 29, 2006Nov 20, 2012Honeywell International Inc.System and method for supporting synchronous system communications and operations
US8576829 *Aug 8, 2007Nov 5, 2013Aeroscout, Ltd.Multi-channel TDOA system
Classifications
U.S. Classification370/235
International ClassificationH04L12/725, H04L12/26
Cooperative ClassificationH04W40/00, H04L45/302, H04W8/26, H04W84/18, H04W28/26
European ClassificationH04L45/302, H04W8/26
Legal Events
DateCodeEventDescription
Sep 12, 2011FPAYFee payment
Year of fee payment: 4
Nov 3, 2003ASAssignment
Owner name: 7 LAYERS AG, GERMANY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MECKELBURG, HANS-JURGEN;HORN, MICHAEL;REEL/FRAME:014648/0938
Effective date: 20030704