Maximum lifetime paths for the high packet delivery ratio using fast recovery in a mobile ad hoc network

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Both movement of mobile nodes and path lifetime exhaustion cause to change the network topology in a mobile ad hoc network. Then, it is not easy to obtain the high packet delivery ratio. This paper proposes the Maximum Lifetime Paths (MLP) to transmit a large amount of data using nodes with long lifetime and using fast recovery. The proposed MLP establishes routes based on the shortest path and dynamically recovers routes using warning messages. The simulation experiment results show that MLP increases the packet delivery ratio and reduces the hop distance and the frequency of the route establishment.

Original languageEnglish
Title of host publicationComputational Science - ICCS 2006
Subtitle of host publication6th International Conference, Proceedings
PublisherSpringer Verlag
Pages1101-1104
Number of pages4
Volume3992 LNCS - II
ISBN (Print)3540343814, 9783540343813
Publication statusPublished - 2006 Jan 1
EventICCS 2006: 6th International Conference on Computational Science - Reading, United Kingdom
Duration: 2006 May 282006 May 31

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3992 LNCS - II
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherICCS 2006: 6th International Conference on Computational Science
CountryUnited Kingdom
CityReading
Period06/5/2806/5/31

Fingerprint

Mobile ad hoc networks
Mobile Ad Hoc Networks
Lifetime
Recovery
Topology
Path
Experiments
Vertex of a graph
Network Topology
Shortest path
Simulation Experiment

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kim, H. J., Han, S., & Song, J. (2006). Maximum lifetime paths for the high packet delivery ratio using fast recovery in a mobile ad hoc network. In Computational Science - ICCS 2006: 6th International Conference, Proceedings (Vol. 3992 LNCS - II, pp. 1101-1104). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3992 LNCS - II). Springer Verlag.
Kim, Hyo Jin ; Han, Seungjae ; Song, Jooseok. / Maximum lifetime paths for the high packet delivery ratio using fast recovery in a mobile ad hoc network. Computational Science - ICCS 2006: 6th International Conference, Proceedings. Vol. 3992 LNCS - II Springer Verlag, 2006. pp. 1101-1104 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fbacffb5d6a64a629a64d908c9310cf6,
title = "Maximum lifetime paths for the high packet delivery ratio using fast recovery in a mobile ad hoc network",
abstract = "Both movement of mobile nodes and path lifetime exhaustion cause to change the network topology in a mobile ad hoc network. Then, it is not easy to obtain the high packet delivery ratio. This paper proposes the Maximum Lifetime Paths (MLP) to transmit a large amount of data using nodes with long lifetime and using fast recovery. The proposed MLP establishes routes based on the shortest path and dynamically recovers routes using warning messages. The simulation experiment results show that MLP increases the packet delivery ratio and reduces the hop distance and the frequency of the route establishment.",
author = "Kim, {Hyo Jin} and Seungjae Han and Jooseok Song",
year = "2006",
month = "1",
day = "1",
language = "English",
isbn = "3540343814",
volume = "3992 LNCS - II",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1101--1104",
booktitle = "Computational Science - ICCS 2006",
address = "Germany",

}

Kim, HJ, Han, S & Song, J 2006, Maximum lifetime paths for the high packet delivery ratio using fast recovery in a mobile ad hoc network. in Computational Science - ICCS 2006: 6th International Conference, Proceedings. vol. 3992 LNCS - II, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3992 LNCS - II, Springer Verlag, pp. 1101-1104, ICCS 2006: 6th International Conference on Computational Science, Reading, United Kingdom, 06/5/28.

Maximum lifetime paths for the high packet delivery ratio using fast recovery in a mobile ad hoc network. / Kim, Hyo Jin; Han, Seungjae; Song, Jooseok.

Computational Science - ICCS 2006: 6th International Conference, Proceedings. Vol. 3992 LNCS - II Springer Verlag, 2006. p. 1101-1104 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3992 LNCS - II).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Maximum lifetime paths for the high packet delivery ratio using fast recovery in a mobile ad hoc network

AU - Kim, Hyo Jin

AU - Han, Seungjae

AU - Song, Jooseok

PY - 2006/1/1

Y1 - 2006/1/1

N2 - Both movement of mobile nodes and path lifetime exhaustion cause to change the network topology in a mobile ad hoc network. Then, it is not easy to obtain the high packet delivery ratio. This paper proposes the Maximum Lifetime Paths (MLP) to transmit a large amount of data using nodes with long lifetime and using fast recovery. The proposed MLP establishes routes based on the shortest path and dynamically recovers routes using warning messages. The simulation experiment results show that MLP increases the packet delivery ratio and reduces the hop distance and the frequency of the route establishment.

AB - Both movement of mobile nodes and path lifetime exhaustion cause to change the network topology in a mobile ad hoc network. Then, it is not easy to obtain the high packet delivery ratio. This paper proposes the Maximum Lifetime Paths (MLP) to transmit a large amount of data using nodes with long lifetime and using fast recovery. The proposed MLP establishes routes based on the shortest path and dynamically recovers routes using warning messages. The simulation experiment results show that MLP increases the packet delivery ratio and reduces the hop distance and the frequency of the route establishment.

UR - http://www.scopus.com/inward/record.url?scp=33746614279&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746614279&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540343814

SN - 9783540343813

VL - 3992 LNCS - II

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1101

EP - 1104

BT - Computational Science - ICCS 2006

PB - Springer Verlag

ER -

Kim HJ, Han S, Song J. Maximum lifetime paths for the high packet delivery ratio using fast recovery in a mobile ad hoc network. In Computational Science - ICCS 2006: 6th International Conference, Proceedings. Vol. 3992 LNCS - II. Springer Verlag. 2006. p. 1101-1104. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).