WO2001041378A1 - Diffusion comme mecanisme de declenchement pour determiner un routage - Google Patents

Diffusion comme mecanisme de declenchement pour determiner un routage Download PDF

Info

Publication number
WO2001041378A1
WO2001041378A1 PCT/SE2000/002447 SE0002447W WO0141378A1 WO 2001041378 A1 WO2001041378 A1 WO 2001041378A1 SE 0002447 W SE0002447 W SE 0002447W WO 0141378 A1 WO0141378 A1 WO 0141378A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
message
route
request
broadcast message
Prior art date
Application number
PCT/SE2000/002447
Other languages
English (en)
Inventor
Tony Larsson
Johan Rune
Johan Sörensen
Original Assignee
Telefonaktiebolaget L M Ericsson (Publ)
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
Priority claimed from US09/455,460 external-priority patent/US6704293B1/en
Application filed by Telefonaktiebolaget L M Ericsson (Publ) filed Critical Telefonaktiebolaget L M Ericsson (Publ)
Priority to EP00983642A priority Critical patent/EP1250777A1/fr
Priority to AU20372/01A priority patent/AU2037201A/en
Priority to JP2001541192A priority patent/JP2003516034A/ja
Publication of WO2001041378A1 publication Critical patent/WO2001041378A1/fr

Links

Classifications

    • 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/26—Route discovery packet
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • 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
    • 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/28—Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/16—Discovering, processing access restriction or access information
    • 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 present invention relates to ad-hoc networks. More particularly, the present invention relates to routing in ad-hoc networks.
  • ad-hoc networks are dynamic. An ad-hoc network is formed when a number of nodes decide to join together to form a
  • Bluetooth is an exemplary ad-hoc networking technology .
  • Bluetooth is an open specification for wireless communication of both voice and data. It is based on a short-range, universal radio link, and it provides a mechanism to form small ad -hoc groupings of connected devices, without a fixed network infrastructure, including such devices as printers, PDAs, desktop computers, FAX machines, keyboards, joysticks, telephones or virtually any digital device.
  • Bluetooth operates in the unlicenced 2.4 GHz Industrial-Scientific-Medical (ISM) band.
  • FIG. 1 illustrates a Bluetooth piconet.
  • a piconet is a collection of digital devices, such as any of those mentioned above, connected using Bluetooth technology in an ad-hoc fashion.
  • a piconet is initially formed with two connected devices, herein referred to as Bluetooth devices.
  • a piconet can include up to eight Bluetooth devices.
  • each piconet for example piconet 100, there exists one master Bluetooth unit and one or more slave Bluetooth units.
  • Bluetooth unit 101 is a master unit and unit 102 is a Bluetooth slave unit.
  • FIG. 2 illustrates a piconet with a master unit 201 and a plurality of slave units 202-208 arranged in a star network topology. If slave unit 202 wishes to communicate with slave unit 206, slave unit 202 would have to transmit the information it wished to communicate to master unit 201. Master unit 201 would then transmits the information to slave unit 206.
  • a scatternet is formed by multiple independent and unsynchronized piconets.
  • Figure 3 illustrates an exemplary scatternet 300.
  • piconet 1 includes a master node 303 and the slave nodes 301 , 302 and 304; piconet 2 includes the master node 305 and the slave nodes 304, 306 and 307; and piconet 3 includes the master node 309 and the slave nodes 308, 310 and 311.
  • nodes which are members of more than one piconet.
  • Such nodes are herein referred to as forwarding nodes. If, for example, node 301 wishes to communicate with node 310, then nodes 304 and 308 might act as forwarding nodes by forwarding the connection between the two piconets and in particular between nodes 301 and 310.
  • node 301 transfers the information to the master node of piconet 1 node 303.
  • Master node 303 transmits the information to forwarding node 304.
  • Forwarding node 304 then forwards the information to master node 305, which in turn, transmits the information to forwarding node 308.
  • Forwarding node 308 forwards the information to master node 309 which transmits the information to the destination node 310.
  • FIG. 4a illustrates the protocol layers of two conventional Bluetooth units.
  • both units 401 and 402 include a high level protocol or application 411. They also include a network layer 421 , a data link layer including a logical link control and adaptation protocol (L2CAP) 441 and link manager protocol (LMP), and the physical layer including a baseband component.
  • L2CAP logical link control and adaptation protocol
  • LMP link manager protocol
  • the protocols which govern the formation and/or updating of routes in an ad-hoc network may be classified as either proactive or reactive.
  • Proactive routing protocols attempt to update and maintain routes between nodes, including routes which are not currently in use.
  • proactive routing protocols react to network topology changes, even if there is no current traffic which is affected by the topology change.
  • To update and maintain the routes between nodes in an ad-hoc network employing proactive routing each node periodically transmits control information to other nodes in the network.
  • This requires a large amount of signaling, which consumes precious bandwidth and leads to network congestion.
  • the network congestion results in greater transmission delays for packets traveling through the network.
  • reactive routing protocols In contrast to proactive routing protocols, reactive routing protocols establish routes only when there is an immediate need to transmit packets. Moreover, reactive routing protocols only maintain information about routes which are currently being used for transmitting data packets. Accordingly, reactive protocols result in less network signaling, and hence, less network congestion and less delay due to the congestion as compared to proactive routing protocols.
  • Routing in ad-hoc networks can be performed using either source routing or distance vector routing.
  • a route request message is issued by a source node when the source node requires a new route to a destination node.
  • source routing in response to the route request message, an entire route from the source node to the destination node is received by the source node in the reply message. Accordingly, only the source needs to keep track of the route between the source node and the destination node.
  • packets are sent from the source node to the destination node the entire route is specified in every packet.
  • each intermediate node stores route information in routing tables. Accordingly, the source node will only need to place the destination node address in each packet for the packet to reach the destination node.
  • FIG. 5 illustrates conventional source routing techniques.
  • the source node In step 505 the source node generates a message.
  • the node determines whether the message is a broadcast message or a unicast message. If the message is a broadcast message, in accordance with the "Broadcast" path out of decision step 510, then the source node broadcasts the packets to its neighbor nodes.
  • the source node will send the unicast message, which includes the complete route in the message, to the node specified in the source node's routing table in accordance with step 525.
  • a route to the destination node is not known, in accordance with the "No" path out of decision step 520, then the source node broadcasts a request for route message in accordance with step 530.
  • a neighbor node receives the request for route message.
  • the neighbor node determines whether it has already processed the request for route message. The neighbor node makes this determination by examining the addresses of the nodes in the route contained in the request for route message to determine if the node's own address is in the route contained in the request for route message. If distance vector routing is employed a neighbor node would make this determination based upon a source node address and broadcast identifier. If the neighbor node has already processed the request for route message, in accordance with the "Yes" path out of decision step 540, the node will drop the message in accordance with step 545. If the node has not already processed the message, in accordance with the
  • step 540 the node adds its own address to the request for route message in accordance with step 550. If distance vector routing is employed then the node would store the source node address and broadcast identifier. In step 555 the node rebroadcasts the request for route message to its neighbor nodes. In step 560 the node determines whether it is the destination node. If the node determines that it is not the destination node, in accordance with the "No" path out of decision step 560, then the node is done with its processing for this message.
  • the node will send a response back to the source node over the route indicated in the message received by the destination node in accordance with step 565.
  • the source node sends the unicast message to the destination node over the newly established route.
  • the source node will only request a new route when the actual route being used is broken.
  • the first type of broadcast message are messages which the source node sends to spread information to other nodes in the network. When this type of broadcast message is sent the source does not expect to receive a reply message.
  • the second type of broadcast message are messages which the source node expects to receive a reply message from one or more network nodes.
  • nodes may change their location in the network. When the node changes its location, the node may not have the same address as the node had at its prior location.
  • the source node may first obtain its own network address, resolve the name of the destination, obtain the hardware address of the destination node and determine a route to the destination node.
  • IP Internet Protocol
  • IP there are several different broadcast messages that a source node generates where the source node expects a reply from one or more node(s) in the network.
  • IP three exemplary types of broadcast messages where the source expects a reply are dynamic host configuration protocol (DHCP), name resolution and address resolution protocol.
  • DHCP is concerned with dynamic allocation of IP addresses to nodes. Name resolution is used to obtain the IP address when the name of the node is known.
  • ARP is used when the logical address of the node is known, e.g. , the IP address, but the hardware address, e.g. , the Ethernet address of the node, is not known.
  • the source node may have to perform a separate broadcast for DHCP, name resolution or ARP, and route discovery before the source node can begin to transmit data to the destination node.
  • These separate broadcasts result in delay in sending the information from the source node to the destination node. Sending these separate broadcasts also adds to the load of the network.
  • a method and/or an apparatus for determining a route from a source node to a destination node wherein a request for route broadcast message is used to discover and establish routes between the source node and destination node.
  • the source node generates a broadcast message for which the source node expects a reply message.
  • the broadcast message is placed in a request for route broadcast message.
  • the source node then broadcasts the request for route broadcast message to neighboring nodes.
  • each of the neighboring nodes it is determined whether the particular neighboring node is the node which generates a reply message. If the particular node is the node which generates a reply message then a response message to the request for route broadcast message is generated. The response message is sent to the source node over the route contained in the request for route broadcast message received by the node which generated the reply message. If distance vector routing is employed the response message would be sent to the source node over the temporary route stored in each neighboring node in a path between the source node and the node which generated the reply message. In a distance vector routing protocol, as the response message is sent from the node which generates the reply message to the source node a route is activated in each of the neighboring nodes in the route between the source node and the destination node.
  • a method and/or an apparatus for determining a route from a source node to another node wherein all nodes in the network include a network adaptation layer and a higher layer.
  • all nodes in the network include a network adaptation layer and a higher layer.
  • a broadcast message for which the source node expects a reply message is generated.
  • the message for which the source node expects a reply message is placed in a network adaptation layer request for route broadcast message.
  • the network adaptation layer request for route broadcast message is broadcast from the source node to neighboring nodes.
  • FIG. 1 illustrates an exemplary piconet
  • FIG. 2 illustrates an exemplary star-topology network
  • FIG. 3 illustrates an exemplary scatternet formed by a plurality of piconets
  • FIG. 4a illustrates the protocol layers of a conventional Bluetooth unit
  • FIG. 4b illustrates the protocol layers of a Bluetooth unit according to an exemplary embodiment of the present invention
  • FIG. 5 illustrates conventional source routing route discovery techniques
  • FIGs. 6a and 6b illustrate an exemplary method for performing route discovery using source routing techniques in an ad -hoc network
  • FIGs. 7a and 7b illustrate an exemplary method for combining a broadcast for which a source node expects a reply message with route discovery using source routing techniques in an ad-hoc network
  • FIGs. 8a and 8b illustrate another exemplary method for combining a broadcast for which a source node expects a reply message with route discovery using source routing techniques in an ad-hoc network
  • FIGs. 9a and 9b illustrate yet another exemplary method for combining a broadcast for which a source node expects a reply message with route discovery using source routing techniques in an ad-hoc network.
  • the present invention is directed to minimizing the amount of broadcast messages sent during route discovery.
  • the present invention accomplishes this using source routing techniques and by combining broadcast messages which the source node expects a reply message with broadcast messages for route discovery.
  • the present invention accomplishes this using distance vector routing techniques and by combining broadcast messages which the source note expects a reply message with broadcast messages for route discovery. In so doing, the broadcast messages for which a source node expects a reply message can also be used to support route discovery.
  • the present invention is described as a route discovery technique for use in a Bluetooth scatternet.
  • the present invention is applicable to wireline or wireless networks, fixed networks and other types of ad-hoc networks.
  • Every broadcast message should contain a broadcast identifier in the network adaptation layer header.
  • the broadcast messages should contain a source address which uniquely identifies the source.
  • BD ADDR Bluetooth Device Address
  • the broadcast identifier together with the source address will uniquely identify the particular broadcast.
  • Figures 6a and 6b illustrate an exemplary method for using broadcast messages for route discovery.
  • the source node In step 602 the source node generates a broadcast message.
  • the source node determines whether the broadcast message is the type for which the source node expects a reply message. If the source node does not expect a reply message, in accordance with the "No" path out of decision step 604, the source node will broadcast the message to all neighbor nodes in accordance with step 606.
  • the source node piggybacks the broadcast message in a request for route broadcast message in accordance with step 608.
  • the source node cannot determine whether it expects a reply message in response to the broadcast message then the source node will piggyback the broadcast message in a request for route message in accordance with the "Yes" path out of decision step 604.
  • the source node broadcasts the request for route message to its neighbor nodes. For example, referring now to figure 3 , if node 303 were the source node then the broadcast message would be sent to nodes 301 , 302 and 304. Alternatively, the source node will only broadcast the request for route message to forwarding nodes .
  • step 617 the request for route message is received by a neighbor node.
  • step 620 the neighbor node determines whether the node has already processed the request for route message. Since source routing packets contain the entire route for the packet, the node can determine whether it has already processed the request for route message by examining the message to determine if the node's own address is contained in the route in the request for route message. Alternatively, if distance vector routing is employed each node has a broadcast buffer which stores the source address and broadcast identifier pair. The broadcast buffer also stores the time which the message has been received to determine if the node has processed the broadcast message within a predetermined period of time.
  • the predetermined time period is set long enough that the node will not rebroadcast a message it has already rebroadcast, but short enough that the buffer does not require an extensive amount of memory. If the node's own address is contained in the request for route message, or if distance vector routing is employed if the source address and broadcast identifier pair of the received message matches one of the source address and broadcast identifier pairs stored in the broadcast buffer, in accordance with the "Yes" path out of decision step 620, the node will drop the message in accordance with step 625.
  • the node determines whether the piggybacked data indicates that the node is the destination node in accordance with step 640. If distance vector routing is employed, if the node determines that the request for route message has not been previously processed the node will store the source address and broadcast identifier pair in the broadcast buffer along with the time that the request for route message was received by the node and the node would store a temporary route back to the source prior to examining the piggybacked data.
  • the node adds it own address to the route contained in the request for route message in accordance with step 658. If distance vector routing is employed and if the piggyback data does not indicate that the node is the destination node, the node replaces its address in the request for route message. In step 660 the node rebroadcasts the request for route message to its neighbor nodes. This processing occurs in each node which receives the broadcast message as illustrated by the return path from step 660 to step 617.
  • the node will piggyback a reply message in the route response message in accordance with step 642.
  • the node will send the route response to the next node in the route indicated by the route stored in the message. If distance vector routing is employed the node will send the route response to the next node in the temporary route.
  • the next node determines whether it is the source node by examining the address in the message. If the node is not the source node, in accordance with the "No" path out of decision step 665, the node sends the route response message to the next node indicated by the route in the route response message.
  • the node activates the temporary route and sends the route response message to the next node in the temporary route. If the node is the source node, in accordance with the "Yes" path out of decision step 665, the node begins sending data over the new route identified in the route response message. If distance vector routing is employed and if the node is the source node the node activates the route and begins sending data over the new route. Since a period of time will have passed between the time that the source node requested a route to the destination and the source node has received the route response, the source node can buffer the data packets which it desires to transmit over the route. Alternatively, the source node can simply drop the packets.
  • Bluetooth Since the destination node does not rebroadcast the request to surrounding nodes, the surrounding nodes will not be disturbed by the route request broadcast. This will remove some of the load on the network. It would be desirable to support IP in a Bluetooth scatternet. However, since Bluetooth requires the slave nodes to communicate through a master node to transmit data to other nodes, Bluetooth does not provide a true shared network. Accordingly, Bluetooth cannot currently support IP.
  • FIG. 4b illustrates exemplary Bluetooth units which can implement IP.
  • the Bluetooth units of figure 4b are similar to the Bluetooth units of figure 4a with the exception that the Bluetooth units of figure 4b include a network adaptation layers 461 and 462.
  • the network adaptation layer uses the network adaptation layer to implement an IP subnet. Since the IP protocol layer assumes that there is a shared network, the network adaptation layer emulates a shared network, i.e. , a broadcast network.
  • the network adaptation layer provides a routing mechanism to route information within a scatternet while emulating towards the IP layer that the scatternet is actually a single shared network medium. Regardless of the routing mechanism which is implemented, the network adaptation layer uses the above described forwarding nodes to transfer information from one piconet to another piconet.
  • Figures 7a and 7b illustrate an exemplary method for triggering route discovery in an IP network, which operates according to a source routing protocol, using DHCP, name resolution or ARP broadcast messages.
  • a source node broadcasts messages for DHCP, name resolution or ARP the source node expects a reply message.
  • the combination of route discovery with DHCP, name resolution or ARP results in less messages traversing the network. Accordingly, the messages described in figure 7 are merely exemplary and the method is equally applicable to other types of broadcast messages which the source node expects a reply message.
  • the source node In step 705 the source node generates the ARP, name resolution or DHCP broadcast message and delivers the message to the network adaptation layer.
  • the network adaptation layer piggybacks the ARP, name resolution or DHCP broadcast message in a network adaptation layer route request broadcast message.
  • a piggyback indicator can be inserted in the network adaptation layer route request broadcast message.
  • a length indicator which indicates a length longer than the normal fixed length will implicitly indicate that the request contains piggyback data.
  • step 715 the source node will broadcast the network adaptation layer route request message to its neighboring nodes.
  • step 717 the node receives the request for route message.
  • step 720 a neighboring node determines whether the request for route discovery message has already been processed. The neighbor node determines whether it has already processed the message by determining whether the node's own address is in the route included in the broadcast message. If the request for route discovery message has already been processed, in accordance with the "Yes" path out of decision step 720, the node drops the message in accordance with step 725.
  • the node adds its own address to the route included in the request for route message in accordance with step 727. If distance vector routing is employed and if the node has not already processed the request for route message the node will store the source node address in broadcast identifier pair and a temporary route back to the source node. In step 732 the piggybacked data is sent up to the higher protocol layers. In step 735 the node will rebroadcast the message to all neighboring nodes. In step 740 the node which rebroadcast the message will determine whether it is the node that generates a reply message to the piggybacked broadcast message.
  • the node If the node is not the node that generates a reply message to the piggybacked broadcast message, in accordance with the "No" path out of decision block 740, then the node does not perform any further processing with regard to this message in accordance with step 745. If the node which rebroadcast the message is the node which generates a reply message to the piggybacked broadcast message, in accordance with the "Yes" path out of decision block 740, then the node will generate a reply to the ARP, name resolution or DHCP message and piggyback the reply in a network adaptation layer response message in accordance with step 750.
  • the reply to the ARP, name resolution or DHCP message will be piggybacked by the node in a manner similar to the manner that the source node piggybacks the ARP, name resolution or DHCP request message.
  • the destination node sends the network adaptation layer route response message back over the route contained in the request for route message. If distance vector routing is employed the destination node activates the route in the node and sends the network adaptation layer route response message back over the temporary route.
  • a node in the route included in the route response message receives the route response message and determines whether it is the source node. If distance vector routing is employed then a node in the temporary route will receive the message. If the node is the source node, in accordance with the "Yes" path out of decision step 765, the node sends the piggybacked data up the protocol stack and stores the route to the destination in accordance with step 767. The source node then begins sending data over the new route in accordance with step 769.
  • the node forwards the route response message to the next node in the route indicated in the route response message in accordance with step 765. If distance vector routing is employed and the node is not the source node, the node will activate the route in the node and forward the route response message to the next node in the temporary route. The next node then determines whether it is the source node in accordance with step 765. This processing continues in each node along the route indicated in the route response message until the source node receives the route response message. If distance vector routing is employed, this processing continues in each node along the temporary route.
  • the protocol layers above the network adaptation layer e.g. , ARP, will issue the broadcast again and the method is repeated.
  • figures 7a and 7b illustrate an exemplary embodiment where the source node is generating broadcast messages that the source node knows it will expect a reply message
  • a step such as step 604 of figure 6, where the source node determines whether the broadcast message is the type of message which the source node expects a reply is not included in this figure.
  • the source node will piggyback the broadcast message in a request for route message.
  • step 640 of figure 6 if it is determined that the node which received the request for route broadcast message is the destination node then the node does not rebroadcast the request for route broadcast message.
  • the network adaptation layer request for route message is rebroadcast in step 735 before the node determines whether it is the node which generates a reply message. Accordingly, in the method of figure 7 the network adaptation layer will rebroadcast the network adaptation layer request for route message even if the node is the node which generates a reply message.
  • the rebroadcasting is due to the fact that the network adaptation layer does not know if some of the higher protocol layers will generate a reply to the ARP, name resolution or DHCP message. Accordingly, in the method of figure 7 the network adaptation layer will not be dependent upon the higher protocol layers. If the network adaptation layer in the nodes were dependent upon the higher protocol layers a delay should be introduced in the network adaptation layer before rebroadcasting the route request from the node. However, this allows the nodes to prevent further flooding of the network by the broadcast messages. To avoid further flooding of the network the higher protocol layers could inform the network adaptation layer whether the higher layers are broadcasting to trigger route discovery. Alternatively, the network adaptation layer can be designed to recognize the higher layer broadcasts and differentiate between those broadcasts that trigger route discovery, e.g.
  • FIGs 8a, 8b, 9a and 9b illustrate methods which allow the network adaptation layer in the node to determine whether the node which received the network adaptation layer request for route broadcast message with piggybacked data is the node which generates the reply message.
  • the steps of figures 8 and 9 are similar to the steps of figure 7 with steps 735, 740 and 745 replaced with four new steps.
  • steps 735, 740 and 745 are replaced by steps 836, 838, 839 and 840.
  • step 836 the node sets a timer and the network adaptation layer of the node will examine the data from the higher protocol layers.
  • step 838 it is determined whether the network adaptation layer recognizes a reply message to a DHCP, name resolution or ARP broadcast message. If the network adaptation layer recognizes a reply message, in accordance with the "Yes" path out of decision step 838, the network adaptation layer piggybacks the reply message in a route response message in accordance with step 750. The remainder of the method operates in a similar manner to that described above with regard to figure 7. If the network adaptation layer does not recognize a reply message, in accordance with the "No" path out of decision step 838, it is determined whether the timer has expired in accordance with step 839.
  • step 839 If the timer has not expired, in accordance with the "No" path out of decision step 839, the method returns to step 836 where the network adaption layer continues to examine the data from the higher protocol layers. If the timer has expired, in accordance with the "Yes" path out of decision step 839, then the node rebroadcasts the data in accordance with step 840. The method continues to step 717 where the next neighbor node
  • step 936 the node sets a timer while the higher protocol layers receive the piggybacked data.
  • step 940 it is determined whether the higher protocol layers have indicated that a reply to the piggybacked data has been generated. If the higher layers have indicated that a reply to the piggybacked data has been generated, in accordance with the "Yes" path out of decision step 940, then the reply message is piggybacked in the network adaption layer response message in accordance with step 750. Again the remainder of the method illustrated in figure 9 operates in a similar manner to that of the method described in figure 7.
  • step 940 it is determined whether the timer has expired in accordance with step 942. If the timer has not expired, in accordance with the "No" path out of decision step 942, then the higher layers continue to process the piggyback data in accordance with step 936. If the timer has expired, in accordance with the "Yes" path out of decision step 942, then the node rebroadcasts the message in accordance with step 945. In step 717 the processing continues as another neighbor node receives the broadcast message.
  • FIGS 6-9 illustrate the exemplary methods as processing the broadcast message at one neighbor node at a time
  • the broadcast messages will be processed as the neighbor nodes receive the broadcast message.
  • the broadcast message may be processed by some or all of the neighbor nodes at the same time or during similar time periods.
  • Another alternative embodiment is to only trigger route discovery for ARP broadcast messages. To implement this requires performing the routing at the network adaptation layer. Accordingly, the network adaptation layer would be ARP dependent, meaning that the network adaptation layer would recognize ARP request/reply messages. For example, if the network adaptation layer uses Ethernet encapsulation, the network adaptation layer would examine the type field in the Ethernet frame to determine whether the message is an ARP request or ARP reply message. The difference between this embodiment and prior embodiments takes place at the node which generates the ARP reply message. According to this embodiment, the network application layer will detect the ARP response from the higher layers as an ARP message with a unicast destination address.
  • the network application layer will detect ARP requests as ARP messages with the broadcast address as the destination address.
  • the ARP requests are detected as Ethernet frames with the type set to ARP and the destination address set to the Ethernet broadcast address.
  • ARP responses would be detected as Ethernet frames with the type set to ARP and the destination address set to a unicast Ethernet address.
  • the nodes typically do not determine whether there is a cached route to the destination stored in the node.
  • ARP name resolution and DHCP
  • the node which generates the reply message to the ARP, name resolution or DHCP may be the only node which can provide the information required for the reply message. Accordingly, an intermediate node with a cached route may not be able to provide this required information.
  • the broadcast is from a higher protocol layer the node may not known which nodes will be able to respond.
  • the network may be implemented such that an intermediate node has a cached reply message to the ARP, name resolution or DHCP message. If this is implemented, the source node may receive two response messages to the request for route message. The first message may come from an intermediate node with the cached reply to the ARP, name resolution or DHCP message and the second response may come from the destination containing the route which has been established.
  • route discovery By combining route discovery with other broadcast messages the load on the network is decreased. Further, the initial route to the destination node will be created faster because of the combination of route discovery with other broadcast messages. This results in lower buffering time at the source node.
  • the techniques and hardware implementations associated with route discovery described above provide a simple, efficient, and precise way of identifying a route between a source node and destination node and while sending another broadcast message for which the source node expects a reply message. Consequently, the present invention conserves valuable network resources as compared with prior techniques.

Landscapes

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

Abstract

L'invention concerne un procédé et/ou un dispositif qui permet de placer un message à diffusion générale, pour lequel la source attend un message de retour, dans un message à diffusion générale afin de déterminer un routage. Le message combiné est diffusé dans tout le réseau ad hoc. Lorsque le message combiné à diffusion générale est reçu au noeud destinataire, le noeud destinataire produit un message de réponse incluant un message répondant au message à diffusion générale, attendu par le noeud source. Le message de réponse est renvoyé au noeud source par le routage utilisé par le message combiné à diffusion générale pour atteindre le noeud destinataire.
PCT/SE2000/002447 1999-12-06 2000-12-06 Diffusion comme mecanisme de declenchement pour determiner un routage WO2001041378A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP00983642A EP1250777A1 (fr) 1999-12-06 2000-12-06 Diffusion comme mecanisme de declenchement pour determiner un routage
AU20372/01A AU2037201A (en) 1999-12-06 2000-12-06 Broadcast as a triggering mechanism for route discovery
JP2001541192A JP2003516034A (ja) 1999-12-06 2000-12-06 ルート発見機構のトリガとしての同報通信

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US09/455,460 1999-12-06
US09/455,460 US6704293B1 (en) 1999-12-06 1999-12-06 Broadcast as a triggering mechanism for route discovery in ad-hoc networks
US68588000A 2000-10-11 2000-10-11
US09/685,880 2000-10-11

Publications (1)

Publication Number Publication Date
WO2001041378A1 true WO2001041378A1 (fr) 2001-06-07

Family

ID=27037868

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE2000/002447 WO2001041378A1 (fr) 1999-12-06 2000-12-06 Diffusion comme mecanisme de declenchement pour determiner un routage

Country Status (5)

Country Link
EP (1) EP1250777A1 (fr)
JP (1) JP2003516034A (fr)
CN (1) CN1408159A (fr)
AU (1) AU2037201A (fr)
WO (1) WO2001041378A1 (fr)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003299146A (ja) * 2002-02-01 2003-10-17 Canon Inc 無線通信装置
DE10309108A1 (de) * 2003-03-01 2004-09-16 Siemens Ag Verfahren und Basisstation zur Übertragung von Informationen in einem mittels Ad Hoc Verbindungen erweiterten zellularen Funkkommunikationssystem
DE10310586A1 (de) * 2003-03-11 2004-09-30 Siemens Ag Verfahren und netzseitige Einrichtung zur Ermittlung eines Pfades in einem Funkkommunikationssystem
CN100428711C (zh) * 2002-04-25 2008-10-22 三星电子株式会社 蓝牙按请求进行路由和网络形成的方法、及通信方法
US7596151B2 (en) 2003-05-02 2009-09-29 Samsung Electronics Co., Ltd. System and method for discovering path MTU in ad hoc network
US7916666B2 (en) 2007-04-03 2011-03-29 Itt Manufacturing Enterprises, Inc. Reliable broadcast protocol and apparatus for sensor networks
US7937088B2 (en) 2004-03-26 2011-05-03 Qualcomm Incorporated Routing communications in an ad hoc network
CN101051865B (zh) * 2007-03-26 2011-10-26 中兴通讯股份有限公司 在基带资源池与远端射频单元组成的网络上广播的方法
CN104285476A (zh) * 2012-05-01 2015-01-14 高通股份有限公司 用于配置无线网络中的连通性的系统和方法

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1475927A3 (fr) * 2003-05-09 2005-12-14 Samsung Electronics Co., Ltd. Procédé et appareil pour l'établissement d'une route optimale utilisant une topologie d'arbre
US7414977B2 (en) * 2003-11-25 2008-08-19 Mitsubishi Electric Research Laboratories, Inc. Power and delay sensitive ad-hoc communication networks
US7617300B2 (en) * 2004-03-12 2009-11-10 Microsoft Corporation Node matching in a dynamic, decentralized environment
EP1733528A1 (fr) * 2004-04-05 2006-12-20 TELEFONAKTIEBOLAGET LM ERICSSON (publ) Cette invention se rapporte a un procede, a un dispositif de communication et a un systeme pour le mappage a resolution d'adresses dans un reseau ad hoc multisaut sans fil
US7447796B2 (en) * 2004-12-17 2008-11-04 International Business Machines Corporation System, method and program product to route message packets
BRPI0520873B1 (pt) * 2005-11-09 2018-11-27 Thomson Licensing seleção de rota em redes sem fio
WO2008114327A1 (fr) * 2007-02-19 2008-09-25 Mitsubishi Electric Corporation Procede permettant de resoudre un probleme d'adresse
JP5406298B2 (ja) * 2008-08-11 2014-02-05 コーニンクレッカ フィリップス エヌ ヴェ 身体領域ネットワークにおいてグローバル・ビーコンの送信をスケジュールする方法
CN101562860B (zh) * 2009-05-22 2011-06-01 西安电子科技大学 基于mimo链路的路由寻址方法
CN102811076B (zh) * 2011-06-03 2016-06-29 希姆通信息技术（上海）有限公司 蓝牙连接方法
CN104469660B (zh) * 2014-11-20 2018-04-10 青岛歌尔声学科技有限公司 基于蓝牙的组网方法
CN105336013B (zh) * 2015-10-16 2018-10-09 江苏协信信息科技有限公司 一种通过信标广播实现点名的方法和系统
TWI584607B (zh) * 2016-01-27 2017-05-21 高瞻資訊股份有限公司 基於藍牙網路的端對端連線方法
CN106375491A (zh) * 2016-08-31 2017-02-01 浙江远望信息股份有限公司 一种发现网络设备的方法、装置及系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5056085A (en) * 1989-08-09 1991-10-08 Harris Corporation Flood-and-forward routing for broadcast packets in packet switching networks
EP0599764A1 (fr) * 1992-11-24 1994-06-01 International Business Machines Corporation Traitement distribué d'information d'acheminement dans des réseaux et sous-réseaux
US5740366A (en) * 1991-10-01 1998-04-14 Norand Corporation Communication network having a plurality of bridging nodes which transmit a beacon to terminal nodes in power saving state that it has messages awaiting delivery
EP0883265A2 (fr) * 1997-06-02 1998-12-09 Fujitsu Limited Equipement de transmission, système de transmission en réseau et procédé de transmission
EP0913965A1 (fr) * 1997-11-03 1999-05-06 Canon Kabushiki Kaisha Réduction du trafic de messages dans un réseau distribué

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5056085A (en) * 1989-08-09 1991-10-08 Harris Corporation Flood-and-forward routing for broadcast packets in packet switching networks
US5740366A (en) * 1991-10-01 1998-04-14 Norand Corporation Communication network having a plurality of bridging nodes which transmit a beacon to terminal nodes in power saving state that it has messages awaiting delivery
EP0599764A1 (fr) * 1992-11-24 1994-06-01 International Business Machines Corporation Traitement distribué d'information d'acheminement dans des réseaux et sous-réseaux
EP0883265A2 (fr) * 1997-06-02 1998-12-09 Fujitsu Limited Equipement de transmission, système de transmission en réseau et procédé de transmission
EP0913965A1 (fr) * 1997-11-03 1999-05-06 Canon Kabushiki Kaisha Réduction du trafic de messages dans un réseau distribué

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003299146A (ja) * 2002-02-01 2003-10-17 Canon Inc 無線通信装置
US7224802B2 (en) 2002-02-01 2007-05-29 Canon Kabushiki Kaisha Wireless communication device, and method for controlling the same, which authenticates partner device when connecting thereto
CN100428711C (zh) * 2002-04-25 2008-10-22 三星电子株式会社 蓝牙按请求进行路由和网络形成的方法、及通信方法
US8351339B2 (en) 2002-04-25 2013-01-08 Samsung Electronics Co., Ltd. Method for bluetooth on-demand routing and network formation, and communication method in bluetooth group ad hoc network
DE10309108A1 (de) * 2003-03-01 2004-09-16 Siemens Ag Verfahren und Basisstation zur Übertragung von Informationen in einem mittels Ad Hoc Verbindungen erweiterten zellularen Funkkommunikationssystem
DE10309108B4 (de) * 2003-03-01 2007-12-13 Nokia Siemens Networks Gmbh & Co.Kg Verfahren und Teilnehmerstation zur Übertragung von Informationen in einem mittels Ad Hoc Verbindungen erweiterten zellularen Funkkommunikationssystem
DE10310586B4 (de) * 2003-03-11 2005-05-25 Siemens Ag Verfahren und netzseitige Einrichtung zur Ermittlung eines Pfades in einem Funkkommunikationssystem
DE10310586A1 (de) * 2003-03-11 2004-09-30 Siemens Ag Verfahren und netzseitige Einrichtung zur Ermittlung eines Pfades in einem Funkkommunikationssystem
US7596151B2 (en) 2003-05-02 2009-09-29 Samsung Electronics Co., Ltd. System and method for discovering path MTU in ad hoc network
US7937088B2 (en) 2004-03-26 2011-05-03 Qualcomm Incorporated Routing communications in an ad hoc network
CN101051865B (zh) * 2007-03-26 2011-10-26 中兴通讯股份有限公司 在基带资源池与远端射频单元组成的网络上广播的方法
US7916666B2 (en) 2007-04-03 2011-03-29 Itt Manufacturing Enterprises, Inc. Reliable broadcast protocol and apparatus for sensor networks
CN104285476A (zh) * 2012-05-01 2015-01-14 高通股份有限公司 用于配置无线网络中的连通性的系统和方法

Also Published As

Publication number Publication date
AU2037201A (en) 2001-06-12
CN1408159A (zh) 2003-04-02
EP1250777A1 (fr) 2002-10-23
JP2003516034A (ja) 2003-05-07

Similar Documents

Publication Publication Date Title
US6704293B1 (en) Broadcast as a triggering mechanism for route discovery in ad-hoc networks
WO2001041378A1 (fr) Diffusion comme mecanisme de declenchement pour determiner un routage
US6535498B1 (en) Route updating in ad-hoc networks
KR100975046B1 (ko) Ａｄ-ｈｏｃ 피어 투 피어 네트워크의 정보를 자체전파하는 시스템 및 방법
US7061925B2 (en) System and method for decreasing latency in locating routes between nodes in a wireless communication network
KR100789773B1 (ko) 다중 홉 무선 근거리통신망에서 메쉬 네트워킹 자동 설정방법과, 가상 링크 설정 방법과, 패킷 전송 방법 및 이를위한 무선 단말기
KR100829655B1 (ko) 이동 ａｄ ｈｏｃ 네트워크용 이동 ｉｐ
KR100898680B1 (ko) 무선 네트워크에서 데이터를 라우팅하기 위해 무선네트워크에서 상이한 유형들의 노드들을 액세스 포인트노드들과 연관짓기 위한 시스템 및 방법
EP1381191B1 (fr) Procédé de recherche de noeud, noeud, système de communication mobile et programme d'ordinateur
EP1986380B1 (fr) Procede de transmission de paquet, noeud relais et noeud de reception
KR101203463B1 (ko) ＩＰｖ６ 기반 모바일 시스템에서 이웃 탐색을 제공하는장치 및 방법
TW200915787A (en) Method and system for providing network and routing protocols for utility services
CA2422715A1 (fr) Procedes et appareil de support de micromobilite dans un reseau d'acces radio
US8107448B2 (en) Apparatus for reducing signalling data bursts in mobile network
Hussain et al. SAAMAN: scalable address autoconfiguration in mobile ad hoc networks
KR100547110B1 (ko) 바인딩 업데이트 메시지 전송 방법 및 바인딩액크놀리지먼트 메시지 전송 방법
JP3806094B2 (ja) ルータ装置、ネットワークアドレス管理システム、ネットワークアドレス管理方法及びネットワークアドレス管理プログラム
US20080013538A1 (en) Method of transmitting neighbor discovery protocol message in IEEE 802.16/Wibro network
US7460511B2 (en) Device connectivity
CN109922442B (zh) 无线多跳网络与全连接网络的异构网络的地址解析方法
KR20040050425A (ko) 통신 노드의 배터리 잔량과 시그널 안정성을 고려한 이동적응망 라우팅 방법 및 그 장치
KR100757897B1 (ko) 인터넷 기반 이동망에서 수직적 핸드오버 방법 및 시스템
KR100639961B1 (ko) ＩＰｖ６ 이동 애드혹 네트워크의 인터넷 연결성을 위한확장 지원방법
JP2004214790A (ja) 制御メッセージの多重化方法およびシステム
KR20050001973A (ko) 모바일 에드혹 네트워크에서의 노드 네임 관리 시스템 및네임 관리 방법

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
ENP Entry into the national phase

Ref country code: JP

Ref document number: 2001 541192

Kind code of ref document: A

Format of ref document f/p: F

WWE Wipo information: entry into national phase

Ref document number: 008167591

Country of ref document: CN

WWE Wipo information: entry into national phase

Ref document number: 2000983642

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 2000983642

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWW Wipo information: withdrawn in national office

Ref document number: 2000983642

Country of ref document: EP