Prabhavat, Sumet

Preferred name

Prabhavat, Sumet

Alternative Name

Prabhavat, S.

Prapawat, Sumet

Main Affiliation

School of Information Technology

sumet.pr@kmitl.ac.th

Now showing 1 - 10 of 18

Some of the metrics are blocked by your
consent settings
Adaptive gateway discovery for load distribution in hybrid wireless networks
(2018-07-02)
Thongthavorn, Thananop
;
Narongkhachavana, Worrawat
;
Namuduri, Kamesh
;
Prabhavat, Sumet
Mobile Ad hoc Networks (MANETs) have a limitation in information transmission capability since nodes in the network cannot communicate with any nodes in another network. Hybrid Wireless Networks (HWNs) is proposed for connecting MANETs to another network through gateway nodes that act as a bridge between the networks. Limited energy resource to HWNs is a challenging issue. If a source node selects a gateway and a route to it without considering the available energy of relay nodes, the probability of route breakage may increase leading to network instability and network partition problem. In order to mitigate these problems, an effective load balancing algorithm should be applied to HWNs. In this paper, we propose an adaptive gateway discovery algorithm aimed to create a well-balanced network. We also propose using a directional flooding technique to alleviate the drawback of load balancing information flood. Simulation results show that our protocol distributes the workload to mobile nodes more evenly. As a result, our protocol further extends the network lifetime without sacrificing the network performance when compared to the existing protocols.
Some of the metrics are blocked by your
consent settings
An Epidemic Routing with Low Message Exchange Overhead for Delay Tolerant Networks
(2015-01-01)
Choksatid, Teerapong
;
Prabhavat, Sumet
Epidemic routing strategy enables mobile nodes in Delay-Tolerant Networks (DTN) to send messages to destinations without requiring any predetermined path between source nodes to destination nodes. However, it can cause a large number of message exchanges and consequently degrades network performance. In this article, we propose a novel epidemic routing strategy called the Epidemic Message with Message List Advertisement (EM-MA) that exploits broadcasting nature of wireless medium and slotted time communication to reduce network congestion and nodes' energy consumption without affecting the message delivery time. Additionally, we conduct intensive simulations to demonstrate and compare the performance of EM-MA with other existing routing strategies. The results show that EM-MA outperforms the existing routing strategies and is suitable to be used in DTN. © Springer International Publishing Switzerland 2015.
Some of the metrics are blocked by your
consent settings
An efficient spreading Epidemic Routing for Delay-Tolerant Network
(2016-03-30)
Choksatid, Teerapong
;
Narongkhachavana, Worrawat
;
Prabhavat, Sumet
Delay-Tolerant Network (DTN) is a network technology which can provide communication in an environment where an end-to-end path may not be possible. Over the past years, Epidemic Routing has been recognized as the DTN protocol that can deliver messages quickly by spreading messages from node to node all over the network. However, many pieces of research argue against using Epidemic Routing due to the large number of message exchanges. In this paper, we propose Speed Epidemic Routing (SEd), which is the renovation of Epidemic Routing scheme. By applying broadcast transmission, we can increase the speed of messages spreading and reduce forwarding redundant messages. The simulation results show that SEd is a protocol providing high delivery rate and low packet rate at the same time.
Some of the metrics are blocked by your
consent settings
Overhead reduction for route repair in mobile ad hoc networks
(2018-01-01)
Narongkhachavana, Worrawat
;
Prabhavat, Sumet
In Mobile Ad Hoc Networks (MANETs), routing overhead is a major problem since a bandwidth and an energy of mobile node are limited. Due to node’s mobility and an unreliable wireless link, a path connecting between a source and a destination will break frequently. This causes a network-wide flooding of routing packets being invoked repeatedly, leading to high packet loss and network congestion, especially in a high mobility network. In this paper, we propose an efficient route repair method based on Query Localization technique. The routing packets, which propagate back to a source, are discarded to alleviate unnecessary rebroadcasting. Simulation results show that our proposed method can reduce routing overhead and MAC collision rate without sacrificing packet delivery ratio compared to existing protocols.
Some of the metrics are blocked by your
consent settings
Global-Scale Flow Routing for Load-Balancing in In-Band Software-Defined MANET
(2025-01-01)
Thongthavorn, Thananop
;
Prabhavat, Sumet
Mobile Ad Hoc Networks (MANETs) typically operate with limited resources; therefore, achieving better load distribution among mobile nodes can significantly enhance network performance by improving resource utilization. In distributed load-balancing protocols, a lack of global network topology information causes source nodes to make load-balancing routing decisions without awareness of other active paths. As a result, overlapping paths from different source nodes tend to be formed, increasing network congestion and packet collision probability, which ultimately degrades network performance. A Software-Defined MANET (SD-MANET) is a promising solution to this problem since the controller can make a routing decision for source nodes based on up-to-date network topology snapshots. In this paper, we propose a global-scale flow routing algorithm based on an in-band SD-MANET architecture. Once the controller aggregates local network data into a global topology view, it can identify a path that avoids using any nodes currently serving as a relay in other active paths. The controller then establishes or switches the active flow to the new route depending on the current network situation. Simulation results show that our proposed work can effectively reduce the number of overlapping paths, resulting in lower load balancing errors and a higher packet delivery ratio.
Some of the metrics are blocked by your
consent settings
A new explicit congestion notification scheme for satellite IP networks
(2016-11-01)
Utsumi, Satoshi
;
Zabir, Salahuddin Muhammad Salim
;
Prabhavat, Sumet
Longer transmission delay and higher link errors affect data communication performance over satellite links. The problem gets compounded in case a congestion occurs in the corresponding data path. Taking preventive measures before a congestion actually occurs can help in avoiding such situations. Irrespective of the network characteristics, Explicit Congestion Notification (ECN) either through ICMP messages or through marking packets aims to achieve this objective. However, use of ICMP messages for explicit congestion notification leads to vulnerability to attacks by malicious hosts. On the other hand, use of conventional marking schemes that mark data packets in the forward direction can be slow as they have to traverse the satellite links. In this manuscript, we propose a new mechanism of ECN for an even faster notification of an incipient congestion over satellite IP networks. Our proposal, Mark-Reverse ECN, marks packets corresponding to acknowledgement (ACK) segments in the reverse direction to the sender. This leads to a reduction of the latency between detection and actual notification. As such, our mechanism leads to a more accurate and effective approach to congestion control. In addition, our proposed mechanism is free from vulnerability to malicious attacks. We also develop a new analytical model for Mark-Reverse ECN on TCP Reno for performance prediction and validation of simulation outcomes. Simulation results show that our proposed mechanism (i) leads to up to 25% improvement of TCP performance, (ii) reduces packet loss at the congested router by down to about 0% and (iii) helps to improve the performance of conventional TCP when deployed together.
Some of the metrics are blocked by your
consent settings
Throughput improvement on RED mechanism
(2002-01-01)
Prabhavat, S.
;
Varakulsiripunth, R.
;
Noppanakeepong, S.
The Internet Engineering Task Force (IETF) had recommended the active queue management (AQM) scheme to solve the global synchronization problems in TCP/IP based networks for next generation routers. Since then, random early detection (RED) has been proposed as one of the AQM schemes. However, the major problems of the RED mechanism are low throughput achievement and high number of consecutive drop. We have proposed the extended drop slope random early detection (ExRED) mechanism in order to overcome these problems. The ExRED can reduce both the average number of dropped packets and the consecutive drop probability, hence network throughput is improved while all other advantages of RED are retained.
Some of the metrics are blocked by your
consent settings
Reserch and development of the city commuter installed ICT functions in consideration of usability
(2015-01-01)
Okumura, Kohei
;
Sararuengpong, Kitipat
;
Chaweechan, Charoen
;
Ishida, Koji
;
Ishigami, Kazuyuki
It is commonly believed that the development of ICT contributes in various fields. Accordingly, the Ministry of Internal Affairs and Communications of Japan has promoted «ICT community development business». In local area where does not have enough public transport facilities, it is hard for elderly people who cannot drive a car to go out. Additionally, it is supposed that the time national disasters like earthquakes happen all of transport would be stopped. To solve these problems is the one of the goal of the business, and we research and develop a vehicle called city commuter that has convenience ICT functions. Its design is based on three-wheeled electric bicycle. This paper shows the way we decided the design of the city commuter. After that, it explains the detail of the method to create each ICT system. At the end, it describes the conclusion and the future prospects of this study.
Some of the metrics are blocked by your
consent settings
Deep Learning-Based Early Detection and Avoidance of Traffic Congestion in Software-Defined Networks
(2022-01-01)
Prabhavat, Sumet
;
Thongthavorn, Thananop
;
Pasupa, Kitsuchart
Software-defined Networking (SDN) provides an easy way to monitor network and traffic conditions by employing software-based controllers to communicate with the hardware directly. It provides helpful information that enables efficient routing decisions. This research study attempted to use deep learning techniques - Long Short-term Memory, Bidirectional Long Short-term Memory, and Gated Recurrent Unit - to predict network traffic to allow the controller to early detect congestion. The traffic flow in a network link that will likely be congested will be rerouted to a new path with the largest available bandwidth. Various scenarios were simulated to evaluate our deep learning-based SDN controller (Ryu controller platform). The results show that our proposed deep learning-based SDN controller outperformed the traditional load balancing technique.
Some of the metrics are blocked by your
consent settings
Overhead reduction of location-Aided gateway discovery protocols
(2017-02-23)
Thongthavorn, Thananop
;
Narongkhachavana, Worrawat
;
Prabhavat, Sumet
Integration of mobile ad-hoc networks (MANETs) into infrastructure-based networks allows mobile users to access other networks. At a network boundary, some node with multiple interfaces plays an important role as a gateway. Gateway discovery mechanism is necessary for mobile nodes to discover nearby gateways but causes message exchange overhead. In order to control the overhead, we present a novel location-Aided gateway discovery protocol with directional broadcast algorithm and Solicitation technique. Simulation results show that our proposed protocol can reduce the overhead, as compared to conventional protocols. Moreover, it improves packet delivery ratio, end-To-end delay, and gateway discovery time.

Prabhavat, Sumet

Filters

Settings

Sort By

Results per page