Methodologies for determining one or more staged topologies for a communication network, communication networks implementing one or more staged topologies, and systems for determining one or more staged topologies for a communication network are provided. In one embodiment, a method of determining a
Methodologies for determining one or more staged topologies for a communication network, communication networks implementing one or more staged topologies, and systems for determining one or more staged topologies for a communication network are provided. In one embodiment, a method of determining a staged topology for a communication network including a plurality of nodes includes identifying a plurality of topologies comprising different subsets of available communication links among the nodes, associating a connection matrix with each identified topology, establishing one or more sequences of topologies using the identified topologies, multiplying the connection matrices associated with the topologies in each sequence of topologies to obtain a sequenced connection matrix corresponding with each sequence of topologies, multiplying each sequenced connection matrix by a weighting matrix to obtain a total cost matrix corresponding with each sequence of topologies, and selecting one of the sequences of topologies as the staged topology based on the total cost matrices corresponding with each sequence of topologies.
대표청구항▼
What is claimed is: 1. A method of determining a staged topology for a communication network including a plurality of nodes, said method comprising: executing computer readable program code with a processing device to enable said processing device to perform the steps of: identifying a plurality of
What is claimed is: 1. A method of determining a staged topology for a communication network including a plurality of nodes, said method comprising: executing computer readable program code with a processing device to enable said processing device to perform the steps of: identifying a plurality of topologies comprising different subsets of available communication links among the nodes; and generating a staged topology for the network, wherein the staged topology comprises a sequence of two or more of the identified topologies and wherein information is communicatable among the nodes within the network via communication links arranged in accordance with the topologies included in the staged topology, wherein said generating comprises: associating a connection matrix with each identified topology, wherein the connection matrix associated with each topology includes a plurality of numerical elements cij, indexed by row i and column j where i represents the first of a pair of nodes in the network and j represents the second of a pair of nodes in the network, and wherein each numerical element cij is a first value when there is a communication link between node i and node j and is a second value otherwise; establishing one or more sequences of topologies using the identified topologies; multiplying the connection matrices associated with the topologies in each sequence of topologies to obtain a sequenced connection matrix corresponding with each sequence of topologies; determining which sequences of topologies produce a fully connected communication network by determining which sequences of topologies have corresponding sequenced connection matrices without any second value elements; choosing only the sequenced connection matrices corresponding with the sequences of topologies that produce a fully connected communication network for further consideration; multiplying each sequenced connection matrix by a weighting matrix to obtain a total cost matrix corresponding with each sequence of topologies, wherein the weighting matrix includes a plurality of numerical elements wij, indexed by row i and column j where i represents the first of a pair of nodes in the network and j represents the second of a pair of nodes in the network, and wherein each numerical element wij represents a relative cost associated with a communication link from node i to node j; and selecting one of the sequences of topologies as the staged topology based on the total cost matrices corresponding with each sequence of topologies. 2. The method of claim 1, wherein said executing further enables said processing device to perform at least one of: periodically updating the staged topology for the communication network; and updating the staged topology for the communication network upon occurrence of an update triggering event. 3. The method of claim 1 wherein the communication network is a wireless network and wherein one or more of the nodes in the wireless network is equipped with a directional antenna. 4. The method of claim 1 wherein the communication network includes a plurality of clustered nodes interconnected by a plurality of cluster-heads forming a virtual overlay network, and wherein the staged topology is implemented in at least one of the clusters of nodes. 5. The method of claim 1 wherein the communication network includes a plurality of clustered nodes interconnected by a plurality of cluster-heads forming a virtual overlay network, and wherein the staged topology is implemented to connect the cluster-heads. 6. The method of claim 1 wherein the communication network includes a hierarchical structure including a plurality of lower-level cluster-heads clustered into a cluster and associated with an upper level cluster-head, and wherein the staged topology is implemented in at least one of the levels. 7. A communication network implementing a staged topology, said network comprising: a plurality of separate nodes; a plurality of topologies comprising different subsets of available communication links among the nodes; and a staged topology comprising a sequence of two or more of the topologies, wherein information is communicatable among the nodes within the network via communication links arranged in accordance with the topologies included in the staged topology; the staged topology being selected from one or more sequences of topologies based on total cost matrices corresponding with each sequence of topologies, wherein each sequence of topologies corresponds with a sequenced connection matrix obtained by multiplying connection matrices associated with the topologies in each sequence of topologies, wherein the connection matrix associated with each topology includes a plurality of numerical elements cij, indexed by row i and column j where i represents the first of a pair of nodes in the network and j represents the second of a pair of nodes in the network, wherein each numerical element cij is a first value when there is a communication link between node i and node j and is a second value otherwise, wherein the total cost matrices are obtained by multiplying each sequenced connection matrix by a weighting matrix, wherein the weighting matrix includes a plurality of numerical elements wij, indexed by row i and column j where i represents the first of a pair of nodes in the network and j represents the second of a pair of nodes in the network, and wherein each numerical element wij represents a relative cost associated with a communication link from node i to node j. 8. The communication network of claim 7 wherein the staged topology produces a fully connected communication network. 9. The communication network of claim 7 wherein the staged topology for the communication network is periodically updated or is updated upon occurrence of an update triggering event. 10. The communication network of claim 7 wherein the communication network is a wireless network and wherein one or more of the nodes in the wireless network is equipped with a directional antenna. 11. The communication network of claim 7 wherein the communication network includes a plurality of clustered nodes interconnected by a plurality of cluster-heads forming a virtual overlay network, and wherein the staged topology is implemented in at least one of the clusters of nodes. 12. The communication network of claim 7 wherein the communication network includes a plurality of clustered nodes interconnected by a plurality of cluster-heads forming a virtual overlay network, and wherein the staged topology is implemented to connect the cluster-heads. 13. The communication network of claim 7 wherein the communication network includes a hierarchical structure including a plurality of lower-level cluster-heads clustered into a cluster and associated with an upper level cluster-head, and wherein the staged topology is implemented in in at least one of the levels. 14. A system for implementing a staged topology in a communication network including a plurality of nodes, said system comprising: computer readable program code stored on a data storage device, the computer readable program code including: computer readable program code enabling a computer processor to identify a plurality of topologies comprising different subsets of available communication links among the nodes; computer readable program code enabling the computer processor to associate a connection matrix with each identified topology; computer readable program code enabling the computer processor to establish one or more sequences of topologies using the identified topologies; computer readable program code enabling the computer processor to multiply the connection matrices associated with the topologies in each sequence of topologies to obtain a sequenced connection matrix corresponding with each sequence of topologies; computer readable program code enabling the computer processor to multiply each sequenced connection matrix by a weighting matrix to obtain a total cost matrix corresponding with each sequence of topologies; and computer readable program code enabling the computer processor to select one of the sequences of topologies as the staged topology based on the total cost matrices corresponding with each sequence of topologies. 15. The system of claim 14 further comprising: computer readable program code enabling the computer processor to determine which sequences of topologies produce a fully connected communication network; and computer readable program code enabling the computer processor to choose only the sequenced connection matrices corresponding with the sequences of topologies that produce a fully connected communication network for further consideration. 16. The system of claim 15 further comprising at least one of: computer readable program code enabling the computer processor to periodically update the staged topology for the communication network; and computer readable program code enabling the computer processor to update the staged topology for the communication network upon occurrence of an update triggering event. 17. The system of claim 14 wherein the computer processor is included in a controller unit that controls operation of the communication network. 18. The system of claim 14 wherein the connection matrix associated with each topology includes a plurality of numerical elements cij, indexed by row i and column j where i represents the first of a pair of nodes in the network and j represents the second of a pair of nodes in the network, and wherein each numerical element cij is a first value when there is a communication link between node i and node j and is a second value otherwise, and wherein the weighting matrix includes a plurality of numerical elements wij, indexed by row i and column j where i represents the first of a pair of nodes in the network and j represents the second of a pair of nodes in the network, and wherein each numerical element wij represents a relative cost associated with a communication link from node i to node j. 19. The system of claim 14 wherein the computer readable program code that enables the computer processor to select one of the sequences of topologies as the staged topology only selects a sequence of topologies as the staged topology that produces a fully connected communication network. 20. The system of claim 14 wherein the communication network is a wireless network and wherein one or more of the nodes in the wireless network is equipped with a directional antenna.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (12)
Oki Eiji (Tokyo JPX) Yamanaka Naoaki (Tokyo JPX), Data communication routing method and device.
Hershey, John Erik; Korkosz, Richard August; Saulnier, Gary Jude; Al-Dhahir, Naofal Mohammed Wassel, Identification of an identifiable code sequence in a received signal by correlation with summed different-phase replicas of the sequence.
Scott Charles Evans ; John Erik Hershey ; David Michael Davenport ; Harold Woodruff Tomlinson, Jr. ; Ralph Thomas Hoctor ; Kenneth Brakeley Welles, II ; Stephen Michael Hladik, Integrated wireless broadband communications network.
Alfonsi Jean-Pierre (La Gaude FRX) Galand Claude (Cagnes Sur Mer FRX) Lebizay Gerald (Vence FRX) Maurel Olivier (Le Cannet FRX), Method and apparatus to speed up the path selection in a packet switching network.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.