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

Hyo Jin Kim; Seungjae Han; Jooseok Song

doi:10.1007/11758525_147

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

Hyo Jin Kim, Seungjae Han, Jooseok Song

College of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Computational Science - ICCS 2006
Subtitle of host publication	6th International Conference, Proceedings
Publisher	Springer Verlag
Pages	1101-1104
Number of pages	4
ISBN (Print)	3540343814, 9783540343813
DOIs	https://doi.org/10.1007/11758525_147
Publication status	Published - 2006
Event	ICCS 2006: 6th International Conference on Computational Science - Reading, United Kingdom Duration: 2006 May 28 → 2006 May 31

Publication series

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

Other

Other	ICCS 2006: 6th International Conference on Computational Science
Country/Territory	United Kingdom
City	Reading
Period	06/5/28 → 06/5/31

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11758525_147

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 (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. https://doi.org/10.1007/11758525_147

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. 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",

doi = "10.1007/11758525_147",

language = "English",

isbn = "3540343814",

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",

note = "ICCS 2006: 6th International Conference on Computational Science ; Conference date: 28-05-2006 Through 31-05-2006",

}

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. 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. https://doi.org/10.1007/11758525_147

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. 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 proceeding › Conference 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

Y1 - 2006

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

U2 - 10.1007/11758525_147

DO - 10.1007/11758525_147

M3 - Conference contribution

AN - SCOPUS:33746614279

SN - 3540343814

SN - 9783540343813

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

T2 - ICCS 2006: 6th International Conference on Computational Science

Y2 - 28 May 2006 through 31 May 2006

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. Springer Verlag. 2006. p. 1101-1104. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11758525_147

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

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this