R. Ramaswami and K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM, volume 2, pages 497--504, Otawa, Canada, April 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....simultaneous broadcast to the same receiver which results in a scrambled signal. A number of authors have shown that the problem of minimizing the number of rounds required to realize communication between an arbitrary set of neighboring nodes is NP hard and or have provided heuristics for it [2, 3, 6, 12, 13]. Sen and Huson [15] point out these previous authors assumed that the underlying graphs were arbitrary (and therefore the NP hardness easily follows from known graph coloring problems) They show that the problem remains NP hard when restricted to the domain of possible packet radio graphs and ....

R. Ramaswami and K. Parhi, "Distributed scheduling of broadcasts in a radio network," Proc. 8th Annual Joint Conference of IEEE Computer and Communication Societies INFOCOM, 1989, pp. 497--504.

....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 many ....

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In Proceedings of IEEE Conference on Computer Communications 161 (INFOCOM), volume 2, pages 497--504, Ottawa, Ont., Canada, Apr. 23-27 1989. IEEE Comput. Soc. Press.

....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 ....

R. Ramaswami and K. Parhi. Distributed scheduling of broadcasts in a radio network. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), volume 2, pages 497--504, Ottawa, Ont., Canada, Apr. 23-27 1989. IEEE Comput. Soc. Press.

....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 ....

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM'89, volume 2, pages 497-504, Ottawa, Ont., Canada, Apr. 23-27 1989. IEEE Comput. Soc. Press.

....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 applying ....

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In Communications (INFOCOM), volume 2, pages 497--504, Ottawa, Ont., Canada, Apr. 23-27 1989. IEEE Comput. Soc. Press.

....for point to point links of ad hoc networks. We present a distributed algorithm for subcarrier allocation and compare its performance to a centralized graph theoretic heuristic. 2. RELATED WORK We now briefly review some prior work on channel allocation techniques for ad hoc networks. In [9] and [10] TDMA broadcast scheduling is considered, while in [11] and [12] the authors study TDMA link scheduling. An investigation into the complexity of scheduling problems is given in [13] Distributed scheduling algorithms are presented in [12] and [14] Many assignment problems have been shown ....

S. Ramaswami and K.K. Parhi, "Distributed Scheduling of Broadcasts in a Radio Network", Proc. IEEE INFOCOM '89.

....to some few miles) Motivated by such applications, linear radio networks have been considered in several papers (see for instance [3, 8, 12, 13] 1. 1 Previous Results Routing, broadcasting and scheduling problems on radio networks have been the subject of sev eral papers over the last years [1, 5, 4, 9, 14, 16, 17]. Tradeoffs between connectivity and power consumption have been obtained in [7, ll, 15, 18] As for the MIN D DIM ASSIGNMENT problem, several complexity results have been obtained for the unbounded case (i.e. when h n 1) Under this restriction, MIN 3 DIM ASSIGNMENT is APX complete (in [11] ....

R. Ramaswami and K. Parhi. Distributed scheduling of broadcasts in radio network. INFO- COM, pages 497-504, 1989.

....routing table updates) are transmitted in broadcast mode for efficiency. Currently proposed node activation algorithms can be broadly divided into two categories: topology dependent (graphbased) and topology transparent (code based) Topology dependent (graph based) scheduling algorithms ( 1] [2], 3] 4] 5] dynamically re assign time slots, in a distributed manner, within a two hop neighborhood in response to topology (connectivity) changes. The disadvantage of topology dependent TDMA scheduling algorithms is that their efficiency and robustness is vulnerable in a highly mobile ....

....C f 0 f 1 f 2 s,f C STDMA Control Frame STDMA Control Segment STDMA Control Slot Sender Query Rcvr(1) Assignment Sender Confirmation Rcvr(D) Assignment Sender Confirmation . 123 2D 2D 1 123 2D 2D 1 c d R R a b R R Sender[1] Query Receiver[1] Assignment Receiver[2] Assignment Sender[2] Query c d R R a b R R Sender[1] Query Receiver[1] Assignment Receiver[2] Assignment Sender[2] Query Initial Value [R(s, f, i) 1 P(i, j) minimum power level at which i and j can successfully close the link between them. P(i, j) P(j, i) N(i, j) ....

[Article contains additional citation context not shown here]

R. Ramaswami and K.K.Parhi, "Distributed scheduling of broadcasts in a radio network," in IEEE INFOCOM '89, Ottawa, Ont., Canada, April 1989

....into subgroups of completely interconnected nodes Such problems arise in the design of sensor network, where a collection of nodes is assigned the joint task of tracking a particular object. In their general form, all three of the above problems are known to be NP hard (see, for example, 9] and [17]) In this paper we will first formulate these problems as distributed constraint satisfaction problems. We will then show that with each problem there exists a complexitytuning parameter for which the probability that a solution exists undergoes a 0 1 phase transition. We also show that the ....

....ALOHA [1] and Busy Tone Multiple Access (BTMA) 20] are useful for applications with bursty traffic conditions. In these protocols nodes share the same broadcast channel and transmit whenever they need to. The scheduled access techniques that have been proposed for ad hoc networks [2] 16] [17] are better suited for non bursty traffic conditions. In a typical scheduled access protocol, the available bandwidth is divided into multiple logical channels defined on the basis of differing time slots, frequency slots, spreading codes, or a combination thereof. Transmit power is limited so ....

[Article contains additional citation context not shown here]

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In INFOCOM, pages 497--504, 1989.

....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]

R. Ramaswami and K. K. Parhi, "Distributed scheduling of broadcasts in a radio network," in INFOCOM, pp. 497--504, IEEE, 1989.

....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 edges ....

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM'89, volume 2, pages 497-504, Ottawa, Ont., Canada, 23-27 April 1989. IEEE Comput. Soc. Press.

....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 proposed ....

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM'89, volume 2, pages 497-504, Ottawa, Ont., Canada, 23-27 April 1989. IEEE Comput. Soc. Press.

....is assigned to a time slot within its two hop neighborhood. Optimal TDM (time division multiplexing) scheduling for broadcasting channel access in multi hop packet radio networks has been shown to be an NP complete problem even with the global topology knowledge by all nodes within the network [3] [8]. Cidon and Sidi [2] Pond and Li [7] proposed distributed algorithms based on out of band signaling that eliminate direct interference (primary conflict) and hidden terminal interference (secondary conflict) 11] within the transmission segment of the channel, however, under a considerable ....

....CTMA allows a time slot to be shared by twohop neighbors without conflict and time consuming contention phases. The only requirement is the knowledge of its two hop neighbors by each node, which is also a requirement of several other topology dependent transmission scheduling solutions [2] 4] [8]. For each time slot, nodes run a common algorithm that produces a permutation of their contending two hop neighbors. A node that finds itself at the head of the permutation is permitted to transmit. As the permutation changes from time slot to time slot, nodes take turns for transmissions. Since ....

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM'89 The Conference on Computer Communications. Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies, volume 2, pages 497-- 504, Ottawa, Ont., Canada, 23-27 April 1989. IEEE Comput. Soc. Press.

....are variations of ALOHA [1] and Busy Tone Multiple Access (BTMA) 17] both of which are useful for bursty tra#c conditions. In these techniques, nodes share the same broadcast channel and transmit whenever they need to. The scheduled access techniques that have been proposed for ad hoc networks [12, 15, 2] are better suited for non bursty tra#c conditions. In scheduled access techniques the available bandwidth is typically divided into multiple time, frequency, or code division multiple access channels. Each node schedules its transmission on di#erent channels in such a way as to avoid conflicts ....

....into multiple time, frequency, or code division multiple access channels. Each node schedules its transmission on di#erent channels in such a way as to avoid conflicts with neighboring nodes and achieve e#cient spacial reuse. The problem of scheduled access in ad hoc networks in general is NP hard [15]. Consider an ad hoc wireless network consisting of n nodes each of which transmits with the same power. We will assume that the transmission range of each node can be modelled as a circle of some radius R centered at the node. Let each node i in the network have a specified tra#c need for t i ....

K.K. Parhi R. Ramaswami. Distributed scheduling of broadcasts in a radio network. In INFOCOM, pages 497--504, 1989.

....is that there is no central infrastructure and thus the channel assignment is done in a distributed fashion via carrier sensing much as in a traditional CSMA scheme. Use of carrier sensing to perform channel assignment also distinguishes it from the traditional broadcast scheduling problem [18, 17] in a spatially disperse packet radio network, where channel assignment is performed via a central control or via additional message communication and synchronization. None of them are viable in an ad hoc setting. 2 MULTICHANNEL CSMA PROTOCOL Multiple channel CSMA protocols are not entirely new. ....

R. Ramaswami and K. K. Parhi. "Distributed scheduling of broadcasts in radio networks". In Proceedings of IEEE INFOCOM'89, pages 496--504, 1989.

....and fi = 2, all the results of this paper can be easily extended to any pair of constants fl 1 and fi 1. 1. 1 Previous works Routing, broadcasting and scheduling problems on radio networks have been the subject of several papers over the last years [Ari84, CGG 00, CF94, ET90, PL95, RL93, RP89] Tradeoffs between connectivity and energy consumption have been obtained in [KKKP97, MM96, Pir91, UY96] In particular, Kranakis et al. provide the following Theorem 1 (The Uniform Chain Case [KKKP97] Let N be a set of n colinear points at unit distance. It holds that 1 ffl opt h (N) ....

R. Ramaswami and K. Parhi. Distributed scheduling of broadcasts in radio network. INFOCOM, pages 497--504, 1989.

....maximize the expected one hop progress of a packet assuming randomly distributed packet radio terminals are broadcasting packets with fixed probability of transmission. A number of authors have shown that the problem of scheduling communications is NP complete and have provided heuristics for it [1, 2, 6, 7]. Sen and Huson [8] point out these previous authors assumed that the underlying graphs were arbitrary (and therefore the NP completeness generally follows from known graph coloring problems) They show that the problem remains NP complete when restricted to the domain of possible packet radio ....

R. Ramaswami and K. Parhi, "Distributed scheduling of broadcasts in a radio network," INFOCOM, 1989, pp. 497--504.

....work Much of the prior work in the spatial reuse of channel assignment in multihop wireless networks may be classified based on the technology, FDMA, TDMA or CDMA, that they cater to. Frequency assignment has been well studied, mostly in the context of cellular networks [11, 12, 13, 14] In [15, 16, 17], the TDMA scheduling of broadcasts is considered, while in [18, 19, 20] TDMA link scheduling is considered. An investigation into the complexity of the scheduling problem is given in [21, 22] Distributed scheduling algorithms are the subject of [17, 23, 15, 32] and the work of [15, 24, 25] ....

....cellular networks [11, 12, 13, 14] In [15, 16, 17] the TDMA scheduling of broadcasts is considered, while in [18, 19, 20] TDMA link scheduling is considered. An investigation into the complexity of the scheduling problem is given in [21, 22] Distributed scheduling algorithms are the subject of [17, 23, 15, 32], and the work of [15, 24, 25] addresses re scheduling when the network 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 ....

[Article contains additional citation context not shown here]

R. Ramaswami, K. K. Parhi, "Distributed Scheduling of Broadcasts in a Radio Network," Proc. IEEE INFOCOM, 1989.

....all of which have the same range. Unlike graph based models, however, in this model when a node transmits, all the nodes within range can receive and simultaneous transmissions result in collisions. Other authors have chosen to use a graphical representation for similar packet radio models, [8, 2], and developed gossiping schedules based upon graph coloring algorithms. In this paper we assume that all the nodes in the system are equipped with radios of different transmission ranges. Further, as in [10, 11] we assume that all the nodes are placed upon a line and all communication occurs ....

R. Ramaswami and K.K. Parhi, Distributed Scheduling of Broadcasts in a Radio Network, INFOCOM'89 (1989) 497-504.

No context found.

R. Ramaswami and K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM, volume 2, pages 497--504, Otawa, Canada, April 1989.

No context found.

R. Ramaswami and K. K. Parhi. Distributed scheduling of broadcast in a radio network. In Proceedings IEEE INFOCOM, pages 497-504, 1989.

No context found.

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM'89, volume 2, pages 497--504, Ottawa, Ont., Canada, 23-27 April 1989. IEEE Comput. Soc. Press.

No context found.

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM'89, volume 2, pages 497--504, Ottawa, Ont., Canada, 23-27 April 1989. IEEE Comput. Soc. Press.

No context found.

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM'89, volume 2, pages 497--504, Ottawa, Ont., Canada, 23-27 April 1989. IEEE Comput. Soc. Press.

No context found.

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM'89, volume 2, pages 497--504, Ottawa, Ont., Canada, 23-27 April 1989. IEEE Comput. Soc. Press.

No context found.

R. Ramaswami and K.K. Parhi, Distributed scheduling of broadcasts in a radio network, in: Proc. of INFOCOM, 1989, pp. 497--504.

No context found.

R. Ramaswami and K. Parhi. Distributed scheduling of broadcasts in a radio network. In Proceedings of IEEE Conference on Computer Commnications (INFOCOM) , volume 2, pages 497--502, Ottawa, Ont., Canada, Apr. 23-27 1989. IEEE Comput. Soc. Press.

No context found.

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), volume 2, pages 497--504, Ottawa, Ont., Canada, Apr. 23-27 1989. IEEE Comput. Soc. Press.

No context found.

R. Ramaswami and K. Parhi, "Distributed scheduling of broadcasts in a radio network," Proc. IEEE INFOCOM, 1989.

No context found.

R. Ramaswami and K. K. Parhi, "Distributed scheduling of broadcasts in a radio network," Proc. INFOCOM, 1989.

No context found.

R. Ramaswami and K. Parhi, Distributed Scheduling of Broadcasts in a Radio Network. In Proc. IEEE INFOCOM'89, Ottawa, Ont., Canada, Apr. 1989.

No context found.

R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM'89, volume 2, pages 497--504, Ottawa, Ont., Canada, Apr. 23-27 1989. IEEE Comput. Soc. Press.

No context found.

R. Ramaswami and K. K. Parhi. Distributed scheduling of broadcast in a radio network. In Proceedings IEEE INFOCOM, pages 497-504, 1989.

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