Phonepadith Phoummavong | Tokai University (original) (raw)
Uploads
Papers by Phonepadith Phoummavong
When the disaster occurs, i.e., in emergency situations, Mobile Ad-hoc network (MANET) can be use... more When the disaster occurs, i.e., in emergency situations, Mobile Ad-hoc network (MANET) can be used as an communication method alternative to out-of-order infrastructure. This paper addresses approach to reducing energy consumption of battery-driven nodes over MANET by modifying location aided greedy forwarding protocol based on two-hop neighbor information. This approach determines the best suitable path to make sure that path consumes low energy when the communication is attempted between same source and destination. Moreover, this algorithm can switch the relay nodes that are located between source and destination to satisfy the minimum energy consumption and prolong network lifetime. We compare our approach with Greedy Most Forward with Radius (GMFR), Greedy Random Selection (GRS) and Greedy Nearest with Forward Progress (GNFP) through computer simulation and evaluation. The simulation results show that our approach can achieve lower energy consumption than existing algorithms.
The location-based routing protocols of Mobile Ad hoc Networks (MANETs) are very important and u... more The location-based routing protocols of Mobile Ad
hoc Networks (MANETs) are very important and useful in
terms of energy saving and prolonging network lifetime,
especially in emergency situations without an IP address.
Previous approaches do not work efficiently or well. They may
produce a large overhead of packets, which affects their
scalability. Moreover, the reachability from source to
destination is low in existing methods because route discovery
fails and long end-to-end delays may occur due to inefficient
route discovery. To solve these problems, we propose route
discovery based on location-aided two-hop neighbor
information. In this paper, we introduce a pair of approaches
to enhance route discovery. The first approach considers the
minimum average distance to the destination from two-hop
neighbors of the source, and the second approach considers
the relation between the source-neighbors’ distances from the
destination and the number of two-hop neighbor nodes from
the source. Furthermore, we compare our approaches with
existing algorithms through computer simulation and analysis.
The simulation results show that our approaches can achieve
higher performance than existing algorithms.
Abstract - How to efficiently reduce the number of packets of broadcasting in Mobile ad hoc netwo... more Abstract - How to efficiently reduce the number of packets of broadcasting in Mobile ad hoc network (MANET) is very important inevitability for saving energy and prolonging life time. Most of previous researches based on broadcast approaches do not well consider avoiding redundant packets. However route discovery from a source to specific destination based on broadcasting causes large increase of unnecessary packets and affects the scalability. According to this research we propose two approaches, the first approach is the use of the connected dominating set (CDS) utilizing information of two-hop neighbors in ad hoc network, where searching minimum number of neighbors. The Second is based on Location-Aided Routing Protocol (LAR) or Geocast that is powerful to find specific area where destination node is. Eventually based on two base algorithms above, in this research we implement our algorithm (Location-aided Route Discovery based on two-hop neighbor information) and analysis via relationship between CDS and LAR. Finally, we find the effective factors to reduce the number of overhead packets and number of redundant rebroadcasting by our algorithm to precisely select the forwarding node. We compare our algorithm with the Direct Flooding and Geocast through computer simulation. The simulation result shows that our proposal decrease the number of overhead packets in Ad Hoc network on broadcast compared with existing algorithms.
When the disaster occurs, i.e., in emergency situations, Mobile Ad-hoc network (MANET) can be use... more When the disaster occurs, i.e., in emergency situations, Mobile Ad-hoc network (MANET) can be used as an communication method alternative to out-of-order infrastructure. This paper addresses approach to reducing energy consumption of battery-driven nodes over MANET by modifying location aided greedy forwarding protocol based on two-hop neighbor information. This approach determines the best suitable path to make sure that path consumes low energy when the communication is attempted between same source and destination. Moreover, this algorithm can switch the relay nodes that are located between source and destination to satisfy the minimum energy consumption and prolong network lifetime. We compare our approach with Greedy Most Forward with Radius (GMFR), Greedy Random Selection (GRS) and Greedy Nearest with Forward Progress (GNFP) through computer simulation and evaluation. The simulation results show that our approach can achieve lower energy consumption than existing algorithms.
The location-based routing protocols of Mobile Ad hoc Networks (MANETs) are very important and u... more The location-based routing protocols of Mobile Ad
hoc Networks (MANETs) are very important and useful in
terms of energy saving and prolonging network lifetime,
especially in emergency situations without an IP address.
Previous approaches do not work efficiently or well. They may
produce a large overhead of packets, which affects their
scalability. Moreover, the reachability from source to
destination is low in existing methods because route discovery
fails and long end-to-end delays may occur due to inefficient
route discovery. To solve these problems, we propose route
discovery based on location-aided two-hop neighbor
information. In this paper, we introduce a pair of approaches
to enhance route discovery. The first approach considers the
minimum average distance to the destination from two-hop
neighbors of the source, and the second approach considers
the relation between the source-neighbors’ distances from the
destination and the number of two-hop neighbor nodes from
the source. Furthermore, we compare our approaches with
existing algorithms through computer simulation and analysis.
The simulation results show that our approaches can achieve
higher performance than existing algorithms.
Abstract - How to efficiently reduce the number of packets of broadcasting in Mobile ad hoc netwo... more Abstract - How to efficiently reduce the number of packets of broadcasting in Mobile ad hoc network (MANET) is very important inevitability for saving energy and prolonging life time. Most of previous researches based on broadcast approaches do not well consider avoiding redundant packets. However route discovery from a source to specific destination based on broadcasting causes large increase of unnecessary packets and affects the scalability. According to this research we propose two approaches, the first approach is the use of the connected dominating set (CDS) utilizing information of two-hop neighbors in ad hoc network, where searching minimum number of neighbors. The Second is based on Location-Aided Routing Protocol (LAR) or Geocast that is powerful to find specific area where destination node is. Eventually based on two base algorithms above, in this research we implement our algorithm (Location-aided Route Discovery based on two-hop neighbor information) and analysis via relationship between CDS and LAR. Finally, we find the effective factors to reduce the number of overhead packets and number of redundant rebroadcasting by our algorithm to precisely select the forwarding node. We compare our algorithm with the Direct Flooding and Geocast through computer simulation. The simulation result shows that our proposal decrease the number of overhead packets in Ad Hoc network on broadcast compared with existing algorithms.