NDLI: Data exchange problem with helpers

Content Provider	IEEE Xplore Digital Library
Author	Milosavljevic, N. Pawar, S. Rouayheb, S.E. Gastpar, M. Ramchandran, K.
Copyright Year	2012
Description	Author affiliation: Department of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, CA 94720 USA (Milosavljevic, N.; Pawar, S.; Gastpar, M.; Ramchandran, K.) \|\| Department of Electrical Engineering, Princeton University, Princeton, NJ 08544 USA (Rouayheb, S.E.)
Abstract	In this paper we construct a deterministic polynomial time algorithm for the problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge of the file. We further assume the existence of another set of terminals in the system, called helpers, who are not interested in the common file, but who are willing to help the users. Given that the collective information of all the terminals is sufficient to allow recovery of the entire file, the goal is to minimize the (weighted) sum of bits that these terminals need to exchange over a noiseless public channel in order achieve this goal. Based on established connections to the multi-terminal secrecy problem, our algorithm also implies a polynomial-time method for constructing the largest shared secret key in the presence of an eavesdropper. We consider the following side-information settings: (i) side-information in the form of uncoded packets of the file, where the terminals' side-information consists of subsets of the file packets; (ii) side-information in the form of linearly correlated packets, where the terminals have access to linear combinations of the file packets; and (iii) the general setting where the the terminals' side-information has an arbitrary (i.i.d.) correlation structure. We provide a polynomial-time algorithm (in the number of terminals) that finds the optimal rate allocations for these terminals, and then determines an explicit optimal transmission scheme for cases (i) and (ii).
Starting Page	2611
Ending Page	2615
File Size	177582
Page Count	5
File Format	PDF
ISBN	9781467325806
ISSN	21578117
e-ISBN	9781467325790
e-ISBN	9781467325783
DOI	10.1109/ISIT.2012.6283991
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-07-01
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vectors Base stations Optimization Polynomials Encoding Resource management Wireless communication
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient algorithms for the data exchange problem under fairness constraints

Deterministic algorithm for the cooperative data exchange problem

Distributed optimization in heterogeneous networks with proportional fairness

Energy-efficient downlink transmission with base station closing in small cell networks

FemtoCaching: Wireless video content delivery through distributed caching helpers

Algorithms for weakly secure data exchange

Resource allocation in OFDMA-based multicast systems

Joint power control and resource scheduling in wireless heterogeneous networks

Cognitive Multihoming: Maximizing Network Utility over CR-Assisted Cellular Network

Data exchange problem with helpers

Similar Documents

Efficient algorithms for the data exchange problem under fairness constraints

Deterministic algorithm for the cooperative data exchange problem

Distributed optimization in heterogeneous networks with proportional fairness

Energy-efficient downlink transmission with base station closing in small cell networks

FemtoCaching: Wireless video content delivery through distributed caching helpers

Algorithms for weakly secure data exchange

Resource allocation in OFDMA-based multicast systems

Joint power control and resource scheduling in wireless heterogeneous networks

Cognitive Multihoming: Maximizing Network Utility over CR-Assisted Cellular Network

Data exchange problem with helpers