By Topic

Networking and Information Technology (ICNIT), 2010 International Conference on

Date 11-12 June 2010

Filter Results

Displaying Results 1 - 25 of 131
  • [Front and back cover]

    Page(s): c1 - c4
    Save to Project icon | Request Permissions | PDF file iconPDF (89 KB)  
    Freely Available from IEEE
  • [Title page]

    Page(s): i - xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (888 KB)  
    Freely Available from IEEE
  • A novel method for fingerprint feature extraction

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

    Fingerprint recognition is a method of biometric authentication that uses pattern recognition techniques [1] based on high-resolution fingerprints images of the individual. Fingerprints have been used in forensic as well as commercial applications for identification as well as verification. The fingerprint surface is made up of a system of ridges and valleys. The steps for Fingerprint recognition include image acquisition, preprocessing, feature extraction and matching [2]. In the present work, a new fingerprint feature detection algorithm has been proposed. It has been found that presence of noise in fingerprint images leads to spurious minutiae. To overcome this problem, feature extraction has been done which efficiently determine the minutiae points in fingerprint [1]. The proposed method can be used in matching the template for finding bifurcation and termination. The new smoothing algorithm is proposed for the detection of the features of fingerprints. A method has been introduced for finding ridges in the fingerprint image with the help of eight different masks. It is a process of making a binary image of ridges from the grayscale fingerprint image. The experimental results showed the accuracy of the algorithm in terms of genuine acceptance rate, false rejection rate, false acceptance rate. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The creation of new research directions through collaboration between disciplines

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

    In 2004 the Knowledge-based Intelligent Engineering Systems (KES) Centre and the Aviation Education, Research and Operations (AERO) Laboratory formally agreed to collaborate on a number of aviation safety related projects. This collaboration has been important, and highly advantageous, in the identification of aviation safety related problems and their potential AI/CI based solutions. The collaboration has led to the development of a small group of seven researchers, including four PhD students. This will expand to eight PhD students from the end of 2009. This paper will describe the aviation safety projects that have arisen out of this collaboration. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • E-learning tools and remote reconfigurable systems for engineering education

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

    This paper presents an original approach proposed and successfully used in University of Aveiro and targeted to advance e-learning tools and remote laboratories for state-of-the-art engineering education. Nowadays, reconfigurable systems, in general, and FPGA (field-programmable gate array) based systems, in particular, constitute an essential part of engineering practice. The respective professional trends are, however, not reflected accordingly in contemporary engineering education curricula. The paper argues importance of reconfigurable systems in education and proposes effective learning methods and tools, which include laboratory templates, animated tutorials, education-oriented examples, a remotely reconfigurable prototyping system, and a virtual software/reconfigurable hardware co-simulation environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyber crimes: Threats and protection

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

    Information Technology has grown tremendously during the last two decades and became the main source of knowledge. The latest information and the current technology are available through the Internet making it the most valuable source of information to almost all people from the novice to the expert in all fields of knowledge. Yet with the usefulness and importance of the Internet, the misuse and the cyber crime become more evident. In this paper we try to explore some of these cyber crimes and the ways to protect from them. We discuss different types of cyber crimes namely: social engineering-phishing, email spoofing and pharming. We also discuss the ways to protect ourselves from such crimes with emphasis on biometrics. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impulse noise detection and reduction using fuzzy logic and median heuristic filter

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

    In this paper we proposed a new technique for detects and removes impulse noise in grayscale digital images. Proposed method work in two steps, in first step we detect noisy pixels using fuzzy reasoning with lowest uncertainty, and in second step we replace noisy pixels with a heuristic median filter, our heuristic median's filter is combined with human knowledge for select best replacement. We analysis this method with PSNR (Pick Signal Noise Ratio) metric and visual comparison, the results show this method is very good for noise reduction and image restoration in high level noisy images. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SPIDERS: Swift prime implicant derivation through exhaustive rotation and sort

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

    This paper introduces a software tool named SPIDERS which uses a novel iterative algorithm to derive prime implicants from logic functions. The algorithm takes the logic function as a list of binary numbers indicating the minterms to be disjointed. The numbers are first sorted using a special sorting algorithm with a time complexity of order O(n). Then they are rotated and sorted again in each iteration. Thus, the ith iteration of the algorithm places minterms differing only in the ith literal in successive locations of the list. By doing so, prime implicants appear as consecutive blocks of numbers in the list. The SPIDERS algorithm exhaustively derives all prime implicant from the input function during a number of iterations which is equal to the number of logic variables. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DSR with link prediction using Pareto distribution

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

    In this paper, we have introduced a mathematical model to estimate the availability of the link using Pareto distribution to represent the pdf of epoch length. We have used Pareto distribution since it is assumed that small epoch length will occur more frequently and larger epoch length will occur less frequent. Further, this future estimate of link availability is used in determining alternative routes before the current route fails so that messages are delivered without failures. This timely delivery of data improves QoS by reducing latency, and increasing throughput and delivery ratio by use of alternate route. We have incorporated link prediction model with DSR routing algorithm to test the performance of the model. Further, it has been compared with DSR with link prediction using exponential distribution. The simulation results show DSRP and DSRE improves performance of the network and DSRP performs better than DSRE. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using clustering techniques to analyze fraudulent behavior changes in online auctions

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

    Schemed fraudsters often flip behavior in terms of circumstances change as camouflage for disguising malicious actions in online auctions. For instance, the fake transaction records interwoven with real trades are indistinguishable from legitimate transaction histories. The ways of fraudulent behavior changes formulate different types of tricks for swindling. To avoid trading with fraudsters, recognizing the types of fraudulent behavior changes in advance is helpful in choosing appropriate trading partners. Therefore, in order to distinguish the types of behavior changes from different fraudsters, clustering techniques were applied such as X-Means for grouping in characteristics. Afterwards, C4.5 decision trees were employed for inducing the rules of the labeled clusters. In this study, the real transaction data of 236 proven fraudsters was collected from Yahoo!Taiwan for testing. The experimental results demonstrate that the fraudsters are categorized into 4 natural groups and the vast majority of fraudster, 93% of fraudsters on average, follows certain default models to develop a scam. The findings of this study also make online auction early fraud detection possible. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A computational approach to multimedia communication networks

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

    Multimedia communication is becoming a common means of human interaction. This increasing amount of information transmitted over wireless and land-line communication channels has to be handled efficiently to avoid congestion and delays in the network service. In this work, a computational approach to multimedia data transmission is proposed. One of its basic assumptions is that in many situations the multimedia information could be decomposed into basic components or building blocks that represent a significant part of the data. To illustrate the capabilities of the proposed approach, a compression system for video streams is investigated and tested. The system is based on the observation that in most multimedia systems, events of recent history of the stream can be used to describe present and future details of the multimedia information. Experimental results indicate a high compression ratio of more than 100:1, obtaining almost lossless visual reproduction with less than 0.1% distortion. The proposed approach can be similarly used also for other components of the data stream. Our conclusion is that the proposed computational approach could be efficient in presently used communication systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic shared backup wavelength protection in waveband switching networks

    Page(s): 43 - 48
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (945 KB) |  | HTML iconHTML  

    In this paper, we study the protection problem with shared backup wavelength in waveband switching networks and propose a new Dynamic Waveband Shared Protection (DWSP) algorithm based on Waveband Layered Auxiliary Graph (WLAG) to survive the single-fiber link failure with considering the consumption of all-optical switching ports and add/drop ports. Simulation results show that DWSP obtains better performances than previous algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Template based SOA framework for dynamic and adaptive composition of web services

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

    Automated Web service composition is currently one of the major research problems in the area of service oriented computing. Web services facilitate seamless business-to-business integration. Whenever it becomes difficult to find a single service for a particular task, a composition of services that can together perform the given task, is required. In general, this is accomplished using Service Oriented Architecture (SOA). However, the requirements of the users are frozen before the system locates, composes and executes the required services. The response is not personalized to the user environment. Further, conventional web services cannot handle the context and the context aware web services need to contain the context processing logic. Hence, we propose a framework for dynamic composition of Web services using templates in SOA. This framework allows maximum flexibility for the users to change their requirements at runtime and provides adaptive composition irrespective of whether a web service is context enabled or not. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Metadata approach in modeling multi structured data collection using object oriented concepts

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

    In designing an enterprise wide system, a system architect must consider different concerns of the stakeholders. In this paper, we propose a generic metadata approach for modeling data with multi structure representations derived from different points of view of the stakeholders. The notion of structures/organizational views of data is separated from the collection of the data itself. We introduce two layers of the generic metamodel: (1) dataset: real data handled as a collection; (2) viewpoint: a more abstract layer describing the many structures/metadata for each point of view. The idea of datasets and viewpoints are adopted from the concepts of abstract and concrete class in object oriented modeling. To validate the generic model, we provide several case studies. We expect the proposed model provides a better architectural way of thinking in modeling an enterprise. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision tree based Support Vector Machine for Intrusion Detection

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

    Support Vector Machines (SVM) are the classifiers which were originally designed for binary classification. The classification applications can solve multi-class problems. Decision-tree-based support vector machine which combines support vector machines and decision tree can be an effective way for solving multi-class problems in Intrusion Detection Systems (IDS). This method can decrease the training and testing time of the IDS, increasing the efficiency of the system. The different ways to construct the binary trees divides the data set into two subsets from root to the leaf until every subset consists of only one class. The construction order of binary tree has great influence on the classification performance. In this paper we are studying two decision tree approaches: Hierarchical multiclass SVM and Tree structured multiclass SVM, to construct multiclass intrusion detection system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determining JINI leasing time limits using the random waypoint mobility model in mobile ad hoc networks

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

    Many protocols for distributed systems employ leasing mechanisms to recover from failures, where a leaseholder is granted access to data or services for a limited time (lease period. In such cases, choosing an appropriate lease period that is to be granted plays a crucial part in the fair and efficient access of data or services by the leaseholders. Existing algorithms vary lease periods with system size to achieve the best responsiveness. However applying the same algorithms in MANETs may not be the best option as they are dynamically self-organizing wireless networks. Here we use the JINI network technology and implement the Random Waypoint Mobility Model to determine the limits to be set while granting of the lease time to service providers in MANETs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Steady State Genetic Algorithm for scheduling university exams

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

    Scheduling exams timetable, first and second exams, for large number of courses within Al Al-Bayt university departments is a complex problem since it has to be solved by using traditional method, manually by hands. In addition, it takes several days of iterative work by taking feedback from student. We describe an effective solution to solve this problem by using different form of Genetic Algorithm; Steady State Genetic algorithm(SSGA), Enhanced Steady State Genetic Algorithm(ESSGA), and Simple Genetic Algorithm(SGA). After performing a set of tests using real student data from several departments, we found that the ESSGA gains better timetable than other methods. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SDRR: Serial Directional Rumor Routing in wireless sensor networks

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

    The rumor routing is a method extracted from the random movement of software agents basis. This paper presents a model based on the mentioned principal for routing in wireless sensor networks. First in this article we will present a model based on query agents dispatch which is called Serial Directional Rumor Routing (SDRR.) Then we will examine the advantages and disadvantages of this model compared to Directional Rumor Routing (DRR) which is an other model based on parallel agent dispatch. Next will propose a method to improve SDRR so that by removing some of shortcomings such as delays and path lengths, model can gain and edge over other models. The obtained results show a considerable improvement over Directional Rumor Routing (DRR). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A code-based sleep and wakeup scheduling protocol for low duty cycle sensor networks

    Page(s): 80 - 85
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (457 KB) |  | HTML iconHTML  

    One of the key challenges in wireless sensor networks is to design an energy efficient communication protocol. In this paper, we present an innovative code-based sleep and wake-up scheduling scheme to minimize energy consumption caused by idle listening. The proposed scheme called SWAP divides time into slots of equal length, and at the beginning of each slot a sensor node enters either an active or power-saving state. The slot scheduling at each node is based on a binary vector, which is constructed using the mathematical properties of finite fields. The set of scheduling vectors generated by SWAP distributes active slots of nodes evenly over entire time frame. This distribution of active slots reduces channel contention and allows better channel utilization. The SWAP scheduling scheme also ensures that any pair of neighboring nodes using the proposed scheduling scheme will be able to communicate each other since their active periods overlap at least once within a cycle of the sleep and wake-up slots. We also design a packet prioritization scheme in SWAP to reduce the packet latency of delay sensitive packets. To evaluate the energy efficiency and performance of the proposed mechanism, we have implemented SWAP in TOSSIM, and compared it with a widely used channel access protocol, BMAC with LPL, in terms of packet delivery ratio, power consumption and delay. The results of our study show that SWAP outperforms BMAC in terms of energy consumption while maintaining comparable packet delivery ratio and latency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel method for self management of the energy consumption of nodes dying out of low battery capacity in a NTP based routing environment of MANETs

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

    Battery capacity is an important factor that decides the network lifetime. If any node is dying out of low battery capacity then as a consequence there will be dropping of packets. So, it is vital to protect the node from becoming unstable due to reduction in remaining battery capacity. This paper proposes a self management scheme where the node automatically manages its energy consumption thereby saving its battery capacity until its recharge by continuous `unstable node' tracking method at an optimum threshold battery capacity value. This method also rectifies the drawback of the network getting blocked with the help of two methods: either self recovery of nodes or by intelligently adapting to the safest routing point in order to conserve the energy until recharge. The novel `unstable node' tracking method is devised exclusively for Node Transition Probability (NTP) based routing environment and the same technique can be carried over to any protocol by manipulating the corresponding control packets as proposed in the paper. And the intelligent adaptation technique has been extended to universal usage and the performance had been carried out in AODV. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Location service for mobile ad hoc networks with holes

    Page(s): 91 - 96
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1040 KB) |  | HTML iconHTML  

    Geographic routing protocols allow stateless routing by taking advantage of the location information of mobile nodes and thus are highly scalable. Location service provides the location information of mobile destinations to source nodes so that location-based routing can be applied. Location service in mobile ad hoc networks is challenging because of the absence of any central intelligence in the network. Although some location service schemes are proposed, no location service scheme is presented for networks with holes. In this paper, we propose Grid-based Quorum Location Service (GQLS) and Hash-based Quorum Location Service (HQLS) schemes for mobile ad hoc networks with holes. The proposed location service scheme GQLS and HQLS use grid management and has capability to tolerate the holes. The simulation results show that the location service scheme GQLS and HQLS have better performance than XYLS in query and maintenance overhead. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Botnet detection based on traffic monitoring

    Page(s): 97 - 101
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (389 KB) |  | HTML iconHTML  

    Botnet is most widespread and occurs commonly in today's cyber attacks, resulting in serious threats to our network assets and organization's properties. Botnets are collections of compromised computers (Bots) which are remotely controlled by its originator (BotMaster) under a common Commond-and-Control (C&C) infrastructure. They are used to distribute commands to the Bots for malicious activities such as distributed denial-of-service (DDoS) attacks, spam and phishing. Most of the existing Botnet detection approaches concentrate only on particular Botnet command and control (C&C) protocols (e.g., IRC,HTTP) and structures (e.g., centralized), and can become ineffective as Botnets change their structure and C&C techniques. In this paper, we proposed a new general detection framework. This proposed framework is based on finding similar communication patterns and behaviors among the group of hosts that are performing at least one malicious activity. The point that distinguishes our proposed detection framework from many other similar works is that there is no need for prior knowledge of Botnets such as Botnet signature. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Oscillation suppression cognitive multicast routing in integrated Satellite- HAP system structures

    Page(s): 102 - 107
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (949 KB) |  | HTML iconHTML  

    This paper illustrates the issue of traffic variable routing in Satellite-HAP system networks with multicasting capabilities. The proposed routing technique includes the joint utilization and delay metrics as the two major criteria affecting the QOS. Due to the induction of traffic utilization into consideration, the system encounters route oscillations which are affecting the system QOS. The performance of the proposed system has been improved using new cognitive routing with the objective of making the routing decision based on the long term changes, rather than inducing short term traffic load oscillations. The system performance has been evaluated and compared using three different smoothing functions. The new proposed routing techniques help to suppress the route oscillations and accelerate reaching the system steady state. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Retrieval and integration of audiovisual contents for TV using Semantic Web technologies

    Page(s): 108 - 112
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (813 KB) |  | HTML iconHTML  

    The increase of audiovisual content in DTV accessible by the audience requires mechanisms for integrating information and for advanced content search oriented to user preferences. Semantic approaches offer promising solutions to solve this problem. In this work, we present a system based on Semantic Web technologies capable of querying different content resources and integrate the information to present it uniformly to the user. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High throughput MAC scheduling algorithm for intelligent transportation sensor network

    Page(s): 113 - 117
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (490 KB) |  | HTML iconHTML  

    MAC protocol is of vital importance to the reliable communication of WSN for it schedules the limited wireless resources among sensor nodes. In this paper, focused on the intelligent transportation sensor network application requiring real-time transmission of a large amount of data, a MAC scheduling algorithm based on hybrid TDMA/FDMA scheme is proposed. The scheduling algorithm takes advantage of the data-gathering tree communication model to allocate time slots and frequency channels to sensor nodes, so as to maximize parallel transmission. To ensure non-collision communication, we propose two principles of scheduling. Simulation results show that the scheduling algorithm can provide higher network throughput and lower latency than MMSN and 1-channel TDMA-based scheduling algorithm. View full abstract»

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