Accepted Papers
  • Modeling and Analysis on XSW Attacks on SAML
    Xingwei Zhao, Yong Fang, Xiang He and Liang Liu ,Sichuan University,China
    ABSTRACT
    In this paper,we present a analysis of the structural characteristics of the evil assertion involved document using graph theory.At first, we prove that by the given definition a XML document can regard as a tree graph.Then after a brief mention of the attacks,we transform a SAML document into tree graph and make KNUTH transform of the graph.Finally we present and prove the conclusion that we can only check the structure rather than the inner content to judge whether evil assertion(s) exist(s).
  • FPGA Implementation of Synchronization Circuits for Optical CDMA receivers
    Waddah Saif,King Saud University,Saudi Arabia
    ABSTRACT
    Synchronization in direct-detection optical CDMA network with unipolar OOC codes is carried out in two stages. The first stage is code acquisition in which the receiver is synchronized to the spreading code with accuracy within one-half of chip duration. The second stage is the tracking phase in which more accurate pulse tracking is performed. In this paper, we present two implementation architectures for the acquisition stage based on serial and parallel realizations of the acquisition algorithm. Both architectures are implemented in FPGA and their performance is compared. The tracking phase in our implementation is performed using the early-late technique.
  • Cover time Analysis of a Secure Ad-hoc Wireless Network
    Bhupendra Gupta and Subir Singh Lamba,PDPM Indian Institute of Information Technology,India
    ABSTRACT
    In this work our focus is on the cover time analysis of a secure ad-hoc wireless network, when the nodes are allowed to move with in an compact space. We consider a secure wireless random network in 2-dimensional space, and a sequence Xn = {X1,X2, . . .Xn}, with n nodes distributed uniformly over a compact space C _ R2. We derive a strong law result for the cover time of the network and proved that for key pool is of order of n log n and key ring is of order of log n, the cover time of the network is of order of n5/2/(log n)2 almost surely, where n be the number of the nodes in the network.
  • A Cross-Layer Delay-Aware Multipath Routing Algorithm for Mobile Ad Hoc Networks
    Mahadev Gawas, Lucy G. Gudinho and Joseph Rodrigues,BITS PILANI K.K.Birla Goa campus,India
    ABSTRACT
    Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop count as the main metric for path selection, hence are not suitable for delay sensitive real time applications. To support such applications delay constrained routing protocols are employed. These Protocols makes path selection between source and destination based on the delay over the discovered links during routing discovery and routing table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDM-AODV) based on delay constraint. It employs cross-layer communications between MAC and routing layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay incurred at each intermediate node. Performance of the proposed protocol is compared with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and reduced overhead between intermediate nodes.
  • A novel mathematical model to calculate TCP throughput
    Mohammad Mehdi Hassani,Islamic azad university amol branch,Iran
    ABSTRACT
    Wlan networks have a great influence in human every days life . you can see its usage in airport, wireless transmission like mobile, to prevent fire in jungle, communications,... est. but what is the relation between math and network? network is a simulation model of graph and the throughput of its many parameters is measured by analytical models .one of this math application in network fields is markov model. we evaluate extensively through analysis, simulation, and experimentation the interaction between the TCP flows. the main goal of this paper is calculation the throughput ratio between upstream and downstream TCP flows. at last, we demonstrate a mathematical model to Analysis the behavior of up/down flows and we prove that it can be used in real models.