Call for Paper - March 2023 Edition
IJCA solicits original research papers for the March 2023 Edition. Last date of manuscript submission is February 20, 2023. Read More

On the Delivery Likelihood of Two-Hop Relay MANETs using Erasure Cryptography

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2016
Authors:
Prema Somani, B.M. Patil
10.5120/ijca2016909443

Prema Somani and B M Patil. Article: On the Delivery Likelihood of Two-Hop Relay MANETs using Erasure Cryptography. International Journal of Computer Applications 139(14):18-22, April 2016. Published by Foundation of Computer Science (FCS), NY, USA. BibTeX

@article{key:article,
	author = {Prema Somani and B.M. Patil},
	title = {Article: On the Delivery Likelihood of Two-Hop Relay MANETs using Erasure Cryptography},
	journal = {International Journal of Computer Applications},
	year = {2016},
	volume = {139},
	number = {14},
	pages = {18-22},
	month = {April},
	note = {Published by Foundation of Computer Science (FCS), NY, USA}
}

Abstract

In this proposed method a new routing protocol is Self-Adaptive on demand Geographic routing protocols. One of the distinctive features has provide reliable and energy efficient feature to existing schemes in order to increase the lifetime of the network and reduces control overhead compute up to the proactive schemes which provides reliable routing at the same time with a lesser amount of energy utilization. We are embedding optimization (Marko chain algorithm) on the delivery probability performance in a two-hop relay algorithm with erasure coding. The erasure coding used for the message that is erasure coded into multiple frames at source node. Also we developed finite-state Markov chain model to characterize the complicated message delivery process in the MANETs. Based on the above model, closed-form expressions are further derived for the corresponding message delivery probability under any given message lifetime and message size. The above concept is verified through simulation studies, which can be used to accurately predict the message delivery probability behavior and characterize its relationship with the message size.

References

  1. A. Goldsmith, M. Effros, R. Koetter, M. Medard, A. Ozdaglar, andL. Zheng, “Beyond Shannon: the quest for fundamental performancelimits of wireless ad hoc networks,” IEEE Commun. Mag., vol. 49,no. 5, pp. 195–205, May 2011.
  2. J. Andrews, S. Shakkottai, R. Heath, N. Jindal, M. Haenggi, R. Berry,D. Guo, M. Neely, S. Weber, S. Jafar, and A. Yener, “Rethinkinginformation theory for mobile ad hoc networks,” IEEE Commun. Mag., vol. 46, no. 12, pp. 94–101, Dec. 2008.
  3. R. Groenevelt, P. Nain, and G. Koole, “The message delay in mobile adhoc networks,” Performance Evaluation, vol. 62, no. 1-4, pp. 210–228,Oct. 2005.
  4. X. Zhang, G. Neglia, J. Kurose, and D. Towsley, Performance modelling of epidemic routing, in Proc. 2006 IFIP Network.Conf .
  5. A. A. Hanbali, P. Nain, and E. Altman, “Performance of ad hoc networkswith two-hop relay routing and limited packet lifetime,” in Proc. 2006Value tools Conf.
  6. A. A. Hanbali, P. Nain, and E. Altman , “Performance of ad hoc networks with two-hop relay routingand limited packet lifetime-extended version,” Performance Evaluation,vol. 65, no. 6–7, pp. 463–483, June 2008.
  7. J. Liu, X. Jiang, H. Nishiyama, and N. Kato, “Performance modelling for two-hop relay with erasure coding in Manet,” in Proc. 2011 IEEEGLOBECOM.
  8. J. Liu, X. Jiang, H. Nishiyama, and N. Kato, “Group-based two-hop relay with redundancy in magnets,” in Proc.2011 IEEE HPSR Conf.
  9. A. Panagakis, A. Vaios, and I. Stavrakakis, “Study of two-hop messagespreading in DTNS,” in Proc. 2007 WiOpt.
  10. J. Whitbeck, V. Conan, and M. D. de Amorim, “Performance of opportunistic epidemic routing on edge-Markovian dynamic graphs,”IEEE Trans. Commun., vol. 59, no. 5, pp. 1259–1263, May 2011.
  11. A. Krifa, C. Barakat, and T. Spyropoulos, “Message drop and schedulingin DTNS: Theory and practice,” IEEE Trans. Mobile Compute., to bepublished
  12. E. Altman, T. Basar,and F. D. Pellegrini, “Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks,” in Proc. 2008 Inter-Perf Conf.
  13. E. Altman T. Basar and F. D.Pellegrini, “Optimal control in two-hop relay routing,” IEEE Trans. Autom.Contr., vol. 56, no. 3, pp. 670–675, Mar. 2011.
  14.  E. Altman and F. D.Pellegrini, “Forward correction and fountain codes in delay tolerant networks,” in Proc. 2009 IEEE INFOCOM.
  15. E. Altman, F. D. Pellegrini, and L. Sassatelli, “Dynamic control ofcoding in delay tolerant networks,” in Proc. 2010 IEEE INFOCOM.
  16. E. Altman, G. Neglia, F. D. Pellegrini, and D. Miorandi, “Decentralizedstochastic control of delay tolerant networks,” in Proc. 2009 IEEEINFOCOM.
  17. E. Altman, A. P. Azad, T. Basar, and F. D. Pellegrini,“Optimal activation and transmission control in delay tolerant networks,” in Proc. 2010 IEEE INFOCOM.
  18. F. D. P. WissamChahin and, R. EI-Azouzi, and A. P.Azad, “Blindonline optimal forwarding in heterogeneous dtns,” in Proc. 2011 IFIPWireless Days.
  19. C. Singh, A. Kumar, and R. Sundaresan, “Delay and energy optimaltwo-hop relaying in delay tolerant networks,” in Proc. 2010 WiOpt.
  20. R. EI-Azouzi, F. D. Pellegrini, and V. Kamble, “Evolutionary forwardinggames in delay tolerant networks,” in Proc. 2010 WiOpt.
  21. R. EI-Azouzi, F. D. Pellegrini, and V. Kamble, “Evolutionary forwardinggames in delay tolerant networks,” in Proc. 2010 WiOpt.
  22. A. Vahdat and D. Becker, “Epidemic routing for partially connected adhoc networks,” Tech. Rep. CS-200006, Duke Univ., Durham, NC, Apr.2000.
  23. X. Xiang, Z. Zhou, and X. Wang, “Self-Adaptive On Demand Geographic Routing Protocols for Mobile Ad Hoc Networks,” IEEE TRANSACTIONS ON MOBILE COMPUTING, vol. 11, no. 9, September 2012
  24. F. Kuhn, R. Wattenhofer, and A. Zollinger, “An Algorithmic Approach to Geographic Routing in Ad Hoc and Sensor Networks,” IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 51-62, Feb. 2008.
  25. Y. Li, Y. Yang, and X. Lu, “Routing Metric Designs for Greedy, Face and Combined-Greedy-Face Routing” Proc. IEEE INFOCOM 09, Page(s):64 -72, Apr. 2009.

Keywords

Delivery probability, Two-hop relay, Erasure coding.