Cart (Loading....) | Create Account
Close category search window
 

Secure Network Coding with a Cost Criterion

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jianlong Tan ; Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139, USA, E-mail: jianlong@mit.edu ; Medard, M.

Network cost and network security are two of many network parameters that are important to network users. While these two parameters have been separately considered in coded networks (networks that employ network coding), a joint investigation of them both has not been done yet to our knowledge, thus providing the motivation for this work. In this paper, we consider the situation where a set of messages is to be multi-casted across the network, and a known subset of these messages is of interest to a wiretapping adversary. The problem that we attempt to solve is to find a network coding scheme that has both a low network cost and a low probability of the wiretapper being able to retrieve all the messages of interest. We make use of random linear codes in anticipation for decentralized implementation of the scheme, and focus on the problem of finding the multicast subgraph. As an exact algorithmic solution is difficult, we propose two heuristic solutions, and compare their performances to traditional routing through a simulation study. Our results suggest that network coding can be more effective than routing for this low cost and secure data multicast problem, especially when the links are not easily tapped.

Published in:

Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2006 4th International Symposium on

Date of Conference:

03-06 April 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.