Performance Analysis of Self Limiting Epidemic Forwarding

Self limiting epidemic forwarding is a method of epidemic information dissemination in wireless ad-hoc networks that achieves congestion control by limiting spread (i.e. the number of nodes that receive a given message) and injection rate in order to preserve a meaningful service. We analyze the performance of various methods for spread control: on one hand, the classical method, which consists in decrementing the TTL of a packet when it is transmitted, on the other hand, two methods based on ``aging", where the TTL of a packet may be decremented while it is waiting for transmission in the epidemic buffer. The aging methods are: (selective aging) decrement TTL of a waiting packet when a duplicate is received and (global aging) decrement when any packet is received. The performance metrics are based on injection rates of messages, on amount of redundant information and on spread. We use detailed, realistic simulation for medium scale networks (up to 800 nodes); for networks of any size, we use an analytical method based on fluid approximation and solution of a fixed point problem. We find that the classical method does not perform well. Selective aging improves the performance, and global aging performs much better; it manages to control the spread so that the rate of injection remains good with fixed parameters across a wide range of settings.

[1]  Marco Conti,et al.  Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit , 2000, TNET.

[2]  Christian Becker,et al.  An epidemic model for information diffusion in MANETs , 2002, MSWiM '02.

[3]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[4]  Kevin C. Almeroth,et al.  Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding in Sparse Mobile Networks , 2005, NETWORKING.

[5]  D. Freedman Introduction to Continuous Time , 1983 .

[6]  C. Gardiner Handbook of Stochastic Methods , 1983 .

[7]  Pan Hui,et al.  Haggle: A networking architecture designed around mobile users , 2006 .

[8]  Sachin Katti,et al.  The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments , 2005 .

[9]  Kevin C. Almeroth,et al.  Coupons: wide scale information distribution for wireless ad hoc networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[10]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.

[11]  Alireza Keshavarz-Haddad,et al.  Broadcast capacity in multihop wireless networks , 2006, MobiCom '06.

[12]  Ashok K. Agrawala,et al.  Sniffing out the correct physical layer capture model in 802.11b , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[13]  Jie Wu,et al.  Broadcasting in Ad Hoc Networks Based on Self-Pruning , 2003, Int. J. Found. Comput. Sci..

[14]  Jean-Yves Le Boudec,et al.  Self-Limiting Epidemic Forwarding , 2006 .

[15]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.