Citation Context

...not sufficient to measure network interference/capacity, since a link still can use one of many channels for transmission. access model is hard. The previous works in the literature [15], [16], [17], =-=[18]-=- that maximize overall network throughput, assume a time-slotted synchronized medium access model with scheduling as one part of the problem. In a timeslotted synchronized medium access model, modelin...

Citation Context

...., [14]) or scheduling problem (e.g., [2, 3, 4, 5, 16]), without consideration of cross-layer optimization. Cross-layer optimization problems considering joint routing and scheduling include those in =-=[7, 13]-=-. In these efforts, however, power control is not part of the optimization space. With fixed power, both the interference relationship among links and the capacity of each link can be computed easily....

Citation Context

... similarities with the routing and channel assignment problem in multi-channel networks. There are numerous work in this area, including centralized [2], topology-optimized [13] and multi-radio based =-=[10]-=-, [7] solutions. However, they are not applicable to our problem, because our system is ad hoc with arbitrary topology and our problem falls into distributed solutions with single-radio for data commu...

Citation Context

...ssions on any time slot and channel without violating the constraints. Approximation bounds on JFTSS for single-channel systems and its comparison with multi-channel systems are discussed in [22] and =-=[23]-=-, respectively. JFTSS schedules a network starting from the link that has the highest number of packets (load) to be transmitted. When the link loads are equal, such as in aggregated convergecast, the...

Citation Context

...adio can only access one channel at a time. Therefore, if each network node has multiple radio interfaces, it can then utilize a larger amount of bandwidth, and hence achieve a higher system capacity =-=[2]-=-, [3]. Such an improved bandwidth and capacity network poses a bright application foreground for large data video communications. However, there are huge and different kinds of videos streaming from d...

Citation Context

...u has a transmission range rtx(u). A necessary condition for edge w = (u, v) ∈ E to be present is that node v is within a distance of rtx(u) from u. We consider seven models: (a) Node-exclusive model =-=[13]-=-; (b) Non-uniform RTS-CTS model [9], [20]; (c) Uniform RTS-CTS model with parameter q [1]; (d) Tx-model [10], [22]; (e) fPrIM model [20]; (f) Protocol model [6], [10]; and (g) K-hop model [17]. In all...

Citation Context

...e.g., [1]–[4], [8], [17], [29]), and distributed power control (e.g., [18]). Furthermore, there have also been efforts that consider distributed optimization from a cross-layer perspective [6], [10], =-=[11]-=-, [16]. In [6] and [11], cross-layer problems for joint optimization of routing and scheduling were studied. In these efforts, however, power control was not part of the optimization space. In [10], L...

Citation Context

...is capable of fast switching on per-packet level [4, 7, 14, 23, 25, 29] while another approach assigns channels to multiple radios for a relatively long time [6, 15, 19, 20, 24, 26]. Some other works =-=[3, 7, 10, 12, 21, 22, 27]-=- produce the routing strategy while considering the CA in order to maximize the network capacity. Recently, there are also some studies on the mechanism of partially overlapped channels [13, 16–18], w...