id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0704.0590
|
Rachit Agarwal
|
Rachit Agarwal, Ralf Koetter and Emanuel Popovici
|
A Low Complexity Algorithm and Architecture for Systematic Encoding of
Hermitian Codes
|
5 Pages, Accepted in IEEE International Symposium on Information
Theory ISIT 2007
| null |
10.1109/ISIT.2007.4557408
| null |
cs.IT math.IT
| null |
We present an algorithm for systematic encoding of Hermitian codes. For a
Hermitian code defined over GF(q^2), the proposed algorithm achieves a run time
complexity of O(q^2) and is suitable for VLSI implementation. The encoder
architecture uses as main blocks q varying-rate Reed-Solomon encoders and
achieves a space complexity of O(q^2) in terms of finite field multipliers and
memory elements.
|
[
{
"version": "v1",
"created": "Wed, 4 Apr 2007 15:06:14 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Apr 2007 11:47:23 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Agarwal",
"Rachit",
""
],
[
"Koetter",
"Ralf",
""
],
[
"Popovici",
"Emanuel",
""
]
] |
new_dataset
| 0.987086 |
0704.2505
|
G.Susinder Rajan
|
G. Susinder Rajan and B. Sundar Rajan
|
Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity
|
5 pages, no figures. To appear in Proceedings of IEEE ISIT 2007,
Nice, France
| null |
10.1109/ISIT.2007.4557437
| null |
cs.IT cs.DM math.IT
| null |
"Extended Clifford algebras" are introduced as a means to obtain low ML
decoding complexity space-time block codes. Using left regular matrix
representations of two specific classes of extended Clifford algebras, two
systematic algebraic constructions of full diversity Distributed Space-Time
Codes (DSTCs) are provided for any power of two number of relays. The left
regular matrix representation has been shown to naturally result in space-time
codes meeting the additional constraints required for DSTCs. The DSTCs so
constructed have the salient feature of reduced Maximum Likelihood (ML)
decoding complexity. In particular, the ML decoding of these codes can be
performed by applying the lattice decoder algorithm on a lattice of four times
lesser dimension than what is required in general. Moreover these codes have a
uniform distribution of power among the relays and in time, thus leading to a
low Peak to Average Power Ratio at the relays.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2007 11:05:31 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Rajan",
"G. Susinder",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.999175 |
0704.2651
|
Lalitha Sankar
|
Lalitha Sankar, Yingbin Liang, H. Vincent Poor, Narayan B. Mandayam
|
Opportunistic Communications in an Orthogonal Multiaccess Relay Channel
|
To appear in the Proceedings of the 2007 IEEE International Symposium
on Information Theory, Nice, France, June 24 - 29, 2007
| null |
10.1109/ISIT.2007.4557396
| null |
cs.IT math.IT
| null |
The problem of resource allocation is studied for a two-user fading
orthogonal multiaccess relay channel (MARC) where both users (sources)
communicate with a destination in the presence of a relay. A half-duplex relay
is considered that transmits on a channel orthogonal to that used by the
sources. The instantaneous fading state between every transmit-receive pair in
this network is assumed to be known at both the transmitter and receiver. Under
an average power constraint at each source and the relay, the sum-rate for the
achievable strategy of decode-and-forward (DF) is maximized over all power
allocations (policies) at the sources and relay. It is shown that the sum-rate
maximizing policy exploits the multiuser fading diversity to reveal the
optimality of opportunistic channel use by each user. A geometric
interpretation of the optimal power policy is also presented.
|
[
{
"version": "v1",
"created": "Fri, 20 Apr 2007 04:02:33 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Sankar",
"Lalitha",
""
],
[
"Liang",
"Yingbin",
""
],
[
"Poor",
"H. Vincent",
""
],
[
"Mandayam",
"Narayan B.",
""
]
] |
new_dataset
| 0.970451 |
0707.1470
|
Yingbin Liang
|
Yingbin Liang, H. Vincent Poor and Shlomo Shamai (Shitz)
|
Secrecy Capacity Region of Fading Broadcast Channels
|
Proc. of IEEE International Symposium on Information Theory (ISIT),
June 2007
| null |
10.1109/ISIT.2007.4557401
| null |
cs.IT math.IT
| null |
The fading broadcast channel with confidential messages (BCC) is
investigated, where a source node has common information for two receivers
(receivers 1 and 2), and has confidential information intended only for
receiver 1. The confidential information needs to be kept as secret as possible
from receiver 2. The channel state information (CSI) is assumed to be known at
both the transmitter and the receivers. The secrecy capacity region is first
established for the parallel Gaussian BCC, and the optimal source power
allocations that achieve the boundary of the secrecy capacity region are
derived. In particular, the secrecy capacity region is established for the
Gaussian case of the Csiszar-Korner BCC model. The secrecy capacity results are
then applied to give the ergodic secrecy capacity region for the fading BCC.
|
[
{
"version": "v1",
"created": "Tue, 10 Jul 2007 15:16:13 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Liang",
"Yingbin",
"",
"Shitz"
],
[
"Poor",
"H. Vincent",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.992952 |
0707.2780
|
Aydin Sezgin
|
Aydin Sezgin, Mohamad Charafeddine, Arogyaswami Paulraj
|
On the ergodic sum-rate performance of CDD in multi-user systems
|
to appear in Proceedings of 2007 IEEE Information Theory Workshop
(ITW) in Lake Tahoe
| null |
10.1109/ITW.2007.4313052
| null |
cs.IT math.IT
| null |
The main focus of space-time coding design and analysis for MIMO systems has
been so far focused on single-user systems. For single-user systems, transmit
diversity schemes suffer a loss in spectral efficiency if the receiver is
equipped with more than one antenna, making them unsuitable for high rate
transmission. One such transmit diversity scheme is the cyclic delay diversity
code (CDD). The advantage of CDD over other diversity schemes such as
orthogonal space-time block codes (OSTBC) is that a code rate of one and delay
optimality are achieved independent of the number of transmit antennas. In this
work we analyze the ergodic rate of a multi-user multiple access channel (MAC)
with each user applying such a cyclic delay diversity (CDD) code. We derive
closed form expressions for the ergodic sum-rate of multi-user CDD and compare
it with the sum-capacity. We study the ergodic rate region and show that in
contrast to what is conventionally known regarding the single-user case,
transmit diversity schemes are viable candidates for high rate transmission in
multi-user systems. Finally, our theoretical findings are illustrated by
numerical simulation results.
|
[
{
"version": "v1",
"created": "Wed, 18 Jul 2007 18:39:23 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Sezgin",
"Aydin",
""
],
[
"Charafeddine",
"Mohamad",
""
],
[
"Paulraj",
"Arogyaswami",
""
]
] |
new_dataset
| 0.984951 |
0707.3959
|
Dung Dao
|
Dung Ngoc Dao, Chau Yuen, Chintha Tellambura, Yong Liang Guan and
Tjeng Thiang Tjhung
|
Four-Group Decodable Space-Time Block Codes
|
1 figure. Accepted for publication in IEEE Trans. on Signal
Processing
| null |
10.1109/TSP.2007.906729
| null |
cs.IT math.IT
| null |
Two new rate-one full-diversity space-time block codes (STBC) are proposed.
They are characterized by the \emph{lowest decoding complexity} among the known
rate-one STBC, arising due to the complete separability of the transmitted
symbols into four groups for maximum likelihood detection. The first and the
second codes are delay-optimal if the number of transmit antennas is a power of
2 and even, respectively. The exact pair-wise error probability is derived to
allow for the performance optimization of the two codes. Compared with existing
low-decoding complexity STBC, the two new codes offer several advantages such
as higher code rate, lower encoding/decoding delay and complexity, lower
peak-to-average power ratio, and better performance.
|
[
{
"version": "v1",
"created": "Thu, 26 Jul 2007 16:14:33 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Dao",
"Dung Ngoc",
""
],
[
"Yuen",
"Chau",
""
],
[
"Tellambura",
"Chintha",
""
],
[
"Guan",
"Yong Liang",
""
],
[
"Tjhung",
"Tjeng Thiang",
""
]
] |
new_dataset
| 0.995875 |
0710.1436
|
Wojciech Wislicki
|
Ryszard Gokieli, Krzysztof Nawrocki, Adam Padee, Dorota Stojda, Karol
Wawrzyniak, Wojciech Wislicki
|
Polish grid infrastructure for science and research
|
Proceeedings of IEEE Eurocon 2007, Warsaw, Poland, 9-12 Sep. 2007,
p.446
|
2007, ISBN 1-4244-0813-X
|
10.1109/EURCON.2007.4400477
| null |
cs.DC hep-ex
| null |
Structure, functionality, parameters and organization of the computing Grid
in Poland is described, mainly from the perspective of high-energy particle
physics community, currently its largest consumer and developer. It represents
distributed Tier-2 in the worldwide Grid infrastructure. It also provides
services and resources for data-intensive applications in other sciences.
|
[
{
"version": "v1",
"created": "Sun, 7 Oct 2007 17:45:59 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Gokieli",
"Ryszard",
""
],
[
"Nawrocki",
"Krzysztof",
""
],
[
"Padee",
"Adam",
""
],
[
"Stojda",
"Dorota",
""
],
[
"Wawrzyniak",
"Karol",
""
],
[
"Wislicki",
"Wojciech",
""
]
] |
new_dataset
| 0.996102 |
0710.5327
|
Paul Gardner-Stephen
|
Paul Gardner-Stephen
|
Escalating The War On SPAM Through Practical POW Exchange
|
To be presented at the IEEE Conference On Networking, Adelaide,
Australia, November 19-21, 2007
| null |
10.1109/ICON.2007.4444132
| null |
cs.NI cs.CR
| null |
Proof-of-work (POW) schemes have been proposed in the past. One prominent
system is HASHCASH (Back, 2002) which uses cryptographic puzzles . However,
work by Laurie and Clayton (2004) has shown that for a uniform proof-of-work
scheme on email to have an impact on SPAM, it would also be onerous enough to
impact on senders of "legitimate" email. I suggest that a non-uniform
proof-of-work scheme on email may be a solution to this problem, and describe a
framework that has the potential to limit SPAM, without unduly penalising
legitimate senders, and is constructed using only current SPAM filter
technology, and a small change to the SMTP (Simple Mail Transfer Protocol).
Specifically, I argue that it is possible to make sending SPAM 1,000 times more
expensive than sending "legitimate" email (so called HAM). Also, unlike the
system proposed by Debin Liu and Jean Camp (2006), it does not require the
complications of maintaining a reputation system.
|
[
{
"version": "v1",
"created": "Mon, 29 Oct 2007 02:01:09 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Gardner-Stephen",
"Paul",
""
]
] |
new_dataset
| 0.988724 |
0710.5758
|
Behrouz Khoshnevis
|
Behrouz Khoshnevis, Wei Yu, and Raviraj Adve
|
Grassmannian Beamforming for MIMO Amplify-and-Forward Relaying
|
Submitted to IEEE Journal of Selected Areas in Communications,
Special Issue on Exploiting Limited Feedback in Tomorrows Wireless
Communication Networks
| null |
10.1109/JSAC.2008.081006
| null |
cs.IT math.IT
| null |
In this paper, we derive the optimal transmitter/ receiver beamforming
vectors and relay weighting matrix for the multiple-input multiple-output
amplify-and-forward relay channel. The analysis is accomplished in two steps.
In the first step, the direct link between the transmitter (Tx) and receiver
(Rx) is ignored and we show that the transmitter and the relay should map their
signals to the strongest right singular vectors of the Tx-relay and relay-Rx
channels. Based on the distributions of these vectors for independent
identically distributed (i.i.d.) Rayleigh channels, the Grassmannian codebooks
are used for quantizing and sending back the channel information to the
transmitter and the relay. The simulation results show that even a few number
of bits can considerably increase the link reliability in terms of bit error
rate. For the second step, the direct link is considered in the problem model
and we derive the optimization problem that identifies the optimal Tx
beamforming vector. For the i.i.d Rayleigh channels, we show that the solution
to this problem is uniformly distributed on the unit sphere and we justify the
appropriateness of the Grassmannian codebook (for determining the optimal
beamforming vector), both analytically and by simulation. Finally, a modified
quantizing scheme is presented which introduces a negligible degradation in the
system performance but significantly reduces the required number of feedback
bits.
|
[
{
"version": "v1",
"created": "Tue, 30 Oct 2007 21:08:55 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Khoshnevis",
"Behrouz",
""
],
[
"Yu",
"Wei",
""
],
[
"Adve",
"Raviraj",
""
]
] |
new_dataset
| 0.974663 |
0711.3545
|
Vasanthan Raghavan
|
Che Lin, Vasanthan Raghavan, Venu Veeravalli
|
To Code or Not to Code Across Time: Space-Time Coding with Feedback
|
22 pages, 4 figures, Submitted to IEEE JSAC, Nov. 2007
| null |
10.1109/JSAC.2008.081024
| null |
cs.IT math.IT
| null |
Space-time codes leverage the availability of multiple antennas to enhance
the reliability of communication over wireless channels. While space-time codes
have initially been designed with a focus on open-loop systems, recent
technological advances have enabled the possibility of low-rate feedback from
the receiver to the transmitter. The focus of this paper is on the implications
of this feedback in a single-user multi-antenna system with a general model for
spatial correlation. We assume a limited feedback model, that is, a coherent
receiver and statistics along with B bits of quantized channel information at
the transmitter. We study space-time coding with a family of linear dispersion
(LD) codes that meet an additional orthogonality constraint so as to ensure
low-complexity decoding. Our results show that, when the number of bits of
feedback (B) is small, a space-time coding scheme that is equivalent to
beamforming and does not code across time is optimal in a weak sense in that it
maximizes the average received SNR. As B increases, this weak optimality
transitions to optimality in a strong sense which is characterized by the
maximization of the average mutual information. Thus, from a system designer's
perspective, our work suggests that beamforming may not only be attractive from
a low-complexity viewpoint, but also from an information-theoretic viewpoint.
|
[
{
"version": "v1",
"created": "Thu, 22 Nov 2007 11:10:00 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Lin",
"Che",
""
],
[
"Raghavan",
"Vasanthan",
""
],
[
"Veeravalli",
"Venu",
""
]
] |
new_dataset
| 0.983086 |
0712.2872
|
Vignesh Sethuraman
|
Vignesh Sethuraman, Ligong Wang, Bruce Hajek and Amos Lapidoth
|
Low SNR Capacity of Noncoherent Fading Channels
|
submitted to IEEE IT
| null |
10.1109/TIT.2009.2012995
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Discrete-time Rayleigh fading single-input single-output (SISO) and
multiple-input multiple-output (MIMO) channels are considered, with no channel
state information at the transmitter or the receiver. The fading is assumed to
be stationary and correlated in time, but independent from antenna to antenna.
Peak-power and average-power constraints are imposed on the transmit antennas.
For MIMO channels, these constraints are either imposed on the sum over
antennas, or on each individual antenna. For SISO channels and MIMO channels
with sum power constraints, the asymptotic capacity as the peak signal-to-noise
ratio tends to zero is identified; for MIMO channels with individual power
constraints, this asymptotic capacity is obtained for a class of channels
called transmit separable channels. The results for MIMO channels with
individual power constraints are carried over to SISO channels with delay
spread (i.e. frequency selective fading).
|
[
{
"version": "v1",
"created": "Tue, 18 Dec 2007 04:28:36 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Dec 2008 07:42:22 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Sethuraman",
"Vignesh",
""
],
[
"Wang",
"Ligong",
""
],
[
"Hajek",
"Bruce",
""
],
[
"Lapidoth",
"Amos",
""
]
] |
new_dataset
| 0.998209 |
0801.1282
|
Shashi Kiran Chilappagari
|
Shashi Kiran Chilappagari, Anantha Raman Krishnan, Bane Vasic
|
LDPC Codes Which Can Correct Three Errors Under Iterative Decoding
|
5 pages, 3 figures, submitted to IEEE Information Theory Workshop
(ITW), 2008
| null |
10.1109/ITW.2008.4578696
| null |
cs.IT math.IT
| null |
In this paper, we provide necessary and sufficient conditions for a
column-weight-three LDPC code to correct three errors when decoded using
Gallager A algorithm. We then provide a construction technique which results in
a code satisfying the above conditions. We also provide numerical assessment of
code performance via simulation results.
|
[
{
"version": "v1",
"created": "Tue, 8 Jan 2008 17:12:21 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Chilappagari",
"Shashi Kiran",
""
],
[
"Krishnan",
"Anantha Raman",
""
],
[
"Vasic",
"Bane",
""
]
] |
new_dataset
| 0.998594 |
0802.1754
|
Jay Kumar Sundararajan
|
Jay Kumar Sundararajan, Devavrat Shah and Muriel M\'edard
|
ARQ for Network Coding
|
Submitted to the 2008 IEEE International Symposium on Information
Theory (ISIT 2008)
| null |
10.1109/ISIT.2008.4595268
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new coding and queue management algorithm is proposed for communication
networks that employ linear network coding. The algorithm has the feature that
the encoding process is truly online, as opposed to a block-by-block approach.
The setup assumes a packet erasure broadcast channel with stochastic arrivals
and full feedback, but the proposed scheme is potentially applicable to more
general lossy networks with link-by-link feedback. The algorithm guarantees
that the physical queue size at the sender tracks the backlog in degrees of
freedom (also called the virtual queue size). The new notion of a node "seeing"
a packet is introduced. In terms of this idea, our algorithm may be viewed as a
natural extension of ARQ schemes to coded networks. Our approach, known as the
drop-when-seen algorithm, is compared with a baseline queuing approach called
drop-when-decoded. It is shown that the expected queue size for our approach is
$O(\frac1{1-\rho})$ as opposed to $\Omega(\frac1{(1-\rho)^2})$ for the baseline
approach, where $\rho$ is the load factor.
|
[
{
"version": "v1",
"created": "Wed, 13 Feb 2008 02:01:54 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Sundararajan",
"Jay Kumar",
""
],
[
"Shah",
"Devavrat",
""
],
[
"Médard",
"Muriel",
""
]
] |
new_dataset
| 0.997216 |
0802.4282
|
Man-On Pun
|
Dong Zheng, Man-On Pun, Weiyan Ge, Junshan Zhang and H. Vincent Poor
|
Distributed Opportunistic Scheduling For Ad-Hoc Communications Under
Noisy Channel Estimation
|
Proceedings of the 2008 IEEE International Conference on
Communications, Beijing, May 19-23, 2008
| null |
10.1109/ICC.2008.698
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed opportunistic scheduling is studied for wireless ad-hoc networks,
where many links contend for one channel using random access. In such networks,
distributed opportunistic scheduling (DOS) involves a process of joint channel
probing and distributed scheduling. It has been shown that under perfect
channel estimation, the optimal DOS for maximizing the network throughput is a
pure threshold policy. In this paper, this formalism is generalized to explore
DOS under noisy channel estimation, where the transmission rate needs to be
backed off from the estimated rate to reduce the outage. It is shown that the
optimal scheduling policy remains to be threshold-based, and that the rate
threshold turns out to be a function of the variance of the estimation error
and be a functional of the backoff rate function. Since the optimal backoff
rate is intractable, a suboptimal linear backoff scheme that backs off the
estimated signal-to-noise ratio (SNR) and hence the rate is proposed. The
corresponding optimal backoff ratio and rate threshold can be obtained via an
iterative algorithm. Finally, simulation results are provided to illustrate the
tradeoff caused by increasing training time to improve channel estimation at
the cost of probing efficiency.
|
[
{
"version": "v1",
"created": "Thu, 28 Feb 2008 20:36:43 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Zheng",
"Dong",
""
],
[
"Pun",
"Man-On",
""
],
[
"Ge",
"Weiyan",
""
],
[
"Zhang",
"Junshan",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.966784 |
0803.1144
|
Nadia Fawaz
|
Nadia Fawaz, Keyvan Zarifi, Merouane Debbah, David Gesbert
|
Asymptotic Capacity and Optimal Precoding Strategy of Multi-Level
Precode & Forward in Correlated Channels
|
5 pages, 3 figures, to be published in proceedings of IEEE
Information Theory Workshop 2008
| null |
10.1109/ITW.2008.4578651
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We analyze a multi-level MIMO relaying system where a multiple-antenna
transmitter sends data to a multipleantenna receiver through several relay
levels, also equipped with multiple antennas. Assuming correlated fading in
each hop, each relay receives a faded version of the signal transmitted by the
previous level, performs precoding on the received signal and retransmits it to
the next level. Using free probability theory and assuming that the noise power
at the relay levels - but not at the receiver - is negligible, a closed-form
expression of the end-to-end asymptotic instantaneous mutual information is
derived as the number of antennas in all levels grow large with the same rate.
This asymptotic expression is shown to be independent from the channel
realizations, to only depend on the channel statistics and to also serve as the
asymptotic value of the end-to-end average mutual information. We also provide
the optimal singular vectors of the precoding matrices that maximize the
asymptotic mutual information : the optimal transmit directions represented by
the singular vectors of the precoding matrices are aligned on the eigenvectors
of the channel correlation matrices, therefore they can be determined only
using the known statistics of the channel matrices and do not depend on a
particular channel realization.
|
[
{
"version": "v1",
"created": "Fri, 7 Mar 2008 17:56:36 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Fawaz",
"Nadia",
""
],
[
"Zarifi",
"Keyvan",
""
],
[
"Debbah",
"Merouane",
""
],
[
"Gesbert",
"David",
""
]
] |
new_dataset
| 0.998689 |
0803.4025
|
Ganesh M. Narayan
|
Ganesh M. Narayan, K. Gopinath, V. Sridhar
|
Structure and Interpretation of Computer Programs
|
9 pages, 10pt, double column, 15 figures
|
2nd IEEE International Symposium on Theoretical Aspects of
Software Engineering, 2008, Nanjing, China
|
10.1109/TASE.2008.40
| null |
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Call graphs depict the static, caller-callee relation between "functions" in
a program. With most source/target languages supporting functions as the
primitive unit of composition, call graphs naturally form the fundamental
control flow representation available to understand/develop software. They are
also the substrate on which various interprocedural analyses are performed and
are integral part of program comprehension/testing. Given their universality
and usefulness, it is imperative to ask if call graphs exhibit any intrinsic
graph theoretic features -- across versions, program domains and source
languages. This work is an attempt to answer these questions: we present and
investigate a set of meaningful graph measures that help us understand call
graphs better; we establish how these measures correlate, if any, across
different languages and program domains; we also assess the overall, language
independent software quality by suitably interpreting these measures.
|
[
{
"version": "v1",
"created": "Thu, 27 Mar 2008 22:58:43 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Narayan",
"Ganesh M.",
""
],
[
"Gopinath",
"K.",
""
],
[
"Sridhar",
"V.",
""
]
] |
new_dataset
| 0.963235 |
0805.0092
|
Oren Somekh
|
Oren Somekh, Osvaldo Simeone, H. Vincent Poor, and Shlomo Shamai
(Shitz)
|
Cellular Systems with Full-Duplex Compress-and-Forward Relaying and
Cooperative Base Stations
|
Proceedings of the 2008 IEEE International Symposium on Information
Theory, Toronto, ON, Canada, July 6 - 11, 2008
| null |
10.1109/ISIT.2008.4595357
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper the advantages provided by multicell processing of signals
transmitted by mobile terminals (MTs) which are received via dedicated relay
terminals (RTs) are studied. It is assumed that each RT is capable of
full-duplex operation and receives the transmission of adjacent relay
terminals. Focusing on intra-cell TDMA and non-fading channels, a simplified
relay-aided uplink cellular model based on a model introduced by Wyner is
considered. Assuming a nomadic application in which the RTs are oblivious to
the MTs' codebooks, a form of distributed compress-and-forward (CF) scheme with
decoder side information is employed. The per-cell sum-rate of the CF scheme is
derived and is given as a solution of a simple fixed point equation. This
achievable rate reveals that the CF scheme is able to completely eliminate the
inter-relay interference, and it approaches a ``cut-set-like'' upper bound for
strong RTs transmission power. The CF rate is also shown to surpass the rate of
an amplify-and-forward scheme via numerical calculations for a wide range of
the system parameters.
|
[
{
"version": "v1",
"created": "Thu, 1 May 2008 13:22:35 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Somekh",
"Oren",
"",
"Shitz"
],
[
"Simeone",
"Osvaldo",
"",
"Shitz"
],
[
"Poor",
"H. Vincent",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.996741 |
0805.1485
|
Oren Somekh
|
Osvaldo Simeone, Oren Somekh, H. Vincent Poor, and Shlomo Shamai
(Shitz)
|
Distributed MIMO Systems with Oblivious Antennas
|
In Proc. of the 2008 IEEE International Symposium on Information
Theory (ISIT 2008), Toronto, Ontario, Canada
| null |
10.1109/ISIT.2008.4595119
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A scenario in which a single source communicates with a single destination
via a distributed MIMO transceiver is considered. The source operates each of
the transmit antennas via finite-capacity links, and likewise the destination
is connected to the receiving antennas through capacity-constrained channels.
Targeting a nomadic communication scenario, in which the distributed MIMO
transceiver is designed to serve different standards or services, transmitters
and receivers are assumed to be oblivious to the encoding functions shared by
source and destination. Adopting a Gaussian symmetric interference network as
the channel model (as for regularly placed transmitters and receivers),
achievable rates are investigated and compared with an upper bound. It is
concluded that in certain asymptotic and non-asymptotic regimes obliviousness
of transmitters and receivers does not cause any loss of optimality.
|
[
{
"version": "v1",
"created": "Sat, 10 May 2008 16:53:54 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Simeone",
"Osvaldo",
"",
"Shitz"
],
[
"Somekh",
"Oren",
"",
"Shitz"
],
[
"Poor",
"H. Vincent",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.998589 |
0805.2996
|
Deniz Gunduz
|
Deniz Gunduz, Elza Erkip, Andrea J. Goldsmith, H. Vincent Poor
|
Lossy Source Transmission over the Relay Channel
|
Proceedings of the 2008 IEEE International Symposium on Information
Theory, Toronto, ON, Canada, July 6 - 11, 2008
| null |
10.1109/ISIT.2008.4595359
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lossy transmission over a relay channel in which the relay has access to
correlated side information is considered. First, a joint source-channel
decode-and-forward scheme is proposed for general discrete memoryless sources
and channels. Then the Gaussian relay channel where the source and the side
information are jointly Gaussian is analyzed. For this Gaussian model, several
new source-channel cooperation schemes are introduced and analyzed in terms of
the squared-error distortion at the destination. A comparison of the proposed
upper bounds with the cut-set lower bound is given, and it is seen that joint
source-channel cooperation improves the reconstruction quality significantly.
Moreover, the performance of the joint code is close to the lower bound on
distortion for a wide range of source and channel parameters.
|
[
{
"version": "v1",
"created": "Tue, 20 May 2008 02:45:47 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Gunduz",
"Deniz",
""
],
[
"Erkip",
"Elza",
""
],
[
"Goldsmith",
"Andrea J.",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.991969 |
0806.0036
|
Mahdi Ramezani
|
Ali Sanaei, Mahdi Ramezani, and Masoud Ardakani
|
On the Design of Universal LDPC Codes
|
5 pages, 2 figures, To appear in Proc. IEEE International Symposium
on Information Theory (ISIT 2008), Toronto, Canada, July 2008
| null |
10.1109/ISIT.2008.4595097
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Low-density parity-check (LDPC) coding for a multitude of equal-capacity
channels is studied. First, based on numerous observations, a conjecture is
stated that when the belief propagation decoder converges on a set of
equal-capacity channels, it would also converge on any convex combination of
those channels. Then, it is proved that when the stability condition is
satisfied for a number of channels, it is also satisfied for any channel in
their convex hull. For the purpose of code design, a method is proposed which
can decompose every symmetric channel with capacity C into a set of
identical-capacity basis channels. We expect codes that work on the basis
channels to be suitable for any channel with capacity C. Such codes are found
and in comparison with existing LDPC codes that are designed for specific
channels, our codes obtain considerable coding gains when used across a
multitude of channels.
|
[
{
"version": "v1",
"created": "Fri, 30 May 2008 22:03:00 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Sanaei",
"Ali",
""
],
[
"Ramezani",
"Mahdi",
""
],
[
"Ardakani",
"Masoud",
""
]
] |
new_dataset
| 0.996799 |
0806.1577
|
Harshan Jagadeesh
|
J. Harshan, B. Sundar Rajan
|
Co-ordinate Interleaved Distributed Space-Time Coding for
Two-Antenna-Relays Networks
|
To appear in IEEE Transactions on Wireless Communications. 09 pages,
06 figures
| null |
10.1109/TWC.2009.071303
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed space time coding for wireless relay networks when the source,
the destination and the relays have multiple antennas have been studied by Jing
and Hassibi. In this set-up, the transmit and the receive signals at different
antennas of the same relay are processed and designed independently, even
though the antennas are colocated. In this paper, a wireless relay network with
single antenna at the source and the destination and two antennas at each of
the R relays is considered. A new class of distributed space time block codes
called Co-ordinate Interleaved Distributed Space-Time Codes (CIDSTC) are
introduced where, in the first phase, the source transmits a T-length complex
vector to all the relays and in the second phase, at each relay, the in-phase
and quadrature component vectors of the received complex vectors at the two
antennas are interleaved and processed before forwarding them to the
destination. Compared to the scheme proposed by Jing-Hassibi, for $T \geq 4R$,
while providing the same asymptotic diversity order of 2R, CIDSTC scheme is
shown to provide asymptotic coding gain with the cost of negligible increase in
the processing complexity at the relays. However, for moderate and large values
of P, CIDSTC scheme is shown to provide more diversity than that of the scheme
proposed by Jing-Hassibi. CIDSTCs are shown to be fully diverse provided the
information symbols take value from an appropriate multi-dimensional signal
set.
|
[
{
"version": "v1",
"created": "Tue, 10 Jun 2008 05:45:23 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Aug 2008 11:29:09 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Harshan",
"J.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.99857 |
0808.0272
|
Ki-Moon Lee
|
Ki-Moon Lee, Hayder Radha, and Beom-Jin Kim
|
Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for
Error-Performances of LDPC and LT Codes over Binary Erasure Channels
|
A short version of this paper was presented at ISITA 2008, Auckland
NZ. The first draft was submitted to IEEE Transactions on Information Theory,
2008/06
| null |
10.1109/ISITA.2008.4895488
| null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Kovalenko's full-rank limit as a tight lower bound for decoding
error probability of LDPC codes and LT codes over BEC. From the limit, we
derive a full-rank overhead as a lower bound for stable overheads for
successful maximum-likelihood decoding of the codes.
|
[
{
"version": "v1",
"created": "Sat, 2 Aug 2008 18:03:31 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Jan 2009 08:02:00 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Lee",
"Ki-Moon",
""
],
[
"Radha",
"Hayder",
""
],
[
"Kim",
"Beom-Jin",
""
]
] |
new_dataset
| 0.995748 |
0808.0745
|
Caleb Lo
|
Caleb K. Lo, John J. Hasenbein, Sriram Vishwanath and Robert W. Heath
Jr
|
Relay-Assisted User Scheduling in Wireless Networks with Hybrid-ARQ
|
14 pages, 5 figures, submitted to the IEEE Transactions on Vehicular
Technology in October 2008, revised in March 2009 and May 2009
| null |
10.1109/TVT.2009.2027711
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the problem of relay-assisted user scheduling for downlink
wireless transmission. The base station or access point employs hybrid
automatic-repeat-request (HARQ) with the assistance of a set of fixed relays to
serve a set of mobile users. By minimizing a cost function of the queue lengths
at the base station and the number of retransmissions of the head-of-line
packet for each user, the base station can schedule an appropriate user in each
time slot and an appropriate transmitter to serve it. It is shown that a
priority-index policy is optimal for a linear cost function with packets
arriving according to a Poisson process and for an increasing convex cost
function where packets must be drained from the queues at the base station.
|
[
{
"version": "v1",
"created": "Tue, 5 Aug 2008 23:53:26 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Oct 2008 00:03:40 GMT"
},
{
"version": "v3",
"created": "Thu, 9 Oct 2008 18:07:18 GMT"
},
{
"version": "v4",
"created": "Thu, 19 Mar 2009 00:14:59 GMT"
},
{
"version": "v5",
"created": "Sat, 16 May 2009 23:30:33 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Lo",
"Caleb K.",
""
],
[
"Hasenbein",
"John J.",
""
],
[
"Vishwanath",
"Sriram",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.982235 |
0808.2591
|
Panos Papadimitratos
|
Jun Luo, Panos Papadimitratos and Jean-Pierre Hubaux
|
GossiCrypt: Wireless Sensor Network Data Confidentiality Against
Parasitic Adversaries
| null |
Proceedings of the Fifth IEEE-CS Conference on Sensor, Mesh and Ad
Hoc Communi- cations and Networks (IEEE SECON), pages 441{450, San Francisco,
CA, USA, June 2008
|
10.1109/SAHCN.2008.60
| null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Resource and cost constraints remain a challenge for wireless sensor network
security. In this paper, we propose a new approach to protect confidentiality
against a parasitic adversary, which seeks to exploit sensor networks by
obtaining measurements in an unauthorized way. Our low-complexity solution,
GossiCrypt, leverages on the large scale of sensor networks to protect
confidentiality efficiently and effectively. GossiCrypt protects data by
symmetric key encryption at their source nodes and re-encryption at a randomly
chosen subset of nodes en route to the sink. Furthermore, it employs key
refreshing to mitigate the physical compromise of cryptographic keys. We
validate GossiCrypt analytically and with simulations, showing it protects data
confidentiality with probability almost one. Moreover, compared with a system
that uses public-key data encryption, the energy consumption of GossiCrypt is
one to three orders of magnitude lower.
|
[
{
"version": "v1",
"created": "Tue, 19 Aug 2008 13:23:21 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Luo",
"Jun",
""
],
[
"Papadimitratos",
"Panos",
""
],
[
"Hubaux",
"Jean-Pierre",
""
]
] |
new_dataset
| 0.98044 |
0809.5022
|
Jay Kumar Sundararajan
|
Jay Kumar Sundararajan, Devavrat Shah, Muriel Medard, Michael
Mitzenmacher, Joao Barros
|
Network coding meets TCP
|
9 pages, 9 figures, submitted to IEEE INFOCOM 2009
| null |
10.1109/INFCOM.2009.5061931
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a mechanism that incorporates network coding into TCP with only
minor changes to the protocol stack, thereby allowing incremental deployment.
In our scheme, the source transmits random linear combinations of packets
currently in the congestion window. At the heart of our scheme is a new
interpretation of ACKs - the sink acknowledges every degree of freedom (i.e., a
linear combination that reveals one unit of new information) even if it does
not reveal an original packet immediately. Such ACKs enable a TCP-like
sliding-window approach to network coding. Our scheme has the nice property
that packet losses are essentially masked from the congestion control
algorithm. Our algorithm therefore reacts to packet drops in a smooth manner,
resulting in a novel and effective approach for congestion control over
networks involving lossy links such as wireless links. Our experiments show
that our algorithm achieves higher throughput compared to TCP in the presence
of lossy wireless links. We also establish the soundness and fairness
properties of our algorithm.
|
[
{
"version": "v1",
"created": "Mon, 29 Sep 2008 19:51:21 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Sundararajan",
"Jay Kumar",
""
],
[
"Shah",
"Devavrat",
""
],
[
"Medard",
"Muriel",
""
],
[
"Mitzenmacher",
"Michael",
""
],
[
"Barros",
"Joao",
""
]
] |
new_dataset
| 0.996729 |
0903.1388
|
Rajkumar Buyya
|
Chao Jin, Jayavardhana Gubbi, Rajkumar Buyya, and Marimuthu
Palaniswami
|
Jeeva: Enterprise Grid-enabled Web Portal for Protein Secondary
Structure Prediction
|
7 pages
|
Proceedings of the 16th International Conference on Advanced
Computing and Communication (ADCOM 2008, IEEE Press, New York, USA), Dec.
14-17, 2008, Chennai, India
|
10.1109/ADCOM.2008.4760440
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a Grid portal for protein secondary structure prediction
developed by using services of Aneka, a .NET-based enterprise Grid technology.
The portal is used by research scientists to discover new prediction structures
in a parallel manner. An SVM (Support Vector Machine)-based prediction
algorithm is used with 64 sample protein sequences as a case study to
demonstrate the potential of enterprise Grids.
|
[
{
"version": "v1",
"created": "Sun, 8 Mar 2009 04:50:53 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Jin",
"Chao",
""
],
[
"Gubbi",
"Jayavardhana",
""
],
[
"Buyya",
"Rajkumar",
""
],
[
"Palaniswami",
"Marimuthu",
""
]
] |
new_dataset
| 0.964167 |
0906.1599
|
Tobias Lutz
|
Tobias Lutz, Christoph Hausl, Ralf K\"otter
|
Bits Through Deterministic Relay Cascades with Half-Duplex Constraint
|
accepted for publication in IEEE Transactions on Information Theory
| null |
10.1109/TIT.2011.2169542
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Consider a relay cascade, i.e. a network where a source node, a sink node and
a certain number of intermediate source/relay nodes are arranged on a line and
where adjacent node pairs are connected by error-free (q+1)-ary pipes. Suppose
the source and a subset of the relays wish to communicate independent
information to the sink under the condition that each relay in the cascade is
half-duplex constrained. A coding scheme is developed which transfers
information by an information-dependent allocation of the transmission and
reception slots of the relays. The coding scheme requires synchronization on
the symbol level through a shared clock. The coding strategy achieves capacity
for a single source. Numerical values for the capacity of cascades of various
lengths are provided, and the capacities are significantly higher than the
rates which are achievable with a predetermined time-sharing approach. If the
cascade includes a source and a certain number of relays with their own
information, the strategy achieves the cut-set bound when the rates of the
relay sources fall below certain thresholds. For cascades composed of an
infinite number of half-duplex constrained relays and a single source, we
derive an explicit capacity expression. Remarkably, the capacity in bits/use
for q=1 is equal to the logarithm of the golden ratio, and the capacity for q=2
is 1 bit/use.
|
[
{
"version": "v1",
"created": "Mon, 8 Jun 2009 21:39:44 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Jul 2009 13:15:18 GMT"
},
{
"version": "v3",
"created": "Mon, 22 Aug 2011 18:39:51 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Lutz",
"Tobias",
""
],
[
"Hausl",
"Christoph",
""
],
[
"Kötter",
"Ralf",
""
]
] |
new_dataset
| 0.971326 |
0907.2252
|
Dilip Krishnaswamy
|
Dilip Krishnaswamy
|
AWiMA: An architecture for Adhoc Wireless Mobile internet Access
|
5 pages, 3 figures, submitted to IEEE Globecom 2008
| null |
10.1109/GLOCOM.2008.ECP.1083
| null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
This paper suggests a system architecture for wireless widearea- networking
access using adhoc networking between a mobile Client node without direct
connectivity to a wirelesswide- area-network and a mobile Service Provider node
with connectivity to a wireless-wide-area-network. It provides a means for
securely providing such adhoc wireless networking services using a Server for
tunneling and routing, registration and authentication. The architecture also
provides support for handoff of a Client node from one Service Provider to
another with persistence of a tunnel between the Client and the Server enabling
a soft-handoff. Different wireless protocols may be used for adhoc networking,
with filtered interconnection of authenticated Clients implemented at a Service
Provider node. The architecture is applicable across different wide-areanetwork
protocols, and provides simultaneous support for multiple wide-area-network
protocols.
|
[
{
"version": "v1",
"created": "Mon, 13 Jul 2009 20:10:29 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Krishnaswamy",
"Dilip",
""
]
] |
new_dataset
| 0.998469 |
0908.3929
|
Stephen Smith
|
Stephen L. Smith, Shaunak D. Bopardikar, and Francesco Bullo
|
A Dynamic Boundary Guarding Problem with Translating Targets
|
Extended version of paper for the joint 48th IEEE Conference on
Decision and Control and 28th Chinese Control Conference
| null |
10.1109/CDC.2009.5400538
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a problem in which a service vehicle seeks to guard a deadline
(boundary) from dynamically arriving mobile targets. The environment is a
rectangle and the deadline is one of its edges. Targets arrive continuously
over time on the edge opposite the deadline, and move towards the deadline at a
fixed speed. The goal for the vehicle is to maximize the fraction of targets
that are captured before reaching the deadline. We consider two cases; when the
service vehicle is faster than the targets, and; when the service vehicle is
slower than the targets. In the first case we develop a novel vehicle policy
based on computing longest paths in a directed acyclic graph. We give a lower
bound on the capture fraction of the policy and show that the policy is optimal
when the distance between the target arrival edge and deadline becomes very
large. We present numerical results which suggest near optimal performance away
from this limiting regime. In the second case, when the targets are slower than
the vehicle, we propose a policy based on servicing fractions of the
translational minimum Hamiltonian path. In the limit of low target speed and
high arrival rate, the capture fraction of this policy is within a small
constant factor of the optimal.
|
[
{
"version": "v1",
"created": "Thu, 27 Aug 2009 02:26:40 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Smith",
"Stephen L.",
""
],
[
"Bopardikar",
"Shaunak D.",
""
],
[
"Bullo",
"Francesco",
""
]
] |
new_dataset
| 0.999761 |
0909.1623
|
Sudarshan Shinde
|
Sudarshan Shinde
|
Two channel paraunitary filter banks based on linear canonical transform
|
10 pages, IEEE format
| null |
10.1109/TSP.2010.2089681
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper a two channel paraunitary filter bank is proposed, which is
based on linear canonical transform, instead of discrete Fourier transform.
Input-output relation for such a filter bank are derived in terms of polyphase
matrices and modulation matrices. It is shown that like conventional filter
banks, the LCT based paraunitary filter banks need only one filter to be
designed and rest of the filters can be obtained from it. It is also shown that
LCT based paraunitary filter banks can be designed by using conventional
power-symmetric filter design in Fourier domain.
|
[
{
"version": "v1",
"created": "Wed, 9 Sep 2009 06:57:41 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Shinde",
"Sudarshan",
""
]
] |
new_dataset
| 0.99166 |
0910.2486
|
Yunnan Wu
|
Yunnan Wu
|
A Construction of Systematic MDS Codes with Minimum Repair Bandwidth
|
Submitted to IEEE Transactions on Information Theory on August 14,
2009
| null |
10.1109/TIT.2011.2134170
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a distributed storage system based on erasure coding, an important problem
is the \emph{repair problem}: If a node storing a coded piece fails, in order
to maintain the same level of reliability, we need to create a new encoded
piece and store it at a new node. This paper presents a construction of
systematic $(n,k)$-MDS codes for $2k\le n$ that achieves the minimum repair
bandwidth when repairing from $k+1$ nodes.
|
[
{
"version": "v1",
"created": "Tue, 13 Oct 2009 22:22:58 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Wu",
"Yunnan",
""
]
] |
new_dataset
| 0.967681 |
0911.1426
|
Hossein Bagheri
|
Hossein Bagheri, Abolfazl S. Motahari, and Amir K. Khandani
|
On the Capacity of the Half-Duplex Diamond Channel
|
25 pages, 2 figures, submitted to IEEE Transactions on Information
Theory
| null |
10.1109/ISIT.2010.5513566
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a dual-hop communication system composed of a source S and a
destination D connected through two non-interfering half-duplex relays, R1 and
R2, is considered. In the literature of Information Theory, this configuration
is known as the diamond channel. In this setup, four transmission modes are
present, namely: 1) S transmits, and R1 and R2 listen (broadcast mode), 2) S
transmits, R1 listens, and simultaneously, R2 transmits and D listens. 3) S
transmits, R2 listens, and simultaneously, R1 transmits and D listens. 4) R1,
R2 transmit, and D listens (multiple-access mode). Assuming a constant power
constraint for all transmitters, a parameter $\Delta$ is defined, which
captures some important features of the channel. It is proven that for
$\Delta$=0 the capacity of the channel can be attained by successive relaying,
i.e, using modes 2 and 3 defined above in a successive manner. This strategy
may have an infinite gap from the capacity of the channel when $\Delta\neq$0.
To achieve rates as close as 0.71 bits to the capacity, it is shown that the
cases of $\Delta$>0 and $\Delta$<0 should be treated differently. Using new
upper bounds based on the dual problem of the linear program associated with
the cut-set bounds, it is proven that the successive relaying strategy needs to
be enhanced by an additional broadcast mode (mode 1), or multiple access mode
(mode 4), for the cases of $\Delta$<0 and $\Delta$>0, respectively.
Furthermore, it is established that under average power constraints the
aforementioned strategies achieve rates as close as 3.6 bits to the capacity of
the channel.
|
[
{
"version": "v1",
"created": "Mon, 9 Nov 2009 20:58:23 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Bagheri",
"Hossein",
""
],
[
"Motahari",
"Abolfazl S.",
""
],
[
"Khandani",
"Amir K.",
""
]
] |
new_dataset
| 0.999159 |
0911.5462
|
Mahdi S. Hosseini
|
Mahdi S. Hosseini, Babak N. Araabi, and Hamid Soltanian-Zadeh
|
Pigment Melanin: Pattern for Iris Recognition
|
To be Published on Special Issue on Biometrics, IEEE Transaction on
Instruments and Measurements, Volume 59, Issue number 4, April 2010
| null |
10.1109/TIM.2009.2037996
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recognition of iris based on Visible Light (VL) imaging is a difficult
problem because of the light reflection from the cornea. Nonetheless, pigment
melanin provides a rich feature source in VL, unavailable in Near-Infrared
(NIR) imaging. This is due to biological spectroscopy of eumelanin, a chemical
not stimulated in NIR. In this case, a plausible solution to observe such
patterns may be provided by an adaptive procedure using a variational technique
on the image histogram. To describe the patterns, a shape analysis method is
used to derive feature-code for each subject. An important question is how much
the melanin patterns, extracted from VL, are independent of iris texture in
NIR. With this question in mind, the present investigation proposes fusion of
features extracted from NIR and VL to boost the recognition performance. We
have collected our own database (UTIRIS) consisting of both NIR and VL images
of 158 eyes of 79 individuals. This investigation demonstrates that the
proposed algorithm is highly sensitive to the patterns of cromophores and
improves the iris recognition rate.
|
[
{
"version": "v1",
"created": "Sun, 29 Nov 2009 07:07:54 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Hosseini",
"Mahdi S.",
""
],
[
"Araabi",
"Babak N.",
""
],
[
"Soltanian-Zadeh",
"Hamid",
""
]
] |
new_dataset
| 0.999337 |
1001.2411
|
Uwe Aickelin
|
Julie Greensmith, Jamie Twycross, Uwe Aickelin
|
Dendritic Cells for Anomaly Detection
|
8 pages, 10 tables, 4 figures, IEEE Congress on Evolutionary
Computation (CEC2006), Vancouver, Canada
|
Proceedings of the IEEE Congress on Evolutionary Computation
(CEC2006), Vancouver, Canada
|
10.1109/CEC.2006.1688374
| null |
cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Artificial immune systems, more specifically the negative selection
algorithm, have previously been applied to intrusion detection. The aim of this
research is to develop an intrusion detection system based on a novel concept
in immunology, the Danger Theory. Dendritic Cells (DCs) are antigen presenting
cells and key to the activation of the human signals from the host tissue and
correlate these signals with proteins know as antigens. In algorithmic terms,
individual DCs perform multi-sensor data fusion based on time-windows. The
whole population of DCs asynchronously correlates the fused signals with a
secondary data stream. The behaviour of human DCs is abstracted to form the DC
Algorithm (DCA), which is implemented using an immune inspired framework,
libtissue. This system is used to detect context switching for a basic machine
learning dataset and to detect outgoing portscans in real-time. Experimental
results show a significant difference between an outgoing portscan and normal
traffic.
|
[
{
"version": "v1",
"created": "Thu, 14 Jan 2010 10:51:41 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Greensmith",
"Julie",
""
],
[
"Twycross",
"Jamie",
""
],
[
"Aickelin",
"Uwe",
""
]
] |
new_dataset
| 0.999274 |
1001.2806
|
Ruoheng Liu
|
Ruoheng Liu, Tie Liu, H. Vincent Poor, and Shlomo Shamai (Shitz)
|
MIMO Gaussian Broadcast Channels with Confidential and Common Messages
|
Submitted to 2010 IEEE International Symposium on Information Theory,
Austin, Texas
| null |
10.1109/ISIT.2010.5513775
| null |
cs.IT cs.CR math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
This paper considers the problem of secret communication over a two-receiver
multiple-input multiple-output (MIMO) Gaussian broadcast channel. The
transmitter has two independent, confidential messages and a common message.
Each of the confidential messages is intended for one of the receivers but
needs to be kept perfectly secret from the other, and the common message is
intended for both receivers. It is shown that a natural scheme that combines
secret dirty-paper coding with Gaussian superposition coding achieves the
secrecy capacity region. To prove this result, a channel-enhancement approach
and an extremal entropy inequality of Weingarten et al. are used.
|
[
{
"version": "v1",
"created": "Mon, 18 Jan 2010 05:44:14 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Liu",
"Ruoheng",
"",
"Shitz"
],
[
"Liu",
"Tie",
"",
"Shitz"
],
[
"Poor",
"H. Vincent",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.999364 |
1001.3765
|
Silvija Kokalj-Filipovic
|
Silvija Kokalj-Filipovic, Predrag Spasojevic, Emina Soljanin
|
Doped Fountain Coding for Minimum Delay Data Collection in Circular
Networks
| null |
IEEE Journal on Selected Areas in Communications (JSAC), Special
issue on Network Coding for Wireless Communication Networks, Vol. 27, Nr. 5
(2009), p. 673-684
|
10.1109/JSAC.2009.090609
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies decentralized, Fountain and network-coding based
strategies for facilitating data collection in circular wireless sensor
networks, which rely on the stochastic diversity of data storage. The goal is
to allow for a reduced delay collection by a data collector who accesses the
network at a random position and random time. Data dissemination is performed
by a set of relays which form a circular route to exchange source packets. The
storage nodes within the transmission range of the route's relays linearly
combine and store overheard relay transmissions using random decentralized
strategies. An intelligent data collector first collects a minimum set of coded
packets from a subset of storage nodes in its proximity, which might be
sufficient for recovering the original packets and, by using a message-passing
decoder, attempts recovering all original source packets from this set.
Whenever the decoder stalls, the source packet which restarts decoding is
polled/doped from its original source node. The random-walk-based analysis of
the decoding/doping process furnishes the collection delay analysis with a
prediction on the number of required doped packets. The number of doped packets
can be surprisingly small when employed with an Ideal Soliton code degree
distribution and, hence, the doping strategy may have the least collection
delay when the density of source nodes is sufficiently large. Furthermore, we
demonstrate that network coding makes dissemination more efficient at the
expense of a larger collection delay. Not surprisingly, a circular network
allows for a significantly more (analytically and otherwise) tractable
strategies relative to a network whose model is a random geometric graph.
|
[
{
"version": "v1",
"created": "Thu, 21 Jan 2010 10:40:33 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Kokalj-Filipovic",
"Silvija",
""
],
[
"Spasojevic",
"Predrag",
""
],
[
"Soljanin",
"Emina",
""
]
] |
new_dataset
| 0.998265 |
1001.5336
|
Chuan Huang
|
Chuan Huang, Jinhua Jiang, Shuguang Cui
|
Asymptotic Capacity of Large Fading Relay Networks with Random Node
Failures
|
24 pages, 5 figures, submitted to IEEE Transactions on Communications
| null |
10.1109/TCOMM.2011.060911.100064
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To understand the network response to large-scale physical attacks, we
investigate the asymptotic capacity of a half-duplex fading relay network with
random node failures when the number of relays $N$ is infinitely large. In this
paper, a simplified independent attack model is assumed where each relay node
fails with a certain probability. The noncoherent relaying scheme is
considered, which corresponds to the case of zero forward-link channel state
information (CSI) at the relays. Accordingly, the whole relay network can be
shown equivalent to a Rayleigh fading channel, where we derive the
$\epsilon$-outage capacity upper bound according to the multiple access (MAC)
cut-set, and the $\epsilon$-outage achievable rates for both the
amplify-and-forward (AF) and decode-and-forward (DF) strategies. Furthermore,
we show that the DF strategy is asymptotically optimal as the outage
probability $\epsilon$ goes to zero, with the AF strategy strictly suboptimal
over all signal to noise ratio (SNR) regimes. Regarding the rate loss due to
random attacks, the AF strategy suffers a less portion of rate loss than the DF
strategy in the high SNR regime, while the DF strategy demonstrates more robust
performance in the low SNR regime.
|
[
{
"version": "v1",
"created": "Fri, 29 Jan 2010 17:28:40 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Huang",
"Chuan",
""
],
[
"Jiang",
"Jinhua",
""
],
[
"Cui",
"Shuguang",
""
]
] |
new_dataset
| 0.998664 |
1002.3047
|
Nadia Fawaz
|
Nadia Fawaz, Muriel Medard
|
On the Non-Coherent Wideband Multipath Fading Relay Channel
|
8 pages, 4 figures, longer version (including proof) of the paper in
Proc. of IEEE ISIT 2010
| null |
10.1109/ISIT.2010.5513582
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the multipath fading relay channel in the limit of a large
bandwidth, and in the non-coherent setting, where the channel state is unknown
to all terminals, including the relay and the destination. We propose a
hypergraph model of the wideband multipath fading relay channel, and show that
its min-cut is achieved by a non-coherent peaky frequency binning scheme. The
so-obtained lower bound on the capacity of the wideband multipath fading relay
channel turns out to coincide with the block-Markov lower bound on the capacity
of the wideband frequency-division Gaussian (FD-AWGN) relay channel. In certain
cases, this achievable rate also meets the cut-set upper-bound, and thus
reaches the capacity of the non-coherent wideband multipath fading relay
channel.
|
[
{
"version": "v1",
"created": "Tue, 16 Feb 2010 20:10:25 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Apr 2010 00:04:39 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Fawaz",
"Nadia",
""
],
[
"Medard",
"Muriel",
""
]
] |
new_dataset
| 0.999683 |
1004.0152
|
Joseph Blomer
|
Joseph Blomer, Nihar Jindal
|
Opportunistic Routing in Ad Hoc Networks: How many relays should there
be? What rate should nodes use?
|
5 pages, 8 figures, Submitted to IEEE GLOBECOM 2010
| null |
10.1109/GLOCOM.2010.5684338
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Opportunistic routing is a multi-hop routing scheme which allows for
selection of the best immediately available relay. In blind opportunistic
routing protocols, where transmitters blindly broadcast without knowledge of
the surrounding nodes, two fundamental design parameters are the node
transmission probability and the transmission spectral efficiency. In this
paper these parameters are selected to maximize end-to-end performance,
characterized by the product of transmitter density, hop distance and rate. Due
to the intractability of the problem as stated, an approximation function is
examined which proves reasonably accurate. Our results show how the above
design parameters should be selected based on inherent system parameters such
as the path loss exponent and the noise level.
|
[
{
"version": "v1",
"created": "Thu, 1 Apr 2010 15:15:09 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Blomer",
"Joseph",
""
],
[
"Jindal",
"Nihar",
""
]
] |
new_dataset
| 0.956217 |
1005.1065
|
David G. M. Mitchell
|
David G. M. Mitchell, Michael Lentmaier, and Daniel J. Costello Jr.
|
New Families of LDPC Block Codes Formed by Terminating Irregular
Protograph-Based LDPC Convolutional Codes
|
To be presented at the 2010 IEEE International Symposium on
Information Theory
| null |
10.1109/ISIT.2010.5513633
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a method of constructing new families of LDPC block
code ensembles formed by terminating irregular protograph-based LDPC
convolutional codes. Using the accumulate-repeat-by-4-jagged-accumulate (AR4JA)
protograph as an example, a density evolution analysis for the binary erasure
channel shows that this flexible design technique gives rise to a large
selection of LDPC block code ensembles with varying code rates and thresholds
close to capacity. Further, by means of an asymptotic weight enumerator
analysis, we show that all the ensembles in this family also have minimum
distance that grows linearly with block length, i.e., they are asymptotically
good.
|
[
{
"version": "v1",
"created": "Thu, 6 May 2010 19:56:11 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Mitchell",
"David G. M.",
""
],
[
"Lentmaier",
"Michael",
""
],
[
"Costello",
"Daniel J.",
"Jr."
]
] |
new_dataset
| 0.995807 |
1005.1871
|
Fernando Hernando
|
Fernando Hernando, Michael E. O'Sullivan, Emanuel Popovici and
Shraddha Srivastava
|
Subfield-Subcodes of Generalized Toric codes
|
Submitted to 2010 IEEE International Symposium on Information Theory
(ISIT 2010)
| null |
10.1109/ISIT.2010.5513688
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study subfield-subcodes of Generalized Toric (GT) codes over
$\mathbb{F}_{p^s}$. These are the multidimensional analogues of BCH codes,
which may be seen as subfield-subcodes of generalized Reed-Solomon codes. We
identify polynomial generators for subfield-subcodes of GT codes which allows
us to determine the dimensions and obtain bounds for the minimum distance. We
give several examples of binary and ternary subfield-subcodes of GT codes that
are the best known codes of a given dimension and length.
|
[
{
"version": "v1",
"created": "Tue, 11 May 2010 15:56:31 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Hernando",
"Fernando",
""
],
[
"O'Sullivan",
"Michael E.",
""
],
[
"Popovici",
"Emanuel",
""
],
[
"Srivastava",
"Shraddha",
""
]
] |
new_dataset
| 0.999505 |
1005.2251
|
Onur Sahin
|
Onur Sahin, Osvaldo Simeone, and Elza Erkip
|
Interference Channel with a Half-Duplex Out-of-Band Relay
|
5 pages, 5 figures, to appear in Proceedings of IEEE ISIT 2010
| null |
10.1109/ISIT.2010.5513378
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Gaussian interference channel (IC) aided by a half-duplex relay is
considered, in which the relay receives and transmits in an orthogonal band
with respect to the IC. The system thus consists of two parallel channels, the
IC and the channel over which the relay is active, which is referred to as
Out-of-Band Relay Channel (OBRC). The OBRC is operated by separating a multiple
access phase from the sources to the relay and a broadcast phase from the relay
to the destinations. Conditions under which the optimal operation, in terms of
the sum-capacity, entails either signal relaying and/or interference forwarding
by the relay are identified. These conditions also assess the optimality of
either separable or non-separable transmission over the IC and OBRC.
Specifically, the optimality of signal relaying and separable coding is
established for scenarios where the relay-to-destination channels set the
performance bottleneck with respect to the source-to-relay channels on the
OBRC. Optimality of interference forwarding and non-separable operation is also
established in special cases.
|
[
{
"version": "v1",
"created": "Thu, 13 May 2010 02:54:49 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Sahin",
"Onur",
""
],
[
"Simeone",
"Osvaldo",
""
],
[
"Erkip",
"Elza",
""
]
] |
new_dataset
| 0.999766 |
1006.0646
|
Ghassan Kraidy M.
|
Ghassan M. Kraidy, Joseph J. Boutros, Albert Guill\'en i F\`abregas
|
Irregular Turbo Codes in Block-Fading Channels
|
to be presented at the IEEE International Symposium on Information
Theory, 2010
| null |
10.1109/ISIT.2010.5513370
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study irregular binary turbo codes over non-ergodic block-fading channels.
We first propose an extension of channel multiplexers initially designed for
regular turbo codes. We then show that, using these multiplexers, irregular
turbo codes that exhibit a small decoding threshold over the ergodic
Gaussian-noise channel perform very close to the outage probability on
block-fading channels, from both density evolution and finite-length
perspectives.
|
[
{
"version": "v1",
"created": "Thu, 3 Jun 2010 13:39:37 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Kraidy",
"Ghassan M.",
""
],
[
"Boutros",
"Joseph J.",
""
],
[
"Fàbregas",
"Albert Guillén i",
""
]
] |
new_dataset
| 0.998419 |
1006.2565
|
Bahareh Akhbari
|
Bahareh Akhbari, Mahtab Mirmohseni, Mohammad Reza Aref
|
State-Dependent Relay Channel with Private Messages with Partial Causal
and Non-Causal Channel State Information
|
5 pages, 2 figures, to be presented at the IEEE International
Symposium on Information Theory (ISIT 2010), Austin, Texas, June 2010
| null |
10.1109/ISIT.2010.5513560
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a discrete memoryless State-Dependent Relay
Channel with Private Messages (SD-RCPM) as a generalization of the
state-dependent relay channel. We investigate two main cases: SD-RCPM with
non-causal Channel State Information (CSI), and SD-RCPM with causal CSI. In
each case, it is assumed that partial CSI is available at the source and relay.
For non-causal case, we establish an achievable rate region using
Gel'fand-Pinsker type coding scheme at the nodes informed of CSI, and
Compress-and-Forward (CF) scheme at the relay. Using Shannon's strategy and CF
scheme, an achievable rate region for causal case is obtained. As an example,
the Gaussian version of SD-RCPM is considered, and an achievable rate region
for Gaussian SD-RCPM with non-causal perfect CSI only at the source, is
derived. Providing numerical examples, we illustrate the comparison between
achievable rate regions derived using CF and Decode-and-Forward (DF) schemes.
|
[
{
"version": "v1",
"created": "Sun, 13 Jun 2010 21:12:37 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Akhbari",
"Bahareh",
""
],
[
"Mirmohseni",
"Mahtab",
""
],
[
"Aref",
"Mohammad Reza",
""
]
] |
new_dataset
| 0.996928 |
1009.2574
|
Ashish Shukla
|
Ashish Shukla, Neeraj Tyagi
|
A New Route Maintenance in Dynamic Source Routing Protocol
|
This paper has been withdrawn as it's available as part of IEEE ISWPC
2006 proceedings from IEEExplore
| null |
10.1109/ISWPC.2006.1613654
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile ad-hoc network (MANET) is infrastructureless, self-organizable, multi
hop packet switched network. A number of routing protocols for MANETs have been
proposed in recent years. Dynamic Source Routing (DSR) protocol is one of the
most popular routing protocol for ad hoc networks. This paper presents a novel
method to enhance route maintenance part of DSR protocol. Our proposed route
maintenance significantly increases the efficiency of the protocol at the time
of route failures.
|
[
{
"version": "v1",
"created": "Tue, 14 Sep 2010 06:56:29 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Apr 2011 21:18:07 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Shukla",
"Ashish",
""
],
[
"Tyagi",
"Neeraj",
""
]
] |
new_dataset
| 0.952606 |
1009.3522
|
Han-Shin Jo
|
Han-Shin Jo, Ping Xia, and Jeffrey G. Andrews
|
Open, Closed, and Shared Access Femtocells in the Downlink
|
26 pages, 8 figures, Submitted to IEEE Transactions on Wireless
Communications
| null |
10.1186/1687-1499-2012-363
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A fundamental choice in femtocell deployments is the set of users which are
allowed to access each femtocell. Closed access restricts the set to
specifically registered users, while open access allows any mobile subscriber
to use any femtocell. Which one is preferable depends strongly on the distance
between the macrocell base station (MBS) and femtocell. The main results of the
paper are lemmas which provide expressions for the SINR distribution for
various zones within a cell as a function of this MBS-femto distance. The
average sum throughput (or any other SINR-based metric) of home users and
cellular users under open and closed access can be readily determined from
these expressions. We show that unlike in the uplink, the interests of home and
cellular users are in conflict, with home users preferring closed access and
cellular users preferring open access. The conflict is most pronounced for
femtocells near the cell edge, when there are many cellular users and fewer
femtocells. To mitigate this conflict, we propose a middle way which we term
shared access in which femtocells allocate an adjustable number of time-slots
between home and cellular users such that a specified minimum rate for each can
be achieved. The optimal such sharing fraction is derived. Analysis shows that
shared access achieves at least the overall throughput of open access while
also satisfying rate requirements, while closed access fails for cellular users
and open access fails for the home user.
|
[
{
"version": "v1",
"created": "Fri, 17 Sep 2010 23:19:29 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Jo",
"Han-Shin",
""
],
[
"Xia",
"Ping",
""
],
[
"Andrews",
"Jeffrey G.",
""
]
] |
new_dataset
| 0.98337 |
1010.4499
|
Walid Saad
|
Walid Saad, Zhu Han, Tamer Basar, Merouane Debbah, Are Hj{\o}rungnes
|
Hedonic Coalition Formation for Distributed Task Allocation among
Wireless Agents
|
to appear, IEEE Transactions on Mobile Computing
|
IEEE Transactions on Mobile Computing, 2011
|
10.1109/TMC.2010.242
| null |
cs.IT cs.GT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Autonomous wireless agents such as unmanned aerial vehicles or mobile base
stations present a great potential for deployment in next-generation wireless
networks. While current literature has been mainly focused on the use of agents
within robotics or software applications, we propose a novel usage model for
self-organizing agents suited to wireless networks. In the proposed model, a
number of agents are required to collect data from several arbitrarily located
tasks. Each task represents a queue of packets that require collection and
subsequent wireless transmission by the agents to a central receiver. The
problem is modeled as a hedonic coalition formation game between the agents and
the tasks that interact in order to form disjoint coalitions. Each formed
coalition is modeled as a polling system consisting of a number of agents which
move between the different tasks present in the coalition, collect and transmit
the packets. Within each coalition, some agents can also take the role of a
relay for improving the packet success rate of the transmission. The proposed
algorithm allows the tasks and the agents to take distributed decisions to join
or leave a coalition, based on the achieved benefit in terms of effective
throughput, and the cost in terms of delay. As a result of these decisions, the
agents and tasks structure themselves into independent disjoint coalitions
which constitute a Nash-stable network partition. Moreover, the proposed
algorithm allows the agents and tasks to adapt the topology to environmental
changes such as the arrival/removal of tasks or the mobility of the tasks.
Simulation results show how the proposed algorithm improves the performance, in
terms of average player (agent or task) payoff, of at least 30.26% (for a
network of 5 agents with up to 25 tasks) relatively to a scheme that allocates
nearby tasks equally among agents.
|
[
{
"version": "v1",
"created": "Thu, 21 Oct 2010 15:32:03 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Saad",
"Walid",
""
],
[
"Han",
"Zhu",
""
],
[
"Basar",
"Tamer",
""
],
[
"Debbah",
"Merouane",
""
],
[
"Hjørungnes",
"Are",
""
]
] |
new_dataset
| 0.98008 |
1011.3091
|
Feng Xia
|
Weifeng Sun, Rong Cong, Feng Xia, Xiao Chen, Zhenquan Qin
|
R-CA: A Routing-based Dynamic Channel Assignment Algorithm for Wireless
Mesh Networks
|
International Workshop on Mobile Cyber-Physical Systems (MobiCPS
2010), in conjunction with UIC2010, IEEE, Xi'an, China, 26 - 29 October, 2010
| null |
10.1109/UIC-ATC.2010.5
| null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Even though channel assignment has been studied for years, the performance of
most IEEE 802.11-based multi-hop wireless networks such as wireless sensor
network (WSN), wireless mesh network (WMN), mobile ad hoc network (MANET) is
limited by channel interference. Properly assigning orthogonal channels to
wireless links can improve the throughput of multi-hop networks. To solve the
dynamic channel assignment problem, a routing-based channel assignment
algorithm called R-CA is proposed. R-CA can allocate channels for wireless
nodes when needed and free channels after data transmission. Thus more channel
resource can be explored by wireless nodes. Simulation results show that R-CA
can effectively enhance the network throughput and packet delivery rate.
|
[
{
"version": "v1",
"created": "Sat, 13 Nov 2010 02:40:25 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Sun",
"Weifeng",
""
],
[
"Cong",
"Rong",
""
],
[
"Xia",
"Feng",
""
],
[
"Chen",
"Xiao",
""
],
[
"Qin",
"Zhenquan",
""
]
] |
new_dataset
| 0.999702 |
1011.3094
|
Feng Xia
|
Longhua Ma, Tengkai Yuan, Feng Xia, Ming Xu, Jun Yao, Meng Shao
|
A High-confidence Cyber-Physical Alarm System: Design and Implementation
|
IEEE/ACM Internet of Things Symposium (IOTS), in conjunction with
GreenCom 2010, IEEE, Hangzhou, China, December 18-20, 2010
| null |
10.1109/GreenCom-CPSCom.2010.75
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most traditional alarm systems cannot address security threats in a
satisfactory manner. To alleviate this problem, we developed a high-confidence
cyber-physical alarm system (CPAS), a new kind of alarm systems. This system
establishes the connection of the Internet (i.e. TCP/IP) through GPRS/CDMA/3G.
It achieves mutual communication control among terminal equipments, human
machine interfaces and users by using the existing mobile communication
network. The CPAS will enable the transformation in alarm mode from traditional
one-way alarm to two-way alarm. The system has been successfully applied in
practice. The results show that the CPAS could avoid false alarms and satisfy
residents' security needs.
|
[
{
"version": "v1",
"created": "Sat, 13 Nov 2010 03:23:15 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Ma",
"Longhua",
""
],
[
"Yuan",
"Tengkai",
""
],
[
"Xia",
"Feng",
""
],
[
"Xu",
"Ming",
""
],
[
"Yao",
"Jun",
""
],
[
"Shao",
"Meng",
""
]
] |
new_dataset
| 0.998756 |
1011.3099
|
Feng Xia
|
Rui Cheng, Zhuo Yang, Feng Xia
|
iZone: A Location-Based Mobile Social Networking System
|
Third International Symposium on Parallel Architectures, Algorithms
and Programming (PAAP), IEEE, December 18-20, 2010, Dalian, China
| null |
10.1109/PAAP.2010.67
| null |
cs.HC cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The rapid development of wireless technology, the extensive use of mobile
phones and the availability of location information are facilitating
personalized location-based applications. Easy to carry, easy to use and easy
to buy, smart phones with certain software are of great advantage.
Consequently, mobile social networking (MSN) systems have emerged rapidly,
being a revolution for our everyday life. Based on the analysis of general
requirements of MSN and location-based services (LBS), this paper presents the
design of iZone, a mobile social networking system, as well as a prototype
implementation. This platform exploits mobile GIS (Geographic Information
Systems), LBS and J2ME technologies, combining geographical data to display map
on mobile phones. It can provide a number of social networking services via
smartphones.
|
[
{
"version": "v1",
"created": "Sat, 13 Nov 2010 04:20:11 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Cheng",
"Rui",
""
],
[
"Yang",
"Zhuo",
""
],
[
"Xia",
"Feng",
""
]
] |
new_dataset
| 0.999666 |
1011.3852
|
Feng Xia
|
Ziyu Lv, Feng Xia, Guowei Wu, Lin Yao, Zhikui Chen
|
iCare: A Mobile Health Monitoring System for the Elderly
|
The 3rd IEEE/ACM Int Conf on Cyber, Physical and Social Computing
(CPSCom), IEEE, Hangzhou, China, December 18-20, 2010
| null |
10.1109/GreenCom-CPSCom.2010.84
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a mobile health monitoring system called iCare for the
elderly. We use wireless body sensors and smart phones to monitor the wellbeing
of the elderly. It can offer remote monitoring for the elderly anytime anywhere
and provide tailored services for each person based on their personal health
condition. When detecting an emergency, the smart phone will automatically
alert pre-assigned people who could be the old people's family and friends, and
call the ambulance of the emergency centre. It also acts as the personal health
information system and the medical guidance which offers one communication
platform and the medical knowledge database so that the family and friends of
the served people can cooperate with doctors to take care of him/her. The
system also features some unique functions that cater to the living demands of
the elderly, including regular reminder, quick alarm, medical guidance, etc.
iCare is not only a real-time health monitoring system for the elderly, but
also a living assistant which can make their lives more convenient and
comfortable.
|
[
{
"version": "v1",
"created": "Sat, 13 Nov 2010 04:26:44 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Lv",
"Ziyu",
""
],
[
"Xia",
"Feng",
""
],
[
"Wu",
"Guowei",
""
],
[
"Yao",
"Lin",
""
],
[
"Chen",
"Zhikui",
""
]
] |
new_dataset
| 0.99955 |
1012.0602
|
Pascal Vontobel
|
Alexandros G. Dimakis, Roxana Smarandache, and Pascal O. Vontobel
|
LDPC Codes for Compressed Sensing
|
To appear, IEEE Transactions on Information Theory, 2012
| null |
10.1109/TIT.2011.2181819
| null |
cs.IT math.IT math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a mathematical connection between channel coding and compressed
sensing. In particular, we link, on the one hand, \emph{channel coding linear
programming decoding (CC-LPD)}, which is a well-known relaxation o
maximum-likelihood channel decoding for binary linear codes, and, on the other
hand, \emph{compressed sensing linear programming decoding (CS-LPD)}, also
known as basis pursuit, which is a widely used linear programming relaxation
for the problem of finding the sparsest solution of an under-determined system
of linear equations. More specifically, we establis a tight connection between
CS-LPD based on a zero-one measurement matrix over the reals and CC-LPD of the
binary linear channel code that is obtained by viewing this measurement matrix
as a binary parity-check matrix. This connection allows the translation of
performance guarantees from one setup to the other. The main message of this
paper is that parity-check matrices of "good" channel codes can be used as
provably "good" measurement matrices under basis pursuit. In particular, we
provide the first deterministic construction of compressed sensing measurement
matrices with an order-optimal number of rows using high-girth low-density
parity-check (LDPC) codes constructed by Gallager.
|
[
{
"version": "v1",
"created": "Thu, 2 Dec 2010 22:56:59 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Dec 2011 03:47:49 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Dimakis",
"Alexandros G.",
""
],
[
"Smarandache",
"Roxana",
""
],
[
"Vontobel",
"Pascal O.",
""
]
] |
new_dataset
| 0.9991 |
1101.0133
|
Nihar Shah
|
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar
|
Enabling Node Repair in Any Erasure Code for Distributed Storage
|
IEEE International Symposium on Information Theory (ISIT) 2011 (to be
presented)
| null |
10.1109/ISIT.2011.6033732
| null |
cs.IT cs.DC cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Erasure codes are an efficient means of storing data across a network in
comparison to data replication, as they tend to reduce the amount of data
stored in the network and offer increased resilience in the presence of node
failures. The codes perform poorly though, when repair of a failed node is
called for, as they typically require the entire file to be downloaded to
repair a failed node. A new class of erasure codes, termed as regenerating
codes were recently introduced, that do much better in this respect. However,
given the variety of efficient erasure codes available in the literature, there
is considerable interest in the construction of coding schemes that would
enable traditional erasure codes to be used, while retaining the feature that
only a fraction of the data need be downloaded for node repair. In this paper,
we present a simple, yet powerful, framework that does precisely this. Under
this framework, the nodes are partitioned into two 'types' and encoded using
two codes in a manner that reduces the problem of node-repair to that of
erasure-decoding of the constituent codes. Depending upon the choice of the two
codes, the framework can be used to avail one or more of the following
advantages: simultaneous minimization of storage space and repair-bandwidth,
low complexity of operation, fewer disk reads at helper nodes during repair,
and error detection and correction.
|
[
{
"version": "v1",
"created": "Thu, 30 Dec 2010 19:00:00 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Jun 2011 10:10:00 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Rashmi",
"K. V.",
""
],
[
"Shah",
"Nihar B.",
""
],
[
"Kumar",
"P. Vijay",
""
]
] |
new_dataset
| 0.996505 |
1102.0424
|
Reza Asvadi
|
Reza Asvadi, Amir H. Banihashemi, and Mahmoud Ahmadian-Attari
|
Design of Finite-Length Irregular Protograph Codes with Low Error Floors
over the Binary-Input AWGN Channel Using Cyclic Liftings
|
Submitted to IEEE Trans. Communications
| null |
10.1109/TCOMM.2012.030712.110086
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a technique to design finite-length irregular low-density
parity-check (LDPC) codes over the binary-input additive white Gaussian noise
(AWGN) channel with good performance in both the waterfall and the error floor
region. The design process starts from a protograph which embodies a desirable
degree distribution. This protograph is then lifted cyclically to a certain
block length of interest. The lift is designed carefully to satisfy a certain
approximate cycle extrinsic message degree (ACE) spectrum. The target ACE
spectrum is one with extremal properties, implying a good error floor
performance for the designed code. The proposed construction results in
quasi-cyclic codes which are attractive in practice due to simple encoder and
decoder implementation. Simulation results are provided to demonstrate the
effectiveness of the proposed construction in comparison with similar existing
constructions.
|
[
{
"version": "v1",
"created": "Wed, 2 Feb 2011 13:27:30 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Asvadi",
"Reza",
""
],
[
"Banihashemi",
"Amir H.",
""
],
[
"Ahmadian-Attari",
"Mahmoud",
""
]
] |
new_dataset
| 0.997429 |
1102.2593
|
Natalia Silberstein
|
Tuvi Etzion and Natalia Silberstein
|
Codes and Designs Related to Lifted MRD Codes
|
Submitted to IEEE Transactions on Information Theory. The material in
this paper was presented in part in the 2011 IEEE International Symposium on
Information Theory, Saint Petersburg, Russia, August 2011
| null |
10.1109/ISIT.2011.6033969
| null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lifted maximum rank distance (MRD) codes, which are constant dimension codes,
are considered. It is shown that a lifted MRD code can be represented in such a
way that it forms a block design known as a transversal design. A slightly
different representation of this design makes it similar to a $q-$analog of a
transversal design. The structure of these designs is used to obtain upper
bounds on the sizes of constant dimension codes which contain a lifted MRD
code. Codes which attain these bounds are constructed. These codes are the
largest known codes for the given parameters. These transversal designs can be
also used to derive a new family of linear codes in the Hamming space. Bounds
on the minimum distance and the dimension of such codes are given.
|
[
{
"version": "v1",
"created": "Sun, 13 Feb 2011 14:03:25 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Jun 2011 06:33:12 GMT"
},
{
"version": "v3",
"created": "Mon, 5 Sep 2011 06:25:42 GMT"
},
{
"version": "v4",
"created": "Sun, 9 Oct 2011 11:09:19 GMT"
},
{
"version": "v5",
"created": "Fri, 17 Aug 2012 02:58:46 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Etzion",
"Tuvi",
""
],
[
"Silberstein",
"Natalia",
""
]
] |
new_dataset
| 0.99953 |
1102.4176
|
Lingjie Duan
|
Lingjie Duan, Lin Gao, Jianwei Huang
|
Contract-Based Cooperative Spectrum Sharing
|
Part of this paper has appeared in IEEE DySPAN 2011, and this version
has been submitted to IEEE J-SAC
| null |
10.1109/DYSPAN.2011.5936229
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Providing proper economic incentives is essential for the success of dynamic
spectrum sharing. Cooperative spectrum sharing is one effective way to achieve
this goal. In cooperative spectrum sharing, secondary users (SUs) relay
traffics for primary users (PUs), in exchange for dedicated transmission time
for the SUs' own communication needs. In this paper, we study the cooperative
spectrum sharing under incomplete information, where SUs' types (capturing
their heterogeneity in relay channel gains and evaluations of power
consumptions) are private information and not known by PUs. Inspired by the
contract theory, we model the network as a labor market. The single PU is the
employer who offers a contract to the SUs. The contract consists of a set of
contract items representing combinations of spectrum accessing time (i.e.,
reward) and relaying power (i.e., contribution). The SUs are employees, and
each of them selects the best contract item to maximize his payoff. We study
the optimal contract design for both weak and strong incomplete information
scenarios. First, we provide necessary and sufficient conditions for feasible
contracts in both scenarios. In the weak incomplete information scenario, we
further derive the optimal contract that achieves the same maximum PU's utility
as in the complete information benchmark. In the strong incomplete information
scenario, we propose a Decompose-and-Compare algorithm that achieves a
close-to-optimal contract. We future show that the PU's average utility loss
due to the suboptimal algorithm and the strong incomplete information are both
relatively small (less than 2% and 1:3%, respectively, in our numerical results
with two SU types).
|
[
{
"version": "v1",
"created": "Mon, 21 Feb 2011 10:10:00 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Duan",
"Lingjie",
""
],
[
"Gao",
"Lin",
""
],
[
"Huang",
"Jianwei",
""
]
] |
new_dataset
| 0.979024 |
1102.4711
|
Gianluigi Liva
|
Gianluigi Liva, Enrico Paolini, Sandro Scalise, Marco Chiani
|
Turbo Codes Based on Time-Variant Memory-1 Convolutional Codes over Fq
|
This paper has been withdrawn by the authors. To be presented at IEEE
ICC 2011, Kyoto, Japan. June 2011
| null |
10.1109/icc.2011.5962474
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two classes of turbo codes over high-order finite fields are introduced. The
codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3)
low-density parity-check code ensemble. A first construction is derived as a
parallel concatenation of two non-binary, time-variant accumulators. The second
construction is based on the serial concatenation of a non-binary, time-variant
differentiator and of a non-binary, time-variant accumulator, and provides a
highly-structured flexible encoding scheme for (dv=2,dc=4) ensemble codes. A
cycle graph representation is provided. The proposed codes can be decoded
efficiently either as low-density parity-check codes (via belief propagation
decoding over the codes bipartite graph) or as turbo codes (via the
forward-backward algorithm applied to the component codes trellis). The
forward-backward algorithm for symbol maximum a posteriori decoding of the
component codes is illustrated and simplified by means of the fast Fourier
transform. The proposed codes provide remarkable gains (~ 1 dB) over binary
low-density parity-check and turbo codes in the moderate-short block regimes.
|
[
{
"version": "v1",
"created": "Wed, 23 Feb 2011 10:52:48 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Mar 2011 09:50:18 GMT"
},
{
"version": "v3",
"created": "Wed, 13 Apr 2011 10:38:26 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Liva",
"Gianluigi",
""
],
[
"Paolini",
"Enrico",
""
],
[
"Scalise",
"Sandro",
""
],
[
"Chiani",
"Marco",
""
]
] |
new_dataset
| 0.996979 |
1102.4810
|
Mahesh Banavar
|
Mahesh K. Banavar, Cihan Tepedelenlioglu and Andreas Spanias
|
Distributed SNR Estimation using Constant Modulus Signaling over
Gaussian Multiple-Access Channels
|
Submitted to the IEEE Transactions on Signal Processing. 18 pages, 8
figures
| null |
10.1109/DSP-SPE.2011.5739181
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A sensor network is used for distributed joint mean and variance estimation,
in a single time snapshot. Sensors observe a signal embedded in noise, which
are phase modulated using a constant-modulus scheme and transmitted over a
Gaussian multiple-access channel to a fusion center, where the mean and
variance are estimated jointly, using an asymptotically minimum-variance
estimator, which is shown to decouple into simple individual estimators of the
mean and the variance. The constant-modulus phase modulation scheme ensures a
fixed transmit power, robust estimation across several sensing noise
distributions, as well as an SNR estimate that requires a single set of
transmissions from the sensors to the fusion center, unlike the
amplify-and-forward approach. The performance of the estimators of the mean and
variance are evaluated in terms of asymptotic variance, which is used to
evaluate the performance of the SNR estimator in the case of Gaussian, Laplace
and Cauchy sensing noise distributions. For each sensing noise distribution,
the optimal phase transmission parameters are also determined. The asymptotic
relative efficiency of the mean and variance estimators is evaluated. It is
shown that among the noise distributions considered, the estimators are
asymptotically efficient only when the noise distribution is Gaussian.
Simulation results corroborate analytical results.
|
[
{
"version": "v1",
"created": "Wed, 23 Feb 2011 18:12:27 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Banavar",
"Mahesh K.",
""
],
[
"Tepedelenlioglu",
"Cihan",
""
],
[
"Spanias",
"Andreas",
""
]
] |
new_dataset
| 0.972776 |
1103.1559
|
Eirik Rosnes
|
Eirik Rosnes, Michael Helmling, and Alexandre Graell i Amat
|
Minimum Pseudoweight Analysis of 3-Dimensional Turbo Codes
|
To appear in IEEE Transactions on Communications
| null |
10.1109/TCOMM.2014.2329690
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we consider pseudocodewords of (relaxed) linear programming
(LP) decoding of 3-dimensional turbo codes (3D-TCs). We present a relaxed LP
decoder for 3D-TCs, adapting the relaxed LP decoder for conventional turbo
codes proposed by Feldman in his thesis. We show that the 3D-TC polytope is
proper and $C$-symmetric, and make a connection to finite graph covers of the
3D-TC factor graph. This connection is used to show that the support set of any
pseudocodeword is a stopping set of iterative decoding of 3D-TCs using maximum
a posteriori constituent decoders on the binary erasure channel. Furthermore,
we compute ensemble-average pseudoweight enumerators of 3D-TCs and perform a
finite-length minimum pseudoweight analysis for small cover degrees. Also, an
explicit description of the fundamental cone of the 3D-TC polytope is given.
Finally, we present an extensive numerical study of small-to-medium block
length 3D-TCs, which shows that 1) typically (i.e., in most cases) when the
minimum distance $d_{\rm min}$ and/or the stopping distance $h_{\rm min}$ is
high, the minimum pseudoweight (on the additive white Gaussian noise channel)
is strictly smaller than both the $d_{\rm min}$ and the $h_{\rm min}$, and 2)
the minimum pseudoweight grows with the block length, at least for
small-to-medium block lengths.
|
[
{
"version": "v1",
"created": "Tue, 8 Mar 2011 15:26:21 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Sep 2013 21:22:00 GMT"
},
{
"version": "v3",
"created": "Thu, 13 Mar 2014 12:46:06 GMT"
},
{
"version": "v4",
"created": "Fri, 6 Jun 2014 13:30:58 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Rosnes",
"Eirik",
""
],
[
"Helmling",
"Michael",
""
],
[
"Amat",
"Alexandre Graell i",
""
]
] |
new_dataset
| 0.991003 |
1103.3933
|
Tuvi Etzion
|
Tuvi Etzion
|
Product Constructions for Perfect Lee Codes
|
submitted to IEEE Transactions on Information Theory
| null |
10.1109/TIT.2011.2161133
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A well known conjecture of Golomb and Welch is that the only nontrivial
perfect codes in the Lee and Manhattan metrics have length two or minimum
distance three. This problem and related topics were subject for extensive
research in the last forty years. In this paper two product constructions for
perfect Lee codes and diameter perfect Lee codes are presented. These
constructions yield a large number of nonlinear perfect codes and nonlinear
diameter perfect codes in the Lee and Manhattan metrics. A short survey and
other related problems on perfect codes in the Lee and the Manhattan metrics
are also discussed.
|
[
{
"version": "v1",
"created": "Mon, 21 Mar 2011 07:53:53 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Jun 2011 09:47:33 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Etzion",
"Tuvi",
""
]
] |
new_dataset
| 0.997641 |
1105.0452
|
Nikolaos Pappas
|
Nikolaos Pappas, Anthony Ephremides, Apostolos Traganitis
|
Relay-Assisted Multiple Access with Multi-Packet Reception Capability
and Simultaneous Transmission and Reception
|
A shorter version accepted for publication at IEEE Information Theory
Workshop 2011. This version has all the proofs omitted in the conference
version due to space limitations
| null |
10.1109/ITW.2011.6089522
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we examine the operation of a node relaying packets from a
number of users to a destination node. We assume multi-packet reception
capabilities for the relay and the destination node. The relay node can
transmit and receive at the same time, so the problem of self interference
arises. The relay does not have packets of its own and the traffic at the
source nodes is considered saturated. The relay node stores a source packet
that it receives successfully in its queue when the transmission to the
destination node has failed. We obtain analytical expressions for the
characteristics of the relay's queue (such as arrival and service rate of the
relay's queue), the stability condition and the average length of the queue as
functions of the probabilities of transmissions, the self interference
coefficient and the outage probabilities of the links. We study the impact of
the relay node and the self interference coefficient on the throughput per
user-source as well as the aggregate throughput.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2011 23:10:19 GMT"
},
{
"version": "v2",
"created": "Thu, 12 May 2011 00:38:37 GMT"
},
{
"version": "v3",
"created": "Thu, 11 Aug 2011 17:58:18 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Pappas",
"Nikolaos",
""
],
[
"Ephremides",
"Anthony",
""
],
[
"Traganitis",
"Apostolos",
""
]
] |
new_dataset
| 0.99936 |
1105.5975
|
Abdellatif Zaidi
|
Abdellatif Zaidi, Pablo Piantanida, Shlomo Shamai (Shitz)
|
Multiple Access Channel with States Known Noncausally at One Encoder and
Only Strictly Causally at the Other Encoder
|
5 pages, to appear in the 2011 IEEE International Symposium on
Information Theory
| null |
10.1109/ISIT.2011.6034085
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a two-user state-dependent multiaccess channel in which the
states of the channel are known non-causally to one of the encoders and only
strictly causally to the other encoder. Both encoders transmit a common message
and, in addition, the encoder that knows the states non-causally transmits an
individual message. We study the capacity region of this communication model.
In the discrete memoryless case, we establish inner and outer bounds on the
capacity region. Although the encoder that sends both messages knows the states
fully, we show that the strictly causal knowledge of these states at the other
encoder can be beneficial for this encoder, and in general enlarges the
capacity region. Furthermore, we find an explicit characterization of the
capacity in the case in which the two encoders transmit only the common
message. In the Gaussian case, we characterize the capacity region for the
model with individual message as well. Our converse proof in this case shows
that, for this model, strictly causal knowledge of the state at one of the
encoders does not increase capacity if the other is informed non-causally, a
result which sheds more light on the utility of conveying a compressed version
of the state to the decoder in recent results by Lapidoth and Steinberg on a
multiacess model with only strictly causal state at both encoders and
independent messages.
|
[
{
"version": "v1",
"created": "Mon, 30 May 2011 12:57:12 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Zaidi",
"Abdellatif",
"",
"Shitz"
],
[
"Piantanida",
"Pablo",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.973373 |
1106.0436
|
Venkatesan Guruswami
|
Venkatesan Guruswami
|
Linear-algebraic list decoding of folded Reed-Solomon codes
|
16 pages. Extended abstract in Proc. of IEEE Conference on
Computational Complexity (CCC), 2011
| null |
10.1109/CCC.2011.22
| null |
cs.IT cs.DS math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Folded Reed-Solomon codes are an explicit family of codes that achieve the
optimal trade-off between rate and error-correction capability: specifically,
for any $\eps > 0$, the author and Rudra (2006,08) presented an $n^{O(1/\eps)}$
time algorithm to list decode appropriate folded RS codes of rate $R$ from a
fraction $1-R-\eps$ of errors. The algorithm is based on multivariate
polynomial interpolation and root-finding over extension fields. It was noted
by Vadhan that interpolating a linear polynomial suffices if one settles for a
smaller decoding radius (but still enough for a statement of the above form).
Here we give a simple linear-algebra based analysis of this variant that
eliminates the need for the computationally expensive root-finding step over
extension fields (and indeed any mention of extension fields). The entire list
decoding algorithm is linear-algebraic, solving one linear system for the
interpolation step, and another linear system to find a small subspace of
candidate solutions. Except for the step of pruning this subspace, the
algorithm can be implemented to run in {\em quadratic} time. The theoretical
drawback of folded RS codes are that both the decoding complexity and proven
worst-case list-size bound are $n^{\Omega(1/\eps)}$. By combining the above
idea with a pseudorandom subset of all polynomials as messages, we get a Monte
Carlo construction achieving a list size bound of $O(1/\eps^2)$ which is quite
close to the existential $O(1/\eps)$ bound (however, the decoding complexity
remains $n^{\Omega(1/\eps)}$). Our work highlights that constructing an
explicit {\em subspace-evasive} subset that has small intersection with
low-dimensional subspaces could lead to explicit codes with better
list-decoding guarantees.
|
[
{
"version": "v1",
"created": "Thu, 2 Jun 2011 14:18:27 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Guruswami",
"Venkatesan",
""
]
] |
new_dataset
| 0.990052 |
1107.1937
|
Stefano Ferretti Stefano Ferretti
|
Stefano Ferretti, Vittorio Ghini
|
Scale-Free Opportunistic Networks: is it Possible?
|
A revised version of the paper will appear in Proc. of the 8th
International Workshop on Mobile Peer-to-Peer Computing - IEEE International
Conference on Pervasive Computing and Communications (PERCOM 2012), Lugano,
Switzerland, IEEE, March 2012
| null |
10.1109/PerComW.2012.6197590
| null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The coupling of scale-free networks with mobile unstructured networks is
certainly unusual. In mobile networks, connections active at a given instant
are constrained by the geographical distribution of mobile nodes, and by the
limited signal strength of the wireless technology employed to build the ad-hoc
overlay. This is in contrast with the presence of hubs, typical of scale-free
nets. However, opportunistic (mobile) networks possess the distinctive feature
to be delay tolerant; mobile nodes implement a store, carry and forward
strategy that permits to disseminate data based on a multi-hop route, which is
built in time, when nodes encounter other ones while moving. In this paper, we
consider opportunistic networks as evolving graphs where links represent
contacts among nodes arising during a (non-instantaneous) time interval. We
discuss a strategy to control the way nodes manage contacts and build
"opportunistic overlays". Based on such an approach, interesting overlays can
be obtained, shaped following given desired topologies, such as scale-free
ones.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2011 05:03:45 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Feb 2012 10:14:44 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Ferretti",
"Stefano",
""
],
[
"Ghini",
"Vittorio",
""
]
] |
new_dataset
| 0.998884 |
1110.2343
|
Kaveh Mahdaviani
|
Kaveh Mahdaviani, Masoud Ardakani, Chintha Tellambura
|
Annotated Raptor Codes
|
This paper has been Accepted for presentation in IEEE Information
Theory Workshop (ITW) 2011, Paraty, Brazil
| null |
10.1109/ITW.2011.6089435
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, an extension of raptor codes is introduced which keeps all the
desirable properties of raptor codes, including the linear complexity of
encoding and decoding per information bit, unchanged. The new design, however,
improves the performance in terms of the reception rate. Our simulations show a
10% reduction in the needed overhead at the benchmark block length of 64,520
bits and with the same complexity per information bit.
|
[
{
"version": "v1",
"created": "Tue, 11 Oct 2011 12:18:23 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Mahdaviani",
"Kaveh",
""
],
[
"Ardakani",
"Masoud",
""
],
[
"Tellambura",
"Chintha",
""
]
] |
new_dataset
| 0.995543 |
1111.0711
|
Stark Draper
|
Yige Wang, Stark C. Draper and Jonathan S. Yedidia
|
Hierarchical and High-Girth QC LDPC Codes
|
Submitted to IEEE Transactions on Information THeory
| null |
10.1109/TIT.2013.2253512
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a general approach to designing capacity-approaching high-girth
low-density parity-check (LDPC) codes that are friendly to hardware
implementation. Our methodology starts by defining a new class of
"hierarchical" quasi-cyclic (HQC) LDPC codes that generalizes the structure of
quasi-cyclic (QC) LDPC codes. Whereas the parity check matrices of QC LDPC
codes are composed of circulant sub-matrices, those of HQC LDPC codes are
composed of a hierarchy of circulant sub-matrices that are in turn constructed
from circulant sub-matrices, and so on, through some number of levels. We show
how to map any class of codes defined using a protograph into a family of HQC
LDPC codes. Next, we present a girth-maximizing algorithm that optimizes the
degrees of freedom within the family of codes to yield a high-girth HQC LDPC
code. Finally, we discuss how certain characteristics of a code protograph will
lead to inevitable short cycles, and show that these short cycles can be
eliminated using a "squashing" procedure that results in a high-girth QC LDPC
code, although not a hierarchical one. We illustrate our approach with designed
examples of girth-10 QC LDPC codes obtained from protographs of one-sided
spatially-coupled codes.
|
[
{
"version": "v1",
"created": "Thu, 3 Nov 2011 01:54:49 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Wang",
"Yige",
""
],
[
"Draper",
"Stark C.",
""
],
[
"Yedidia",
"Jonathan S.",
""
]
] |
new_dataset
| 0.982013 |
1112.0371
|
Zhiying Wang
|
Itzhak Tamo, Zhiying Wang, and Jehoshua Bruck
|
Zigzag Codes: MDS Array Codes with Optimal Rebuilding
|
23 pages, 5 figures, submitted to IEEE transactions on information
theory
| null |
10.1109/TIT.2012.2227110
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MDS array codes are widely used in storage systems to protect data against
erasures. We address the \emph{rebuilding ratio} problem, namely, in the case
of erasures, what is the fraction of the remaining information that needs to be
accessed in order to rebuild \emph{exactly} the lost information? It is clear
that when the number of erasures equals the maximum number of erasures that an
MDS code can correct then the rebuilding ratio is 1 (access all the remaining
information). However, the interesting and more practical case is when the
number of erasures is smaller than the erasure correcting capability of the
code. For example, consider an MDS code that can correct two erasures: What is
the smallest amount of information that one needs to access in order to correct
a single erasure? Previous work showed that the rebuilding ratio is bounded
between 1/2 and 3/4, however, the exact value was left as an open problem. In
this paper, we solve this open problem and prove that for the case of a single
erasure with a 2-erasure correcting code, the rebuilding ratio is 1/2. In
general, we construct a new family of $r$-erasure correcting MDS array codes
that has optimal rebuilding ratio of $\frac{e}{r}$ in the case of $e$ erasures,
$1 \le e \le r$. Our array codes have efficient encoding and decoding
algorithms (for the case $r=2$ they use a finite field of size 3) and an
optimal update property.
|
[
{
"version": "v1",
"created": "Fri, 2 Dec 2011 01:59:57 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Tamo",
"Itzhak",
""
],
[
"Wang",
"Zhiying",
""
],
[
"Bruck",
"Jehoshua",
""
]
] |
new_dataset
| 0.997833 |
1201.2859
|
Bin Dai
|
Bin Dai, A. J. Han Vinck, Zhuojun Zhuang and Yuan Luo
|
Degraded Broadcast Channel with Side Information, Confidential Messages
and Noiseless Feedback
|
Part of this paper has been accepted by ISIT2012, and this paper is
submitted to IEEE Transactions on Information Theory
| null |
10.1109/ISIT.2012.6284226
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, first, we investigate the model of degraded broadcast channel
with side information and confidential messages. This work is from Steinberg's
work on the degraded broadcast channel with causal and noncausal side
information, and Csisz$\acute{a}$r-K\"{o}rner's work on broadcast channel with
confidential messages. Inner and outer bounds on the capacity-equivocation
regions are provided for the noncausal and causal cases. Superposition coding
and double-binning technique are used in the corresponding achievability
proofs.
Then, we investigate the degraded broadcast channel with side information,
confidential messages and noiseless feedback. The noiseless feedback is from
the non-degraded receiver to the channel encoder. Inner and outer bounds on the
capacity-equivocation region are provided for the noncausal case, and the
capacity-equivocation region is determined for the causal case. Compared with
the model without feedback, we find that the noiseless feedback helps to
enlarge the inner bounds for both causal and noncausal cases. In the
achievability proof of the feedback model, the noiseless feedback is used as a
secret key shared by the non-degraded receiver and the transmitter, and
therefore, the code construction for the feedback model is a combination of
superposition coding, Gel'fand-Pinsker's binning, block Markov coding and
Ahlswede-Cai's secret key on the feedback system.
|
[
{
"version": "v1",
"created": "Fri, 13 Jan 2012 15:15:07 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Jan 2012 08:43:11 GMT"
},
{
"version": "v3",
"created": "Fri, 27 Jan 2012 09:44:17 GMT"
},
{
"version": "v4",
"created": "Wed, 1 Feb 2012 08:55:03 GMT"
},
{
"version": "v5",
"created": "Sun, 13 May 2012 18:34:15 GMT"
},
{
"version": "v6",
"created": "Wed, 31 Oct 2012 04:06:32 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Dai",
"Bin",
""
],
[
"Vinck",
"A. J. Han",
""
],
[
"Zhuang",
"Zhuojun",
""
],
[
"Luo",
"Yuan",
""
]
] |
new_dataset
| 0.987459 |
1201.3140
|
Yonghui Li
|
Yonghui Li, Md. Shahriar Rahman, Soon Xin Ng and Branka Vucetic
|
Distributed Soft Coding with a Soft Input Soft Output (SISO) Relay
Encoder in Parallel Relay Channels
|
to appear on IEEE Transactions on Communications
| null |
10.1109/TCOMM.2013.073013.120792
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a new distributed coding structure with a soft
input soft output (SISO) relay encoder for error-prone parallel relay channels.
We refer to it as the distributed soft coding (DISC). In the proposed scheme,
each relay first uses the received noisy signals to calculate the soft bit
estimate (SBE) of the source symbols. A simple SISO encoder is developed to
encode the SBEs of source symbols based on a constituent code generator matrix.
The SISO encoder outputs at different relays are then forwarded to the
destination and form a distributed codeword. The performance of the proposed
scheme is analyzed. It is shown that its performance is determined by the
generator sequence weight (GSW) of the relay constituent codes, where the GSW
of a constituent code is defined as the number of ones in its generator
sequence. A new coding design criterion for optimally assigning the constituent
codes to all the relays is proposed based on the analysis. Results show that
the proposed DISC can effectively circumvent the error propagation due to the
decoding errors in the conventional detect and forward (DF) with relay
re-encoding and bring considerable coding gains, compared to the conventional
soft information relaying.
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2012 00:09:29 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Jul 2013 05:08:26 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Li",
"Yonghui",
""
],
[
"Rahman",
"Md. Shahriar",
""
],
[
"Ng",
"Soon Xin",
""
],
[
"Vucetic",
"Branka",
""
]
] |
new_dataset
| 0.998958 |
1203.4040
|
Seokbeom Hong
|
Beomkyu Shin, Seokbeom Hong, Hosung Park, Jong-Seon No, and Dong-Joon
Shin
|
New decoding scheme for LDPC codes based on simple product code
structure
|
This work has been submitted to the IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessible
| null |
10.1109/JCN.2015.000066
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new decoding scheme for low-density parity-check (LDPC)
codes using the concept of simple product code structure is proposed based on
combining two independently received soft-decision data for the same codeword.
LDPC codes act as horizontal codes of the product codes and simple algebraic
codes are used as vertical codes to help decoding of the LDPC codes. The
decoding capability of the proposed decoding scheme is defined and analyzed
using the paritycheck matrices of vertical codes and especially the
combined-decodability is derived for the case of single parity-check (SPC) and
Hamming codes being used as vertical codes. It is also shown that the proposed
decoding scheme achieves much better error-correcting capability in high signal
to noise ratio (SNR) region with low additional decoding complexity, compared
with a conventional decoding scheme.
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2012 06:12:19 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Shin",
"Beomkyu",
""
],
[
"Hong",
"Seokbeom",
""
],
[
"Park",
"Hosung",
""
],
[
"No",
"Jong-Seon",
""
],
[
"Shin",
"Dong-Joon",
""
]
] |
new_dataset
| 0.999327 |
1204.3388
|
Amr Ismail Tammam
|
Amr Ismail, Jocelyn Fiorina, and Hikmet Sari
|
A Novel Construction of Multi-group Decodable Space-Time Block Codes
|
12 pages, and 5 tables, accepted for publication in IEEE transactions
on communications
| null |
10.1109/TCOMM.2012.032012.100731
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Complex Orthogonal Design (COD) codes are known to have the lowest detection
complexity among Space-Time Block Codes (STBCs). However, the rate of square
COD codes decreases exponentially with the number of transmit antennas. The
Quasi-Orthogonal Design (QOD) codes emerged to provide a compromise between
rate and complexity as they offer higher rates compared to COD codes at the
expense of an increase of decoding complexity through partially relaxing the
orthogonality conditions. The QOD codes were then generalized with the so
called g-symbol and g-group decodable STBCs where the number of orthogonal
groups of symbols is no longer restricted to two as in the QOD case. However,
the adopted approach for the construction of such codes is based on sufficient
but not necessary conditions which may limit the achievable rates for any
number of orthogonal groups. In this paper, we limit ourselves to the case of
Unitary Weight (UW)-g-group decodable STBCs for 2^a transmit antennas where the
weight matrices are required to be single thread matrices with non-zero entries
in {1,-1,j,-j} and address the problem of finding the highest achievable rate
for any number of orthogonal groups. This special type of weight matrices
guarantees full symbol-wise diversity and subsumes a wide range of existing
codes in the literature. We show that in this case an exhaustive search can be
applied to find the maximum achievable rates for UW-g-group decodable STBCs
with g>1. For this purpose, we extend our previously proposed approach for
constructing UW-2-group decodable STBCs based on necessary and sufficient
conditions to the case of UW-g-group decodable STBCs in a recursive manner.
|
[
{
"version": "v1",
"created": "Mon, 16 Apr 2012 07:45:53 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Ismail",
"Amr",
""
],
[
"Fiorina",
"Jocelyn",
""
],
[
"Sari",
"Hikmet",
""
]
] |
new_dataset
| 0.995758 |
1204.4840
|
Giuseppe Caire
|
Eric Rebeiz, Giuseppe Caire, and Andreas F. Molisch
|
Energy-Delay Tradeoff and Dynamic Sleep Switching for Bluetooth-Like
Body-Area Sensor Networks
|
Extended version (with proofs details in the Appendix) of a paper
accepted for publication on the IEEE Transactions on Communications
| null |
10.1109/TCOMM.2012.12.110143A
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless technology enables novel approaches to healthcare, in particular the
remote monitoring of vital signs and other parameters indicative of people's
health. This paper considers a system scenario relevant to such applications,
where a smart-phone acts as a data-collecting hub, gathering data from a number
of wireless-capable body sensors, and relaying them to a healthcare provider
host through standard existing cellular networks. Delay of critical data and
sensors' energy efficiency are both relevant and conflicting issues. Therefore,
it is important to operate the wireless body-area sensor network at some
desired point close to the optimal energy-delay tradeoff curve. This tradeoff
curve is a function of the employed physical-layer protocol: in particular, it
depends on the multiple-access scheme and on the coding and modulation schemes
available. In this work, we consider a protocol closely inspired by the
widely-used Bluetooth standard. First, we consider the calculation of the
minimum energy function, i.e., the minimum sum energy per symbol that
guarantees the stability of all transmission queues in the network. Then, we
apply the general theory developed by Neely to develop a dynamic scheduling
policy that approaches the optimal energy-delay tradeoff for the network at
hand. Finally, we examine the queue dynamics and propose a novel policy that
adaptively switches between connected and disconnected (sleeping) modes. We
demonstrate that the proposed policy can achieve significant gains in the
realistic case where the control "NULL" packets necessary to maintain the
connection alive, have a non-zero energy cost, and the data arrival statistics
corresponding to the sensed physical process are bursty.
|
[
{
"version": "v1",
"created": "Sat, 21 Apr 2012 21:53:41 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Rebeiz",
"Eric",
""
],
[
"Caire",
"Giuseppe",
""
],
[
"Molisch",
"Andreas F.",
""
]
] |
new_dataset
| 0.968377 |
1205.2590
|
Eirik Rosnes
|
Eirik Rosnes, Marcel A. Ambroze, and Martin Tomlinson
|
On the Minimum/Stopping Distance of Array Low-Density Parity-Check Codes
|
To appear in IEEE Trans. Inf. Theory. The material in this paper was
presented in part at the 2014 IEEE International Symposium on Information
Theory, Honolulu, HI, June/July 2014
| null |
10.1109/TIT.2014.2333519
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we study the minimum/stopping distance of array low-density
parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code
specified by two integers q and m, where q is an odd prime and m <= q. In the
literature, the minimum/stopping distance of these codes (denoted by d(q,m) and
h(q,m), respectively) has been thoroughly studied for m <= 5. Both exact
results, for small values of q and m, and general (i.e., independent of q)
bounds have been established. For m=6, the best known minimum distance upper
bound, derived by Mittelholzer (IEEE Int. Symp. Inf. Theory, Jun./Jul. 2002),
is d(q,6) <= 32. In this work, we derive an improved upper bound of d(q,6) <=
20 and a new upper bound d(q,7) <= 24 by using the concept of a template
support matrix of a codeword/stopping set. The bounds are tight with high
probability in the sense that we have not been able to find codewords of
strictly lower weight for several values of q using a minimum distance
probabilistic algorithm. Finally, we provide new specific minimum/stopping
distance results for m <= 7 and low-to-moderate values of q <= 79.
|
[
{
"version": "v1",
"created": "Fri, 11 May 2012 18:01:38 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Apr 2013 19:27:23 GMT"
},
{
"version": "v3",
"created": "Tue, 3 Jun 2014 11:05:17 GMT"
},
{
"version": "v4",
"created": "Tue, 8 Jul 2014 08:27:09 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Rosnes",
"Eirik",
""
],
[
"Ambroze",
"Marcel A.",
""
],
[
"Tomlinson",
"Martin",
""
]
] |
new_dataset
| 0.99938 |
1205.5914
|
Cristiano Torezzan
|
Cristiano Torezzan, Sueli I. R. Costa, Vinay A. Vaishampayan
|
Constructive spherical codes on layers of flat tori
|
9 pages, 5 figures, submitted to IEEE Transactions on Information
Theory
| null |
10.1109/TIT.2013.2272931
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new class of spherical codes is constructed by selecting a finite subset of
flat tori from a foliation of the unit sphere S^{2L-1} of R^{2L} and designing
a structured codebook on each torus layer. The resulting spherical code can be
the image of a lattice restricted to a specific hyperbox in R^L in each layer.
Group structure and homogeneity, useful for efficient storage and decoding, are
inherited from the underlying lattice codebook. A systematic method for
constructing such codes are presented and, as an example, the Leech lattice is
used to construct a spherical code in R^{48}. Upper and lower bounds on the
performance, the asymptotic packing density and a method for decoding are
derived.
|
[
{
"version": "v1",
"created": "Sat, 26 May 2012 19:49:18 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Torezzan",
"Cristiano",
""
],
[
"Costa",
"Sueli I. R.",
""
],
[
"Vaishampayan",
"Vinay A.",
""
]
] |
new_dataset
| 0.96932 |
1207.1777
|
Nadeem Javaid
|
S. Kumar, N. Javaid, Z. Yousuf, H. Kumar, Z. A. Khan, A. Bibi
|
DSDV, DYMO, OLSR: Link Duration and Path Stability
| null |
Multicom2012 held in conjunction with the 11th IEEE International
Conference on Ubiquitous Computing and Communications (IUCC-2012) (25 - 27
June 2012, Liverpool, UK)
|
10.1109/TrustCom.2012.133
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we evaluate and compare the impact of link duration and path
stability of routing protocols; Destination Sequence Distance vector (DSDV),
Dynamic MANET On- Demand (DYMO) and Optimized Link State Routing (OLSR) at
different number of connections and node density. In order to improve the
efficiency of selected protocols; we enhance DYMO and OLSR. Simulation and
comparison of both default and enhanced routing protocols is carried out under
the performance parameters; Packet Delivery Ratio (PDR), Average End-to End
Delay (AE2ED) and Normalized Routing Overhead (NRO). From the results, we
observe that DYMO performs better than DSDV, MOD-OLSR and OLSR in terms of PDR,
AE2ED, link duration and path stability at the cost of high value of NRO.
|
[
{
"version": "v1",
"created": "Sat, 7 Jul 2012 08:18:30 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Kumar",
"S.",
""
],
[
"Javaid",
"N.",
""
],
[
"Yousuf",
"Z.",
""
],
[
"Kumar",
"H.",
""
],
[
"Khan",
"Z. A.",
""
],
[
"Bibi",
"A.",
""
]
] |
new_dataset
| 0.99746 |
1210.0510
|
Tayeb Lemlouma
|
Tayeb Lemlouma, Yoann Lefebvre, Fr\'ed\'eric Cespedes
|
PCNM: A New Platform for Cellular Networks Measurements and Optimization
|
IEEE International Conference on Wireless Communications, Networking
and Mobile Computing (WiCOM 2007)
| null |
10.1109/WICOM.2007.737
| null |
cs.NI cs.OH cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present PCNM, a new mobile platform for cellular networks
measurements. PCNM is based on a set of techniques that tailors theoretical
calculations and simulations to the real cellular network environment. It
includes: (a) modules that measure different parameters of a base station (BS)
such as localization, cells identification, time advance information, reception
level and quality, (b) a new protocol that optimizes the task of network
measurement by monitoring a set of mobile nodes and finally (c) the ability to
extend an existing cellular network by adding new base stations. We evaluate
our genetic algorithm used to reduce the nodes mobility and optimize the
measurement extraction of N base stations using k mobile sensors (k >= 1). We
show how connecting real measurements (using mobile sensors in a collaborative
way) to theoretical and prediction methods is of high benefits for cellular
networks maintenance, extension and performances evaluation.
|
[
{
"version": "v1",
"created": "Mon, 1 Oct 2012 19:15:19 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Lemlouma",
"Tayeb",
""
],
[
"Lefebvre",
"Yoann",
""
],
[
"Cespedes",
"Frédéric",
""
]
] |
new_dataset
| 0.999122 |
1210.3906
|
Hosung Park
|
Hosung Park, Seokbeom Hong, Jong-Seon No, and Dong-Joon Shin
|
Design of Multiple-Edge Protographs for QC LDPC Codes Avoiding Short
Inevitable Cycles
|
42 pages, submitted to IEEE Transactions on Information Theory on
June 2011
| null |
10.1109/TIT.2013.2250574
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There have been lots of efforts on the construction of quasi-cyclic (QC)
low-density parity-check (LDPC) codes with large girth. However, most of them
are focused on protographs with single edges and little research has been done
for the construction of QC LDPC codes lifted from protographs with multiple
edges. Compared to single-edge protographs, multiple-edge protographs have
benefits such that QC LDPC codes lifted from them can potentially have larger
minimum Hamming distance. In this paper, all subgraph patterns of multiple-edge
protographs, which prevent QC LDPC codes from having large girth by inducing
inevitable cycles, are fully investigated based on graph-theoretic approach. By
using combinatorial designs, a systematic construction method of multiple-edge
protographs is proposed for regular QC LDPC codes with girth at least 12 and
also other method is proposed for regular QC LDPC codes with girth at least 14.
A construction algorithm of QC LDPC codes by lifting multiple-edge protographs
is proposed and it is shown that the resulting QC LDPC codes have larger upper
bounds on the minimum Hamming distance than those lifted from single-edge
protographs. Simulation results are provided to compare the performance of the
proposed QC LDPC codes, the progressive edge-growth (PEG) LDPC codes, and the
PEG QC LDPC codes.
|
[
{
"version": "v1",
"created": "Mon, 15 Oct 2012 05:57:49 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Park",
"Hosung",
""
],
[
"Hong",
"Seokbeom",
""
],
[
"No",
"Jong-Seon",
""
],
[
"Shin",
"Dong-Joon",
""
]
] |
new_dataset
| 0.999198 |
1211.4728
|
Hajime Matsui
|
Hajime Matsui
|
Lemma for Linear Feedback Shift Registers and DFTs Applied to Affine
Variety Codes
|
37 pages, 1 column, 10 figures, 2 tables, resubmitted to IEEE
Transactions on Information Theory on Jan. 8, 2014
| null |
10.1109/TIT.2014.2311042
| null |
cs.IT cs.DM math.AC math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we establish a lemma in algebraic coding theory that
frequently appears in the encoding and decoding of, e.g., Reed-Solomon codes,
algebraic geometry codes, and affine variety codes. Our lemma corresponds to
the non-systematic encoding of affine variety codes, and can be stated by
giving a canonical linear map as the composition of an extension through linear
feedback shift registers from a Grobner basis and a generalized inverse
discrete Fourier transform. We clarify that our lemma yields the error-value
estimation in the fast erasure-and-error decoding of a class of dual affine
variety codes. Moreover, we show that systematic encoding corresponds to a
special case of erasure-only decoding. The lemma enables us to reduce the
computational complexity of error-evaluation from O(n^3) using Gaussian
elimination to O(qn^2) with some mild conditions on n and q, where n is the
code length and q is the finite-field size.
|
[
{
"version": "v1",
"created": "Tue, 20 Nov 2012 12:51:19 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Jan 2014 05:15:40 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Matsui",
"Hajime",
""
]
] |
new_dataset
| 0.985807 |
1212.1198
|
Natasha Devroye
|
Yiwei Song, Natasha Devroye, Huai-Rong Shao, Chiu Ngo
|
Lattice Coding for the Two-way Two-relay Channel
|
submitted to IEEE Transactions on Information Theory on December 3,
2012
| null |
10.1109/ISIT.2013.6620439
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lattice coding techniques may be used to derive achievable rate regions which
outperform known independent, identically distributed (i.i.d.) random codes in
multi-source relay networks and in particular the two-way relay channel. Gains
stem from the ability to decode the sum of codewords (or messages) using
lattice codes at higher rates than possible with i.i.d. random codes. Here we
develop a novel lattice coding scheme for the Two-way Two-relay Channel: 1 <->
2 <-> 3 <-> 4, where Node 1 and 4 simultaneously communicate with each other
through two relay nodes 2 and 3. Each node only communicates with its
neighboring nodes. The key technical contribution is the lattice-based
achievability strategy, where each relay is able to remove the noise while
decoding the sum of several signals in a Block Markov strategy and then
re-encode the signal into another lattice codeword using the so-called
"Re-distribution Transform". This allows nodes further down the line to again
decode sums of lattice codewords. This transform is central to improving the
achievable rates, and ensures that the messages traveling in each of the two
directions fully utilize the relay's power, even under asymmetric channel
conditions. All decoders are lattice decoders and only a single nested lattice
codebook pair is needed. The symmetric rate achieved by the proposed lattice
coding scheme is within 0.5 log 3 bit/Hz/s of the symmetric rate capacity.
|
[
{
"version": "v1",
"created": "Wed, 5 Dec 2012 22:48:39 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Song",
"Yiwei",
""
],
[
"Devroye",
"Natasha",
""
],
[
"Shao",
"Huai-Rong",
""
],
[
"Ngo",
"Chiu",
""
]
] |
new_dataset
| 0.980646 |
1212.4092
|
Nadeem Javaid
|
A. Kashaf, N. Javaid, Z. A. Khan, I. A. Khan
|
TSEP: Threshold-sensitive Stable Election Protocol for WSNs
|
10th IEEE International Conference on Frontiers of Information
Technology (FIT 12), 2012
| null |
10.1109/FIT.2012.37
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Sensor Networks (WSNs) are expected to find wide applicability and
increasing deployment in near future. In this paper, we propose a new protocol,
Threshold Sensitive Stable Election Protocol (TSEP), which is reactive protocol
using three levels of heterogeneity. Reactive networks, as opposed to proactive
networks, respond immediately to changes in relevant parameters of interest. We
evaluate performance of our protocol for a simple temperature sensing
application and compare results of protocol with some other protocols LEACH,
DEEC, SEP, ESEP and TEEN. And from simulation results it is observed that
protocol outperforms concerning life time of sensing nodes used.
|
[
{
"version": "v1",
"created": "Mon, 17 Dec 2012 18:24:50 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Kashaf",
"A.",
""
],
[
"Javaid",
"N.",
""
],
[
"Khan",
"Z. A.",
""
],
[
"Khan",
"I. A.",
""
]
] |
new_dataset
| 0.970272 |
1212.4336
|
Dr. Nadeem Javaid
|
Syed Hassan Ahmed, Safdar H. Bouk, N. Javaid, Iwao Sasase
|
Combined Human, Antenna Orientation in Elevation Direction and Ground
Effect on RSSI in Wireless Sensor Networks
|
10th IEEE International Conference on Frontiers of Information
Technology (FIT 12), 2012
| null |
10.1109/FIT.2012.17
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we experimentally investigate the combined effect of human,
antenna orientation in elevation direction and the ground effect on the
Received Signal Strength Indicator (RSSI) parameter in the Wireless Sensor
Network (WSN). In experiment, we use MICAz motes and consider different
scenarios where antenna of the transmitter node is tilted in elevation
direction. The motes were placed on the ground to take into account the ground
effect on the RSSI. The effect of one, two and four persons on the RSSI is
recorded. For one and two persons, different walking paces e.g. slow, medium
and fast pace, are analysed. However, in case of four persons, random movement
is carried out between the pair of motes. The experimental results show that
some antenna orientation angles have drastic effect on the RSSI, even without
any human activity. The fluctuation count and range of RSSI in different
scenarios with same walking pace are completely different. Therefore, an
efficient human activity algorithm is need that effectively takes into count
the antenna elevation and other parameters to accurately detect the human
activity in the WSN deployment region.
|
[
{
"version": "v1",
"created": "Tue, 18 Dec 2012 13:00:46 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Ahmed",
"Syed Hassan",
""
],
[
"Bouk",
"Safdar H.",
""
],
[
"Javaid",
"N.",
""
],
[
"Sasase",
"Iwao",
""
]
] |
new_dataset
| 0.97155 |
1301.1084
|
Charith Perera
|
Charith Perera, Arkady Zaslavsky, Peter Christen, Dimitrios
Georgakopoulos
|
CA4IOT Context Awareness for Internet of Things
| null |
Proceedings of the IEEE International Conference on Green
Computing and Communications, Conference on Internet of Things, and
Conference on Cyber,Physical and Social Computing (iThings/CPSCom/GreenCom),
Besancon, France, November,2012
|
10.1109/GreenCom.2012.128
| null |
cs.SE cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internet of Things (IoT) will connect billions of sensors deployed around the
world together. This will create an ideal opportunity to build a
sensing-as-a-service platform. Due to large number of sensor deployments, there
would be number of sensors that can be used to sense and collect similar
information. Further, due to advances in sensor hardware technology, new
methods and measurements will be introduced continuously. In the IoT paradigm,
selecting the most appropriate sensors which can provide relevant sensor data
to address the problems at hand among billions of possibilities would be a
challenge for both technical and non-technical users. In this paper, we propose
the Context Awareness for Internet of Things (CA4IOT) architecture to help
users by automating the task of selecting the sensors according to the
problems/tasks at hand. We focus on automated configuration of filtering,
fusion and reasoning mechanisms that can be applied to the collected sensor
data streams using selected sensors. Our objective is to allow the users to
submit their problems, so our proposed architecture understands them and
produces more comprehensive and meaningful information than the raw sensor data
streams generated by individual sensors.
|
[
{
"version": "v1",
"created": "Mon, 7 Jan 2013 00:46:47 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Perera",
"Charith",
""
],
[
"Zaslavsky",
"Arkady",
""
],
[
"Christen",
"Peter",
""
],
[
"Georgakopoulos",
"Dimitrios",
""
]
] |
new_dataset
| 0.997163 |
1301.4397
|
Mathis Seidl
|
Mathis Seidl, Andreas Schenk, Clemens Stierstorfer, Johannes B. Huber
|
Multilevel Polar-Coded Modulation
|
submitted to IEEE ISIT 2013
| null |
10.1109/ISIT.2013.6620437
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A framework is proposed that allows for a joint description and optimization
of both binary polar coding and the multilevel coding (MLC) approach for
$2^m$-ary digital pulse-amplitude modulation (PAM). The conceptual equivalence
of polar coding and multilevel coding is pointed out in detail. Based on a
novel characterization of the channel polarization phenomenon, rules for the
optimal choice of the bit labeling in this coded modulation scheme employing
polar codes are developed. Simulation results for the AWGN channel are
included.
|
[
{
"version": "v1",
"created": "Fri, 18 Jan 2013 15:02:50 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Seidl",
"Mathis",
""
],
[
"Schenk",
"Andreas",
""
],
[
"Stierstorfer",
"Clemens",
""
],
[
"Huber",
"Johannes B.",
""
]
] |
new_dataset
| 0.956097 |
1301.7506
|
Yulong Zou Dr.
|
Yulong Zou, Jia Zhu and Baoyu Zheng
|
A Fully Distributed Opportunistic Network Coding Scheme for Cellular
Relay Networks
|
in Proceedings of the 2013 IEEE Wireless Communications and
Networking Conference (IEEE WCNC 2013), Shanghai China, Apr. 2013
| null |
10.1109/WCNC.2013.6555028
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose an opportunistic network coding (ONC) scheme in
cellular relay networks, which operates depending on whether the relay decodes
source messages successfully or not. A fully distributed method is presented to
implement the proposed opportunistic network coding scheme without the need of
any feedback between two network nodes. We consider the use of proposed ONC for
cellular downlink transmissions and derive its closed-form outage probability
expression considering cochannel interference in a Rayleigh fading environment.
Numerical results show that the proposed ONC scheme outperforms the traditional
non-cooperation in terms of outage probability. We also develop the
diversity-multiplexing tradeoff (DMT) of proposed ONC and show that the ONC
scheme obtains the full diversity and an increased multiplexing gain as
compared with the conventional cooperation protocols.
|
[
{
"version": "v1",
"created": "Thu, 31 Jan 2013 03:44:30 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Zou",
"Yulong",
""
],
[
"Zhu",
"Jia",
""
],
[
"Zheng",
"Baoyu",
""
]
] |
new_dataset
| 0.995157 |
1302.4463
|
Hooman Jarollahi
|
Hooman Jarollahi, Vincent Gripon, Naoya Onizawa, Warren J. Gross
|
A Low-Power Content-Addressable-Memory Based on
Clustered-Sparse-Networks
|
Submitted to IEEE ASAP 2013
| null |
10.1109/ASAP.2013.6567594
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A low-power Content-Addressable-Memory (CAM) is introduced employing a new
mechanism for associativity between the input tags and the corresponding
address of the output data. The proposed architecture is based on a recently
developed clustered-sparse-network using binary-weighted connections that
on-average will eliminate most of the parallel comparisons performed during a
search. Therefore, the dynamic energy consumption of the proposed design is
significantly lower compared to that of a conventional low-power CAM design.
Given an input tag, the proposed architecture computes a few possibilities for
the location of the matched tag and performs the comparisons on them to locate
a single valid match. A 0.13 um CMOS technology was used for simulation
purposes. The energy consumption and the search delay of the proposed design
are 9.5%, and 30.4% of that of the conventional NAND architecture respectively
with a 3.4% higher number of transistors.
|
[
{
"version": "v1",
"created": "Mon, 18 Feb 2013 21:23:54 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Jarollahi",
"Hooman",
""
],
[
"Gripon",
"Vincent",
""
],
[
"Onizawa",
"Naoya",
""
],
[
"Gross",
"Warren J.",
""
]
] |
new_dataset
| 0.980882 |
1303.7083
|
Ziv Goldfeld
|
Ziv Goldfeld, Haim H. Permuter and Benjamin M. Zaidel
|
The Finite State MAC with Cooperative Encoders and Delayed CSI
| null |
IEEE Transactions on Information Theory, Vol. 60, No. 10, October
2014
|
10.1109/TIT.2014.2346494
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the finite-state multiple access channel (MAC)
with partially cooperative encoders and delayed channel state information
(CSI). Here partial cooperation refers to the communication between the
encoders via finite-capacity links. The channel states are assumed to be
governed by a Markov process. Full CSI is assumed at the receiver, while at the
transmitters, only delayed CSI is available. The capacity region of this
channel model is derived by first solving the case of the finite-state MAC with
a common message. Achievability for the latter case is established using the
notion of strategies, however, we show that optimal codes can be constructed
directly over the input alphabet. This results in a single codebook
construction that is then leveraged to apply simultaneous joint decoding.
Simultaneous decoding is crucial here because it circumvents the need to rely
on the capacity region's corner points, a task that becomes increasingly
cumbersome with the growth in the number of messages to be sent. The common
message result is then used to derive the capacity region for the case with
partially cooperating encoders. Next, we apply this general result to the
special case of the Gaussian vector MAC with diagonal channel transfer
matrices, which is suitable for modeling, e.g., orthogonal frequency division
multiplexing (OFDM)-based communication systems. The capacity region of the
Gaussian channel is presented in terms of a convex optimization problem that
can be solved efficiently using numerical tools. The region is derived by first
presenting an outer bound on the general capacity region and then suggesting a
specific input distribution that achieves this bound. Finally, numerical
results are provided that give valuable insight into the practical implications
of optimally using conferencing to maximize the transmission rates.
|
[
{
"version": "v1",
"created": "Thu, 28 Mar 2013 10:30:39 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Jan 2014 13:51:56 GMT"
},
{
"version": "v3",
"created": "Thu, 29 Jan 2015 12:11:30 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Goldfeld",
"Ziv",
""
],
[
"Permuter",
"Haim H.",
""
],
[
"Zaidel",
"Benjamin M.",
""
]
] |
new_dataset
| 0.979996 |
1304.1926
|
Rodrigo de Lamare
|
T. Peng, R. C. de Lamare and A. Schmeink
|
Distributed Space-Time Coding Based on Adjustable Code Matrices for
Cooperative MIMO Relaying Systems
|
6 figures
|
IEEE Transactions on Communications, 2013
|
10.1109/TCOMM.2013.043013.120788
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An adaptive distributed space-time coding (DSTC) scheme is proposed for
two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE)
receive filters and adjustable code matrices are considered subject to a power
constraint with an amplify-and-forward (AF) cooperation strategy. In the
proposed adaptive DSTC scheme, an adjustable code matrix obtained by a feedback
channel is employed to transform the space-time coded matrix at the relay node.
The effects of the limited feedback and the feedback errors are assessed.
Linear MMSE expressions are devised to compute the parameters of the adjustable
code matrix and the linear receive filters. Stochastic gradient (SG) and
least-squares (LS) algorithms are also developed with reduced computational
complexity. An upper bound on the pairwise error probability analysis is
derived and indicates the advantage of employing the adjustable code matrices
at the relay nodes. An alternative optimization algorithm for the adaptive DSTC
scheme is also derived in order to eliminate the need for the feedback. The
algorithm provides a fully distributed scheme for the adaptive DSTC at the
relay node based on the minimization of the error probability. Simulation
results show that the proposed algorithms obtain significant performance gains
as compared to existing DSTC schemes.
|
[
{
"version": "v1",
"created": "Sat, 6 Apr 2013 19:21:48 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Peng",
"T.",
""
],
[
"de Lamare",
"R. C.",
""
],
[
"Schmeink",
"A.",
""
]
] |
new_dataset
| 0.972391 |
1304.3519
|
Lin Wang
|
Lin Wang, Fa Zhang, Jordi Arjona Aroca, Athanasios V. Vasilakos, Kai
Zheng, Chenying Hou, Dan Li, Zhiyong Liu
|
GreenDCN: a General Framework for Achieving Energy Efficiency in Data
Center Networks
|
14 pages, accepted by IEEE JSAC
| null |
10.1109/JSAC.2014.140102
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The popularization of cloud computing has raised concerns over the energy
consumption that takes place in data centers. In addition to the energy
consumed by servers, the energy consumed by large numbers of network devices
emerges as a significant problem. Existing work on energy-efficient data center
networking primarily focuses on traffic engineering, which is usually adapted
from traditional networks. We propose a new framework to embrace the new
opportunities brought by combining some special features of data centers with
traffic engineering. Based on this framework, we characterize the problem of
achieving energy efficiency with a time-aware model, and we prove its
NP-hardness with a solution that has two steps. First, we solve the problem of
assigning virtual machines (VM) to servers to reduce the amount of traffic and
to generate favorable conditions for traffic engineering. The solution reached
for this problem is based on three essential principles that we propose.
Second, we reduce the number of active switches and balance traffic flows,
depending on the relation between power consumption and routing, to achieve
energy conservation. Experimental results confirm that, by using this
framework, we can achieve up to 50 percent energy savings. We also provide a
comprehensive discussion on the scalability and practicability of the
framework.
|
[
{
"version": "v1",
"created": "Fri, 12 Apr 2013 01:34:47 GMT"
},
{
"version": "v2",
"created": "Sun, 21 Jul 2013 05:17:17 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Wang",
"Lin",
""
],
[
"Zhang",
"Fa",
""
],
[
"Aroca",
"Jordi Arjona",
""
],
[
"Vasilakos",
"Athanasios V.",
""
],
[
"Zheng",
"Kai",
""
],
[
"Hou",
"Chenying",
""
],
[
"Li",
"Dan",
""
],
[
"Liu",
"Zhiyong",
""
]
] |
new_dataset
| 0.98991 |
1304.3553
|
Vincent Tan
|
Vincent Y. F. Tan
|
On the Reliability Function of the Discrete Memoryless Relay Channel
|
To appear in the IEEE Transactions on Information Theory; Presented
in part at the 2013 ISIT
| null |
10.1109/TIT.2015.2400999
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bounds on the reliability function for the discrete memoryless relay channel
are derived using the method of types. Two achievable error exponents are
derived based on partial decode-forward and compress-forward which are
well-known superposition block-Markov coding schemes. The derivations require
combinations of the techniques involved in the proofs of
Csisz\'ar-K\"orner-Marton's packing lemma for the error exponent of channel
coding and Marton's type covering lemma for the error exponent of source coding
with a fidelity criterion. The decode-forward error exponent is evaluated on
Sato's relay channel. From this example, it is noted that to obtain the fastest
possible decay in the error probability for a fixed effective coding rate, one
ought to optimize the number of blocks in the block-Markov coding scheme
assuming the blocklength within each block is large. An upper bound on the
reliability function is also derived using ideas from Haroutunian's lower bound
on the error probability for point-to-point channel coding with feedback.
|
[
{
"version": "v1",
"created": "Fri, 12 Apr 2013 07:01:28 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Jan 2014 07:20:11 GMT"
},
{
"version": "v3",
"created": "Tue, 23 Dec 2014 04:53:35 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Tan",
"Vincent Y. F.",
""
]
] |
new_dataset
| 0.993321 |
1304.7487
|
Alex Bazarsky
|
Alex Bazarsky, Noam Presman, Simon Litsyn
|
Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization
|
Accepted to 2013 IEEE Information Theory Workshop
| null |
10.1109/ITW.2013.6691250
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An algorithm for constructing Tanner graphs of non-binary irregular
quasi-cyclic LDPC codes is introduced. It employs a new method for selection of
edge labels allowing control over the code's non-binary ACE spectrum and
resulting in low error-floor. The efficiency of the algorithm is demonstrated
by generating good codes of short to moderate length over small fields,
outperforming codes generated by the known methods.
|
[
{
"version": "v1",
"created": "Sun, 28 Apr 2013 17:00:56 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Jul 2013 14:37:27 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Bazarsky",
"Alex",
""
],
[
"Presman",
"Noam",
""
],
[
"Litsyn",
"Simon",
""
]
] |
new_dataset
| 0.978866 |
1305.2245
|
Andrew Eckford
|
Andrew W. Eckford and Peter J. Thomas
|
Capacity of a Simple Intercellular Signal Transduction Channel
|
5 pages, 1 figure. To appear in the 2013 IEEE International Symposium
on Information Theory
| null |
10.1109/TIT.2016.2599178
| null |
cs.IT math.IT q-bio.CB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We model the ligand-receptor molecular communication channel with a
discrete-time Markov model, and show how to obtain the capacity of this
channel. We show that the capacity-achieving input distribution is iid;
further, unusually for a channel with memory, we show that feedback does not
increase the capacity of this channel.
|
[
{
"version": "v1",
"created": "Fri, 10 May 2013 02:02:36 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Eckford",
"Andrew W.",
""
],
[
"Thomas",
"Peter J.",
""
]
] |
new_dataset
| 0.996373 |
1305.5216
|
Mingyue Ji
|
Mingyue Ji, Giuseppe Caire, and Andreas F. Molisch
|
Wireless Device-to-Device Caching Networks: Basic Principles and System
Performance
|
35 pages; 13 figures; Revised version of the manuscript submitted to
IEEE Journal on Selected Areas in Communications, Special Issue on Device to
Device Communications in Cellular Networks
| null |
10.1109/JSAC.2015.2452672
| null |
cs.IT cs.MM cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As wireless video transmission is the fastest-growing form of data traffic,
methods for spectrally efficient video on-demand wireless streaming are
essential to service providers and users alike. A key property of video
on-demand is the asynchronous content reuse, such that a few dominant videos
account for a large part of the traffic, but are viewed by users at different
times. Caching of content on devices in conjunction with D2D communications
allows to exploit this property, and provide a network throughput that is
significantly in excess of both the conventional approach of unicasting from
the base station and the traditional D2D networks for regular data traffic.
This paper presents in a semi-tutorial concise form some recent results on the
throughput scaling laws of wireless networks with caching and asynchronous
content reuse, contrasting the D2D approach with a competing approach based on
combinatorial cache design and network coded transmission from the base station
(BS) only, referred to as coded multicasting. Interestingly, the spatial reuse
gain of the former and the coded multicasting gain of the latter yield, somehow
surprisingly, the same near-optimal throughput behavior in the relevant regime
where the number of video files in the library is smaller than the number of
streaming users. Based on our recent theoretical results, we propose a holistic
D2D system design that incorporates traditional microwave (2 GHz) as well as
millimeter-wave D2D links; the direct connections to the base station can be
used to provide those rare video requests that cannot be found in local caches.
We provide extensive simulations under a variety of system settings, and
compare our scheme with other existing schemes by the BS. We show that, despite
the similar behavior of the scaling laws, the proposed D2D approach offers very
significant throughput gains with respect to the BS-only schemes.
|
[
{
"version": "v1",
"created": "Wed, 22 May 2013 18:03:46 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Apr 2014 23:43:27 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Ji",
"Mingyue",
""
],
[
"Caire",
"Giuseppe",
""
],
[
"Molisch",
"Andreas F.",
""
]
] |
new_dataset
| 0.999107 |
1307.2800
|
Kai Chen
|
Kai Chen, Kai Niu, and Jiaru Lin
|
A Hybrid ARQ Scheme Based on Polar Codes
|
Submitted to IEEE Communications Letters
| null |
10.1109/LCOMM.2013.090213.131670
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A hybrid automatic repeat request (HARQ) scheme based on a novel class of
rate-compatible polar (\mbox{RCP}) codes are proposed. The RCP codes are
constructed by performing punctures and repetitions on the conventional polar
codes. Simulation results over binary-input additive white Gaussian noise
channels (BAWGNCs) show that, using a low-complexity successive cancellation
(SC) decoder, the proposed HARQ scheme performs as well as the existing schemes
based on turbo codes and low-density parity-check (LDPC) codes. The proposed
transmission scheme is only about 1.0-1.5dB away from the channel capacity with
the information block length of 1024 bits.
|
[
{
"version": "v1",
"created": "Wed, 10 Jul 2013 14:11:33 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Chen",
"Kai",
""
],
[
"Niu",
"Kai",
""
],
[
"Lin",
"Jiaru",
""
]
] |
new_dataset
| 0.999446 |
1307.3156
|
Tinku Rasheed
|
Riccardo Fedrizzi, Tinku Rasheed
|
Cooperative Short Range Routing for Energy Savings in Multi-Interface
Wireless Networks
|
Accepted at IEEE VTC-Spring Conference 2013, Dresden, June 2013
| null |
10.1109/VTCSpring.2013.6692491
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Energy efficiency in wireless networks has become an important field of
research due to ever increasing energy expenditure in battery supplied mobile
terminals. In this paper we present an energy efficient routing scheme for
multi-standard infrastructure wireless networks based on multi-hop cooperative
relaying. The aim of the proposed technique is to exploit short-range
cooperation to take benefit from mobile terminals having superior links thus
enable energy efficiency. Performance results show that higher data-rate
yielded by cooperation can compensate the expense of higher energy due to
multiple interfaces active on the same mobile terminal, making possible to
observe energy efficiency gain of the system. A maximum achievable energy
efficiency gain of up to 42 % was observed in our simulations when using the
cooperative short range routing technique.
|
[
{
"version": "v1",
"created": "Thu, 11 Jul 2013 16:03:53 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Fedrizzi",
"Riccardo",
""
],
[
"Rasheed",
"Tinku",
""
]
] |
new_dataset
| 0.991028 |
1307.7059
|
Dr. Nadeem Javaid
|
D. Mahmood, N. Javaid, S. Mahmood, S. Qureshi, A. M. Memon, T. Zaman
|
MODLEACH: A Variant of LEACH for WSNs
|
IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, France
| null |
10.1109/BWCCA.2013.34
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless sensor networks are appearing as an emerging need for mankind.
Though, Such networks are still in research phase however, they have high
potential to be applied in almost every field of life. Lots of research is done
and a lot more is awaiting to be standardized. In this work, cluster based
routing in wireless sensor networks is studied precisely. Further, we modify
one of the most prominent wireless sensor network's routing protocol "LEACH" as
modified LEACH (MODLEACH) by introducing \emph{efficient cluster head
replacement scheme} and \emph{dual transmitting power levels}. Our modified
LEACH, in comparison with LEACH out performs it using metrics of cluster head
formation, through put and network life. Afterwards, hard and soft thresholds
are implemented on modified LEACH (MODLEACH) that boast the performance even
more. Finally a brief performance analysis of LEACH, Modified LEACH (MODLEACH),
MODLEACH with hard threshold (MODLEACHHT) and MODLEACH with soft threshold
(MODLEACHST) is undertaken considering metrics of throughput, network life and
cluster head replacements.
|
[
{
"version": "v1",
"created": "Fri, 26 Jul 2013 15:05:33 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Mahmood",
"D.",
""
],
[
"Javaid",
"N.",
""
],
[
"Mahmood",
"S.",
""
],
[
"Qureshi",
"S.",
""
],
[
"Memon",
"A. M.",
""
],
[
"Zaman",
"T.",
""
]
] |
new_dataset
| 0.98704 |
1308.1144
|
Hessam Mahdavifar
|
Hessam Mahdavifar, Mostafa El-Khamy, Jungwon Lee, Inyup Kang
|
Performance Limits and Practical Decoding of Interleaved Reed-Solomon
Polar Concatenated Codes
|
Submitted to IEEE Transactions on Communications. arXiv admin note:
substantial text overlap with arXiv:1301.7491
| null |
10.1109/TCOMM.2014.050714.130602
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A scheme for concatenating the recently invented polar codes with non-binary
MDS codes, as Reed-Solomon codes, is considered. By concatenating binary polar
codes with interleaved Reed-Solomon codes, we prove that the proposed
concatenation scheme captures the capacity-achieving property of polar codes,
while having a significantly better error-decay rate. We show that for any
$\epsilon > 0$, and total frame length $N$, the parameters of the scheme can be
set such that the frame error probability is less than $2^{-N^{1-\epsilon}}$,
while the scheme is still capacity achieving. This improves upon
$2^{-N^{0.5-\epsilon}}$, the frame error probability of Arikan's polar codes.
The proposed concatenated polar codes and Arikan's polar codes are also
compared for transmission over channels with erasure bursts. We provide a
sufficient condition on the length of erasure burst which guarantees failure of
the polar decoder. On the other hand, it is shown that the parameters of the
concatenated polar code can be set in such a way that the capacity-achieving
properties of polar codes are preserved. We also propose decoding algorithms
for concatenated polar codes, which significantly improve the error-rate
performance at finite block lengths while preserving the low decoding
complexity.
|
[
{
"version": "v1",
"created": "Tue, 6 Aug 2013 00:06:21 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Mahdavifar",
"Hessam",
""
],
[
"El-Khamy",
"Mostafa",
""
],
[
"Lee",
"Jungwon",
""
],
[
"Kang",
"Inyup",
""
]
] |
new_dataset
| 0.978753 |
1309.5262
|
Eirik Rosnes
|
\'Angela I. Barbero, Eirik Rosnes, Guang Yang, and {\O}yvind Ytrehus
|
Near-Field Passive RFID Communication: Channel Model and Code Design
|
Submitted to IEEE Transactions on Communications. Accepted March 5,
2014
| null |
10.1109/TCOMM.2014.032314.130723
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper discusses a new channel model and code design for the
reader-to-tag channel in near-field passive radio frequency identification
(RFID) systems using inductive coupling as a power transfer mechanism. If the
receiver resynchronizes its internal clock each time a bit is detected, the
bit-shift channel used previously in the literature to model the reader-to-tag
channel needs to be modified. In particular, we propose a discretized Gaussian
shift channel as a new channel model in this scenario. We introduce the concept
of quantifiable error avoidance, which is much simpler than error correction.
The capacity is computed numerically, and we also design some new simple codes
for error avoidance on this channel model based on insights gained from the
capacity calculations. Finally, some simulation results are presented to
compare the proposed codes to the Manchester code and two previously proposed
codes for the bit-shift channel model.
|
[
{
"version": "v1",
"created": "Fri, 20 Sep 2013 13:22:44 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Mar 2014 08:02:02 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Barbero",
"Ángela I.",
""
],
[
"Rosnes",
"Eirik",
""
],
[
"Yang",
"Guang",
""
],
[
"Ytrehus",
"Øyvind",
""
]
] |
new_dataset
| 0.995755 |
1309.5546
|
Yang-Seok Choi
|
Yang-Seok Choi, Hooman Shirani-Mehr
|
Simultaneous Transmission and Reception: Algorithm, Design and System
Level Performance
|
20 pages. This manuscript will appear in the IEEE Transactions on
Wireless Communications
| null |
10.1109/TWC.2013.101713.121152
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Full Duplex or Simultaneous transmission and reception (STR) in the same
frequency at the same time can potentially double the physical layer capacity.
However, high power transmit signal will appear at receive chain as echoes with
powers much higher than the desired received signal. Therefore, in order to
achieve the potential gain, it is imperative to cancel these echoes. As these
high power echoes can saturate low noise amplifier (LNA) and also digital
domain echo cancellation requires unrealistically high resolution
analog-to-digital converter (ADC), the echoes should be cancelled or suppressed
sufficiently before LNA. In this paper we present a closed-loop echo
cancellation technique which can be implemented purely in analogue domain. The
advantages of our method are multiple-fold: it is robust to phase noise, does
not require additional set of antennas, can be applied to wideband signals and
the performance is irrelevant to radio frequency (RF) impairments in transmit
chain. Next, we study a few protocols for STR systems in carrier sense multiple
access (CSMA) network and investigate MAC level throughput with realistic
assumptions in both single cell and multiple cells. We show that STR can reduce
hidden node problem in CSMA network and produce gains of up to 279% in maximum
throughput in such networks. Finally, we investigate the application of STR in
cellular systems and study two new unique interferences introduced to the
system due to STR, namely BS-BS interference and UE-UE interference. We show
that these two new interferences will hugely degrade system performance if not
treated appropriately. We propose novel methods to reduce both interferences
and investigate the performances in system level.
|
[
{
"version": "v1",
"created": "Sun, 22 Sep 2013 00:49:14 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Choi",
"Yang-Seok",
""
],
[
"Shirani-Mehr",
"Hooman",
""
]
] |
new_dataset
| 0.993453 |
1311.1025
|
Marco Miozzo
|
Marco Miozzo, Davide Zordan, Paolo Dini and Michele Rossi
|
SolarStat: Modeling Photovoltaic Sources through Stochastic Markov
Processes
|
Submitted to IEEE EnergyCon 2014
| null |
10.1109/ENERGYCON.2014.6850501
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a methodology and a tool to derive simple but yet
accurate stochastic Markov processes for the description of the energy
scavenged by outdoor solar sources. In particular, we target photovoltaic
panels with small form factors, as those exploited by embedded communication
devices such as wireless sensor nodes or, concerning modern cellular system
technology, by small-cells. Our models are especially useful for the
theoretical investigation and the simulation of energetically self-sufficient
communication systems including these devices. The Markov models that we derive
in this paper are obtained from extensive solar radiation databases, that are
widely available online. Basically, from hourly radiance patterns, we derive
the corresponding amount of energy (current and voltage) that is accumulated
over time, and we finally use it to represent the scavenged energy in terms of
its relevant statistics. Toward this end, two clustering approaches for the raw
radiance data are described and the resulting Markov models are compared
against the empirical distributions. Our results indicate that Markov models
with just two states provide a rough characterization of the real data traces.
While these could be sufficiently accurate for certain applications, slightly
increasing the number of states to, e.g., eight, allows the representation of
the real energy inflow process with an excellent level of accuracy in terms of
first and second order statistics. Our tool has been developed using Matlab(TM)
and is available under the GPL license at[1].
|
[
{
"version": "v1",
"created": "Tue, 5 Nov 2013 12:12:30 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Miozzo",
"Marco",
""
],
[
"Zordan",
"Davide",
""
],
[
"Dini",
"Paolo",
""
],
[
"Rossi",
"Michele",
""
]
] |
new_dataset
| 0.990507 |
1311.1240
|
Adel M. Elmahdy
|
Adel M. Elmahdy, Sameh Sorour, and Karim G. Seddik
|
Generalized Instantly Decodable Network Coding for Relay-Assisted
Networks
|
5 pages, IEEE PIMRC 2013
| null |
10.1109/PIMRC.2013.6666427
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate the problem of minimizing the frame completion
delay for Instantly Decodable Network Coding (IDNC) in relay-assisted wireless
multicast networks. We first propose a packet recovery algorithm in the single
relay topology which employs generalized IDNC instead of strict IDNC previously
proposed in the literature for the same relay-assisted topology. This use of
generalized IDNC is supported by showing that it is a super-set of the strict
IDNC scheme, and thus can generate coding combinations that are at least as
efficient as strict IDNC in reducing the average completion delay. We then
extend our study to the multiple relay topology and propose a joint generalized
IDNC and relay selection algorithm. This proposed algorithm benefits from the
reception diversity of the multiple relays to further reduce the average
completion delay in the network. Simulation results show that our proposed
solutions achieve much better performance compared to previous solutions in the
literature.
|
[
{
"version": "v1",
"created": "Tue, 5 Nov 2013 22:21:06 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Oct 2014 11:00:21 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Elmahdy",
"Adel M.",
""
],
[
"Sorour",
"Sameh",
""
],
[
"Seddik",
"Karim G.",
""
]
] |
new_dataset
| 0.993976 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.