Efficient routing based on past information to predict the future location for message passing in infrastructure-less opportunistic networks

详细信息    查看全文

• 作者：Sanjay K. Dhurandher ; Deepak Kumar Sharma ; Isaac Woungang…
• 关键词：Opportunistic networks ; Infrastructure ; less protocols ; Delay tolerant networks ; The ONE simulator
• 刊名：The Journal of Supercomputing
• 出版年：2015
• 出版时间：May 2015
• 年：2015
• 卷：71
• 期：5
• 页码：1694-1711
• 全文大小：1,570 KB
• 参考文献：1.Chen TT, Lee M (2008) Ubiquitous Computing in Prospect: A bibliographic study. In: Preceedings of International Symposium on Ubiquitous Multimedia Computing (UMC 鈥?8). Hobart, ACT 13鈥?5, pp 57鈥?2
  2.Lilien L, Kamal ZH, Bhuse V, Gupta A (2006) Opportunistic networks: the concept and research challenges in privacy and security.In: Proceedings Of NSF Intl. Workshop on research challenges in security and privacy for mobile and wirelessnetworks (WSPWN 2006), Miami, March 2006, pp 134鈥?47
  3.Mangrulkar RS, Atique M (2010) Routing protocol for delay tolerant network: a survey and comparison. In: Proceedings of IEEE International Conf. on Communication Control and Computing Technologies, Ramanathapuram, India, 7鈥? Oct. 2010, pp 210鈥?15
  4.Dhurandher SK, Sharma DK, Woungang I, Chao HC (2011) Performance evaluation of various routing protocols in opportunistic networks. In: Proceedings of IEEE GLOBECOM Workshop 2011, Houston, Texas, USA, 5鈥? December, 2011, pp 1067鈥?071
  5.Huang C-M, Lan K-C, Tsai C-Z (2008) A survey of opportunistic networks. In: proceedings of the 22nd Intl. Conference on advanced information networking and applications鈥攚orkshops, 2008 (AINAW 2008), Okinawa, Japan, 25鈥?8 March, 2008, pp 1672鈥?677
  6.Okasha S (December 2005) Altruism, group selection and correlated interaction. Br J Philos Sci 56(4):703鈥?25
  7.Pelusi L, Passarella A, Conti M (2006) Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun Mag 44(11):134鈥?41View Article
  8.Vahdat, Becker D (2000) Epidemic routing for partially connected ad hoc networks. Technical Report CS-2000-06, Department of Computer Science, Duke University, Durham, NC, 2000
  9.Lindgren A, Doria A, Schelen O (2003) Probabilistic routing in intermittently connected networks. ACM SIGMOBILE. Mob Comput Commun Rev 7(3):19鈥?0View Article
  10.Huang T-K, Lee C-K, Chen L-Jyh (2010) PRoPHET+: an adaptive PRoPHET-based routing protocol for opportunistic network. In: proceedings of 24th IEEE International Conference on Advanced Information Networking and Applications (AINA 2010), Perth, Australia, 20鈥?3 April 2010, pp 112鈥?19
  11.Boldrini C, Conti M, Iacopini I, Passarella A (2007) HiBOp: a history based routing protocol for opportunistic networks. In proceedings Of IEEE International Symposium on World of Wireless, Mobile and Multimedia Networks, 2007 (WoWMoM 2007), Espoo, Finland, 18鈥?1 June 2007, pp 1鈥?2
  12.Kathiravelu T, Ranasinghe N, Pears A (2010) A robust proactive routing protocol for intermittently connected opportunistic networks. In proceedings of Seventh IEEE International Conference on Wireless And Optical Communications Networks (WOCN 2010), Colombo, Sri Lanka, 6鈥? Sept. 2010, pp 1鈥?
  13.Spyropoulos T, Psounis K, Raghavendra CS (2005) Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: proceedings of SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia, USA 22鈥?6: pp 252鈥?59
  14.Makhlouta J, Harkous H, Hutayt F, Artail H (2011) Adaptive fuzzy apray and wait: efficient routing for opportunistic networks. In: proceedings of IEEE International Conference on Selected Topics in Mobile and Wireless Networking (iCOST), Shanghai, China, 10鈥?2 October, 2011, pp 64鈥?9
  15.McNeff JG (2002) The global positioning system. Proc IEEE Trans Microw Theor Tech 50(3):645鈥?52View Article
  16.Ross SM (2006) Introduction to probability models. Academic Press, 2006, ISBN: 0123756871, 9780123756879
  17.Chen I-CK, Coffey JT, Mudge TN (1996) Analysis of branch prediction via data compression. In: proceedings of the seventh international conference on Architectural support for programming languages and operating systems (ASPLOS VII). Cambridge, Massachusetts, USA 1鈥?: pp 128鈥?37
  18.Keranen (2008) Opportunistic network environment simulator. Special Assignment Report, Helsinki University of Technology, Department of Communications and Networking, May 2008
  19.Dhurandher SK, Sharma DK, Woungang I, Bhati S (2013) HBPR: history based prediction for routing in infrastructure-less opportunistic networks. In: Proceedings of IEEE 27th International Conference on Advanced Information Networking and Applications (AINA 2013), Barcelona, Spain, 25鈥?8 March, 2013, pp 931鈥?36
  
• 作者单位：Sanjay K. Dhurandher (1)
  Deepak Kumar Sharma (2)
  Isaac Woungang (3)
  Aakanksha Saini (1)
  
  1. CAITFS, Division of Information Technology, Netaji Subas Institute of Technology, University of Delhi, New Delhi, India
  2. Division of Computer Engineering, Netaji Subas Institute of Technology, University of Delhi, New Delhi, India
  3. Department of Computer Science, Ryerson University, Toronto, ON, Canada
  
• 刊物类别：Computer Science
• 刊物主题：Programming Languages, Compilers and Interpreters
  Processor Architectures
  Computer Science, general
  
• 出版者：Springer Netherlands
• ISSN：1573-0484

文摘

Opportunistic network (OppNet) is the recent evolution of mobile ad-hoc networks that has emerged as an active research subject in recent times. High mobility, frequent disconnections, sparse connectivity, no infrastructure, and limited resources are considered to be norms rather than hindrances. Hence, the challenges that one is likely to face while routing in opportunistic networks are very different from those faced in traditional wireless networks. Routing being the biggest challenge in such networks leads us to propose a new history-based prediction routing (HBPR) protocol for infrastructure-less OppNets which uses the behavioral information of the nodes to make predictions about their movements in the network. This helps to find and select a better next hop for the message to be routed to the destination. It also incorporates a method for the acknowledgment of the received messages, which helps in the buffer management of the intermediate nodes. Through simulations, the performance of HBPR is compared against popular solutions such as epidemic routing and Probabilistic routing protocol using history of encounters and transitivity, using the custom human mobility model. The HBPR performs fairly well in terms of number of messages delivered, average residual energy, overhead ratio, and average latency.