scispace - formally typeset
Search or ask a question
Author

Xavier Pérez-Costa

Bio: Xavier Pérez-Costa is an academic researcher from Polytechnic University of Catalonia. The author has contributed to research in topics: Computer science & Quality of service. The author has an hindex of 14, co-authored 21 publications receiving 1583 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: The random waypoint model is a commonly used mobility model for simulations of wireless communication networks and some of its fundamental stochastic properties are investigated, including the transition length and time of a mobile node between two waypoints, the spatial distribution of nodes, and the direction angle at the beginning of a movement transition.
Abstract: The random waypoint model is a commonly used mobility model for simulations of wireless communication networks. By giving a formal description of this model in terms of a discrete-time stochastic process, we investigate some of its fundamental stochastic properties with respect to: (a) the transition length and time of a mobile node between two waypoints, (b) the spatial distribution of nodes, (c) the direction angle at the beginning of a movement transition, and (d) the cell change rate if the model is used in a cellular-structured system area. The results of this paper are of practical value for performance analysis of mobile networks and give a deeper understanding of the behavior of this mobility model. Such understanding is necessary to avoid misinterpretation of simulation results. The movement duration and the cell change rate enable us to make a statement about the "degree of mobility" of a certain simulation scenario. Knowledge of the spatial node distribution is essential for all investigations in which the relative location of the mobile nodes is important. Finally, the direction distribution explains in an analytical manner the effect that nodes tend to move back to the middle of the system area.

888 citations

Proceedings ArticleDOI
28 Sep 2002
TL;DR: Analytical derivations of some fundamental stochastic properties of the random waypoint mobility model with respect to the length and duration of a movement epoch, the chosen direction angle at the beginning of amovement epoch, and the cell change rate when used within the context of cellular networks are presented.
Abstract: The random waypoint model is a commonly used mobility model for simulations of wireless communication networks. In this paper, we present analytical derivations of some fundamental stochastic properties of this model with respect to: (a) the length and duration of a movement epoch, (b) the chosen direction angle at the beginning of a movement epoch, and (c) the cell change rate of the random waypoint mobility model when used within the context of cellular networks. Our results and methods can be used to compare the random waypoint model with other mobility models. The results on the movement epoch duration as well as on the cell change rate enable us to make a statement about the 'degree of mobility' of a certain simulation scenario. The direction distribution explains in an analytical manner the effect that nodes tend to move back to the middle of the system area.

199 citations

Journal ArticleDOI
TL;DR: A deep understanding of the overall performance of the various protocols is provided and supports the design process of a Mobile IPv6-based network when a decision of whether it is appropriate to implement any of the proposed Mobile IPv 6 enhancements has to be made.
Abstract: Mobile IP, the current IETF proposal for IP mobility support, represents a key element for future All-IP wireless networks to provide service continuity while on the move within a multi-access environment. We conducted a performance evaluation of Mobile IPv6 and its proposed enhancements, i.e., Fast Handovers for Mobile IPv6, Hierarchical Mobile IPv6 and our proposed combination of them, using the network simulator ns-2 for the case of a 'hot spot' deployment scenario. The simulation scenario comprises four access routers and up to 50 mobile nodes that communicate in accordance with the IEEE 802.11 wireless LAN standard. The study provides quantitative results of the performance improvements obtained by the proposed enhancements as observed by a single mobile user with respect to handoff latency, packet loss rate and achieved bandwidth per station. As a complementary part of the study, the signaling load costs associated with the performance improvements provided by the enhancements has been analyzed. The simulation environment allowed us also to investigate the behavior of the protocol in extreme cases, e.g., under channel saturation conditions and considering different traffic sources: CBR, VoIP, Video and TCP transfers. While some simulation results corroborate the intention of the protocols specifications, other results give insights not easily gained without performing simulations. This study provides a deep understanding of the overall performance of the various protocols and supports the design process of a Mobile IPv6-based network when a decision of whether it is appropriate to implement any of the proposed Mobile IPv6 enhancements has to be made.

161 citations

Journal ArticleDOI
TL;DR: The results show the level at which the 802.11e QoS and power saving mechanisms meet their design objectives, and provide quantitative results on the differences to be expected with respect to QoS, power saving, signaling load, and network capacity in a generic scenario.
Abstract: Wireless LAN has become the ubiquitous connectivity solution for computing in the home and hotspot environments. While the technology continues to grow within its core computer market, it is also steadily expanding into the much larger handset and consumer electronics markets. Given the increasingly diverse range of applications, additional requirements need to be met by products in order to ensure user satisfaction. Within these requirements two are commonly shared by most new devices: QoS support for prioritizing real-time services over non realtime and power saving functionality to achieve an operating time meeting users? expectations. In this article we first provide an overview of the two power saving modes defined by IEEE 802.11e, unscheduled, and scheduled automatic power save delivery, followed by an evaluation of the performance of the different possible combinations of IEEE 802.11e QoS and power saving mechanisms compared to the legacy 802.11 medium access protocol and power save mode. Our results show the level at which the 802.11e QoS and power saving mechanisms meet their design objectives, and provide quantitative results on the differences to be expected with respect to QoS, power saving, signaling load, and network capacity in a generic scenario.

68 citations

Journal ArticleDOI
TL;DR: This paper analyzes the power saving protocols defined in Wi-Fi Direct and design two algorithms to efficiently use them: Adaptive Single Presence Period (ASPP) and Adaptive Multiple Presence Periods (AMPP).

60 citations


Cited by
More filters
01 Jan 2007
TL;DR: In this paper, the authors provide updates to IEEE 802.16's MIB for the MAC, PHY and asso-ciated management procedures in order to accommodate recent extensions to the standard.
Abstract: This document provides updates to IEEE Std 802.16's MIB for the MAC, PHY and asso- ciated management procedures in order to accommodate recent extensions to the standard.

1,481 citations

Journal ArticleDOI
TL;DR: This handbook is a very useful handbook for engineers, especially those working in signal processing, and provides real data bootstrap applications to illustrate the theory covered in the earlier chapters.
Abstract: tions. Bootstrap has found many applications in engineering field, including artificial neural networks, biomedical engineering, environmental engineering, image processing, and radar and sonar signal processing. Basic concepts of the bootstrap are summarized in each section as a step-by-step algorithm for ease of implementation. Most of the applications are taken from the signal processing literature. The principles of the bootstrap are introduced in Chapter 2. Both the nonparametric and parametric bootstrap procedures are explained. Babu and Singh (1984) have demonstrated that in general, these two procedures behave similarly for pivotal (Studentized) statistics. The fact that the bootstrap is not the solution for all of the problems has been known to statistics community for a long time; however, this fact is rarely touched on in the manuscripts meant for practitioners. It was first observed by Babu (1984) that the bootstrap does not work in the infinite variance case. Bootstrap Techniques for Signal Processing explains the limitations of bootstrap method with an example. I especially liked the presentation style. The basic results are stated without proofs; however, the application of each result is presented as a simple step-by-step process, easy for nonstatisticians to follow. The bootstrap procedures, such as moving block bootstrap for dependent data, along with applications to autoregressive models and for estimation of power spectral density, are also presented in Chapter 2. Signal detection in the presence of noise is generally formulated as a testing of hypothesis problem. Chapter 3 introduces principles of bootstrap hypothesis testing. The topics are introduced with interesting real life examples. Flow charts, typical in engineering literature, are used to aid explanations of the bootstrap hypothesis testing procedures. The bootstrap leads to second-order correction due to pivoting; this improvement in the results due to pivoting is also explained. In the second part of Chapter 3, signal processing is treated as a regression problem. The performance of the bootstrap for matched filters as well as constant false-alarm rate matched filters is also illustrated. Chapters 2 and 3 focus on estimation problems. Chapter 4 introduces bootstrap methods used in model selection. Due to the inherent structure of the subject matter, this chapter may be difficult for nonstatisticians to follow. Chapter 5 is the most impressive chapter in the book, especially from the standpoint of statisticians. It provides real data bootstrap applications to illustrate the theory covered in the earlier chapters. These include applications to optimal sensor placement for knock detection and land-mine detection. The authors also provide a MATLAB toolbox comprising frequently used routines. Overall, this is a very useful handbook for engineers, especially those working in signal processing.

1,292 citations

Journal ArticleDOI
TL;DR: In this paper, the authors presented a detailed analytical study of the spatial node distribution generated by random waypoint mobility and derived an exact equation of the asymptotically stationary distribution for movement on a line segment and an accurate approximation for a square area.
Abstract: The random waypoint model is a commonly used mobility model in the simulation of ad hoc networks It is known that the spatial distribution of network nodes moving according to this model is, in general, nonuniform However, a closed-form expression of this distribution and an in-depth investigation is still missing This fact impairs the accuracy of the current simulation methodology of ad hoc networks and makes it impossible to relate simulation-based performance results to corresponding analytical results To overcome these problems, we present a detailed analytical study of the spatial node distribution generated by random waypoint mobility More specifically, we consider a generalization of the model in which the pause time of the mobile nodes is chosen arbitrarily in each waypoint and a fraction of nodes may remain static for the entire simulation time We show that the structure of the resulting distribution is the weighted sum of three independent components: the static, pause, and mobility component This division enables us to understand how the model's parameters influence the distribution We derive an exact equation of the asymptotically stationary distribution for movement on a line segment and an accurate approximation for a square area The good quality of this approximation is validated through simulations using various settings of the mobility parameters In summary, this article gives a fundamental understanding of the behavior of the random waypoint model

1,122 citations

01 Jan 2003
TL;DR: This article considers a generalization of the random waypoint model in which the pause time of the mobile nodes is chosen arbitrarily in each waypoint and a fraction of nodes may remain static for the entire simulation time and derives an exact equation of the asymptotically stationary distribution for movement on a line segment and an accurate approximation for a square area.

1,104 citations

Proceedings ArticleDOI
14 Sep 2003
TL;DR: Simulation results show that the use of obstacles and pathways has a significant impact on the performance of ad hoc network protocols.
Abstract: One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number of significant benefits, including repeatable scenarios, isolation of parameters, and exploration of a variety of metrics. The topology and movement of the nodes in the simulation are key factors in the performance of the network protocol under study. Once the nodes have been initially distributed, the mobility model dictates the movement of the nodes within the network. Because the mobility of the nodes directly impacts the performance of the protocols, simulation results obtained with unrealistic movement models may not correctly reflect the true performance of the protocols. The majority of existing mobility models for ad hoc networks do not provide realistic movement scenarios; they are limited to random walk models without any obstacles. In this paper, we propose to create more realistic movement models through the incorporation of obstacles. These obstacles are utilized to both restrict node movement as well as wireless transmissions. In addition to the inclusion of obstacles, we construct movement paths using the Voronoi diagram of obstacle vertices. Nodes can then be randomly distributed across the paths, and can use shortest path route computations to destinations at randomly chosen obstacles. Simulation results show that the use of obstacles and pathways has a significant impact on the performance of ad hoc network protocols.

663 citations