Brian L. Mark

Brian L. Mark

Auto-generated profile, based on publicly available information

Brian L. Mark

Department of Electrical and Computer Engineering, George Mason University, Fairfax, VA, USA

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 August 2013 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
TNThao Nguyen
Thao Nguyen
BMBrian L. Mark
Brian L. Mark
YEYariv Ephraim
Yariv Ephraim
A new statistical model, in the form of a hidden bivariate Markov chain observed through a Gaussian channel, is developed and applied to spectrum sensing for cognitive radio. We focus on temporal spectrum sensing in a single narrowband channel in which a primary transmitter is either in an idle or an active state. The main advantage of the proposed model, compared to a standard hidden Markov model (HMM), is that it allows a phase-type dwell time distribution for the process in each state. This distribution significantly generalizes the geometric dwell time distribution of a standard HMM. Measurements taken from real data confirm that the geometric dwell time distribution characteristic of the HMM is not adequate for this application. The Baum algorithm is used to estimate the parameter of the proposed model and a forward recursion is applied to online estimation and prediction of the state of the cognitive radio channel. The performance of the proposed model and spectrum sensing approach are demonstrated using numerical results derived from real spectrum measurement data.

7 March 2006 in International Journal of Network Management
Verified
Journal Article
Closed access
PDF file
ALAlexe E. Leu
Alexe E. Leu
MMMark McHenry
Mark McHenry
BMBrian L. Mark
Brian L. Mark

22 October 2008 in Ad Hoc Networks
Verified
Journal Article
Closed access
CZCharikleia Zouridaki
Charikleia Zouridaki
BMBrian L. Mark
Brian L. Mark
MHMarek Hejmo
Marek Hejmo
RTRoshan K. Thomas
Roshan K. Thomas

26 June 2013 in Foundations and Trends® in Signal Processing
Verified
Journal Article
Closed access
PDF file
YEYariv Ephraim
Yariv Ephraim
BMBrian L. Mark
Brian L. Mark
A bivariate Markov process comprises a pair of random processes which are jointly Markov. One of the two processes in that pair is observable while the other plays the role of an underlying process. We are interested in three classes of bivariate Markov processes. In the first and major class of interest, the underlying and observable processes are continuous-time with finite alphabet; in the second class, they are discrete-time with finite alphabet; and in the third class, the underlying process is continuous-time with uncountably infinite alphabet, and the observable process is continuous-time with countably or uncountably infinite alphabet. We refer to processes in the first two classes as bivariate Markov chains. Important examples of continuoustime bivariate Markov chains include the Markov modulated Poisson process, and the batch Markovian arrival process. A hidden Markov model with finite alphabet is an example of a discrete-time bivariate Markov chain. In the third class we have diffusion processes observed in Brownian motion, and diffusion processes modulating the rate of a Poisson process. Bivariate Markov processes play central roles in the theory and applications of estimation, control, queuing, biomedical engineering, and reliability. We review properties of bivariate Markov processes, recursive estimation of their statistics, and recursive and iterative parameter estimation.

1 January 2007 in Journal of Computer Security
Verified
Journal Article
Closed access
PDF file
CZCharikleia Zouridaki
Charikleia Zouridaki
BMBrian L. Mark
Brian L. Mark
MHMarek Hejmo
Marek Hejmo
RTRoshan K. Thomas
Roshan K. Thomas
In mobile ad hoc networks (MANETs), a source node must rely on other nodes to forward its packets on multi-hop routes to the destination. Secure and reliable handling of packets by the intermediate nodes is difficult to ensure in an ad hoc environmen

27 April 2016 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YSYuandao Sun
Yuandao Sun
BMBrian L. Mark
Brian L. Mark
YEYariv Ephraim
Yariv Ephraim
Collaborative spectrum sensing exploits multiuser diversity by combining spectrum sensing information from multiple secondary users to make joint decisions about spectrum occupancy. In hard fusion schemes, each secondary user makes a hard decision on spectrum occupancy and a fusion center makes a final decision by combining the individual hard decisions according to a fusion rule. In soft fusion schemes, each secondary user provides a signal power measurement to the fusion center, which performs further processing on the collection of all observations to make a final decision. In this paper, we propose hard and soft fusion collaborative spectrum sensing schemes based on the online hidden bivariate Markov chain modeling of the signals received by secondary users. Compared with prior collaborative sensing schemes, the proposed model-based schemes do not rely on precomputed thresholds or weights, and achieve superior performance. The online estimation of hidden bivariate Markov models provides predictive information that can be used to improve the performance of the dynamic spectrum access. Numerical results are presented to demonstrate the performance and communication overhead tradeoffs of the proposed collaborative spectrum sensing schemes.