Genaro Hernandez-Valdez
Research Subjects
Genaro Hernandez-Valdez has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
Felipe A. Cruz-Perez
Electrical Engineering Department, CINVESTAV-IPN, Mexico City, Mexico
36 shared publications- Mario Eduardo Rivero Angeles
Centro de Investigación en Computación (CIC), Instituto Politécnico Nacional (IPN), Mexico City, Mexico
23 shared publications S. Lirio Castellanos-Lopez
Electronics Department, UAM-A, Mexico City, Mexico
19 shared publications- Felipe Alejandro Cruz-Pérez
Electrical Engineering Department, CINVESTAV-IPN, Mexico City, Mexico
10 shared publications F.A. Cruz-Perez
Center for Res. & Adv. Studies, Nat. Polytech. Inst., Mexico City
8 shared publicationsAnum L. Enlil Corral-Ruiz
Electrical Engineering Department, CINVESTAV-IPN
7 shared publications
Latest Publications
- Open Access
- 23 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 14645-14658
Waiting Time Higher Order Moments and the Distributional Little’s Law in the Discrete-Time M/G/1 Queueing System
This paper develops a unified and distributionally complete characterization of the discrete-time M/G/1 queue. Both the discrete-time Pollaczek-Khinchine formula for Bernoulli arrivals and the discrete Residual Lifetime Theorem are comprehensively addressed through a new proposed probability distribution, referred to as Infinite Mixture of Discrete Uniforms (IMDU), which provides an intuitive and mathematically consistent representation of the residual service time. For the waiting time distribution analysis, it is first shown that the idle period is identically distributed to the geometric interarrival time. Building on this identity, the Laplace Transform of the waiting-time distribution for Bernoulli arrivals with general service times is derived. Then, exact functional relationships between the moments of the waiting time and those of the discrete residual service time are obtained. Furthermore, using the distributional Little’s law, non-closed structural relation between the moments of the queue length and those of the waiting time is derived. The non-closedness is due to the staircase-like behavior of the expected number of arrivals in an ordinary renewal process. To make this relation tractable, the stepped-like function is approximated by a straight line whose slope and x-interception are determined minimizing the mean-square difference. Simulation and approximate analytical numerical results of the second (third) factorial moment of the queue length for deterministic, discrete uniform, and shifted Poisson service time show differences smaller than 0.242% (2.17%); in contrast to the substantially larger errors, up to 15.67% (42.4%), incurred by the Poisson arrival process approximation (x-interception at origin).
- 23 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 14645-14658
Open AccessWaiting Time Higher Order Moments and the Distributional Little’s Law in the Discrete-Time M/G/1 Queueing System
This paper develops a unified and distributionally complete characterization of the discrete-time M/G/1 queue. Both the discrete-time Pollaczek-Khinchine formula for Bernoulli arrivals and the discrete Residual Lifetime Theorem are comprehensively addressed through a new proposed probability distribution, referred to as Infinite Mixture of Discrete Uniforms (IMDU), which provides an intuitive and mathematically consistent representation of the residual service time. For the waiting time distribution analysis, it is first shown that the idle period is identically distributed to the geometric interarrival time. Building on this identity, the Laplace Transform of the waiting-time distribution for Bernoulli arrivals with general service times is derived. Then, exact functional relationships between the moments of the waiting time and those of the discrete residual service time are obtained. Furthermore, using the distributional Little’s law, non-closed structural relation between the moments of the queue length and those of the waiting time is derived. The non-closedness is due to the staircase-like behavior of the expected number of arrivals in an ordinary renewal process. To make this relation tractable, the stepped-like function is approximated by a straight line whose slope and x-interception are determined minimizing the mean-square difference. Simulation and approximate analytical numerical results of the second (third) factorial moment of the queue length for deterministic, discrete uniform, and shifted Poisson service time show differences smaller than 0.242% (2.17%); in contrast to the substantially larger errors, up to 15.67% (42.4%), incurred by the Poisson arrival process approximation (x-interception at origin).
- Open Access
- 16 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 126279-126298
Continuous Mixture of Uniforms Framework for Modeling Residual Lifetime Distribution
In this paper, a novel mathematical framework based on Continuous Mixture of Uniforms (CMU) for modeling the Residual Lifetime physical phenomenon is proposed. Through an alternative and intuitively comprehensible mathematical analysis, both the mixing distribution and the Residual Lifetime Theorem as a function of the Lifetime distribution are derived, providing a novel perspective compared to existing literature. The applicability of the derived mathematical expressions is demonstrated by obtaining the probability distribution function and statistical properties of the residual lifetime when the lifetime follows various commonly used distributions, including the negative exponential, log-normal, gamma, n-th order hyper-exponential, Pareto, and Weibull distributions. Furthermore, we present new mathematical expressions for generating random numbers with the Residual Lifetime distribution when the Lifetime follows either a log-normal or Weibull distribution. The proposed CMU framework is also employed to establish explicit relationships between distribution and moments of the Residual Lifetime and of the Lifetime. By using the conditional moments of the uniform random variables that constitute the CMU, functional relationships between both raw and standardized moments of residual lifetime and standardized moments of the lifetime are derived. Finally, numerical results graphically illustrate the statistical relationships between both the distribution and moments of the lifetime, mixing distribution, and residual lifetime, providing valuable insights into their interdependencies.
- 16 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 126279-126298
Open AccessContinuous Mixture of Uniforms Framework for Modeling Residual Lifetime Distribution
In this paper, a novel mathematical framework based on Continuous Mixture of Uniforms (CMU) for modeling the Residual Lifetime physical phenomenon is proposed. Through an alternative and intuitively comprehensible mathematical analysis, both the mixing distribution and the Residual Lifetime Theorem as a function of the Lifetime distribution are derived, providing a novel perspective compared to existing literature. The applicability of the derived mathematical expressions is demonstrated by obtaining the probability distribution function and statistical properties of the residual lifetime when the lifetime follows various commonly used distributions, including the negative exponential, log-normal, gamma, n-th order hyper-exponential, Pareto, and Weibull distributions. Furthermore, we present new mathematical expressions for generating random numbers with the Residual Lifetime distribution when the Lifetime follows either a log-normal or Weibull distribution. The proposed CMU framework is also employed to establish explicit relationships between distribution and moments of the Residual Lifetime and of the Lifetime. By using the conditional moments of the uniform random variables that constitute the CMU, functional relationships between both raw and standardized moments of residual lifetime and standardized moments of the lifetime are derived. Finally, numerical results graphically illustrate the statistical relationships between both the distribution and moments of the lifetime, mixing distribution, and residual lifetime, providing valuable insights into their interdependencies.
- Open Access
- 20 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 34887-34902
Distribution and Moments of the Idle Period and Interarrival Time in the G/M/1 Queueing System
Idle period is relevant in a wide variety of systems and has been widely used and analyzed in the literature. This paper derives the distribution and moments of the idle period for different interrarrival time distributions in the G/M/1 queueing system. In particular, Log-Normal (LN), Weibull, arbitrary order Hyper-Exponential (HE), arbitrary order Erlang, and Deterministic distribution are considered. It is shown that when the interarrival time follows a HE (Erlang) distribution, the idle period follows a HE (Coxian) distribution. The effects of the distribution and coefficient of variation of the interarrival time, and the traffic load on the distribution and first four standardized moments of the idle period are numerically evaluated. Additionally, the accuracy of the obtained distribution and moments of the idle period when the LN interarrival time is approximated by HE distributions of different order (using the Expectation Maximization algorithm) is investigated. Numerical results reveal good fitting accuracy between idle period distributions obtained under the LN and the m-th order HE interarrival time models. It is observed that the fitting accuracy (in terms of the Kolmogorov-Smirnov distance) improves as the order of the HE distribution increases. Finally, the standardized moments of the idle period are compared when the interarrival time follows LN or Weibull distribution with the same first two moments. Numerical results show that the values of the standardized moments of the idle period are higher when the interarrival time follows a LN distribution, as it has a heavier tail compared to that of the Weibull one.
- 20 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 34887-34902
Open AccessDistribution and Moments of the Idle Period and Interarrival Time in the G/M/1 Queueing System
Idle period is relevant in a wide variety of systems and has been widely used and analyzed in the literature. This paper derives the distribution and moments of the idle period for different interrarrival time distributions in the G/M/1 queueing system. In particular, Log-Normal (LN), Weibull, arbitrary order Hyper-Exponential (HE), arbitrary order Erlang, and Deterministic distribution are considered. It is shown that when the interarrival time follows a HE (Erlang) distribution, the idle period follows a HE (Coxian) distribution. The effects of the distribution and coefficient of variation of the interarrival time, and the traffic load on the distribution and first four standardized moments of the idle period are numerically evaluated. Additionally, the accuracy of the obtained distribution and moments of the idle period when the LN interarrival time is approximated by HE distributions of different order (using the Expectation Maximization algorithm) is investigated. Numerical results reveal good fitting accuracy between idle period distributions obtained under the LN and the m-th order HE interarrival time models. It is observed that the fitting accuracy (in terms of the Kolmogorov-Smirnov distance) improves as the order of the HE distribution increases. Finally, the standardized moments of the idle period are compared when the interarrival time follows LN or Weibull distribution with the same first two moments. Numerical results show that the values of the standardized moments of the idle period are higher when the interarrival time follows a LN distribution, as it has a heavier tail compared to that of the Weibull one.
- Open Access
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 50611-50634
Count and Teletraffic Analysis of G/M/1 Queueing Systems With Log-Normal Interarrival Time of Bursty IoT Traffic
In this paper, both performance analysis of finite and infinite buffer G/M/1 queueing systems and count analysis using Log-Normally distributed interarrival times to model highly variable Internet of Things (IoT) traffic are addressed. These mathematical analyses require either exact or approximate expressions for the Laplace-Stieltjes Transform (LT) of the interarrival time density function. Due to non-existence of closed-form LT for the Log-Normal (LN) distribution, count analysis is mathematically infeasible. Furthermore, analysis of finite buffer G/M/1/N queue systems is complex, with only asymptotic results available in the literature; and Markovian teletraffic analysis for LN interarrival time cannot be used. To address these challenges, two novel approaches are proposed. First, a new method to numerically calculate the parameter σ (probability of experiencing delay) in the infinite buffer G/M/1 system is introduced. Second, the LN interarrival time distribution is approximated by Hyper-Exponential (HE) distributions of varying order. Then, a novel birth-and-death process-based teletraffic analysis for the HE/M/1/N system is developed to approximate the LN/M/1/N system’s performance. The mathematical expressions and performance evaluations presented here focus on relevant metrics, such as expected queue length, packet arrival rate, packet dropping probability, and mean packet delay, which were not addressed in prior related studies of finite buffer G/M/1 queue systems. Additionally, the HE approximation approach facilitates the development of analytical tools to quantify traffic burstiness. Numerical results show that 4th-order HE distribution provides performance metrics with less than 3% difference relative to those of the LN/M/1 queueing systems, and these metrics correlate strongly with count metrics.
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 50611-50634
Open AccessCount and Teletraffic Analysis of G/M/1 Queueing Systems With Log-Normal Interarrival Time of Bursty IoT Traffic
In this paper, both performance analysis of finite and infinite buffer G/M/1 queueing systems and count analysis using Log-Normally distributed interarrival times to model highly variable Internet of Things (IoT) traffic are addressed. These mathematical analyses require either exact or approximate expressions for the Laplace-Stieltjes Transform (LT) of the interarrival time density function. Due to non-existence of closed-form LT for the Log-Normal (LN) distribution, count analysis is mathematically infeasible. Furthermore, analysis of finite buffer G/M/1/N queue systems is complex, with only asymptotic results available in the literature; and Markovian teletraffic analysis for LN interarrival time cannot be used. To address these challenges, two novel approaches are proposed. First, a new method to numerically calculate the parameter σ (probability of experiencing delay) in the infinite buffer G/M/1 system is introduced. Second, the LN interarrival time distribution is approximated by Hyper-Exponential (HE) distributions of varying order. Then, a novel birth-and-death process-based teletraffic analysis for the HE/M/1/N system is developed to approximate the LN/M/1/N system’s performance. The mathematical expressions and performance evaluations presented here focus on relevant metrics, such as expected queue length, packet arrival rate, packet dropping probability, and mean packet delay, which were not addressed in prior related studies of finite buffer G/M/1 queue systems. Additionally, the HE approximation approach facilitates the development of analytical tools to quantify traffic burstiness. Numerical results show that 4th-order HE distribution provides performance metrics with less than 3% difference relative to those of the LN/M/1 queueing systems, and these metrics correlate strongly with count metrics.
- Open Access
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 163349-163366
Comparison of Analysis Methods for the Joint Connection-Level and Packet-Level Performance Evaluation of VoIP Traffic Networks
In this paper, the performance of different mathematical models for the joint connection-level and packet-level numerical evaluation of systems with Voice over Internet Protocol (VoIP) traffic are studied and compared. The evaluation focuses on computational running time, memory requirements, and accuracy of performance metrics. System dynamics are captured by a Markov chain and its corresponding state transition probability matrix, which represents the probabilities of transitioning, frame by frame, from one system state to another. In VoIP environments, many transitions between valid states are not possible, resulting in a state transition probability matrix with many zero-value elements. Generally, the computational complexity of solving Markov chains depends on the number of valid states and the number of non-zero elements in the state transition probability matrix. The evaluated analysis methods utilize the following techniques, either separately or in combination: Time-Scale Decomposition Technique (TSDT) and the strategy of Limiting the Number of State Transitions (LNST). TSDT aims to reduce the dimensionality of the analysis and the cardinality of the valid state space, while LNST seeks to minimize the number of non-zero elements in the state transition probability matrix by eliminating unlikely state transitions. Numerical results show that the method combining TSDT with the LNST strategy (M-TSDT&LNST) reduces computational running time by up to 110 times compared to the method using minimal approximation (the reference method). Despite this substantial reduction, the relative differences in system Erlang capacity and connection-level (packet-level) performance metrics between M-TSDT&LNST and the reference method remain below 1.6% and 1.4% (3.8%), respectively.
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 163349-163366
Open AccessComparison of Analysis Methods for the Joint Connection-Level and Packet-Level Performance Evaluation of VoIP Traffic Networks
In this paper, the performance of different mathematical models for the joint connection-level and packet-level numerical evaluation of systems with Voice over Internet Protocol (VoIP) traffic are studied and compared. The evaluation focuses on computational running time, memory requirements, and accuracy of performance metrics. System dynamics are captured by a Markov chain and its corresponding state transition probability matrix, which represents the probabilities of transitioning, frame by frame, from one system state to another. In VoIP environments, many transitions between valid states are not possible, resulting in a state transition probability matrix with many zero-value elements. Generally, the computational complexity of solving Markov chains depends on the number of valid states and the number of non-zero elements in the state transition probability matrix. The evaluated analysis methods utilize the following techniques, either separately or in combination: Time-Scale Decomposition Technique (TSDT) and the strategy of Limiting the Number of State Transitions (LNST). TSDT aims to reduce the dimensionality of the analysis and the cardinality of the valid state space, while LNST seeks to minimize the number of non-zero elements in the state transition probability matrix by eliminating unlikely state transitions. Numerical results show that the method combining TSDT with the LNST strategy (M-TSDT&LNST) reduces computational running time by up to 110 times compared to the method using minimal approximation (the reference method). Despite this substantial reduction, the relative differences in system Erlang capacity and connection-level (packet-level) performance metrics between M-TSDT&LNST and the reference method remain below 1.6% and 1.4% (3.8%), respectively.
- Open Access
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 166268-166280
Queueing Systems With Fractional Number of Servers: Analysis and Practical Implementation of the Erlang-B Traffic Model
In this paper, both the achievement and practical implementation of a fractional number of servers in queueing systems is proposed. The Erlang-B traffic model is considered to demonstrate how the fractional number of servers can be physically realized and incorporated into teletraffic analysis. While mathematical extensions of the Erlang-B formula to consider fractional number of servers have been explored in the literature, neither the practical realization nor the insensitivity property of such models has been extensively studied. In this paper, an approach is presented to effectively achieve fractional number of servers by considering, upon the arrival of service requests, the existence of ⎣ S ⎦ + 1 servers at times, and only ⎣ S ⎦ servers at other times. The strength of this approach lies in its easy integration into the Call Admission Control (CAC) strategy of real queueing systems. Utilizing a fractional number of servers enables precise adjustment of blocking probability, facilitating a fair and adequate performance comparison among different resource management strategies and evaluation scenarios. Additionally, the insensitivity property of the considered Erlang-B model with fractional number of servers is demonstrated. Finally, to illustrate the practical benefits and advantages of considering a fractional number of servers in the CAC and performance evaluation, numerical examples of the proposed concepts are provided and discussed, specifically within the context of a cellular system with VoIP traffic.
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 166268-166280
Open AccessQueueing Systems With Fractional Number of Servers: Analysis and Practical Implementation of the Erlang-B Traffic Model
In this paper, both the achievement and practical implementation of a fractional number of servers in queueing systems is proposed. The Erlang-B traffic model is considered to demonstrate how the fractional number of servers can be physically realized and incorporated into teletraffic analysis. While mathematical extensions of the Erlang-B formula to consider fractional number of servers have been explored in the literature, neither the practical realization nor the insensitivity property of such models has been extensively studied. In this paper, an approach is presented to effectively achieve fractional number of servers by considering, upon the arrival of service requests, the existence of ⎣ S ⎦ + 1 servers at times, and only ⎣ S ⎦ servers at other times. The strength of this approach lies in its easy integration into the Call Admission Control (CAC) strategy of real queueing systems. Utilizing a fractional number of servers enables precise adjustment of blocking probability, facilitating a fair and adequate performance comparison among different resource management strategies and evaluation scenarios. Additionally, the insensitivity property of the considered Erlang-B model with fractional number of servers is demonstrated. Finally, to illustrate the practical benefits and advantages of considering a fractional number of servers in the CAC and performance evaluation, numerical examples of the proposed concepts are provided and discussed, specifically within the context of a cellular system with VoIP traffic.
- Open Access
- 31 March 2019
- Published by ECORFAN in Revista de Sistemas Experimentales
- p. 23-29
Método aproximado para determinar la potencia óptica en una linterna fotónica
Astronomy has benefited significantly from the development of photonic technology. However, the use of single-mode optical fibers in this area is not entirely efficient, this is mainly since its core, of the order of 8 microns in diameter, does not allow the capture of large amounts of light. In addition, in certain astronomical studies, it is required to analyze the multimodal incoherent light coming from the stars, particularly in the spectral range of the near infrared. One solution to these demands is the use of photonic lanterns, which are devices that function as an interface between a set of single-mode fibers and a multimode fiber, and in whose transition very low optical losses are obtained. However, there is not as far as we know, a mathematical method for the analysis of the behavior of the output power in photonic lanterns. Therefore, in this work we propose a numerical approximation method to determine the optical output power of single mode optical fibers in a photonic lantern, using the solution of eigenvalue equations, as well as the spatial capture of a part of the distribution of optical power, through of the end of a monomode tapered optical fiber.
- 31 March 2019
- Published by ECORFAN in Revista de Sistemas Experimentales
- p. 23-29
Open AccessMétodo aproximado para determinar la potencia óptica en una linterna fotónica
Astronomy has benefited significantly from the development of photonic technology. However, the use of single-mode optical fibers in this area is not entirely efficient, this is mainly since its core, of the order of 8 microns in diameter, does not allow the capture of large amounts of light. In addition, in certain astronomical studies, it is required to analyze the multimodal incoherent light coming from the stars, particularly in the spectral range of the near infrared. One solution to these demands is the use of photonic lanterns, which are devices that function as an interface between a set of single-mode fibers and a multimode fiber, and in whose transition very low optical losses are obtained. However, there is not as far as we know, a mathematical method for the analysis of the behavior of the output power in photonic lanterns. Therefore, in this work we propose a numerical approximation method to determine the optical output power of single mode optical fibers in a photonic lantern, using the solution of eigenvalue equations, as well as the spatial capture of a part of the distribution of optical power, through of the end of a monomode tapered optical fiber.
- Open Access
- 19 October 2018
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2018 (1) , 242
Performance analysis of dynamic spectrum leasing strategies in coordinated cognitive radio networks
- 19 October 2018
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2018 (1) , 242
Open AccessPerformance analysis of dynamic spectrum leasing strategies in coordinated cognitive radio networks
- Open Access
- 30 September 2018
- Published by ECORFAN in Revista de Desarrollo Urbano y Sustentable
- p. 15-23
Efecto de la distribución del tiempo de servicio de los usuarios primarios en las estadísticas de los espacios en blanco de un sistema de radio cognoscitivo
Cognitive radio technology was developed for spectral efficiency improvement in mobile communication networks. This is achieved by allowing secondary users to opportunistically and transparently use the white spaces of the primary network. In this paper, the effect of the service time distribution of the primary users in the statistics of the white spaces is analyzed. In particular, the first two standardized moments of both, white space time and white space interarrival time are found, considering the following distributions for the primary service time: log-normal, Weibull, and Pareto. One of the most relevant results is that, for low (moderate or high) traffic load, the exponential (hiper-exponential) distribution is an excellent option for modelling the white space duration. Characterizing these variables allow us to use the on-off paradigm to capture the primary channel activity and, in this way, evaluate the performance of cognitive radio networks. Results were obtained by using discrete event simulation techniques.
- 30 September 2018
- Published by ECORFAN in Revista de Desarrollo Urbano y Sustentable
- p. 15-23
Open AccessEfecto de la distribución del tiempo de servicio de los usuarios primarios en las estadísticas de los espacios en blanco de un sistema de radio cognoscitivo
Cognitive radio technology was developed for spectral efficiency improvement in mobile communication networks. This is achieved by allowing secondary users to opportunistically and transparently use the white spaces of the primary network. In this paper, the effect of the service time distribution of the primary users in the statistics of the white spaces is analyzed. In particular, the first two standardized moments of both, white space time and white space interarrival time are found, considering the following distributions for the primary service time: log-normal, Weibull, and Pareto. One of the most relevant results is that, for low (moderate or high) traffic load, the exponential (hiper-exponential) distribution is an excellent option for modelling the white space duration. Characterizing these variables allow us to use the on-off paradigm to capture the primary channel activity and, in this way, evaluate the performance of cognitive radio networks. Results were obtained by using discrete event simulation techniques.
- Open Access
- 7 May 2018
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 14 (5)
Performance analysis of a wireless sensor network with cognitive radio capabilities in structural health monitoring applications: A discrete model
This article studies the performance of a wireless sensor network with cognitive radio capabilities to gather information about structural health monitoring of buildings in case of seismic activity. Since the use of the local area network is intensive in office and home environments, we propose the use of empty cellular channels (primary system). As such, the structural health monitoring does not degrade the local communications. Thus, the wireless sensor network for structural health monitoring acts as secondary network. Two discrete-time analytical approaches are proposed and developed to evaluate the system performance in terms of both the average packet delay and average energy consumption. The first one is an approximation suitable for the case when the time slot duration is small relative to the mean call inter-arrival time. The second model is accurate for any time slot duration and inter-arrival times.
- 7 May 2018
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 14 (5)
Open AccessPerformance analysis of a wireless sensor network with cognitive radio capabilities in structural health monitoring applications: A discrete model
This article studies the performance of a wireless sensor network with cognitive radio capabilities to gather information about structural health monitoring of buildings in case of seismic activity. Since the use of the local area network is intensive in office and home environments, we propose the use of empty cellular channels (primary system). As such, the structural health monitoring does not degrade the local communications. Thus, the wireless sensor network for structural health monitoring acts as secondary network. Two discrete-time analytical approaches are proposed and developed to evaluate the system performance in terms of both the average packet delay and average energy consumption. The first one is an approximation suitable for the case when the time slot duration is small relative to the mean call inter-arrival time. The second model is accurate for any time slot duration and inter-arrival times.