EP1819109B1 - Verfahren und Vorrichtung zum Übertragen von Informatioenn an eine Station in einem drahtlosen Maschennetzwerk - Google Patents

Verfahren und Vorrichtung zum Übertragen von Informatioenn an eine Station in einem drahtlosen Maschennetzwerk Download PDF

Info

Publication number
EP1819109B1
EP1819109B1 EP07101928.5A EP07101928A EP1819109B1 EP 1819109 B1 EP1819109 B1 EP 1819109B1 EP 07101928 A EP07101928 A EP 07101928A EP 1819109 B1 EP1819109 B1 EP 1819109B1
Authority
EP
European Patent Office
Prior art keywords
mesh
message
station
tree structure
portal
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP07101928.5A
Other languages
English (en)
French (fr)
Other versions
EP1819109A1 (de
Inventor
Hyeong-Seok Kim
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Samsung Electronics Co Ltd
Original Assignee
Samsung Electronics Co Ltd
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 Samsung Electronics Co Ltd filed Critical Samsung Electronics Co Ltd
Publication of EP1819109A1 publication Critical patent/EP1819109A1/de
Application granted granted Critical
Publication of EP1819109B1 publication Critical patent/EP1819109B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40—Network security protocols
    • 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/46—Cluster building
    • 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
    • H04W60/00—Affiliation to network, e.g. registration; Terminating affiliation with the network, e.g. de-registration
    • H04W60/06—De-registration or detaching
    • 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

  • Apparatuses and methods consistent with the present invention relate to a wireless mesh network, and more particularly to, a method of transferring information on a station to nodes in a wireless mesh network when the station joins or leaves a mesh access point.
  • HWMP hybrid wireless mesh protocol
  • SEEMesh Simple, Efficient and Extensible Mesh
  • the HWMP is a hybrid protocol that uses a proactive routing protocol and a reactive routing protocol together.
  • Using the reactive routing protocol nodes do not always maintain a routing table of a network, but instead, search a routing path to a destination node until a source node is ready to transmit data.
  • Using the proactive routing protocol nodes always maintain the routing table.
  • the HWMP uses an ad hoc on-demand distance vector routing (AODV) protocol as the reactive routing protocol.
  • AODV ad hoc on-demand distance vector routing
  • Figure 1 is a diagram for searching for a path using the AODV protocol in a wireless mesh network.
  • node A searches for the path for transmitting data to node D
  • the node A writes an address of the node A in a source address field and an address of the node D in a destination address field of a route requirement (RREQ) packet and broadcasts the RREQ packet.
  • RREQ route requirement
  • Node B which receives the RREQ packet, recognizes that node A is searching for the path to node D, node B registers with a routing table that the node B is one hop from node A based on a hop count field of the RREQ packet, and then broadcasts the RREQ packet.
  • Node C which receives the RREQ packet from node B, registers with a routing table that node B is a next hop for the path to the node A, and then broadcasts the RREQ packet.
  • node D which receives the RREQ packet from node C, recognizes that the RREQ packet is transmitted to the node D according to the destination address of the RREQ packet, then node D generates a route response (RREP) packet having node A as its destination, transmits the RREP packet to the node C via unicast, and registers node C in a precursor list of an address of the node D.
  • RREP route response
  • node C which receives the RREP packet from node D, finds through the routing table that the node B is the next hop for the path to the node A, transmits the RREP packet to the node B via unicast, and registers the node B in a precursor list of node D. Likewise, node B transmits the received RREP packet to the node A and registers node A in the precursor list of node D, thereby searching for the path between the node A and the node D.
  • the precursor list is used when a link between nodes is disconnected or no more paths are searched. For example, if node C recognizes that node C and the node D are disconnected, then node C determines node D as a destination node and informs nodes communicating with node C of the fact, which is performed for node C to transmit a route error (RERR) packet to nodes registered with the precursor list of node D in the routing table of node C.
  • RERR route error
  • node C transmits the RERR packet to the node B, and then node B, which received the RERR packet, also transmits the REPP packet to the node A registered in the precursor list of the node D, so that all nodes that have the node D as the destination node receive the RERR packet and recognize that the path between all nodes and the node D is disconnected.
  • FIG 2 is a diagram for explaining a related art method of forwarding information on a station when the station moves.
  • nodes A through I are mesh access points that comprise an access point function and an ad-hoc routing function in accord with 802.11.
  • the mesh access point J When station 1 moves from a service area of mesh access point J to an area of mesh access point G, the mesh access point J recognizes that the station 1 is out of the service area of the mesh access point J and transmits an RERR packet to nodes registered in a precursor list of station 1 as described with reference to Figure 1 . For example, if node A and node C communicate with the station 1, all nodes between the node A and node J and all nodes between the node C and the node J over a path receive the RERR packet.
  • the RERR packet must be transmitted to nodes whenever a hand-off of a station occurs. If stations very frequently move in a wireless mesh network, hand-offs occur frequently. In particular, if a lot of stations exist in the wireless mesh network, the RERR packet is frequently used due to hand-offs or link disconnections, consuming network resources.
  • the existing HWMP standards do not clearly describe how a root node and other mesh access points can recognize that the station 1 newly joins the service area of the mesh access point G.
  • Exemplary embodiments of the present invention address the above disadvantages of the related art.
  • the various aspects of the present invention provide a method and apparatus for reducing a network overhead and informing other nodes of association or disassociation of a station in a wireless mesh network.
  • a method of transferring information on a station using a mesh access point in a wireless mesh network when said station leaves or joins said mesh access point, the method comprising: (a) using a proactive routing protocol by notes, except stations, in the wireless mesh network to form a tree structure from nodes in the wireless mesh network; (b) using the proactive routing protocol, designating a mesh portal (930) as a root node of the formed tree structure, a mesh portal being a node connecting said wireless mesh network to an external network; (c) recognising, by a mesh access point, association or disassociation of the station (310) (d) generating by said mesh access point a disassociation message indicating that the station (1) is disassociated from said mesh access point, if a disassociation of the station (1) is detected; and generating by said mesh access point an association message indicating that the station (1) belongs to said mesh access point, if an association of another station (1) is detected; (e) requesting the root node to insert the disassociation or association
  • Operation (b) may comprise: transmitting the disassociation message to the mesh portal along a path in the tree structure via unicast; and/or transmitting the association message to the mesh portal (930) along the path in the tree structure via unicast.
  • a computer-readable storage medium having embodied thereon a computer program for executing the method.
  • a mesh access point apparatus in a wireless mesh network comprising: a unit for using a proactive routing protocol by nodes, except stations, to form a tree structure from nodes in the wireless mesh network; a detection unit, which detects disassociation or association of a station; a message generation unit which generates a disassociation message indicating that a station (1) is disassociated from the mesh access point, if a disassociation of the station (1) is detected or generates an association message indicating that the station (1) belongs to the mesh access point, if an association of another station (1) is detected; and a request unit which requests a mesh portal, a mesh portal being a node connecting said mesh network to an external network, said mesh portal designated as a root node in the tree structure formed using a proactive routing protocol to insert the disassociation or association message into a root announcement message regularly broadcasted by the mesh portal to the wireless mesh network, wherein the root announcement message is a packet used to maintain the tree structure for the mesh portal designated as the root node of the tree
  • the request unit may transmit the disassociation message to the mesh portal along a path in the tree structure via unicast to request the mesh portal to insert the disassociation message.
  • the message generation unit may generate an association message indicating that the station belongs to the mesh access point, and the request unit may request the mesh portal to insert the association message into the message regularly broadcasted by the mesh portal to maintain the tree structure, terminating the uploading of the contents.
  • a method of maintaining a tree structure by a mesh portal designated as a root node in a wireless mesh network in which nodes, except stations, form said tree structure through a proactive routing protocol, said mesh portal being a node connecting said mesh network to an external network comprising: (a) determining whether a message received from a mesh access point is a disassociation message or an association message of a station with respect to said mesh access point; and (b) based on the determination result, selectively inserting the received message into a root announcement message regularly broadcasted by the mesh portal to the wireless mesh network, wherein the root announcement message is a packet used to maintain the tree structure for the mesh portal designated as the root node of the tree structure.
  • the received message may be no longer inserted into the regularly broadcasted message.
  • a computer-readable storage medium having embodied thereon a computer program for executing the method.
  • a mesh portal apparatus designated as a root node in a wireless mesh network in which nodes, except stations, form a tree structure through a proactive routing protocol, the mesh portal being a node connecting said wireless mesh network t an external network and comprising: a determination unit which determines whether a message received from a mesh access point is a disassociation message or an association message of a station; and a message processing unit which, based on the determination result selectively inserts the received message into a root announcement message regularly broadcasted by the mesh portal to maintain the tree structure, wherein the root announcement message is a packet used to maintain said tree structure for the mesh portal designated as the root node of the tree structure.
  • FIG. 3 is a flowchart of a method of transferring information on a station using a mesh access point according to an exemplary embodiment of the present invention.
  • the mesh access point recognizes association or disassociation of the station (Operation 310)
  • the mesh access point generates a message indicating the association or disassociation of the station using an address of the station and an address of the mesh access point (Operation 320)
  • a HWMP uses a proactive routing protocol instead of an AODV protocol that is a reactive routing protocol.
  • AODV protocol that is a reactive routing protocol.
  • nodes (except stations) in the wireless mesh network form the tree structure in that a specific mesh portal is designated as the root node, and a routing table is maintained for the tree structure. If a path formed using the AODV protocol does not exist or routing information is deleted after time elapsed, nodes of the wireless mesh network using the HWMP transmit a packet to the root node via the path over the tree using the routing table, and the root node routes the received packet to a node according to a destination node address.
  • the mesh portal is a node connected to an external network wired and which connects the wireless mesh network to the external network. Its detailed description is omitted since the mesh portal is described in various publications relating to the wireless mesh network.
  • FIG 4 is a flowchart of a method of transferring information on a station using a mesh portal according to an exemplary embodiment of the present invention.
  • the mesh portal is a node designated as a root node in a tree structure formed using a proactive protocol.
  • the mesh portal receives a message from another node (Operation 410)
  • the mesh portal analyzes the received message and determines whether the message indicates that the station is disassociating from a mesh access point or associating a new mesh access point (Operations 420 and 430). If it is determined that the received message indicates the association or disassociation of the station, the mesh portal broadcasts the message to the wireless mesh network and informs nodes pertaining to the wireless mesh network that the station disassociates from an existing service area or associates a service area of a new mesh access point.
  • the mesh portal performs an appropriate operation such as transferring the message to a destination node, and processes the message accordingly (Operation 450).
  • Figure 5 is a diagram for explaining an information flow when a station moves in a wireless mesh network according to an exemplary embodiment of the present invention. Referring to Figure 5 , it is assumed that nodes A through I are all mesh access points.
  • the wireless mesh network using a HWMP uses an AODV protocol that is a reactive routing protocol in addition to the proactive routing protocol.
  • AODV protocol that is a reactive routing protocol in addition to the proactive routing protocol.
  • a routing table having a tree structure is maintained as described with reference to Figure 3 .
  • a solid-lined path is set using the AODV protocol, whereas a dot-lined path is set using the proactive routing protocol.
  • the mesh access point J recognizes the movement of the station 1 and generates a disassociation message indicating that the station 1 is disassociated from the service area of the mesh access point J and transmits the disassociation message to a root node.
  • the disassociation message may be transmitted to the root node through a path over a tree structure, i.e., mesh access points F and A, via unicast.
  • the disassociation message includes a field indicating that the message is the disassociation message and a field indicating an address of the disassociated station 1 as illustrated in Figure 6 .
  • the mesh access point G If the station 1 moves a service area of mesh access point G, the mesh access point G generates an association message indicating that the station 1 newly associates in the service area of the mesh access point G and transmits the message to the root node.
  • the association message also may be transmitted to the root node through the path over the tree structure, i.e., mesh access point D, via unicast.
  • the association message includes a field indicating that the message is the association message and a field indicating an address of the associated station 1 as illustrated in Figure 7 .
  • the root node may insert these messages into a regularly broadcasted root announcement (RA) message and transmit the RA message.
  • the RA message is a packet used to maintain the tree structure for the mesh portal designated as the root node having the tree structure in the wireless mesh network using the HWMP.
  • a message indicating that a specific station at the same case, i.e., at a specific time, associates or disassociates a service area of a specific mesh access point may be inserted into the RA message for a set period of time to be transmitted the RA message. If not, the size of the RA message including every piece of information on the association and disassociation of all previous stations will be increased.
  • FIG 8 is a diagram of a format of the RA message according to an exemplary embodiment of the present invention.
  • the RA message includes a type field, a mesh access point address field, and a station address field.
  • a disassociation message or association message is inserted into the RA message. If the type field has a value corresponding to the disassociation message, it indicates that a station corresponding to the station address of the same line is disassociated from a mesh access point corresponding to the mesh access point address of the same line, which is applied when the type field has a value corresponding to the association message.
  • Nodes of a wireless mesh network that receive these messages analyze each of the three fields to recognize changes in the disassociation and association of the station.
  • Figure 9 is a block diagram of a mesh portal 930 and a mesh access point 910 according to an exemplary embodiment of the present invention.
  • the mesh portal is a root node.
  • the mesh access point 910 of the current exemplary embodiment comprises a detection unit 911, a message generation unit 912, and a request unit 913.
  • the mesh portal 930 comprises a message processing unit 933, a determination unit 932, and a message transmission unit 931.
  • the detection unit 911 detects association or disassociation of a station.
  • the message generation unit 912 generates a message according to the detection performed by the detection unit 911, and transmits the message to the request unit 913.
  • the request unit 913 transmits the received message to the mesh portal 930 that is the root node along a tree path via unicast to request the wireless mesh network 920 to broadcast the message.
  • the mesh portal 930 designated as the root node in a tree structure formed using a proactive protocol will now be described.
  • the determination unit 932 determines the message type based on a type field of the received message, if the received message is a disassociation message or an association message, the determination unit 932 transmits the message to the message processing unit 933.
  • the determination unit 932 also inserts the received message into an RA message that is regularly broadcasted to the wireless mesh network 920.
  • the message transmission unit 931 broadcasts the RA message including the disassociation message or the association message to the wireless mesh network 920.
  • the present invention may also be embodied as computer readable code on a computer readable recording medium.
  • the computer readable recording medium is any data storage device that can store data which can be thereafter read by a computer system. Examples of the computer readable recording medium include read-only memory (ROM), random-access memory (RAM), CD-ROMs, magnetic tapes, floppy disks, optical data storage devices, and carrier waves.
  • the present invention can more greatly reduce a network overhead than a conventional art while informing other nodes of the leave of the station. Also, when the station enters into a new area of the mesh access point in the wireless mesh network, the present invention provides a mechanism that informs other nodes of the entrance of the station.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Claims (15)

  1. Verfahren zum Übertragen von Informationen an eine Station (1) unter Verwendung eines Mesh-Zugangspunktes (910) in einem drahtlosen Mesh-Netzwerk (920), wobei das Verfahren umfasst:
    (a) Verwenden eines proaktiven Routing-Protokolls durch Knoten, außer Stationen, in dem drahtlosen Mesh-Netzwerk (920), um eine Baumstruktur aus Knoten in dem Mesh-Netzwerk zu bilden;
    (b) unter Verwendung eines proaktiven Routing-Protokolls, Bestimmen eines Mesh-Portals (930) als Wurzelknoten der gebildeten Baumstruktur, wobei es sich bei einem Mesh-Portal (930) um einen Knoten, der das drahtlose Mesh-Netzwerk (920) mit einem externen Netzwerk verbindet, handelt;
    (c) Erkennen, durch einen Mesh-Zugangspunkt, einer bestehenden oder getrennten Verbindung der Station (310) von dem Mesh-Zugangspunkt;
    (d) Erzeugen, durch den Mesh-Zugangspunkt, einer Mitteilung über eine getrennte Verbindung, die darauf hinweist, dass die Station (1) von dem Mesh-Zugangspunkt (910) getrennt ist, wenn eine getrennte Verbindung der Station (1) erfasst worden ist; und Erzeugen, durch den Mesh-Zugangspunkt, einer Mitteilung über eine getrennte Verbindung, die darauf hinweist, dass die Station (1) zu dem Mesh-Zugangspunkt (910) gehört, wenn eine bestehende Verbindung einer anderen Station (1) erfasst worden ist;
    (e) Anfordern, durch den Mesh-Zugangspunkt, dass das Mesh-Portal (930) die Mitteilung über eine getrennte oder bestehende Verbindung in eine Wurzelankündigungsmitteilung einfügt, welche regelmäßig von dem Mesh-Portal (930) an das drahtlose Mesh-Netzwerk (920) übertragen wird, wobei es sich bei der Wurzelankündigungsmitteilung um ein Paket handelt, das verwendet wird, um die Baumstruktur für das Mesh-Portal, das als Wurzelknoten der Baumstruktur bestimmt worden ist, zu erhalten.
  2. Verfahren gemäß Anspruch 1, wobei der Schritt (d) umfasst:
    Übertragen der Mitteilung über eine getrennte Verbindung an das Mesh-Portal (930) via Unicast über einen Pfad in der Baumstruktur; und/oder
    Übertragen der Mitteilung über eine bestehende Verbindung an das Mesh-Portal (930) via Unicast über einen Pfad in der Baumstruktur.
  3. Verfahren gemäß einem der vorangegangenen Ansprüche, wobei das drahtlose Mesh-Netzwerk (920) ein drahtloses Hybrid-Mesh-Protokoll (Hybrid Wireless Mesh Protocol (HWMP)) einschließlich eines Ad-hoc-Abstandsvektor-Routing-Protokolls auf Abruf (Ad hoc On-demand Distance Vector (AODV)) verwendet.
  4. Computerlesbares Speichermedium, das Anweisungen umfasst, die, wenn sie von einem Computer ausgeführt werden, den Computer dazu veranlassen, das Verfahren gemäß einem der vorangegangenen Ansprüche auszuführen.
  5. Mesh-Zugangspunktvorrichtung (910) in einem drahtlosen Mesh-Netzwerk (920), wobei die Vorrichtung umfasst:
    eine Einheit zum Verwenden eines proaktiven Routing-Protokolls durch Knoten, außer Stationen, um eine Baumstruktur aus Knoten in dem Mesh-Netzwerk zu bilden;
    eine Erfassungseinheit (911), die eine getrennte Verbindung oder eine bestehende Verbindung einer Station erfasst;
    eine Mitteilungserzeugungseinheit (912), die eine Mitteilung über eine getrennte Verbindung erzeugt, welche darauf hinweist, dass eine Station (1) von dem Mesh-Zugangspunkt (910) getrennt ist, wenn eine getrennte Verbindung der Station (1) erfasst worden ist, oder die eine Mitteilung über eine bestehende Verbindung erzeugt, welche darauf hinweist, dass die Station (1) zu dem Mesh-Zugangspunkt (910) gehört, wenn eine bestehende Verbindung einer anderen Station (1) erfasst worden ist; und
    eine Anforderungseinheit (913), die ein Mesh-Portal (930) anfordert, wobei es sich bei einem Mesh-Portal (930) um einen Knoten, der das Mesh-Netzwerk (920) mit einem externen Netzwerk verbindet, handelt, wobei das Mesh-Portal (930) als Wurzelknoten in einer unter Verwendung eines proaktiven Routing-Protokolls gebildeten Baumstruktur dazu bestimmt ist, die Mitteilung über eine getrennte oder bestehende Verbindung in eine Wurzelankündigungsmitteilung einzufügen, welche regelmäßig von dem Mesh-Portal (930) an das drahtlose Mesh-Netzwerk (920) übertragen wird, wobei es sich bei der Wurzelankündigungsmitteilung um ein Paket handelt, das verwendet wird, um die Baumstruktur für das Mesh-Portal, das als Wurzelknoten der Baumstruktur bestimmt worden ist, zu erhalten.
  6. Vorrichtung gemäß Anspruch 5, wobei die Anforderungseinheit (913) die Mitteilung über eine getrennte Verbindung via Unicast über einen Pfad in der Baumstruktur an das Mesh-Portal (930) überträgt, um das Mesh-Portal (930) anzufordern, die Mitteilung über eine getrennte Verbindung einzufügen.
  7. Vorrichtung gemäß Anspruch 5 oder 6, wobei die Anforderungseinheit (913) die Mitteilung über eine bestehende Verbindung via Unicast über den Pfad in der Baumstruktur an das Mesh-Portal (930) überträgt, um das Mesh-Portal (930) anzufordern, die Mitteilung über eine bestehende Verbindung einzufügen.
  8. Vorrichtung gemäß einem der Ansprüche 5 bis 7, wobei das drahtlose Mesh-Netzwerk (920) ein drahtloses Hybrid-Mesh-Protokoll (Hybrid Wireless Mesh Protocol (HWMP)) einschließlich eines Ad-hoc-Abstandsvektor-Routing-Protokolls auf Abruf (Ad hoc On-demand Distance Vector (AODV)) verwendet.
  9. Verfahren zur Erhaltung einer Baumstruktur durch ein Mesh-Portal (930), das als ein Wurzelknoten in einem drahtlosen Mesh-Netzwerk (920), in dem Knoten, außer Stationen, durch ein proaktives Routing-Protokoll die Baumstruktur bilden, bestimmt ist, wobei es sich bei dem Mesh-Portal (930) um einen Knoten, der das Mesh-Netzwerk (920) mit einem externen Netzwerk verbindet, handelt, wobei das Verfahren umfasst:
    (a) Bestimmen, ob es sich bei einer empfangenen, von einem Mesh-Zugangspunkt (910) stammenden Mitteilung um eine Mitteilung über eine getrennte Verbindung oder um eine Mitteilung über eine bestehende Verbindung einer Station (1) in Bezug auf den Mesh-Zugangspunkt handelt; und
    (b) basierend auf dem Ergebnis der Bestimmung, wahlweise Einfügen der empfangenen Mitteilung in eine Wurzelankündigungsmitteilung,welche regelmäßig von dem Mesh-Portal (930) an das drahtlose Mesh-Netzwerk (920) übertragen wird, wobei es sich bei der Wurzelankündigungsmitteilung um ein Paket handelt, das verwendet wird, um die Baumstruktur für das Mesh-Portal, das als Wurzelknoten der Baumstruktur bestimmt worden ist, zu erhalten.
  10. Verfahren gemäß Anspruch 9, wobei in Schritt (b), falls ein vorbestimmter Zeitraum abläuft, die empfangene Mitteilung nicht mehr in die regelmäßig übertragene Mitteilung eingefügt wird.
  11. Verfahren gemäß Anspruch 9 oder 10, wobei das drahtlose Mesh-Netzwerk (920) ein drahtloses Hybrid-Mesh-Protokoll (Hybrid Wireless Mesh Protocol (HWMP)) einschließlich eines Ad-hoc-Abstandsvektor-Routing-Protokolls auf Abruf (Ad hoc On-demand Distance Vector (AODV)) verwendet.
  12. Computerlesbares Speichermedium, das Anweisungen umfasst, die, wenn sie von einem Computer ausgeführt werden, den Computer dazu veranlassen, das Verfahren gemäß einem der Ansprüche 9 bis 11 auszuführen.
  13. Mesh-Portal-Vorrichtung (930), die als ein Wurzelknoten in einem drahtlosen Mesh-Netzwerk (920), in dem Knoten, außer Stationen, durch ein proaktives Routing-Protokoll die Baumstruktur bilden, bestimmt ist, wobei es sich bei dem Mesh-Portal (930) um einen Knoten, der das drahtlose Mesh-Netzwerk (920) mit einem externen Netzwerk verbindet, handelt, und wobei das Mesh-Portal umfasst:
    eine Bestimmungseinheit (932), die bestimmt, ob es sich bei einer empfangenen, von einem Mesh-Zugangspunkt (910) stammenden Mitteilung um eine Mitteilung über eine getrennte Verbindung oder um eine Mitteilung über eine bestehende Verbindung einer Station (1) handelt; und
    eine Mitteilungsverarbeitungseinheit (933), die basierend auf dem festgestellten Ergebnis, wahlweise die empfangene Mitteilung in eine Wurzelankündigungsmitteilung, welche regelmäßig von dem Mesh-Portal (930) an das drahtlose Mesh-Netzwerk (920) übertragen wird, einfügt, wobei es sich bei der Wurzelankündigungsmitteilung um ein Paket handelt, das verwendet wird, um die Baumstruktur für das Mesh-Portal, das als Wurzelknoten der Baumstruktur bestimmt worden ist, zu erhalten.
  14. Vorrichtung gemäß Anspruch 13, wobei die Mitteilungsverarbeitungseinheit (933) die empfangene Mitteilung nicht mehr in die regelmäßig übertragene Mitteilung einfügt, falls ein vorbestimmter Zeitraum abläuft.
  15. Vorrichtung gemäß Anspruch 13 oder 14, wobei das drahtlose Mesh-Netzwerk (920) ein drahtloses Hybrid-Mesh-Protokoll (Hybrid Wireless Mesh Protocol (HWMP)) einschließlich eines Ad-hoc-Abstandsvektor-Routing-Protokolls auf Abruf (Ad hoc On-demand Distance Vector (AODV)) verwendet.
EP07101928.5A 2006-02-10 2007-02-07 Verfahren und Vorrichtung zum Übertragen von Informatioenn an eine Station in einem drahtlosen Maschennetzwerk Active EP1819109B1 (de)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR20060013006A KR100772397B1 (ko) 2006-02-10 2006-02-10 무선 메쉬 네트워크에서 스테이션 정보를 전달하는 방법 및장치

Publications (2)

Publication Number Publication Date
EP1819109A1 EP1819109A1 (de) 2007-08-15
EP1819109B1 true EP1819109B1 (de) 2017-10-25

Family

ID=38024332

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07101928.5A Active EP1819109B1 (de) 2006-02-10 2007-02-07 Verfahren und Vorrichtung zum Übertragen von Informatioenn an eine Station in einem drahtlosen Maschennetzwerk

Country Status (5)

Country Link
US (1) US8811357B2 (de)
EP (1) EP1819109B1 (de)
JP (1) JP4783305B2 (de)
KR (1) KR100772397B1 (de)
CN (1) CN100508472C (de)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8223658B2 (en) * 2007-04-10 2012-07-17 Siemens Enterprise Communications Gmbh & Co. Kg Method for operating a mesh-type network, particularly as defined in an IEEE 802.11S standard, formed by a plurality of network nodes
JP4586854B2 (ja) 2008-02-05 2010-11-24 ソニー株式会社 表示生成装置、表示生成方法、プログラム、および無線通信システム
JP5078659B2 (ja) * 2008-02-19 2012-11-21 キヤノン株式会社 通信装置、通信装置の通信方法、及びコンピュータプログラム
JP5180636B2 (ja) 2008-03-14 2013-04-10 キヤノン株式会社 通信装置及びその通信制御方法
KR101048016B1 (ko) * 2009-02-13 2011-07-13 이화여자대학교 산학협력단 피투피 오버레이 네트워크를 형성하는 방법과 피투피 오버레이 네트워크를 위한 단말, 그리고 피투피 오버레이 네트워크를 관리하는 방법 및 장치
KR101049081B1 (ko) * 2010-12-06 2011-07-15 엘아이지넥스원 주식회사 전송 속도를 고려한 애드혹 네트워크에서의 라우팅 방법 및 라우팅 시스템
JP2012195774A (ja) * 2011-03-16 2012-10-11 Toshiba Corp ノード及びプログラム
KR20130135489A (ko) 2012-06-01 2013-12-11 한국전자통신연구원 중계전송 멀티캐스트 네트워크에서 멀티캐스트 에이전트에게 매개변수를 전송하는 방법 및 장치
WO2015139026A2 (en) 2014-03-14 2015-09-17 Go Tenna Inc. System and method for digital communication between computing devices
CN105025529B (zh) * 2015-05-30 2019-04-05 Oppo广东移动通信有限公司 一种切换接入点的方法及无线音箱
CN112995043B (zh) * 2019-12-17 2023-04-25 阿里巴巴集团控股有限公司 无线网格网络中的信息处理方法、装置及电子设备

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
ATE208109T1 (de) 1993-07-30 2001-11-15 Ibm Verfahren und gerät zur automatischen verteilung einer netztopologie in haupt- und nebentopologie
JPH09219702A (ja) 1996-02-14 1997-08-19 Nec Corp メッシュ構成の空き経路の検索方法
US7327683B2 (en) * 2000-03-16 2008-02-05 Sri International Method and apparatus for disseminating topology information and for discovering new neighboring nodes
US7203743B2 (en) 2001-12-28 2007-04-10 Nortel Networks Limited Hierarchical tree-based protection scheme for mesh networks
KR100424620B1 (ko) * 2002-03-27 2004-03-25 삼성전자주식회사 무선 근거리 네트워크에서 이동단말의 서브네트워크간이동성을 지원하기 위한 장치 및 방법
KR100485355B1 (ko) * 2002-09-17 2005-04-28 한국전자통신연구원 무선랜에서의 분산 시스템간 핸드오프 방법
KR100611125B1 (ko) * 2003-05-09 2006-08-10 삼성전자주식회사 애드 혹 네트워크에서 트리구조를 이용한 최적 라우팅경로 설정 장치 및 방법
US7480248B2 (en) 2003-08-22 2009-01-20 Samsung Electronics Co., Ltd. Apparatus and method for determining aggregated link costs in a mobile ad hoc network
KR100590762B1 (ko) * 2003-12-02 2006-06-15 한국전자통신연구원 ＩＰｖ6 기반 인터넷망 시스템 및 상기 인터넷망시스템에서 이동노드의 이동 감지 방법
US7626967B2 (en) * 2005-01-05 2009-12-01 Intel Corporation Methods and apparatus for providing a transparent bridge associated with a wireless mesh network
US20070110024A1 (en) * 2005-11-14 2007-05-17 Cisco Technology, Inc. System and method for spanning tree cross routes
US7894408B2 (en) * 2006-05-12 2011-02-22 Motorola Solutions, Inc. System and method for distributing proxying error information in wireless networks

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
CN101026508A (zh) 2007-08-29
CN100508472C (zh) 2009-07-01
JP2007215179A (ja) 2007-08-23
JP4783305B2 (ja) 2011-09-28
US8811357B2 (en) 2014-08-19
KR100772397B1 (ko) 2007-11-01
KR20070081228A (ko) 2007-08-16
US20070189192A1 (en) 2007-08-16
EP1819109A1 (de) 2007-08-15

Similar Documents

Publication Publication Date Title
EP1819109B1 (de) Verfahren und Vorrichtung zum Übertragen von Informatioenn an eine Station in einem drahtlosen Maschennetzwerk
Jain et al. Geographical routing using partial information for wireless ad hoc networks
KR100644691B1 (ko) 확장된 무선 랜에서 프레임을 전달하는 방법 및 장치
US8126470B2 (en) Topology and route discovery and management for relay networks
EP1717998B1 (de) Verfahren und vorrichtung zum verteilen von mobilstationsinformationen in einem drahtlosen maschennetz
KR101423331B1 (ko) 하드웨어 주소를 기반으로 한 이동 애드 혹 네트워크라우팅 시스템, 방법 및 컴퓨터 판독 가능한 매체
JP2006314102A (ja) 拡張された無線ランで移動ノードをグループ化するための方法及び装置
US10716048B2 (en) Detecting critical links in bluetooth mesh networks
JP2006074790A (ja) 移動アドホクネットワークでの最適方向−基盤フラッディング方法
CN102711207B (zh) 一种用于跨洋航空通信的路由选择方法
KR100833506B1 (ko) 후보 노드를 이용한 ａｏｄｖ 경로복구방법 및 그 장치
US20080279198A1 (en) Method for the Transmission of Information in a Communication System Using a Path
CN101409905A (zh) 一种基于任播方式的移动多跳分组无线网络路由方法
US9374849B2 (en) Node and link formation method
JP2009077133A (ja) 無線通信装置および無線通信システム
CN104184829B (zh) 车辆自组织网络中基于内容完整性和位置信息的路由方法
Chavan et al. Zone based effective location aided routing protocol for MANET
US11246081B2 (en) Detecting critical links in bluetooth mesh networks
Hauck et al. Babel multi-hop routing for TinyOS low-power devices
US20070021064A1 (en) Routing method for an ad hoc networks
Prasad Mahapatra et al. Performance analysis of mobile ad hoc routing protocols using extensive metrics
Kim et al. Multipath-Based Reliable Routing Protocol with Fast-Recovery of Failures on MANETs
Jayaraj et al. Topology discovery and modified Tabu search for efficient routing in wireless ad hoc networks
Yu et al. A link-state-aware ad hoc on-demand distance vector (AODV) routing protocol for mobile ad hoc networks
JAYASRI NETWORK SURVEILLANCE BASED DATA TRANSFERENCE IN COGNITIVE RADIO NETWORK WITH THE COMPARISON OF DIFFERENT ROUTING PROTOCOLS

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20070207

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK YU

17Q First examination report despatched

Effective date: 20071005

AKX Designation fees paid

Designated state(s): DE FI FR GB IT NL

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602007052779

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0012560000

Ipc: H04L0012700000

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 12/70 20130101AFI20170124BHEP

INTG Intention to grant announced

Effective date: 20170222

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SAMSUNG ELECTRONICS CO., LTD.

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAJ Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR1

GRAL Information related to payment of fee for publishing/printing deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR3

INTC Intention to grant announced (deleted)
GRAR Information related to intention to grant a patent recorded

Free format text: ORIGINAL CODE: EPIDOSNIGR71

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FI FR GB IT NL

INTG Intention to grant announced

Effective date: 20170915

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602007052779

Country of ref document: DE

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 12

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20171025

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171025

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171025

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602007052779

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20171025

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20180726

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230519

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240122

Year of fee payment: 18

Ref country code: GB

Payment date: 20240122

Year of fee payment: 18

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20240123

Year of fee payment: 18