1,084 research outputs found
Opportunistic Interference Mitigation Achieves Optimal Degrees-of-Freedom in Wireless Multi-cell Uplink Networks
We introduce an opportunistic interference mitigation (OIM) protocol, where a
user scheduling strategy is utilized in -cell uplink networks with
time-invariant channel coefficients and base stations (BSs) having
antennas. Each BS opportunistically selects a set of users who generate the
minimum interference to the other BSs. Two OIM protocols are shown according to
the number of simultaneously transmitting users per cell: opportunistic
interference nulling (OIN) and opportunistic interference alignment (OIA).
Then, their performance is analyzed in terms of degrees-of-freedom (DoFs). As
our main result, it is shown that DoFs are achievable under the OIN
protocol with selected users per cell, if the total number of users in
a cell scales at least as . Similarly, it turns out that
the OIA scheme with () selected users achieves DoFs, if scales
faster than . These results indicate that there exists a
trade-off between the achievable DoFs and the minimum required . By deriving
the corresponding upper bound on the DoFs, it is shown that the OIN scheme is
DoF optimal. Finally, numerical evaluation, a two-step scheduling method, and
the extension to multi-carrier scenarios are shown.Comment: 18 pages, 3 figures, Submitted to IEEE Transactions on Communication
Parallel Opportunistic Routing in Wireless Networks
We study benefits of opportunistic routing in a large wireless ad hoc network
by examining how the power, delay, and total throughput scale as the number of
source- destination pairs increases up to the operating maximum. Our
opportunistic routing is novel in a sense that it is massively parallel, i.e.,
it is performed by many nodes simultaneously to maximize the opportunistic gain
while controlling the inter-user interference. The scaling behavior of
conventional multi-hop transmission that does not employ opportunistic routing
is also examined for comparison. Our results indicate that our opportunistic
routing can exhibit a net improvement in overall power--delay trade-off over
the conventional routing by providing up to a logarithmic boost in the scaling
law. Such a gain is possible since the receivers can tolerate more interference
due to the increased received signal power provided by the multi-user diversity
gain, which means that having more simultaneous transmissions is possible.Comment: 18 pages, 7 figures, Under Review for Possible Publication in IEEE
Transactions on Information Theor
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
Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks
In this paper, we consider a cognitive radio network that consists of one
cognitive base station (CBS) and multiple cognitive users (CUs) in the presence
of multiple eavesdroppers, where CUs transmit their data packets to CBS under a
primary user's quality of service (QoS) constraint while the eavesdroppers
attempt to intercept the cognitive transmissions from CUs to CBS. We
investigate the physical-layer security against eavesdropping attacks in the
cognitive radio network and propose the user scheduling scheme to achieve
multiuser diversity for improving the security level of cognitive transmissions
with a primary QoS constraint. Specifically, a cognitive user (CU) that
satisfies the primary QoS requirement and maximizes the achievable secrecy rate
of cognitive transmissions is scheduled to transmit its data packet. For the
comparison purpose, we also examine the traditional multiuser scheduling and
the artificial noise schemes. We analyze the achievable secrecy rate and
intercept probability of the traditional and proposed multiuser scheduling
schemes as well as the artificial noise scheme in Rayleigh fading environments.
Numerical results show that given a primary QoS constraint, the proposed
multiuser scheduling scheme generally outperforms the traditional multiuser
scheduling and the artificial noise schemes in terms of the achievable secrecy
rate and intercept probability. In addition, we derive the diversity order of
the proposed multiuser scheduling scheme through an asymptotic intercept
probability analysis and prove that the full diversity is obtained by using the
proposed multiuser scheduling.Comment: 12 pages. IEEE Transactions on Communications, 201
- …