Tekinay, S., and Jabbari, B. Handover and channel assignment in mobile cellular networks. IEEE Communications Magazine 29, 11 (November 1991), 42--6.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....if the acceptable delay is low. Furthermore depends on the satellite system design (i.e. size of overlap area) A second approach is to reserve resources before handover occurrence in order to minimize forced termination probability. This reservation may be predetermined (guard channels [6 7]) or based on a prediction of handover requests. In this case although no delay is imposed, a cautious planning is needed to avoid an undesirable increase of blocking probability. In order to overcome the problem of early resource reservation which increases blocking probability it is required to ....

S. Tekinay and B. Jabbari, "Handover and channel assignment in mobile cellular networks", IEEE Commun. Mag., Vol 29, No 11, Nov 1991, pp 42-46.

....the power received from the current BS by a certain amount and or a certain time. The receiver threshold is the point at which the power received from the current BS is at the minimum acceptable level. The handoff area (HA) is the region between the handover threshold and the receiver threshold [1]. The HA has many valuable applications in handoff management. In particular, queuing of handoff requests is a handover prioritization scheme [1] made possible by the existence of the HA. The maximum possible waiting time in the queue is given by the residence time of the MT inside the HA. In ....

....from the current BS is at the minimum acceptable level. The handoff area (HA) is the region between the handover threshold and the receiver threshold [1] The HA has many valuable applications in handoff management. In particular, queuing of handoff requests is a handover prioritization scheme [1] made possible by the existence of the HA. The maximum possible waiting time in the queue is given by the residence time of the MT inside the HA. In the last years, the demand of personal telecommunication services has experienced an enormous growth. Since radio spectrum is a scarce resource, the ....

S. Tekinay and B. Jabbari, "Handover and channel assignment in mobile cellular networks," IEEE Communications Magazine, pp. 42--46, Nov. 1991.

....heavy traffic situations [34] In such situations, a significant handoff performance improvement can be obtained by prioritizing handoff. Introduction to Handoff Priority Channel assignment strategies with handoff prioritization have been proposed to reduce the probability of forced termination [35, 36]. Two basic methods of handoff prioritization, guard channels and queuing, are explained next. Guard Channels Guard channels improve the probability of successful handoffs by reserving a fixed or dynamically adjustable number of channels exclusively for handoffs. For example, priority can be ....

....may be queued. Handoffs may be prioritized. It is important to prevent the system from being overloaded. On the other hand, capacity is revenue for service providers, and part of the perceived service quality can be attributed to the accessibility of the network. Channel Allocation Reference [35] provides a tutorial on channel assignment (or allocation) strategies. Channel assignment strategies can be classified into fixed, dynamic, and flexible. Fixed channel assignment (FCA) permanently assigns a set of channels to each cell in a cluster. Some variations of the basic FCA strategy are ....

S. Tekinay and B. Jabbari, "Handover and Channel Assignment in Mobile Cellular Networks," IEEE Commun. Mag., Nov. 1991, pp. 42--46.

....frequently encountered because of the relative small spotbeam areas and the relative high speed of the satellites. Frequent spotbeam handovers would cause more handover blockings. Blocking a handover call is generally considered less desirable from user s point of view than blocking a new call [15]. The priority can be given via different treatments of new and handover calls to decrease the handover call blocking. Many solutions have been proposed to achieve this goal for terrestrial wireless networks [5, 13, 15] One noticeable prioritization scheme is handover with queueing (HQ) ....

....generally considered less desirable from user s point of view than blocking a new call [15] The priority can be given via different treatments of new and handover calls to decrease the handover call blocking. Many solutions have been proposed to achieve this goal for terrestrial wireless networks [5, 13, 15]. One noticeable prioritization scheme is handover with queueing (HQ) technique [12] This scheme utilizes the overlapped area between two spotbeams where the handover takes place. When a user terminal is in an overlapped area, the handover process is initiated. If a channel is available in the ....

[Article contains additional citation context not shown here]

S. Tekinay and B. Jabbari. Handover and channel assignment in mobile cellular networks. IEEE Communications Magazine, 29(11):42--46, Nov. 1991.

....channels for handover calls, however, increases the blocking probability for new arrivals. Hence, we need a trade off between the handover call blocking and new call blocking. With the above techniques, various solutions have been proposed to lower the blocking probabilities in wireless networks [11]. Most of these studies focus on the notion of channel allocation algorithms. They try to maximize the channel utilization efficiency. This approach, however, does not provide connection level quality of service (QoS) 9] Due to scarcity of resources, connection admission control (CAC) policies ....

....In section II, we propose a new connection admission control algorithm, geographical connection admission control. In section III, we describe the mobility model and simulation assumptions in the analysis. We then compare the proposed GCAC algorithm with other techniques described in [5] 10] [11]. Then, the paper concludes with section IV. II. Geographical Connection Admission Control The spotbeams of LEO satellites move along known trajectories on the Earth surface with an approximately constant speed. Moreover, the user locations can be estimated using global positioning system (GPS) ....

S. Tekinay and B. Jabbari, "Handover and Channel Assignment in Mobile Cellular Networks," IEEE Comm. Mag., vol. 29, no. 11, pp. 42--46, November 1991.

....a high channel efficiency. To overcome this, DCA schemes have been studied. Unlike FCA, in DCA, all channels are kept in a central pool to be shared by all calls in every cell. A channel is eligible for use in any cell provided the co channel reuse constraint is satisfied. Many researchers ( 1] 2][3]) have given comprehensive overviews on existing algorithms for channel allocation. In the previous work, DCA and QoS provisioning have been investigated in two separated contexts. On one hand, a lot of channel allocation schemes have been investigated for how to assign channels specifically. ....

S. Tekinay and B. Jabbari, "Handover and channel assignment in mobile cellular networks," IEEE Communications Magazine, pp. 42--46, Nov. 1991.

....are not able to attain a high channel e#ciency. To overcome this, DCA schemes have been studied. Unlike FCA, in DCA, all channels are kept in a central pool to be shared by all calls in every cell. A channel is eligible for use in any cell provided the co channel reuse constraint is satisfied. 1] [3] [2] give a comprehensive overview on existing algorithms for channel allocation. In the previous work, DCA and QoS provisioning were investigated in two separated contexts. On one hand, lots of channel allocation schemes have been investigated for how to assign channels specifically. There, QoS ....

S. Tekinay and B. Jabbari. Handover and channel assignment in mobile cellular networks. IEEE Communications Magazine, pages 42--46, Nov. 1991.

....a high channel efficiency. To overcome this, DCA schemes have been studied. Unlike FCA, in DCA, all channels are kept in a central pool to be shared by all calls in every cell. A channel is eligible for use in any cell provided the co channel reuse constraint is satisfied. Many researchers ( 1] 2][3]) have given comprehensive overviews on existing algorithms for channel allocation. In the previous work, DCA and QoS provisioning have been investigated in two separated contexts. On one hand, a lot of channel allocation schemes have been investigated for how to assign channels specifically. ....

S. Tekinay and B. Jabbari, "Handover and channel assignment in mobile cellular networks," IEEE Communications Magazine, pp. 42--46, Nov. 1991.

....peak office hour traffic, and busy commercial districts. For reducing the new call blocking probability under such traffic variations, a significant body of research has been conducted on dynamically allocating channels to individual calls under the minimum reuse distance constraint (e.g. see [11, 12], and the references therein) In dynamic channel allocation (DCA) schemes, channels are not pre assigned to individual cells but are kept in a common pool. Whenever a new call arrives, a channel that does not violate the minimum reuse distance constraint for any of the ongoing calls is selected ....

S. Tekinay and B. Jabbari. Handover and channel assignment in mobile cellular networks. IEEE Communications Magazine, 29(11):42--46, November 1991. -

....are not able to attain a high channel e#ciency. To overcome this, DCA schemes have been studied. Unlike FCA, in DCA, all channels are kept in a central pool to be shared by all calls in every cell. A channel is eligible for use in any cell provided the co channel reuse constraint is satisfied. 1] [3] [2] give a comprehensive overview on major existing algorithms for channel allocation. Although lots of channel allocation schemes have been investigated in the literature, most of them did not take QoS into consideration. The QoS in cellular networks is mainly determined by the new call ....

S. Tekinay and B. Jabbari. Handover and channel assignment in mobile cellular networks. IEEE Communications Magazine, pages 42--46, Nov. 1991.

....benefit of the HQS is the time window formed, during which resource allocation may take place, thus increasing the chances of a used slot s becoming free and allowing a handover to be successfully executed. This twin threshold physical layer model is similar to those described by Tekinay et al. [22] and Katzela et al. 23] However, the model described here is based on SINR thresholds, rather than the received power thresholds of Tekinay et al. 22] and Katzela et al. 23] A further metric, namely, the low signal quality probability, is calculated as the proportion of time that the SINR is ....

....and allowing a handover to be successfully executed. This twin threshold physical layer model is similar to those described by Tekinay et al. 22] and Katzela et al. 23] However, the model described here is based on SINR thresholds, rather than the received power thresholds of Tekinay et al. [22] and Katzela et al. 23] A further metric, namely, the low signal quality probability, is calculated as the proportion of time that the SINR is below the reallocation SINR threshold. The outage SINR and reallocation SINR threshold were determined, via independent bit level simulation, for BPSK, ....

S. Tekinay and B. Jabbari, "Handover and channel assignment in mobile cellular networks," IEEE Commun. Mag., pp. 42--46, Nov. 1991.

....practical TDMA FDMA systems, two cells that are closer than the minimum reuse distance are not allowed to use the same carrier frequency. A significant body of research has been conducted on dynamically allocating channels to individual cells under this minimum reuse distance constraint (e.g. see [2] and [6] and the references therein) for circuit switched networks. To simplify the complexities involved in dynamic channel allocation, some authors have proposed channel borrowing schemes to improve network utilization over fixed channel allocation ( 4] 7] However, these schemes require ....

S. Tekinay and B. Jabbari, "Handover and channel assignment in mobile cellular networks," IEEE Communications Magazine, pp. 42--46, November 1991.

....carrier are available for use in that cell. A carrier can be used by two different cells if their geographic distance is greater than a certain threshold called minimum reuse distance.Theproblem of carrier allocation is concerned with the assignment of carriers to cells. The reader is referred to [8] for an introduction to this topic. Various dynamic carrier allocation (DCA) strategies (e.g. 1, 7, 9] have been proposed for better carrier reuse. In a # This work is supported in part by the National Science Foundation under grant CDA 9413962. DCA strategy, a carrier is assigned an ....

S. Tekinay and B. Jabbari. Handover and channel assignment in mobile cellular networks. IEEE Comm. Magazine, pages 42--46, Nov. 1991.

....a way that the probability that incoming calls are blocked and the probability that the signal to interference ratio (SIR) due to channel reuse falls below a prespecified value are sufficiently low. The existing channel assignment methods may be roughly classified into fixed and dynamic schemes [15,18]. In the fixed channel assignment (FCA) scheme, a set of channels 1 is allocated to each cell permanently by a frequency planning process. A channel can be associated with many cells as long as the co channel interference constraint is satisfied or equivalently two cells are located at least a ....

....a call by call basis in a dynamic manner. Therefore, traffic variability can be automatically adapted. This can potentially lead to improved performance, particularly if the spatial traffic profile is unknown, poorly known, or varies according to time. A number of DCA algorithms have been proposed [3 7,17 18]. Depending on the form of information used, we may identify two classes of DCA schemes: a) interference adaptive schemes, where actual field signal strength measurements are used as the basis for channel assignment; and (b) traffic adaptive schemes, where only traffic conditions in neighboring ....

S.Tekinary and B. Jabbari, Handover and channel assignment in mobile cellular networks, IEEE Communication Magazine, pp 42-46, Nov 1991.

....transmission delay for data calls. k words: ###### ############# ######## ########### ## ##### ### #### ###### ####### ########## ######## 1. Introduction One of the centra issues in the performaA7 c haFFFAH: izaFFF of cellula mobileab persona communicaF7F systems (PCS) is the problem ofhaA [1].Ha.HA denotes the process of chaF8 the cha6F8 (frequency, time slot,sprea9k8 code, or combina9k9 of them) aem) ciam) with the current connection tomaA taA aA68 a service quace y or to provide better service. It is ofteninitiaAH either by cell bounda crossing or deterioraer service quace y ....

....initia tion proceduresad perfect (i.e.a. va78 requestsaq detectedat no inva7 requestsaque aq thehaHF6 procedure) Aha77k a7 is defineda the aeH in which the strength of theraHfi wa ve from the currentba sta6A7 received bya mobile is between thehaH7 threshold ar the receiver threshold [1], 7] When received signa strengthfaen below thehaH7fi threshold,a hare o# procedure isinitiaH:A ThehaH7F process must be completed within thehaH7A aH7 However, in our scheme, no queuesae provided toha7k8 voicecaeHF sohafiAk afi needs not be considered. In our scheme, if onaHfifi a thereae no ....

S. Tekinay and B. Jabbbari, "Handover and channel assignment in mobile cellular networks," IEEE Commun. Mag., vol.29, no.11,p.11,q7A Nov. 1991.

....is a procedure that carries out all of the three tasks. One may regard a carrier allocation algorithm as an implementation of a (carrier allocation) strategy. Carrier allocation strategies can be classified into three categories: fixed strategies, flexible strategies, and dynamic strategies [16]. Carrier allocation is usually referred to as channel allocation when each carrier contains only one channel. It is well known that dynamic carrier allocation (DCA) strategies in general can achieve lower blocking rate than fixed or flexible strategies. A communication session is blocked if ....

S. Tekinay and B. Jabbari. Handover and Channel Assignment in Mobile Cellular Networks. In IEEE Comm. Magazine, pages 42--46. Nov. 1991.

No context found.

Tekinay, S., and Jabbari, B. Handover and channel assignment in mobile cellular networks. IEEE Communications Magazine 29, 11 (November 1991), 42--6.

No context found.

S. Tekiany and B. Jabbari, Handover and Channel Assignment in Mobile Cellular Networks, IEEE Communications Magazine, Vol. 30, No. 11, pages 42-46, November 1991.

No context found.

S. Tekinay and B. Jabbary, "Handover and channel assignment in mobile cellular networks," IEEE Commun. Mag., vol. 29, pp. 42--46, Nov. 1991.

No context found.

S. Tekiany and B. Jabbari, Handover and Channel Assignment in Mobile Cellular Networks, IEEE Communications Magazine, Vol. 30, No. 11, pages 42-46, November 1991.

No context found.

S. Tekinay and B. Jabbari, "Handover and channel assignment in mobile cellular networks," in IEEE Comm. Mag., pp. 42--46, Nov. 1991.

No context found.

S. Tekinay and B. Jabbari, "Handover and channel assignments in mobile cellular networks," in IEEE Communications Magazine, vol. 29. November 1991.

No context found.

S. Tekinay and B. Jabbari, "Handover and channel assignment in mobile cellular networks," IEEE Commun. Mag., pp. 42--46, Nov. 1991.

No context found.

Sirin Tekinay and Bijan Jabbari, "Handover and Channel Assignment in Mobile Cellular Networks", IEEE Communications Magazine, Vol. 29, pp. 42-46, Nov. 1991.

No context found.

Sirin Tekinay and Bijan Jabbari, "Handover and Channel Assignment in Mobile Cellular Networks", IEEE Communications Magazine, pp 42-46, November 1991.

First 50 documents  Next 50

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