US20140355575A1 - Method for transmitting data in a communications network - Google Patents

Method for transmitting data in a communications network Download PDF

Info

Publication number
US20140355575A1
US20140355575A1 US14/365,831 US201214365831A US2014355575A1 US 20140355575 A1 US20140355575 A1 US 20140355575A1 US 201214365831 A US201214365831 A US 201214365831A US 2014355575 A1 US2014355575 A1 US 2014355575A1
Authority
US
United States
Prior art keywords
nodes
node
time slots
data
communications network
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.)
Abandoned
Application number
US14/365,831
Other languages
English (en)
Inventor
Rudolf Sollacher
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.)
Siemens AG
Original Assignee
Siemens AG
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 Siemens AG filed Critical Siemens AG
Assigned to SIEMENS AKTIENGESELLSCHAFT reassignment SIEMENS AKTIENGESELLSCHAFT ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SOLLACHER, RUDOLF
Publication of US20140355575A1 publication Critical patent/US20140355575A1/en
Priority to US15/857,703 priority Critical patent/US10171625B2/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/62—Establishing a time schedule for servicing the requests
    • H04L67/325—
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2801—Broadband local area networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W56/00—Synchronisation arrangements
    • H04W56/001—Synchronization between nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0866—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a dedicated channel for access
    • H04W74/0891—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a dedicated channel for access for synchronized access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W56/00—Synchronisation arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
    • Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
    • Y04S40/00—Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them
    • Y04S40/18—Network protocols supporting networked applications, e.g. including control of end-device applications over a network

Definitions

  • the invention relates to a method for transmitting data in a communications network comprising a plurality of nodes and to a corresponding communications network.
  • communications networks comprising a plurality of nodes such as, e.g., in wireless sensor networks
  • the need often exists that the data acquired by the individual nodes are reliably conveyed to neighboring nodes within communication range of the respective node. Since each node only knows some of the nodes of the network, conflicts may arise in this context resulting in two nodes which are not within communication range with respect to one another transmitting data at the same time to the same node, which leads to collisions and to the loss of these data.
  • a central entity in the form of a gateway or a central controller is frequently used in which the data from all nodes are collected.
  • the data transmission collapses when the central entity fails and, furthermore, the communication load of the individual nodes towards the central entity increases so that nodes within the spatial or topological vicinity of the central entity impair the life and the performance of the network.
  • one or more successive intervals are specified on the basis of a time synchronized for all nodes of the communications network, which intervals in each case comprise a group of first time slots and a group of second time slots, wherein the first time slots can be utilized for data transmission by every node and the second time slots can be reserved by respective nodes in order to be utilized for data transmission by the respective node.
  • a respective node in the communications network determines whether and/or which neighboring nodes within its communication range have reserved second time slots. From this information, the respective node generates coordination data (e.g. coordination packets) according to which a second time slot is reserved by the respective node which is not reserved by neighboring nodes. Furthermore, the coordination data contain the information as to whether and/or which second time slots are reserved several times by neighboring nodes. This multiple occupancy can occur when, although two neighboring nodes are within communication range from the node currently considered, they are not within communication range with one another.
  • coordination data e.g. coordination packets
  • a respective node sends the coordination data generated by it to its neighboring nodes within a first time slot, wherein the respective neighboring nodes which have reserved the same second time slot according to the coordination data reserve a new second time slot, no reservation of which by another node is known thereto. Subsequently, data are sent out by the respective nodes which have reserved the corresponding second time slots within the second time slots.
  • the method according to the invention provides for a decentralized time slot allocation without collisions in a simple manner by means of self organization of the nodes, so that data can be transmitted reliably between a node and its neighboring node.
  • the method can be used in arbitrary communications networks and especially in wireless communications networks.
  • the method is used preferably in wireless sensor networks in which at least some of the nodes comprise sensors which communicate wirelessly with one another in order to exchange, e.g., sensed measurement values by this means.
  • the method according to the invention can be used in arbitrary technical fields of application.
  • the method can be used in a communications network for an automation plant, e.g. for production automation or process automation, and/or for a power system and/or for a traffic network. In such fields of application, it is often necessary to exchange data between the nodes via a decentralized organization of the network.
  • the nodes perform a decentralized time synchronization for determining the synchronized time, on the basis of which the time slots are specified.
  • methods, known per se, for decentralized time synchronization can be used, such as, e.g., the method described in German patent application 10 2010 042 256.8. The entire content of disclosure of this application is incorporated in the content of the present application by means of reference.
  • a second time slot is reserved for a broadcast transmission by a respective node in accordance with the coordination data generated by the respective node.
  • the data transmission between a node and a neighboring node should be symmetric, i.e. if a node sends data to a neighboring node, these neighboring nodes should also send data back to the node. If this is not the case, the corresponding data should not be processed further.
  • a second time slot is reserved for a predetermined link between a respective node and a predetermined neighboring node according to the coordination data generated by the respective node, both first data being transmitted by the respective node to the predetermined neighboring node and second data by the predetermined neighboring node to the respective node within this second time slot, wherein, in the case where the transmission of the first and/or second data is not successful, the first and second data are discarded.
  • At least one parameter value is determined in the respective nodes which is specific for the respective node.
  • One such parameter value can be, e.g., a measurement value or be based on a measurement value which is detected by the node or a sensor in the node, respectively.
  • these parameter values or, respectively, data based on these parameter values can be transmitted.
  • parameter values updated in each new interval are determined and transmitted.
  • the data transmitted in the second time slots are determined and processed on the basis of a protocol in such a manner that the mean value of the parameter values of all nodes is estimated in each node.
  • a protocol in such a manner that the mean value of the parameter values of all nodes is estimated in each node.
  • Such protocols are sufficiently well known from the prior art and provide for an estimation of the mean value in each node without the parameter values of all other nodes having to be known in the respective nodes. Instead, it is sufficient that the respective node can exchange data directly only with some of the nodes of the network.
  • a consensus protocol known per se, or possibly also a tree aggregation protocol which is also previously known is used as protocol for averaging the parameter values.
  • the data transmission method according to the invention is utilized for the purpose that, based in a decentralized manner on status values which are in each case present locally in a node and are preferably acquired in the respective nodes, a pattern represented by all status values of the nodes is recognized from a plurality of patterns in each node on the basis of the mean value of the parameter values which is made known by means of a suitable protocol.
  • This decentralized pattern recognition is preferably implemented in such a manner that, in each node, the multiplicity of patterns is deposited with in each case a probability which specifies how probable a status variable present locally in the respective node is in dependence on the respective pattern.
  • the logarithms of the probabilities are determined as parameter values in the respective node for the status variable present locally in the respective node with the presence of the respective patterns.
  • the probability with which each pattern is represented by the status variables present locally in all nodes is determined in each node via the mean value of the logarithms for a respective pattern. The pattern having the highest probability then represents the detected pattern.
  • the invention also relates to a communications network comprising a plurality of nodes which are designed in such a manner that the method according to the invention or, respectively, one or more variants of the method according to the invention can be carried out in the operation of the communications network.
  • FIG. 1 shows a diagrammatic representation of a communications network in the form of a wireless sensor network in which an embodiment of the method according to the invention is carried out;
  • FIG. 2 shows the representation of an interval of first and second time slots in which data are transmitted on the basis of a variant of the method according to the invention
  • FIG. 3 shows a diagram which illustrates the accuracy of a mean-value estimation based on one embodiment of the invention.
  • FIG. 1 showing by way of example such a sensor network.
  • the sensor network comprises seven sensor nodes S 1 , S 2 , . . . , S 7 , which can exchange data with one another via a suitable wireless protocol.
  • a respective sensor node only knows particular number of neighboring nodes in its environment due to the limited communication range of the wireless transmission.
  • the node S 1 only knows, e.g., nodes S 2 and S 3 and not the remaining nodes.
  • certain other nodes may know particular nodes in their neighborhood but not the node S 1 .
  • the wireless sensor network operates in a completely decentralized manner, i.e. there is no central entity to which corresponding data which are detected by the individual sensor nodes can be transmitted.
  • the aim of the embodiment, described here, of the method according to the invention is then to detect in each individual node a pattern of a system status of the entire network, although a respective node only knows some of its neighboring nodes.
  • a consensus protocol is used which is described below. In this context, however, it must be ensured that each individual sensor node transmits its data reliably to its neighboring nodes.
  • each sensor node detects at regular time intervals a measurement value, e.g. a temperature value or a brightness value, these measurement values being designated by z 1 , z 2 , . . . , z 6 for the individual sensor nodes.
  • the measurement value represents a brightness value which can be divided into the “bright” class or into the “dark” class.
  • a pattern in the form of the corresponding states “bright” or “dark” of the individual sensors is represented by all sensor measurement values. This pattern represents the abovementioned system status which is designated in FIG. 1 by m for illustration. In this context, a multiplicity of patterns exists for each possible combination of bright or dark values of the individual sensors.
  • a value p 1 , p 2 , . . . , p 7 is deposited in the respective nodes which, in dependence on the respective pattern m, specifies the probability with which a corresponding brightness value z 1 , z 2 , . . . , z 6 is measured in the respective sensor nodes S 1 , S 2 , . . . , S 6 .
  • estimations are calculated for the probability of a pattern m in dependence on the measured brightness values of all nodes via a consensus protocol.
  • the pattern having the highest probability value then represents the pattern detected in a decentralized manner.
  • FIG. 2 shows a time interval I which is passed successively as part of the method according to the invention, updated data of the respective nodes being sent out in each time interval.
  • the time interval comprises first time slots t 1 which are the first five slots from 0 to 4 in FIG. 2 .
  • the interval I comprises second time slots t 2 which are the slots 5 to 24 in FIG. 2 .
  • the time slots have a length of 20 ms in each case.
  • the data transmission takes place at the physical layer based on the IEEE 802.15.4 Standard known per se.
  • the times of the individual sensor nodes are synchronized, wherein a method known in the prior art can be used for synchronization, such as, e.g., the method described in German patent application 10 2010 042 256.8.
  • a protocol is used by means of which the estimated global network time is exchanged in packet headers. The protocol reduces the adaptation rate of the sensor nodes which are already synchronized with their neighbors, as a result of which the effects of errors of sensor nodes newly added are reduced. Furthermore drifts in the clocks of the sensors are compensated for.
  • the synchronization error for the protocol used lies within a range of about 30 ⁇ s and is significantly smaller than the length of one time slot in the intervals I.
  • the starting times and the sequence numbers for the time slots are established on the basis of the synchronized time.
  • the individual sensor nodes transmit special coordination data in the form of coordination packets within the first five time slots t 1 of the interval I. With these packets, the nodes load a second time slot not reserved by other nodes and, in doing so, at the same time transmit a list of the second time slots which are occupied by more than one neighboring node in their environment.
  • Such multiple occupancies can occur when a sensor node is added to the sensor network which sees two neighboring nodes in its environment which are not within range of one another.
  • the corresponding neighboring nodes can select time slots which are not reserved by direct neighbors and for which no allocation conflict is known in the case of multiple occupancies.
  • the individual sensor nodes switch to an energy saving mode in all time slots apart from the first five time slots of the interval I and the time slots in which they send out, or receive from their neighbors, data by broadcast.
  • each sensor node which sends data to a neighboring node also receives data from this neighboring node. That is to say the links between the sensor nodes should be symmetric.
  • the data are therefore not transmitted by a broadcast between the sensor nodes, but a unicast is used with a three-way communication.
  • a sensor node sends in a corresponding second time slot an enquiry to a predetermined neighboring node in which, apart from a specification of the interval I, it reports its estimated value determined as part of the consensus protocol.
  • the neighboring node receives this enquiry, it responds analogously with the estimated value determined thereby.
  • the link is symmetric. If the neighboring node does not receive the enquiry, it will also not send a return response so that the link remains symmetric. If the neighboring node receives the enquiry but its response is lost, the neighboring node will also not receive a confirmation from the original node with the consequence that it discards the enquiry of the original node. It is only when the confirmation is not received by the neighboring node as part of the three-way communication that the link can be asymmetric, since in this case only the neighboring node discards the data transmitted thereto. The corresponding node repeats the procedure just described in the current time slot with all its neighboring nodes apart from those which have already previously completed the three-way communication successfully in the current interval I.
  • each sensor node n which corresponds to one of the nodes S 1 to S 7 in FIG. 1 , measures a value ⁇ circumflex over (z) ⁇ n which corresponds to the corresponding parameters z 1 , z 2 etc. of FIG. 1 .
  • the binary value 1 is assigned to each measurement value with a probability of ⁇ ( ⁇ circumflex over (z) ⁇ n
  • the binary value 1 then corresponds, e.g., to the status of “bright” and the binary value 0, e.g., to the status of “dark”.
  • this probability function can be given for the sensor node n by the logistic function ⁇ ( ⁇ circumflex over (z) ⁇ n
  • w) 1/(1+exp( ⁇ ( ⁇ circumflex over (z) ⁇ n ⁇ w 1 )/w 2 )).
  • N designates the total number of all sensors in the network.
  • p m′ corresponds to an a priori probability distribution, which may be present, for the pattern m′. Without prior knowledge, this probability is set to 1/M, as a rule, M representing the total number of possible patterns.
  • each sensor node knows a number of neighboring nodes K in the network and furthermore the possible patterns in each node are known, each sensor node can determine the probability for each pattern without the sensed measurement values ⁇ circumflex over (z) ⁇ i having to be distributed in the entire network or a central calculation having to be carried out. As a result, the pattern which has the highest probability is finally detected in each node.
  • a typical consensus protocol known from the prior art for data transmission and local mean-value estimation of the logarithms is used.
  • a local estimation of the mean value is initialized in each node with a local calculation based on the measured sensor value, i.e. with the logarithm of the probabilities p i ( ⁇ circumflex over (z) ⁇ i
  • the local estimations are exchanged iteratively with the neighboring nodes until a convergence criterion is reached.
  • the algorithmic implementation used for this purpose is based on the following equation:
  • x i (t) designates the estimation of the mean value of the sensor node i.
  • the couplings ⁇ ik (t) can be time-dependent weights for each existing link to a neighbor.
  • a suitable specification of the couplings is described in printed document [2]. If necessary, other concensus protocols can also be used for forming the mean value, e.g. the protocol described in printed document [3].
  • a tree aggregation protocol can also be used for the decentralized determination of the mean values, if necessary.
  • a node in the network acts as root node in which the data of all other nodes, which lastly arrive in aggregated form, are summed and then the mean value is formed.
  • a tree structure having the root node as root and corresponding parent and child nodes is specified by means of methods known per se. All other nodes apart from the root node collect the aggregated measurement value sums and measurement value quantities as part of the tree aggregation protocol from their child nodes, add these measurement value sums and their measurement value or the measurement value quantities and one and forward the new values to their respective parent nodes.
  • the mean value of the measurement values which subsequently can be distributed again in the reverse direction to the nodes in the tree is then obtained in the root node.
  • the data transmission then takes place analogously to the above consensus method based on the TDMA time slots t 2 which are allocated suitably within the CSMA time slots by the nodes.
  • configuration data particularly the plurality of the patterns m described above, must be distributed initially to all nodes in the network. This is achieved by means of a dissemination protocol, known per se, in a preferred embodiment of the invention.
  • the method according to the invention has been tested on the basis of a network of four sensor nodes.
  • data were considered from 129 pattern detections.
  • the correct probabilities were determined for three predetermined patterns on the basis of the above equation (1). These probabilities were compared with probabilities which had been estimated with an implementation of the method according to the invention for the four sensor nodes.
  • FIG. 3 the error statistics for these probabilities are shown.
  • the corresponding number NT of the intervals I already passed is reproduced along the abscissa.
  • the difference ⁇ p between the probability estimated according to the invention and the actual probability is represented with corresponding standard deviation along the ordinate. It can be seen that the protocol used converges very rapidly to a very low mean error (approximately ⁇ 7.3 ⁇ 10 ⁇ 6 ) after passing through a few intervals I. The standard deviation converges at 7.3 ⁇ 10 ⁇ 3 .
  • the embodiment of the invention described in the preceding text has a number of advantages.
  • the decentralized allocation of time slots enables the corresponding communications network itself to organize the media access without using a central entity.
  • a decentralized determination of mean values is achieved, wherein a node only needs to know the nodes within its vicinity for this purpose.
  • a pattern recognition can be carried out during this process.
  • the communication effort is distributed relatively uniformly to all network nodes. When using battery-operated sensor nodes, the demands on energy storage in the individual nodes are thus lowered.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Mobile Radio Communication Systems (AREA)
US14/365,831 2011-12-16 2012-12-03 Method for transmitting data in a communications network Abandoned US20140355575A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US15/857,703 US10171625B2 (en) 2011-12-16 2017-12-29 Communications network and method for transmitting data in a communications network

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE102011088884A DE102011088884A1 (de) 2011-12-16 2011-12-16 Verfahren zur Übertragung von Daten in einem Kommunikationsnetz
DE102011088884.5 2011-12-16
PCT/EP2012/074193 WO2013087432A1 (de) 2011-12-16 2012-12-03 Verfahren zur übertragung von daten in einem kommunikationsnetz

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2012/074193 A-371-Of-International WO2013087432A1 (de) 2011-12-16 2012-12-03 Verfahren zur übertragung von daten in einem kommunikationsnetz

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15/857,703 Continuation US10171625B2 (en) 2011-12-16 2017-12-29 Communications network and method for transmitting data in a communications network

Publications (1)

Publication Number Publication Date
US20140355575A1 true US20140355575A1 (en) 2014-12-04

Family

ID=47469882

Family Applications (2)

Application Number Title Priority Date Filing Date
US14/365,831 Abandoned US20140355575A1 (en) 2011-12-16 2012-12-03 Method for transmitting data in a communications network
US15/857,703 Expired - Fee Related US10171625B2 (en) 2011-12-16 2017-12-29 Communications network and method for transmitting data in a communications network

Family Applications After (1)

Application Number Title Priority Date Filing Date
US15/857,703 Expired - Fee Related US10171625B2 (en) 2011-12-16 2017-12-29 Communications network and method for transmitting data in a communications network

Country Status (7)

Country Link
US (2) US20140355575A1 (de)
EP (1) EP2774445A1 (de)
AU (1) AU2012350881B2 (de)
CA (1) CA2859291A1 (de)
DE (1) DE102011088884A1 (de)
RU (1) RU2609137C2 (de)
WO (1) WO2013087432A1 (de)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104519554A (zh) * 2014-12-12 2015-04-15 重庆邮电大学 一种支持多频段6LoWSN并行接入Internet的方法
JP2018121189A (ja) * 2017-01-25 2018-08-02 株式会社ダイヘン 通信機能を備えた装置、当該装置を備えたシステム、および、台数探索方法

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106131912B (zh) * 2016-06-17 2019-05-24 河海大学常州校区 基于树状簇的无线传感器网络的移动Sink数据收集方法
CN107391320B (zh) * 2017-03-10 2020-07-10 创新先进技术有限公司 一种共识方法及装置
US10992757B2 (en) * 2019-06-20 2021-04-27 Bank Of America Corporation Edge-computing-based forensic feedback architecture

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020091846A1 (en) * 2000-10-30 2002-07-11 The Regents Of The University Of California Tree-based ordered multicasting method
US20050007987A1 (en) * 2003-07-10 2005-01-13 Matsushita Electric Industrial Co., Ltd. Wireless communication system and communication method
US20070036089A1 (en) * 2005-08-09 2007-02-15 Metke Anthony R Method and system for data transmission in a wireless network
US20080123619A1 (en) * 2006-11-23 2008-05-29 Institute For Information Industry Apparatus, method, and computer readable medium thereof for dividing a beacon interval
US20090103501A1 (en) * 2007-10-22 2009-04-23 Farrag Osama I Decentralized Media Access Control for Ad-Hoc Mobile Wireless Network
US20090135833A1 (en) * 2007-11-26 2009-05-28 Won-Kyoung Lee Ingress node and egress node with improved packet transfer rate on multi-protocol label switching (MPLS) network, and method of improving packet transfer rate in MPLS network system
US7656801B1 (en) * 2006-05-26 2010-02-02 Raytheon Company Selective jamming of network traffic in contention-based networks

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB0004919D0 (en) * 2000-03-02 2000-04-19 Koninkl Philips Electronics Nv Ad-hoc radio communication system
MXPA04001267A (es) 2001-08-25 2004-05-27 Nokia Corp Sistema y metodo para programacion de transmision libre de colision utilizando informacion cercana y tiempos de transmision anunciados.
US7457299B2 (en) * 2003-06-25 2008-11-25 General Dynamics C4 Systems, Inc. Definable radio and method of operating a wireless network of same
CN1843050B (zh) * 2003-06-27 2011-02-09 诺基亚有限公司 无线通信网络中资源预留的方法和系统
US7701915B2 (en) 2003-06-27 2010-04-20 Nokia Corporation Method in a communication system, a communication system and a communication device
US20050243765A1 (en) * 2003-07-25 2005-11-03 Schrader Mark E Mesh network and piconet work system and method
DE10344345B3 (de) 2003-09-24 2005-05-12 Siemens Ag Verfahren zur Kommunikation in einem Adhoc-Funkkommunikationssystem
JP4151973B2 (ja) * 2004-09-24 2008-09-17 株式会社東芝 アドホック無線通信システムにおけるチャネル設定方法
EP2082515A2 (de) * 2006-11-14 2009-07-29 Nokia Corporation Verfahren und vorrichtung zur bereitstellung eines fehlerkontrollschemas in einem mehrsprung-relaisnetz
US20110116421A1 (en) * 2009-09-25 2011-05-19 Dongning Guo Rapid on-off-division duplex network communications
DE102010042256B4 (de) 2010-10-11 2013-11-07 Siemens Aktiengesellschaft Verfahren und Vorrichtung zur dezentralen Zeitsynchronisation eines Netzwerkes

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020091846A1 (en) * 2000-10-30 2002-07-11 The Regents Of The University Of California Tree-based ordered multicasting method
US20050007987A1 (en) * 2003-07-10 2005-01-13 Matsushita Electric Industrial Co., Ltd. Wireless communication system and communication method
US20070036089A1 (en) * 2005-08-09 2007-02-15 Metke Anthony R Method and system for data transmission in a wireless network
US7656801B1 (en) * 2006-05-26 2010-02-02 Raytheon Company Selective jamming of network traffic in contention-based networks
US20080123619A1 (en) * 2006-11-23 2008-05-29 Institute For Information Industry Apparatus, method, and computer readable medium thereof for dividing a beacon interval
US20090103501A1 (en) * 2007-10-22 2009-04-23 Farrag Osama I Decentralized Media Access Control for Ad-Hoc Mobile Wireless Network
US20090135833A1 (en) * 2007-11-26 2009-05-28 Won-Kyoung Lee Ingress node and egress node with improved packet transfer rate on multi-protocol label switching (MPLS) network, and method of improving packet transfer rate in MPLS network system

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104519554A (zh) * 2014-12-12 2015-04-15 重庆邮电大学 一种支持多频段6LoWSN并行接入Internet的方法
JP2018121189A (ja) * 2017-01-25 2018-08-02 株式会社ダイヘン 通信機能を備えた装置、当該装置を備えたシステム、および、台数探索方法

Also Published As

Publication number Publication date
RU2014129010A (ru) 2016-02-10
US20180124206A1 (en) 2018-05-03
DE102011088884A1 (de) 2013-06-20
US10171625B2 (en) 2019-01-01
CA2859291A1 (en) 2013-06-20
RU2609137C2 (ru) 2017-01-30
WO2013087432A1 (de) 2013-06-20
AU2012350881A1 (en) 2014-07-03
EP2774445A1 (de) 2014-09-10
AU2012350881B2 (en) 2017-02-02

Similar Documents

Publication Publication Date Title
US10171625B2 (en) Communications network and method for transmitting data in a communications network
KR102351845B1 (ko) 광역 에너지 하비스팅 센서 네트워크 배치를 위한 멀티-홉 네트워킹 프로토콜
Alderisi et al. Simulative assessments of the ieee 802.15. 4e dsme and tsch in realistic process automation scenarios
Kharb et al. A survey on network formation and scheduling algorithms for time slotted channel hopping in industrial networks
CN101682542B (zh) 挂起无线网络中的传输
Faheem et al. CBI4. 0: A cross-layer approach for big data gathering for active monitoring and maintenance in the manufacturing industry 4.0
US20080130660A1 (en) System and method of real-time control and scheduling for zero-queue distributed systems
US20130028103A1 (en) Link reliability metrics in communication networks
US20190182705A1 (en) System and method for managing dsme network fluctuation in industrial wireless sensor network
US20150078291A1 (en) Method for transmitting messages in ad hoc networks
Park Modeling, analysis and design of wireless sensor network protocols
CN102379135A (zh) 用于改善无线网状网络的管理的方法及装置
Hunkeler et al. A case for centrally controlled wireless sensor networks
KR101533037B1 (ko) 무선 센서 네트워크의 스케줄링 장치 및 방법
Queiroz et al. Channel assignment in TSCH-based wireless sensor networks using fuzzy logic
US8493868B2 (en) Traffic load management
US7738405B2 (en) Telecommunications control apparatus and a method for determining a communicating node with electric power interference taken into account
Cheng et al. SDN-Based Routing Mechanism for Industrial Wireless Sensor Networks
EP2592890B1 (de) Verkehrslastverwaltung für Uplink-Netzwerkverkehr
Zhang et al. MobiBone: An energy-efficient and adaptive network protocol to support short rendezvous between static and mobile wireless sensor nodes
Bhandari Situation-Aware Quality of Service Enhancement for Heterogeneous Ultra-Dense Wireless IoT Networks
Pinto et al. Decentralized power aware approach for data fusion in IEEE 802.15. 4 wireless sensor networks
CN103428821A (zh) 一种异步邻居发现方法
Habib Hybrid Duty Cycle Algorithm for Industrial WSNs Using Machine Learning
Siddikov et al. Data Transfer Methods and Algorithms in Wireless Sensor Networks for IoT-based Remote Monitoring System of Hybrid Energy Supply Sources

Legal Events

Date Code Title Description
AS Assignment

Owner name: SIEMENS AKTIENGESELLSCHAFT, GERMANY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SOLLACHER, RUDOLF;REEL/FRAME:033139/0981

Effective date: 20140605

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION