Method and system for analysis and visualization of a wireless communications network

• US 7,711,371 B2
• Filed: 06/27/2006
• Issued: 05/04/2010
• Est. Priority Date: 06/27/2006
• Status: Active Grant

• Current Assignee: Motorola Solutions, Inc.
• Original Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Inventors: Basak, Joydeep K., Reifsnider, Eric S., Anatha, Veeraraghavan A., Yang, Gemel M., Skidmore, Roger R.
• Primary Examiner(s): Nguyen; Tu X
• Application Number:
  US11/426,921
• Publication Number:
  US 20070298805A1
• Time in Patent Office: 1,407 Days
• Field of Search: 455/33.1, 455/33.4, 455/56.1, 455/441, 455/446, 455/448, 702/5, 702/20, 702/2
• US Class Current: 455/446
• CPC Class Codes: H04W 16/18 Network planning tools
• CPC Class Codes: H04W 16/22 Traffic simulation tools or models

Abstract

A system and method for analysis of a wireless communications network is disclosed. A map of a physical environment integrating communications hardware for implementing a wireless communications network is defined. Client service requirements and regions for the wireless communications network are defined. Mesh point constraints and mesh linkage constraints for the wireless communications network are defined. The communications hardware is placed on the map at initial locations. Whether at least one of the defined mesh point constraints and mesh linkage constraints have been met by at least one mesh link between communications hardware based upon the initial locations of the communications hardware in the communications network is calculated. In one embodiment, the at least one calculation is displayed as a visualization on the defined map.

Claims

1. A method for analysis of a wireless mesh network comprising:

defining a map of a physical environment integrating communications hardware for implementing the wireless mesh network, wherein the communication hardware comprises at least one backhaul anchored node (BAN) and a plurality of mesh nodes;

defining client service requirements and regions for the wireless mesh network;

defining mesh point constraints and mesh linkage constraints for the wireless mesh network, wherein the mesh linkage constraints comprises at least one constraint between the at least one BAN and each of the plurality of mesh nodes;

placing the at least one BAN and each of the plurality of mesh nodes on the map at initial locations;

calculating whether at least one of the defined mesh point constraints and mesh linkage constraints have been met by at least one link between the at least one BAN and each of the plurality of mesh nodes based upon the initial locations of the at least one BAN and each of the plurality of mesh nodes; and

interconverting between at least one of the plurality of mesh nodes and at least one BAN to meet the defined mesh point and mesh linkage constraints, based on the calculation that the at least one of the defined mesh point constraints and mesh linkage constraints is not met, wherein the at least one BAN connects the wireless mesh network to a data network.

2. The method of claim 1 further comprising the step of displaying at least one calculation as a visualization on the defined map.

3. The method of claim 2 wherein the step of displaying is performed by filtering at least one of mesh point constraints and mesh linkage constraints to indicate only a particular constraint or a set of constraints of interest.

4. The method of claim 2 wherein the step of displaying is performed quickly after the step of calculating so that a user of the method is unaware of the calculating step.

5. The method of claim 1 wherein the step of calculating is performed using a graph theory algorithm wherein mesh nodes are represented as graph vertices and mesh links are represented as graph edges.

6. The method of claim 1 further comprising implementing prioritized user actions, if the defined mesh point constraints and mesh linkage constraints have not been met.

7. The method of claim 6 wherein the prioritized user actions comprise adding communications hardware, moving communications hardware, promoting communications hardware, demoting communications hardware, and changing RF characteristics of the communications hardware.

8. The method of claim 1 further comprising implementing automatic actions, if the defined mesh point constraints and mesh linkage constraints have not been met.

9. The method of claim 1 wherein the visualization comprises at least one of color code, line thickness, and a graphical icon.

10. The method of claim 1 wherein the map is a site specific computer model of the wireless communications network.

11. The method of claim 1 wherein the steps of defining are performed by using at least one of a drag-and-drop technique and a pick-and-place technique.

12. The method of claim 1 further comprising moving the communications hardware on the map to subsequent locations and recalculating whether the defined mesh point constraints and mesh linkage constraints have been met based upon the subsequent locations.

13. The method of claim 1 wherein the mesh linkage constraints comprises at least one of a number of hops to a backhaul anchored node, a number of redundant paths to a backhaul anchored node, end-to-end latency, and choice of routes given multiple path choices.

14. The method of claim 13 wherein the step of calculating is performed by at least one of a graph theory algorithm and a geometrical algorithm.

15. A method for analysis of a wireless mesh network comprising:

defining a map of a physical environment integrating at least one access point and a backhaul anchored node (BAN) for implementing the wireless mesh network;

defining client service requirements and regions for the wireless mesh network;

defining at least one of mesh point constraints and mesh linkage constraints for the wireless mesh network, wherein the mesh linkage constraints comprises at least one constraint between the BAN and the at least one access point;

placing the BAN and the at least one access point on the map at initial locations;

calculating whether the at least one of the defined mesh point constraints and mesh linkage constraints has been met based upon the initial locations of the BAN and the at least one access point;

displaying at least one calculation as a visualization on the defined map; and

interconverting between the at least one access point and the BAN to meet the defined mesh point and mesh linkage constraints, based on the calculation that the at least one of the defined mesh point constraints and mesh linkage constraints is not met, wherein the BAN connects the wireless mesh network to a data network.

16. The method of claim 15 wherein the step of calculating is performed using a graph theory algorithm wherein the BAN is represented as a graph vertex and a wireless link between the BAN and another at least one communication hardware node is represented as a graph edge.

17. The method of claim 16 further comprising implementing automatic actions, if the at least one of the defined mesh point constraints and mesh linkage constraints has not been met.

18. The method of claim 15 wherein the mesh point constraints comprise at least one of a range of communications hardware, transmitter, receiver, or transceiver characteristics of the communications hardware, speed of a backhaul connection available at a backhaul anchored node, a maximum throughput per mesh link, a location where the at least one access point and backhaul anchored node can be located, and a location where the at least one access point and backhaul anchored node can not be located.

19. The method of claim 15 wherein the mesh linkage constraints comprise at least one of a number of hops, a number of redundant hops to a backhaul anchored node, end-to-end latency, and a choice of given multiple path choices.

20. A system for analysis of a wireless mesh network comprising:

means for defining a map of a physical environment integrating communications hardware for implementing the wireless mesh network, wherein the communication hardware comprises at least one backhaul anchored node (BAN) and a plurality of mesh nodes;

means for defining client service requirements and regions for the wireless mesh network;

means for defining mesh point constraints and mesh linkage constraints for the wireless mesh network, wherein the mesh linkage constraints comprises at least one constraint between the at least one BAN and each of the plurality of mesh nodes;

means for placing the at least one BAN and each of the plurality of mesh nodes on the map at initial locations; and

means for calculating whether at least one of the defined mesh point constraints and mesh linkage constraints have been met by at least one link between the at least one BAN and each of the plurality of mesh nodes based upon the initial locations the at least one BAN and each of the plurality of mesh nodes; and

means for interconverting between at least one of the plurality of mesh nodes and the at least one BAN to meet the defined mesh point and mesh linkage constraints, based on the calculation that the at least one of the defined mesh point constraints and mesh linkage constraints is not met, wherein at least one BAN connects the wireless mesh network to a data network.