Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Ditto: a system for opportunistic caching in multi-hop wireless networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
Aziala-net: deploying a scalable multi-hop wireless testbed platform for research purposes
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
Error-resilient scalable compression based on distributed video coding
Image Communication
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Application-centric routing for video streaming over multi-hop wireless networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
IEEE Transactions on Information Theory
Proxy caching for media streaming over the Internet
IEEE Communications Magazine
Multihop Ad Hoc Networking: The Theory
IEEE Communications Magazine
Multihop Ad Hoc Networking: The Reality
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Hi-index | 0.03 |
This paper studies the distributed caching managements for the current flourish of the streaming applications in multihop wireless networks. Many caching managements to date use randomized network coding approach, which provides an elegant solution for ubiquitous data accesses in such systems. However, the encoding, essentially a combination operation, makes the coded data difficult to be changed. In particular, to accommodate new data, the system may have to first decode all the combined data segments, remove some unimportant ones, and then reencode the data segments again. This procedure is clearly expensive for continuously evolving data storage. As such, we introduce a novel Cooperative Coding and Caching (3) scheme, which allows decoding-free data removal through a triangle-like codeword organization. Its decoding performance is very close to the conventional network coding with only a sublinear overhead. Our scheme offers a promising solution to the caching management for streaming data.