4,184 research outputs found
Carrier Sense Random Packet CDMA Protocol in Dual-Channel Networks
Code resource wastage is caused by the reason that many hopping frequency (FH) sequences are unused, which occurs under the condition that the number of the actual subnets needed for the tactical network is far smaller than the networking capacity of code division net¬working. Dual-channel network (DCN), consisting of one single control channel and multiple data channels, can solve the code resource wastage effectively. To improve the anti-jamming capability of the control channel of DCN, code division multiple access (CDMA) technology was introduced, and a carrier sense random packet (CSRP) CDMA protocol based on random packet CDMA (RP-CDMA) was proposed. In CSRP-CDMA, we provide a carrier sensing random packet mechanism and a packet-segment acknowledgement policy. Furthermore, an analytical model was developed to evaluate the performance of CSRP-CDMA networks. In this model, the impacts of multi-access interference from both inter-clusters and intra-clusters were analyzed, and the mathematical expressions of packet transmission success probability, normalized network throughput and signal interference to noise ratio, were also derived. Analytical and simulation results demonstrate that the normalized network throughput of CSRP-CDMA outperforms traditional RP-CDMA by 10%, which can guarantee the resource utilization efficiency of the control channel in DCNs
A Non-Cooperative Game Theoretical Approach For Power Control In Virtual MIMO Wireless Sensor Network
Power management is one of the vital issue in wireless sensor networks, where
the lifetime of the network relies on battery powered nodes. Transmitting at
high power reduces the lifetime of both the nodes and the network. One
efficient way of power management is to control the power at which the nodes
transmit. In this paper, a virtual multiple input multiple output wireless
sensor network (VMIMO-WSN)communication architecture is considered and the
power control of sensor nodes based on the approach of game theory is
formulated. The use of game theory has proliferated, with a broad range of
applications in wireless sensor networking. Approaches from game theory can be
used to optimize node level as well as network wide performance. The game here
is categorized as an incomplete information game, in which the nodes do not
have complete information about the strategies taken by other nodes. For
virtual multiple input multiple output wireless sensor network architecture
considered, the Nash equilibrium is used to decide the optimal power level at
which a node needs to transmit, to maximize its utility. Outcome shows that the
game theoretic approach considered for VMIMO-WSN architecture achieves the best
utility, by consuming less power.Comment: 12 pages, 8 figure
Interference and Throughput in Aloha-based Ad Hoc Networks with Isotropic Node Distribution
We study the interference and outage statistics in a slotted Aloha ad hoc
network, where the spatial distribution of nodes is non-stationary and
isotropic. In such a network, outage probability and local throughput depend on
both the particular location in the network and the shape of the spatial
distribution. We derive in closed-form certain distributional properties of the
interference that are important for analyzing wireless networks as a function
of the location and the spatial shape. Our results focus on path loss exponents
2 and 4, the former case not being analyzable before due to the stationarity
assumption of the spatial node distribution. We propose two metrics for
measuring local throughput in non-stationary networks and discuss how our
findings can be applied to both analysis and optimization.Comment: 5 pages, 3 figures. To appear in International Symposium on
Information Theory (ISIT) 201
Connectivity in Sub-Poisson Networks
We consider a class of point processes (pp), which we call {\em sub-Poisson};
these are pp that can be directionally-convexly () dominated by some
Poisson pp. The order has already been shown useful in comparing various
point process characteristics, including Ripley's and correlation functions as
well as shot-noise fields generated by pp, indicating in particular that
smaller in the order processes exhibit more regularity (less clustering,
less voids) in the repartition of their points. Using these results, in this
paper we study the impact of the ordering of pp on the properties of two
continuum percolation models, which have been proposed in the literature to
address macroscopic connectivity properties of large wireless networks. As the
first main result of this paper, we extend the classical result on the
existence of phase transition in the percolation of the Gilbert's graph (called
also the Boolean model), generated by a homogeneous Poisson pp, to the class of
homogeneous sub-Poisson pp. We also extend a recent result of the same nature
for the SINR graph, to sub-Poisson pp. Finally, as examples we show that the
so-called perturbed lattices are sub-Poisson. More generally, perturbed
lattices provide some spectrum of models that ranges from periodic grids,
usually considered in cellular network context, to Poisson ad-hoc networks, and
to various more clustered pp including some doubly stochastic Poisson ones.Comment: 8 pages, 10 figures, to appear in Proc. of Allerton 2010. For an
extended version see http://hal.inria.fr/inria-00497707 version
- …