Pornavalai, Chotipat
Loading...
Preferred name
Pornavalai, Chotipat
Alternative Name
Pomavalai, Chotipat
Main Affiliation
Email
chotipat.po@kmitl.ac.th
10 results
Now showing 1 - 10 of 10
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, An effective safety alert broadcast algorithm for VANET(2008-12-01) ;Suriyapaibonwattana, KanitsornVANET has become an interesting research field because we can get a lot of benefit from VANET such as to enhance road safety, reduce traffic congestion and etc. However VANET has some drawbacks such as broadcast storm disrupting network communication, rapid Topology changes. These problems need solutions to improve VANET's performance. In this paper we propose a new approach to reduce Broadcast Storm and improve performance for Safety Alert application in VANET. Finally we compare of the proposed algorithm performance the current standard approach. © 2008 IEEE. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, An MLP-based face authentication technique robust to orientation(2009-11-20) ;Chakraborty, Goutam ;Chakraborty, Basabi ;Patra, Jagdish C.The need for stricter security, availability of sophisticated algorithms and improved hardware at cheaper price, are the driving forces for increasing popularity of biometric authentication. Machine authentication from face images or fingerprints at the entrance of a building or at bank-teller is getting more and more common. The popularity of using face image features for authentication is due to its ease of use. But its success depends on proper orientation and illumination. Facial features change with the angle of orientation, and even a genuine person would be rejected by the machine due to improper orientation of the face towards the camera. In this work, we proposed a multi-layer perceptron based face identification technique which is robust to orientation of the face image under similar illumination condition. Training data of facial features against orientation angle features is used to train a Multi-Layer Perceptron (MLP). It is then used for interpolation of facial features at different angles. Experiments were conducted with two types of face image identifying features, using PCA and ICA. A good interpolation property could be obtained by the trained MLP, and a zero equal error rate (EER) could be achieved. © 2009 IEEE. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Firewall rules analysis(2006-12-01) ;Chomsiri, ThawatchaiIn this paper, we propose a method to analyze the firewall policy or rule-set using Relational Algebra and Raining 2D-Box Model. It can discover all the anomalies in the firewall rule-set in the format that is usually used by many firewall products such as Cisco Access Control List, IPTABLES, IPCHAINS and Check Point Firewall-1. While the existing analyzing methods consider the anomalies between any two rules in the firewall rule-set, we consider more than two rules together at the same time to discover the anomaly. Therefore we can find all the hidden anomalies in the firewall rule-set. Results from analyzing can be used with the proposed rules-combination method presented in this paper, to minimize the firewall rule without changing the policy. Finally, we have developed an application based on the proposed analyzing method. This application could help administrator to analyze and modify a complex firewall policy with less error. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Fuzzy-spray: Efficient routing in delay tolerant ad-hoc network based on fuzzy decision mechanism(2009-01-01) ;Mathurapoj, Akadet; Chakraborty, GoutamDelay Tolerant Network (DTN) is a sparse and intermittently connected mobile wireless network where reliable communication and end-to-end connectivity cannot be assured. In DTN, a node delivers messages to the destination using store and forward scheme. Messages are copied and transferred to multiple relay-nodes in order to increase the opportunity for that message to reach the intended destination. Contact is the time duration for which two or more mobile nodes encounter each other within their radio transmission ranges, and are able to transfer messages. Due to arbitrary node movement, contact time will be varied, and is unlikely to be predictable. In this paper, we propose a fuzzy decision mechanism we called "fuzzy-spray", to improve the routing and packet transfer efficiency in DTN environment. Fuzzy-spray can reduce overall latency in DTN by intelligently selecting appropriate messages to send to the relay-node during its next contact time. It uses fuzzy logic to prioritize messages that are stored in the buffer, based only on local parameters from each message, namely forward transmission count and message size. There is no need to know a priori information about network such as node mobility model, or node-distribution across the deployed area. The simulation results show that fuzzy-spray has the best performance in terms of overall speed of delivery, and lowest average message delay compared with other existing algorithms. ©2009 IEEE. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, A light-weight fault-tolerant time synchronization for wireless sensor networks(2008-12-01) ;Seareesavetrat, Sakpong; Varakulsiripunth, RuttikornWireless sensor networks (WSN) have received a lot of attention recently due to their enormous potential in different applications. Many applications in WSN require time synchronization among all the sensor nodes. However, in practice, network do normally have some abnormal nodes (we called Fault Clock Node or FCN), which could cause high synchronization error. In this paper, we present a light-weight fault-tolerant time synchronization protocol (LiFTiS) which works in a way similar to NTP. The protocol is aware of FCN and is able to detect its children in hierarchical tree. We also propose a light-weight algorithm for selecting the best parent. Our simulation results show that the average synchronization error using the proposed protocol is 5-31% less than the existing algorithms e.g. TPSN etc. © 2008 IEEE. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, A policy based negotiation protocol for services agreement in mobile(2005-12-01) ;Srifa, Nualparn; Varakulsiripunth, RuttikornIn this paper, we have proposed an approach of negotiation protocol for services agreement between two wireless nodes in ad hoc networks. Protocol principles are based on peculiarities of mobile nodes and mobile users on MANET, i.e., user autonomy, node functionality and resource management. Mobile users can use this negotiation protocol for defining its network functions in MANET based on their policy. Service level agreements between two wireless nodes can be renegotiated depending on current user's application requirements and available resources. Protocol is designed to be able to negotiate on many parameters such as route, link bandwidth or QoS. We also present a scenario in MANET to show the effectiveness of our proposed protocol. © 2005 IEEE. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, An adaptive alert message dissemination protocol for VANET to improve road safety(2009-01-01) ;Suriyapaiboonwattana, Kanitsorn; Chakraborty, GoutamVehicular Ad-hoc Network (VANET) is gaining much attention recently because of its many important applications in transportation, to improve road safety, reduce traffic congestion, to enable efficient traffic management etc. However, there are several technical issues to be addressed for its effective deployment. Stability in communication in VANET is difficult to achieve due to rapid network changes. Restoration is inefficient while using traditional protocols based on broadcast storm. In this paper, we propose a new adaptive protocol to improve performance for on road safety alert application in VANET. It can alleviate the broadcast storm problem using adaptive wait-windows and adaptive probability to transmit. Simulation shows that our proposed approach has better performances in terms of number of collision, success rate, and delay, when compared with other existing protocols. ©2009 IEEE. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, An efficient dynamic multicast routing algorithm with advance resource reservation awareness(2004-06-28); ;Gunabhibal, Apipol; Varakulsiripunth, RuttikornReserving the resources for the requested applications is one of the most effective schemes that were proposed to offer the time-critical multimedia applications recently. Because the resource is limited, an ability to provide resource reservation in advance is essential in multi-party applications with dynamic accessing and leaving of user such as modern integrated (voice, video and data) collaboration system. Modified Greedy (MG) algorithm was proposed for multicast routing in advance reservation environment (time of joining in and leaving from multicast group need to be informed to source node). However, MG algorithm has an assumption that member of multicast group join in and leave from multicast session punctually. In this work, we propose the late version of MG algorithm that yields a good performance in the situation that the inaccuracy of information given by user might be happened, as shown in our simulation results. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Dynamic multicast routing in advance resource reservation environment(2000-01-01); ;Chakraborty, Debasish ;Chakraborty, GoutamShiratori, NorioSince usually the network resource is limited, the abilities to do resource reservation in advance, as well as efficient dynamic multicasting when destination nodes can join and leave the group during the communication period, are essential in all distributed multi-party applications. Total or partial re-routing of multicast tree for dynamic multicast groups can optimize the tree cost to some extent but they are complex. Furthermore, optimal multicast routing has been proved to be an NP-complete problem. In this paper, we propose an efficient dynamic multicast routing algorithm, which optimize the total cost of the Steiner tree over the whole session period in advance resource reservation environment, where information about the resource reservation (i.e. leaving times of participants at the time of joining) are available. The efficiency of our algorithm over other existing algorithms is shown by various simulation results. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Designing of policy-based negotiation protocol on MANET(2006-12-01); ;Srifa, NualparnVarakulsiripunth, RuttikornDue to many unique characteristics on the MANET environment such as node's autonomy, highly limited and shared resources, dynamic topology, etc. And these characteristics introduce to the new MANET aspects such as node autonomy, node's roles and resources. The needs for each node to control its resources and roles participated on the MANET is increasing. In this paper we proposed a design of policy-based negotiation protocol that users are able to control their resources. We also describe the design goals, its design principles and negotiation process of our proposed protocol. © 2006 IEEE.
