Abstract: The invention disclosed is a process to allocate channels in a sectorized and tiered cellular network. A system of allocating cellular frequencies (channels) to the sectors among the outer tier of cells within a tile is disclosed which maximizes channel set usage within the tile while minimizing co-channel interference between cells. Any unused, or remaining, frequencies for the outer tier of that cell may then be allocated to an inner tier of the cell that has not had a channel allocated thereto. No additional infrastructure or maintenance set-up is required under this technique for allocating the channel to the additional transceiver and a very high degree of channel utilization is achieved.

Abstract: The invention disclosed is a process to allocate channels in a sectorized cellular network. A system of allocating cellular frequencies (channels) to the sectors among the cells within a tile is disclosed which maximizes channel set usage within the tile while avoiding co-channel interference between cells. According to the present system, no infrastructure rebuild is required. The disclosed approach further supports all currently used cellular technology. By alternating and rotating the channel assignments across sectors, what is a seemingly locally poor algorithm utilizing additional local channels is actually a globally good algorithm which is efficient in terms of the total number of channels used owing to short reuse distance and low number of cell types.

Abstract: An algorithm on a computer readable medium for efficiently creating a message efficient virtual backbone in a wireless ad hoc network utilizes three phases to establish an efficient network among the independent transceivers of a wireless ad hoc network. Independent transceivers within the transmission range of each other are neighbors. A leader election and tree construction phase constructs a tree of neighboring transceivers with one transceiver being designated the root and with each transceiver establishing and recording its location in the tree structure and the identifiers of its neighbors; and reporting when the tree is established. A level calculation phase determines the level of each transceiver away from the root transceiver, with each transceiver recording the level of its neighbors.

Abstract: A method for determining an optimal placement of wavelength converters in an optical network while optimizing bandwidth use in which a skeleton undirected graph of a WDM network is generated, a contraction graph is constructed from the skeleton undirected graph, and a minimum vertex cover of the contraction graph is determined.

Abstract: The invention disclosed is a process to allocate channels in a sectorized cellular network. A system of allocating cellular frequencies (channels) to the sectors among the cells within a tile is disclosed which maximizes channel set usage within the tile while avoiding co-channel interference between cells. According to the present system, no infrastructure rebuild is required. The disclosed approach further supports all currently used cellular technology. By alternating and rotating the channel assignments across sectors, what is a seemingly locally poor algorithm utilizing additional local channels is actually a globally good algorithm which is efficient in terms of the total number of channels used owing to short reuse distance and low number of cell types. Frequencies are assigned in an S+X set, where S equals the number of sectors within a cell and X is the number of additional channels needed to complete an alternation scheme that provides sufficient separation between co-channels.

Abstract: The invention disclosed is a process to allocate channels in a sectorized and tiered cellular network. A system of allocating cellular frequencies (channels) to the sectors among the outer tier of cells within a tile is disclosed which maximizes channel set usage within the tile while minimizing co-channel interference between cells. Any unused, or remaining, frequencies for the outer tier of that cell may then be allocated to an inner tier of the cell that has not had a channel allocated thereto. No additional infrastructure or maintenance set-up is required under this technique for allocating the channel to the additional transceiver and a very high degree of channel utilization is achieved.

Abstract: An algorithm for efficiently creating a message efficient virtual backbone in a wireless ad hoc network utilizes three phases to establish an efficient network among the independent transceivers of a wireless ad hoc network. Independent transceivers within the transmission range of each other are neighbors. A leader election and tree construction phase constructs a tree of neighboring transceivers with one transceiver being designated the root and with each transceiver establishing and recording its location in the tree structure and the identifiers of its neighbors; and reporting when the tree is established. A level calculation phase determines the level of each transceiver away from the root transceiver, with each transceiver recording the level of its neighbors. Precedence for each transceiver is established with consideration of each transceiver's tree level and identifier, with tree level being paramount in deciding precedence; and reporting when the levels of the tree are established.