By Topic

Information Technology, 2007. ITNG '07. Fourth International Conference on

Date 2-4 April 2007

Filter Results

Displaying Results 1 - 25 of 209
  • International Conference on Information Technology - Cover

    Publication Year: 2007 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (357 KB)  
    Freely Available from IEEE
  • International Conference on Information Technology - Title

    Publication Year: 2007 , Page(s): i - iii
    Save to Project icon | Request Permissions | PDF file iconPDF (41 KB)  
    Freely Available from IEEE
  • International Conference on Information Technology - Copyright

    Publication Year: 2007 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (39 KB)  
    Freely Available from IEEE
  • International Conference on Information Technology - Table of contents

    Publication Year: 2007 , Page(s): v - xviii
    Save to Project icon | Request Permissions | PDF file iconPDF (157 KB)  
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2007 , Page(s): xix
    Save to Project icon | Request Permissions | PDF file iconPDF (93 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2007 , Page(s): xx
    Save to Project icon | Request Permissions | PDF file iconPDF (66 KB)  
    Freely Available from IEEE
  • Programming Highly Parallel Reconfigurable Architectures for Public-Key Cryptographic Applications

    Publication Year: 2007 , Page(s): 3 - 10
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (186 KB) |  | HTML iconHTML  

    Tiled architectures are emerging as an architectural platform that allows high levels of instruction level parallelism. Traditional compiler parallelization techniques are usually employed to generate programs for these architectures. However, for specific application domains, the compiler is not able to effectively exploit the domain knowledge. In this paper, we propose a new programming model that, by means of the definition of software function units, allows domain-specific features to be explicitly modeled, achieving good performances while reducing development times with respect to low-level programming. Identity-based cryptographic algorithms are known to be computationally intensive and difficult to parallelize automatically. Recent advances have led to the adoption of embedded cryptographic coprocessors to speed up both traditional and identity-based public key algorithms. Custom-designed coprocessors have high development costs and times with respect to general purpose or DSP coprocessors. Therefore, the proposed methodology can be effectively employed to reduce time to market while preserving performances. It also represents a starting point for the definition of cryptography-oriented programming languages. We prove that tiled architecture well compare w.r.t. competitors implementations such as StrongARM and FPGAs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Reconfigurable Processor for the Cryptographic nT Pairing in Characteristic 3

    Publication Year: 2007 , Page(s): 11 - 16
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (282 KB) |  | HTML iconHTML  

    Recently, there have been many proposals for secure and novel cryptographic protocols that are built on bilinear pairings. The eta T pairing is one such pairing and is closely related to the Tate pairing. In this paper we consider the efficient hardware implementation of this pairing in characteristic 3. All characteristic 3 operations required to compute the pairing are outlined in detail. An efficient, flexible and reconfigurable processor for the etaT pairing in characteristic 3 is presented and discussed. The processor can easily be tailored for a low area implementation, for a high throughput implementation, or for a balance between the two. Results are provided for various configurations of the processor when implemented over the field F397 on an FPGA View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Hardware for Modular Exponentiation Using the Sliding-Window Method

    Publication Year: 2007 , Page(s): 17 - 24
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (466 KB) |  | HTML iconHTML  

    Modular exponentiation is an essential operation for various applications, such as cryptography. The performance of this operation has a tremendous impact on the efficiency of the whole application. Therefore, many researchers devoted special interest to providing smart methods and efficient implementation for modular exponentiation. One this method is the sliding-window method, which pre-processes the exponent into zero and non-zero partitions so that the number of modular multiplications required computing the modular power is reduced. In this paper, we devise a novel hardware for computing modular exponentiation using the sliding-window method. The implementation is efficient when compared against existing hardware implementations of the modular exponentiation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Novel Resource Management Schemes for Integrated Wireless Networks

    Publication Year: 2007 , Page(s): 25 - 30
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (134 KB) |  | HTML iconHTML  

    Although a lot of resource management schemes have been proposed to support multiple traffic in wireless networks, they mostly focused on a single wireless network, such as cellular network. In order to provide more comprehensive services, an integrated wireless network is introduced which consists of several different types of wireless networks and provides more connection options for mobile users than a single wireless network. However, it also imposes a great challenge to efficiently utilize the resources, where existing resource management schemes may not be suitable. In this paper, we propose two resource management schemes to support multiple traffic in an integrated wireless network. In these two schemes, higher priority traffic can preempt lower priority traffic. The system performances are evaluated and compared with one existing scheme by extensive simulations. The simulation results show that the proposed schemes can significantly improve the system performances View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TCP Congestion Window Optimization for CDMA2000 Packet Data Networks

    Publication Year: 2007 , Page(s): 31 - 35
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (282 KB) |  | HTML iconHTML  

    TCP developed for wired networks assumes congestion as the reason of packet loss. This assumption might not be true for infrastructure based wireless networks like CDMA2000 packet data networks due to other reasons of packet loss like higher bit error rate, hard handoffs, limited bandwidth and multi-path fading. Hence knowing the reason of packet loss is important. We propose a TCP congestion window optimization mechanism for CDMA2000 packet data networks that introduces new flags in TCP packet at PDSN to make both communicating entities aware of the reason of packet loss. Loss-aware communicating ends initiate TCP slow start mechanism only if the reason of packet loss is congestion not data corruption View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computationally Efficient Resource Allocation in OFDM Systems: Genetic Algorithm Approach

    Publication Year: 2007 , Page(s): 36 - 41
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (248 KB) |  | HTML iconHTML  

    In this paper subcarrier and power allocation to each user at base-station maximizes the user data rates, subject to constraints on total power and bit error rate. First, each subchannel is assigned to the user with best channel-to-noise ratio for the channel, with random power distributed by water filling algorithm. The Gao's (2006) subcarrier allocation algorithm was used to calculate the power for each population in of genetic algorithm model. With the goal of minimize the overall transmit power while ensuring the fulfillment of each user's data rate and bit error rate (BER), the needed allocation is proposed through genetic search. The proposed genetic search helps fast convergence and can handle large allocations of subcarriers to users without performance degradation. The simulation results show that genetic algorithm approach will be used where complex computations are involved and near optimal solution are acceptable for optimum resource allocation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Time-Based Random Waypoint Mobility Model for Wireless Mobile Networks

    Publication Year: 2007 , Page(s): 42 - 47
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (279 KB) |  | HTML iconHTML  

    In this paper time-based random waypoint (TBRWP) model is analyzed in detail. Random waypoint model has been studied in mobility literature extensively. Traditional RWP model is based on the independency of the velocity and trajectory; TBR WP, instead, focuses on the independency of motion time and trajectory. Basic model is introduced and general method to evaluate the asymptotical probability density function (PDF) is presented. The model for the one-dimensional and two-dimensional cases with uniform destination distribution in unit square area is solved and exact closed form formulas is obtained. Moreover, normal distribution of nodes in one- and twodimensional models is investigated and practical approximations are derived for them. To verify the obtained results an extensive simulation is performed and tight results are obtained View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • No-Beacon GEDIR: Location-Based Ad-Hoc Routing with Less Communication Overhead

    Publication Year: 2007 , Page(s): 48 - 55
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (632 KB) |  | HTML iconHTML  

    For wireless multi-hop message transmission in ad-hoc networks, sensor networks and mesh networks, on-demand route detection is important due to limited battery capacity and mobility. For route detection, it is desirable for mobile computers to transmit less control messages; however, flooding of a route request message in DSR and AODV or repeated location information advertisement in GEDIR, FACE and GPSR is required. This paper proposes no-beacon extensions of GEDIR ad-hoc routing protocol applying on-demand exchange of location information in NB-GEDIR and timer setting based on distance in CNB-GEDIR. Since both protocols do not require repeatedly broadcasted beacon messages, no communication overhead is required in case that there is no route detection request. In simulation, CNB-GEDIR requires 85.1% less control messages than NB-GEDIR View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of a QoS Signaling API for Advanced Multimedia Applications in NGN

    Publication Year: 2007 , Page(s): 56 - 64
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (425 KB) |  | HTML iconHTML  

    As a standardized NGN architecture, the 3rd generation partnership project IP multimedia subsystem (IMS) defines standard service capabilities and interfaces, as well as a common IP-based infrastructure, which enable operators to introduce new services in an efficient and flexible way. In order to exploit the capabilities offered by an IMS operator, multimedia application developers face a business challenge to create applications which can run on a variety of user devices, and possibly adapt to various network conditions and user preferences. Our goal was to identify common generic functionality related to session-level QoS signaling for advanced multimedia applications and to design a high-level application programming interface (API), which invokes this functionality. The paper describes the dynamic service adaptation model on which the proposed API is based, the API specification, and its implementation in Java. A prototype multimedia application featuring a 3D networked game provides an example of using the API View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study on Worm Poisoning Technology

    Publication Year: 2007 , Page(s): 65 - 70
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (284 KB) |  | HTML iconHTML  

    In this paper, concepts of worm poisoning and PoisonWorm are presented and the feasibility of worm poisoning is testified. A propagation model named SIRP Model and PoisonWorm's side-effect on network traffic are given and compared with the classical epidemic Kermack-Mckendrick model. The feasibility and necessity of PoisonWorm and its application are highlighted in an active defense system against Internet worms. In addition, the technology of P2P-based unknown worm detection and signature verification are introduced briefly View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Discrete-time Queue Analytical Model based on Dynamic Random Early Drop

    Publication Year: 2007 , Page(s): 71 - 76
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (381 KB) |  | HTML iconHTML  

    Congestion is one of the main problems in networks such as the Internet that has been studied by many researchers. Since the fast development in computer networks and the increase of demands on network resources such as bandwidth allocation and buffer spaces, congestion control becomes a crucial task. In this paper, we introduce a dynamic random early drop (DRED) discrete-time queue analytical model to deal with network congestion incipiently. We compare the proposed analytical model with the original DRED algorithm with reference to packet loss probability, average queue length, throughput, and average queuing delay. The experimental results clearly show that when the traffic load increases, DRED router buffer drops packets on a higher rate than the proposed analytical model, which consequently degrades the throughput performance. Furthermore, the packet loss rate for the proposed analytical model is often stable is not affected with the increase of the traffic loads, and thus stabilise the throughput performance View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Two-Layer Signature-Based IDS with Unequal Databases

    Publication Year: 2007 , Page(s): 77 - 82
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (360 KB) |  | HTML iconHTML  

    Signature-based detection is the most widely used technique for intrusion detection systems (IDS). One of the major challenges for signature-based IDS is how to keep up with a large volume of incoming traffic when each packet needs to be compared with every signature in the database. When an IDS cannot keep up with the traffic flood, all it can do is to drop packets, therefore, may miss potential attacks. In this paper, we propose a dynamic model of two-layer signature-based IDS with unequal database, which can detect imminent threats with very high success rate by automatically creating and using a small efficient database, and at the same time, provide mechanisms to detect all other known threats by using a less efficient complementary database View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new Dynamic Key Generation Scheme for Fraudulent Internet Payment Prevention

    Publication Year: 2007 , Page(s): 83 - 88
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (244 KB) |  | HTML iconHTML  

    Fraud prevention is one of the most important security properties of electronic commerce (e-commerce). A strong authentication mechanism is a fundamental requirement in managing fraud on the Internet. Several authentication systems were proposed however; they are not effective enough to prevent attackers from performing illegal transactions over the Internet. In this paper, we propose a new dynamic key generation scheme DKGS with algorithms for different technologies that is more capable than the existing systems in preventing fraudulent Internet payments View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • THIS: THreshold security for Information aggregation in Sensor networks

    Publication Year: 2007 , Page(s): 89 - 95
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (121 KB) |  | HTML iconHTML  

    Message aggregation can be used to reduce the communication overhead in a network where many messages have the "same" content. However, it may make the network less secure because, once the aggregator is compromised, the data correctness cannot be ensured. In this paper, we present a new scheme THIS that allows a base station to accept the aggregated data only if a majority of sensor nodes in the sensing area report "similar" data. This solution enables messages to be aggregated in a secure and efficient manner View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proactive model for Mitigating Internet Denial-of-Service Attacks

    Publication Year: 2007 , Page(s): 96 - 101
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (333 KB) |  | HTML iconHTML  

    Denial-of-service is one of the most frequent, costly and rapidly growing attacks on the Internet. In a denial of service attack, a malicious user exploits the connectivity of the Internet to cripple the services offered by a victim site, often simply by flooding a victim with many requests. In this paper we have compared the three main architectures already proposed for mitigating the DoS attacks. The comparison is with respect to incremental deployment, traffic analysis, and the attacks on the infrastructure itself. Finally, we combine the strengths of the different proposals to propose a new model for denial of service. Our model uses the concept of active networks to mitigate DoS attacks View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IdSRF: ID-based Secure Routing Framework for Wireless Ad-Hoc Networks

    Publication Year: 2007 , Page(s): 102 - 110
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (232 KB) |  | HTML iconHTML  

    In this paper, we propose an ID-based secure routing framework (IdSRF) for the secure routing in wireless ad-hoc networks. It uses an ID-based signature scheme without certificates, which has two advantages compared with previous solutions. First, it has a low overhead in communication, computation and storage. Second, it can protect changeable fields in the packet headers. Any misbehavior at an intermediate node can be detected. IdSRF is a generic scheme and can be applied to a variety of routing protocols. Our analysis shows that IdSRF can achieve those advantages with a manageable cost View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual Sensor Networks - A Resource Efficient Approach for Concurrent Applications

    Publication Year: 2007 , Page(s): 111 - 115
    Cited by:  Papers (31)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (204 KB) |  | HTML iconHTML  

    Current focus of sensor networks is on systems dedicated for a specific application. Wide variety of circumstances point to the need for sensor network deployments capable of sharing the physical network resources. We introduce the concept of virtual sensor networks (VSN) to provide protocol support for the formation, usage, adaptation and maintenance of subsets of sensors collaborating on specific tasks. VSN concept also promises to enhance applications that involve dynamically varying subsets of sensor nodes collaborating tightly to achieve the desired outcomes, while relying on the remaining nodes to achieve connectivity and overcome the deployment and resource constraints. This article explores the concept, mechanisms, and benefits of using VSN. Examples of VSN support functionality include support for nodes to join and leave VSNs, broadcast within a VSN, and merging of VSNs. VSNs will simplify application deployment, enhance performance and scalability, facilitate resource sharing, and provide a degree of physical topology independence in wireless sensor networks. Deployment of overlapping sensor networks aimed at different tasks, especially in harsh environments, will also significantly benefit when organized as VSNs over a shared infrastructure View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cell-based Distributed Addressing Technique Using Clustered Backbone Approach

    Publication Year: 2007 , Page(s): 116 - 121
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (366 KB) |  | HTML iconHTML  

    Wireless sensor networks are characterized by their low data rates, autonomous functioning and longevity. Low power consumption in such energy-constrained networks is a central issue and we target this design parameter by proposing and implementing a novel cell-based distributed addressing technique (C-DAT) over a k-power level sensor network. This paper introduces a clustered backbone approach for data forwarding and shows how data aggregation can be achieved, by implementing a MIN query over the network The proposed scheme is evaluated for power consumption during addressing and various network dynamics using a Java based network simulator. Results obtained highlight some key variable power-level model parameters and power consumption trends View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Node Clustering in Wireless Sensor Networks by Considering Structural Characteristics of the Network Graph

    Publication Year: 2007 , Page(s): 122 - 127
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (218 KB) |  | HTML iconHTML  

    The deployment of wireless sensor networks in many application areas, e.g., aggregation services, requires self-organization of the network nodes into clusters. Quite a lot of node clustering techniques have appeared in the literature, and roughly fall into two families; those based on the construction of a dominating set and those which are based solely on energy considerations. The former family suffers from the fact that only a small subset of the network nodes are responsible for relaying the messages, and thus cause rapid consumption of the energy of these nodes. The later family uses the residual energy of each node in order to direct its decision about whether it will elect itself as a leader of a cluster or not. This family's methods ignore topological features of the nodes and are used in combination with the methods of the former family. We propose a novel distributed clustering protocol for wireless sensor networks, based on a novel metric for characterizing the importance of a node, w.r.t. its contribution in relaying messages. The protocol achieves small communication complexity and linear computation complexity. Experimental results for various sensor network topologies show that the protocol generates only a few clusters, guaranteeing a small number of message relays thus improving network lifetime View full abstract»

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