EP0285522A1 - Verfahren zur Anrufverwaltung in einem Funknetzwerk von mehreren auf derselben Frequenz arbeitenden Stationen mittels einer Dienststelle - Google Patents

Verfahren zur Anrufverwaltung in einem Funknetzwerk von mehreren auf derselben Frequenz arbeitenden Stationen mittels einer Dienststelle Download PDF

Info

Publication number
EP0285522A1
EP0285522A1 EP88400802A EP88400802A EP0285522A1 EP 0285522 A1 EP0285522 A1 EP 0285522A1 EP 88400802 A EP88400802 A EP 88400802A EP 88400802 A EP88400802 A EP 88400802A EP 0285522 A1 EP0285522 A1 EP 0285522A1
Authority
EP
European Patent Office
Prior art keywords
server
station
stations
messages
list
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.)
Granted
Application number
EP88400802A
Other languages
English (en)
French (fr)
Other versions
EP0285522B1 (de
Inventor
Rémy Journeau
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.)
OFFERTA DI LICENZA AL PUBBLICO
Original Assignee
Thomson CSF SA
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 Thomson CSF SA filed Critical Thomson CSF SA
Publication of EP0285522A1 publication Critical patent/EP0285522A1/de
Application granted granted Critical
Publication of EP0285522B1 publication Critical patent/EP0285522B1/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/04Scheduled access

Definitions

  • the present invention relates to a method for managing calls in a radio network composed of a plurality of stations interconnected on the same frequency by a server. It applies to digital transmissions on any radio channel.
  • the method allows in particular in the context of radio work-study networks the access of several applicants on the same frequency, a single applicant being active, the others remaining in the queue and being called automatically according to their priority.
  • the object of the invention is to make the management of calls in radio networks fully automatic while avoiding the aforementioned drawbacks.
  • the subject of the invention is a method for managing calls in a radio network composed of a plurality of requesting stations of a free frequency of the network interconnected with each other by a server characterized in that it consists to allocate to each station a fraction of time between two successive transmissions from the server, to transmit to the server the call from the station and the priority of the message that it wants to transmit, to constitute in the server a waiting list of the messages according to the order of arrival of the calls of the other stations and the priorities of their messages and to diffuse the waiting list to all stations to allow the station which recognizes itself at the top of the list to take the frequency.
  • the method according to the invention has the advantage that it allows fully automatic management of messages in the radio link between two stations of a network taking into account the priorities allocated to the messages to be transmitted.
  • the process allows subscribers to be served in the order of the priorities requested, avoiding as this takes place in management systems employing operators, to re-launch radio calls when the frequency becomes available.
  • the communication network to which the invention applies consists of a plurality of stations SB1 ... SB n in communication with a server SA.
  • the server SA when a frequency is free to transmit messages, the server SA transmits, as shown in FIG. 2, beacon signals regularly spaced over time to indicate to the other stations the time intervals during which they can forward their calls to.
  • the stations SB i transmit, during the periods of silence from the station SA, messages to mark their intention to transmit on the frequency indicated as free by the station SA. For this, the time T which is allocated to the stations SB i between two transmission intervals of the station SA is divided into k time slots of length T / k. Each of the stations SB i can then make its call on only one of the boxes of length T / k. The choice of boxes is made randomly, because if the number of boxes is relatively large two intervening stations SB i and SB j have a relatively low probability of 1/2 k to collide.
  • the processing performed by the server SA consists in decoding the calls contained in each of the boxes and in constituting a waiting list taking into account the instant of arrival and the priority of the calls.
  • the arrival time is decisive if the priorities of two calls received in two boxes j and k are the same. In this case, if j ⁇ k, the call j is placed before the call k. Conversely, if the incident call in box k has higher priority than that received in box j and if j is smaller than k, the call contained in box k is placed before that of box j.
  • the server SA broadcasts the list to the various stations SB1 to SB N. Only the SB i station finding its characteristics (indicative) at the top of the list can continue to occupy the frequency. The other stations await the scrolling of the waiting list and remain listening to the broadcasting of a new list while waiting for their callsign to be at the top of the list to occupy the frequency in their turn.
  • FIGS. 3, 4 and 5 An illustration of steps 1 to 20 of the method according to the invention is given in FIGS. 3, 4 and 5.
  • the server SA When the server SA indicates to the other stations SB i of the network that a frequency is free, it transmits as it is referenced in 1 in FIG. 3, beacon signals intended for the other stations SB i . These beacon signals are composed by transmission signals separated by dead times of constant duration T. They are received by the stations SB i which test in step 3 if they have a message to transmit. If a station SB i has a message to transmit, it proceeds to the execution of steps 4 to 8 of the flow diagram of FIG. 3 or remains, if not, listening for beacon signals.
  • Each of the stations which has a message to transmit then performs steps 4 and 5 by drawing a random time box of duration T / k and by constituting a call sequence composed by a priority number and by the station code. .
  • Indicative and priority are then transmitted in step 6 in the T / k duration box chosen for the SA server and the station then goes to step 7 in reception mode to wait in step 8 for the list of priorities which is constituted by the server SA according to the calls it receives from the other stations.
  • the method then proceeds to the execution of steps 9 to 12 of the flow diagram represented in FIG. 4.
  • the server SA receives the call sequences then it performs in step 10 a sorting according to the timing of priorities. This sorting results in stage 11 in the constitution of a waiting list which is published in stage 12.
  • each station SB i executes the steps of the method which are represented in FIG. 5.
  • each station searches in the list of the waiting stations it has received, its callsign. If it does not find it in step 14, it immediately places itself on the waiting list for another list or possibly chooses another frequency. If its callsign is at the top of the list, it immediately takes possession in step 18 of the frequency which is thus freed up to transmit its message in step 19. At the end of transmission, it places itself on standby for new beacon signals for possibly reiterate its transmission process.
  • stations SB i and server SA having reception and transmission devices organized around a microprocessor or any equivalent device suitably programmed for the execution of steps 1 to 20 of the method previously described with the aid of FIGS. 3 to 5.
  • FIGS. 6 and 7. Two corresponding simplified organizations of a station SB i and of a server are shown in FIGS. 6 and 7.
  • the station SB i comprises a reception device 21 and a transmission device 22 both coupled to a microprocessor 23.
  • the microprocessor 23 is coupled to a pseudo-random generator 24 to allow the choice of time slots of duration T / k.
  • the server comprises, similarly to the other stations, a reception device and a transmission device 26 coupled together by a microprocessor 27.
  • the microprocessor 27 is also coupled between a memory for storing calls 28 and a time slot counter 29. All of its elements form part of the elements known from the state of the art and their description need not be given in greater detail.
  • FIG. 8A represents the format of the beacon messages transmitted by the server station SA.
  • This message consists of two zones 30 and 31.
  • Zone 30 contains the synchronization word and zone 31 contains the fixed sequence of signals allowing the stations SB i receivers to assess the quality of the link, the station SB i having the possibility of transmitting only at the end of the zone 31.
  • the format of the message represented in FIG. 8B is that which is transmitted by a calling station SB i intended for the server, it is made up of a synchronization zone 32 followed by a zone 33 indicating the priority of the message that the station wants to transmit and of a zone 34 for transmitting the call sign of the station.
  • the message shown in FIG. 8C transmits the list of stations established by the station SA to the other stations, the format of this message consists of a synchronization zone 35 followed by the zones 36, 37 and 38 mentioning the station codes from each list.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)
EP88400802A 1987-04-03 1988-04-01 Verfahren zur Anrufverwaltung in einem Funknetzwerk von mehreren auf derselben Frequenz arbeitenden Stationen mittels einer Dienststelle Expired - Lifetime EP0285522B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR8704723A FR2613561B1 (fr) 1987-04-03 1987-04-03 Procede pour la gestion d'appels dans un reseau radio compose d'une pluralite de stations interconnectees entre elles sur une meme frequence par un serveur
FR8704723 1987-04-03

Publications (2)

Publication Number Publication Date
EP0285522A1 true EP0285522A1 (de) 1988-10-05
EP0285522B1 EP0285522B1 (de) 1992-12-09

Family

ID=9349773

Family Applications (1)

Application Number Title Priority Date Filing Date
EP88400802A Expired - Lifetime EP0285522B1 (de) 1987-04-03 1988-04-01 Verfahren zur Anrufverwaltung in einem Funknetzwerk von mehreren auf derselben Frequenz arbeitenden Stationen mittels einer Dienststelle

Country Status (3)

Country Link
EP (1) EP0285522B1 (de)
DE (1) DE3876470T2 (de)
FR (1) FR2613561B1 (de)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1996008935A1 (en) * 1994-09-16 1996-03-21 Ionica International Limited Transmission of control messages in digital telephony
US9113644B2 (en) 2011-04-14 2015-08-25 Aak Denmark A/S Bloom retarding fat

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE2139402A1 (de) * 1971-08-06 1973-02-15 Licentia Gmbh Verfahren zur nachrichtenuebertragung
US4012597A (en) * 1975-11-24 1977-03-15 Motorola, Inc. Transmission trunk multichannel dispatch system with priority queuing
FR2362536A1 (fr) * 1976-08-17 1978-03-17 Labo Cent Telecommunicat Systeme de gestion centralisee dans un reseau de transmission radioelectrique
DE2812009A1 (de) * 1978-03-18 1979-09-20 Standard Elektrik Lorenz Ag Nachrichtenuebertragungssystem
EP0069275A1 (de) * 1981-07-02 1983-01-12 Trancom AB Apparat zur Kommunikation mit einem Fahrzeugpark
EP0177094A2 (de) * 1984-09-26 1986-04-09 Philips Electronics Uk Limited Nachrichtensystem mit Vielfachzugriff

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE2139402A1 (de) * 1971-08-06 1973-02-15 Licentia Gmbh Verfahren zur nachrichtenuebertragung
US4012597A (en) * 1975-11-24 1977-03-15 Motorola, Inc. Transmission trunk multichannel dispatch system with priority queuing
FR2362536A1 (fr) * 1976-08-17 1978-03-17 Labo Cent Telecommunicat Systeme de gestion centralisee dans un reseau de transmission radioelectrique
DE2812009A1 (de) * 1978-03-18 1979-09-20 Standard Elektrik Lorenz Ag Nachrichtenuebertragungssystem
EP0069275A1 (de) * 1981-07-02 1983-01-12 Trancom AB Apparat zur Kommunikation mit einem Fahrzeugpark
EP0177094A2 (de) * 1984-09-26 1986-04-09 Philips Electronics Uk Limited Nachrichtensystem mit Vielfachzugriff

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1996008935A1 (en) * 1994-09-16 1996-03-21 Ionica International Limited Transmission of control messages in digital telephony
US6026083A (en) * 1994-09-16 2000-02-15 Ionica International Limited Transmission of control messages in digital telephony
US9113644B2 (en) 2011-04-14 2015-08-25 Aak Denmark A/S Bloom retarding fat

Also Published As

Publication number Publication date
FR2613561A1 (fr) 1988-10-07
DE3876470D1 (de) 1993-01-21
FR2613561B1 (fr) 1994-04-15
EP0285522B1 (de) 1992-12-09
DE3876470T2 (de) 1993-04-15

Similar Documents

Publication Publication Date Title
EP0834999B1 (de) Leckkabelübertragungssystem und entsprechende Ausrüstung für eine Teilnehmereinrichtung
FR2579341A1 (fr) Reseau local de transmission de donnees comportant un systeme de detection de signaux, evitant des collisions et procede de transfert de donnees dans un tel reseau
FR2567343A1 (fr) Procede et dispositif de transmission de donnees, notamment dans un aeronef
FR2519822A1 (fr) Recuperation preventive des erreurs dans un reseau de communications
EP0431438A1 (de) Verfahren zur Regelung des Datenstroms in einem Breitband ISDN und Netz zur Realisierung
EP0270391A1 (de) Steuerungsverfahren zur Wiederübertragung von Nachrichten von Sendestationen eines zellularen Systems
EP2446568B1 (de) Verfahren zur zeitmultiplexübertragung
FR2817093A1 (fr) Procede d'augmentation du debit dans un reseau de telecommunications, a transmission de donnees et de phonie
FR2705179A1 (fr) Procédé de gestion de la transmission des messages d'un ensemble d'émetteurs vers un récepteur unique sur un canal unique.
EP0494564B1 (de) Protokol und System zum mehrfachigen Kommunikationskanalzugang durch Zusatzgerät mit digitalen Nachrichten
FR2700902A1 (fr) Procédé de gestion du débit de messages codés numériquement transportés par un réseau asynchrone, notamment un réseau ATM, et dispositif pour sa mise en Óoeuvre.
EP0285522B1 (de) Verfahren zur Anrufverwaltung in einem Funknetzwerk von mehreren auf derselben Frequenz arbeitenden Stationen mittels einer Dienststelle
FR3080253A1 (fr) Procede d'allocation de ressources, procede de reception d'allocation de ressources, produits programme d'ordinateur, modules et signal correspondants
FR2709907A1 (fr) Procédé pour augmenter l'autonomie d'un récepteur d'informations, en particulier de radio-messagerie, et récepteur correspondant.
FR2517146A1 (fr) Procede utilise pour la gestion du trafic d'informations dans une cellule formee de plusieurs chaines radio et dispositif mettant en oeuvre ce procede
EP0645902B1 (de) Satellitenanordnung für Datenübertragung zwischen Telefonvermittlungstellen, Verkehrstation und Übertragungsverfahren dafür
FR2760310A1 (fr) Procede de transmission d'une information d'appel
FR2961044A1 (fr) Procede et reseau de transmission de l'information entre une pluralite de stations radioelectriques
FR2823037A1 (fr) Procede d'optimisation de la gestion de la bande passante d'un canal de transmission numerique
EP0635184B1 (de) Einrichtung zur datenuebertragung fuer netzwerken mit vielfachzugriff und verbesserter kollisionsaufloesung und verfahren dafuer
FR2758025A1 (fr) Systeme et procede permettant d'augmenter les aboutissements d'avertissements d'appel
EP1212879A1 (de) Verfahren und system zur übertragung einer meldungskette für datenbanken
EP0557175B1 (de) Verfahren zur Kurzdatenübertragung zwischen Funkeinheit und Verarbeitungseinheit
EP1401156B1 (de) Verfahren zur Zugriffskontrolle auf ein gemeinsam genutztes Netzwerk, zugehöriges Netzwerkelement und Netzwerk
EP0895433B1 (de) Telefongerät mit einer Basisstation und mindestens einer Mobilstation und Verfahren zur Übertragung von Nachrichten

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

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): DE GB IT

17P Request for examination filed

Effective date: 19890320

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

Owner name: THOMSON-CSF

17Q First examination report despatched

Effective date: 19910626

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE GB IT

ITF It: translation for a ep patent filed

Owner name: JACOBACCI & PERANI S.P.A.

REF Corresponds to:

Ref document number: 3876470

Country of ref document: DE

Date of ref document: 19930121

GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)

Effective date: 19930217

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
REG Reference to a national code

Ref country code: GB

Ref legal event code: 746

Effective date: 19950214

ITPR It: changes in ownership of a european patent

Owner name: OFFERTA DI LICENZA AL PUBBLICO

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 19990318

Year of fee payment: 12

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 19990320

Year of fee payment: 12

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20000401

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20000401

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20010201

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 20050401