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

• ad-hoc networks are dynamic. An ad-hoc network is formed when a number of nodes decide to join together to form a
• 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.
• 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.
• 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
• 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. 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
• 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.
• 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 .
• 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 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.
• 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

Applications Claiming Priority (5)

Publications (1)

Family

ID=27037868

Family Applications (1)

Country Status (5)

Families Citing this family (23)

Family Cites Families (5)

• 2000
  • 2000-12-06 JP JP2001541192A patent/JP2003516034A/ja not_active Withdrawn
  • 2000-12-06 AU AU20372/01A patent/AU2037201A/en not_active Abandoned
  • 2000-12-06 CN CN00816759.1A patent/CN1408159A/zh active Pending
  • 2000-12-06 WO PCT/SE2000/002447 patent/WO2001041378A1/en not_active Application Discontinuation
  • 2000-12-06 EP EP00983642A patent/EP1250777A1/de not_active Withdrawn

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events