+

WO2016050993A1 - Procédé et système de gestion massive de dispositifs sans fil au moyen d'un protocole auto-organisateur - Google Patents

Procédé et système de gestion massive de dispositifs sans fil au moyen d'un protocole auto-organisateur Download PDF

Info

Publication number
WO2016050993A1
WO2016050993A1 PCT/ES2014/070744 ES2014070744W WO2016050993A1 WO 2016050993 A1 WO2016050993 A1 WO 2016050993A1 ES 2014070744 W ES2014070744 W ES 2014070744W WO 2016050993 A1 WO2016050993 A1 WO 2016050993A1
Authority
WO
WIPO (PCT)
Prior art keywords
router
network
message
controller
actor
Prior art date
Application number
PCT/ES2014/070744
Other languages
English (en)
Spanish (es)
Inventor
Juan Ignacio Alonso Montull
Original Assignee
Casiopea Esm2M, S.L.
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 Casiopea Esm2M, S.L. filed Critical Casiopea Esm2M, S.L.
Priority to PCT/ES2014/070744 priority Critical patent/WO2016050993A1/fr
Publication of WO2016050993A1 publication Critical patent/WO2016050993A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • 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

Definitions

  • the objective of the present invention is a communications protocol that allows the sending of messages and through them the management of a network formed by multiple wireless devices, each of which has one or several specific functions, all of which are capable of sending and receive messages on the same frequency.
  • the invention focuses on the detail of the protocol both at the link level, and at the network level, within the OSI model of open systems interconnection, including a method for managing the network through a self-organizing interconnection system .
  • This protocol is a method of mass management of wireless devices that have a limited capacity for calculation, memory and some of which will work with batteries, so the protocol is simple and does not require large amounts of memory or processing time. Few messages are transmitted, in order to share the radio medium through all the devices in the network. According to this system, it does not require total connectivity between all devices, it is enough to guarantee bidirectional communication between a controller and any other device: it is also not necessary that the conditions of radio coverage between the different wireless units be constant over time, due to environmental factors since these units can change location and route selection procedure.
  • Z-Wave is a wireless communications protocol also designed to remotely control applications in residential commercial environments. This technology uses a low power RF radio embedded or adapted in electronic devices and systems, such as lighting, access start control, entertainment systems and appliances.
  • WO 03061 175 by Robert Bosc GmBh describes a network of hierarchical and self-organized wireless sensors and actuators, for surveillance and control tasks, and a method for their management. After installation, the network can be configured by itself and in case of nodes failures or links are reconfigured to ensure connectivity.
  • the network consists of different types of elements: nodes powered by batteries (low consumption), nodes powered by the electricity network and main nodes, called “cluster head network". In case of failure of links or sensor / actuator nodes, the network can be reconfigured using the topological information collected in the cluster head network, assessing alternative routes based on the number of hops, link signal quality or loss rate of packages.
  • US 2009085769 describes a method for propagating and adding data in a wireless sensor network with a tree topology that allows reducing network traffic by facilitating the interconnection of the end sensors with intermediate mobile routers, constituting different regions “clusters", and these with a main “cluster head” to access the Internet (WAN).
  • WAN Internet
  • US 2009059842 Details a system and method that facilitates the establishment of a randomly distributed network of sensor nodes and optimizes both the bandwidth used and the energy consumption.
  • the network is structured in different clusters that integrate the sensor nodes and nodes "clusters" that act as routers to a main node called “network sink”.
  • the registration of the different elements to configure the network map is dynamic and the direct communication links between nodes "clusters" (routers) and the node "network sink” to reach a minimum number of hops between them and achieve an optimization of functioning.
  • Document ES 2332684 corresponds to a communications method for a sensor network, composed of a central node that controls wireless communications with sensor nodes, the central node being located within the coverage area of at least one sensor node
  • a sensor node detects an alarm situation, it sends an alarm message to the central node, through a route previously established in an initial network mapping, through which the central node obtains a network graph that defines the structure of the network.
  • the sensor network includes identifying the level 1 sensor nodes (level n sensor node needs n transmissions for a message sent by said sensor node to reach the central node, assign a communication path to level 1 nodes and identify and assign the route of the sensor nodes of level higher than 1.
  • the network topology includes a central node in charge of controlling communications and receiving the information collected by the different additional nodes, nodes with direct communication with the central node that do not require the use of routers and nodes without direct communication with the central node that will require one or more router nodes to create the communication path.
  • the proposed solution can be used without meeting any of the standards, only the radio access to the medium is necessary (it is not necessary for the device to have a MAC layer for access control to the medium), but it can also be implemented under any of these standards, without more than including the corresponding libraries in the different controller models.
  • the management of the devices is solved by assigning "neighborhood" criteria, based on non-linear network parameters, so the number of units that can coexist is not limited more than by the radio space occupation criteria that They vary in each application, as well as the physical memory occupancy of the devices.
  • the base protocol of the management system developed here is implemented on an ultra-low consumption chip, with access to the radio medium and without the need for an integrated MAC layer, so it does not introduce an increase in consumption, nor the need for intensive computing , nor a significant increase in the code size of the programs, so it is compatible with the static and dynamic memory limitations typical of these chips (typically microcontrollers with significant resource constraints).
  • Another differential aspect of this system is that the network operates on a single channel, all devices sharing the same frequency.
  • This system of massive management of wireless devices provides several types of network units, each with one or several specific functions, but which are grouped into these 3 types within the network structure: a) A series of final actors, whose specific function is of the sensor or actuator type on a certain device, so they are not necessarily active at all times, but can adopt low-power modes and therefore be powered by batteries; each of which must be associated with a router to be connected to the network and, therefore, be connected to the network controller, for which purpose its routing protocol (routing) foresees the search for a default router and keep track of the state of the point-to-point link with this router, for which it requires storing the information related to the address of your default router.
  • routing protocol routing protocol
  • Point-to-point link address that you must set to reroute any packet to another cluster that passes through it on its way to an end device.
  • a controller that acts as a gateway or main control node, capable of storing and processing all the information related to the association of each device of the network with the cluster or subnet to which it belongs and on the next jump to any of the other subnets within the network; for which purpose, each message it receives stores the information to make a double association of the final device with the corresponding cluster and of this with the next hop, which allows the network to be dynamic since it can send a message to any final device even if it changes position or associated cluster.
  • This controller to fulfill this function, has a memory in which it stores the following information:
  • the network is organized in various subnets, called clusters, in which each one has a coverage area of a router, so that any device located in said cluster can send a message to the controller through said router, to effects of which each router originates a different cluster to which they are associated actors, either final actors, or other routers that will lead to a new cluster dependent on the first.
  • a management method is established that includes a phase of network configuration in which, dynamically, the devices establish their access path to the controller, which is developed in the following steps: a) The controller, periodically, or when required by a router request message sent by one of the client units, sends a message to all the devices that listen to it, informing them that it is a router with zero cost (or what is the same a direct link to the same controller); the actors who receive this notice and want to associate as a router send a message to the controller in a point-to-point connection and if they succeed from that moment the actor uses direct communications with the controller for all their communications; Once an actor acting as a router has partnered with the controller, or with another router, it sends the same message that it started by sending the controller but increasing the cost by one unit greater than the cost of the router with which it has just been associated, so that other actors can associate successfully with him, knowing his weight or level of proximity to the controller; these messages spread throughout the entire network, until each router has found its path to the controller.
  • each actor requests the association with a router, sending a router request message, which causes all routers that have received it to be advertised as routers to the controller using as cost the last with which they were announced; All the actors send this association message when the connection with their default router has failed a certain number of times in order to find a new router to associate with;
  • an actor seeking association receives messages from several routers, he tries to associate with the one with the lowest cost, and if there are several he will choose one at random, or by measuring the strength of the received signal, or depending on the number of clients of a particular router, which allows balancing the number of devices that are routed by the wireless network.
  • each actor After successfully associating with a router, each actor sends a message to the controller, whose purpose is for intermediate routers to learn the route to that actor, or the route to the last router on the way to the actor, since the Actors are grouped into clusters.
  • the new actor issues a router request message to the network components (broadcast), making a router request to its coverage environment.
  • the various routers that receive this request reply with a message that denotes the presence of a router element, attaching the various parameters of said router, such as the number of routers that exist in the path from the announced router to the controller, sending this message also to all network components.
  • the new actor processes the announcement messages sent by various routers, choosing from all of them the router that offers the best features, depending on quantifiable network parameters.
  • the most suitable router Once the most suitable router has been chosen, it notifies the network of the connection of the new actor to the corresponding cluster of the chosen router, for which it sends a message, whose intention is to notify the network of its connection, so that the network learns to route the messages that are addressed to him, sending said point-to-point message to the chosen router, with the controller final destination, leaving the actor waiting to receive the confirmation of receipt.
  • the message sent by said actor bequeaths a router, which relays it to its upper router, successively until the message reaches the controller;
  • each router that receives the message updates the information contained in its routing tables, noting the address of the new actor and the router to which it should send the messages addressed to that actor.
  • the reception of the message at the network level to the new actor serves to ensure that the message has been received by all the routers involved, so that the network knows how to route the messages addressed to it.
  • Each actor unit implements a scoring method for shipments sent and a penalty for failed shipments, both at the network level and at the link level, which determines the quality of the link of each unit with its default router and the time to search A new router due to the malfunction of the connection or changes in the network topology, being the scoring function depends on:
  • the router with which it is associated is given greater confidence, since the density of devices that can act as routers is the peripheral area of the network is lower .
  • This network can also be configured according to a synchronous communication system, for which time is divided into fixed intervals in each of which the network controller sends a synchronization message to all devices.
  • Router-type actors wake up, for example, a second before the synchronization message is issued and they are waiting to receive it, to receive it by retransmitting it with the same slot and period parameters, listening to the actors' messages At the end of your cluster and after a while, send in a grouped message the information that you have collected from your sensors to the controller.
  • the final devices work also wake up a second before the synchronization message is generated, waiting to receive this message from your router and once received, they send certain information for the router to group.
  • This system allows when a unit loses synchronization, the synchronization message is recovered by itself, or when a new device is registered in the network, remember that the network is dynamic in the broadest sense of the term, being able to incorporate and unsubscribe units continuously, start your synchronization with spontaneously, whether it is an end device or a router type unit. For this, the unit in question is on while waiting to receive the next synchronization message, which will occur after the synchronization period, and goes back to sleep until a second before the next synchronization message.
  • the proposed network is a self-organized network in 3 senses:
  • the network manages connectivity losses and message re-routing locally.
  • Each node has in its memory the routing tables with the elements that configure its cluster and a known path is chosen if it is available or a new one is sought in case the addresses stored in memory do not work (this is the case in which a unit is relocated on the network and you have to rebuild the routes to the units with which you have direct communication).
  • Each of the units that make up the network has a neighborhood model, composed of those units with which you can exchange messages.
  • This set of units is what we call "clusters" and there is no hierarchy within the cluster.
  • the hierarchy arises from the units that are in a better position to relay messages, that is, as a general rule, those that have a better signal and those that have less energy problems.
  • the network configures itself by loading the retransmission tasks to those most suitable units and, which can always be the same within a cluster. This is done locally without the need for communication with the network control node or central node.
  • the network control messages reach the central node where the network topology is updated based on the precedence of message retransmissions and not based on hierarchy or proximity criteria. However, the units closest to the central node are more likely to relay messages, since they are physically in better coverage with the central network unit.
  • the proposed network may have synchronous or asynchronous behavior, depending on the timing of the control messages.
  • This network presents the utility of "autodiscovery” that is, when a node is added to the network, a protocol for selecting the neighborhood or cluster model is initiated.
  • autodiscovery When the corresponding message arrives at the central unit, then the device is registered and appears in the list of active network elements, which can be represented in a software application to use or simply appears in the list of "hooked" elements in the central or control node database.
  • the network allows monitoring the way in which the units communicate with the central node and with it, observe the hierarchies that the network establishes autonomously and without interaction with the central node.
  • firmware layer is integrated that is responsible for performing the abstraction of the software layer depending on the design of the communications module or network node.
  • a node can have a defined neighborhood model for a given function and can have another for a completely different function. For example, a node can necessarily retransmit any message that arrives on one stage and only transmit temperature data every "x" minutes from another scenario.
  • the feature described above allows to define quality of service in the communication of messages on the network and to define scenarios where the retransmission of critical messages is made based on the minimization of transmission times (for example alarms) and in another scenario messages are transmitted with other criteria, for example the minimum energy.
  • the same network could operate in different scenarios with different control nodes, forming two logically independent networks but sharing the resources of the sensor network they form.
  • Each node is organized independently to communicate with the central node.
  • the number of clusters can be as high as the number of units that make up the network. Overlap between clusters determines the number of retransmissions required. Therefore, the network is intended to be deployed in bulk even though not all units have a defined function. This allows deployments regardless of the radio propagation characteristics of the medium.
  • Figure 1 shows a schematic view of the functional block diagram and the structure of such a network.
  • Figure 2 schematically shows the exchange of messages that occurs when a new actor is linked to the network.
  • Figures 3 and 4 respectively represent the operation of a router unit and other final actor, in a synchronized network.
  • Figure 5 represents the resynchronization process of one of the network units.
  • the implemented network consists of various elements, of various types and each with one or several specific functions:
  • Router those actors that have the function of routing the various messages of the wireless network will be grouped under this group. To meet faithfully this function, it is advisable that the devices do not enter into low consumption states; So in most cases, routers are units powered by the mains. Independently, these devices may also fulfill their function of sensor or actuator, as appropriate. We can therefore consider that a router is one more final actor, with added functionalities. In principle, all the elements that constitute the network can act as routers, transparently to the logical and physical topology of the network; in this way the choice of which unit can be used as a router complies with practical criteria, such as available power, cycle time, etc.
  • Controller it is the device that acts as a radio frequency gateway, being able to store and process all the information related to the association of each device of the network with the cluster or subnet to which it belongs and about the next jump to any of the other subnets within the network.
  • Each message that it receives stores the information to make a double association: final device with the corresponding cluster and of this one with the following jump, which allows the network to be dynamic since it can send a message to any final device even if it changes position or associated cluster;
  • the network is organized in various subnets that from now on we will call clusters.
  • clusters we can define a cluster as the area covered by a particular router, so that any device located in said cluster can send a message to the controller through said router.
  • each router originates a different cluster to which actors, either final actors, or other routers that will lead to a new cluster dependent on the first one can be associated.
  • the origin of the reference is not found, you can see a representation of the various clusters that can compose a network.
  • Special case is that of the controller itself, which also satisfies the router (router) functions, giving rise to the main cluster of the network from which the other clusters are generated.
  • the method used to manage the network provides, periodically and when required with the corresponding router request message, the sending of an announcement by the controller to the broadcast address (to all devices that listen to it) of the link level with which it informs that it is a router with zero cost to the controller.
  • the actors that receive this notice and want to associate with a router send a message to the controller in a point-to-point connection, using the link level protocol, and if it is successful from that moment the actor will use direct communications with the controller to All your communications.
  • a router-like actor Once a router-like actor has partnered with the controller or another router, it will send the same special message that it started by sending the controller but increasing the cost in a unit greater than the cost of the router with which it has just been associated. In this way other actors will be able to successfully associate with him.
  • the actors upon starting and periodically, request their association with a router, for this they send a router request message.
  • This message causes all routers that have received it to be advertised as routers to the controller using the last cost with which they were announced. All actors will also send this association message when connecting to their router by defect has failed more than a certain number of times. In this way they can associate with a new router when they have lost connectivity with their previous router.
  • an actor seeking association receives messages from several routers, try to associate with the one with the lowest cost, and if there are several, choose one at random. There is the possibility of making such a choice by measuring the power of the received signal, being necessary to use an analog-digital converter. In this way, the topology resulting from the self-organization of the network adapts to the signal propagation characteristics, which can be very different depending on the different possible modulations and transmission systems.
  • each actor After successfully associating with a router, each actor sends a "helium" message to the controller, whose purpose is for intermediate routers to learn the route to that actor. Actually what they will learn is the route to the last router on the way to the actor, since the actors are grouped into clusters.
  • the routing protocol implemented which develops the network level of the OSI model, allows messages to be routed between points other than the network.
  • the routing protocol has been designed taking into account the limitations of processing and storage capacity of wireless units. For this reason, the information that each of the routers of the wireless network must store and the searches that they have to do in their internal information structures to re-route a packet has been minimized.
  • Non-router end devices do not require more function than finding a default router and keeping track of the point-to-point link status with this default router, as will be explained later. Thus, the only information that a device of this style should store is the default router address.
  • Devices on the wireless network that behave as a router will need to know your default router, just as non-routers end devices do, and keep track of the point-to-point link status with this router by default. In addition, they must be able to route the messages both towards the controller and towards any of the clusters to which the communication should route.
  • a router needs to store the following information:
  • Point-to-point link address that you must establish to reroute any packet to another cluster. Any router does not know the complete state of the network, it is only necessary to know the next jump (point-to-point link address) to the clusters that pass through it on its route to an end device.
  • each router Upon receiving a router request to a specific controller, each router will respond with a message that includes the cost of the router (number of hops the message will give until it reaches the controller if that router is chosen as the default router) and the number of devices hanging at that time from the router. In this way, in case of receiving two or more router responses with the same cost, the number of clients will be the way to decide which router to associate with. This mechanism will allow us to balance the number of devices served by the routers of the wireless network and maintain a state of equilibrium (at the level of connections) against network reorganizations.
  • the wireless system associated with the controller acts only as an RF gateway of another more powerful embedded device that will store and process all the information. Together they form the entity that in this document we have called controller (or gateway).
  • controller or gateway
  • the information that this entity must store is related to the association of each device in the network with the cluster to which it belongs and to the next jump to any of the clusters of the network.
  • the cluster function is understood in the routing protocol.
  • any router other than the controller, raises a level of abstraction needing only to know how to reach that cluster, without having to know the units that form that cluster.
  • the controller needs to know how to reach any cluster in the network, while the routers in the network only need to know how to re-route the messages of the clusters whose route includes them.
  • the various parameters of the router that are advertised are attached, such as the number of routers that exist in the path from the announced router to the controller. Since it is a generic message, which may be of interest to other actors, the sending is made to broadcast and not specifically to the actor who requested it. After a while, the new actor processes the messages of announcements sent by diverse routers. From all of them, choose the router that offers the best performance based on the various parameters that we have seen previously or based on specific parameters for each type of system application supported by the device network.
  • the network is notified of the link between the new actor and the corresponding cluster of the chosen router.
  • the new actor sends a "helium message".
  • the intention of said message is to notify the network of its linkage, so that the network learns to route the messages that are addressed to it.
  • said message is sent point-to-point to the chosen router, with the controller final destination. Therefore, the actor is waiting to receive confirmation of reception on the wireless link (link ack).
  • the "helium” message When the "helium” message reaches a router, it relays the message to its upper router and successively until the message reaches the controller. In addition, each router that receives the message updates the information contained in its routing tables, noting the address of the new actor and the router to which it should send the messages addressed to that actor. When the "helium” message reaches the controller, it also updates its routing tables and sends a confirmation message at the network level (net ack) to the new actor. 7. The reception of the "net ack" message serves to ensure that the new actor ensures that his "helium” message has been received by all the routers involved, so that the network knows how to route the messages addressed to it.
  • each actor establishes a point-to-point connection with a router so that their messages end up being received by the controller.
  • the method used to determine the moment at which any actor has to look for a router due to the malfunction of the connection or changes in the network topology is a non-linear function that implements a scoring system that considers the link quality of Each unit with its default router.
  • any actor will attempt a maximum number of times to send a message. To do this, it will make several attempts in a row, a phenomenon we call burst, which has a statistical sense and that depending on the transmission technology and available bandwidth, can be a variable parameter. In case a burst has not been successful, it implements a wait and emits another burst again. The maximum number of bursts is limited.
  • An actor after choosing a router, starts from an original score to which points are added when sending a message involves no or few retransmissions and to which points are subtracted when the message cannot be sent within the same transmission.
  • the scoring system is more condescending to failures based on the cost of the router to which an actor is associated. • An actor must look for a new router due to its malfunction when its score, after adding or subtracting points as the communication has elapsed, has reached zero. As stated above, the scoring function depends on two independent variables:
  • a router offers the routing service to the leading cluster. Said routing service is performed through a second router that is the main one (a hierarchical level above) of the cluster to which the first router belongs. Under various circumstances, it is possible for a router to lose the wireless link with the router that makes it a gateway. In this situation, the router of the affected cluster broadcasts a router cancellation message to the various elements of its cluster, so that the various actors in the cluster know that they can no longer use that router on their way to the controller. Upon arrival of the message, the rest of the router that depended on the canceled one, look for alternative routes, as if it were a start connection. In this way, the network balances its connections and presents a redundant behavior in case of unit failures.
  • the content of the protocol at the link level has the mission of sending at the link level between 2 devices on the network. Likewise, it must allow the transmission of information to broadcast, that is, to all the devices that listen to it. To do this, this protocol adds 6 bytes in the header of the data packet to send. The content of these 6 bytes is as follows:
  • Length 1 byte containing the length, in bytes, of the packet to be transmitted, minus 1 byte. This calculation includes the 6 bytes corresponding to the header of this level.
  • Type of communication 1 byte to describe the type of communication, which can be: “1” if the message is connection oriented at the link level, in which case the sender sends the packet and is waiting to receive a message at the link level, or "0" if it is not connection-oriented, when the sender sends the message without waiting for any confirmation from the receiver, this being the only way to send messages addressed to the broadcast address ( to the whole set).
  • Source address 2 bytes containing the address of the device that initiates the transmission at the link level. Since each device has a unique address on the network, the device that sends the message is uniquely defined. • Destination address: 2 bytes containing the address of the destination device of the transmission at the link level. If a unit receives a message whose destination address is not itself, it discards the message. The special case is the broadcast address, identified by the address 0x0000, which all devices have to listen and listen to.
  • the acknowledgment (ACK) at the link level serves to guarantee the sender of a connection-oriented message that his message has been received correctly. For obvious reasons, this ACK that is sent is not connection oriented, since it makes no sense to confirm the confirmation.
  • An ACK message of the link level has the message structure at this level defined above, incorporating one more bit containing an alphanumeric character that identifies that it is an ACK message of the link level.
  • the network level protocol defines the exchange of messages at said level of the OSI tower, being one step above the link level protocol.
  • the function of the network level is to route the messages through the network, in such a way that the exchange of message between two nodes separated from the network is allowed, intervening for this purpose various retransmissions between intermediate nodes. Given the architecture of this network, the characteristic is that the origin or destination of all communication is the controller of the network (common mode of information flow control in the network).
  • connection-oriented messages In addition, at the network level, a distinction is also made between connection-oriented messages and non-connection-oriented messages.
  • the former require a confirmation message at the network level (ACK).
  • ACK confirmation message
  • the network level is able to offer a guaranteed message delivery service between two network nodes; abstracting the complexity of packet routing when the origin and destination nodes are not adjacent.
  • the ACK messages of the network level should not be confused with those of the link level, since the former are end-to-end messages of the communication, while the latter are between consecutive nodes.
  • Identification protocol Protocol and application identification. This field has a size of 2 bytes.
  • ⁇ Message type 1 byte to indicate the type of network message.
  • DST cluster 2 bytes of address of the cluster to which the message is addressed.
  • SRC cluster 2 bytes of address of the cluster from which the message comes.
  • Actor address 2 bytes with the actor address involved in the transaction.
  • Data messages at the network level are not considered an essential part of the invention since they are related to the configuration of the network and the management of the wireless devices that comprise it. We will limit our therefore to review that the data messages can be of several types:
  • network management messages are an important part of the management method described here, but their configuration does not constitute an essential feature of the invention, so we will limit our to enumerating the different types of existing messages:
  • Router request message - Router announcement message to a controller
  • Final element generally sensor device that comes into operation periodically and synchronously in the network.
  • Router device that routes the communication of the final elements. It stores the information of the final elements of your cluster and redirects them to the hub also in a synchronized way.
  • RF gateway device RF gateway device.
  • the time is divided into intervals of, for example, 10 seconds, whereby the period of operation of the network must always be a multiple of 10 seconds.
  • the network hub sends a special synchronization message every 10 seconds to the broadcast address at the link level.
  • Router-type actors also work every 10 seconds. Its behavior, as seen in Figure 3, in slot 0 is as follows: • They wake up 1 sec. before the synchronization message is generated.
  • the final devices also work synchronously, as shown in Figure 4, with each period of the network, so as to maximize their autonomy. They wake up 1 sec before the synchronization message is generated and they are waiting to receive this message from their router and once received, they send the information they need for the router to group it. If this information is sent successfully to the router, they will sleep after this window of 1 s up to 1 s before the next slot 0 of the network. In case the information has not been sent successfully in this first window of 1 s, they open another window of a second to retry. After this window, whether successful or not, will sleep until 1 s before the next slot 0 of the network.
  • any unit When any unit wants to register on the network, it will implement a mechanism similar to that of desynchronization: it will wait to receive any message of synchronization, from which the current slot information and period of operation will be extracted, and will sleep until a second before the synchronization message of slot 0, at which time the router request process and network connection will have to begin success in the operation window of the routers: 4sec.
  • Dynamic address assignment protocol So far we have seen the process by which an actor with an own address is linked to the network and exchanges messages with the controller. But it is possible that the new actor lacks its own direction, or that it has to be reassigned by the controller to avoid the existence of two actors with the same direction. Therefore, it is also necessary to implement a protocol to perform a dynamic address assignment, which we explain below.
  • One of the aspects to take into account in the operation of a wireless network is the dynamic allocation of addresses, so it is necessary to implement a protocol that allows you to add, and if necessary eliminate, devices in a dynamic and transparent way for the network. As well as the possibility of coexistence of several wireless networks in the area of proximity of the wireless device that wishes to connect to a new wireless network.
  • Controller address radio address of the RF system associated with the controller.
  • Encryption key of each network this key will be unique for each network. Encryption with a unique key will allow the coexistence of nearby wireless networks. Device assignment can be performed with relaxed or critical security depending on the needs of each system, or also by providing each wireless device that can be linked to the network with a unique serial number that it uses in the network association process.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention concerne un procédé et un système de gestion massive de dispositifs sans fil au moyen d'un protocole auto-organisateur, avec une communication sur une même fréquence partagée, chaque dispositif sans fil ayant également une fonction de routage attribuée et tous les dispositifs sans fil étant connectés à un contrôleur qui fait office de passerelle, ledit procédé comprenant une phase d'autoconfiguration du réseau au cours de laquelle, de manière dynamique (tant au niveau physique que topologique, et différentes configurations topologiques pouvant coexister dans la même distribution physique) les dispositifs établissement leur voie d'accès jusqu'au contrôleur. Chaque élément, après une association réussie à un dispositif qui fait office de routeur au sein du réseau, envoie un message en direction du contrôleur, pour que tous les routeurs (ceux qui exercent en permanence cette fonction tant au niveau synchrone qu'asynchrone) intermédiaires apprennent les routes (dynamiques) avec l'élément, constituant ainsi le mécanisme d'apprentissage des routes optimales en fonction de l'état des différents dispositifs.
PCT/ES2014/070744 2014-09-30 2014-09-30 Procédé et système de gestion massive de dispositifs sans fil au moyen d'un protocole auto-organisateur WO2016050993A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/ES2014/070744 WO2016050993A1 (fr) 2014-09-30 2014-09-30 Procédé et système de gestion massive de dispositifs sans fil au moyen d'un protocole auto-organisateur

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/ES2014/070744 WO2016050993A1 (fr) 2014-09-30 2014-09-30 Procédé et système de gestion massive de dispositifs sans fil au moyen d'un protocole auto-organisateur

Publications (1)

Publication Number Publication Date
WO2016050993A1 true WO2016050993A1 (fr) 2016-04-07

Family

ID=55629461

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/ES2014/070744 WO2016050993A1 (fr) 2014-09-30 2014-09-30 Procédé et système de gestion massive de dispositifs sans fil au moyen d'un protocole auto-organisateur

Country Status (1)

Country Link
WO (1) WO2016050993A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11929907B2 (en) 2022-03-08 2024-03-12 T-Mobile Usa, Inc. Endpoint assisted selection of routing paths over multiple networks

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003061175A2 (fr) * 2002-01-10 2003-07-24 Robert Bosch Gmbh Reseau hierarchique sans fil autogere de surveillance et de controle
US20120213124A1 (en) * 2011-02-21 2012-08-23 Jean-Philippe Vasseur Method and apparatus to trigger dag reoptimization in a sensor network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003061175A2 (fr) * 2002-01-10 2003-07-24 Robert Bosch Gmbh Reseau hierarchique sans fil autogere de surveillance et de controle
US20120213124A1 (en) * 2011-02-21 2012-08-23 Jean-Philippe Vasseur Method and apparatus to trigger dag reoptimization in a sensor network

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11929907B2 (en) 2022-03-08 2024-03-12 T-Mobile Usa, Inc. Endpoint assisted selection of routing paths over multiple networks

Similar Documents

Publication Publication Date Title
US10045291B2 (en) Relay functionality of battery powered devices
AU2015289748B2 (en) Network discovery by battery powered devices
AU2015289764B2 (en) Transmission timing for battery powered devices
US20230092573A1 (en) Lorawan gateway network and method
WO2003105502A1 (fr) Protocole et structure destines a des noeuds mobiles dans un reseau de communication auto-organise
CN102318285B (zh) 在包括无电池zigbee设备的网络中通信的方法，及为此的网络和设备
WO2016011079A1 (fr) Migration de dispositifs alimentés par batterie
CN110249634B (zh) 包括电力线接口和至少一个射频接口的电表
KR100915555B1 (ko) 지그비 네트워크에서 질의 기반의 경로 탐색을 수행하는지그비 메쉬 라우팅 방법
WO2016050993A1 (fr) Procédé et système de gestion massive de dispositifs sans fil au moyen d'un protocole auto-organisateur
Pavkovic et al. Cluster-directed acyclic graph formation for ieee 802.15. 4 in multihop topologies
Mahfoudh Energy efficiency in wireless ad hoc and sensor networks: routing, node activity scheduling and cross-layering
Mane Conceptual Aspects on Mobile Ad-Hoc Network System
ES2332684B1 (es) Metodo de comunicaciones para una red de sensores.
US20240357421A1 (en) Lorawan gateway network and methods
Dhanalakshmi et al. Protocol stack in wireless sensor networks for IoT-based applications
Lee et al. K-neigh backbone tree based topology control for tactical mobile ad-hoc networks
SHUKERI Real-Time Capable Multi-Hop Media Access Control Protocol For Smart Home Environment
Lübkert Joint analysis of TDMA and geographic routing for a large scale wireless mesh network
Bakht Investigation of mechanisms for routing in mobile ad-hoc network
Jelena et al. Cluster interconnection in 802.15. 4 beacon-enabled networks
Bagci et al. Variable Ranges Security Protocol for Wireless Sensor Networks
Kareklas Theoretical analysis of a wireless mesh network
Anastasi et al. Towards the Internet of Relevant Things
RIMT-IET et al. A Survey on Throughput Analysis of DSR Routing Protocol in MANETs

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14903118

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14903118

Country of ref document: EP

Kind code of ref document: A1

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载