This paper proposes a QoS approach for an adaptive call admission control (CAC) scheme for multiclass service wireless cellular networks. The QoS of the proposed CAC scheme is achieved through call bandwidth borrowing and call preemption techniques according to the priorities of the traffic classes, using complete sharing of the available bandwidth. The CAC scheme maintains QoS in each class to avoid performance deterioration through mechanisms for call bandwidth degradation, and call bandwidth upgrading based on min-max and max-min policies for fair resource deallocation and reallocation, respectively. The proposed adaptive CAC scheme utilizes a measurement-based online monitoring approach of the system performance, and a prediction model to determine the amount of bandwidth to be borrowed from calls, or the amount of bandwidth to be returned to calls. The simulation-based performance evaluation of the proposed adaptive CAC scheme shows the strength and effectiveness of our proposed scheme.Usually, a mobile terminal's (MT) request for a service may be denied access based on the nonavailability of resources adequate to the requirements of the service. In this work, the bandwidth allocated to a call is considered the main resource. The mobile terminal's denial of service is referred to as call blocking and its probability as the call blocking probability, P b . However, a mobile terminal may move from one cell to another, while being in active connection. To maintain continuity of the service, the mobile terminal must have a successful handoff from the previous cell to the current cell. A successful handoff of a call to the current cell's base station (BS) is made if the mobile terminal has been granted the required resources for the connection without deterioration of its QoS. The failure of a mobile terminal to have a successful handoff at any point in its path would terminate the call. The probability of a call termination or dropping is called the call dropping probability, P d . We will refer in this work to the duration of a call connection by the call holding time .t c /, and the duration of the time a mobile terminal exists in a cell by the cell residency time .t r / [2].Typically, service providers for wireless cellular networks would strive to achieve high profitability, while being able to maintain users' satisfaction. For the first goal, they would try to maximize the number of admitted calls into the network to ensure efficient bandwidth utilization. For the second, service providers work on minimizing the number of handoff call dropping and new call blocking, and reducing the latency and overheads of call admissions and handoff computations. Finding a compromise between the two conflicting goals is a challenging problem. In this work, we propose a bandwidth borrowing-based adaptive CAC scheme in multiclass service wireless cellular networks that tries to strike a balance between users' satisfaction and profitability. The proposed adaptive scheme achieves its objectives through techniques for rate deg...
Broadcasting is used in on-demand routing protocols to discover routes in Mobile Ad-hoc Networks (MANETs). On-demand routing protocols, such as AODV (Adhoc On-demand Distance Vector) routing, commonly employ pure flooding based broadcasting. However, pure flooding generates excessively redundant routing traffic that may lead to broadcast storm problem (BSP) and deteriorate the performance of MANETs significantly. Probabilistic broadcasting schemes were proposed in the literature to address BSP. However, these schemes do not consider thermal noise and interference which exist in real life MANETs, and therefore, do not perform well in real life MANETs. This paper presents a novel Channel Adaptive Probabilistic Broadcast (CAPB) scheme to disseminate RREQ packets efficiently. The proposed CAPB scheme determines the probability of rebroadcasting RREQ packets on the fly according to the current SINR (Signal to Interference plus Noise Ratio) and node density in the neighborhood. The proposed scheme and two related state of the art (SoA) schemes from the literature ([1] and [2]) are implemented in the standard AODV routing protocol to replace the pure flooding based broadcast. Simulation results show that the proposed scheme outperforms the standard AODV and the two competitors in terms of routing overhead, throughput and end-to-end delay significantly.
This paper illustrates how known methods and techniques for solving problems in the area of wired interconnection networks can be adapted to solve problems for wireless mobile networks. We make use of a known construction of disjoint paths in the k-ary n-cube interconnection network to design a reliable multipath routing protocol for mobile ad-hoc networks (MANETs). With the help of node positioning, node mobility is masked and the problem of routing between mobile nodes is transformed to a problem of routing between fixed cells of a logical 3-dimensional grid. Analytical performance evaluation results for the proposed protocol are obtained showing its high reliability. To the best of our knowledge, the proposed protocol is the first multipath source routing protocol for MANETs. We believe other wireless communication problems can be solved using a similar approach based on adapting solutions from wired interconnection networks.We propose to take advantage of the wealth of methods, techniques and solutions developed over decades for solving communication problems for multiprocessor interconnection networks in order to tackle problems encountered in mobile wireless networks. The two types of networks differ in terms of lower level network characteristics but are similar in terms of the nature of the higher level communication requirements. For example in both types of networks point-topoint routing, multicasting, broadcasting and fault-tolerant communication solutions are needed. If somehow the constraint of mobility can be masked, itshould be possible to adapt solution methods from wired networks to wireless networks. This paper is an attempt in this direction. We make use of a known construction of disjoint paths in k-ary n-cube interconnection networks to design a point-to-point multipath routing protocol for mobile ad-hoc networks (MANETs).We start with an overview of existing routing protocols for mobile ad-hoc networks in order to place the proposed protocol in the frame of the existing literature. Routing protocols for mobile ad-hoc networks can be broadly classified in two categories: topology-based routing protocols and position-based routing protocols. In topology-based protocols 1 , link information is used to make routing decisions. They are further divided in: proactive (table-driven) protocols, reactive (on-demand) protocols and hybrid protocols, based on when and how the routes are discovered. In proactive topology-based protocols, such as DSDV 2 , each node J. Inter. Net. 2011.12:19-54. Downloaded from www.worldscientific.com by NANYANG TECHNOLOGICAL UNIVERSITY on 08/27/15. For personal use only.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.