EP0852419A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Electric power supply management system
Assignee: Powercom Control Systems Ltd
•
Filing: 1997-12-04
•
Granted: —
•
Expires: 2017-12-04
Abstract
Abstract A communication protocol is provided for centralized power line networks, which allows for automatic network mapping and adaptive routing, for automatic log-on of remote nodes and also for optimization of communication routes and control of the traffic volume. A central unit (CU) polls all the known remote nodes (RN) and a polled RN replies with a message. A new remote node (RN), which hears a polling command from the CU, transmits a Burst-Log-On Message direct to the CU. A new RN, which hears a reply of polled RN, but not the polling message itself, transmits a Burst Log-On Message, using the replying RN as a relay. A route may include several relays between the new RN and the CU and all of them are registered in the Log On message itself. When the CU receives the message from the new RN, it performs a log on of the RN, stores its route, and polls it in the next polling cycle. This process is continuous, enabling the addition of new nodes. RN with no communication behaves as a new one and creates a new route.
Inventors
- 👤 Isidor Liberman
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-01 02:29
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H02; H02J; H02J13/00; H02J13/13; H02J13/1311; H04B; H04B3/00; H04B3/54; H04B2203/00; H04B2203/54; H04B2203/5404; H04B2203/5408; H04B2203/5462; H04B2203/5466; Y; Y02; Y02E; Y02E60/00; Y04; Y04S; Y04S40/00; Y04S40/12; Y04S40/121
Claims Analysis
Total Claims: 2
Claim 1
Independent Claim
452 words
A system adapted to carry out the following procedure: 1) mapping of remote nodes (RN) performed by a
central unit (CU) which operates in both modes of
polling and burst, 2) initially all nodes (RN) are in a New/Lost mode
and there are no known nodes in the central unit
data base, so that the central unit starts a
polling cycle by sending a polling message to an
imaginary node, with a reserved node ID, 3) wherein the polling message contains a time for
the bursts start and a number of available time
slots, 4) each remote node (RN) which receives the message,
stores the central unit as its neighbour, enters
into a known mode and waits for a time to
transmit a Log-on Burst Message, where time for
burst is computed by a New/Lost mode of each node
(RN), 5) the central unit enters the burst mode and waits
to receive a reply message, it records the
replying node (RN) in the data base as one that
has a direct connection with the central unit, 6) when the burst mode is finished, the central unit
computes new parameters for the burst mode
including start time and a number of slots and
re-enters the polling mode, upon which it
performs its first real interrogation cycle,
transmitting polling messages to all the nodes in
its data base, at this stage all the nodes are
with direct connection, without relays in the
route, 7) the New/Lost mode of each node (RN) that receives
the polling message stores again the central unit
as its neighbour, while each New/Lost node which
did not get this message but receives the polling
reply from another node (RN) stores the last
heard node as its neighbour, 8) all the nodes wait for the time of burst and
transmit the Log-on Burst Messages to their
neighbours, wherein if the neighbour is the
central unit the procedure is as before, but if
it is another node it acts as a relay and sends
in turn the received message to its neighbour, 9) the above procedure continues, wherein: central unit stores each new node received by it
in the data base together with the route (one or
more relay nodes), in the polling mode of the central unit (CU), all
the nodes are interrogated by sending to them
polling messages via the stored routes, each node in the New/Lost mode receives some node
reply to the central unit, or its transmission as
relay, registers it as its neighbour, when the burst time comes, it transmits its log-on
message to its neighbour, and each node that receives a message, transmits it
again to its neighbour, unit the message arrives
at the central unit.
Claim 2
Dependent Claim
294 words
A system as claimed in Claim 1, where optimization of
routes is achieved by the following steps: a) central unit sends polling messages to all the
nodes in its data base, each message containing
the number of retries performed for this message, b) central unit initializes this field to 0 and
increments it with each new transmission, until
receiving an acknowledge (Ack) from the first
relay on the route, c) each relay on the route also increments this
field with each re-transmission as does the
target node, when replying to the central unit
command, d) each message contains a unique ID, built up from
two fields: the Cycle Number and the Message
Sequence Number in the cycle, e) each node processes all the messages in the
network, even though it should not respond to
them, as a relay or a target, while each node
maintains a list of routes, each route keeping
the Message ID from which it has achieved the
route and the number of retries specified in the
message the first time received, f) the routes are sorted by a node according to the
number of retries, where the route with the
smallest number of retries it receives is the
best for it, g) the next time the node responds to the central
unit command, or it sends a burst message, it
will do this via the new route, and the central
unit will save the last received route for it
next polling command, h) to prevent a route, which accidentally succeeds
to be the best one, the node and the central unit
compute statistics for the known routes, the
statistics accounting for the number of retries
from the previous cycles, with their weights
being smaller and smaller as the time progresses.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.