[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

GB2560570A - Branched communications network - Google Patents

Branched communications network Download PDF

Info

Publication number
GB2560570A
GB2560570A GB1704219.3A GB201704219A GB2560570A GB 2560570 A GB2560570 A GB 2560570A GB 201704219 A GB201704219 A GB 201704219A GB 2560570 A GB2560570 A GB 2560570A
Authority
GB
United Kingdom
Prior art keywords
data
devices
code
level
intermediate elements
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.)
Withdrawn
Application number
GB1704219.3A
Other versions
GB201704219D0 (en
Inventor
Gharib Hamid
Zoualfaghari Mohammad
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.)
British Telecommunications PLC
Original Assignee
British Telecommunications PLC
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 British Telecommunications PLC filed Critical British Telecommunications PLC
Priority to GB1704219.3A priority Critical patent/GB2560570A/en
Publication of GB201704219D0 publication Critical patent/GB201704219D0/en
Publication of GB2560570A publication Critical patent/GB2560570A/en
Withdrawn legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/0003Code application, i.e. aspects relating to how codes are applied to form multiplexed channels
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/0077Multicode, e.g. multiple codes assigned to one user
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A communications network comprises nodes arranged in tiers (71/72, 711/712/721,722 and 810/811) to provide branching pathways from a central headend (3,4) to terminal nodes. The nodes are assigned spreading codes. The intermediate nodes (71 etc.) strip their spreading code from signals passing down from the headend to the terminals before forwarding the signal. Conversely the intermediate nodes aggregate signals travelling up from terminals to the headend and add their spreading code before forwarding. This creates a layered arrangement of spreading codes. The headend will apply the complete set of terminal and intermediate node spreading codes to terminal data when creating/receiving signals (see Fig. 13). Hence, each terminals signal is identified by its own spreading code and those along the path to/from it. This allows code reuse, possibly on a geographic basis. The signals may omit terminal identifiers and only use spreading codes for identification. The terminals may be wireless internet of things (IoT) devices with sensor/actuator functions.

Description

(71) Applicant(s):
British Telecommunications public limited company 81 Newgate Street, London, EC1A 7AJ,
United Kingdom (72) Inventor(s):
Hamid Gharib Mohammad Zoualfaghari (74) Agent and/or Address for Service:
BT Group Legal
Intellectual Property Department, Ground Floor, Faraday Building, 1 Knightrider Street, LONDON, EC4V 5BT, United Kingdom (51) INT CL:
H04J 13/00 (2011.01) H04W84/18 (2009.01) (56) Documents Cited:
CN 103298137 A US 6493376 B1
2014 Sixth International Conference on Computational Intelligence, Communication Systems and Networks (CICSyN). Proceedings, published 2014, IEEE Computer Society, pp 176-181, ElAttar et al, Enhancing the Performance of Wireless Adhoc Networks Using Spreading Codes (58) Field of Search:
INT CL H04J, H04W
Other: EPODOC, WPI, Inspec, Patent Fulltext (54) Title of the Invention: Branched communications network
Abstract Title: Multi-hop communications network wherein intermediate nodes add/strip their spreading codes before forwarding signals (57) A communications network comprises nodes arranged in tiers (71/72, 711/712/721,722 and 810/811...) to provide branching pathways from a central headend (3,4) to terminal nodes.
The nodes are assigned spreading codes.
The intermediate nodes (71 etc.) strip their spreading code from signals passing down from the headend to the terminals before forwarding the signal. Conversely the intermediate nodes aggregate signals travelling up from terminals to the headend and add their spreading code before forwarding. This creates a layered arrangement of spreading codes.
The headend will apply the complete set of terminal and intermediate node spreading codes to terminal data when creating/receiving signals (see Fig. 13).
Hence, each terminal’s signal is identified by its own spreading code and those along the path to/from it. This allows code reuse, possibly on a geographic basis. The signals may omit terminal identifiers and only use spreading codes for identification.
The terminals may be wireless internet of things (loT) devices with sensor/actuator functions.
Figure 12
Figure GB2560570A_D0001
At least one drawing originally filed was informal and the print reproduced here is taken from a later filed formal copy.
05 18 ’kt'
Figure GB2560570A_D0002
05 18
Figure GB2560570A_D0003
ΓΜ
CM
05 18
Figure GB2560570A_D0004
σ>
sl·
05 18
Figure GB2560570A_D0005
•M
CM
Figure GB2560570A_D0006
X
Φ c
£Z
W c
¢0
5_
Figure GB2560570A_D0007
CO co
Figure GB2560570A_D0008
cn cz co s».
.-]___t o
£Σ
Ο co <;.
Φ co ο
ρ
ϋ)
Φ
Ε
λ...
Cfl cc
Φ ω
Φ
Ο
Ο
1]--ο
Ό £Ζ φ
—»——J co
Ω.
co
Ο
Ω.
co
05 18 nnnnJ ο
Figure GB2560570A_D0009
1 i i i i i ί i o CM 203,1
1 £
05 18
Figure GB2560570A_D0010
05 18
Figure GB2560570A_D0011
05 18
Figure GB2560570A_D0012
CM
9/18
LO ο
CM
CM
Figure GB2560570A_D0013
Sync Drum Drum 1 Drum 2 Drum 3 Time _
CM
05 18
Figure GB2560570A_D0014
r~ hr fe o -(—* t (0 c; O
Ο θ Ο Λ
CD c: CC c:
o
Q £Σ φ ίύ as E J>
E F Ο E O LL '/= CD ™ 'fe E ώ «3 Q. O Z) Q
CO
CM
LO
Figure GB2560570A_D0015
Ό c:
co o E ϋ fe
E Φ
o Ό
a O
2si a
c: 03
c
Q c: £ “w 33
O o
Q
O
Figure GB2560570A_D0016
>-.
c:
O cd c: <D co o fe E O | E cd e ο ό E
Ο O n~ v Q β— ζ·^ CD — c co m D £ Ο Ωo Z3 Q cm,
CM
CM,
CM
CM
CM
CO
CM
CM
11/18 c:
φ
Ε Ε b- φ Φ Ο Μ +π ™~ Φ
C ςο φ
CO
τΉ CM co
o O o
Mt ’sl* Mj-
J m
co
Z-\
Φ
x tao
o c
u X
4xxi -> o
zs a
Q. c:
C LU
V_ L„„„.....J
tn
X
C co £
E o
u $ s
Φ υ O
H
O
4Λ >
UO
r~i CM co
o O o
co en co J
A
l §
§
t
1 I c
I 1 ...J. -x c
05 18
Figure GB2560570A_D0017
CD
Z3
D)
Ll co tn
CM
<u X &Q
o υ — » C X O
Φ Q. C u c UJ X .
Λ kL·
φ i
X 00
o c
u jfc, X
•M fi* o
u
ex c
c: UJ
f
/ V_
XT
LO
ΓΉ
Figure GB2560570A_D0018
A”
5 Ϊ c i
I i Ο ΐ
3 | 4~J 1
3 5 ΐ «------------ t Π3 Γ ex
1 L» t Ώ
05 * t 4-» t 1 X §
! L3J !
co 8 ! ! S'-
Q 1 v
; ^tC5 m
φ i X O u
Figure GB2560570A_D0019
05 1 Φ 1 k» & ICfX f Φ
«Μ 1 f C
L0 J $ «Ο
T E
o
u
co
4~*
Φ
05 18
Figure GB2560570A_D0020
13/18
05 18
Figure GB2560570A_D0021
05 18
Figure GB2560570A_D0022
Figure GB2560570A_D0023
Figure GB2560570A_D0024
15/18
Figure GB2560570A_D0025
05 18
Figure GB2560570A_D0026
17/18
Figure GB2560570A_D0027
05 18
Aggregator
Figure GB2560570A_D0028
Street 1
05 18
Figure GB2560570A_D0029
Branched Communications Network
This invention relates to data management systems, and in particular the handling of data generated by sensors and transmitted to a system management processor. Such data is increasingly used for interconnection, by way of the Internet, of computing devices embedded in everyday objects, enabling them to send and receive data - the so-called “Internet of Things” (loT).
The Internet of Things has been defined as “the network of physical devices, vehicles, buildings and other items - with embedded sensors and actuators - and the network connectivity that enable these objects to collect and exchange data”. One core requirement of loT is the ability of the sensors to transmit the collected data to the remote systems responsible for processing and storing the data. At io the same time, loT control and management systems need to send instructions to actuators to operate equipment (such as turning a lamp on or off) and to the sensors, for example to change their configuration or update their software.
In general, most actuators also incorporate a sensor of some kind in order to report the operating state of the actuator to the elements that control it. Likewise, many sensors incorporate an actuator in order to be responsive to commands from a control centre to deliver data on demand (“data pull”) rather than operating autonomously, in response to an external stimulus, or according to an internal clock (“data push”). In this specification, unless the context requires a more specific meaning, the term “sensor” embraces actuators whether or not they incorporate, or are incorporated in, sensors.
Sensors and actuators in an loT network are typically small, low cost units with minimal processing power, which make use of portable power sources such as batteries. Therefore, it is essential to use battery power efficiently to prolong the sensor’s operational life span. This constrains both the volume and reach of the data that can be transmitted by a sensor. Ideally, the smallest amount of data with minimum effective reach should be transmitted.
Although some sensors and actuators have wired or fibre connections to the internet, many of them send and receive data using wireless media. The wireless interface normally provides a number of states such as (i) transmit/receive (transceiver) state, (ii) idle state, and (iii) sleep state. The maximum power usage occurs in the transmit/receive state and the minimum happens in the sleep state. In the idle mode, the wireless (radio frequency) interface is not communicating but its circuitry is still turned on, ready to detect transmissions from base stations or other sensors nearby. This means that the power usage in idle state is only slightly less than that in the transmit/receive state. In particular, in idle mode, all transmissions detected have to be analysed by the sensor device before it can be determined whether they carry any data or instructions relevant to that sensor device. To minimise power usage, both the duration of transmit/receive and idle states should be minimised and that of the sleep state maximised. In the transmit/receive state, some sensors may be able to both send and receive data and management instructions simultaneously. This maximises operational efficiency, but requires that the data sent and received are not mixed up. To achieve this, appropriate data encoding schemes and frequencies are required.
An important characteristic of wireless Internet of Things communication is that it is regulated by duty cycle. Duty cycle is the proportion of time during which a device is active. In the case of a sensor’s radio component, given its three states as defined above, the duty cycle would be the time the radio component is in transmit/receive (transceiver) state. For example, a. duty cycle of 1% means that if a device operates for 1 mSec, it cannot then operate in the next 99 mSec. To achieve maximum efficiency, the length of duty cycle should be minimised. In many countries, the duty cycle has been restricted and regulated, to as little as 1%, in order to prevent interference and collision of data transmitted from different sensors/base stations, in the same area, at the same time and using the same frequency.
Time division duplex (TDD) is a transmission scheme that allows separate flows for uplink and downlink data transmission. Uplink is separated from downlink by the allocation of different time slots in the same frequency band. Some simple systems allocate time slots on the fly, but these are more suited to voice systems, as humans are able to recognise cues in each other’s speech which inhibit them from talking over each other.
Spread-spectrum techniques are methods by which a signal (e.g. an electrical, electromagnetic, or acoustic signal) generated with a particular bandwidth is deliberately spread in the frequency domain, resulting in a signal with a wider bandwidth. These techniques are used for a variety of reasons, including the establishment of secure communications, increasing resistance to natural interference, noise and jamming, to prevent detection.
Code Division Multiple Access (CDMA) is an example of a multiple access method, in which several transmitters can send information simultaneously over a single communication channel. This allows several users (transmitters) to share a band of frequencies. To permit this without undue interference between the users, CDMA employs spread-spectrum technology and a special coding scheme where each transmitter is assigned a unique code. The transmitted signal can only be decoded by a receiver which is programmed with the same code. By making the codes used by each transmitter mutually orthogonal with each other, several transmitters can transmit information simultaneously using the same frequency band, and at the same time interval. The orthogonality between the codes prevents the transmitted codes from interfering with each other, so that each receiving system is able to detect the data sent by its respective transmitter even if multiple transmissions have been made and their data aggregated.
Spread-spectrum CDMA is generally less suitable for high-bandwidth digital communication such as streaming than it is for voice, because the human brain is better able to cope with discontinuity of signal (voice) than a digital system, which requires error correction software to handle any missing or modified data. Although loT has an inherently lower requirement for bandwidth than most data communications, there would nevertheless be some practical difficulties in applying a standard CDMA system, optimised for voice, to an loT system, and this invention, together with those disclosed in our co-pending applications filed on the same date as this one and having applicant’s references and titles A33530 (Synchronisation in a Communications Network) and A33580 (Broadcasting in a Communications Network), seeks to address some of these issues.
Normal CDMA practice is to make the maximum bandwidth available to all channels (hence “spread spectrum”). However, in most cases loT applications, only one relatively narrow frequency band is available to be utilised in an loT network.
TDD-CDMA is a system in which TDD is added on top of CDMA, uses two sets of time slots (duty cycles) for bi-directional communication. While normally CDMA shares the same frequency band in the same time for the different users, TDD-CDMA allocates different time slots for uplink and downlink, wherein both uplink and downlink are using the same CDMA technique, but in the different directions. This time division allows a single code to be used for each uplink/downlink pair, doubling the number of active users which can be accommodated in the system as the total number of codes in a code set is fixed. However, as noted above, separation of both TDD and CDMA uplink and downlink channels can be an inefficient use of bandwidth where traffic is typically asymmetric. The division of time between uplink and downlink also increases the length of duty cycles, as each end of the link is essentially idle (in receive-only mode) for half the time. There is also a need for synchronisation.
According to a first aspect of the invention, there is provided a process for transmitting a plurality of signals from a control centre to a plurality of devices, or from a plurality of devices to a control centre, each signal being specific to a respective device, and each signal including a spread spectrum encoding sequence specific to the device convolved with encoded data relating to the device, by transmitting the signals over a multiple access channel carrying a plurality of signals, each specific to a respective device, wherein the encoded data relating to each device are capable of extraction by convolving the signal specific to the device with a spread spectrum encoding sequence and wherein the signal is transmitted to or from the control centre through a series of one or more intermediate elements, and the signal is convolved in a series of spread spectrum encoding sequences each associated with one of the intermediate elements in the series.
According to a second aspect, there is provided a network for transmitting a plurality of signals from a control centre to a plurality of devices, each signal being specific to a respective device, and each signal including a spread spectrum encoding sequence specific to the respective device convolved with a code specific to a command to be performed by an actuator associated with the device, comprising a plurality of disaggregators forming nodes in a branched network having a plurality of branching levels, each disaggregator having convolving means for extracting a signal according to a spread spectrum code associated with the node, wherein the input to a node at a first lower level is a spread spectrum output of the convolving process of a node at an adjacent higher level.
According to a third aspect, complementary to the second aspect, there is provided a network for transmitting a plurality of signals from a plurality of devices, to a control centre, each signal being specific to a respective device, and each signal including a spread spectrum code aggregated with a code specific to a measurement performed by a sensor associated with the respective device, comprising a plurality of aggregators forming nodes in a branched network having a plurality of branching levels, each aggregator having aggregating means for combining a signal with a spread spectrum encoding sequence associated with the node, wherein the output of a node at a first lower level is a spread spectrum input of the aggregating process of a node at an adjacent higher level.
In a fourth aspect,there is provided a network for transmitting a plurality of signals from a control centre to a plurality of devices, each signal being specific to a respective device, and each signal including a spread spectrum encoding sequence specific to the respective device convolved with a code specific to a command to be performed by an actuator associated with the device, comprising a plurality of disaggregators forming nodes in a branched network having a plurality of branching levels, each disaggregator having convolving means for extracting a signal according to a spread spectrum code associated with the node, wherein the input to a node at a first lower level is a spread spectrum output of the convolving process of a node at an adjacent higher level.
In a fifth aspect complementary to the fourth aspect, there is provided a network for transmitting a plurality of signals from a plurality of devices, to a control centre, each signal being specific to a respective device, and each signal including a spread spectrum code aggregated with a code specific to a measurement performed by a sensor associated with the respective device, comprising a plurality of aggregators forming nodes in a branched network having a plurality of branching levels, each aggregator having aggregating means for combining a signal with a spread spectrum encoding sequence associated with the node, wherein the output of a node at a first lower level is a spread spectrum input of the aggregating process of a node at an adjacent higher level.
In a preferred configuration, the series of intermediate elements forms a branched hierarchical network, and a first set of encoding sequences is used in a first level of the hierarchy and in at least one other level of the hierarchy. A first set of encoding sequences may be used in two or more intermediate elements at a first, lower, level of the hierarchy, the intermediate elements being differentiated by being associated with different encoding sequences at an intermediate device at a second, higher, level in the hierarchy at a point in the branched hierarchical network common to the respective series of intermediate elements connecting the respective devices to the control centre.
Preferably, devices or intermediate elements using a first set of encoding sequences for wireless communication are geographically separated from other devices or intermediate elements at the same level in the hierarchy using the same set of encoding sequences by regions in which devices or intermediate elements at the same level in the hierarchy are allocated one or more different sets of encoding sequences, the geographical separation being sufficient to prevent co-channel interference between devices or intermediate elements at the same hierarchical level.
Broadcast message may be transmitted to a plurality of devices all associated with an encoding sequence common to the devices. Connections between a device and a control centre may use the same code for both uplink and downlink transmissions.
The encoded data specific to a device may relate to measurements performed by a sensor associated with the device, or commands to be performed by an actuator associated with the device. Signals carrying instructions to a set of actuators may be transmitted to a plurality of actuator devices simultaneously using a single message encoded according to each of the sequences specific to those actuator devices.
In a preferred embodiment, the aggregation and disaggregation functions can take place in the same physical element, but a physical element having only one or other of these complementary functions is within the scope of the invention.
The present invention may use CDMA with frequency or time division superimposed. This allows a small number of devices to each operate a duplex link in each band, with a higher reliability than a single large frequency band. However, the use of CDMA also allows all sensors/actuators to avoid the need for frequency or time division, in particular between upstream and downstream, therefore reducing the complexity of synchronisation to avoid conflicts. This allows many more devices to utilise a single time slot (duty cycle) and have bi-directional communication in the same time slot. Use of a narrower frequency band also reduces the power consumption of the sensors.
The invention applies the CDMA technique to the data management platform, increasing the efficiency of the network. It also enables a number of other innovations.
In embodiments of the invention, Code Division Multiple Access (CDMA) is used for two-way communication in an loT network between each sensor (or actuator) and the systems responsible for the processing of the data collected by the sensors, and for the management of the sensors and actuators.
Embodiments of the invention will now be described, with reference to the drawings, in which 5 Figure 1 is a schematic depiction of a first simplified network architecture
Figure 2 is a schematic depiction of a second simplified network architecture Figure 3 is a schematic depiction of the generation of a time division system Figure 4 is a schematic depiction of a time division multiplex
Figure 5 is a schematic depiction of a sensor/actuator device according to an embodiment of the 10 invention
Figure 6 is a schematic depiction of a variant sensor/actuator device according to an embodiment of the invention
Figure 7 is a schematic illustration of the functional elements of a synchronisation subsystem of the embodiments of figure 5 or Figure 6
Figures 8, 9 and 10 are flow diagrams depicting information flows in an embodiment of the invention
Figure 11 is a schematic depiction of a processing/management system operable according to an embodiment of the invention
Figure 12 is a schematic depiction of a hierarchical network operable according to an embodiment of the invention
Figure 13 is a schematic depiction of a second management system operable according to an embodiment of the invention
Figure 14 is a schematic depiction of a second processing system operable according to an embodiment of the invention
Figure 15 is a schematic depiction of a third processing system operable according to an embodiment 25 of the invention
Figure 16 is a schematic representation of a practical application of the hierarchical system of Figures 12, 13, 14and 15
Figures 1 and 2 depict two simplified network architectures, simplified for illustrative purposes. Due to the limited power of the batteries used by sensors, and because sensors usually operate in different frequency bands, use different protocols and have no internet connectivity the data that they transmit usually cannot directly reach the target data processing system. Instead, the sensor data is passed to an aggregator/gateway 1 for onward transmission to the target system. In both Figures 1 and 2 a gateway node 1 provides communication between a number of sensors 20 - 29 (Figure 1), 200-223 (Figure 2), and data processing and management systems 3, 4 having respective databases 30, 40. The sensors 20, 200 etc transmit the data that they collect to the data processing systems 3 and receive control/management instructions from the management systems 4. As depicted in Figure 1, the data may be sent between each sensor 20, 21,22, etc and the gateway 1 directly. However, if a sensor 200 is not close enough to the gateway 1, its data may be forwarded indirectly, through a number of neighbouring sensors 201,202, 203 (determined using a multi-hop routing algorithm) before it can reach the gateway, as depicted in Figure 2.
Two way communication between sensors and target system normally involves the exchange of a large number of messages on a regular basis (e.g. every few seconds/minutes/hours/etc.). The number of exchanged messages and the size of the exchanged data depend on the sensor type and the requirements of the data processing and management systems.
Wireless transmission of sensor data presents a number of problems, in particular related to security and the avoidance of data collision.
Each sensor in the network is provided with the capability to transmit its data using CDMA technology, and embodiments of the invention can operate without the need for each sensor to have its own SIM card and network address. Using CDMA, each sensor can also communicate with other sensors in its vicinity or with a local gateway responsible for collecting the sensor messages, synchronising and combining them and forwarding the resulting combined messages to the data processing or management systems.
The receiving system would be able to detect the data sent by each sensor even if multiple sensors have sent their data simultaneously and their data have been aggregated. For instance, assuming there are two sensors S1 and S2 which use the following codes (chip sequences) to encode and transmit their data:
Si’s chip sequence 1 0 0 0 1 0 0 0 1
Si’s spreading sequence 1 -1 -1 -1 1 -1 -1 -1 1
Transmitted bits by S1 when data = 0 -1 1 1 1 -1 1 1 1 -1
Transmitted bits by S1 when data = 1 1 -1 -1 -1 1 -1 -1 -1 1
S2’s chip sequence 1 0 0 0 0 1 0 0 1
S2’s spreading sequence 1 -1 -1 -1 -1 1 -1 -1 1
Transmitted bits by S2 when data = 0 -1 1 1 1 1 -1 1 1 -1
Transmitted bits by S2 when data = 1 1 -1 -1 -1 -1 1 -1 -1 1
Aggregated signal if S1 and S2 simultaneously transmit data bit 1 2 -2 -2 -2 0 0 -2 -2 2
Aggregated signal if S1 transmits data bit 1 and S2 simultaneously transmits data bit 0 0 0 0 0 2 -2 0 0 0
It will be noted that a value of minus 1 is used in the spreading sequence to represent zero in the chip sequence. This is because to allow a zero value to be distinguished from a null (i.e no signal being transmitted)
The receiving system would have a copy of each sensor’s spreading sequence. These codes are used 5 by the receiving system to extract the data sent by each sensor (if any) from the received signal. This is done by convolving the spreading sequence with the aggregated signal (essentially multiplying the corresponding bits together and adding the results)
Conv Status Recovered Bit
Aggregated signal if S1 and S2 simultaneously transmit data bit 1 2 -2 -2 -2 0 0 -2 -2 2
Si’s spreading sequence 1 -1 -1 -1 1 -1 -1 -1 1
Recovered signal received from S1 2 2 2 2 0 0 2 2 2 14 > 0 1
S2’s spreading sequence 1 -1 -1 -1 -1 1 -1 -1 1
2 2 2 2 0 0 2 2 2 14 > 0 1
Conv Status Recovered Bit
Aggregated signal if S1 transmits data bit 1 and S2 simultaneously transmits data bit 0 0 0 0 0 2 -2 0 0 0
Si’s spreading sequence 1 -1 -1 -1 1 -1 -1 -1 1
Recovered signal received from S1 0 0 0 0 2 2 0 0 0 4 > 0 1
S2’s spreading sequence 1 -1 -1 -1 -1 1 -1 -1 1
Recovered signal received from S2 0 0 0 0 -2 -2 0 0 0 -4 < 0 0
Note that it is the sign (+ or -) of the recovered (convolved) data bits, not the amplitude, which identifies the recovered code. The amplitude is a measure of the reliability of the data bit
The messages sent by each sensor can be encoded using a specific key allocated to that sensor. The 5 messages sent by the sensors can be combined into a bulk message, and only the destination (data processing / management) system, which has a copy of each sensor’s key, is able to extract each sensor’s message from the combined message. This provides a high degree of security for the data transmitted by the sensors.
When dealing with a large number of sensors, especially when distributed over an area too large to allow direct communication (without relays) between the sensor and the data processing/management system, it is possible to aggregate the data transmitted by a subset of sensors using an aggregator unit (AU) before dispatching it to the final destination. This aggregation can be repeated at a number of levels by separate aggregator units. At each level, the data generated by the aggregators at the previous level are re-aggregated. This approach reduces the total volume of data transmitted by all sensors, resulting in faster communication between the sensors and the final system. Since the transmitted data io is encoded by each aggregator, the overall level of security is enhanced.
Embodiments of the present invention allow sensors to transmit their data synchronously or asynchronously depending on the requirements of the sensor networks.
Using CDMA, a sensor is able to send data, and receive control instructions, in a single duty cycle, by using different spreading codes for uplink and downlink. This means that the sensors do not need to wait until the next duty cycle to receive or transmit data. This results in faster communication between the sensors and the data processing and management systems. However, the requirement for different spreading codes for uplink and downlink reduces the number of different sensors that can be used. An alternative is to use the same code alternately for uplink and downlink (time division duplex), but this reduces the amount of data each sensor can transmit or receive. It is also difficult to allocate time to the uplink and downlink efficiently, as uplink and downlink may require different volumes of data (and thus time for transmission) and unless one link operates only in response to a command from the other the time at which a transmission is required on one or other of the links is difficult to predict.
In an loT sensor network, the data to be transmitted by each sensor can be encoded using a CDMA spreading sequence assigned to that sensor. The encoded data can then be transmitted to the local gateway (directly as shown in Figure 1, or indirectly through other sensors as illustrated in Figure 2).
To achieve maximum efficiency, the sensors can be synchronised. In this case, the transmission of their encoded data starts at the same time and the receiver at the gateway will detect an input which is the aggregate of the encoded data from the individual sensors. The gateway can transmit the aggregated code to the receiving system at pre-defined time intervals (e.g. every m minutes). This aggregation can increase the security of the data because it is now more difficult to distinguish between the data from different sensors without having their keys.
The ability to transmit the data from several sensors simultaneously, rather than sequentially, can speed up communication between the sensors and the control system by a factor proportional to the number of sensors, assuming the sensors are sending the same amount of data and have identical transmission capability. The amount of bandwidth saving that can be achieved by using CDMA is substantial. Considering a network of 625 sensors all sending their data to the same data collection system, the number of bits sent using CDMA technology would be 1/2000 of the non-CDMA situation resulting in faster transfer by a factor of 2000.
However, it is also possible to operate an unsynchronised CDMA system, using more complex codes. In contrast, in unsynchronised non-CDMA systems with random transmission times, collisions result in one of the data transmissions, and often both of them, being unintelligible.
By using CDMA it is also possible to achieve a more secure communication network between the 10 sensors and the data management system. Taking as an example a configuration using synchronised sensors and synchronised transmission, in which each sensor encodes its data using a specific key (spreading sequence) allocated to it and all the data from various sensors are aggregated (but not interfered) at the beginning of each clock pulse. For example, if we have a 9 bit CDMA code sequence, then each transmitted data bit (0 or 1) will be spread into 9 bits (chip bits). In a synchronised system, data bits are transmitted at the beginning of each clock pulse. This means in each clock pulse, nine chip bits are transmitted from each sensor transmitting a data bit in that pulse. So, for example three sensors may be transmitting in the first clock pulse, and eight sensors may be transmitting in the second pulse (which may include some or all of the first three). The start of transmission should be exactly at the beginning of the clock pulse, so chip bits and data bits are aligned.
The data collection centre has a copy of the key allocated to each sensor, and will therefore be able to decode the data transmitted by each sensor and identify which sensor transmitted it. Any eavesdropping systems may intercept the data from each sensor but they will not be able to decode it because they do not have the relevant key. Even if an eavesdropper were to happen to select a key that decodes some of the data, the data is of limited use without knowledge of the identity of the sensor to which that key is allocated.
For instance, we can reconsider a case where the data from sensors S1 and S1 are aggregated
Transmitted bits by S1 when data = 1 1 -1 -1 1 -1 -1 -1 -1 1
Transmitted bits by S2 when data = 1 1 -1 -1 -1 -1 1 -1 -1 1
Aggregated signal if S1 and S2 simultaneously transmit data bit 1 2 -2 -2 0 -2 0 -2 -2 2
Without having the relevant keys it would be more difficult to extract the data sent by each sensor from the aggregated code. Also if any noise occurs, and as a result one chip bit (or only a few chip bits) are altered, the data is still recoverable.
In embodiments of the invention, efficient duplex communication can be achieved within the limited duty cycle of loT networks. Sensors, like many other devices, tend to operate intermittently, that is, they are normally active only for a small fraction of the time and then become inactive to save energy. The activeinactive cycle is repeated continuously. Normally, the radio component of a sensor is capable of both sending and receiving data at the same time (i.e. transceiving), and by extension, in the same duty cycle. Under normal circumstances, if a sensor needs to send data to a TS and at the same time that
TS intends to send instructions to the sensor, then the sensor sends its data in one duty cycle and receives the instructions in the next one. It would be faster and more efficient in terms of both power usage and response times if both actions can be performed in the same duty cycle. .This can be achieved by using the same code to encode both the data to be sent by the sensor and also the instructions to be received by it, without the risk of interference between them should they occur in the same duty cycle.
The transmission of data by the sensor and instruction by the TS can be synchronised with a pre-set internal clock aligned with other sensors, by using two distinct encoding keys (spreading sequences). One key is used by the sensor to encode its data before it is sent to the TS. The other key is used by the TS to encode its data/instruction before it is sent to the sensor. The key allocated to each sensor for encoding its outgoing data should be distinct from any key allocated to any other sensor, and likewise TS uses a different key for transmissions intended for each sensor. The sensor knows the key used by the TS for encoding data intended for that sensor, and the TS knows the key used by each sensor for encoding the data that sensor transmits. Note that the data sent to and from a sensor in the same dutycycle may interact additively with each other at the receiver and be aggregated. However, as the sensor knows the key used by the TS to encode the data sent to it, so the sensor is able to extract the data destined for it from the aggregated signal. The same applies to data received at the TS from the sensors.
Based on the nature of CDMA, this technology can support both synchronous and asynchronous communications; however, different code sets, apparatuses and protocols may apply in each case. According to the nature of dumb sensors and basic end nodes of loT entities, a simplified version of
CDMA can be applied on the loT network infrastructures, in the lower levels. A synchronous system can be achieved by synchronising the end node entities (ENE) in an loT network using various techniques, such as GPS timing from GPS units attached to each ENE, pre-set timing and clocking circuits or, in the case of ENEs connected to the Internet, an internet clock.
An asynchronous system can be provided by using codes with longer length and less code weight (number of ones), and by using forward error correction techniques (FEC), and interference cancellation units.
If multiple sensors transmit their data wirelessly without synchronisation (i.e. there is overlap between the time windows during which they transmit their data) then there is the possibility of collision between their transmitted data before it reaches the gateway. This could result in data corruption. This collision problem can be avoided if the sensors are synchronised and each is allocated a separate time slot for data transmission, or it can be avoided by using an asynchronous CDMA system in which the decoding systems attempt decoding incoming signals at multiple starting points until a match is found. As depicted in Figure 3, each sensor 21,22, 23 (or 201,202, 203, using the architecture of Figure 2) is allocated a respective time slot 121, 122, 123, and transmits its data to the gateway 1 (or the next hop) during its allocated time slot. The gateway, on receiving the data, transmits it to the data processing system 3. However, this approach suffers from a number of problems.
Firstly, in the absence of a scheme for aggregating the sensors’ data by the gateway, the gateway will transmit each sensor’s data in full before transmitting the data from the next sensor, as shown in Figure 3. This means that the total time required for transmitting data from all sensors will be linearly proportional to the number of sensors.
Secondly, the volume of data (bandwidth required) to be transmitted from a gateway is equal to the sum of the volume of data transmitted by each sensor: For example, if all sensors transmitted the same amount of data d, the amount of data transmitted by n sensors will be n * d. This results in an upper limit on the number of sensors: if one considers a network of n sensors, in which each one transmits its data cyclically in its own time slot, the first sensor, having transmitted a set of data, cannot resume transmission until the last sensor has finished transmission of its data. One such cycle 41 of data transmission is illustrated in Figure 3. Figure 4 illustrates a sequence of such cycles 41,42.....49, each repeating the same pattern. In practice an inter-cycle gap 199 may be present if the number of sensors is less than the maximum capacity of the system, but this inter-cycle gap will get shortened as the number of sensors increases, reducing to zero at a point at which no more sensors can be added.
Thirdly, it is necessary to synchronise the sensors’ transmissions. The sensors can be synchronised by being provided with timing signals using a central clock , which can reside, for example, in the gateway 1, with its timing signals transmitted to the sensors 20, 200, etc. Such a clock pulse generator or “drum clock” is depicted in Figures 1 and 2
However, this requires greater power usage by the sensors, because they would have to receive and process timing signals. The sensors’ operations would also become more complex because of the need to receive and process timing signals. Alternatively, each sensor could be equipped with its own clock, which is periodically synchronised by a master clock which may reside, for example, in the gateway. This does not reduce the complexity of the sensor, but may reduce the power requirements. However, synchronisation will, in general, be less accurate between synchronisation events, requiring longer buffer or guard periods.
Fourthly, the data transmitted wirelessly by the sensors or the gateways can be intercepted by a third party, compromising its security and integrity unless it is encrypted or encoded in some way.
The message from/to each sensor needs to carry at least two types of information: namely the identification of the sensor, and the data captured by the sensor for transmission, or the data that is being sent to the sensor for its control/management. In the embodiments of the invention a separate sensor ID is not needed, as the spreading code is unique to the sensor to which it relates. This reduces the message size and increase the security, as each sensor can only comprehend the code/language allocated to it, so there would is no need for a separate code identifying the target sensor in a message because only one sensor understands the message. Even if an eavesdropper were to apply a spreading code to the message and decode it, without knowledge of the sensor or actuator to which the message relates the information would be of little value.
Figure 5 is a representation of a sensor node configured to operate according to an embodiment of the invention. For the sake of illustration, the node will be described as operating as node 202 in the network illustrated in Figure 2, but it will be understood that all nodes in the network of Figure 1 or Figure 2 would operate in substantially the same way. The sensor node comprises a sensor 50 which detects properties in the environment of the node 202 and collects data in a data collection function 51. The data may be transmitted to a data processing system 3 by way of the gateway 1 (and any intermediate nodes 203) in real time, or it may be stored for transmission in response to a command received from the data management system 4 by way of the gateway 1 and any intermediate nodes 203 through which the data is relayed. When the data is to be transmitted, it is encoded by an encoding function 52 using a CDMA code stored in the node (store 53) and the encoded data is passed to an output 54 for transmission to the gateway 1 by way of a network interface 55, which may use any suitable transmission system, for example radio, or an optical network.
Code Division Multiple Access (CDMA) is used for two-way communication between each sensor (or actuator) 20, 21.....200, 201, .....etc and the systems 3, 4 responsible for the processing of the data collected by the sensors, and for the management of the sensors and actuators themselves. Each sensor in the network is provided with a capability to transmit its data using CDMA technology, and embodiments of the invention can operate without the need for each sensor to have its own network address. Using CDMA, each sensor can also communicate with other sensors in its vicinity or with a local gateway responsible for collecting the sensor messages, synchronising and combining them and forwarding the resulting combined messages to the data processing or management systems.
Each sensor is allocated a unique key 53, allocated to that sensor, which it uses to encode all the messages it sends to the data processing system 3.
The messages sent by the sensors can be combined into a bulk message, and only the destination (data processing I management) system 3, 4, which has a copy of each sensor’s key, is able to extract each sensor’s message from the combined message. This provides a high degree of security for the data transmitted by the sensors. Likewise, only the data processing I management) system 3,4 has access to the keys used for transmission of instructions to the sensors, preventing their misuse by rogue inputs from unauthorised users.
Commands transmitted to the node 202, either to download previously-stored data (51), to control a sensor 50 to take a reading, or to operate machinery associated with the node, are received from the gateway 1 over the network interface 55 (again via one or more intermediate nodes if no direct connection is available) for delivery to an input 56. It should be noted that, as a CDMA signal, the input is a combined signal of all inputs and outputs carried on the system. An input code (stored at 57) is used by an extraction unit 58 to extract the command data from the input signal that is to be used by the node 23. This data is used by a command processor 59 to control the sensor/actuator 50 and, if required, to cause the data collection unit 51 to deliver stored data to the output 54.
As will be discussed, the loT management and data processing systems 3, 4 maintain a store of the relevant keys 53, 57, by which they can encode and decode messages to and from each sensor, as will be discussed.
If the node 202 is in use as a relay, the receiver 56 at the network interface 55 receives two or more CDMA signals from upstream and downstream nodes (201, 203). Each of these signals will consist of a combined set of data and/or commands, each encoded with its own unique codes. Those received from upstream will be a combination of any data generated by the upstream nodes (200, 201 in this example) whilst data received from downstream will be all commands intended for any of the nodes in the network, whether upstream or downstream, as well as any data generated downstream through the gateway 1 or at any intermediate node 203). This is because the interface has a single transmitter and receiver, and does not need to distinguish between upstream and downstream transmissions. The upstream and downstream inputs are both is fed to the output 54 as well as to the extraction unit 58. At the output unit 54 the encoded data from the encoder 52 is combined with the signal received at the input 56 for onward transmission to the neighbouring nodes 201,203 and thus to the rest of the network e.g 200 and the gateway 1. It will be understood that each node 1,200, 201,202, 203 receives all the data intended for, and transmitted by all the other nodes, whether notionally upstream or downstream, but commands generated by the management system 4 can only be acted on the node having the corresponding input code, and only the data processing system 3 can act on the data generated by the nodes. Thus the sensors/actuators are co-operating in a full duplex operation.
In embodiments of the present invention, one code sequence CO from the code set is allocated to be used as a “broadcast command code”. Each transceiver is programmed to decode this sequence as well as any sequence allocated specifically to that transceiver.
It would be possible to allocate more than one code sequence for use as broadcast codes, for example for subsets of the full set of transceivers
The code sequence can be used for a number of purposes, some of which are exemplified in Figures 8, 9 and 10.
Figure 8 depicts a process for broadcasting a command to all or a subset of the transceivers.
Figure 9 depicts a process for sending a synchronisation pulse (clock drum bit) to all/ subset of transceivers
Figure 10 depicts a process for broadcasting a firmware update to all/ subset of transceivers, and a process for performing a “Code Reallocation” to all or a subset of transceivers.
In this embodiment, the transceivers are (factory) pre-set with a code CO for decoding broadcast commands. The control centre has a one-to-many broadcast capability, and all the receivers can receive and understand the (same) message, decoding it using code CO.
Figure 6 illustrates the high level logical architecture of such a design. Features common with the simpler embodiment oi Figure 5 carry the same reference numerals. The additional elements are a command code store 757, a command extraction unit 758, and a device management unit 759. The command extraction unit decodes inputs received at the network interface 55, 56 using the co command code stored in the CMD code store 758, and forwards the commands to control the device management system 759. The device management system is configured to change settings of various other components 500, 51, 52, 53, 57, 757, 58, 758, 59, of the transceiver, in particular to synchronise the clock 500,to select input and output codes to be stored in the stores 57, 58, 757, 758 (including changes to the command code itself) and to modify duty cycles to be operated by the extraction and encoding processors 52, 58, 758. The command extraction unit 758 monitors the input 56 for a command sent via CO, and feeds the results into the device management unit 759. This device management unit is responsible for channel allocation, switching between input-only, output only, duplex, and idle modes, and firmware upgrades, and also controls the internal clock.
Figures 8, 9 and 10 show sequence diagrams for these various processes.
These figures depict a three-level architecture comprising the “loT Cloud 4 “Gateway” 1 and “Transceivers” (21-29)
Referring first to Figure 8, 522 is an activity which has a start-time, an end-time and length in the loT Cloud level 3, 4, and 525 is an activity at the level of the gateway 1. Interactions between these activities are depicted generally at 523.
Generally each transceiver 21,22, 23,.....29 transmits data to the gateway 1 using its respective code
C1, C2, C3.....C9, and the gateway 1 forwards this data to the data processing system 3. As shown initially these transmissions are not synchronised.
The interaction 523 starts from the start-time of activity 525 and is completed at the end time of the activity 525. This interaction causes the generation of activity 522 in the loT Cloud level (4). All the interactions (e.g. 523, 524, etc) between any two activities (e.g. 525 and 522) occur in parallel and start at the start-time of source activity (525) and are completed at the end time of the destination activity (522).
As shown in Figures 9 and 10, a command 524, 526, 527 may be transmitted from the loT management system 4 using code CO, which is received and decoded by all the transceivers 21-29. This command may be used as a synchronisation signal 524 in order to synchronise the transmissions of the transceivers 21 -29. As can be seen, in response to the synchronisation signal 524, each transceiver 21 28 is able to synchronise its activity cycles 512, 513, 514 with the drum signal 511 It will be noted that not all transmitters need to transmit on each cycle. The receivers all are synchronised to decode using the same synchronisation for their spreading code, but not all of them will detect a message on each cycle.
It will also be noted that different code sets C1 - C4, C5-C8 are used for the uplink and downlink. As will be discussed below, these allocations may be changed using another command signal.
The command code may be used to instruct the various transceivers 21-28 to operate on specified codes, and to change those allocations as circumstances require. In particular, individual transceivers may be instructed to operate in time division duplex mode (using the same code for uplink and downlink) or uplink only mode, or downlink only mode, instead of in full duplex mode (that is, with separate codes used for uplink and downlink), thereby releasing a code for allocation to another transceiver.
A simplified illustrative example will now be discussed. In this simplified example, a prime code family is used with p=3 and cardinality (N) of 9 code sequences (i.e. C0-C8) in a code set. In a full-duplex application, only four transceivers (TR) can be accommodated, each having two codes, one for transmit and another for receive. (The ninth code, CO, is the command code). For example, in the transceiver 21, C1 is allocated for transmit (TX) and C8 for receive (RX), and likewise for the other transceivers, for transceiver 2k, code Ck is allocated for transmit and code C(9-k) for receive.
TRs TX RX
TR21 C1 C8
TR22 C2 C7
TR23 C3 C6
TR 24 C4 C5
A similar number of devices 25-28 can be defined as “shadow” devices. These can be allocated the same channels, but with their transmission and receive code allocations reversed:
TRs TX RX
TR 25 C5 C4
TR 26 C6 C3
TR 27 C7 C2
TR 28 C8 C1
Each shadow device shadows an original device and uses the same codes for TX and RX as the original device but in reverse order:
Original TRs Shadow TRs
TR 21 (C1, C8) TR 28 (C8, C1)
TR 22 (C2, C7) TR 27 (C7, C2)
TR 23 (C3, C6) TR 26 (C6, C3)
TR 24 (C4, C5) TR 25 (C5, C4)
A command can then be defined to configure the eight transceivers into any one of a number of compatible configurations, as required to meet the demands being placed on the system. One example, using two binary digits to control all eight transceivers, is illustrated in the table below. Each of these states use each code for only one purpose, but the system can be configured such that all transceivers can operate in receive mode, or all of them in transmit mode, or half of them in full duplex mode.
Binary Command TR 21-24 Shadow TR25- 28
00 RX Only RX Only
01 Inactive Full-Duplex
10 Full-Duplex Inactive
11 TX Only TX Only
Any of the four commands (00, 01, 10, 1 ) can be sent over channel CO to all transceivers, and acted on by them. For instance, by sending 00 to them all eight transceivers will operate in RX mode. If the code 01 is sent to them, then the original transceivers will become inactive and the shadow ones will operate in full-duplex mode. Code 10 has the reverse effect. Finally, code 11 will put all transceivers into transmit mode.
More complex instructions are of course possible. The trigger for a change of mode may come from the loT management system 4, or may be in response to a request from transceiver for permission to io operate in a particular mode (e.g. full-duplex). Upon receiving this request, the gateway 1 decides to allow the transceiver to operate in the requested mode immediately or at some point of time in future, and generates a set of commands for broadcast to a subset of transceivers to make them operate in a new fashion. For example, adding the requested transceiver to a full-duplex group of transceivers.
The allocation of codes to Transceivers and Shadows, the number and meaning of the commands and the number of device groups (in this case TWO;, the TR group and the Shadows group) can vary and be different from this example. For example, it is possible to have four groups of devices, and a set of commands to achieve the following:
Transceivers in group 1: always operate in full-duplex mode
Transceivers in group 2: always operate in transmit mode
Transceivers in groups 3 and 4 act as original and shadow transceivers and will be in one of the two modes: full-duplex or inactive.
Figure 8, illustrates a case where all the devices have a mono dialogue (i.e. all TX) to the gateway (i.e. CMD = 11 from table above), and they operate asynchronously. Code CO can be safely used to send a new mode (i.e. CMD = 10) to the device (524), while at the same time some or all of these devices are transmitting.
Figure 9 illustrates a case in which all the devices get a clock command 524 sent from gateway using CO, and start an internal clock (pulse train). From this point onwards, they can send/receive their messages aligned with others, (synchronous CDMA). In this example an actuation signal 526 is then transmitted causing the primary transceivers 21 -24 to operate in full-duplex mode, using all eight codes
C1 to C8 while the Shadow transceivers 25-28 are inactive. A further actuation code may then be used to change these code allocations,
Figure 10 illustrates a firmware update 503 and a code reallocation 504, respectively, both using the command channel CO.
Also shown in Figure 5 is a synchronising system 500, shown in more detail in Figure 7. As shown in
Figure 7 a pulse train of a clock drum is broadcast either by a wireless antenna or, in a preferred embodiment, in a general control transmission using one of the CDMA sequences. The clock signal is detected in the synchronising system 500 by a receiver 80, and used to control the encoding and decoding processors 52, 58. The synchronisation can be improved further, by determining the distance of each transceiver from the broadcasting antenna, using techniques such as measuring the received signal power, using a signal strength monitor 81, and comparing it with a reference value either stored locally (82) or encoded in the broadcast clock signal 400 to control an offset calculation 83.
This clocking system reduces symbol collisions, and interference, and allows more throughput as less complex code sets are required. This in turn allows a greater number of simultaneous active transceivers, less bit error rate (BER) and hence less need for complicated forward error correction units (FEC), easier detection at receivers and hence simpler and faster receivers.
An asynchronous system can be used if perfect orthogonal codes, with zero correlation (i.e. similarity) are used. The receiver puts a windows of code length (L) on the received sequence and repeats this for each received bit, following with (L-1) previous bits, and correlates the code signature with this window to find the similarity, and recover the data. This requires more processing than a synchronous system, as each window has to be assessed to determine whether the signal carries a message. However, once the correct window has been identified the sensor or receiver can lock on to that window, at least for the duration of that message.
Figure 11 is a representation of a data processing system 3 and a management system 4 configured to operate according to one level of a hierarchy in an embodiment of the invention. Data received and processed by the data processing system 3 is used to control the management system 4. The data processing system may also send instructions to the management system to cause individual sensors to collect data.
As depicted in Figure 11, both the data processing system 3 and the management system 4 are connected to the sensors through the same gateway 1, but more complex network structures are possible, with multiple gateways, provided that all messages can be transmitted to all destinations.
The data processing system has respective interfaces 301,302, 303 etc serving each sensor node 201, 5 202, 203. An input stream 63 from the gateway 1 carrying all the encoded data collected from the sensors 200, 201,......210, .....etc is processed by a bank of extraction decoders 158, 258, 358 ...., each using a respective input code 157, 257, 357 corresponding to the output codes 53 used by the respective encoders 52 in each node. It should be noted that the data stream 63 is not modified by the extraction decoders 158, 258, 358, ......, as each decoder extracts the data required from the same io stream. Although depicted as taking place in series, the extraction may take place from parallel feeds.
The extracted data is fed by each decoder to its respective interface 301,302, 303......
The data processing system also has respective interfaces 401,402, 403 etc serving each sensor node
201,202, 203. These all supply command data to the gateway 1 through a combined command stream
64, carrying all the encoded data destined for the sensors 200, 201,......210, .....etc. The command data from the interfaces 401, 402, 403, is processed by a bank of encoders 152, 252, 352 ...., each using a respective output code 157, 257,357 corresponding to the input codes 57 used by the respective extraction decoders 58 in each node 201,202, 203. It should be noted that each encoder 152, 252, 352 modifies the data stream 64 by adding its own encoded data. Although depicted as taking place in series, the encoding may take place on several branches, combined before delivery to the gateway 1.
The system described above has a number of practical applications and refinements.
A large loT network is usually organized as a hierarchy or relays. An embodiment of the invention using such a hierarchy is depicted in Figures 12, 13, 14 and 15. Figure 12 depicts a three level hierarchy with nodes 810, 811 812....at the lowest level, nodes 711,712, 721 at an intermediate level and two nodes 71, 72 at the third level. As shown in Figure 12, it can be convenient to have all equivalent devices at the same hierarchical level even if f there is only one sensor in some of the branches, as depicted for the branch 722, 822.
Different elements in the network may perform different tasks (data generation, data processing) or use different communication technology (e.g. frequency, modulation, protocol).
The signal from some sensors may not be visible to a base station of the telecommunications system, 30 and hence has to be relayed/aggregated by other network elements (e.g. gateways/aggregators) to reach the base station. Several intervening relay stations may be required to reach the TS.
Certain tasks may need to be divided into sub-tasks to be undertaken by different types of elements at the various levels of hierarchy within the loT network. For example, image recognition may be undertaken by two types of elements: a number of cameras may be responsible for capturing images and transmitting them to one/more processing stations which will analyse the raw images and only send the result (e.g. detection of a person, etc) to the TS.
The CDMA system may be used in a hierarchically organised loT network by arranging that at each level of the hierarchy, the signal from each node (sensor/aggregator) is only visible to one aggregator node at the next level up. This means that there is only one route from each sensor to the final TS through the hierarchy. At the lowest level of the hierarchy, the sensor nodes encode their data using CDMA codes assigned to them and transmit them to higher level aggregator/processor nodes.
At each level of the hierarchy, an aggregator node (for example node 711) receives data from nodes io 810, 811 visible to it. The received data is aggregated and then encoded again using the CDMA code allocated to the aggregator itself. This means that the same bit of information will be encoded multiple times by aggregators (811,711,71) at different levels as it moves towards the management system 4.
At each level of the hierarchy, the nodes that share a common visible parent (e.g. nodes 810, 811 share parent node 711) share a code set and each node is assigned a separate code from this code set.
These constraints allow each code set to be reused by groups of nodes which have different parent nodes. For example, one code set can be used by nodes 810 and 811 in subnet 711. The same code set can also be used by nodes 812, 813, and 814 having parent node 712, by nodes 820 and 821 having parent node 721, and by node 822 having parent node 722. This re-use also applies to the aggregators at other levels of the hierarchy, so that nodes 711 and 712 (having parent node 71) can use the same codes as nodes 721,722 (having parent node 72). Moreover, it is possible to use the same codes at each level of the hierarchy, provided that each node is reached by a different combination of codes.
Figures 12, 13, 14 and 15 illustrate a hierarchical network in which data transmitted by a subset of sensors through a gateway 810 (AU) is aggregated with data from one or more further gateways 811, 812, etc at an aggregator unit 71 before dispatching it to the final destination. As depicted in Figure 12, this aggregation can be repeated at a number of levels by further aggregator units e.g 71,72. At each level, the data generated by the aggregators at the previous level are re-aggregated. This approach reduces the total volume of data transmitted by the system as a whole, resulting in faster communication between the sensors and the final system. Since the transmitted data is re-encoded by each aggregator, the overall level of security is enhanced.
As shown in Figure 13, at the management system 4, the data from each interface 401,402, 411,412 etc is encoded one level at a time. Each stream is first encoded according to the layer 1 input code 153, 253 appropriate to the target node 810, 811 etc (Figure 12), the resulting streams can then be combined in turn at a second layer aggregator 452 using an input code 153 associated with the first aggregator
711 on the route (that is, the one closest to the target node). It will be noted that the same codes 153, 253 can be used at each level, and on different branches at the same level. This reduces the number of codes required at each level, allowing a more robust coding with less chance of mis-correlation, and therefore greater reliability.
As shown in Figure 14, extraction can also take place in stages, with layer 2 output codes 157, 257 used for extraction of the lower level data streams (extraction units 458, 558), and layer 1 output codes 157, 257 then being used to extract data at the lower level (extraction units 159, 259) to provide the data to the respective interface units 301,302, 311,312. .
It will be seen from Figures 13 and 14 that the same codes 153, 253, 157, 257 can be re-used in each branch of the hierarchy, the individual sensors and actuators being differentiated by the branch in which they are arranged and thus the higher level input and extraction codes 153,253; 157,257. Interference between levels is avoided because at each level the several signals to/from lower levels are convolved together and can only be correctly decoded by the receivers at the appropriate level.
In an alternative arrangement shown in Figure 15, each interface unit 301,302, 311, 312 in the Data processing system 3 can receive the complete combined data stream 63 and have a dedicated set of extraction processors. For example, the interface unit 302 uses a layer 2 extraction unit 458 and a layer 1 extraction unit 258, using codes 157 and 257 respectively, whilst the interface unit 312 uses a layer 2 extraction unit 559 and a layer 1 extraction unit 259, using code 257 respectively. Note that although each code 157, 257 is used by more than one interface, each interface 301,302, 311,312 uses a unique combination of codes. Note also that because each layer converts each bit to or from a signal of multiple bits, the use of a first code in a first layer and a second code in a second layer cannot be read by a device in which decoding uses the second code in the first layer and the first code in the second layer.
Such a hierarchical system may be used to control a set of sensors and actuators individually or in various subsets of the whole. The sensors in a geographical area (such as one/more streets/cities/regions, etc.) can be controlled by a single management/control system (TS). This system may require to undertake actions such as switching on/off all or a subset of the sensors, download new version of software to all or a subset of them, etc. Ideally, the management/control system should be able to simultaneously send the data/instructions to the target sensors.
For example, Figure 16 depicts a system set up to control street lighting in a highway network 9. Each individual street lamp installation 90, 95.... has a wireless transducer with which it can communicate, by way of a wireless network 93 and the internet 94, with an application platform 99.
Each installation has a lamp 98 or other element such as a variable sign, and associated actuation apparatus to switch it on and off, and also has a sensor installation 97. The sensor installation 97 may include an ambient light sensor, which may be used to control the street lamp 98 directly. The sensor installation may also include sensors for other conditions not directly related to street illumination, such as temperature, traffic levels, pollution etc.
The management/control system can achieve this by first encoding (using CDMA scheme) the individual messages destined for a set of sensors, located in a specific geographical area, using those sensors’ individual keys. Next, the encoded messages are divided into a number of groups and the messages in each group are aggregated into one message. The resulting aggregated message is then broadcast. Subsequently, each sensor receiving the aggregated message can use its own key to extract any data/instruction that has been sent to it.
io This approach allows the total number of messages sent by the management/control system to be reduced thorough aggregation. An aggregated message can include the messages destined for multiple sensors. This means the transmission of data/instructions to the target sensors can be achieved faster using less bandwidth. By sending a single message to multiple sensors it is possible to achieve the desired effect (e.g. switch them on/off) simultaneously. The sensors can also be targeted selectively 15 for example it is possible to change the status of only a subset of sensors in a geographical area.
If there is no hierarchy, i.e. all lamps are in the same level, assuming we have 49 lamps, one message of length 49 bits would be broadcasted to all lamps. However, with a hierarchical architecture, one message of length 49 bits can be sent to, for example, seven street level aggregators (i.e. level 1 of hierarchy). The aggregator then decodes the street level data and sends a message of length 7 bits to each of the individual lamps in each street. In this case, the length of the message sent to lamp nodes are much shorter than the no-hierarchy case. This saves battery and processing power. Also, in the hierarchical case code-reuse would be possible and shorter, simpler code families can be used.
Thus, all the N messages to N nodes can be combined into one message with the same length of a single message to each node, and broadcast. These mixed messages are recoverable, based on the orthogonality of the codes used to encoding the messages.
As an example of the use of the hierarchical systems of Figures 11 to 16, the installations 90, 95 etc may be grouped so that all the installations in one street have the same level 2 code but different level codes. This simplifies the control of a system as it allows each light to be controlled individually or, by selecting all level 1 codes but only one level 2 code, to make all the lights in one street to be turned on and in another to be turned off using the same message. Alternatively, if required, by selecting all level codes but only one level one code, each street can be lit by a single light, thereby reducing energy consumption and light pollution, for example at times when there are few pedestrians present. By code sharing in this way, less bandwidth is required to transmit the data necessary than would be the case if each installation had to be sent a unique message.
In a network, with for example one base station serving seven streets, and each street having one aggregator serving seven lights, there are a total of seven aggregators and 49 lights, the required 49 messages, each with length of let us say L=49 bits, can be merged together in a single message of length L=49.This message is broadcast to all seven aggregators (level 1 in hierarchy), where the messages are decoded using seven different and unique codes within the aggregators. This decoded message is passed to each and all lights in each and all streets (level 2 in hierarchy).In a similar approach, again, lights decode these level 1-decoded-messages with their own codes and recover the io data. In this example, seven codes are required for 49 lights. The same seven codes can be used for the seven aggregators. So, 7 aggregators, and all 7 lights in each street use c1-c7. It means that light 1 in all the streets, and aggregator 1 (street 1) use the same code c1, but as it is shared across different branches of the hierarchy levels, they would not interfere.
It has been mentioned that the code sequences can be reused at each level (Fig 5), to transmit the data to and from the data hub. Hence, theoretically each code can be re-used both “horizontally” within a given level (on different branches) and “vertically” (at different levels) in the proposed hierarchy design. For example, code Ci can be re-used for the sensors on the first lamp posts on each street 1,2, ..., 6, 7 (i.e. horizontal reuse at level 1) and also for aggregators in levels 2, 3 and above (i.e. vertical reuse).
In practice this may not be 100% achievable, particularly when communication is by wireless transmission rather than a closed system such as wire or fibre, because of the locations of sensors (Level 1) and aggregators (Level 2). Figure 17 illustrates an example of a collision in such a configuration. In Figure 17, a first aggregator 91 is depicted serving a set of actuators (street lights) 911, 912,....915, and a second aggregator 92 serves a second set of actuators (street lights) 921,922, 923,
924.
As described above, it is possible for both sets of actuators to use the same set of codes at the second level, as they are associated with different aggregators. In this example both device 911 and 921 are allocated the same code Ci, and report to their respective street’s aggregators 91, 92. However, if a device 911 working to the first aggregator 91 is also in the range of the second aggregator 92, it will interfere with a device 921 working to that second aggregator 92 using the same second level CDMA spreading code. Furthermore, in the case of “vertical” reuse (re-use of codes at different levels in the hierarchy) there may also be interference between levels. This can be resolved by allocating different sets of codes to neighbouring aggregators.
Let us say we have a prime code set of C = {ci, C2, C3, ..., C49}, where prime number p=7and the cardinality (i.e. the number of codes) is p2.
For given code set, let us define seven code groups, each having seven members, as follows:
A = {ci, c2, ..., c7}
B = {C8, Cg, ..., C14}
C = {C15, C16, ..., C21}
D = {C22, C23, ·, C28}
E = {C29, C30, ·, C35}
F = {C36, C37, , C42}
G = {C42, C43, ·, C49}
The number of members in each code group in this example is equal to the number of groups, but this is not necessarily the case. For example if p=11 there are p2 = 121 available codes, allowing 17 for each of the seven groups (7x17 = 119), with two spare codes for management or broadcast purposes.
Figure 18 below shows how these groups of codes may be distributed in such a way that their codes do not interfere with each other. The geographical area would be divided into various zones depicted in bold outline, such as Zones 888, 889, and each zone consists of seven cells, respectively labelled A, B, C....G. Each group of codes (i.e. A-G) is then allocated to the cells in the respective zone. Each sensor or aggregator operating in a cell, will then use a code selected from a code group allocated to that cell.
The radius of each hexagon in Figure 18 is selected to be the approximate range of each transmitter, assumed if it has been located in the middle of hexagon, although in practice factors such as variations in topography and irregular location of transmitters make a practical embodiment depart from the regular hexagonal array depicted in Figure 18. It should also be noted that transmitter ranges do not have clearly defined cut-offs, so boundaries are not as clearly defined in practice as would appear from Figure 18, and a transmitter near a depicted boundary between two zones in Figure 18 is likely to be detectable in parts of the adjacent zone.
In order to avoid potential conflicts caused by such overlap, each cell and corresponding group of codes are re-used in other zones as shown, thus providing that the same cells I groups are not reused in adjacent neighbouring cells, as that would cause co-channel interference. In this model, between any two or more identical cells I groups (let us say cells within Group A) there are at least two other adjacent groups, and this provides a code-interference-free environment; so that all the used codes can be reused in other zones.
The maximum number of devices that can be accommodated in each cell is then N (in this example eleven) and in each zone 7N devices can be accommodated.
The same structure can be replicated at higher levels in the hierarchy, such that, for example, the aggregators serving the cells in Zone 888 all report to a higher-level aggregator using code A, and those in Zone 889 use Code B.
One class of orthogonal codes for use in CDMA are known as the “prime codes”. Embodiments of this invention use a prime code family referred to as “Uniform Cross-Correlation Modified Prime Code”, UCMPC which provides both higher code weight and auto-correlation (AC) while its cross-correlation (CC) value remains 1 for all code sets derived from it. Because of the uniformity of the CC function of UCio MPC, the probability of interference is the same between each pair of code signatures whereas in the other prime code families this is not the case.
The unique properties of UC-MPC result in:
(i) better system performance through lower bit error rate (BER) (ii) higher difference between auto-correlation and cross-correlation of codes 15 (iii) improved code security (iv) reduced co-channel interference (v) easer to decode in the receiver (vi) for a specific code length p, the maximum number of simultaneous users (N) in a system employing UC-MPC signatures is higher than systems employing other prime code families
UC-MPC can be easily implemented in an existing conventional prime code system without any need to change the hardware.
The advantages of using CDMA in loT sensor networks include faster and more secure communication.
In particular, the messages dispatched from a large number of sensors can be combined into a single message, either over the air, or at a gateway, for onward transmission. This reduces the total number and size of all the messages transmitted by the sensors, hence resulting in speedier communication.

Claims (16)

1. A process for transmitting a plurality of signals from a control centre to a plurality of devices, or from a plurality of devices to a control centre, each signal being specific to a respective device, and each signal including a spread spectrum encoding sequence specific to the device convolved with encoded data relating to the device, by transmitting the signals over a multiple access channel carrying a plurality of signals, each specific to a respective device, wherein the encoded data relating to each device are capable of extraction by convolving the signal specific to the device with a spread spectrum encoding sequence and wherein the signal is transmitted to or from the control centre through a series of one or more intermediate elements, and the signal is convolved in a series of spread spectrum encoding sequences each associated with one of the intermediate elements in the series.
2. A process for receiving signals from a plurality of devices for transmission to a control centre, or from a control centre to a plurality of devices, each signal being specific to a respective device, and each signal including a spread spectrum encoding sequence specific to the device convolved with encoded data relating to the device, by transmitting the signals over a multiple access channel carrying a plurality of signals, each specific to a respective device, and wherein the received signals are transmitted through a series of one or more intermediate elements, the received signals being aggregated using a series of spread spectrum encoding sequences each associated with one of the intermediate elements in the series, and wherein data relating to each device is extracted by convolving the signal with a spread spectrum encoding sequence specific to that device.
3. A process according to Claim 1 or Claim 2, wherein the series of intermediate elements forms a branched hierarchical network, and in which a first set of encoding sequences is used in a first level of the hierarchy and in at least one other level of the hierarchy.
4. A process according to Claim 1, Claim 2 or Claim 3, wherein the series of intermediate elements forms a branched hierarchical network, and in which a first set of encoding sequences is used in two or more intermediate elements at a first, lower, level of the hierarchy, the intermediate elements being differentiated by being associated with different encoding sequences at an intermediate device at a second, higher, level in the hierarchy at a point in the branched hierarchical network common to the respective series of intermediate elements connecting the respective devices to the control centre.
5 A process according to Claim 4, wherein devices or intermediate elements using a first set of encoding sequences for wireless communication are geographically separated from other devices or intermediate elements at the same level in the hierarchy using the same set of encoding sequences by regions in which devices or intermediate elements at the same level in the hierarchy are allocated one or more different sets of encoding sequences, the geographical separation being sufficient to prevent co-channel interference between devices or intermediate elements at the same hierarchical level.
6 A process according to Claim 4 or claim 5, in which a broadcast message is transmitted to a plurality of devices all associated with an encoding sequence common to the devices.
7. A process according to any preceding claim, in which a connection between a device and a control centre uses the same code for both uplink and downlink transmissions.
8. A process according to any preceding claim, wherein the encoded data specific to a device relates to measurements performed by a sensor associated with the device
9. A process according to any preceding claim, wherein the encoded data specific to a device relates to commands to be performed by an actuator associated with the device
10. A process according to claim 9, in which signals carrying instructions to a set of actuators are transmitted to a plurality of actuator devices simultaneously using a single message encoded according to each of the sequences specific to those actuator devices.
11. A network for transmitting a plurality of signals from a control centre to a plurality of devices, each signal being specific to a respective device, and each signal including a spread spectrum encoding sequence specific to the respective device convolved with a code specific to a command to be performed by an actuator associated with the device, comprising a plurality of disaggregators forming nodes in a branched network having a plurality of branching levels, each disaggregator having convolving means for extracting a signal according to a spread spectrum code associated with the node, wherein the input to a node at a first lower level is a spread spectrum output of the convolving process of a node at an adjacent higher level.
12. A network for transmitting a plurality of signals from a plurality of devices, to a control centre, each signal being specific to a respective device, and each signal including a spread spectrum code aggregated with a code specific to a measurement performed by a sensor associated with the respective device, comprising a plurality of aggregators forming nodes in a branched network having a plurality of branching levels, each aggregator having aggregating means for combining a signal with a spread spectrum encoding sequence associated with the node, wherein the output of a node at a first lower level is a spread spectrum input of the aggregating process of a node at an adjacent higher level.
13. A network according to Claim 11 or Claim 12, wherein a first set of encoding sequences is used in two or more intermediate elements at a first, lower, level of the hierarchy, the intermediate elements being differentiated by being associated with different encoding sequences at an intermediate node at a second, higher, level in the hierarchy at a point in the branched hierarchical network common to the respective series of intermediate elements connecting the respective devices to the control centre.
14. A network according to Claim 13, in which a connection between a device and a control centre uses
5 the same code for both uplink and downlink transmissions.
15. A network according to Claim 14, wherein devices or intermediate elements using a first set of encoding sequences for wireless communication are geographically separated from other devices or intermediate elements at the same level in the hierarchy using the same set of encoding sequences by io regions in which devices or intermediate elements at the same level in the hierarchy are allocated one or more different sets of encoding sequences, the geographical separation being sufficient to prevent co-channel interference between devices or intermediate elements at the same hierarchical level.
16. A network according to Claim 11, Claim 12, Claim 13, Claim 14 or Claim 15 having means for generating signals carrying instructions to a plurality of actuator devices simultaneously using a single
15 message encoded according to each of the sequences specific to those actuator devices.
Intellectual
Property
Office
Mr Owen Wheeler
26 September 2017
GB1704219.3A 2017-03-16 2017-03-16 Branched communications network Withdrawn GB2560570A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
GB1704219.3A GB2560570A (en) 2017-03-16 2017-03-16 Branched communications network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GB1704219.3A GB2560570A (en) 2017-03-16 2017-03-16 Branched communications network

Publications (2)

Publication Number Publication Date
GB201704219D0 GB201704219D0 (en) 2017-05-03
GB2560570A true GB2560570A (en) 2018-09-19

Family

ID=58688303

Family Applications (1)

Application Number Title Priority Date Filing Date
GB1704219.3A Withdrawn GB2560570A (en) 2017-03-16 2017-03-16 Branched communications network

Country Status (1)

Country Link
GB (1) GB2560570A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020237234A1 (en) * 2019-05-23 2020-11-26 Texas Instruments Incorporated Selected forwarding between serially chained devices
US11171804B2 (en) 2019-05-23 2021-11-09 Texas Instruments Incorporated Common bus data flow for serially chained devices
US11329844B2 (en) 2019-05-23 2022-05-10 Texas Instruments Incorporated Selected mode signal forwarding between serially chained devices

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6493376B1 (en) * 1997-10-10 2002-12-10 Qualcomm, Inc. Multi-layered PN code spreading in a multi-user communications system
CN103298137A (en) * 2013-06-14 2013-09-11 青海师范大学 Underwater sensor network media access control method based on state

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6493376B1 (en) * 1997-10-10 2002-12-10 Qualcomm, Inc. Multi-layered PN code spreading in a multi-user communications system
CN103298137A (en) * 2013-06-14 2013-09-11 青海师范大学 Underwater sensor network media access control method based on state

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"2014 Sixth International Conference on Computational Intelligence, Communication Systems and Networks (CICSyN). Proceedings", published 2014, IEEE Computer Society, pp 176-181, ElAttar et al, "Enhancing the Performance of Wireless Adhoc Networks Using Spreading Codes" *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020237234A1 (en) * 2019-05-23 2020-11-26 Texas Instruments Incorporated Selected forwarding between serially chained devices
US10904478B2 (en) 2019-05-23 2021-01-26 Texas Instruments Incorporated Selected forwarding between serially chained devices
US11171804B2 (en) 2019-05-23 2021-11-09 Texas Instruments Incorporated Common bus data flow for serially chained devices
US11329844B2 (en) 2019-05-23 2022-05-10 Texas Instruments Incorporated Selected mode signal forwarding between serially chained devices
US11483517B2 (en) 2019-05-23 2022-10-25 Texas Instruments Incorporated Selected forwarding between serially chained devices
US11736313B2 (en) 2019-05-23 2023-08-22 Texas Instruments Incorporated Common bus data flow for serially chained devices

Also Published As

Publication number Publication date
GB201704219D0 (en) 2017-05-03

Similar Documents

Publication Publication Date Title
EP3596857B1 (en) Branched communications network
JP6812508B2 (en) Systems and methods for communication
Fraire et al. Direct-to-satellite IoT-a survey of the state of the art and future research perspectives: Backhauling the IoT through LEO satellites
Sharma et al. Hybrid sensor networks: a small world
WO2018166694A1 (en) Synchronisation in a communications network
US10892843B2 (en) Broadcasting in a communications network
Wang et al. Crf: Coexistent routing and flooding using wifi packets in heterogeneous iot networks
KR20190132815A (en) Method and apparatus for redundant transmission for ultra reliable services in 5g network system
JP2019507532A (en) Method and terminal for side link data transmission
CN104823391A (en) Methods and apparatus for communications using visible light communications signaling in combination with wireless radio signaling
CN101790872A (en) Multihop paging of a peer in a peer-to-peer communication network
US20110116421A1 (en) Rapid on-off-division duplex network communications
GB2560570A (en) Branched communications network
CN113924820B (en) System combination of asynchronous and synchronous radio systems
Chattopadhyay et al. Deploy-as-you-go wireless relay placement: An optimal sequential decision approach using the multi-relay channel model
GB2560569A (en) Synchronisation in a communications network
US11632668B2 (en) Adaptive relay discovery
GB2560568A (en) Broadcasting in a communications network
US9832769B2 (en) Virtual full duplex network communications
Eze et al. Reliable and enhanced cooperative cross‐layer medium access control scheme for vehicular communication
Kim et al. Unlicensed-band single-hop lpwa repeater for smart-city iot applications
US11764887B2 (en) Wireless communication device and notification method
Khan et al. LiFi Luminescence: Illuminating the Future of Wireless
US20240107451A1 (en) Signalling for Activating Usage of Radio Resources
US11122406B2 (en) Bulk RACH machine type communication (MTC) transmissions

Legal Events

Date Code Title Description
WAP Application withdrawn, taken to be withdrawn or refused ** after publication under section 16(1)