Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(7)
Computational Complexity
Internet Architecture
Network Coding
Network Topology
Upper Bound
Wireless Network
Real Time
Subscribe
Academic
Publications
Performance of wireless network coding: motivating small encoding numbers
Performance of wireless network coding: motivating small encoding numbers,Computing Research Repository,Petteri Mannersalo,Georgios S. Paschos,Lazaros
Edit
Performance of wireless network coding: motivating small encoding numbers
BibTex

RIS

RefWorks
Download
Petteri Mannersalo
,
Georgios S. Paschos
,
Lazaros Gkatzikis
This paper focuses on a particular transmission scheme called local network coding, which has been reported to provide significant performance gains in practical wireless networks. The performance of this scheme strongly depends on the
network topology
and thus on the locations of the wireless nodes. Also, it has been shown previously that finding the encoding strategy, which achieves maximum performance, requires complex calculations to be undertaken by the wireless node in realtime. Both deterministic and random point pattern are explored and using the Boolean connectivity model we provide upper bounds for the maximum coding number, i.e., the number of packets that can be combined such that the corresponding receivers are able to decode. For the models studied, this
upper bound
is of order of $\sqrt{N}$, where $N$ denotes the (mean) number of neighbors. Moreover, achievable coding numbers are provided for gridlike networks. We also calculate the multiplicative constants that determine the gain in case of a small network. Building on the above results, we provide an analytic expression for the
upper bound
of the efficiency of local network coding. The conveyed message is that it is favorable to reduce
computational complexity
by relying only on small encoding numbers since the resulting expected throughput loss is negligible.
Journal:
Computing Research Repository  CORR
, vol. abs/1010.0, 2010
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.informatik.unitrier.de
)
(
arxiv.org
)
(
adsabs.harvard.edu
)
References
(16)
On the Scaling Law of Network Coding Gains in Wireless Networks
(
Citations: 15
)
Ebad Ahmed
,
Atilla Eryilmaz
,
Muriel Medard
,
Asuman E. Ozdaglar
Conference:
MILCOM, Military Communications Conference  MILCOM
, 2007
The maximum size of a convex polygon in a restricted set of points in the plane
(
Citations: 9
)
N. Alon
,
M. Katchalski
,
W. R. Pulleyblank
Journal:
Discrete & Computational Geometry  DCG
, vol. 4, no. 1, pp. 245251, 1989
Adaptive network coding and scheduling for maximizing throughput in wireless networks
(
Citations: 66
)
Prasanna Chaporkar
,
Alexandre Proutiere
Conference:
Mobile Computing and Networking  MOBICOM
, pp. 135146, 2007
Efficient algorithms for Index Coding
(
Citations: 15
)
M. A. R. Chaudhry
,
A. Sprintson
Published in 2008.
Connectivity in adhoc and hybrid networks
(
Citations: 287
)
Olivier Dousse
,
Patrick Thiran
,
Martin Hasler
Conference:
IEEE INFOCOM  INFOCOM
, vol. 2, pp. 10791088 vol.2, 2002