Prof. Vitalis Kalecha Oduol Publications 
1  2013  UHF (700 MHz) Spectrum Band Occupancy Measurements Analysis And Considerations For Deployment Of Long Term Evolution (LTE) Deployment In Kenya Click to View Abstract

2  2009  Transient Analysis Of A SingleServer Queue With Batch Arrivals Using Modeling And Functions Akin To The Modified Bessel Functions, Vitalice K. Oduol, International Journal Of Applied Science, Engineering And Technology, Vol.5, No.1, Pp.3439, 2009 Click to View Abstract
The paper considers a singleserver queue with fixedsize batch Poisson arrivals and exponential service times, a model that is useful for a buffer that accepts messages arriving as fixed size batches of packets and releases them one packet at time. Transient performance measures for queues have long been recognized as being complementary to the steadystate analysis. The focus of the paper is on the use of the functions that arise in the analysis of the transient behaviour of the queuing system. The paper exploits practical modelling to obtain a solution to the integral equation encountered in the analysis. Results obtained indicate that under heavy load conditions, there is significant disparity in the statistics between the transient and steady state values. 
3  2009  Performance Of Block Codes Using The Eigenstructure Of The Code Correlation Matrix And SoftDecision Decoding Of BPSK, Vitalice K. Oduol, Cemal Ardil, International Journal Of Applied Science, Engineering And Technology Vol.5, No.1, Pp.4853, 2009 Click to View Abstract
A method is presented for obtaining the error probability for block codes. The method is based on the eigenvalueeigenvector properties of the code correlation matrix. It is found that under a unary transformation and for an additive white Gaussian noise environment, the performance evaluation of a block code becomes a onedimensional problem in which only one eigenvalue and its corresponding eigenvector are needed in the computation. The obtained error rate results show remarkable agreement between simulations and analysis. 
4  2009  BIPBased Alarm Declaration And Clearing In SONET Networks Employing Automatic Protection Switching, Vitalice K. Oduol, Cemal Ardil, International Journal Of Computer, Information, And Systems Science, And Engineering, Vol.3, No.1, Pp.3035, 2009 Click to View Abstract
The paper examines the performance of bitinterleaved parity (BIP) methods in error rate monitoring, and in declaration and clearing of alarms in those transport networks that employ automatic protection switching (APS). The BIPbased error rate monitoring is attractive for its simplicity and ease of implementation. The BIPbased results are compared with exact results and are found to declare the alarms too late, and to clear the alarms too early. It is concluded that the standards development and systems implementation should take into account the fact of early clearing and late declaration of alarms. The window parameters defining the detection and clearing thresholds should be set so as to build sufficient hysteresis into the system to ensure that BIPbased implementations yield acceptable performance results. 
5  2009  Transient Analysis Of A SingleServer Queue With FixedSize Batch Arrivals, Vitalice K. Oduol, Cemal Ardil, International Journal Of Electronics, Communications And Computer Engineering Vol.1, No.1, Pp.5560, June 2009 Click to View Abstract
The transient analysis of a queuing system with fixedsize batch Poisson arrivals and a single server with exponential service times is presented. The focus of the paper is on the use of the functions that arise in the analysis of the transient behaviour of the queuing system. These functions are shown to be a generalization of the modified Bessel functions of the first kind, with the batch size B as the generalizing parameter. Results for the case of singlepacket arrivals are obtained first. The similarities between the two families of functions are then used to obtain results for the general case of batch arrival queue with a batch size larger than one. 
6  2009  Frame And Burst Acquisition In TDMA Satellite Communication Networks With Transponder Hopping, Vitalice K. Oduol, Cemal Ardil, International Journal Of Electronics, Communications And Computer Engineering, Vol.1, No.2, Pp.100105, July 2009 Click to View Abstract
The paper presents frame and burst acquisition in a satellite communication network based on time division multiple access (TDMA) in which the transmissions may be carried on different transponders. A unique word pattern is used for the acquisition process. The search for the frame is aided by softdecision of QPSK modulated signals in an additive white Gaussian channel. Results show that when the false alarm rate is low the probability of detection is also low, and the acquisition time is long. Conversely when the false alarm rate is high, the probability of detection is also high and the acquisition time is short. Thus the system operators can trade high false alarm rates for high detection probabilities and shorter acquisition times. 
7  2009  System Overflow/Blocking Transients For Queues With Batch Arrivals Using A Family Of Polynomials Resembling Chebyshev Polynomials, Vitalice K. Oduol, Cemal Ardil, International Journal Of Applied Science, Engineering And Technology, Vol.5, No. 2, Pp.1021 Click to View Abstract
The paper shows that in the analysis of a queuing system with fixedsize batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomialsof the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to noteis the proportion of the overflow (or blocking) probability resident in the transient component,which is shown in the results to be more significant at the beginning of the transient and naturally decays to zero in the limit of large t. The results also show that the significanceof transients is more pronounced in cases of lighter loads, but lasts longer for heavier loads. 
8  1999  Data Flow And Buffer Management In A MultiChannel Data Link Controller, S. Varada, V. Oduol, A. Shelat, Conference On Local Computer Networks, 1999. LCN '99, Click to View Abstract
The paper shows that in the analysis of a queuing system with fixedsize batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomialsof the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to noteis the proportion of the overflow (or blocking) probability resident in the transient component,which is shown in the results to be more significant at the beginning of the transient and naturally decays to zero in the limit of large t. The results also show that the significanceof transients is more pronounced in cases of lighter loads, but lasts longer for heavier loads. 
9  1996  "Integration Of Wireless Local Loop (WLL) And VSATs For Rural Communications", V. K. Oduol,Presentation At INTELSAT, Washington, DC, May 1996 Click to View Abstract
The paper shows that in the analysis of a queuing system with fixedsize batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomialsof the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to noteis the proportion of the overflow (or blocking) probability resident in the transient component,which is shown in the results to be more significant at the beginning of the transient and naturally decays to zero in the limit of large t. The results also show that the significanceof transients is more pronounced in cases of lighter loads, but lasts longer for heavier loads. 
10  1995  Rain Fade Mitigation, A. Dissanayake, V. Oduol, NASA ACTS Results Conference, Sept. 1113,1995 Click to View Abstract
The paper shows that in the analysis of a queuing system with fixedsize batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomialsof the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to noteis the proportion of the overflow (or blocking) probability resident in the transient component,which is shown in the results to be more significant at the beginning of the transient and naturally decays to zero in the limit of large t. The results also show that the significanceof transients is more pronounced in cases of lighter loads, but lasts longer for heavier loads. 
11  1993  Performance Evaluation Of The Generalized Type11 Hybrid ARQ Scheme With Noisy Feedback On Markov Channels, V.K. Oduol, S. D. Morgera, IEEE Transactions On Communications, Click to View Abstract
The paper shows that in the analysis of a queuing system with fixedsize batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomialsof the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to noteis the proportion of the overflow (or blocking) probability resident in the transient component,which is shown in the results to be more significant at the beginning of the transient and naturally decays to zero in the limit of large t. The results also show that the significanceof transients is more pronounced in cases of lighter loads, but lasts longer for heavier loads. 
12  1991  Satellite OnBoard Processing", V. K. Oduol, Seminar Presentation At MPB Technologies, Montreal, Canada, October 1991. Click to View Abstract
The paper shows that in the analysis of a queuing system with fixedsize batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomialsof the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to noteis the proportion of the overflow (or blocking) probability resident in the transient component,which is shown in the results to be more significant at the beginning of the transient and naturally decays to zero in the limit of large t. The results also show that the significanceof transients is more pronounced in cases of lighter loads, but lasts longer for heavier loads. 
13  1990  Meteor Burst Communications In The Post 2000 Era, C. Marriott, V. Oduol, A. Ghosh, B.Tailor, IEEE Military Communications Conference, 1990. MILCOM '90, Conference Record, A New Era. 1990 IEEE, 1990 Click to View Abstract
The paper shows that in the analysis of a queuing system with fixedsize batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomialsof the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to noteis the proportion of the overflow (or blocking) probability resident in the transient component,which is shown in the results to be more significant at the beginning of the transient and naturally decays to zero in the limit of large t. The results also show that the significanceof transients is more pronounced in cases of lighter loads, but lasts longer for heavier loads. 
14  1989  SoftDecision Decoding Applied To The Generalized Type11 Hybrid ARQ Scheme, S. D. Morgera, V.K Oduol,. IEEE Transactions On Communications, Volume: 37 Issue: 4, April 1989 Click to View Abstract
The paper shows that in the analysis of a queuing system with fixedsize batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomialsof the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to noteis the proportion of the overflow (or blocking) probability resident in the transient component,which is shown in the results to be more significant at the beginning of the transient and naturally decays to zero in the limit of large t. The results also show that the significanceof transients is more pronounced in cases of lighter loads, but lasts longer for heavier loads. 
15  1988  SoftDecision Decoding Applied To The Generalized Type11 Hybrid ARQ Scheme, S. D. Morgera, V. Oduol, IEEE International Conference On Communications, Vol.2, 1988, Click to View Abstract
The paper shows that in the analysis of a queuing system with fixedsize batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomialsof the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to noteis the proportion of the overflow (or blocking) probability resident in the transient component,which is shown in the results to be more significant at the beginning of the transient and naturally decays to zero in the limit of large t. The results also show that the significanceof transients is more pronounced in cases of lighter loads, but lasts longer for heavier loads. 