CFP last date
20 June 2024
Reseach Article

TMHF: Transmit Max Hop First forwarding Strategy to Optimize the Performance of Epidemic Routing Protocol

by Qaisar Ayub, Sulma Rashid, M. Soperi Mohd Zahid
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 18 - Number 5
Year of Publication: 2011
Authors: Qaisar Ayub, Sulma Rashid, M. Soperi Mohd Zahid
10.5120/2277-2949

Qaisar Ayub, Sulma Rashid, M. Soperi Mohd Zahid . TMHF: Transmit Max Hop First forwarding Strategy to Optimize the Performance of Epidemic Routing Protocol. International Journal of Computer Applications. 18, 5 ( March 2011), 40-45. DOI=10.5120/2277-2949

@article{ 10.5120/2277-2949,
author = { Qaisar Ayub, Sulma Rashid, M. Soperi Mohd Zahid },
title = { TMHF: Transmit Max Hop First forwarding Strategy to Optimize the Performance of Epidemic Routing Protocol },
journal = { International Journal of Computer Applications },
issue_date = { March 2011 },
volume = { 18 },
number = { 5 },
month = { March },
year = { 2011 },
issn = { 0975-8887 },
pages = { 40-45 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume18/number5/2277-2949/ },
doi = { 10.5120/2277-2949 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:05:33.125796+05:30
%A Qaisar Ayub
%A Sulma Rashid
%A M. Soperi Mohd Zahid
%T TMHF: Transmit Max Hop First forwarding Strategy to Optimize the Performance of Epidemic Routing Protocol
%J International Journal of Computer Applications
%@ 0975-8887
%V 18
%N 5
%P 40-45
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Delay Tolerant Networks vary from conventional networks in that they have reserve constraints, unbalanced mixture traffic, data redundancy, network dynamics, and energy balance. Moreover due to node mobility DTN suffers from unpredictable connectivity and limited transmission duration. A mobile node in DTN routing may not be able to transmit all messages from its forwarding queue; therefore the order in which messages are transmitted becomes very important. In this paper, we propose forwarding queuing mechanisms named Transmit Max Hop Count first (TMHF) in which when the connection opportunity arises, the node will transmit the message with max hop count.

References
  1. A.indgren and K. S. Phanse, “Evaluation of queuing policies and forwarding strategies for routing in intermittently connected networks,”in Proc. of IEEE COMSWARE, pp. 1-10, Jan. 2006.
  2. Qaisar Ayub, Sulma Rashid and Dr.Mohd Soperi Mohd Zahid. Article: Optimization of Epidemic router by new forwarding queue mode TSMF. International Journal of Computer Applications 7(11):5–8, October 2010. Published By Foundation of Computer Science.
  3. Lindgren, A. Doria, and O. Schelen,“Probabilistic routing in intermittently connected networks,” SIGMOBILE Mobile Computing and Communication Review, vol. 7, no. 3, 2003.pp 19-20.
  4. KERÄNEN, A., AND OTT, J. Increasing Reality for DTN Protocol Simulations. Tech. rep., Helsinki University of Technology, Networking Laboratory, July 2007.
  5. T. Spyropoulos, K. Psounis, and C. Raghavendra A, C. S. “Single-copy routing in intermittently connected mobile networks,” IEEE/ACM Transactions on Networking (TON), vol. 16, pp. 63-76, Feb. 2008.
  6. Tara Small and Zygmunt Haas.” The shared wireless infestation model - a new ad hoc networking paradigm (or where there is a whale, there is a way)”, In Proceedings of The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), pages 233.244, June 2003.
  7. Philo Juang, Hidekazu Oki, Yong Wang, Margaret Martonosi, Li-Shiuan Peh, and Daniel Rubenstein. Energyef_cient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet. In Proceedings of Tenth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-X), San Jose, CA, October 2002.
  8. Vahdat and D. Becker. Epidemic Routing for Partially-connected Ad hoc Networks. Technical Report CS-2000-06, Duke University, July 2000.
  9. SCOTT, J., HUI, P., CROWCROFT, J., AND DIOT, C. Haggle: Networking Architecture Designed Around Mobile Users. In Proceedings of IFIP WONS (2006).
  10. FALL, K. A Delay-Tolerant Network Architecture for Challenged Internets. In Proc. of ACM SIGCOMM (2003).
  11. Z. J. Haas and T. Small. A New Networking Model for Biological Applications of Ad Hoc Sensor Networks. IEEE/ACM Transactions on Networking, 14, No. 1:27–40, 2006.
  12. T. Spyropoulos, K. Psounis, and C. Raghavendra. Efficient Routing in Intermittently Connected Mobile Networks: The Multi-copy Case. In ACM/IEEE Transactions on Networking, 2007.
  13. T. Small and Z. J. Haas. Resource and performance tradeoffs in delay-tolerant wireless networks. In SIGCOMM Workshop on Delay Tolerant Networking (WDTN), 2005.
  14. T. Spyropoulos, K. Psounis, and C. S. Raghavendra.” Spray and wait: an efficient routing scheme for intermittently connected mobile networks”, In SIGCOMM Workshop on Delay Tolerant Networking (WDTN), 2005
  15. Sulma Rashid, Qaisar Ayub, M. Soperi Mohd Zahid , A.Hanan. Abdullah. “Optimization of DTN routing protocols by using forwarding strategy (TSMF) and queuing drop policy (DLA)”, International Journal of Computer and Network Security, Vol 2,ISSUE 10,OCTOBER 2010. pp .71-75.
  16. P. Zhang, C. M. Sadler, S. A. Lyon, and M. Martonosi. Hardware Design Experiences in ZebraNet. In Proc. ACM SenSys, pages 227–238, Nov. 2004.
  17. Maffei, K. Fall, and D. Chayes. Ocean Instrument Internet. In Proc. AGU Ocean Sciences Conf., Feb 2006.
  18. J. Partan, J. Kurose, and B. N. Levine. A Survey of Practical Issues in Underwater Networks. In Proc. ACMWUWNet, pages 17–24, Sept. 2006.
  19. J. Ott and D. Kutscher. A Disconnection-Tolerant Transport for Drive-thru Internet Environments. In Proc. IEEE INFOCOM, pages 1849–1862, Mar. 2005.
  20. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. MaxProp: Routing for Vehicle-Based Disruption- Tolerant Networks. In Proc. IEEE Infocom, April 2006.
  21. Sulma Rashid,Qaisar Ayub,”Effective buffer management policy DLA for DTN routing Protocals under congetion”, International Journal of Computer and Network Security,Vol 2,NO 9,Sep 2010. pp .118-121
  22. Rossi, M., M. Zorzi, and R.R. Rao, Statistically assisted routing algorithms (SARA) for hop count based forwarding in wireless sensor networks. Wireless Networks, 2008. 14(1): p. 55-70.
  23. Sulma Rashid, Qaisar Ayub, Soperi Mohd M Zahid and A.Hanan. Abdullah. Article: E-DROP: An Effective Drop Buffer Management Policy for DTN Routing Protocols. International Journal of Computer Applications 13(7):8–13, January 2011. Published by Foundation of Computer Science
  24. Qaisar Ayub, Sulma Rashid,” T-Drop: An optimal buffer management policy to improve QOS in DTN routing protocols”, Journal of Computing, Vol 2, ISSUE 10, OCTOBER 2010. pp .46-50.
Index Terms

Computer Science
Information Sciences

Keywords

Store and forward networks Forwarding strategies routing DTN Queue modes maximum hop forward