Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Selected Areas in Communications, IEEE Journal on

Issue 7 • Date Sept. 1997

Filter Results

Displaying Results 1 - 16 of 16
  • Networking and Performance Issues of Personal Mobile Communications

    Publication Year: 1997 , Page(s): 1193 - 1196
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (44 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wireless intelligent ATM network and protocol design for future personal communication systems

    Publication Year: 1997 , Page(s): 1289 - 1307
    Cited by:  Papers (6)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (448 KB)  

    This paper presents the wireless intelligent ATM (WIATM) network, designed to provide wireless broadband integrated services. The WIATM network takes advantage of the ATM-cell relay paradigm for integrated services through a radio link with quality of service (QoS) guarantee. The design of the WIATM network architecture is an independent wireless network, which is consistent with the inherent cellular/PCS network architecture, as a wireless customer premises equipment/network (CPE/CPN) to access the ATM transport network in the B-ISDN infrastructure. An independent network architecture design separates the wireless access network from the ATM backbone network; this provides flexibility for wireless resource management with low rate source codecs with minimal tolerable QoS considered to increase the spectral efficiency, and mobility support by taking advantage of the functionalities of the IS-41 circuit-switching handoff procedures. The protocol design of the air interface is to meet the QoS requirements of wireless B-ISDN services and to be compatible with that of B-ISDN UNI. A hybrid concatenated error control scheme distributed through the protocol layers is used to target individual QoS requirements of different services. The convolutional coding and interleaving in the wireless physical layer protocol are used to guarantee QoS of voice services. A concatenated coding with additional 36 bit BCH code in the wireless ATM layer, which replaces the VCI/VPI of the ATM header field, improves the QoS up to the requirement of video services. The VCI/VPI field in WIATM is an overlapped routing information routing with the address control by radio port controller, and is thus not needed in the wireless ATM layer protocol. The retransmission scheme for data service only is added in the wireless data link layer, which is on top of wireless AAL, to meet its QoS requirement. Examples of signaling flows for call registration, call setup, and supporting handoff are shown in the design of the wireless network layer protocol. The AIN (advance intelligent network) signaling functionalities are considered for multimedia service control in the access network and interconnection to the ATM network. A parent-child creative basic call state model (BCSM) for wireless integrated services is introduced in both call origination and termination View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From optimal search theory to sequential paging in cellular networks

    Publication Year: 1997 , Page(s): 1253 - 1264
    Cited by:  Papers (20)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (344 KB)  

    We propose a novel paging strategy based on the theory of optimal search with discrete efforts. When compared to conventional paging methods, the proposed scheme increases the mobile station discovery rate while decreasing the average number of times that a mobile station has to be paged in a location area. The proposal is fully compatible with existing cellular structures, and requires minimal computational power in the mobile switching centers View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of multicast flow control algorithms over combined wired/wireless networks

    Publication Year: 1997 , Page(s): 1349 - 1363
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (484 KB)  

    A multicast flow control framework for data traffic traversing both a wired and wireless network is proposed. Markov-modulated fluid (MMF) models are used for the receivers to capture the dynamics of the wireless links. Our study shows that the phase differences of the instantaneous throughput capabilities of the receivers are a distinctive feature of multicast connections. The objectives of the multicast flow control algorithms are to cope with the receiver phase differences (RPDs) cost effectively in addition to the general goals such as maximizing throughput and minimizing delay. Three ad hoc algorithms have been studied: listen to slowest request (LSQ), source estimation (SE), and open-loop control. A fluid-flow analysis technique is applied to study the effect of receiver phase differences assuming zero propagation delay. The effect of propagation delay in multicast connections is then discussed. Simulation results are presented to verify the analysis for the zero-delay case and to compare the performance of the algorithms under nonnegligible delays. It turns out that the zero-delay case reveals the characteristics of the multicast algorithms and provides good performance bounds for the cases with nonnegligible propagation delays View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive clustering for mobile wireless networks

    Publication Year: 1997 , Page(s): 1265 - 1275
    Cited by:  Papers (486)  |  Patents (28)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (216 KB)  

    This paper describes a self-organizing, multihop, mobile radio network which relies on a code-division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled, and are dynamically reconfigured as the nodes move. This network architecture has three main advantages. First, it provides spatial reuse of the bandwidth due to node clustering. Second, bandwidth can be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is robust in the face of topological changes caused by node motion, node failure, and node insertion/removal. Simulation shows that this architecture provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A low-cost cellular mobile communication system: a hierarchical optimization network resource planning approach

    Publication Year: 1997 , Page(s): 1315 - 1326
    Cited by:  Papers (31)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (500 KB)  

    This paper deals with the optimization of the design and radio network resource planning for cellular mobile communication systems. The key element to be considered for mobile network planning is cost. A hierarchical optimization planning method (HOP) is utilized since there are so many factors like system performance, terrain features, base station parameters, and cost factors which are involved in the large-scale system design. We present a three-level optimization approach for designing a cellular mobile system. It determines the cell number, cell site allocation, and the specific base station parameters in order to minimize the total system cost and to comply with the required system performance. The problem is formulated as a large combinatorial optimization model which can determine the optimal number of cells and select the best base stations' locations. The simulated annealing approach is developed to solve the hard combinatorial problem. Simulation results demonstrate the feasibility and effectiveness of the HOP approach for radio network planning View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IDAMN: an intrusion detection architecture for mobile networks

    Publication Year: 1997 , Page(s): 1373 - 1380
    Cited by:  Papers (18)  |  Patents (22)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (176 KB)  

    We present IDAMN (intrusion detection architecture for mobile networks), a distributed system whose main functionality is to track and detect mobile intruders in real time. IDAMN includes two algorithms which model the behavior of users in terms of both telephony activity and migration pattern. The main novelty of our architecture is its ability to perform intrusion detection in the visited location and within the duration of a typical call, as opposed to existing designs that require the reporting of all call data to the home location in order to perform the actual detection. The algorithms and the components of IDAMN have been designed in order to minimize the overhead incurred in the fixed part of the cellular network View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive resource allocation for prioritized call admission over an ATM-based wireless PCN

    Publication Year: 1997 , Page(s): 1208 - 1225
    Cited by:  Papers (80)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (476 KB)  

    In future personal communications networks (PCNs) supporting network-wide handoffs, new and handoff requests will compete for connection resources in both the mobile and backbone networks. Forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. The previously proposed guard channel scheme for radio channel allocation in cellular networks reduces handoff call blocking probability substantially at the expense of slight increases in new call blocking probability by giving resource access priority to handoff calls over new calls in call admission control. While the effectiveness of a fixed number of guard channels has been demonstrated under stationary traffic conditions, with nonstationary call arrival rates in a practical system, the achieved handoff call blocking probability may deviate significantly from the desired objective. We propose a novel dynamic guard channel scheme which adapts the number of guard channels in each cell according to the current estimate of the handoff call arrival rate derived from the current number of ongoing calls in neighboring cells and the mobility pattern, so as to keep the handoff call blocking probability close to the targeted objective while constraining the new call blocking probability to be below a given level. The proposed scheme is applicable to channel allocation over cellular mobile networks, and is extended to bandwidth allocation over the backbone network to enable a unified approach to prioritized call admission control over the ATM-based PCN View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond IN and UPT-a personal communications support system based on TMN concepts

    Publication Year: 1997 , Page(s): 1308 - 1314
    Cited by:  Papers (1)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (392 KB)  

    The vision for future telecommunications is often described by the slogan “information at any time, at any place, in any form”, driven by both society's increasing demand for “universal connectivity” and the technological progress in the area of mobile computing and personal communications. In order to realize this vision, the emerging concept of personal communications support (PCS), which includes support for personal mobility, service personalization, and advanced service interoperability, is becoming increasingly important since it allows users to configure their communications environment in accordance with their individual needs, thereby providing them with controlled access to telecommunication services, regardless of their current location, terminal and network capabilities. This paper provides an overview of a personal communications support system (PCSS). The PCSS represents a platform providing advanced PCS capabilities in a uniform way to numerous communication applications in distributed multimedia environments. From a functional perspective, the PCSS provides enhanced intelligent network (IN) and universal personal telecommunication (UPT) capabilities with respect to user addressing (based on logical names instead of numbers) and advanced user control capabilities. From a design perspective, the centralistic IN/UPT approach to the realization of service logic has been replaced by a highly distributable, object-oriented approach based on X.500/X.700/telecommunications management network (TMN) concepts. This paper addresses the basic aspects of the PCSS, including design criteria, system architecture, supported applications, and evolution issues View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A packet delay analysis for cellular digital packet data

    Publication Year: 1997 , Page(s): 1364 - 1372
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (364 KB)  

    We formulate and analyze a model of voice and data burst traffic for cellular digital packet data (CDPD). To develop a tractible model, we make some reasonable simplifying assumptions to model the voice traffic and one of the logical CDPD channels as an M/M/1 queue in a random environment. Rather than explicitly solve the resulting matrix quadratic equation, we develop an asymptotic analysis that gives us simple approximate formulas (with error bounds) for many performance measures of interest. In particular, one metric that we highlight comes from using our approximate mean data burst delay formula to characterize the performance of a set of interacting logical CDPD channels. We do so by describing it in terms of an equivalent number of independent, dedicated CDPD channels, We can use this metric to suggest what the optimal number of logical CDPD channels for a given system should be View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network configurations for seamless support of CDMA soft handoffs between cell clusters

    Publication Year: 1997 , Page(s): 1276 - 1288
    Cited by:  Papers (9)  |  Patents (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (472 KB)  

    Current code division multiple access (CDMA) networks do not support soft handoffs between cell clusters serviced by different mobile switching centers (MSC's). Three novel network configurations are proposed to overcome this limitation. Configurations I and II employ crosslinks to allow diversity combining of signals. This is accomplished in Configuration III by linking the modified MSCs serving adjacent cell clusters. In Configuration I, a scheme which reduces the handoff blocking probability by lengthening the handoff transition time is proposed. Configuration II expands overlapping regions of adjacent cell clusters, thus enabling the use of different intercluster handoff regions for different handoff directions to prevent oscillations which may occur in Configuration I, while reducing the necessary number of intercluster handoffs. Configuration III fully shares the trunks to support the highest number of calls among all three configurations. A new mobility model for microcells is developed to enable dimensioning of the trunk groups in each configuration. For Configurations I and II, the optimal partitions of trunk groups into direct and crosslinks are determined by mathematical analyses and computer simulations. For Configuration III, the optimal number of trunks required to interconnect adjacent MSCs is investigated by computer simulations. The new call and handoff blocking probabilities in all of these configurations are compared View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible transmission bandwidth management with effective channel reservation techniques for NGSO MSS networks

    Publication Year: 1997 , Page(s): 1197 - 1207
    Cited by:  Papers (3)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (288 KB)  

    This paper describes efficient transmission bandwidth management based on flexible channel assignment and effective grade of service (GOS) control methods for nongeostationary orbit mobile satellite service (NGSO MSS) networks. Our basic approach for the flexible channel assignment is to use linear programming (FLEXCA-LP), and to apply the column generation technique for further reduction of the total bandwidth requirement. These methods efficiently assign channels, taking account of moving spot beam coverage and dynamic traffic load variation for large-scale networks. The GOS is investigated for the channel assignment by FLEXCA-LP to make the GOS of ongoing calls better than that of fresh calls as stipulated in ITU-T Recommendations. We propose a few effective means to improve the results of FLEXCA-LP by reducing the disruption possibility of ongoing calls. One is to add channels utilizing a hysteresis concept. The others are effective use of GOS control techniques for NGSO MSS networks. These techniques are evaluated by a simulation study to identify promising techniques. Under time-variant conditions, we show that a reliable channel assignment plan is generated first by FLEXCA-LP considering the traffic load of fresh calls only and then by GOS control techniques to improve handover failure and call disruption rates View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User mobility modeling and characterization of mobility patterns

    Publication Year: 1997 , Page(s): 1239 - 1252
    Cited by:  Papers (235)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (408 KB)  

    A mathematical formulation is developed for systematic tracking of the random movement of a mobile station in a cellular environment. It incorporates mobility parameters under the most generalized conditions, so that the model can be tailored to be applicable in most cellular environments. This mobility model is used to characterize different mobility-related traffic parameters in cellular systems. These include the distribution of the cell residence time of both new and handover calls, channel holding time, and the average number of handovers. It is shown that the cell residence time can be described by the generalized gamma distribution. It is also shown that the negative exponential distribution is a good approximation for describing the channel holding time View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient transport service for slow wireless telephone links

    Publication Year: 1997 , Page(s): 1337 - 1348
    Cited by:  Papers (11)  |  Patents (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (228 KB)  

    Modern digital cellular telephones and portable computers have created a new platform for distributed information processing. However, the characteristics of wireless telephone links are different from those of wireline links. With standard TCP/IP protocols, this can lead to severe performance problems; some are related to the control of the wireless link, some to the cooperation of the wireless link and the fixed network. One possible solution is to split the end-to-end communication path into two parts, and to establish a separate control for each part. The Mowgli communication architecture is a sophisticated elaboration of this basic idea covering several data communication layers. One of its main components is the Mowgli data channel service (MDCS), which transparently replaces the standard TCP/IP core protocols over the slow wireless link. We discuss how the Mowgli approach, using the MDCS, alleviates the problems encountered with TCP/IP protocols over slow wireless links. The results of our performance tests indicate the merits of the Mowgli approach. The transfer times and the response times become more stable, transfer times for multiple parallel bidirectional transfers are substantially reduced, and response times in interactive work can be kept at a low and predictable level, even when there is other traffic on the wireless link View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal memory management strategies for a mobile user in a broadcast data delivery system

    Publication Year: 1997 , Page(s): 1226 - 1238
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (468 KB)  

    Data broadcasting has been considered as a promising way of disseminating information to a massive number of users in a wireless communication environment. In a broadcast data delivery system, there is a server which is broadcasting data to a user community. Due to the lack of communication from the users to the server, the server cannot know what a user needs. In order to access a certain item, a user has to wait until the item appears in the broadcast. The waiting time will be considerably long if the server's broadcast schedule does not match the user's access needs. If a user has a local memory, it can alleviate its access latency by selectively prefetching the items from the broadcast and storing them in the memory. A good memory management strategy can substantially reduce the user's access latency, which is a major concern in a broadcast data delivery system. An optimal memory management policy is identified that minimizes the expected aggregate latency. We present optimal memory update strategies with limited look ahead as implementable approximations of the optimal policy. Some interesting special cases are given for which the limited look-ahead policies are optimal. We also show that the same formulation can be used to find the optimal memory management policy which minimizes the number of deadline misses when users generate information requests which have to be satisfied within some given deadlines View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Antenna interconnection strategies for personal communication systems

    Publication Year: 1997 , Page(s): 1327 - 1336
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (276 KB)  

    Microcellular and distributed antenna systems are two promising candidates for implementing personal communication systems. Antenna interconnection strategies for these systems are studied in order to determine cost-efficient as well as robust and flexible architectures in hexagonal layouts. To this end, some results from minimal networks theory are used, in particular, those dealing with the problem of Steiner trees. The significant reduction in conduit and cable lengths that the Steiner minimal tree (SMT) architecture provides over the star type, especially in large networks, is demonstrated. It is further shown that the SMT architecture also provides more flexibility and robustness compared to the star type. The suboptimal, but easy-to-construct, minimal spanning tree (MST) architecture is given as well, and it is compared to the SMT and star types View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Journal on Selected Areas in Communications focuses on all telecommunications, including telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Muriel Médard
MIT