US20060205409A1 - Method and apparatus for network formation - Google Patents

Method and apparatus for network formation Download PDF

Info

Publication number
US20060205409A1
US20060205409A1 US11074910 US7491005A US2006205409A1 US 20060205409 A1 US20060205409 A1 US 20060205409A1 US 11074910 US11074910 US 11074910 US 7491005 A US7491005 A US 7491005A US 2006205409 A1 US2006205409 A1 US 2006205409A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
node
routing
non
step
nodes
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.)
Granted
Application number
US11074910
Other versions
US7113788B1 (en )
Inventor
Wayne Chiou
Vernon Allen
Oleg Andric
Ralph D'Souza
Minh Pham
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.)
Arris Enterprises LLC
Original Assignee
Motorola Solutions Inc
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

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246Connectivity information discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W76/00Connection management
    • H04W76/10Connection setup
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

When a requesting node (402) has routing capabilities and attempts to join a network and there are no association slots available, the requesting node (402) will send an association message to a potential root node (401). If the root node (401) has reached the maximum number of links, and has a non-routing capable node (403) associated with it, the root node (401) will send a message to the non-routing capable node (403), instructing it to disassociate and attempt to re-associate at a later time. A message is then sent to the requesting node (402) for it to associate with the root node (401).

Description

    FIELD OF THE INVENTION
  • The present invention relates generally to network formation and in particular, to a method and apparatus for ad-hoc network formation.
  • BACKGROUND OF THE INVENTION
  • In a wireless network with routing capable and non-routing capable nodes, it is possible that non-routing capable nodes will prevent additional nodes from joining the network. More particularly, since nodes within an ad-hoc communication system may have a maximum number of connections to other nodes, if non-routing nodes join the network before the routing nodes, then the maximum number of nodes capable of joining the network may be limited. This is illustrated in FIG. 1.
  • As shown in FIG. 1 network 100 has formed with two non-routing nodes 102 connected to routing node 101. As is evident, if all routing capable nodes can only support 2 associated nodes and two non-routing capable nodes join first to the root node, then this network can only support a maximum of 3 nodes. On the other hand, if two routing capable nodes join the root node then this network can support at least 7 nodes (FIG. 2). Therefore a need exists for a method and apparatus for forming a network that prevents non-routing nodes from limiting the number of nodes that can join a network.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a block diagram illustrating network formation.
  • FIG. 2 is a block diagram illustrating network formation.
  • FIG. 3 is a block diagram of an ad-hoc network.
  • FIG. 4 is a block diagram of an ad-hoc network illustrating network formation.
  • FIG. 5 is a block diagram of a node.
  • FIG. 6 is a flow chart showing operation of the node of FIG. 5.
  • DETAILED DESCRIPTION OF THE DRAWINGS
  • In order to address the above-mentioned need, a method and apparatus for network formation is provided herein. When a requesting node has routing capabilities and attempts to join a network and there are no association slots available, the requesting node will send an association message to a potential root node. If the root node has reached the maximum number of links, and has a non-routing capable node associated with it, the root node will send a message to the non-routing capable node, instructing it to disassociate and attempt to re-associate at a later time. A message is then sent to the requesting node for it to associate with the root node. This will result in a net increase of available association slots for the other nodes to associate to the network. If the root node does not have non-routing capable nodes associated to it, a refusal message is sent to the requesting node. The requesting node will then repeat the query with other potential root nodes until it can associate with the network.
  • The present invention encompasses a method for network formation. The method comprises the steps of receiving a request to form a communication link with a requesting node and determining if a maximum number of links has been achieved. In response to the request to form the link and the determination, communication to a non-routing node is broken and a communication link is formed with the requesting node.
  • The present additionally invention encompasses a method for network formation. The method comprises the steps of receiving a request to form a communication link with a requesting node, determining if a maximum number of links has been achieved, determining if the requesting node is a routing node, and determining if any associated nodes are non-routing nodes. In response to the determinations, communication to a non-routing node is broken and a communication link with the requesting node is formed.
  • The present invention additionally encompasses an apparatus comprising a receiver receiving a request to form a communication link with a requesting node, and logic circuitry determining if a maximum number of links has been achieved and in response to the request to form the association link and the determination, disassociating communication with a non-routing node and forming a communication link with the requesting node.
  • Turning now to the drawings, wherein like numerals designate like components, FIG. 3 is a block diagram of network 300. Network 300 preferably utilizes a communication system protocol defined by the 802.15.3 Wireless Personal Area Networks for High Data Rates standard, or the IEEE 802.15.4 Low Rate Wireless Personal Area Networks standard. One of ordinary skill in the art will recognize that other communication system protocols may be utilized without varying from the scope of the invention. For example, communication system 100 may utilize communication system protocols such as, but not limited to, Ad-hoc On Demand Distance Vector Routing (AODV), Dynamic Source Routing (DSR), Temporally-Ordered Routing Algorithm (TORA), Bluetooth™ standard (IEEE Standard 802.15.1), . . . , etc.
  • As shown, network 300 includes a number of routing nodes 301 and non-routing nodes 302. Nodes 301-302 represent devices that communicate with each other through wireless communication, and can be transportable (mobile) or they can be fixed in a given place. Nodes 301-302 can include, for example, transceiver security tags attached to valuable assets such as lap top computers, or be embedded in wireless communication devices including cellular telephones.
  • During operation of network 300, nodes become associated with each other for routing purposes, with transmissions between two nodes generally taking place through intervening nodes. The intervening nodes receive a source transmission, and “repeat” the source transmission until the source transmission reaches its destination node. As discussed above, many networks comprise nodes that are incapable of routing data. If a non-routing node 302 joins network 300 before a routing node 301, then the maximum number of nodes capable of joining the network may be limited. In order to address this issue, when a node receives a request for association, the node will attempt to associate the requesting node. If, however, the node has reached a maximum number of links, the node will be unable to associate the requesting node. In this situation, the node will determine if the requesting node is a routing node and if any associated node is a non-routing node. If both conditions are true, the non-routing node will be disassociated and replaced by the requesting node. This procedure is illustrated in FIG. 4.
  • As shown in FIG. 4, node 402 requests an association with node 401 at time period 404. If the maximum number of links for this network is two, then the association cannot be completed since node 401 has two existing links. If node 401 determines that node 402 is capable of routing, and that an associated node (e.g., node 403) is a non-routing node, then a non-routing node is forced to disassociate with node 401. This is accomplished by node 401 sending a disassociation message to non-routing node 403 at time period 405. In response, node 403 disassociates with node 401 at time period 406, and an “OK to associate” message is sent to node 402 at time period 407. At time period 408 node 402 associates with node 401. Finally at time period 409, node 403 tries to join the network again, and associates with node 402.
  • FIG. 5 is a block diagram of node 500. In a preferred embodiment of the present invention node 500 comprises antenna 503 coupled to transmitter/receiver (transceiver) 504, in turn, coupled to logic circuitry 505. Although various forms for antenna 503, transceiver 504, and logic circuitry 505 are envisioned, in a preferred embodiment of the present invention node 500 is formed from a Freescale Inc. MC13192 transceiver 504 coupled to a Motorola HC08 8-bit processor 505. When node 500 wishes to communicate with any other network node, it does so via over-the-air communication signal 506. Node 500 may serve as a routing or non-routing node. Additionally, when acting as a routing node, node 500 may serve to relay data among network nodes.
  • FIG. 6 is a flow chart showing operation of the node 500 when acting as a routing node. The logic flow begins at step 601 where transceiver 504 receives an association message (e.g., 802.15.4 Association Message) from a requesting node. The association message is a request from the requesting node to form a communication link (e.g., an ad-hoc communication link) with node 500. As discussed, the request is received via an over-the-air communication. At step 603, logic circuitry 505 determines if a maximum number of links has been obtained, and if not, the logic flow continues to step 613 where a link is established to the requesting node. If, however, at step 603 it is determined that the maximum number of links exist for node 500, the logic flow continues to step 605 where logic circuitry 505 determines if the requesting node is capable of routing. This determination is accomplished by analyzing capability information received with the association message. If, at step 605 it is determined that the requesting node is not capable of routing, the logic flow ends at step 615. However, if at step 605 it is determined that the requesting node is capable of routing, the logic flow continues to step 607 where logic circuitry 505 determines if any associated node is a non-routing node. If, at step 607 it is determined that there exists no non-routing node associated with node 500, the logic flow ends at step 615, otherwise the logic flow continues to step 609.
  • At step 609 logic circuitry 505 instructs transmitter 504 to transmit a disassociation message to the associated non-routing node, resulting in the non-routing node to disassociate (break communication) with node 500. Next, at step 611, logic circuitry instructs transmitter 504 to transmit an association message to the requesting node, causing the requesting node to form a communication link with node 500.
  • While the invention has been particularly shown and described with reference to a particular embodiment, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention. For example, it is possible that when a routing capable node attempts to join the network and there are no association slots available, the routing capable node will first scan for a potential routing node and any non-routing nodes. If a non-routing node is found and the node which it is associated with is also found then the requesting node can directly request the non-routing node to leave the current association and join the requesting node after the requesting node takes the non-routing nodes association slot. The benefit of this is to insure that the non-routing node can rejoin the network and the requesting node will not have to query for multiple nodes to associate with. It is intended that such changes come within the scope of the following claims.

Claims (16)

  1. 1. A method for network formation, the method comprising the steps of:
    receiving a request to form a communication link with a requesting node;
    determining if a maximum number of links has been achieved;
    determining a node to disassociate communication with, wherein the step of determining the node to disassociate communication with is based on whether or not the node is a routing node or a non-routing node, and wherein a routing node is a node capable of routing data and a non-routing node is a node incapable of routing data;
    in response to the request to form the link and the determination that a maximum number of links has been achieved, disassociating communication to the node; and
    forming a communication link with the requesting node.
  2. 2. The method of claim 1 wherein the step of receiving the request to form the communication link comprises the step of receiving a request to form an ad-hoc communication link.
  3. 3. The method of claim 1 wherein the step of disassociating communication to the node comprises the step of transmitting a disassociation message to the node.
  4. 4. The method of claim 1 wherein the step of forming the communication link with the requesting node comprises the step of transmitting a message to the requesting node, instructing the requesting node to form the link.
  5. 5. The method of claim 1 further comprising the steps of:
    determining if the requesting node is a routing node.
  6. 6. The method of claim 1 further comprising the step of:
    determining if any associated nodes are non-routing nodes.
  7. 7. A method for network formation, the method comprising the steps of:
    receiving a request to form a communication link with a requesting node;
    determining if a maximum number of links has been achieved;
    determining if the requesting node is a routing node;
    determining if any associated nodes are non-routing nodes wherein a routing node is a node capable of routing data and a non-routing node is a node incapable of routing data;
    in response to the determination that any associated nodes are non-routing nodes, breaking communication to a non-routing node; and
    forming a communication link with the requesting node.
  8. 8. The method of claim 7 wherein the step of receiving the request to form the communication link comprises the step of receiving a request to form an ad-hoc communication link.
  9. 9. The method of claim 8 wherein the step of breaking communication to the non-routing node comprises the step of transmitting a disassociation message to the non-routing node.
  10. 10. The method of claim 9 wherein the step of forming the communication link with the requesting node comprises the step of transmitting a message to the requesting node.
  11. 11. An apparatus comprising:
    a receiver receiving a request to form a communication link with a requesting node; and
    logic circuitry determining if a maximum number of links has been achieved and in response to the request to form the association link and the determination that the maximum number of links has been achieved, determining a node to disassociate communication with, disassociating communication with the node and forming a communication link with the requesting node, wherein the step of determining the node to disassociate communication with is based on whether or not the node is a routing node or a non-routing node, wherein a routing node is a node capable of routing data and a non-routing node is a node incapable of routing data.
  12. 12. The apparatus of claim 11 wherein the request to form the communication link comprises a request to form an ad-hoc communication link.
  13. 13. The apparatus of claim 11 wherein the disassociation with the node takes place by the logic circuitry instructing a transmitter to transmit a disassociation message to the node.
  14. 14. The apparatus of claim 11 wherein the communication link is formed with the requesting node by transmitting a message to the requesting node.
  15. 15. The method of claim 1 wherein only nodes that are non-routing nodes are chosen for disassociation.
  16. 16. The apparatus of claim 1 wherein only nodes that are non-routing nodes are chosen for disassociation.
US11074910 2005-03-08 2005-03-08 Method and apparatus for network formation Active US7113788B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US11074910 US7113788B1 (en) 2005-03-08 2005-03-08 Method and apparatus for network formation

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US11074910 US7113788B1 (en) 2005-03-08 2005-03-08 Method and apparatus for network formation
PCT/US2006/005574 WO2006096301A1 (en) 2005-03-08 2006-02-17 Method and apparatus for network formation

Publications (2)

Publication Number Publication Date
US20060205409A1 true true US20060205409A1 (en) 2006-09-14
US7113788B1 US7113788B1 (en) 2006-09-26

Family

ID=36953688

Family Applications (1)

Application Number Title Priority Date Filing Date
US11074910 Active US7113788B1 (en) 2005-03-08 2005-03-08 Method and apparatus for network formation

Country Status (2)

Country Link
US (1) US7113788B1 (en)
WO (1) WO2006096301A1 (en)

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080270607A1 (en) * 2007-04-24 2008-10-30 Samsung Electronics Co., Ltd. Method for managing wireless network and wireless device employing the same
US7889686B1 (en) 2006-11-21 2011-02-15 Picomobile Networks, Inc. Seamless switching of media streams between different networks
US7961756B1 (en) 2006-11-21 2011-06-14 Picomobile Networks, Inc. Integrated multimedia system
US7970384B1 (en) 2006-11-21 2011-06-28 Picomobile Networks, Inc. Active phone book enhancements
US7978699B1 (en) 2006-11-21 2011-07-12 Picomobile Networks, Inc. Protocol compression with synchronized sequence numbers
US8257177B1 (en) 2005-10-04 2012-09-04 PICO Mobile Networks, Inc Proximity based games for mobile communication devices
US8279884B1 (en) 2006-11-21 2012-10-02 Pico Mobile Networks, Inc. Integrated adaptive jitter buffer
US8411662B1 (en) 2005-10-04 2013-04-02 Pico Mobile Networks, Inc. Beacon based proximity services
US8619623B2 (en) 2006-08-08 2013-12-31 Marvell World Trade Ltd. Ad-hoc simple configuration
US8628420B2 (en) 2007-07-03 2014-01-14 Marvell World Trade Ltd. Location aware ad-hoc gaming
US8891492B1 (en) 2006-10-16 2014-11-18 Marvell International Ltd. Power save mechanisms for dynamic ad-hoc networks
US8918051B1 (en) 2007-06-18 2014-12-23 Marvell International Ltd. Method and apparatus for performing a handoff of a data communication session from one network to another network
JP2015198333A (en) * 2014-04-01 2015-11-09 国立研究開発法人情報通信研究機構 Radio communication method
US9308455B1 (en) 2006-10-25 2016-04-12 Marvell International Ltd. System and method for gaming in an ad-hoc network
US9380401B1 (en) 2010-02-03 2016-06-28 Marvell International Ltd. Signaling schemes allowing discovery of network devices capable of operating in multiple network modes
US9444874B2 (en) 2006-10-16 2016-09-13 Marvell International Ltd. Automatic Ad-Hoc network creation and coalescing using WPS

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102510571B (en) * 2011-10-28 2014-10-15 上海大学 Stepped ad hoc wireless network set table for a three-by copy method for establishing
US8937879B2 (en) * 2012-03-30 2015-01-20 General Electric Company System and method for changing network topology based on energy consumption
US9756549B2 (en) 2014-03-14 2017-09-05 goTenna Inc. System and method for digital communication between computing devices

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030055892A1 (en) * 2001-09-19 2003-03-20 Microsoft Corporation Peer-to-peer group management and method for maintaining peer-to-peer graphs
US20030060202A1 (en) * 2001-08-28 2003-03-27 Roberts Robin U. System and method for enabling a radio node to selectably function as a router in a wireless communications network
US20040076164A1 (en) * 2002-10-22 2004-04-22 Sandia National Laboratories Reconfigureable network node
US20040192221A1 (en) * 2003-03-31 2004-09-30 Yasuhiko Matsunaga Communication terminal, base station, server, network system, and handover method
US20040218548A1 (en) * 2003-04-30 2004-11-04 Harris Corporation Predictive routing in a mobile ad hoc network
US20040219909A1 (en) * 2003-04-30 2004-11-04 Harris Corporation Predictive routing including the use of fuzzy logic in a mobile ad hoc network
US20050037787A1 (en) * 2003-06-27 2005-02-17 Rosett-Wireless Corporation Wireless intelligent portable-server system (WIPSS)
US20050086384A1 (en) * 2003-09-04 2005-04-21 Johannes Ernst System and method for replicating, integrating and synchronizing distributed information
US20050094594A1 (en) * 2003-11-05 2005-05-05 Samsung Electronics Co., Ltd. Wireless communication system capable of performing an optimized routing and method of measuring a magnitude of a network
US20050174950A1 (en) * 2004-02-09 2005-08-11 Sharp Laboratories Of America, Inc. Distributed network organization and topology discovery in ad-hoc network
US20050254429A1 (en) * 2002-06-28 2005-11-17 Takeshi Kato Management node deice, node device, network configuration management system, network configuration management method, node device control method, management node device control method

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030060202A1 (en) * 2001-08-28 2003-03-27 Roberts Robin U. System and method for enabling a radio node to selectably function as a router in a wireless communications network
US20030055892A1 (en) * 2001-09-19 2003-03-20 Microsoft Corporation Peer-to-peer group management and method for maintaining peer-to-peer graphs
US20050254429A1 (en) * 2002-06-28 2005-11-17 Takeshi Kato Management node deice, node device, network configuration management system, network configuration management method, node device control method, management node device control method
US20040076164A1 (en) * 2002-10-22 2004-04-22 Sandia National Laboratories Reconfigureable network node
US20040192221A1 (en) * 2003-03-31 2004-09-30 Yasuhiko Matsunaga Communication terminal, base station, server, network system, and handover method
US20040219909A1 (en) * 2003-04-30 2004-11-04 Harris Corporation Predictive routing including the use of fuzzy logic in a mobile ad hoc network
US20040218548A1 (en) * 2003-04-30 2004-11-04 Harris Corporation Predictive routing in a mobile ad hoc network
US20050037787A1 (en) * 2003-06-27 2005-02-17 Rosett-Wireless Corporation Wireless intelligent portable-server system (WIPSS)
US20050086384A1 (en) * 2003-09-04 2005-04-21 Johannes Ernst System and method for replicating, integrating and synchronizing distributed information
US20050094594A1 (en) * 2003-11-05 2005-05-05 Samsung Electronics Co., Ltd. Wireless communication system capable of performing an optimized routing and method of measuring a magnitude of a network
US20050174950A1 (en) * 2004-02-09 2005-08-11 Sharp Laboratories Of America, Inc. Distributed network organization and topology discovery in ad-hoc network

Cited By (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8257177B1 (en) 2005-10-04 2012-09-04 PICO Mobile Networks, Inc Proximity based games for mobile communication devices
US8616975B1 (en) 2005-10-04 2013-12-31 Pico Mobile Networks, Inc. Proximity based games for mobile communication devices
US8411662B1 (en) 2005-10-04 2013-04-02 Pico Mobile Networks, Inc. Beacon based proximity services
US9185732B1 (en) 2005-10-04 2015-11-10 Pico Mobile Networks, Inc. Beacon based proximity services
US8619623B2 (en) 2006-08-08 2013-12-31 Marvell World Trade Ltd. Ad-hoc simple configuration
US9019866B2 (en) 2006-08-08 2015-04-28 Marvell World Trade Ltd. Ad-hoc simple configuration
US9374785B1 (en) 2006-10-16 2016-06-21 Marvell International Ltd. Power save mechanisms for dynamic ad-hoc networks
US8891492B1 (en) 2006-10-16 2014-11-18 Marvell International Ltd. Power save mechanisms for dynamic ad-hoc networks
US9444874B2 (en) 2006-10-16 2016-09-13 Marvell International Ltd. Automatic Ad-Hoc network creation and coalescing using WPS
US9308455B1 (en) 2006-10-25 2016-04-12 Marvell International Ltd. System and method for gaming in an ad-hoc network
US7889686B1 (en) 2006-11-21 2011-02-15 Picomobile Networks, Inc. Seamless switching of media streams between different networks
US7961756B1 (en) 2006-11-21 2011-06-14 Picomobile Networks, Inc. Integrated multimedia system
US8825016B1 (en) 2006-11-21 2014-09-02 Pico Mobile Networks, Inc. Active phone book enhancements
US8374584B1 (en) 2006-11-21 2013-02-12 Pico Mobile Networks, Inc. Active phone book enhancements
US8279884B1 (en) 2006-11-21 2012-10-02 Pico Mobile Networks, Inc. Integrated adaptive jitter buffer
US8937963B1 (en) 2006-11-21 2015-01-20 Pico Mobile Networks, Inc. Integrated adaptive jitter buffer
US7970384B1 (en) 2006-11-21 2011-06-28 Picomobile Networks, Inc. Active phone book enhancements
US7978699B1 (en) 2006-11-21 2011-07-12 Picomobile Networks, Inc. Protocol compression with synchronized sequence numbers
US20080270607A1 (en) * 2007-04-24 2008-10-30 Samsung Electronics Co., Ltd. Method for managing wireless network and wireless device employing the same
US8918051B1 (en) 2007-06-18 2014-12-23 Marvell International Ltd. Method and apparatus for performing a handoff of a data communication session from one network to another network
US8628420B2 (en) 2007-07-03 2014-01-14 Marvell World Trade Ltd. Location aware ad-hoc gaming
US9380401B1 (en) 2010-02-03 2016-06-28 Marvell International Ltd. Signaling schemes allowing discovery of network devices capable of operating in multiple network modes
JP2015198333A (en) * 2014-04-01 2015-11-09 国立研究開発法人情報通信研究機構 Radio communication method
US20170027003A1 (en) * 2014-04-01 2017-01-26 National Institute Of Information And Communications Technology Radio communication method

Also Published As

Publication number Publication date Type
US7113788B1 (en) 2006-09-26 grant
WO2006096301A1 (en) 2006-09-14 application

Similar Documents

Publication Publication Date Title
US6845084B2 (en) Routing protocol selection for an ad hoc network
US7966036B2 (en) Wireless LAN device and communication mode switching method
US6925064B2 (en) Method and apparatus for discovering neighbors within a piconet communication system
US20050037818A1 (en) Providing a universal wireless headset
US20070171881A1 (en) Autonomous and heterogeneous network discovery and reuse
US20040246934A1 (en) Wireless local area networks and methods for establishing direct link protocol (DLP) communications between stations of wireless local area networks
US20050050004A1 (en) Methods for generating and distribution of group key in a wireless transport network
US7835301B1 (en) Extended service set mesh topology representation
US20050122927A1 (en) Power management for wireless direct link
US7606175B1 (en) Extended service set mesh path selection
US7342895B2 (en) Method and system for peer-to-peer wireless communication over unlicensed communication spectrum
US20030036350A1 (en) Method and apparatus for selective service access
US7130289B2 (en) Detecting a hidden node in a wireless local area network
US7522540B1 (en) Extended service set mesh topology discovery
US20030096577A1 (en) Short range RF network configuration
US20150127733A1 (en) Context-aware peer-to-peer communication
US20070008922A1 (en) Direct wireless client to client communication
US8495244B2 (en) System and method for dynamic automatic communication path selection, distributed device synchronization and task delegation
US20070117577A1 (en) Routing of a short message originated by a mobile device
US20060285510A1 (en) Method and apparatus for transferring frames in extended wireless LAN
US6879584B2 (en) Communication services through multiple service providers
US20110085529A1 (en) Method and apparatus for peer-to-peer connection using wireless local area network (lan) in mobile communication terminal
US20070147620A1 (en) Method for encryption key management for use in a wireless mesh network
US20060161778A1 (en) Distinguishing between devices of different types in a wireless local area network (WLAN)
US20050286480A1 (en) Radio apparatus joining an IBSS or ad hoc network

Legal Events

Date Code Title Description
AS Assignment

Owner name: MOTOROLA, INC., ILLINOIS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CHIOU, WAYNE W.;ALLEN, VERNON A.;ANDRIC, OLEG;AND OTHERS;REEL/FRAME:016381/0554

Effective date: 20050308

FPAY Fee payment

Year of fee payment: 4

AS Assignment

Owner name: MOTOROLA SOLUTIONS, INC., ILLINOIS

Free format text: CHANGE OF NAME;ASSIGNOR:MOTOROLA, INC;REEL/FRAME:026081/0001

Effective date: 20110104

FPAY Fee payment

Year of fee payment: 8

AS Assignment

Owner name: ARRIS ENTERPRISES LLC, PENNSYLVANIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MOTOROLA SOLUTIONS, INC.;REEL/FRAME:044806/0900

Effective date: 20170830

MAFP

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553)

Year of fee payment: 12