US20060205409A1 - Method and apparatus for network formation - Google Patents
Method and apparatus for network formation Download PDFInfo
- Publication number
- US20060205409A1 US20060205409A1 US11/074,910 US7491005A US2006205409A1 US 20060205409 A1 US20060205409 A1 US 20060205409A1 US 7491005 A US7491005 A US 7491005A US 2006205409 A1 US2006205409 A1 US 2006205409A1
- Authority
- US
- United States
- Prior art keywords
- node
- routing
- nodes
- requesting
- communication link
- 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
Links
- 238000000034 method Methods 0.000 title claims description 22
- 230000015572 biosynthetic process Effects 0.000 title claims description 11
- 238000010586 diagram Methods 0.000 description 7
- 230000005540 biological transmission Effects 0.000 description 4
- 230000001413 cellular effect Effects 0.000 description 1
Images
Classifications
-
- 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
- H04W76/00—Connection management
- H04W76/10—Connection setup
-
- 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 generally to network formation and in particular, to a method and apparatus for ad-hoc network formation.
- 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 .
- network 100 has formed with two non-routing nodes 102 connected to routing node 101 .
- 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.
- 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.
- 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 .
- a method and apparatus for network formation is provided herein.
- the requesting node 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.
- 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.
- 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.
- 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.
- 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), BluetoothTM standard (IEEE Standard 802.15.1), . . . , etc.
- AODV Ad-hoc On Demand Distance Vector Routing
- DSR Dynamic Source Routing
- TORA Temporally-Ordered Routing Algorithm
- BluetoothTM standard IEEE Standard 802.15.1
- 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.
- 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.
- 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.
- 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 .
- 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 .
- an associated node e.g., node 403
- 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 .
- node 402 associates with node 401 .
- node 403 tries to join the network again, and associates with node 402 .
- FIG. 5 is a block diagram of node 500 .
- node 500 comprises antenna 503 coupled to transmitter/receiver (transceiver) 504 , in turn, coupled to logic circuitry 505 .
- transmitter/receiver transmitter/receiver
- logic circuitry 505 logic circuitry 505 .
- node 500 is formed from a Freescale Inc. MC13192 transceiver 504 coupled to a Motorola HC08 8-bit processor 505 .
- 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 .
- the request is received via an over-the-air communication.
- 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.
- step 605 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 .
- 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 .
- 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 .
- the routing capable node 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.
Abstract
Description
- The present invention relates generally to network formation and in particular, to a method and apparatus for ad-hoc network formation.
- 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 torouting 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. -
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 ofFIG. 5 . - 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 ofnetwork 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 ofrouting nodes 301 andnon-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 anon-routing node 302 joinsnetwork 300 before arouting 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 inFIG. 4 . - As shown in
FIG. 4 ,node 402 requests an association withnode 401 attime period 404. If the maximum number of links for this network is two, then the association cannot be completed sincenode 401 has two existing links. Ifnode 401 determines thatnode 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 withnode 401. This is accomplished bynode 401 sending a disassociation message tonon-routing node 403 attime period 405. In response,node 403 disassociates withnode 401 attime period 406, and an “OK to associate” message is sent tonode 402 attime period 407. Attime period 408node 402 associates withnode 401. Finally attime period 409,node 403 tries to join the network again, and associates withnode 402. -
FIG. 5 is a block diagram ofnode 500. In a preferred embodiment of thepresent invention node 500 comprisesantenna 503 coupled to transmitter/receiver (transceiver) 504, in turn, coupled tologic circuitry 505. Although various forms forantenna 503,transceiver 504, andlogic circuitry 505 are envisioned, in a preferred embodiment of thepresent invention node 500 is formed from a Freescale Inc. MC13192transceiver 504 coupled to a Motorola HC08 8-bit processor 505. Whennode 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 thenode 500 when acting as a routing node. The logic flow begins atstep 601 wheretransceiver 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) withnode 500. As discussed, the request is received via an over-the-air communication. Atstep 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, atstep 603 it is determined that the maximum number of links exist fornode 500, the logic flow continues to step 605 wherelogic 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, atstep 605 it is determined that the requesting node is not capable of routing, the logic flow ends atstep 615. However, if atstep 605 it is determined that the requesting node is capable of routing, the logic flow continues to step 607 wherelogic circuitry 505 determines if any associated node is a non-routing node. If, atstep 607 it is determined that there exists no non-routing node associated withnode 500, the logic flow ends atstep 615, otherwise the logic flow continues to step 609. - At
step 609logic circuitry 505 instructstransmitter 504 to transmit a disassociation message to the associated non-routing node, resulting in the non-routing node to disassociate (break communication) withnode 500. Next, atstep 611, logic circuitry instructstransmitter 504 to transmit an association message to the requesting node, causing the requesting node to form a communication link withnode 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)
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/074,910 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 |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/074,910 US7113788B1 (en) | 2005-03-08 | 2005-03-08 | Method and apparatus for network formation |
Publications (2)
Publication Number | Publication Date |
---|---|
US20060205409A1 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 |
---|---|---|---|
US11/074,910 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)
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)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102510571B (en) * | 2011-10-28 | 2014-10-15 | 上海大学 | Method for establishing stepped Ad-Hoc network route used for wireless three-meter reading |
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)
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 |
-
2005
- 2005-03-08 US US11/074,910 patent/US7113788B1/en active Active
-
2006
- 2006-02-17 WO PCT/US2006/005574 patent/WO2006096301A1/en active Application Filing
Patent Citations (11)
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 |
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 |
Cited By (26)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8616975B1 (en) | 2005-10-04 | 2013-12-31 | Pico Mobile Networks, Inc. | Proximity based games for mobile communication devices |
US9185732B1 (en) | 2005-10-04 | 2015-11-10 | Pico Mobile Networks, Inc. | Beacon based proximity services |
US8257177B1 (en) | 2005-10-04 | 2012-09-04 | 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 |
US9019866B2 (en) | 2006-08-08 | 2015-04-28 | Marvell World Trade Ltd. | Ad-hoc simple configuration |
US8619623B2 (en) | 2006-08-08 | 2013-12-31 | Marvell World Trade Ltd. | Ad-hoc simple configuration |
US9444874B2 (en) | 2006-10-16 | 2016-09-13 | Marvell International Ltd. | Automatic Ad-Hoc network creation and coalescing using WPS |
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 |
US9308455B1 (en) | 2006-10-25 | 2016-04-12 | Marvell International Ltd. | System and method for gaming in an ad-hoc network |
US8279884B1 (en) | 2006-11-21 | 2012-10-02 | Pico Mobile Networks, Inc. | Integrated adaptive jitter buffer |
US7970384B1 (en) | 2006-11-21 | 2011-06-28 | Picomobile Networks, Inc. | Active phone book enhancements |
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 |
US7889686B1 (en) | 2006-11-21 | 2011-02-15 | Picomobile Networks, Inc. | Seamless switching of media streams between different networks |
US8937963B1 (en) | 2006-11-21 | 2015-01-20 | Pico Mobile Networks, Inc. | Integrated adaptive jitter buffer |
US7961756B1 (en) | 2006-11-21 | 2011-06-14 | Picomobile Networks, Inc. | Integrated multimedia system |
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 |
CN106134244A (en) * | 2014-04-01 | 2016-11-16 | 国立研究开发法人情报通信研究机构 | Wireless communications method |
US20170027003A1 (en) * | 2014-04-01 | 2017-01-26 | National Institute Of Information And Communications Technology | Radio communication method |
US10080241B2 (en) * | 2014-04-01 | 2018-09-18 | National Institute Of Information And Communications Technology | Radio communication method |
Also Published As
Publication number | Publication date |
---|---|
WO2006096301A1 (en) | 2006-09-14 |
US7113788B1 (en) | 2006-09-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7113788B1 (en) | Method and apparatus for network formation | |
US10999712B2 (en) | Network methods and apparatus | |
US20230179524A1 (en) | Optimized routing in connected environments | |
JP6258524B2 (en) | Method and apparatus for incorporating a Bluetooth device into a neighbor aware network | |
US7545771B2 (en) | Independent direct link protocol | |
US7948951B2 (en) | Automatic peer discovery | |
US7342895B2 (en) | Method and system for peer-to-peer wireless communication over unlicensed communication spectrum | |
US9094897B2 (en) | Communication apparatus and control method thereof | |
JP4477882B2 (en) | Hidden node detection in wireless local area networks | |
US8649732B2 (en) | Radio terminal and radio communication method | |
US7596151B2 (en) | System and method for discovering path MTU in ad hoc network | |
US20020146981A1 (en) | Extending personal area networks | |
US9226331B2 (en) | Radio terminal and radio communication method | |
AU2008212052A1 (en) | Apparatus and methods for central control of mesh networks | |
US7664111B2 (en) | Network switching system having a connection device management table commonly owned on a wireless network | |
CN104641694A (en) | Systems, apparatus, and methods for association in multi-hop networks | |
JP2010081603A (en) | Method and node for implementing virtual network | |
CN1918853B (en) | Protocol for indicating enhanced capabilities for use by short-range wireless connectivity equipment | |
JP2006013788A (en) | Radio device | |
US9185732B1 (en) | Beacon based proximity services | |
US10771957B2 (en) | Wireless communication apparatus, communication system and wireless communication apparatus control method to exchange services | |
US8248999B2 (en) | Method and apparatus for resource reservation in a multihop wireless network | |
JP2002232949A (en) | Mobile communication system and data transfer method in mobile communication system | |
TWI444003B (en) | Method and apparatus for transmitting concatenated frames in a wireless communication system | |
KR101280077B1 (en) | Method and apparatus for determining a level of involvement of mesh points in a wireless communication system |
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 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
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 | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553) Year of fee payment: 12 |
|
AS | Assignment |
Owner name: WILMINGTON TRUST, NATIONAL ASSOCIATION, AS COLLATE Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:ARRIS ENTERPRISES LLC;REEL/FRAME:049820/0495 Effective date: 20190404 Owner name: JPMORGAN CHASE BANK, N.A., NEW YORK Free format text: TERM LOAN SECURITY AGREEMENT;ASSIGNORS:COMMSCOPE, INC. OF NORTH CAROLINA;COMMSCOPE TECHNOLOGIES LLC;ARRIS ENTERPRISES LLC;AND OTHERS;REEL/FRAME:049905/0504 Effective date: 20190404 Owner name: JPMORGAN CHASE BANK, N.A., NEW YORK Free format text: ABL SECURITY AGREEMENT;ASSIGNORS:COMMSCOPE, INC. OF NORTH CAROLINA;COMMSCOPE TECHNOLOGIES LLC;ARRIS ENTERPRISES LLC;AND OTHERS;REEL/FRAME:049892/0396 Effective date: 20190404 Owner name: WILMINGTON TRUST, NATIONAL ASSOCIATION, AS COLLATERAL AGENT, CONNECTICUT Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:ARRIS ENTERPRISES LLC;REEL/FRAME:049820/0495 Effective date: 20190404 |