19,229 research outputs found
Cross-layer design of multi-hop wireless networks
MULTI -hop wireless networks are usually defined as a collection of nodes
equipped with radio transmitters, which not only have the capability to
communicate each other in a multi-hop fashion, but also to route each others’ data
packets. The distributed nature of such networks makes them suitable for a variety of
applications where there are no assumed reliable central entities, or controllers, and
may significantly improve the scalability issues of conventional single-hop wireless
networks.
This Ph.D. dissertation mainly investigates two aspects of the research issues
related to the efficient multi-hop wireless networks design, namely: (a) network
protocols and (b) network management, both in cross-layer design paradigms to
ensure the notion of service quality, such as quality of service (QoS) in wireless mesh
networks (WMNs) for backhaul applications and quality of information (QoI) in
wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of
this Ph.D. dissertation, different network settings are used as illustrative examples,
however the proposed algorithms, methodologies, protocols, and models are not
restricted in the considered networks, but rather have wide applicability.
First, this dissertation proposes a cross-layer design framework integrating
a distributed proportional-fair scheduler and a QoS routing algorithm, while using
WMNs as an illustrative example. The proposed approach has significant performance
gain compared with other network protocols. Second, this dissertation proposes
a generic admission control methodology for any packet network, wired and
wireless, by modeling the network as a black box, and using a generic mathematical
0. Abstract 3
function and Taylor expansion to capture the admission impact. Third, this dissertation
further enhances the previous designs by proposing a negotiation process,
to bridge the applications’ service quality demands and the resource management,
while using WSNs as an illustrative example. This approach allows the negotiation
among different service classes and WSN resource allocations to reach the optimal
operational status. Finally, the guarantees of the service quality are extended to
the environment of multiple, disconnected, mobile subnetworks, where the question
of how to maintain communications using dynamically controlled, unmanned data
ferries is investigated
Spectral Efficiency Scaling Laws in Dense Random Wireless Networks with Multiple Receive Antennas
This paper considers large random wireless networks where
transmit-and-receive node pairs communicate within a certain range while
sharing a common spectrum. By modeling the spatial locations of nodes based on
stochastic geometry, analytical expressions for the ergodic spectral efficiency
of a typical node pair are derived as a function of the channel state
information available at a receiver (CSIR) in terms of relevant system
parameters: the density of communication links, the number of receive antennas,
the path loss exponent, and the operating signal-to-noise ratio. One key
finding is that when the receiver only exploits CSIR for the direct link, the
sum of spectral efficiencies linearly improves as the density increases, when
the number of receive antennas increases as a certain super-linear function of
the density. When each receiver exploits CSIR for a set of dominant interfering
links in addition to the direct link, the sum of spectral efficiencies linearly
increases with both the density and the path loss exponent if the number of
antennas is a linear function of the density. This observation demonstrates
that having CSIR for dominant interfering links provides a multiplicative gain
in the scaling law. It is also shown that this linear scaling holds for direct
CSIR when incorporating the effect of the receive antenna correlation, provided
that the rank of the spatial correlation matrix scales super-linearly with the
density. Simulation results back scaling laws derived from stochastic geometry.Comment: Submitte
An Optimal Medium Access Control with Partial Observations for Sensor Networks
We consider medium access control (MAC) in multihop sensor networks, where only partial information about the shared medium is available to the transmitter. We model our setting as a queuing problem in which the service rate of a queue is a function of a partially observed Markov chain representing the available bandwidth, and in which the arrivals are controlled based on the partial observations so as to keep the system in a desirable mildly unstable regime. The optimal controller for this problem satisfies a separation property: we first compute a probability measure on the state space of the chain, namely the information state, then use this measure as the new state on which the control decisions are based. We give a formal description of the system considered and of its dynamics, we formalize and solve an optimal control problem, and we show numerical simulations to illustrate with concrete examples properties of the optimal control law. We show how the ergodic behavior of our queuing model is characterized by an invariant measure over all possible information states, and we construct that measure. Our results can be specifically applied for designing efficient and stable algorithms for medium access control in multiple-accessed systems, in particular for sensor networks
The Mason Test: A Defense Against Sybil Attacks in Wireless Networks Without Trusted Authorities
Wireless networks are vulnerable to Sybil attacks, in which a malicious node
poses as many identities in order to gain disproportionate influence. Many
defenses based on spatial variability of wireless channels exist, but depend
either on detailed, multi-tap channel estimation - something not exposed on
commodity 802.11 devices - or valid RSSI observations from multiple trusted
sources, e.g., corporate access points - something not directly available in ad
hoc and delay-tolerant networks with potentially malicious neighbors. We extend
these techniques to be practical for wireless ad hoc networks of commodity
802.11 devices. Specifically, we propose two efficient methods for separating
the valid RSSI observations of behaving nodes from those falsified by malicious
participants. Further, we note that prior signalprint methods are easily
defeated by mobile attackers and develop an appropriate challenge-response
defense. Finally, we present the Mason test, the first implementation of these
techniques for ad hoc and delay-tolerant networks of commodity 802.11 devices.
We illustrate its performance in several real-world scenarios
- …