Performance Study of Adhoc on-Demand Link Quality Aware Route Search Protocol (AO-LQARSP)

A Wireless Sensor Network (WSN) is a network with few tens to thousands of small devices called sensor nodes which are connected wirelessly and involve in communicating the data. WSNs have generated tremendous interest among researchers in recent years because of its potential usage in wide variety of applications. The sensor nodes in WSNs have scarce power; they work in harsh and unattended environments which initiates the need for a better and more reliable routing path to send data. In this paper a routing protocol is proposed to select the route based on better signal strength conditions using Link Quality Indicator of the received signal for IEEE 802.15.4 standard. The performance of the proposed routing protocol is compared with standard reactive routing protocol Adhoc On-demand Distance Vector (AODV) with metrics like total packets received, throughput, total bytes received, average end-to-end delay and average jitter and total energy consumed for various node density scenarios

MODULATION AWARE CONNECTION ADMISSION CONTROL AND UPLINK SCHEDULING ALGORITHM FOR WIMAX NETWORKS

Mobile WiMAX standard defines air interface for mobile broadband wireless access (BWA) systems and aimed to provide high data rate with seamless mobility while maintaining the quality of service (QoS). However, QoS of real-time applications depends on the link quality, which necessitate the channel-aware connection admission control (CAC) and scheduling schemes. In this paper Modulation aware CAC scheme and base station (BS) uplink scheduling algorithm are proposed to improve the system capacity and QoS performance respectively. The proposed CAC scheme aims to increase the admission of higher priority real time services by degrading the bandwidth of admitted lower priority connections on the basis of their channel status without deteriorating their QoS performance much. The performances of proposed algorithms are evaluated through simulation by considering the metrics like throughput, delay and number of connections admitted

Dynamic Channel Allocation in Mobile Multimedia Networks Using Error Back Propagation and Hopfield Neural Network (EBP-HOP)

AbstractIn mobile multimedia communication systems, the limited bandwidth is an issue of serious concern. However for the better utilization of available resources in a network, channel allocation scheme plays a very important role to manage the available resources in each cell. Hence this issue should be managed to reduce the call blocking or dropping probabilities. This paper gives the new dynamic channel allocation scheme which is based on handoff calls and traffic mobility using hopfield neural network. It will improve the capacity of existing system. Hopfield method develops the new energy function that allocates channel not only for new call but also for handoff calls on the basis of traffic mobility information. Moreover, we have also examined the performance of traffic mobility with the help of error back propagation neural network model to enhance the overall Quality of Services (QoS) in terms of continuous service availability and intercell handoff calls. Our scheme decreases the call handoff dropping and blocking probability up to a better extent as compared to the other existing systems of static and dynamic channel allocation schemes

Pattern Analytical Module for EDOS Attacker Recognition

Abstract: Cloud computing has provided a platform to its users where they are charged on the basis of usage of the cloud resources; this is known as "pay-as-you-use". Today, Cloud computin

Supporting Quality-Of-Service of Mobile Commerce Transactions

With the deployment of 3G and 4G mobile networks, a sizable proportion of e-commerce traffic is expected to move to these networks. These transactions are likely to be diverse. Mobile transactions can include unique requirements such as atomicity (all or none steps), push or pull, security, and privacy. Because users are mobile, unpredictable link characteristics, and other problems associated with wireless networks, some mobile commerce transactions may not be completed causing significant annoyance to the users affected. Therefore, the probability of completing mobile transactions is an important parameter for measuring quality-of-service of a network supporting mobile commerce. The transaction completion probability measures the ability of networks to support completion of transactions. This research focuses on improving the support of mobile commerce transactions by the underlying wireless networks. Mobile commerce traffic is classified as messaging, information connectivity, and transactions in order to provide efficient quality-of-service to various applications. This paper introduces the use of priority, sociability and delegation to improve the transaction completion in wireless networks

A Survey of Quality of Service in Mobile Computing Environments

Accepted versio

Diseño óptimo de políticas de Control de Admisión (CA) del tipo Multiple Fractional Guard Channel (MFGC) para redes móviles multiservicio

[ES] La necesidad de garantizar Calidad de Servicio (QoS) en escenarios móviles multiservicio, lleva a explorar nuevas estrategias que permitan minimizar la probabilidad de terminación forzosa de una conexión debido a un fallo de handover por insuficiencia de recursos en la celda destino. Estas estrategias deben estar coordinadas con los sistemas de Control de Admisión (CA). Las políticas de CA del tipo MFGC son probablemente las que han suscitado un mayor interés pues consiguen unas buenas prestaciones y su implementación es bastante simple. Sin embargo, realizar el ajuste de parámetros de este tipo de políticas de una manera óptima entraña un esfuerzo computacional que puede llegar a ser prohibitivo. Para hacer frente a esta limitaciones computacionales se han propuesto algunos algoritmos basados en aproximaciones numéricas. De los resultados obtenidos, se observa que el coste computacional necesario puede llegar a ser muy elevado en algoritmos previos descritos en la literatura. La aproximación basada en fórmulas recurrentes no ofrece resultados totalmente convincentes, pues la configuración calculada a partir de éste no cumple los objetivos de QoS. Finalmente se propone un algoritmo que mejora los tiempos de cálculo respecto al algoritmo previo y obtiene resultados fiables, pero es mucho más lento que el algoritmo que se basa en la aproximación.[EN] The need to guarantee certain QoS requirements in multiservice cellular networks has led to explore new strategies to minimize blocking probabilities. These strategies must be coordinated with admission control systems (CA). In this paper we study Multiple Fractional Guard Channel (MFGC) policy which provides good results and its implementation is quite simple. Nevertheless, computing the optimal parameters setting of this policy can constitute a high computational cost. To face these computational limitations some algorithms based in numerical approximations are proposed. The obtained results show that the algorithm based in one-dimensional recursion formulas is not a good approximation since the policy configuration obtained do not fulfills the QoS constrains. But this approximation can be useful to accelerate a previous algorithm appeared in the literature. Finally, we propose another algorithm which outperforms this previous algorithm in terms of computational cost and fulfills the QoS constraints, but it is slower than the algorithm based in one-dimensional recursion formulas.Bernal Mor, E. (2008). Diseño óptimo de políticas de Control de Admisión (CA) del tipo Multiple Fractional Guard Channel (MFGC) para redes móviles multiservicio. http://hdl.handle.net/10251/27132.Archivo delegad

DISEÑO ÓPTIMO DE POLÍTICAS DE CONTROL DE ADMISIÓN DEL TIPO MULTIPLE FRACTIONAL GUARD CHANNEL (MFGC) PARA REDES MÓVILES MULTISERVICIO

Las políticas de CA MFGC son probablemente las que han suscitado un mayor interés en el entorno móvil. Sin embargo, realizar el ajuste de parámetros de este tipo de políticas entraña un esfuerzo computacional que puede llegar a ser prohibitivo. Para hacer frente a esta limitaciones se proponen algunos algoritmos basados en aproximaciones númerica. Abstract: Multiple Fractional Guard Channel (MFGC) policy provides good results and its implementation is quite simple. Nevertheless, computing the optimal parameters setting of this policy can constitute a high computational cost. To face these computational limitations some algorithms based in numerical approximations are proposed.Bernal Mor, E. (2007). DISEÑO ÓPTIMO DE POLÍTICAS DE CONTROL DE ADMISIÓN DEL TIPO MULTIPLE FRACTIONAL GUARD CHANNEL (MFGC) PARA REDES MÓVILES MULTISERVICIO. http://hdl.handle.net/10251/12625Archivo delegad