Flood filtering and route selection for energy-efficient on-demand routing in wireless ad hoc networks

Tran Minh Trung, Seong-Lyun Kim

Research output: Contribution to journalArticle

Abstract

This paper presents a new routing algorithm for maximizing the lifetime of a wireless ad hoc network. Our approach is to reduce the energy consumption at routing discovery phase and to establish suitable routing paths with respect to energy-saving. At the routing discovery phase, we use a dynamic flood filtering algorithm to eliminate the nodes that are predicted not to participate in the final routing paths. The prediction rules are based on energy requirement by each connection, energy availability at each node, and neighbor nodes' status. Finally, at the destination node, by using an energy-efficient route selection algorithm, the selected routing path would have small energy consumption with an ample residual energy capacity.

Original languageEnglish
Pages (from-to)241-252
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2928
Publication statusPublished - 2003 Dec 1

Fingerprint

Wireless Ad Hoc Networks
Wireless ad hoc networks
Energy Efficient
Routing
Energy utilization
Filtering
Routing algorithms
Energy conservation
Vertex of a graph
Path
Availability
Energy Consumption
Energy
Routing Algorithm
Energy Saving
Lifetime
Eliminate
Demand
Prediction
Requirements

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{b03617f2c99c4f8d9a412014e9ba9cea,
title = "Flood filtering and route selection for energy-efficient on-demand routing in wireless ad hoc networks",
abstract = "This paper presents a new routing algorithm for maximizing the lifetime of a wireless ad hoc network. Our approach is to reduce the energy consumption at routing discovery phase and to establish suitable routing paths with respect to energy-saving. At the routing discovery phase, we use a dynamic flood filtering algorithm to eliminate the nodes that are predicted not to participate in the final routing paths. The prediction rules are based on energy requirement by each connection, energy availability at each node, and neighbor nodes' status. Finally, at the destination node, by using an energy-efficient route selection algorithm, the selected routing path would have small energy consumption with an ample residual energy capacity.",
author = "Trung, {Tran Minh} and Seong-Lyun Kim",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2928",
pages = "241--252",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Flood filtering and route selection for energy-efficient on-demand routing in wireless ad hoc networks

AU - Trung, Tran Minh

AU - Kim, Seong-Lyun

PY - 2003/12/1

Y1 - 2003/12/1

N2 - This paper presents a new routing algorithm for maximizing the lifetime of a wireless ad hoc network. Our approach is to reduce the energy consumption at routing discovery phase and to establish suitable routing paths with respect to energy-saving. At the routing discovery phase, we use a dynamic flood filtering algorithm to eliminate the nodes that are predicted not to participate in the final routing paths. The prediction rules are based on energy requirement by each connection, energy availability at each node, and neighbor nodes' status. Finally, at the destination node, by using an energy-efficient route selection algorithm, the selected routing path would have small energy consumption with an ample residual energy capacity.

AB - This paper presents a new routing algorithm for maximizing the lifetime of a wireless ad hoc network. Our approach is to reduce the energy consumption at routing discovery phase and to establish suitable routing paths with respect to energy-saving. At the routing discovery phase, we use a dynamic flood filtering algorithm to eliminate the nodes that are predicted not to participate in the final routing paths. The prediction rules are based on energy requirement by each connection, energy availability at each node, and neighbor nodes' status. Finally, at the destination node, by using an energy-efficient route selection algorithm, the selected routing path would have small energy consumption with an ample residual energy capacity.

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

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

M3 - Article

VL - 2928

SP - 241

EP - 252

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -