Multiplex communications – Communication over free space – Combining or distributing information via frequency channels
Reexamination Certificate
1996-12-19
2001-03-27
Pham, Chi H. (Department: 2731)
Multiplex communications
Communication over free space
Combining or distributing information via frequency channels
C370S350000, C375S293000
Reexamination Certificate
active
06208635
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to a network for transferring data packets, with multiple user stations and at least one central station which connects the network externally, the data packets being transferred over a set of channels with the frequency-hopping method and the channels being in this context selected for data transfer in accordance with at least one frequency-hopping pattern in temporal succession; as well as a method for operating a network of this kind.
2. Related Prior Art
A network of this kind and a method for operating it are known from DE 44 07 544 A1.
The known network and the known method are used to transfer data packets in an auxiliary network which transmits via frequency channels that are at least in part already used in an existing wireless or radio network for digital data and/or voice transfer. With this method, in a first step a frequency channel not currently occupied by the wireless network is identified, whereupon in a second step a data packet is transferred over the identified frequency channel. These steps are repeated, using frequency-hopping technology, until all the data packets of a transmission have been transferred.
With this method, the determination of a frequency channel not currently occupied by the wireless network takes place in such a way that one of the multiple frequency channels is first selected, whereupon this selected channel is then listened in on to check whether the wireless network is currently transmitting on that frequency channel. If no signal is received during this listening-in process, it is assumed that this channel can be used by the auxiliary network.
If it is found, however, that the selected channel is currently being used by a primary user, the time slot elapses unused, i.e. no data packet is transferred over the selected channel so as not to disrupt the primary user.
With the known method, by using frequency-hopping technology it is possible to utilize existing channels better without disturbing the respective wireless network.
As is common in frequency-hopping technology, the individual data packets are transferred in temporally staggered fashion over various frequency channels, the load being evenly distributed among the available channels that are not currently being used by the wireless network.
With regard to further details of the known method, reference is made to DE 44 07 544 mentioned above.
Initial tests of the known method have revealed that it operates properly without impairing the wireless network. Operation of an auxiliary network on the D
1
or D
2
network therefore presents no problems.
The known network is a decentralized network in which the central station on the one hand specifies the internal system time and on the other hand provides the external connection for the individual user stations. The user stations can communicate both with one another and with the central station.
A separate frequency-hopping pattern is assigned to each user station, so that each user station is reachable at any time. The channel over which this is possible is determined from the system time and the address of the particular user station. To prevent collisions from occurring in the network, the frequency-hopping patterns of the individual user stations are orthogonal to one another, i.e. at any given point in time, each of the available channels is used only once within the network.
If the frequency range allows 80 different channels, for example, 79 user stations and one central station can therefore be provided in the network. A network of this kind can be connected via the central station to a further network also with 79 user stations and one central station.
Since multiple transmissions can be carried out simultaneously within a network, data throughput through the network is very high, even though it is simply overlaid on the wireless network of primary users.
Although the network of user stations so far described operates very reliably with high data throughput, a number of disadvantages leading to a perceptible reduction in data throughput have nevertheless been noted during operation.
For example, it often happens that two adjacent user stations which are associated with two adjacent networks accidentally receive data over the same channel because their two frequency-hopping patterns have the same channel in the current time slot. If these two user stations are located sufficiently close to one another, they then interfere with each other so that both data packets are lost. The reason is that the user stations cannot unequivocally assign the data packets, so that they also cannot confirm receipt of the data packet to the transmitting station. The lost data packet must then be re-transferred in the next time slot in each network.
These types of interference occur particularly at the edges of a network, where it touches or in fact overlaps adjacent networks.
A further problem with the known network crops up if one of two adjacent user stations is currently transmitting while the other has switched over to receiving. Although these two user stations are receiving or transmitting data over different channels, the transmitting user station still prevents reception by the other user station, since its strong transmitted signal can lead to saturation of the input amplifier of the other user station. When saturation of this kind occurs, the receiving user station is no longer capable of distinguishing between the data packet intended for it and the data packet, not intended for it, being sent out by the adjacent user station. The data packet intended for the receiving user station is thus lost, so that it must be repeated in the next time slot.
Particularly when the user stations have a high spatial density, the two problems described above cause a large number of the transferred data packets to “get lost,” so that the potential data throughput is by no means achieved. The greater the number of user stations in a particular area, the more evident the aforesaid problems become.
SUMMARY OF THE INVENTION
In view of the above, it is an object of the present invention to improve the method and the network described at the outset in such a way that networking of any number of user stations becomes possible with no loss of data throughput.
In the case of the method described at the outset, this object is achieved according to the invention by the fact that the network is divided into at least two basic networks, each with a central station and a limited number of user stations; and that in each basic network a separate frequency-hopping pattern is processed that is orthogonal to the frequency-hopping pattern of immediately adjacent basic networks.
Correspondingly, the underlying object of the invention is achieved, in the case of the network mentioned at the outset, by the fact that it has at least two basic networks each with a central station and a limited number of user stations; and that a separate frequency-hopping pattern that is orthogonal to the frequency-hopping patterns of immediately adjacent basic networks is allocated to each basic network.
The object underlying the invention is thereby completely achieved.
Specifically, the inventors of the present application have recognized that, surprisingly, the overall data throughput is not perceptibly decreased if the network is divided into multiple basic networks each with a few user stations and one central station, only one frequency-hopping pattern now being processed in each basic network. Although this means that within a so-called “time slot,” only one user station can transfer data in each basic network, interference with adjacent user stations is, however, thereby prevented even when the density of user stations is very high.
The orthogonality of the frequency-hopping patterns of adjacent basic networks moreover prevents two different data packets from being transported on one and the same channel in the edge or overlap regions of two immediately adjacent basic networks. The orthogonality requi
Altvater Ulrich
Baron Heinrich
Bitsch Bernhard
Haaf Peter
Kieslich Bernd
Altvater Air Data Systems GmbH & Co. KG
Knobbe Martens Olson & Bear LLP
Nguyen Steven
Pham Chi H.
LandOfFree
Network for transferring data packets and method for... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Network for transferring data packets and method for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network for transferring data packets and method for... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2497537