S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1--24, 1984.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....channel access time table is typically treated as a nodeor link coloring problem on graphs representing the network topologies. The problems of optimally scheduling access to a common channel are some of the classic NP hard problems in graph theory (k colorability on nodes or edges) 31] [34] [69] Polynomial algorithms are known to achieve suboptimal solutions using heuristics based on such graph attributes as the degree of the nodes. A unified framework for TDMA FDMA CDMA channel assignments, called UxDMA algorithm, was described by Ramanathan [65] UxDMA summarizes the patterns of ....

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1--24, Mar. 1984.

....conflict free channel access timetable is typically treated as a node or link coloring problem on graphs representing the network topologies. The problem of optimally scheduling access to a common channel is one of the classic NP hard problems in graph theory (kcolorability on nodes or edges) 6] [7] [15] Polynomial algorithms are known to achieve suboptimal solutions using randomized approaches or heuristics based on such graph attributes as the degree of the nodes. A unified framework for TDMA FDMA CDMA channel assignments, called UxDMA algorithm, was described by Ramanathan [14] UxDMA ....

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1--24, Mar. 1984.

....and the peer to peer scheduling needed in ad hoc networks is much harder to solve. The quest for optimal solutions to channel access scheduling in ad hoc networks (i.e. multihop packet radio networks) often results in NP hard problems in graph theory (such as k colorability on nodes or edges) [10, 11, 24]. In some cases, however, the problems can be solved by reducing them to simpler ones for which polynomial algorithms are known to achieve suboptimal solutions using randomized approaches or heuristics based on such graph attributes as the degree of the nodes. Many solutions have been proposed ....

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1-24, Mar. 1984.

....using the broadcast feature of the antennas, if they are applied in ad hoc networks with directional antennas. Given the complete topology information of the ad hoc network, the computation of an optimal channel access schedule has long been known to be an NPhard problem in graph theory [5] [6] [13] Ramanathan [11] provided a unified framework, called UxDMA, for time, frequency or code division multiple access channel assignment using polynomial steps. Obviously, collecting the complete topology of the network and distributing the corresponding schedule pose a major challenge for ....

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1--24, Mar. 1984.

....for transmission of messages. Schedule length is measured by the number of time slots in a schedule. A schedule is said to be optimal if it uses the minimum number of slots. The problems associated with the construction of an optimal schedule have been studied extensively by researchers [1, 2, 3, 4, 5, 6, 7]. Most of these studies dealt with the construction of two different types of schedules, broadcast schedules and link schedules, under two different types of interferences, primary interference and secondary interference [1, 2] In a broadcast schedule each transceiver is scheduled to ensure ....

....transmission range of both a and b. In this case if a and b start simultaneous transmissions then c will be expected to receive from both a and b at the same time. We refer to this as type 2 primary interference. 2 Prior work For the purpose of constructing an optimal schedule all prior research [1, 2, 3, 4, 5, 6, 7] modeled a packet radio network as a graph, where a node in the graph represents a transceiver and there is a directed edge from the node v i to the node v j if the transceiver j is within the transmission range of the transceiver i. It may be noted that the resulting graph is a directed graph in ....

[Article contains additional citation context not shown here]

S. Even, O. Goldreich, S. Moran, and P. Tong, "On the np--completeness of certain network testing problems," Networks, vol. 14, pp. 1--24, 1984.

....in the various slots in a frame and that the frame length (number of slots) must be larger than the number of nodes in a two hop neighborhood and depends on the network size, which is less scalable. The problem of deriving an optimal channel access schedule in multihop network is NP hard [6] [7] [18] Polynomial algorithms are known to achieve suboptimal solutions. A uni ed framework for (T F C)DMA channel assignment, called UxDMA, was described by Ramanathan [17] to compute a k coloring of a directed graph in polynomial steps. The heuristic consists of starting coloring nodes or ....

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1-24, Spring 1984.

....the peer to peer scheduling needed in ad hoc networks is much harder to solve. The quest for optimal solutions to channel access scheduling in ad hoc networks (i.e. multihop packet radio networks) often results in NP hard problems in graph theory (such as k colorability on nodes or edges) 8] [9] [22] In some cases, however, the problems can be solved by reducing them to simpler cases for which polynomial algorithms are known to achieve suboptimal solutions using randomized approaches or heuristics based on such graph attributes as the degree of the nodes. Many solutions have been ....

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1-24, Spring 1984.

....topology is dynamic. With regard to CDMA, 27] study the complexity of the problem, and [26, 27, 28] propose code assignment algorithms. Distributed algorithms are given in [28, 27] Many assignment problems in this area have been shown to be NP complete, including TDMA broadcast scheduling [16, 36, 17], link scheduling [21, 36] even when the graphs are planar [33] FDMA frequency assignment [12] and CDMA code assignment [27] Indeed, for some of these problems, even constant times optimum polynomial algorithms appear highly unlikely (i.e. unless P=NP) 33] However, these results are ....

....regard to CDMA, 27] study the complexity of the problem, and [26, 27, 28] propose code assignment algorithms. Distributed algorithms are given in [28, 27] Many assignment problems in this area have been shown to be NP complete, including TDMA broadcast scheduling [16, 36, 17] link scheduling [21, 36] (even when the graphs are planar [33] FDMA frequency assignment [12] and CDMA code assignment [27] Indeed, for some of these problems, even constant times optimum polynomial algorithms appear highly unlikely (i.e. unless P=NP) 33] However, these results are applicable to arbitrary ....

[Article contains additional citation context not shown here]

S. Even, O. Goldreich, S. Moran, P. Tong, "On the NP-completeness of certain network testing problems," Networks, Vol. 14, 1984.

No context found.

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1--24, 1984.

No context found.

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1--24, Spring 1984.

No context found.

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1--24, Spring 1984.

No context found.

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14:1--24, 1984.

No context found.

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NPcompleteness of Certain Network Testing Problems. Networks, 14, 1984.

No context found.

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1--24, Spring 1984.

No context found.

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1--24, Spring 1984.

No context found.

S. Moran S. Even, O. Goldreich and P. Tong. On the NP-completeness of certain network testing problem. Networks, 14(1):1--24, March 1984.

No context found.

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1--24, Mar. 1984.

No context found.

S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1--24, Mar. 1984.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC