WO2012140610A1 - Routage hiérarchique pour des réseaux sans fil - Google Patents

Routage hiérarchique pour des réseaux sans fil Download PDF

Info

Publication number
WO2012140610A1
WO2012140610A1 PCT/IB2012/051827 IB2012051827W WO2012140610A1 WO 2012140610 A1 WO2012140610 A1 WO 2012140610A1 IB 2012051827 W IB2012051827 W IB 2012051827W WO 2012140610 A1 WO2012140610 A1 WO 2012140610A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
routing
group
nodes
data packet
Prior art date
Application number
PCT/IB2012/051827
Other languages
English (en)
Inventor
Daniel Martin Goergen
Julian Christoph OHRT
Marc Aoun
Tim Corneel Wilhelmus Schenk
Javier Espina Perez
Oscar Garcia Morchon
Original Assignee
Koninklijke Philips Electronics N.V.
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 Koninklijke Philips Electronics N.V. filed Critical Koninklijke Philips Electronics N.V.
Publication of WO2012140610A1 publication Critical patent/WO2012140610A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/64—Routing or path finding of packets in data switching networks using an overlay routing layer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/025—Updating only a limited number of routers, e.g. fish-eye update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/34—Source routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/023—Limited or focused flooding to selected areas of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • H04W40/205—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location using topographical information, e.g. hills, high rise buildings
    • 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
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery
    • 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
    • H04W40/26—Connectivity information management, e.g. connectivity discovery or connectivity update for hybrid routing by combining proactive and reactive routing
    • 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 invention relates to a routing unit, a system and a method for hierarchical routing of a data packet in a wireless network.
  • wireless mesh networks attract more and more attention, e.g. for remote control of illumination systems, building automation, monitoring applications, sensor systems and medical applications.
  • a remote management of outdoor luminaires so-called telemanagement
  • this is driven by environmental concerns, since telemanagement systems enable the use of different dimming patterns, for instance as a function of time, weather conditions or season, allowing a more energy-efficient use of the outdoor lighting system.
  • this is also driven by economical reasons, since the increased energy efficiency also reduces operational costs.
  • the system can remotely monitor power usage and detect lamp failures, which allows for determining the best time for repairing luminaires or replacing lamps.
  • RF radio-frequency
  • a control center In a star network, a control center has a direct wireless communication path to every node in the network. However, this typically requires a high-power/high-sensitivity base- station-like control center to be placed at a high location (e.g. on top of a building), which makes the solution cumbersome to deploy and expensive.
  • a mesh network the plurality of nodes does in general not communicate directly with the control center, but via so-called multi-hop communications. In a multi-hop communication, a data packet is transmitted from a sender node to a destination node via one or more intermediate nodes.
  • Nodes act as routers to transmit data packets from neighboring nodes to nodes that are too far away to reach in a single hop, resulting in a network that can span larger distances. By breaking long distances in a series of shorter hops, signal strength is sustained. Consequently, routing is performed by all nodes of a mesh network, deciding to which neighboring node the data packet is to be sent. Hence, a mesh network is a very robust and stable network with high connectivity and thus high redundancy and reliability.
  • FIG. 1 a typical network with mesh topology is shown.
  • a plurality of nodes 10 (N) is connected one to another by wireless communication paths 40.
  • Some of the nodes 10 function as collector nodes 50 (N/DC), which receive data packets from the surrounding nodes 10 via single-hop or multi-hop transmissions and transmit them to a control center 60 and vice versa.
  • the wireless communication paths 40 between the nodes 10 and collector nodes 50 can be constituted by RF transmissions, while the connection 70 between the collector nodes 50 and the control center 60 normally makes use of the Internet, mobile communication networks, radio systems or other wired or wireless data transmission systems. Therefore, the nodes 10 and the collector nodes 50 comprise a transceiver for transmitting or receiving data packets via wireless communication paths 40, e.g. via RF transmission.
  • mesh network transmission techniques can be divided in two groups: flooding-based and routing-based mesh networks.
  • flooding-based mesh network all data packets are forwarded by all nodes 10 in the network. Therefore, a node 10 does not have to make complicated routing decisions, but just broadcasts the data packet to all nodes 10 in its radio range. By these means, the technique is quite robust.
  • the data overhead due to forwarding impacts the overall achievable data rate.
  • Routing-based mesh networks can be further divided into proactive and reactive schemes.
  • proactive routing- based mesh networks all needed network paths are stored in routing tables in each node 10. The routing tables are kept up to date, e.g. by sending regular beacon messages to
  • a packet ends up in a local minimum and has to be dropped, as illustrated in Fig. 2.
  • sender node S tries to transmit the data packet to destination node D via an intermediate node A.
  • the transmission range of node A is indicated by the circle around node A. Within this circle, there is no other node 10 closer to destination node D than node A itself.
  • the data packet would be stuck at node A and dropped, although the data packet could be delivered via node B to its destination node D.
  • a sender node S cannot send a data packet to every other destination node D in the network, even though a potential route exists. This problem is named “greedy routing failure" and is likely to occur in networks with obstacles or with larger areas without nodes 10.
  • the invention is based on the idea to use hierarchical routing, wherein position-based overlay routing is applied for routing a data packet between overlay groups of network nodes, while a different routing protocol is used for underlay routing relaying the data packet between single nodes.
  • the underlay routing between single nodes may be based on a link state routing protocol.
  • underlay routing is used for relaying a data packet from one node to the next forwarding node, i.e. to the next hop node. For this, only local routing information may be required.
  • the overlay routing relating to routing between groups of nodes may be more coarse-grained. Therefore, a rough routing direction is given by the simple position-based overlay routing, while the routing details are determined by a more complex underlay routing.
  • Position-based routing protocols are very attractive in large-scale networks, since they do not need any global state
  • routing information e.g. stored in routing tables in the individual nodes.
  • these protocols are very simple and do not need many resources on individual nodes.
  • the necessary amount of routing information for routing a data packet within a wireless mesh network can be reduced, so that a less complex software and hardware structure is required at the single nodes.
  • extensive use of network resources is avoided, thus also reducing costs for setting up and maintaining the wireless network, while providing high scalability and communication reliability.
  • Another big advantage of this invention is that routed data packets are less likely to run into a dead end and be dropped (e.g. greedy routing failure as described above). In case of employing recovery strategies, this further implies that these recovery strategies have to be applied less often, resulting in shorter routing paths.
  • a routing unit for a node of a wireless network comprising an overlay routing module and an underlay routing module using at least two different routing protocols for underlay routing between nodes and overlay routing between groups of nodes.
  • a data packet is relayed between overlay groups, which comprise at least one node, using a position- based routing protocol. Therefore, the overlay routing module may determine, to which group of nodes the data packet is to be forwarded next, in order to reach the group of its destination node. This may be based on the position of the group with respect to the destination group. The underlay routing module may then relay the data packet between individual nodes using link-based routing.
  • the underlay routing module of a node may use a routing table comprising information of other nodes belonging to the same group and/or of neighboring nodes lying within a certain distance to the node. Therefore, nodes are grouped in overlay groups, which may be considered as virtual nodes, so that the number of nodes is virtually reduced, thus simplifying the general routing from a source to a destination.
  • the routing information stored in a node can be reduced, since only local routing information is required in detail.
  • a different routing protocol is used for routing between these virtual nodes or overlay groups and for underlay routing between the single nodes, the routing becomes more reliable.
  • the network is grouped in a plurality of junction groups and at least one street group.
  • a junction group may be considered as a virtual or overlay node, at which routing decisions are taken (as at a traffic junction).
  • a street group may be considered as a communication path or an edge, along which a data packet is merely forwarded towards a next junction group. Therefore, street nodes may mainly operate in underlay routing, while overlay routing is mainly performed by junction nodes.
  • each group comprises at least one real node or terminal.
  • a node of the network may be classified either as a junction node or as a street node.
  • the underlay routing module may be adapted to determine a next forwarding node for the next hop, i.e. a next hop node, to which a data packet is to be forwarded in a multi-hop transmission mode.
  • a next forwarding node for the next hop i.e. a next hop node
  • local network information such as a node position, a link state and/or a routing table entry may be used.
  • the underlay routing module may process a received data packet only in case that the receiving node corresponds to the next hop node indicated in the data packet, and/or in case that it belongs to the indicated multicast address and/or in case that the message was broadcast. This may be indicated by a next hop node address included in the data packet.
  • the underlay routing module sets the next hop node address to the node address of the determined next hop node.
  • the underlay routing module may pass a received data packet to the overlay routing module of the node. This is preferably the case, if the receiving node belongs to a next junction group indicated in the data packet, e.g. if a next junction group address included in the data packet corresponds to the group address of the node.
  • the overlay routing module may then determine a new next junction group, to which the data packet is to be forwarded towards its final destination.
  • the data packet is transmitted in acknowledge mode on the overlay and/or on the underlay.
  • next nodes are selectable for a next node in underlay routing, if no acknowledgement is received for the presently addressed next node.
  • overlay routing a relaxation or recovery strategy may be applied, if no acknowledgement is received and/or if no suitable next overlay group could be determined.
  • Overlay routing may correspond to at least one of geographic routing, greedy routing, geocasting, perimeter routing, greedy perimeter coordinator routing and restricted greedy routing - preferably in combination with a repair or recovery strategy, such as face routing, face-2 routing, GOAFR, flooding, restricted flooding or the like.
  • a repair or recovery strategy such as face routing, face-2 routing, GOAFR, flooding, restricted flooding or the like.
  • the overlay routing module comprises a normal-mode routing module and a recovery routing module, e.g. a greedy routing module and a face routing module.
  • the nodes of the wireless network are stationary.
  • predefined positions of nodes may be used.
  • grouping of the nodes in at least some of the overlay groups may be stationary.
  • the overlay routing may also be based on predefined group positions or addresses.
  • no updates with respect to node positions and/or group positions may be required. Therefore, it is also not necessary to include a GPS receiver in the nodes. Possibly, most or even all of the required routing information is also stationary or constant.
  • a position of a node may be set during a commissioning phase of the network and/or by means of a data packet received from a central controller. Alternatively or additionally, the node position may be determined locally by the node itself. Likewise, the grouping of the network nodes may be either set up during commissioning, by transmission of messages from a central controller or by locally determining appropriate groups. The grouping of nodes may be based on the position or function of the respective nodes. Possibly, the grouping is based on application level multicast groups or vice versa, thus grouping nodes with similar properties or tasks together. Preferably, a junction group and/or a street group is defined as a continuous area of nodes without any exclusions, so that the groups comprise geographically correlated nodes. The group position may be defined as the geometrical center or as the weighted center of the group, e.g. the center of gravity or cluster center accounting for node density or distribution of single nodes within the group.
  • the wireless network includes a lighting system and at least some of the network nodes including the routing unit according to the present invention are associated to luminaires of the lighting system. For instance, using the example of a street lighting system of a city or town, streetlights or luminaires are positioned along streets or on public places. Luminaire nodes of one street may be grouped together, thus forming a route for data packet transmission. Likewise, luminaire nodes at junctions may be grouped into a junction group operating as routing junction for data packet transmission.
  • the wireless network preferably relates to a radio transmission network. That is, at least some of the network nodes comprise a transceiving unit capable of receiving and/or transmitting data packets via radio transmissions.
  • the routing unit of the network node may further comprise at least one of a table information engine managing overlay routing information and a node information engine for managing underlay routing information.
  • the table information engine and the node information engine may be used for transmitting routing information to other nodes of the network using table information messages and node information messages, respectively. Possibly, the table information message and the node information message are combined and transmitted as a single information message.
  • the table information engine and the node information engine broadcast the respective message.
  • at least one of the table information message and the node information message may correspond to a beacon, which is transmitted or broadcast in regular time intervals. Alternatively or additionally, at least one of the table information message and the table information message may be transmitted upon a request or a trigger.
  • both engines may also be combined in one engine, which takes care of both kinds of routing information.
  • the message or beacon may comprise routing information of the overlay and of the underlay.
  • information such as a link state of a particular transmission link may be updated or new nodes may be included.
  • new overlay groups e.g. junction groups or the like, can be included and overlay routing decisions can be updated.
  • routing information messages comprising routing information of the sending node, routing tables of the network nodes can be kept up- to-date.
  • a node information message of the node information engine may comprise at least one of a group type, a group address and a node address corresponding to the sender node of the node information message. Additionally, a time stamp, logic time or counter may be included for indicating the age of the information. Therefore, the node information message may be used for providing receiving nodes with information about the sender node. By these means, also new nodes may be included in the network.
  • a table information message of the table information engine comprises the sender node address defining the node, from which the message has been received, and at least one table information entry.
  • the table information entry may include routing information of a routing table of the sender node.
  • the table information entry may include at least one of a group address of a group listed in the routing table of the sender node, a corresponding group type and a distance of this group to the sender node, e.g. a distance based on hop count or other metric.
  • the sender node address included in the table information message may be used by the receiving node as a next hop node address.
  • the sender node address may be used as address of a gateway node to the group included in the table information entry.
  • the number of table information entries may be configurable. By these means, information contained in a routing table of the receiving node may be updated.
  • a link quality may be assessed for link rating, black listing of links or determining a link quality indicator.
  • a node information message is accepted or processed by a receiving node only, if the sender node of the node information message belongs to the same group as the receiving node or if the sender node belongs to a neighbor group.
  • a neighbor group may be defined for instance as a directly connected group comprising at least one node, which is in a one-hop distance of the receiver node. Thus, at least one node of a neighbor group can be reached with one hop from the receiver node.
  • a neighbor group may be defined by a radius indicating maximum distance from the receiving node or from the group of the receiving node.
  • a node information message is only accepted from nodes of the same group as the receiving node or from nodes having a different group type.
  • a receiving node may be configured to ignore a received node information message, if the sender node has the same group type and belongs to a different group.
  • it may be additionally required that the sender node is a neighbor node.
  • a neighbor node may be defined as a node within one -hop distance to the receiving node or as a node within a specified radius around the receiving node.
  • a node accepts node information messages from sender nodes either belonging to the same group or belonging to a neighbor group of a different group type. However, if the receiving node accepts the node information message, the node information message may be used for updating routing information of the receiver node.
  • a table information message may be accepted by a receiving node, if the sender node of the table information message belongs to the same group as the receiving node. Possibly, also table information messages from the sender nodes are accepted, which belong to a group of different group type than the receiver node.
  • a junction node may accept table information messages from nodes of its own group and of nodes of street groups.
  • the street nodes have to be neighbor nodes of the junction node, e.g. street nodes within a predefined radius.
  • a junction node may be configured such that it learns about direct neighbor nodes of its direct neighbor nodes.
  • street nodes learn only about directly connected junction groups, while junction nodes learn about directly connected street groups and thereafter connected junction groups, i.e. about junction groups directly connected to the street groups, which are directly connected to the respective node.
  • street nodes may store less routing information than junction nodes, since preferably only junction nodes take routing decisions.
  • a routing table may be stored in the routing unit of a node.
  • the routing table may comprise information about at least one further group than the group of the node, such as a group type and a group address. Additionally, the routing table may comprise information about one or more gateway nodes leading towards the further group.
  • a gateway node associated to a group may be defined as a node that can be reached within one hop from the current node and that either is a direct neighbor of the associated group or is aware of another gateway towards it, i.e. as a next hop node to the current node, for transmission towards the group.
  • gateway for a destination node is not just any node within one-hop range of the current node, but that gateway must also know, how to get to the destination.
  • more than one gateway node may be defined for a group.
  • the number of gateway nodes is configurable.
  • the information about the gateway node may include the node address of the gateway node, the distance of the gateway node to the corresponding group, e.g. in hop count metric, and/or an update counter, a logical time or time stamp.
  • the routing unit may further include a routing table manager for managing routing information and/or for updating routing table information.
  • the routing unit may also comprise a link quality manager for assessing a link quality on the overlay and/or on the underlay, e.g. a transmission reliability between two nodes or groups. For this, the link quality manager may rate a link and determine a link quality indicator. Possibly, the link quality manager is also adapted to blacklist transmission links, which do not comply with predefined transmission standards.
  • the routing unit may include a positioning module for determining a position, a context, an application and/or a group membership of the node.
  • a data packet includes a header comprising at least one of a destination group type, a destination group address, a destination node address, a next junction group address, a next hop node address, a sending node address indicating the node, which last forwarded the data packet, and a originator node address indicating the node, from which the data packet transmission was originally started.
  • a recovery mode index may be included indicating whether the overlay routing is performed in recovery mode, e.g. using recovery strategies such as face routing.
  • a system for routing a data packet in a wireless network comprising a plurality of nodes having a routing unit according to one of the above-described embodiments.
  • the nodes comprise means for wireless communication.
  • at least some of the nodes may be grouped based on their position, application and/or function.
  • the system may correspond to a street lighting system, wherein at least some of the nodes are associated with luminaires.
  • at least some of the nodes may be grouped based on a street layout or city map.
  • network nodes may be grouped based on their context, e.g. all nodes next to public buildings may be grouped and the like.
  • the junction groups and/or street groups may be set up during a commissioning phase or using data packets from a central controller.
  • a node may locally determine its group membership and/or position.
  • a method for routing a data packet in a wireless network comprising the steps of overlay routing between junction groups, a junction group comprising at least one node, by means of a position-based routing protocol and underlay routing between nodes of the network using link-based routing.
  • the method is adapted to be performed by any of the above-described routing units or system according to one of the above-described embodiments.
  • Fig. 1 illustrates an example of a wireless mesh network
  • Fig. 2 schematically illustrates a greedy routing failure
  • Fig. 3 illustrates an example of a wireless network showing overlay
  • Fig. 4 illustrates major software components for a routing unit according to an exemplary embodiment of the present invention
  • Fig. 5 shows as flow diagram illustrating a setting-up of a routing unit
  • Fig. 6 shows a flow diagram for processing a node information message
  • FIG. 7A and 7B illustrate the parts of network groups, from which a node information message is accepted by a junction node and a street node, respectively, according to an exemplary embodiment of the present invention
  • Fig. 8 illustrates contents of a routing table according to an exemplary
  • Fig. 9 shows a flow diagram for processing a table information message
  • Fig. 10 illustrates a scheme for accepting table information messages
  • FIG. 11 shows a flow diagram for processing a data packet by an underlay routing module according to an exemplary embodiment of the present invention
  • Fig. 12 shows a flow diagram for processing a data packet by an overlay
  • Fig. 13 illustrates a routing path for transmitting a data packet in a wireless network according to an exemplary embodiment of the present invention
  • Figs. 14A and 14B illustrate entries in a header of a data packet set by an overlay routing module according to an exemplary embodiment of the present invention.
  • Preferred applications of the present invention are actuator networks, sensor networks or lighting systems, such as outdoor lighting systems (e.g. for streets, parking and public areas) and indoor lighting systems for general area lighting (e.g. for malls, arenas, parking, stations, tunnels etc.).
  • outdoor lighting systems e.g. for streets, parking and public areas
  • indoor lighting systems for general area lighting e.g. for malls, arenas, parking, stations, tunnels etc.
  • the present invention will be explained further using the example of an outdoor lighting system for street illumination, however, without being limited to this application.
  • the telemanagement of outdoor luminaires via radio-frequency network technologies is receiving increasing interest, in particular solutions with applicability for large-scale installations with segments of above 200 luminaire nodes.
  • radio frequency (RF) transmissions do not require high transmission power and are easy to implement and deploy, costs for setting up and operating a network can be reduced.
  • the data packet transmission may alternatively use infrared communication, free- space-visible-light communication or power line
  • the number of luminaire nodes 10 is extremely high. Hence, the size of the network is very large, especially when compared to common wireless mesh networks, which typically contain less than 200 nodes.
  • the nodes 10 typically have limited processing capabilities due to cost considerations, so that processing and memory resources in the luminaire nodes 10 will be limited.
  • communication protocols for transmitting data packets between single nodes 10 should consider the limited resources for efficient and fast data packet transmission.
  • all nodes 10 may be connected to mains power.
  • telemanagement of an outdoor lighting system does not require high data throughput. That means that a large part of the data traffic consists of time -uncritical data packets, e.g.
  • the telemanagement system for an outdoor lighting control network is stationary, i.e. the luminaire nodes 10 do not move.
  • node positions will not change over time.
  • the physical positions of the nodes 10, for instance GPS- coordinates or other position data may be known in the system, enabling geographic or position-based routing using pre-programmed or predefined positions, so that no GPS receiver is required in the single nodes 10.
  • the nodes 10 do not need to send position information updates to other nodes 10.
  • a network according to a preferred embodiment of the present invention is shown, wherein a street lighting system comprising a plurality of luminaire nodes 10 is set up such that each luminaire node 10 belongs either to a street group, e.g. a group of luminaires arranged along a street, or to a junction group, e.g. a group of luminaires at a crossing.
  • a city map can be used in order to allocate luminaire nodes 10 to groups based on their respective positions.
  • luminaire nodes 10 arranged in the street T are associated to the street group T and denoted with t 1; t 2 and t 3 .
  • luminaire nodes 10 located at junction J are grouped in the junction group J and referred to as ji to j 4 .
  • a plurality of street groups S, T, U, V and a plurality of junction groups J, K can be defined.
  • This allocation of luminaire nodes 10 to either street groups or junction groups is used as an overlay, while underlay refers to the real terminals or nodes 10 of the network.
  • the nodes 10 When setting up the network, the nodes 10 are all programmed with the same software for implementing the routing protocol. Therefore, all nodes 10 are aware of two different layers, wherein an underlay routing is used for transmission within street and junction groups and overlay groups take the actual routing decisions, i.e. to which group of the overlay the data packet is to be forwarded next.
  • This can be implemented by a routing unit according to an exemplary embodiment of the present invention as shown in fig. 4.
  • the routing unit comprises an overlay routing module 100 and an underlay routing module 200, which can both use information of a routing table.
  • the routing table is set-up and maintained by a routing table manager 300, so that the routing table is kept always up-to-date.
  • the routing unit comprises further a table information engine and a node information engine in order to transmit a table information message and a node information message, respectively, to other nodes of the network.
  • these engines are denoted as table beacon engine 500 and node beacon engine 600, respectively, since the corresponding information messages are preferably broadcast periodically as beacons.
  • the engines 500 and 600 may be combined to one single engine.
  • the routing unit includes a position module 700 for determining or storing a node position, a node address or a group membership of the node 10.
  • a link quality manager 400 is included in the routing unit for rating a link quality, blacklisting bad links and storing a link quality indicator.
  • step S500 the node 10 has to learn about its position in the network.
  • This position may refer to a geographic position, a GPS position, a geometric position, a relative position or a position defined by coordinates of a two-dimensional coordinate system.
  • the information about the node position is provided by a control center 60 or manually during a commissioning procedure.
  • this GPS receiver can be used for locally determining the geographic node position by the node 10 itself.
  • overlay groups are set up.
  • the node 10 is allocated to one overlay group.
  • the overlay construction can be performed centralized by a control center 60, which sets up groups, e.g. by analyzing the geographic position of the node 10. Possibly, the control center 60 additionally considers a street map when creating overlay groups.
  • the centrally determined information about the group membership is then provided to the single nodes 10 via wireless communication.
  • a node 10 can locally determine, to which overlay group it belongs, e.g. by analyzing the geographic pattern of its direct neighborhood. Hence, the node 10 detects, whether it is positioned at a street, on a junction or in an open area.
  • a group identifier or group address can be locally selected, for instance based on the geographic position of the center of the group.
  • the construction of overlay groups is based on application level multicast groups or on the function or context of the respective nodes 10.
  • the overlay routing groups can be mapped to application multicast groups or vice versa.
  • the node beacon engine of the node 10 After a node has learned whether it belongs to a street or junction group, i.e. its group type, and the address of its group, the node beacon engine of the node 10 is activated. Then, the node 10 transmits a node information message to other nodes 10 in its surroundings (S520). For this, a so-called node beacon can be used, which is periodically broadcast by the node 10 to neighboring nodes 10 in its direct radio or transmission range.
  • the node information message or node beacon comprises for instance the node address, the group type and the group address of the sender node 10.
  • the information thereof is included in the routing table of the receiver node 10, if the sender node 10 belongs either to the very same overlay group as the receiving node 10 or to a group having a different group type (S530). Possibly, the sender node 10 must even be a direct neighbor, in order that the receiving node 10 processes the node beacon.
  • a direct neighbor or neighbor node refers to a node, to which a data packet can be transmitted with one hop. Possibly the range of neighbor nodes 10 is set to be smaller than the transmission range of a node 10, i.e. smaller than a one-hop distance.
  • a centralized approach may be used, wherein the information for determining the direct neighborhood is provided by a control center 60.
  • the receiving node 10 accepts the node beacon, its routing table is updated correspondingly by the routing table manager 300. By including the information of the node beacon in the routing table, also the link quality for the sender node 10 may be updated. If the node beacon is not accepted, the receiving node 10 drops or ignores the received node beacon.
  • the node 10 After having updated the routing table information based on accepted node beacons, the node 10 transmits a table information message including information from its routing table (S540). Again, this table information message may relate to a table beacon, which is periodically broadcasted.
  • the table information message or table beacon comprises for instance the node address of the sender node 10 and one or more table beacon entries including the group type and the group address of groups listed in the routing table of the sender node 10. Possibly, also a minimum hop count indicating the number of required transmissions to the respective group when taking the shortest route is included in the table beacon entry, or any other metric for defining the distance from the sender node 10 of the table beacon to the group specified in the table beacon entry.
  • the table beacons are only accepted by the receiving node 10 (S550), if the sender node 10 of the table beacon belongs to the same group as the receiving node 10 or if the receiving node 10 belongs to a junction group and the sender node belongs to a street group. Then, information of the table beacon can be used by the routing table manager 300 for updating the routing information of the receiving node 10. By these means, the routing table of the node 10 is set up and maintained up-to-date during operation of the network. In a preferred embodiment, only node information messages and table information messages are accepted, the sender node 10 of which is a direct neighbor of the receiving node 10.
  • step S600 the receiving node 10 determines in step S610, whether the sender node 10 belongs to an overlay group having the same group type, e.g. whether the sender node 10 is a junction node, if the receiving node 10 is also a junction node and vice versa. If this is the case, the receiving node 10 determines in step S620, whether the sender node 10 of the node beacon NB belongs to the same group. If it does, the receiving node 10 includes the information contained in the node beacon NB in its routing table (S650).
  • the receiving node 10 ignores or drops the received beacon NB (S640). Also, when it is determined in step S610 that the sender node 10 does not belong to a group having the same group type as the group of the receiving node 10, the receiving node 10 determines further in step S630, whether the sender node 10 is a direct neighbor node. If it is, e.g. if the sender node 10 is located within a certain predefined radius R from the receiving node 10, the receiving node 10 includes the information of the node beacon NB into its routing table in step S650. If the sender node 10 is not a direct neighbor of the receiving node 10, the node beacon NB is ignored (S640). In summary, according to a preferred embodiment, a node 10 only accepts a node beacon NB from another node 10, if the other node 10 either belongs to the same overlay group or to a different kind of overlay group in the direct neighborhood.
  • FIG. 7 A and 7B This is further depicted in figs. 7 A and 7B for the receiving node being a junction node ji and a street node s 1 ; respectively.
  • the doted circles indicate the sending or transmission range of the junction node ji and the street node s 1 ; respectively.
  • all nodes 10 within the sending range receive the node beacon NB from the junction node j i or the street node s ⁇ .
  • the junction node ji only accepts node beacons NB from nodes 10 located within the specified radius R around the junction node ji or around the center of the overlay group J of the junction node j i . The same can be said for the street node i .
  • the radius R defines direct neighbor nodes 10 of a node 10 and can either be preset during commissioning or adjustable, e.g. by the control center 60.
  • the junction node ji accepts node beacons NB from nodes (single nodes 10 not shown) of its own junction group J and of the street group S.
  • the junction node ji also accepts node beacons NB from those nodes of the street groups T, U and V, which lie within radius R (see shaded areas).
  • junction node j i does not accept node beacons NB from the junction group K, even though some nodes 10 of the junction group K lie within its radius R indicating direct neighborhood.
  • the street node s ⁇ also accepts node beacons NB from nodes 10 of its own street group S. However, street node i further accepts only node beacons NB from nodes 10 of those parts of junction groups J and K, which lie within radius R. Yet, street node s ⁇ ignores node beacons NB received from other street groups T and V, regardless of whether they are within the radius R of direct neighborhood.
  • the routing table comprises information for overlay routing, i.e. for deciding to which group to go next, and for underlay routing, i.e. for making sure to get to that group.
  • the routing table preferably comprises only information about neighboring groups, in order to keep the size of the routing table as small as possible.
  • the routing table has as many entries as a node 10 has neighbor groups, i.e. groups that are directly connected to the node 10, or to the group of the node 10 or via a gateway. For each entry, several gateways are listed, wherein a gateway is a direct neighbor node 10. In the routing table shown in fig.
  • the group type and the group address of neighboring groups are listed.
  • the group address is given by coordinates of a two-dimensional Cartesian coordinate system.
  • GPS coordinates or other metric can be used.
  • the group address or group coordinates relate for instance to the position of the center of the group or to the position of a cluster center, i.e. to the position, where most of the nodes 10 of the group are located.
  • For each neighbor, one or more gateways are listed.
  • the number of gateways N can either be predefined or adjustable according to the requirements. The more gateways, the more reliable the routing gets. Yet, this implicates also a larger routing table. Of course, it is not necessary to provide the maximum number of gateways N for each listed neighbor group (e.g.
  • the gateway information includes a next hop node address (next hop) and a distance (hop count), e.g. indicating the number of hops necessary to transmit a data packet from the node 10 storing the routing table to the respective group listed in the routing table via the respective gateway node.
  • the hop count for the next hop node 10, i.e. gateway node 10 can be used to find the shortest route.
  • Gateway nodes with hop count l already belong to the corresponding group of that entry in the routing table. For instance, street (1 ; 1) can be reached via the gateway node (1 ;0) within one hop. Thus, gateway node (1 ;0) is a street node of street group (1 ; 1).
  • a time stamp, logical time or counter indicating the last update can be stored for each gateway node in the routing table, indicating how old the information related to the gateway is. This time information can be used for detecting stale routes.
  • an exemplary process according to an embodiment of the present invention is shown for processing a received table information message.
  • the node 10 transmits information of its routing table to other neighboring nodes 10 in form of a table information message.
  • the table information message relates to a table beacon TB, which is periodically broadcast by the table beacon engine 500 of the sender node 10.
  • the table beacon TB may be realized as the routing table of the sender node 10 in a compressed form.
  • the receiving node 10 determines in step S910, whether the sending node 10 belongs to the same group. If so, the receiving node 10 includes information from the table beacon TB in its routing table (S950).
  • the receiving node 10 checks in step S920, whether the sending node 10 belongs to a group having the same group type as the group of the receiving node 10. If it does, the receiving node 10 drops the table beacon TB (S960). In case that the sending node 10 has not the same group type and in case that it belongs to a street group or the receiving node 10 is a junction node (S930), the receiving node 10 determines further in step S940, whether the sending node 10 is listed in the routing table. If the sending node 10 is listed, the receiving node 10 includes the information of the table beacon TB in its routing table (S950).
  • the table beacon TB is dropped (S960).
  • the sending node 10 is a junction node or if the receiving node 10 is a street node (S930), it also ignores the received table beacon TB (S960).
  • street nodes only accept table beacons TB or table information messages from nodes 10 of their own groups, while junction nodes accept table beacons TB or table information messages from all nodes 10, of which a node beacon NB is accepted.
  • table beacons TB are only accepted from nodes located within a certain range, e.g. from direct neighbors spaced apart with distance r ⁇ R, R being the range of direct neighborhood.
  • the receiving node 10 gets information about neighbor groups of its neighbor nodes (gateways).
  • Exemplary accepting rules for table information messages are summarized in fig. 10. If a junction node receives a table beacon TB, it accepts the table beacon TB from nodes 10 of the same junction group or from nodes of a neighbor street group. In contrast, a street node only accepts table beacons from nodes 10 of its own street group. Therefore, street nodes learn about directly connected junction groups via node beacons NB, as junction nodes learn about directly connected street groups by means of node beacons NB. Moreover, junction nodes learn about other junction groups directly connected to these directly connected street groups via table beacons TB.
  • the information messages are realized as beacons, which are small data packets broadcast regularly by the nodes 10. Beacons are not forwarded, so only neighbor nodes 10 in the direct radio range receive them. However, also other kinds of small data packets can be used and the transmission of these data packets can be prompted by a trigger message or a request. Moreover, in the example described above, only beacons from neighbor nodes are accepted. This has the advantage that the routing tables of the single nodes 10 are relatively small. However, in alternative embodiments, the direct neighbor range R can be set to the transmission range or radio range of the single node 10.
  • a data packet When a data packet is transmitted, it is prefixed by a header comprising the destination group address, the destination node address, the next junction group address, the next hop node address and the sending node address.
  • the destination group address specifies the destination group of the data packet, while the next junction group address indicates, to which junction group the data packet is to be forwarded next. These two parameters are used for overlay routing and correspond to overlay routing information.
  • the destination group type may also be included.
  • the next hop node address indicates, to which node the data packet is to be forwarded next in order to arrive at the indicated next junction group. Once arrived at the destination group, the destination node address is used to determine the destination within this group.
  • the sending node address corresponds to the node address of the last node having forwarded the data packet.
  • a recovery mode index may be included in the header. This index shows, whether the data packet is routed in the overlay according to the normal overlay routing mode or whether the data packet is routed in the recovery mode. For instance, when using greedy routing on the overlay, a relaxation strategy or recovery mode such as face routing can be applied, if the data packet is stuck in a local minimum. By these means, the success rate of the packet delivery is increased.
  • processing of a received data packet P at a receiving node 10 is described using figures 11 and 12.
  • processes performed by the underlay routing module 200 are shown.
  • the lower network layer After receiving the data packet P (SI 100), the lower network layer passes the data packet P to the underlay routing module 200 (SI 110).
  • the receiving node 10 determines, whether the next hop node address of the data packet P corresponds to its own node address. If the receiving node 10 is not the next hop node indicated in the header of the data packet P, the data packet P is dropped (S 1130). Otherwise, the receiving node 10 checks the next junction group address included in the data packet P (SI 140), in order to determine whether the receiving node 10 belongs to the indicated next junction group.
  • next junction group address in the data packet P does not correspond to the group address of the receiving node 10, it determines gateway nodes Gi for the indicated next junction group of the data packet P and tries to relay the data packet P to one of the gateway nodes Gi, e.g. to the gateway node Gi with the smallest hop count or distance to the indicated next junction group (SI 150).
  • the node 10 sets the sending node address included in the header of the data packet P to its own node address and the next hop node address of the data packet P to the address of the determined gateway node Gj.
  • the underlay routing module 200 passes the data packet P to the overlay routing module 100 in step SI 160.
  • the overlay routing consists of a normal overlay routing mode and a recovery mode, e.g. greedy routing combined with face routing, a start recovery mode index is kept set to "false".
  • this relay of the data packet P by the underlay routing module 200 is performed in acknowledge mode, so that the node 10 stops transmission of the data packet P, when an acknowledgment ACK is received from the next hop node or gateway node Gj.
  • the routing table of the node 10 comprises several gateway nodes Gi for the next junction group indicated in the data packet P
  • the receiving node 10 may try to relay the data packet P to a different gateway node Gi, when the transmission of the data packet P to a first gateway node Gi has failed.
  • the underlay routing module may pass the data packet P to the overlay routing module 100 with the start recovery mode index being set to true.
  • the processing of the data packet P by the overlay routing module 100 is illustrated.
  • the overlay routing module 100 receives the data packet P in step S1200.
  • the start recovery mode index is set to "false”.
  • the underlay routing module 200 passes the data packet P also to the overlay routing module 100, now with the start recovery mode index being set to "true”. Therefore, the overlay routing module 100 checks first in step S1210, whether the start recovery mode index is set to "true".
  • the data packet P is passed in step S1220 to the recovery routing module of the overlay routing module 100.
  • the recovery routing module determines then a different next junction group based on the recovery mode routing protocol, e.g. face routing, and passes the data packet P with the address of the new next junction group back to the underlay routing module 200 for determining the corresponding gateway nodes Gi and for relaying the data packet thereto (SI 150 of fig. 11).
  • the overlay routing module 100 determines whether the group address of the node 10 corresponds to the destination group address included in the data packet (S1230).
  • the data packet is passed to the broadcast module of the receiving node 10 (S1250) and is broadcast or multicast to all nodes 10 of this destination group. Then, only the destination node 10 indicated by the destination node address in the data packet P will decode the data packet P.
  • the data packet may be unicast to the destination node using the destination node address included in the data packet P. However, broadcasting and unicasting in a long and narrow street is almost equivalent, except for the broadcasting being easier and more reliable.
  • the group address of the node 10 does not correspond to the destination group address of the data packet P, it is determined in step S1240, whether the data packet P is already in recovery mode.
  • the data packet P is passed to the module of the overlay routing module 100, which is responsible for overlay routing in normal mode (S1260), e.g. to a greedy routing module.
  • the greedy routing module determines the address of the next junction group based on a greedy routing protocol. For instance, if the group addresses include metric information, e.g. geographical information of GPS data or geometrical information of Cartesian coordinates, the greedy routing module can choose a next junction group from the routing table by minimizing the distance of the next junction group to the destination group of the data packet P using this metric information.
  • the data packet P can be returned to the underlay routing module 200 (S1280). Then, the underlay routing module 200 continues with step SI 150 of fig. 11. In case, however, that the data packet P is determined in step S1240 to be in recovery mode, the data packet is passed to the recovery routing module of the overlay routing module 100, which determines the address of the next junction group based on the recovery routing protocol (S 1270) and sets the next junction group address in the header of the data packet P accordingly. Then, the data packet P can again be returned to the underlay routing module 200 for further processing (continuing with step SI 150 of fig. 11).
  • a node 10 receiving the data packet P can check the recovery mode counter in order to determine whether to stay in the recovery mode or whether to return to the normal overlay routing mode. For instance, it can be returned to the normal overlay routing mode (greedy routing), if the recovery mode counter exceeds a predefined threshold.
  • a preferred embodiment of the present invention relates to applications based on greedy routing in citywide networks, e.g. in street lighting systems.
  • citywide wireless networks based on light poles or luminaires
  • the greedy routing failure is likely to occur.
  • Buildings are blocking the direct line-of-sight path, which is preferred by a greedy protocol.
  • free-space areas without lamp deployments like parks or lakes can "block" the direct path.
  • these limitations can be overcome by creating position-based groups that reflect the street layout of the city.
  • Luminaire nodes 10 including RF terminals are assigned to, or locally create groups that represent the streets and crossings of the city. Routing a data packet in this preferred embodiment is illustrated in fig.
  • junction groups are indicated by circles and street groups are indicated by diamonds.
  • the single luminaire nodes 10 are only weakly indicated by the small shaded circles.
  • a data packet is sent from the junction group S to the junction group D following the dashed routing path. Nodes 10 close to a circle indicating a junction group belong to this junction group, while nodes 10 along edges belong to a corresponding street group indicated by the diamond. Each node 10 belongs to exactly one junction or street group.
  • a sending node i of the junction group S sets the fields of the header of the data packet in its overlay routing module 200 to the contents shown in fig. 14A.
  • the destination group type included in the data packet is set to "junction"
  • the destination group address is set to the group address of junction group D
  • the recovery mode index is set to "false”
  • the next junction address is set to the group address of the next junction determined by the overlay routing module using greedy routing, which is junction 1.
  • the data packet is handed to the underlay routing module 200 of the sending node s 1 ; which determines an appropriate next hop node address. Assuming that the sending node s ⁇ is a direct neighbor of street group a, the next hop node or gateway will be a member of the street group a.
  • the underlay routing module 200 of the sending node i of junction group S will set the next hop node address included in the data packet to the node address of the determined next hop node and the sending node address in the data packet to the address of the sending node s ⁇ .
  • the underlay routing module 200 of the next node which belongs to the street group a, has received the data packet, it will again update the header fields relating to the next hop node address and to the sending node address and retransmit the data packet. These steps are repeated, until the receiving node is a member of the junction group 1.
  • the data packet is passed up from the underlay routing module 200 to the overlay routing module 100 of the junction node of junction group 1, which updates the overlay routing information in the data packet as shown in fig.
  • the overlay routing module 100 determines the next junction group using greedy routing and includes the address of the next junction group in the header of the data packet.
  • the next junction group address is set to 2.
  • the data packet is passed back to the underlay routing module 200 for updating the header fields of next hop node address and sending node address. Repeating these steps, the data packet will follow the path S-a- l-b-2-c-3-d-4-e-5-f-D indicated by the dashed line in fig. 13.
  • the path, which the data packet takes during underlay routing i.e. the path between the individual terminals or nodes 10, is not shown in fig. 13.
  • routing of a data packet in a wireless network is performed hierarchically.
  • the end-to-end routing is done on a graph overlay of the network using geographical routing, while single nodes 10 and neighboring groups may be connected by a second routing protocol on the underlay.
  • Arbitrary routing protocols can be applied on these two levels.
  • greedy routing is used on the overlay, e.g. in combination with face routing, since this is a very efficient routing approach and does not require knowledge on the whole route towards the destination.
  • link-based routing approaches are preferred, since these protocols are very efficient and find routes as long as the number of routing table entries and the length of routes are small.

Landscapes

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

Abstract

L'invention concerne, pour le routage d'un paquet de données dans un réseau sans fil, d'une manière fiable mais simple, améliorant ainsi l'extensibilité du réseau et l'efficacité de la communication, une unité de routage, un système et un procédé pour router un paquet de données dans un réseau sans fil, le routage de recouvrement étant réalisé entre des groupes de jonction comprenant au moins un nœud à l'aide d'un protocole de routage par position et un routage de renforcement étant réalisé entre des nœuds du réseau à l'aide d'un routage par liaison.
PCT/IB2012/051827 2011-04-15 2012-04-13 Routage hiérarchique pour des réseaux sans fil WO2012140610A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP11162633 2011-04-15
EP11162633.9 2011-04-15

Publications (1)

Publication Number Publication Date
WO2012140610A1 true WO2012140610A1 (fr) 2012-10-18

Family

ID=46062655

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2012/051827 WO2012140610A1 (fr) 2011-04-15 2012-04-13 Routage hiérarchique pour des réseaux sans fil

Country Status (1)

Country Link
WO (1) WO2012140610A1 (fr)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103440748A (zh) * 2013-06-24 2013-12-11 江苏大学 面向集中供暖分户计量的无线温度采集方法及其装置
WO2014108786A1 (fr) * 2013-01-08 2014-07-17 Koninklijke Philips N.V. Optimisation de l'acheminement de messages dans un réseau sans fil maillé
WO2016150972A1 (fr) * 2015-03-26 2016-09-29 Philips Lighting Holding B.V. Procédé de configuration d'un réseau, et appareil de configuration.
WO2017007409A1 (fr) * 2015-07-06 2017-01-12 Telefonaktiebolaget Lm Ericsson (Publ) Appareil et procédé d'envoi de messages
US10116511B2 (en) 2013-10-15 2018-10-30 Samsung Electronics Co., Ltd. Method and apparatus for controlling topology
US10251073B2 (en) 2014-03-13 2019-04-02 Philips Lighting Holding B.V. Method for configuring a node device, a network and a node device
CN110087279A (zh) * 2019-05-06 2019-08-02 西安非凡士智能科技有限公司 一种以群组为单元的无线中继组网数据传输方法
US10849205B2 (en) 2015-10-14 2020-11-24 Current Lighting Solutions, Llc Luminaire having a beacon and a directional antenna
WO2022049300A1 (fr) 2020-09-07 2022-03-10 Signify Holding B.V. Procédé et dispositif de nœud destiné à transmettre un message de déclenchement dans un réseau de dispositifs de nœud interconnectés de manière fonctionnelle
WO2022090559A1 (fr) 2020-11-02 2022-05-05 Signify Holding B.V. Procédé et dispositif de nœud pour relayer un message dans un réseau de dispositifs de nœuds interconnectés de manière opérationnelle
WO2024068967A1 (fr) * 2022-09-30 2024-04-04 LVX Global (Deutschland) GmbH Système de transmission d'un signal avec un paquet de données vers et depuis un dispositif de commande d'une pluralité de dispositifs de commande

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030202465A1 (en) * 2002-04-29 2003-10-30 Harris Corporation Hierarchical mobile ad-hoc network and methods for performing reactive routing therein using dynamic source routing (DSR)

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030202465A1 (en) * 2002-04-29 2003-10-30 Harris Corporation Hierarchical mobile ad-hoc network and methods for performing reactive routing therein using dynamic source routing (DSR)

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
KEVIN C. LEE ET AL.: "Taking the LOUVRE approach", March 2009, THE VEHICULAR TECHNOLOGY
LEE K ET AL: "Taking the LOUVRE approach", IEEE VEHICULAR TECHNOLOGY MAGAZINE, IEEE, US, vol. 4, no. 1, 1 March 2009 (2009-03-01), pages 86 - 92, XP011256602, ISSN: 1556-6072 *

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10993163B2 (en) 2013-01-08 2021-04-27 Signify Holding B.V. Optimizing message forwarding in a wireless mesh network
WO2014108786A1 (fr) * 2013-01-08 2014-07-17 Koninklijke Philips N.V. Optimisation de l'acheminement de messages dans un réseau sans fil maillé
CN104904273A (zh) * 2013-01-08 2015-09-09 皇家飞利浦有限公司 在无线网状网络中优化消息转发
RU2661774C2 (ru) * 2013-01-08 2018-07-19 Филипс Лайтинг Холдинг Б.В. Оптимизация перенаправления сообщений в беспроводной ячеистой сети
CN104904273B (zh) * 2013-01-08 2020-08-04 飞利浦灯具控股公司 在无线网状网络中优化消息转发
CN103440748A (zh) * 2013-06-24 2013-12-11 江苏大学 面向集中供暖分户计量的无线温度采集方法及其装置
US10116511B2 (en) 2013-10-15 2018-10-30 Samsung Electronics Co., Ltd. Method and apparatus for controlling topology
US10251073B2 (en) 2014-03-13 2019-04-02 Philips Lighting Holding B.V. Method for configuring a node device, a network and a node device
WO2016150972A1 (fr) * 2015-03-26 2016-09-29 Philips Lighting Holding B.V. Procédé de configuration d'un réseau, et appareil de configuration.
WO2017007409A1 (fr) * 2015-07-06 2017-01-12 Telefonaktiebolaget Lm Ericsson (Publ) Appareil et procédé d'envoi de messages
US10849205B2 (en) 2015-10-14 2020-11-24 Current Lighting Solutions, Llc Luminaire having a beacon and a directional antenna
CN110087279A (zh) * 2019-05-06 2019-08-02 西安非凡士智能科技有限公司 一种以群组为单元的无线中继组网数据传输方法
CN110087279B (zh) * 2019-05-06 2022-11-08 西安非凡士智能科技有限公司 一种以群组为单元的无线中继组网数据传输方法
WO2022049300A1 (fr) 2020-09-07 2022-03-10 Signify Holding B.V. Procédé et dispositif de nœud destiné à transmettre un message de déclenchement dans un réseau de dispositifs de nœud interconnectés de manière fonctionnelle
EP4391603A2 (fr) 2020-09-07 2024-06-26 Signify Holding B.V. Procédé et système de transmission d'un message de déclenchement dans un réseau de dispositifs de noeud interconnectés fonctionnellement
WO2022090559A1 (fr) 2020-11-02 2022-05-05 Signify Holding B.V. Procédé et dispositif de nœud pour relayer un message dans un réseau de dispositifs de nœuds interconnectés de manière opérationnelle
WO2024068967A1 (fr) * 2022-09-30 2024-04-04 LVX Global (Deutschland) GmbH Système de transmission d'un signal avec un paquet de données vers et depuis un dispositif de commande d'une pluralité de dispositifs de commande

Similar Documents

Publication Publication Date Title
WO2012140610A1 (fr) Routage hiérarchique pour des réseaux sans fil
US9398568B2 (en) System and method for optimizing data transmission to nodes of a wireless mesh network
JP5992421B2 (ja) 無線ネットワークでデータパケットを負荷分散するデバイス及び方法
US10397823B2 (en) Device and method for scheduling data packet transmission in wireless networks
JP6118252B2 (ja) 無線ネットワークにおけるエンドツーエンド・データパケット伝送の遅延最適化のための装置及び方法
CN105722176B (zh) 城市场景中有基础设施的车联网大规模异构网络的连通性方法
US20040018839A1 (en) Protocol and structure for mobile nodes in a self-organizing communication network
Shruthi Proactive routing protocols for a MANET—A review
US10219319B2 (en) Device and method for controlling a node of a wireless network
JP2013527713A (ja) データパケット転送方法及び装置
CN104904273B (zh) 在无线网状网络中优化消息转发
WO2012042454A1 (fr) Dispositif et procédé permettant de réduire le retard des transmissions des paquets de données dans des réseaux sans fil
WO2012042426A1 (fr) Dispositif et procédé pour améliorer la fiabilité de transmissions de paquets de données dans des réseaux sans fil
WO2012080893A1 (fr) Unité de commande, noeud et procédé pour adresser des transmissions de diffusion groupée dans un réseau sans fil
Vinnarasi et al. VANET routing protocol with traffic aware approach
Brahmi et al. End-to-end routing through a hybrid ad hoc architecture for V2V and V2I communications
Logapriya et al. OVERVIEW OF ROUTING PROTOCOLS FOR VEHICULAR AD-HOC NETWORKS

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: 12720616

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: 12720616

Country of ref document: EP

Kind code of ref document: A1