Abstract

Some forms of ad-hoc networks need to operate in extremely performance-challenged environments where end-to-end connectivity is rare. Such environments can be found for example in very sparse mobile networks where nodes ”meet ” only occasionally and are able to exchange information, or in wireless sensor networks where nodes sleep most of the time to conserve energy. Forwarding mechanisms in such networks usually resort to some form of intelligent flooding, as for example in probabilistic routing. We propose a communication algorithm that significantly reduces the overhead of probabilistic routing algorithms, making it a suitable building block for a delay-tolerant network architecture. Our forwarding scheme is based on network coding. Nodes do not simply forward packets they overhear but may send out information that is coded over the contents of several packets they received. We show by simulation that this algorithm achieves the reliability and robustness of flooding at a small fraction of the overhead.

Citations

698	Network information flow - Ahlswede, Cai, et al. - 2000
413	A Delay-tolerant Network Architecture for Challenged Internets - Fall - 2003
400	Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet - Juang, Oki, et al. - 2002
368	Linear network coding - Li, Yeung, et al. - 2003
340	An algebraic approach to network coding - Koetter, Médard - 2003
330	Epidemic Routing for Partially Connected Ad Hoc Networks - Vahdat, Becker - 2000
315	Routing in a delay tolerant network - Jain, Fall, et al. - 2004
271	Probabilistic routing in intermittently connected networks - Lindgren, Doria, et al. - 2004
244	A Survey of Gossiping and Broadcasting in Communication Networks - Hedetniemi, Hedetniemi, et al. - 1988
219	L.: Gossip-based ad hoc routing - Haas, Halpern, et al.
186	Efficient erasure correcting codes - Luby, Mitzenmacher, et al.
184	Practical Network Coding - Chou, Wu, et al. - 2003
116	Polynomial time algorithms for multicast network code construction,” Information Theory - Jaggi, Sanders, et al. - 1973
104	On randomized network coding - Ho, Medard, et al. - 2003
97	Probabilistic Broadcast for Flooding in Wireless Mobile Ad Hoc Networks - Sasson, Carin, et al. - 2003
89	Route driven gossip: Probabilistic reliable multicast in ad hoc networks - Luo, Eugster, et al. - 2003
78	Polynomial Time Algorithms for Network Information Flow - Sanders, Egner, et al.
64	More flexible exponentiation with precomputation - Lim, Lee - 1994
62	Minimum-Energy Multicast in Mobile Ad-hoc Networks Using Network Coding - Wu, Chou, et al. - 2005
58	Epidemic information dissemination in distributed systems - Eugster, Guerraoui, et al.
19	Boudec. Energy-efficient broadcasting in wireless ad-hoc networks - Widmer, Fragouli, et al. - 2005
15	Survivable mobile wireless networks: issues - Sterbenz, Krishnan, et al.
7	Messaging in difficult environments - Fall - 2004
1	On the utility of network coding in dynamic enviornments - Ho, Leong, et al. - 2004
1	Route driven gossip: 7 reliable multicast in ad hoc networks - Luo, Eugster, et al. - 2003