Sporadic Associated Mobile Networks with Auto Adjust Dispute Realisation Routing Protocol

3 Abstract— For Delay Resistant Networks that are perhaps compiled of an immense number of devices in miniature such as smart phones of heterogeneous capacities in price of energy resources and buffer spaces, this paper introduces a modern multi-copy routing protocol, called Auto Adjust Utility-based Routing Protocol (AAURP). An entourage of environment parameters, such as wireless channel condition, nodal buffer occupancy, and encounter statistics, are collectively considered to characterize AAURP for the ability to name possible chances for forwarding messages to the destination via a modern function utility based mechanism. Thus, AAURP can reroute messages around nodes feeling high buffer occupancy, wireless noise and congestion, while taking a substantially small amount of transmissions. In AAURP, the developed utility function is proved to be able to achieve optimal performance, which is further examined via a random modelling approach. To verify the formulated analytical model and compare the suggested AAURP wide simulations are conducted with a number of recently reported encounter-based routing approaches in terms of delivery ratio, delivery delay, and the number of transmissions needed for the message delivery. The simulation results show that AAURP outstrips all the counterpart multi-copy encounter-based routing protocols conceived in the study.

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

[2]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[3]  VojnovicMilan,et al.  Power Law and Exponential Decay of Intercontact Times between Mobile Devices , 2010 .

[4]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[5]  Mads Haahr,et al.  Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs , 2009, IEEE Transactions on Mobile Computing.

[6]  Injong Rhee,et al.  Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[7]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[8]  Jie Wu,et al.  Predict and relay: an efficient routing in disruption-tolerant networks , 2009, MobiHoc '09.

[9]  Cecilia Mascolo,et al.  CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks , 2009, IEEE Transactions on Mobile Computing.

[10]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[11]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[12]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.

[13]  Paul A. S. Ward,et al.  Practical Routing in Delay-Tolerant Networks , 2005, IEEE Transactions on Mobile Computing.

[14]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[15]  Vijay Erramilli,et al.  Forwarding in opportunistic networks with resource constraints , 2008, CHANTS '08.

[16]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[17]  Lixin Gao,et al.  Cooperative Robust Forwarding Scheme in DTNs using Erasure Coding , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[18]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[19]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[20]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM 2007.

[21]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[22]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[23]  Haiying Shen,et al.  Utility-Based Distributed Routing in Intermittently Connected  Networks , 2008, 2008 37th International Conference on Parallel Processing.

[24]  Robin Kravets,et al.  Encounter: based routing in DTNs , 2009, MOCO.

[25]  Qian Zhang,et al.  Shortest path routing in partially connected ad hoc networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[26]  Elizabeth M. Daly,et al.  Social networking feeds: recommending items of interest , 2010, RecSys '10.

[27]  Sagar Naik,et al.  A Socially-Based Routing Protocol for Delay Tolerant Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[28]  Cauligi S. Raghavendra,et al.  Performance analysis of mobility-assisted routing , 2006, MobiHoc '06.

[29]  Marco Conti,et al.  HiBOp: a History Based Routing Protocol for Opportunistic Networks , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[30]  Jie Wu,et al.  MOPS: Providing Content-Based Service in Disruption-Tolerant Networks , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[31]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

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

[33]  Pin-Han Ho,et al.  ARBR: Adaptive reinforcement-based routing for DTN , 2010, 2010 IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications.

[34]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[35]  Pin-Han Ho,et al.  SARP - A Novel Multi-Copy Routing Protocol for Intermittently Connected Mobile Networks , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[36]  Thierry Turletti,et al.  Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations , 2009, IEEE Transactions on Mobile Computing.

[37]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[38]  Thrasyvoulos Spyropoulos,et al.  Optimal Buffer Management Policies for Delay Tolerant Networks , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[39]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[40]  Jean-Yves Le Boudec,et al.  Power Law and Exponential Decay of Intercontact Times between Mobile Devices , 2007, IEEE Transactions on Mobile Computing.

[41]  Wu Wei,et al.  Feedback Adaptive Routing Algorithm for DTN , 2009, 2009 WRI International Conference on Communications and Mobile Computing.

[42]  Konstantinos Psounis,et al.  Contention-Aware Performance Analysis of Mobility-Assisted Routing , 2009, IEEE Transactions on Mobile Computing.