Influence of dynamic channel allocation on the transmission delay in wireless ATM networks

Kramling, A.; Scheibenbogen, M.

doi:10.1109/icupc.1998.732823

Cited by 10 publications

(7 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The channel assignment problem is usually formulated in the engineering literature as a nonlinear optimization problem. A huge collection of contributions in IEEE journals explore various aspects of current research on radio channel assignment problems, among them "IEEE Transactions on Vehicular Technology" [1,2,4,16,18,20,21,25,33,40,42,49,50,51], "IEEE Transactions on Wireless Communication" [15,30], "IEEE/ACM Transactions on Networking" [3,5], "IEEE/ACM Transactions on Parallel and Distributed Systems" [7,32], "Wireless Networks" [39,46,52], and IEEE Conferences [6,9,10,17,27,44].…”

Section: Recent Progress On Channel Assignmentsmentioning

confidence: 99%

“…Wireless networks include cellular mobile networks, wireless computer networks [5], wireless ATM networks [39], and private mobile radio networks [52]. Mobile multimedia applications with variable data rate transmission for such integrated services can be done by means of efficient assignment of time slots, frequencies, codes, or their combinations [15].…”

Section: Recent Progress On Channel Assignmentsmentioning

confidence: 99%

See 1 more Smart Citation

Recent progress in mathematics and engineering on optimal graph labellings with distance conditions

Griggs

Jin

2007

J Comb Optim

View full text Add to dashboard Cite

The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance conditions has been investigated for several years now, and the authors recently introduced a new model of real number labellings that is giving deeper insight into the problems. Here we present an overview of the recent outpouring of papers in the engineering literature on such channel assignment problems, with the goal of strengthening connections to applications. Secondly, we present a new contribution to the theory, the formulas for the optimal span of labellings with conditions at distance two for finite complete bipartite graphs.

show abstract

Section: Recent Progress On Channel Assignmentsmentioning

confidence: 99%

Section: Recent Progress On Channel Assignmentsmentioning

confidence: 99%

Recent progress in mathematics and engineering on optimal graph labellings with distance conditions

Griggs

Jin

2007

J Comb Optim

View full text Add to dashboard Cite

show abstract

“…Similarly, packet-scheduling and transmission strategies for TDD systems have been proposed to reduce the transmission delay [20], maximize capacity [21], [22], and minimize overall interference [23].…”

mentioning

confidence: 99%

Modeling Dynamic Channel-Allocation Algorithms in Multi-BS TDD Wireless Networks With Internet-Based Traffic

Cooper

Zeidler

Bitmead

2004

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-Future time-division-duplex (TDD) systems operating over small wireless networks will utilize intelligent base station (BS)-coordinated dynamic channel-allocation algorithms in order to support high-bandwidth asymmetric traffic in adjacent cells. In this paper, we use extensive measurements of wireless Internet traffic from a large 802.11b network to create two random traffic models. One model, called "binomial," is memoryless and the other, called "dynamic," is based on an event-driven Markov state model with bidirectional flows and deterministic residence times. We then develop a two-BS two-zone wireless TDD interference model that describes the spatial features of interference between cochannel mobile stations (MSs) in adjacent BSs. This is a simplified precursor to more sophisticated models for multiple BSs and/or multisector BSs. We present a set of candidate TDD channel-allocation algorithms, which vary in their level of time-slot coordination and intelligent allocation between BSs. Lastly, we combine the three components (i.e., traffic models, interference models, and channel-allocation algorithms) to demonstrate the capacity for evaluating dynamic channel-allocation algorithms in realistic interference and Internet traffic scenarios. The results show that, for active MSs, the dynamic traffic model has a higher number of packet requests per time frame than the binomial traffic model, given the same mobile activity factor. Additionally, fixed channel-allocation algorithms generally perform much worse than pseudorandom and intelligent BS-coordinated algorithms, especially for asymmetric BSs. The pseudorandom algorithm performs well at low traffic, but suffers from severe interference blocking at high traffic. The intelligent BS-coordinated algorithm performs best, as it avoids MS-to-MS interference blocking from nearby users in adjacent cells and maximizes the overall throughput by attempting to allocate up-and downlink packet requests in corresponding time slots matched to the incoming uplink-downlink traffic demand for each time frame.

show abstract

“…Whereas in the BCC and URB scenarios the initial objective is overcome, in the BCC scenario the goal of supporting 200 user/km cannot be achieved only with a single operator. It is worthwhile to note that K = 2 corresponds to using the 40 GHz band and/or the upper 1 GHz sub-band of the 60 GHz band, while K = 3 corresponds to the lower 1 GHz sub-band of the 60 GHz band [4]. The spectral efficiency is lower for the ROA scenario, because of the high terminal mobility, which strongly degrades system performance.…”

Section: B Supported Trafficmentioning

confidence: 99%

“…Because traffic can be generated from different mixtures of voice, data or video sources, it is important to obtain performance measures for resource usage, making use of the characteristics of the frame structures [2] and of the MAC (Medium Access Control) protocol, the DSA++ (dynamic slot allocation) one. The DSA++ protocol has an important characteristic: it allows considering connectionoriented communications [4]. By allocating a so-called container, formed by a number of slots, a base station defines channels like in circuit-switched connections.…”

Section: Introductionmentioning

confidence: 99%

Impact of mobility in mobile broadband systems multi-service traffic

Velez

Correia

12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH859

View full text Add to dashboard Cite

Multi-service traffic engineering will be a key aspect in cellular planning of Mobile Broadband Systems (MBS), allowing to obtain merit functions for optimisation purposes. MBS will serve applications via different service components, with different data rates and average durations, user mobility having impact on the handover failure probability threshold. While in the business city centre and other urban scenarios mobility has no significant effect, it affects the supported traffic in main roads; a reduction of 31 % existing in the 432 channel/cell case, relatively to the situation of absence of mobility.

show abstract

Influence of dynamic channel allocation on the transmission delay in wireless ATM networks

Cited by 10 publications

References 3 publications

Recent progress in mathematics and engineering on optimal graph labellings with distance conditions

Recent progress in mathematics and engineering on optimal graph labellings with distance conditions

Modeling Dynamic Channel-Allocation Algorithms in Multi-BS TDD Wireless Networks With Internet-Based Traffic

Impact of mobility in mobile broadband systems multi-service traffic

Contact Info

Product

Resources

About