By Topic

Computer Science and Software Engineering (JCSSE), 2011 Eighth International Joint Conference on

Date 11-13 May 2011

Filter Results

Displaying Results 1 - 25 of 82
  • [Title page]

    Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (70 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Page(s): ii
    Save to Project icon | Request Permissions | PDF file iconPDF (92 KB)  
    Freely Available from IEEE
  • Message from honorary general chair

    Page(s): x
    Save to Project icon | Request Permissions | PDF file iconPDF (81 KB)  
    Freely Available from IEEE
  • Message from honorary general co-chair

    Page(s): xii
    Save to Project icon | Request Permissions | PDF file iconPDF (73 KB)  
    Freely Available from IEEE
  • Message from general chair

    Page(s): xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (75 KB)  
    Freely Available from IEEE
  • Program Committee

    Page(s): xvii - xviii
    Save to Project icon | Request Permissions | PDF file iconPDF (92 KB)  
    Freely Available from IEEE
  • Conference program

    Page(s): 1 - 3
    Save to Project icon | Request Permissions | PDF file iconPDF (160 KB)  
    Freely Available from IEEE
  • Author index

    Page(s): 432 - 435
    Save to Project icon | Request Permissions | PDF file iconPDF (128 KB)  
    Freely Available from IEEE
  • Table of contents

    Page(s): iii - ix
    Save to Project icon | Request Permissions | PDF file iconPDF (199 KB)  
    Freely Available from IEEE
  • A comparative study on indoor localization based on RSSI measurement in wireless sensor network

    Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2886 KB) |  | HTML iconHTML  

    This paper studies on the localization techniques using in wireless sensor network (WSN) for an indoor environment. We compare two main categories of localization techniques: range-based and fingerprinting-based techniques on a single experimental environment. The received signal strength indicator (RSSI) received at sensor nodes are used for all localization techniques. For the range-base techniques, the location estimation approach based on the lateration estimation and the min-max approach are employed. For the fingerprinting based techniques, two pattern matching approaches are used: one is the simple nearest neighbor algorithm and another one is the k-nearest-nearest neighbor algorithm. The experiments are conducted in a meeting room where is a small number of obstacles inside to evaluate the performance of each technique. The results demonstrate that the location estimation algorithm using lateration estimation gives the best accuracy and also less computational time compared to other techniques. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study of autonomous system relationships within Thailand

    Page(s): 7 - 11
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (326 KB) |  | HTML iconHTML  

    In the past, the Internet topology was produced by using connection data from Internet Service Provider (ISP). However, if ISPs didn't update connection data or didn't want publish this data, the Internet topology couldn't be produced. Furthermore, there was no relationships information available between the Autonomous System (AS). In this paper, we use a technique, which does not need to use connection data from ISPs, to examine AS path in BGP routing table to produce Internet topology and infer the type of relationships between the ASs within Thailand. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved bound for multiple source-sink linear network coding

    Page(s): 12 - 16
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (542 KB) |  | HTML iconHTML  

    This paper considers the linear network coding problem when there are k independent source-sink pairs. The problem when k is not bounded, this problem is NP-hard. Recently Iwama, Nishimura, Peterson, Raymond, and Yamashita show that when k is fixed and the field F is fixed, the problem can be solved in polynomial time. One of their key lemmas shows that the number of vertices in the network performing the K encoding operations is at most |F|3k This paper improves the k bound exponentially to k2 |F|2k Since their algorithm's running time depends on this bound exponentially, our bound implies an improved running time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coexistence of SCTP and TCP variants under self-similar network

    Page(s): 17 - 22
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4159 KB) |  | HTML iconHTML  

    SCTP will co-exist with TCP on the Internet in a near future as its maturity progresses. Self-similarity is long known as an inherent characteristic of the IP network in which performance of SCTP under such environment is yet to be investigated. This paper reports behaviors and throughput of SCTP and TCP streams when co-existed together in the same channel under self-similar traffic environment. Simulation tests on several TCP variants including New-Reno, Reno, Tahoe, Vegas, and SACK using ns2 simulator are conducted. Results reveal that SCTP acquires averagely only 50% throughput when competing with TCP. Although found that self-similarity does not extensively distort SCTP-TCP performance, it, nevertheless, offers indirect advantage to SCTP in gaining throughput proportion against TCP. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Honeypot log management and visualization of attacker geographical distribution

    Page(s): 23 - 28
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2652 KB) |  | HTML iconHTML  

    Honeypot is a prominent technology that helps us learn new hacking techniques from attackers and intruders. The much information from multiple Honeypot servers, the more appropriate signatures we can generate. To ease the administrator to manage and monitor trace files from multiple Honeypot servers that are distributed in various locations at the same time, in this paper we design and implement a prototype of log management server to automatically and periodically collect log files from them. Information reported by each Honeypot server will be sent in secure manner to the log management server. The log management server then parses the information into the database server, where users can search for specific information through the web interface, such as searching based on one or two Honeypot servers. Moreover, the geographical distribution of attackers is visualized in the world map by utilizing the WHOIS database and GeoPlot software. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Game-based analysis of eavesdropping defense strategy in WMN with directional antenna

    Page(s): 29 - 33
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1304 KB) |  | HTML iconHTML  

    This paper is concerned with the framework for finding the optimal stochastic routing to defend intelligent eavesdropping attacks in the Wireless Mesh Network (WMN) with a cone-based, directional antenna. A game-theoretical model is used to find the best strategy to maximize the expected number of secure sessions (ES) under the most severe circumstance. In particular, the WMN has been modeled by the two-person constant-sum game with two players, namely, a network defender and a network eavesdropper. Numerical results show that the enhancement of antenna directionality by decreasing the beamwidth can help improve ESS only in the sufficiently large network case of downlink. In addition, the optimal defending strategy at the proposed game equilibrium has been found to give a better ESS improvement in the downlink case than in the uplink case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile MPLS with route optimization: The proposed protocol and simulation study

    Page(s): 34 - 39
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1730 KB) |  | HTML iconHTML  

    Mobile MPLS, as the integration of Mobile IP and MPLS (Multiprotocol Label Switching), has the benefits of having mobility support from Mobile IP and quality of service support from MPLS. These benefits are important to mobile networks carrying various Internet services to mobile users. Nevertheless, Mobile MPLS inherits a problem of routing inefficiency called triangle routing from Mobile IP. This paper proposes a route optimization protocol to overcome this problem in Mobile MPLS. By adding a correspondent agent function to Mobile MPLS's edge routers, the mobility binding of a mobile node can be cached by the edge routers and the packet routing to the mobile node can be route-optimized. We evaluate our proposal by implementing it on the Network Simulator (NS-2). The simulation results indicate that the proposed route optimization has improved the performance of Mobile MPLS by reducing its end-to-end delay. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Novel radio resource management for high density chaotic wireless LANs

    Page(s): 40 - 45
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1226 KB) |  | HTML iconHTML  

    It is well known that WLAN based on the IEEE 802.11 standard suffers from interference and scalability problems due to the limited number of non-overlapping channels. In order to mitigate the interference problem, channel assignment algorithms have been a popular research topic in recent years. It has been shown that such algorithms can greatly reduce the interference among wireless access points. However, in this paper we present our findings that traditional channel assignment algorithm can introduce a high hidden node index in high network density, thus greatly reducing the WLAN performance. We show that careful consideration needs to be taken when assigning channels using such algorithms. In addition, we propose a novel algorithm, called Cluster Channel Assignment (CCA), which is presented in the form of a state diagram. From our simulation results, we show that CCA can outperform traditional channel assignment in densely deployed scenarios, and is therefore a better alternative in such settings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Passive monitoring method for analysis Quantum Key Distribution performance statistics

    Page(s): 46 - 49
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1565 KB) |  | HTML iconHTML  

    This paper emphasizes the development of network monitoring appliance for monitoring network health, network resources and for further analysis of Quantum Key Distribution (QKD) performance where QKD devices located in different locations. It provides tools and services for end users who enable to view real time QKD performance statistics on the network. As it is very important to keep track of each key parameter involved with device status and QKD temporal evolution to perform traffic analysis and to determine the error probability during the phase of key generation. The system has been developed from a Network Health Analysis and Monitoring system (NetHAM) implemented under an open source platform, offered more features both graphical statistics display and user friendly interface. In addition, this paper proposed a conformance passive monitoring method to analysis the QKD performance. The log from QKD layer has been converted to well organized database format before storing it in the database server. The relevant information will be invoked for network topology display, link and device status that would be helpful for end user can easily view the QKD performance with frequently updated through the dynamic graphical display and for further historical data analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance improvement of cloud storage using a genetic algorithm based placement

    Page(s): 54 - 57
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1377 KB) |  | HTML iconHTML  

    Cloud storage is a massive and public accessible storage available for use on internet. Since the number of users and data access request will be massive, a good performance improvement algorithm is needed. In this work, a technique of using a smart object placement is presented. The model for cloud storage and object placement are discussed. Then, genetic algorithm is used to optimize the placement function to gain a better average access speed for any storage object. The experimental results show an obvious performance increases due to a better object placement. The result of this work can be applied to enhance performance of both private and public storage cloud. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Personal Cloud Filesystem: A distributed unification filesystem for personal computer and portable device

    Page(s): 58 - 62
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (645 KB) |  | HTML iconHTML  

    This paper describes Personal Cloud Filesystem, a modular userspace filesystem framework for accessing and manipulating data on multiple remote computers or mobile devices. One of its novelty is that it uses mechanisms similar to those employed by unification filesystem to present a unified view of files and folders from remote machines to user. This allows data from multiple remote sources to appear as if they reside together locally in the filesystem's mount point. It also supports offline operation by automatically caches frequently use data for offline usage. Benchmark results from prototype have shown acceptable performance, despite the increased overhead. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security analysis of the TMN protocol by using Coloured Petri Nets: On-the-fly trace generation method and homomorphic property

    Page(s): 63 - 68
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (439 KB) |  | HTML iconHTML  

    The TMN protocol is a secure key exchange protocol for mobile communication system. Its security has been analyzed thoroughly by many approaches, and many attacks have been found. Recently, we have developed a new Coloured Petri Net (CPN) approach to analyze cryptographic protocols, and then applied it to analyze the TMN protocol with the homomorphic property of the underlying public-key encryption. As preliminary analyses, we found two new attacks of the protocol. In this paper, we extend our previous works in two aspects. Firstly, we compare the performance between our new method and a traditional method to analyze attacks in cryptographic protocols. Surprisingly, our method is more efficient when the number of states and traces are large. Secondly, we found three new and interesting variants of our previous attacks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transforming state tables to Coloured Petri nets for automatic verification of internet protocols

    Page(s): 69 - 74
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (448 KB) |  | HTML iconHTML  

    Rapid developments in networking technologies is resulting in an increasing number of new communication protocols being created, but formal methods are seldom used to verify their design. This paper presents a set of rules for transforming state tables, a common format of protocol specifications in standards, into a formal model based on Coloured Petri nets. This reduces time for developing and debugging CPN models, which can then be used for protocol verification. Formal definitions of subsets of state tables and CPNs are presented, as well as the transformation algorithm. To demonstrate the transformation an example of Stop-and-Wait protocol is used as a case study. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wi-Fi access point discovery system for mobile users

    Page(s): 75 - 79
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2120 KB) |  | HTML iconHTML  

    Wi-Fi access provides a very convenient way for mobile terminals to connect the Internet. However, locating points where connections can be made is not always easy. In this paper, we propose a Neighbor Wi-Fi Access Point Advertisement System. The features of our system are as follows: (1) A personal access point function operates on mobile terminals that continuously detect and collect information on nearby Wi-Fi access points (APs) within its radio detection range. (2) Detected and collected Wi-Fi AP information, such as locations and network names, are shared between mobile terminals in proximity with each other. (3) Neighbor Wi-Fi AP information can then be advertised to clients through their personal access points. In our system, a client is a mobile terminal that does not have access privileges for nearby APs. In such cases, clients will not connect to the Internet through the restricted APs; they will simply obtain information regarding APs that are available nearby, yet outside their normal detection range. We developed a prototype system and have confirmed the usability of its basic functions by experiment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 3D Shot course estimation system for tactics analysis support of handball games

    Page(s): 83 - 86
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1454 KB) |  | HTML iconHTML  

    In this paper, we propose a 3D shoot course estimation method for tactics analysis of handball games using the video recordings captured by two interlaced video cameras. To achieve the accurate estimation of the 3D position of the ball, an algorithm for temporal and geometrical calibration is employed to calibrate two cameras because the speed of the ball is high and the sub-frame calibration is important for our system. To estimate the 3D position of the ball, it is important to detect the 2D positions of the ball in respective frames captured by each camera. However, many false detections occur because of occlusions caused by frequent hard contact play and highspeed moving ball thrown by a player to the goal. Therefore, we eliminate the false detections based on the consistency of the ball positions through multiple frames using the fact that the trajectory of the ball is straight in almost all of the case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model of ontology driven case-based reasoning for electronic issue management systems

    Page(s): 87 - 90
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1071 KB) |  | HTML iconHTML  

    An electronic issue management system, alternatively known as a help desk system, refers to a computer application that can be used to electronically automate the process of managing business issues, including problems, defects, tasks, changes or new requests. The difficulties found in using such a system are often from the lack of expertise to resolve the issues that are stored by the system. This paper proposes to use ontology and case-based reasoning to better provide structured information and enable the capturing of tacit knowledge of experts for issue management. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.