On the utility of network coding in dynamic environments
Abstract
Many wireless applications, such as ad-hoc networks and sensor networks, require decentralized operation in dynamically varying environments. We consider a distributed randomized network coding approach that enables efficient decentralized operation of multi-source multicast networks. We show that this approach provides substantial benefits over traditional routing methods in dynamically varying environments. We present a set of empirical trials measuring the performance of network coding versus an approximate online Steiner tree routing approach when connections vary dynamically. The results show that network coding achieves superior performance in a significant fraction of our randomly generated network examples. Such dynamic settings represent a substantially broader class of networking problems than previously recognized for which network coding shows promise of significant practical benefits compared to routing.
Additional Information
© Copyright 2004 IEEE. Reprinted with permission. This research is supported in part by NSF Grants CCR-0325324, CCR-0220039 and CCR-0325496, University of Illinois subaward #03-25673, Hewlett-Packard 008542-008. and Caltech's Lee Center for Advanced Networking.Files
Name | Size | Download all |
---|---|---|
md5:9d2d667e2469db06e8cab15bc3a35d36
|
929.8 kB | Preview Download |
Additional details
- Eprint ID
- 7380
- Resolver ID
- CaltechAUTHORS:HOTiwwan04
- Created
-
2007-02-07Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field