I. Chlamtac and A. Lerner. Fair Algorithms for Maximal Link Activation in Multihop Radio Networks. IEEE Transactions on Communications, 35(7):739-46, July 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Within each frame, a node is assigned at least one slot to transmit. A scheduling algorithm usually finds the shortest possible frame so as to achieve high spatial reuse (and thus high network utilization) and low packet latency. A large amount of early work has been focused on TDMA scheduling [29, 9, 8, 31, 32, 83, 34, 56, 120, 125, 57, 30, 101]. Most of the studies concentrated on devising fair conflictfree algorithms that maximize the system throughput by using graph theory. Most of them are centralized and require global connectivity information. As a result, they cannot adapt adequately, and keep the optimality property, in highly ....

I. Chlamtac and A. Lerner, "Fair Algorithms for Maximal Link Activation in Multihop Radio Networks, " IEEE Trans. Commun., vol. COM-35, pp.739-746, July 1987.

....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 combining both random and scheduled access approaches [6, 7, 27]. Speci cally, a few time slot assignment algorithms were presented by Cidon and Sidi [8] and Pond and Li [22] using a dedicated control segment of the channel to resolve con icts and broadcast channel reservations. However, the complex resolution of neighbor schedules via message exchanges in ....

I. Chlamtac and A. Lerner. Fair algorithms for maximal link activation in multihop radio networks. IEEE Transactions on Communications, 35(7):739{ 46, Jul. 1987.

....nodes or links, such that the communicating nodes couple with each other accordingly, and the transmissions from the nodes or over the links are collision free in the time and frequency axes. Many existing channel access scheduling protocols for ad hoc networks with omnidirectional antennas [2] [3] 20] have to allocate a special period of time for exchanging directional transmission schedules 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 ....

I. Chlamtac and A. Lerner. Fair algorithms for maximal link activation in multihop radio networks. IEEE Transactions on Communications, 35(7):739--46, Jul. 1987.

....has been studied extensively. In periodic schedules a sequence of N sets of links is predetermined and the whole schedule is derived by repetition of this sequence. The problem of determining the sequence of the N sets so that the links are activated in a fair manner has been considered in [2, 4, 7, 8, 10, 13] for several different performance criteria. Scheduling schemes where the system state is taken into account have been considered in [3] Another problem that has been considered is to determine whether a vector of link activation rates is achievable by some schedule [1, 5] The design of delay ....

I. Chlamtac and A. Lerner, Fair algorithm for maximal link activation in multihop packet radio networks, IEEE Trans. Commun. COM-35 (1987) 739-746.

....communication intensive applications with QoS that are comparable to their wireline counterparts. In many of these proposed designs, fair distribution of bandwidth and maximization of resource utilization have been identified as two important design goals, notably for scheduling disciplines [2,3,7]. Fairness is critical to ensure that wellbehaved users are not penalized because of the excessive resource demands of aggressive users. Maximizing resource utilization is critical to e#ectively support communication intensive applications, e.g. web browsing, video conferencing and remote ....

....from the source to the destination, where the source and destination are neighbors. We define two flows as contending flows if either the sender or the receiver of one flow is within the transmission range of the sender or the receiver of the other flow 1 [8,14] We make three assumptions [2,7,8,10]: a) neighborhood is a commutative property and hence flow contention is also commutative, b) a node cannot transmit and receive packets simultaneously, and (c) a collision occurs when a receiver is in the reception range of two simultaneously transmitting nodes, thus unable to 1 Following the ....

[Article contains additional citation context not shown here]

I. Chlamtac and A. Lerner, "Fair algorithms for maximal link activation in multihop radio networks," IEEE Trans. Communications, 35(7), July 1987.

.... links, because of their dependence on collision avoidance handshakes among nodes, which work correctly only over bidirectional links [5] 16] 21] 24] Only a few algorithms based on topologytransparent transmission scheduling are viable for handling unidirectional links in multihop networks [3] [4] [20] However, in these protocols, the sender is unable to know which neighbor(s) can correctly receive its packet in a particular slot. This implies that the sender has to send its packet in the various slots in a frame and that the frame length (number of slots) must be larger than the number ....

I. Chlamtac and A. Lerner. Fair algorithms for maximal link activation in multihop radio networks. IEEE Transactions on Communications, 35(7):739-46, July 1987.

....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 combining both random and scheduled access approaches [4] [5] [24] Speci cally, a few time slot assignment algorithms were presented by Cidon and Sidi [6] and Pond and Li [20] using a dedicated control segment of the channel to resolve con icts and broadcast channel reservations. However, the complex resolution of neighbor schedules via message exchanges ....

I. Chlamtac and A. Lerner. Fair algorithms for maximal link activation in multihop radio networks. IEEE Transactions on Communications, 35(7):739-46, July 1987.

.... scheduling for both wired and packet cellular networks has been an intensive research area in the networking field [1] 9] In multihop wireless networks, providing minimum throughput and bounded delay access has been studied at the MAC layer and some representative works on this topic include [14] [17] These works seek to design conflict free link scheduling schemes that attempt to maximize channel spatial reuse and remain immune to topological changes in the presence of node mobility, and they are typically developed within the TDMA like MAC protocol. The focus of these MAC layer ....

I. Chlamtac and A. Lerner, "Fair algorithms for maximal link activation in multihop radio networks," IEEE Trans. Communications, 35(7), July 1987.

....intensive applications with service assurances that are comparable to their wireline counterparts. In many of these proposed designs, fair distribution of bandwidth and maximization of resource utilization have been identi ed as two important design goals, notably for scheduling disciplines [2, 3, 7]. Fairness is critical to ensure that wellbehaved users are not penalized because of the excessive resource demands of aggressive users. Maximizing resource utilization is critical to e ectively support communicationintensive applications, e.g. web browsing, video conferencing and remote transfer ....

....transmitted from the source to the destination, where the source and destination are neighbors. We de ne two ows as contending ows if either the sender or the receiver of one ow is within the transmission range of the sender or the receiver of the other ow # [8, 14] Wemake three assumptions [2, 7, 8, 10]: a) neighborhood is a commutative property and hence ow contention is also commutative, b) a node cannot transmit and receive packets simultaneously, and (c) a collision occurs when a receiver is in the reception range of twosimultaneously transmitting nodes, thus unable to cleanly receive ....

[Article contains additional citation context not shown here]

I. Chlamtac and A. Lerner, \Fair algorithms for maximal link activation in multihop radio networks," IEEE Trans. Communications, 35(7), July 1987.

....to verify that the total e ective capacitywillbelessthan2# if all ve ows have to transmit and get a fair share. This example illustrates the fundamental con ict between achieving ow fairness and maximizing overall system throughput. Because of these unique challenges, state of the art solutions [9 12] are inadequate to meet al..l design goals. In fact, many problems such as fair packet scheduling for shared channel multihop wireless networks have remained largely unaddressed. 2.2. Design Goals Our ultimate goal is to provide sustained QoS support in terms of fairness, throughput, delay, packet ....

....when it perceives acleanchannel. Therefore, lagging ows (that lag behind their error free reference service due to channel errors) receive compensation from leading ows. In multihop wireless networks, providing minimum throughput bounds and bounded delay access has been studied at the MAC layer [9 12]. A popular approach has been to establish transmission schedules and allocate stations to di erent time slots of a TDMA cycle in a way that no collisions occur. The goal is to design con ict free packet scheduling schemes that seeks to maximize spatial reuse and remain immune to topological ....

I. Chlamtac and A. Lerner, \Fair algorithms for maximal link activation in multihop radio networks," #### ###### ############### 35(7), July 1987.

....receiver of the other F2 F1 F5 F3 F6 F4 F1 F2 F3 F4 F5 AB D E FC F1 F2 F3 F4 F5 F6 A B C D E F Flow Contention Graph Conflict between fairness and maximal utilization (b) a) Original Topology Figure 1. Spatial Contention and Reuse flow 1 [5] We make three assumptions [9, 8, 5, 7]: a) neighborhood is a commutative property and hence flow contention is also commutative, b) a node cannot transmit and receive packets simultaneously, and (c) a collision occurs when a receiver is in the reception range of two simultaneously transmitting nodes, thus unable to cleanly receive ....

....17 Poisson flows, Distributed implementation way that no collisions occur. The design goal is to design conflict free link scheduling schemes that seek to maximize the spatial reuse of the bandwidth and remain immune to topological changes in a mobile ad hoc networking environment. Another study [8] also investigates the fair link activation problem in such a network. However, all these previous studies seek to provide throughput guarantees or weighted fairness for wireless links, not for packet flows; hence, they do not address the problem of fair scheduling of packet flows. Besides, the ....

I. Chlamtac and A. Lerner, "Fair algorithms for maximal link activation in multihop radio networks," IEEE Trans. Communications, 35(7), July 1987.

....(LSP)aims to find asBBjSN2 s hedule of activating everyrequesfiB link withoutconflicts In [4] Arikan proved the NPcompletenes of LSP without tolerance of these2LKN53 conflict. In [5] NelsB and Kleinrock prop osp an approximation algorithm for LSP by finding a clique cover of a PR network. In [6], Chlamtac and Lerner prop adisB52flNB5 algorithm for obtaining a fairs hedule. In [7] Hajek andSasB4 prop osp polynomial time algorithms for LSP with tolerance of these2L434S conflict. Thebroadcas s heduling problem (BSP)requires to find asBLjBfi2 TDMA cycle for every node to broadcas a packet ....

I. Chlamtac and A. Lerner, "Fair algorithms for maximal link activation in multihop radio networks," IEEE Trans. Commun., vol.COM-35, no.7, pp.739--746, July 1987.

....intensive applications with service assurances that are comparable to their wireline counterparts. In many of these proposed designs, fair distribution of bandwidth and maximization of resource utilization have been identi ed as two important design goals, notably for scheduling disciplines [2, 3, 7]. Fairness is critical to ensure that wellbehaved users are not penalized because of the excessive resource demands of aggressive users. Maximizing resource utilization is critical to e ectively support communicationintensive applications, e.g. web browsing, video conferencing and remote transfer ....

....from the source to the destination, where the source and destination are neighbors. We de ne two ows as contending ows if either the sender or the receiver of one ow is within the transmission range of the sender or the receiver of the other ow 1 [8, 14] We make three assumptions [2, 7, 8, 10]: a) neighborhood is a commutative property and hence ow contention is also commutative, b) a node cannot transmit and receive packets simultaneously, and (c) a collision occurs when a receiver is in the reception range of two simultaneously transmitting nodes, thus unable to cleanly receive ....

[Article contains additional citation context not shown here]

I. Chlamtac and A. Lerner, \Fair algorithms for maximal link activation in multihop radio networks," IEEE Trans. Communications, 35(7), July 1987.

....where every node is not able to communicate with every other node. For brevity, we also use the term multi hop network to refer to a multi hop wireless network. This section discusses the design issues related to developing a fair scheduling algorithm in multi hop networks. With the exception of [33], we are unaware of other work in this area. Reference [33] considers a related problem of assigning time slots to links in a multihop network such that the number of time slots assigned to a link in a cyclic schedule is proportional to its weight. However, 33] does not consider the possibility ....

....node. For brevity, we also use the term multi hop network to refer to a multi hop wireless network. This section discusses the design issues related to developing a fair scheduling algorithm in multi hop networks. With the exception of [33] we are unaware of other work in this area. Reference [33] considers a related problem of assigning time slots to links in a multihop network such that the number of time slots assigned to a link in a cyclic schedule is proportional to its weight. However, 33] does not consider the possibility that some links (or, more generally, flows) may not be ....

[Article contains additional citation context not shown here]

I. Chlamtac and A. Lerner, "Fair Algorithms for Maximal Link Activation in Multihop Radio Networks, " IEEE Transactions on Communications, vol. COM-35, no. 7, pp. 739-746 (July 1987).

....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] addresses re scheduling when the network topology is dynamic. With regard ....

....networks containing unidirectional links. Communicating equipment forming a wireless link may differ in terms of transmission power levels, multipath interference experienced, and noise or jamming experienced. Thus, the assumption that links are bidirectional, made in several previous works (e.g. [15, 16, 17, 18, 25, 27, 28]) seems to be unrealistic. The generalization to directed graphs, however, is non trivial as far as problem complexity is concerned, as will be evident from the analysis in section 4. Using this graph theoretic model, we develop in section 2 a unified framework for the postulation of assignment ....

[Article contains additional citation context not shown here]

I. Chlamtac and A. Lerner, "Fair Algorithms for Maximal Link Activation in Multihop Radio Networks," IEEE Transactions on Communications, vol COM-35, Jul. 1987, pp. 739-746.

No context found.

I. Chlamtac and A. Lerner. Fair Algorithms for Maximal Link Activation in Multihop Radio Networks. IEEE Transactions on Communications, 35(7):739-46, July 1987.

No context found.

I. Chlamtac and A. Lerner. Fair algorithms for maximal link activation in multihop radio networks. IEEE Transactions on Communications, 35(7):739--46, July 1987.

No context found.

I. Chlamtac and A. Lerner. Fair algorithms for maximal link activation in multihop radio networks. IEEE Transactions on Communications, 35(7):739--46, July 1987.

No context found.

I. Chlamtac and A. Lerner. Fair algorithms for maximal link activation in multihop radio networks. IEEE Transactions on Communications, 35(7):739--46, July 1987.

No context found.

I. Chlamtac and A. Lerner. Fair algorithms for maximal link activation in multihop radio networks. IEEE Transactions on Communications, 35(7):739--46, July 1987.

No context found.

Chlamtac, I. and A. Lerner, `Fair algorithms for Maximal Link Activation in Multihop Radio Networks'. IEEE Transactions on Communications 35(7), 739--746.

No context found.

I. Chlamtac and A. Lerner, "Fair algorithms for maximal link activation in multihop radio networks," IEEE Trans. Communications, 35(7), July 1987.

No context found.

CHLAMTAC, I., AND LERNER, A. Fair algorithms for maximal link activation in multihop radio networks. IEEE Transactions on Communications 35, 7, 739--746.

No context found.

I. Chlamtac and A. Lerner. Fair algorithms for maximal link activation in multihop radio networks. 35(7):739--746.

No context found.

I. Chlamtac and A. Lerner. Fair Algorithms for Maximal Link Activation in Multihop Radio Networks. IEEE Transactions on Communications, 35(7):739-46, July 1987.

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