Patent EP0522636A2 successfully refreshed from Google Patents.
← Back to Patent Explorer
EP0522636A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Communication protocol for main and mobile stations where time slots are used for data packet transmission

Assignee: Koninklijke Philips NV
•
Filing: 1992-07-02
•
Granted: —
•
Expires: 2012-07-02
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A communication protocol is proposed, to be used by a main station and a plurality of mobile sub-stations, while time slots are used in which data packets are transmitted. A sub-station that has a message to be sent to the main station first transmits a request-for-access data packet to the main station. If the sub-station knows its own position as well as that of the main station, the sub-station applies an advancement of time to the request-for-access data packet, so that this may be longer and contain more information, such as a self-selected recognition code and/or information relating to the length of the message to be sent. The main station measures the instant at which the request-for-access data packet is received relative to the time slot distribution and sends a correction of the advancement of time to the sub-station. After a send permission has been granted, the data packets are transmitted with a length essentially corresponding to that of the time slots, so that more information can be transmitted per data packet.

Inventors

  • 👤 Frans Zijderhand
  • 👤 Alfred Leonard Maria Weling

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-07 11:41
CPC Classifications
H; H04; H04W; H04W56/00; H04W56/004; H04W56/0045; H04J; H04J3/00; H04J3/24; H04B; H04B7/00; H04B7/24; H04B7/26; H04B7/2662; H04B7/2671; H04B7/2678; H04B7/2681; H04W56/0005

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 317 words
Method of transmitting data from a plurality of mobile sub-stations to a stationary main station by way of a common channel which is subdivided into time slots the length and synchronization of which being determined by a corresponding time slot distribution of a data transmission signal transmitted by the main station, in which the data packets have a time length essentially equal to the time length t S of the time slots and are transmitted by the sub-station slightly earlier than the beginning of the relevant time slot, the "advancement of time" being selected in such a way that the data packets, when received by the main station, are substantially synchronized with the time slot distribution of the main station, characterized in that a first, request-for-access data packet of a different configuration from that of the actual data packets is transmitted prior to the actual data packets of the message, in that the length t(1) of the first, request-for-access data packet satisfies t(1) < t S - 2t D,max where t S is the time length of the time slots, and t D,max is the maximum time delay that may occur in the coverage area of the main station concerned, and in that during transmission, the beginning of the first, request-for-access data packet substantially coincides with the beginning of a time slot in the sub-station, in that the main station is arranged for measuring the time t B that elapses in this time slot until the beginning of the reception of the first, request-for-access data packet, in that the main station is arranged for sending a code representative of t B to the relevant sub-station, and in that each sub-station is arranged for transmitting in response to the code representative of t B the message data packets with an advancement of time t A equal to tB and a length t(x) substantially equal to t S .
Claim 2
Dependent Claim 62 words
Method as claimed in Claim 1, characterized in that the maximum delay t D,max is approximated with the aid of the formula t D,max = R max /c where R max is the maximum possible distance between the sub-station and the main station in the coverage area of the main station, and c is the velocity of propagation of the communication waves.
Claim 3
Dependent Claim 20 words
Method as claimed in Claim 1, characterized in that each sub-station is arranged for individually computing the advancement of time.
Claim 4
Dependent Claim 41 words
Method as claimed in Claim 3, characterized in that the advancement of time t A is computed by the sub-station with the aid of the formula t A = 2R/c where R is the current distance between sub-station and main station.
Claim 5
Dependent Claim 187 words
Method as claimed in Claim 3, characterized in that the advancement of time t A (1) of the first data packet is computed by the sub-station with the aid of the formula t A (1) = 2R/c where R is the current distance between sub-station and main station, in that the time length t(1) of the first data packet satisfies the formula t(1) = t S - t r where t r is a correction term representing the time difference caused by reflections, if any, in that the main station is arranged for measuring the time t B that elapses in the relevant time slot until the beginning of the first, request-for-access data packet is received, in that the main station is arranged for sending a code representative of t B to the sub-station concerned, in that each sub-station is arranged for transmitting in response to the code representative of t B the message data packets with a length t(x) substantially equal to t S , and an advancement of time t A (x) which satisfies t A (x) = t A (1) + t B .
Claim 6
Dependent Claim 15 words
Method as claimed in Claim 5, characterized in that t r is about 40 µs.
Claim 7
Dependent Claim 37 words
Method as claimed in at least one of the preceding Claims, characterized in that the first, request-for-access data packet contains information relating to the plurality of data packets in the message to be sent by the sub-station.
Claim 8
Dependent Claim 47 words
Method as claimed in Claim 7, characterized in that the main station reserves a plurality of time slots for exclusive use by the relevant sub-station on the basis of said information relating to the plurality of data packets in the message to be sent by the sub-station.
Claim 9
Dependent Claim 51 words
Method as claimed in at least one of the preceding Claims, characterized in that the first, request-for-access data packet contains a random recognition code selected by the relevant sub-station itself, and in that the main station is arranged for repeating this recognition code when the permission to transmit is sent out.
Claim 10
Dependent Claim 87 words
Communication system, comprising a main station and at least one sub-station, the sub-station being arranged for receiving information from the main station as well as sending information to the main station, and the main station being arranged for sending information to the sub-station as well as receiving information from the sub-station, characterized in that the main station and the at least one sub-station are arranged for communicating with each other while implementing the method of data transmission as claimed in at least one of the preceding Claims.
Claim 11
Dependent Claim 102 words
Traffic navigation system, comprising at least one sub-station with a navigation computer on board a vehicle, which computer includes a static memory in which road network information is stored, a main station arranged for transmitting additional information as well as receiving information from the at least one sub-station, the sub-station being arranged for receiving said additional information as well as transmitting information to the main station, characterized in that the main station and the at least one sub-station are arranged for communicating with each other while implementing the method of data transmission as claimed in at least one of the preceding Claims.
Claim 12
Dependent Claim 105 words
Sub-station to be used in a communication system as claimed in claim 10 or in a traffic navigation system as claimed in claim 11, comprising a receive section and a send section, characterized in that means are provided for adjustable delaying information to be transmitted after being applied to the send section, and control means coupled to the receive section and the delay means which control means set the delay of the delay means on the basis of the code (t B ) received by the receive section, so that the information to be transmitted is actually transmitted with a predetermined delay (t A ).

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag