| abstract |
A method and system for routing data in a wireless network ( 400 ) that enables all nodes ( 106, 402, 404, 406, 408 ) to find routes to each other even if the nodes ( 106, 402, 404, 406, 408 ) are non-meshed which are incapable of operating as a router to route packets received from other nodes ( 106, 402, 404, 406, 408 ), and for associating and reassociating the non-meshed and meshed nodes with other meshed nodes ( 106, 402, 404, 406, 408 ). The non-meshed nodes (STA 13 -STA 15 ) request association with one of the meshed nodes (AP 5 ) which are capable of performing packet routing, to request that the meshed node (AP 5 ) with which the non-meshed node (STA 13 ) is associating operate as a proxy node to route packets between the associated non-meshed node (STA 13 ) and other meshed or non-meshed nodes ( 106, 402, 404, 406, 408 ). Some of the meshed nodes ( 106 ) further operate as intelligent access points ( 106 ) to provide the non-meshed nodes (STA 13 -STA 15 ) and other meshed nodes ( 402 ) with access to other networks, such as the Internet ( 402 ), as well as to effect the association and reassociation of the non-meshed and meshed nodes ( 106, 402, 404, 406, 408 ). |