Packet Delay and Energy Consumption in Non-homogeneous Networks

This paper studies whether a packet will ultimately succeed in reaching a given destination, how long this will take and how much energy may be expended, in the context of a network with imperfect routing tables and non-homogeneous network characteristics. It also investigates the effect of non-cooperative routers that may actually choose to drop certain packets if they view them to be dangerous for destination nodes, as when packets may be carrying worms, viruses or malware, and when certain packets have been identified as being part of a Denial of Service attack. The approach we take is to construct a probability model for packet travel from a source to destination node in a large non-homogeneous multiple hop network. The randomness models the lack of precise routing information at each of the network hops, and randomness in routing can also be used to model networks where one wishes to explore alternate paths in a network to discover the more reliable paths, or those that may have other desirable characteristics such as lower delay or lower packet loss. We assume that each packet has the same time out: when the time-out elapses, the packet is dropped if it has not yet reached the destination, and some time later the source will retransmit a duplicate packet. A numerical–analytical solution is developed to compute the average travel time of the packet from source to destination and to estimate its total energy consumption. Two applications of these results are then presented. In the first one, the packet is an ‘attack’ packet (e.g. a Denial of Service packet, or some malware) and as it approaches the destination node it is being frequently inspected by routers that may decide to drop it if they correctly detect that it is a threat. The second example considers a wireless network where areas which are remote from the source and destination nodes have poorer wireless coverage so that packet losses become more frequent as the packet ‘unknowingly’ (due to poor routing tables errors) meanders away from the main coverage area. Other applications in wireless networks are also provided and a simulation study is performed to validate the analytical model.

[1]  E. Gelenbe,et al.  Travel delay in a large wireless ad hoc network , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[2]  P. L. Krapivsky,et al.  Survival of an evasive prey , 2009, Proceedings of the National Academy of Sciences.

[3]  Erol Gelenbe,et al.  A diffusion model for packet travel time in a random multihop medium , 2007, TOSN.

[4]  Gordon F. Newell,et al.  Applications of queueing theory , 1971 .

[5]  Gwillerm Froc,et al.  On the Data Delivery Delay taken by Random Walks in Wireless Sensor Networks , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[6]  Roberto Beraldi Random walk with long jumps for wireless ad hoc networks , 2009, Ad Hoc Networks.

[7]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[8]  Nicolas E. Humphries,et al.  Environmental context explains Lévy and Brownian movement patterns of marine predators , 2010, Nature.

[9]  Erol Gelenbe,et al.  A Unified Approach to the Evaluation of a Class of Replacement Algorithms , 1973, IEEE Transactions on Computers.

[10]  Stanislav Volkov,et al.  Packet delay in models of data networks , 2001, TOMC.

[11]  H. Stanley,et al.  Optimizing the success of random searches , 1999, Nature.

[12]  Erol Gelenbe,et al.  A probability model of uncertainty in data bases , 1986, 1986 IEEE Second International Conference on Data Engineering.

[13]  Roberto Beraldi,et al.  Low hitting time random walks in wireless networks , 2009, Wirel. Commun. Mob. Comput..

[14]  Gordon F. Newell,et al.  Applications of queueing theory , 1971 .

[15]  E. Gelenbe Search in unknown random environments. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  H. Wio,et al.  Intermittent search strategies revisited: effect of the jump length and biased motion , 2010 .

[17]  Wenjiang Pei,et al.  First passage time of multiple Brownian particles on networks with applications , 2008 .

[18]  Erol Gelenbe,et al.  Packets travelling in non-homogeneous networks , 2011, MSWiM '11.

[19]  P. Mazur On the theory of brownian motion , 1959 .

[20]  Erol Gelenbe,et al.  On Approximate Computer System Models , 1975, JACM.

[21]  Erol Gelenbe,et al.  Diffusion Based Statistical Call Admission Control in ATM , 1996, Perform. Evaluation.

[22]  Erol Gelenbe,et al.  Steps toward self-aware networks , 2009, CACM.

[23]  Erol Gelenbe,et al.  Global behavior of homogeneous random neural systems , 1991 .

[24]  Nicolas E. Humphries,et al.  Scaling laws of marine predator search behaviour , 2008, Nature.

[25]  Erol Gelenbe,et al.  Autonomous search for mines , 1998, Eur. J. Oper. Res..

[26]  H E Stanley,et al.  Towards design principles for optimal transport networks. , 2010, Physical review letters.

[27]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[28]  Michele Garetto,et al.  Modeling the performance of wireless sensor networks , 2004, IEEE INFOCOM 2004.

[29]  Beraldi Roberto,et al.  Low hitting time random walks in wireless networks , 2009 .

[30]  J. Medhi,et al.  Stochastic models in queueing theory , 1991 .

[31]  Ahmed Helmy,et al.  Small worlds in wireless networks , 2003, IEEE Communications Letters.

[32]  Bruce Hajek,et al.  Minimum Mean Hitting Times of Brownian Motion with Constrained Drift , 2001 .

[33]  O. Bénichou,et al.  Dynamical and spatial disorder in an intermittent search process , 2009 .

[34]  Tadeusz Czachórski,et al.  Diffusion Approximation Model for the Distribution of Packet Travel Time at Sensor Networks , 2008, EuroNGI Workshop.

[35]  G. Viswanathan,et al.  Lévy flights and superdiffusion in the context of biological encounters and random searches , 2008 .

[36]  Mingyan Liu,et al.  Hitting time analysis for a class of random packet forwarding schemes in ad hoc networks , 2009, Ad Hoc Networks.

[37]  A. Grosberg,et al.  First passage time distribution for the 1D diffusion of particles with internal degrees of freedom , 2009 .

[38]  Roberto Beraldi Biased Random Walks in Uniform Wireless Networks , 2009, IEEE Transactions on Mobile Computing.

[39]  Erol Gelenbe,et al.  Search in non-homogenous random environments? , 2011, PERV.

[40]  Erol Gelenbe,et al.  Probabilistic models of computer systems , 1976, SIGMETRICS '76.

[41]  Azzedine Boukerche,et al.  Close-to-optimal energy balanced data propagation via limited, local network density information , 2011, MSWiM '11.

[42]  W. Ebeling,et al.  Active Brownian particles with energy depots modeling animal mobility. , 1999, Bio Systems.

[43]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[44]  Qi Han,et al.  Performance of Random Routing on Grid-Based Sensor Networks , 2009, 2009 6th IEEE Consumer Communications and Networking Conference.

[45]  Ralf Metzler,et al.  And did he search for you, and could not find you? , 2009 .

[46]  F. Schweitzer Active Brownian Particles with Internal Energy Depot , 2000 .

[47]  Sanjay Shakkottai Asymptotics of search strategies over a sensor network , 2005, IEEE Transactions on Automatic Control.