Prabhavat, Sumet

Loading...
Thumbnail Image
Preferred name
Prabhavat, Sumet
Alternative Name
Prabhavat, S.
Prapawat, Sumet
Main Affiliation
Email
sumet.pr@kmitl.ac.th

Settings

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    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.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    An efficient message flooding scheme in delay-tolerant networks
    (2015-01-01)
    Narongkhachavana, Worrawat
    ;
    Choksatid, Teerapong
    ;
    Prabhavat, Sumet
    In intermittently connected ad hoc networks, a reliable path between communication endpoints may not exist because mobile nodes randomly move during their operation. Furthermore, routing protocols have to work efficiently under constraints of limited bandwidth and energy. These challenge researchers to develop a suitable protocol for the networks. In this paper, we present a new routing protocol, which limits the number of message replications. In addition, a node should spread messages with lower probability if the messages are currently distributed in its local neighborhood. This increases an opportunity for a node to spread messages to other network areas. Simulation results show that our work can increase delivery ratio while maintaining low end-to-end delay and message exchange overhead.