Results 1  10
of
17
Simultaneous information and energy transfer in largescale networks with/without relaying
 IEEE Trans. Commun
, 2014
"... iv ..."
(Show Context)
Outage Probability in ArbitrarilyShaped Finite Wireless Networks
, 2013
"... This paper analyzes the outage performance in finite wireless networks. Unlike most prior works, which either assumed a specific network shape or considered a special location of the reference receiver, we propose two general frameworks for analytically computing the outage probability at any arbit ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
This paper analyzes the outage performance in finite wireless networks. Unlike most prior works, which either assumed a specific network shape or considered a special location of the reference receiver, we propose two general frameworks for analytically computing the outage probability at any arbitrary location of an arbitrarilyshaped finite wireless network: (i) a moment generating functionbased framework which is based on the numerical inversion of the Laplace transform of a cumulative distribution and (ii) a reference link power gainbased framework which exploits the distribution of the fading power gain between the reference transmitter and receiver. The outage probability is spatially averaged over both the fading distribution and the possible locations of the interferers. The boundary effects are accurately accounted for using the probability distribution function of the distance of a random node from the reference receiver. For the case of the node locations modeled by a Binomial point process and Nakagamim fading channel, we demonstrate the use of the proposed frameworks to evaluate the outage probability at any location inside either a disk or polygon region. The analysis illustrates the location dependent performance in finite wireless networks and highlights the importance of accurately modeling the boundary effects.
Distance distributions in regular polygons
 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
, 2013
"... This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular Lsided polygon. Using this result, we obtain the closedform probability density function (PDF) of the Euclidean distance between any arbitrary ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular Lsided polygon. Using this result, we obtain the closedform probability density function (PDF) of the Euclidean distance between any arbitrary reference point and its nth neighbour node, when N nodes are uniformly and independently distributed inside a regular Lsided polygon. First, we exploit the rotational symmetry of the regular polygons and quantify the effect of polygon sides and vertices on the distance distributions. Then we propose an algorithm to determine the distance distributions given any arbitrary location of the reference point inside the polygon. For the special case when the arbitrary reference point is located at the center of the polygon, our framework reproduces the existing result in the literature.
Guard zones and the nearfar problem in DSCDMA ad hoc networks
 in Proc. IEEE Military Commun. Conf. (MILCOM
, 2012
"... Abstract—The central issue in directsequence codedivision multipleaccess (DSCDMA) ad hoc networks is the prevention of a nearfar problem. This paper considers two types of guard zones that may be used to control the nearfar problem: a fundamental exclusion zone and an additional CSMA guard zo ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract—The central issue in directsequence codedivision multipleaccess (DSCDMA) ad hoc networks is the prevention of a nearfar problem. This paper considers two types of guard zones that may be used to control the nearfar problem: a fundamental exclusion zone and an additional CSMA guard zone that may be established by the carriersense multipleaccess (CSMA) protocol. In the exclusion zone, no mobiles are physically present, modeling the minimum physical separation among mobiles that is always present in actual networks. Potentially interfering mobiles beyond a transmitting mobile’s exclusion zone, but within its CSMA guard zone, are deactivated by the protocol. This paper provides an analysis of DSCSMA networks with either or both types of guard zones. A network of finite extent with a finite number of mobiles is modeled as a uniform clustering process. The analysis uses a closedform expression for the outage probability in the presence of Nakagami fading, conditioned on the network geometry. By using the analysis developed in this paper, the tradeoffs between exclusion zones and CSMA guard zones are explored for DSCDMA and unspread networks. I.
A new analysis of the DSCDMA cellular downlink under spatial constraints
 in Proc. IEEE Int. Conf. on Comp., Network. and Commun
, 2013
"... Abstract—The directsequence codedivision multiple access (DSCDMA) cellular downlink is modeled by a constrained random spatial model involving a fixed number of base stations placed over a finite area with a minimum separation. The analysis is driven by a new closedform expression for the condit ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Abstract—The directsequence codedivision multiple access (DSCDMA) cellular downlink is modeled by a constrained random spatial model involving a fixed number of base stations placed over a finite area with a minimum separation. The analysis is driven by a new closedform expression for the conditional outage probability at each mobile, where the conditioning is with respect to the network realization. The analysis features a flexible channel model, accounting for path loss, Nakagami fading, and shadowing. By generating many random networks and applying a given resource allocation policy, the distribution of the rates provided to each user is obtained. In addition to determining the average rate, the analysis can determine the transmission capacity of the network and can characterize fairness in terms of the fraction of users that achieve a specified rate. The analysis is used to compare a ratecontrol policy against a powercontrol policy and investigate the influence of the minimum basestation separation. I.
A direct approach to computing spatially averaged outage probability
 IEEE Communications Letters
, 2014
"... Abstract—This letter describes a direct method for computing the spatially averaged outage probability of a network with interferers located according to a point process and signals subject to fading. Unlike most common approaches, it does not require transforms such as a Laplace transform. Examples ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract—This letter describes a direct method for computing the spatially averaged outage probability of a network with interferers located according to a point process and signals subject to fading. Unlike most common approaches, it does not require transforms such as a Laplace transform. Examples show how to directly obtain the outage probability in the presence of Rayleigh fading in networks whose interferers are drawn from binomial and Poisson point processes defined over arbitrary regions. We furthermore show that, by extending the arbitrary region to the entire plane, the result for Poisson point processes converges to the same expression found by Baccelli et al.. Index Terms—Outage probability, stochastic geometry, point processes, interference modeling, fading. I.
An analysis of the DSCDMA cellular uplink for arbitrary and constrained topologies
 IEEE Trans. Commun
, 2013
"... ar ..."
(Show Context)
An Accurate and Efficient Analysis of a MBSFN Network
 University of Massachusetts
, 1993
"... ar ..."
(Show Context)
Optimization of a Finite FrequencyHopping Ad Hoc Network in Nakagami Fading
"... Abstract—This paper considers the analysis and optimization of a frequencyhopping ad hoc network with a finite number of mobiles and finite spatial extent. The mobiles communicate using coded continuousphase frequencyshift keying (CPFSK) modulation. The performance of the system is a function of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract—This paper considers the analysis and optimization of a frequencyhopping ad hoc network with a finite number of mobiles and finite spatial extent. The mobiles communicate using coded continuousphase frequencyshift keying (CPFSK) modulation. The performance of the system is a function of the number of hopping channels, the rate of the errorcorrection code, and the modulation index used by the CPFSK modulation. For a given channel model and density of mobiles, these parameters are jointly optimized by maximizing the (modulationconstrained) transmission capacity, which is a measure of the spatial spectral efficiency of the system. The transmission capacity of the finite network is found by using a recent expression for the spatially averaged outage probability in the presence of Nakagami fading, which is found in closed form in the absence of shadowing and can be solved using numerical integration in the presence of shadowing. I.
Performance Analysis of Geographic Routing Protocols in Ad Hoc Networks
"... Abstract—Geographic routing protocols greatly reduce the requirements of topology storage and provide flexibility in the accommodation of the dynamic behavior of ad hoc networks. This paper presents performance evaluations and comparisons of two geographic routing protocols and the popular AODV prot ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Geographic routing protocols greatly reduce the requirements of topology storage and provide flexibility in the accommodation of the dynamic behavior of ad hoc networks. This paper presents performance evaluations and comparisons of two geographic routing protocols and the popular AODV protocol. The tradeoffs among the average path reliabilities, average conditional delays, average conditional number of hops, and area spectral efficiencies and the effects of various parameters are illustrated for finite ad hoc networks with randomly placed mobiles. This paper uses a dual method of closedform analysis and simple simulation that is applicable to most routing protocols and provides a much more realistic performance evaluation than has previously been possible. Some features included in the new analysis are shadowing, exclusion and guard zones, and distancedependent fading. I.