By Topic

Systems and Networks Communications, 2007. ICSNC 2007. Second International Conference on

Date 25-31 Aug. 2007

Filter Results

Displaying Results 1 - 25 of 88
  • Second International Conference on Systems and Networks Communications - Cover

    Publication Year: 2007 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (62 KB)  
    Freely Available from IEEE
  • Second International Conference on Systems and Networks Communications-Title

    Publication Year: 2007 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (62 KB)  
    Freely Available from IEEE
  • Second International Conference on Systems and Networks Communications-Copyright

    Publication Year: 2007 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (74 KB)  
    Freely Available from IEEE
  • Second International Conference on Systems and Networks Communications - TOC

    Publication Year: 2007 , Page(s): v
    Save to Project icon | Request Permissions | PDF file iconPDF (95 KB)  
    Freely Available from IEEE
  • Preface

    Publication Year: 2007 , Page(s): vi
    Save to Project icon | Request Permissions | PDF file iconPDF (57 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2007 , Page(s): vii
    Save to Project icon | Request Permissions | PDF file iconPDF (92 KB)  
    Freely Available from IEEE
  • QoS Routing In Ad Hoc Networks by Integreting Activity in the OLSR Protocol

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

    Ad hoc networks (AHNs) include mobile nodes with limited communication resources on which the path selection is usually made according to a best effort strategy. Today, AHNs are facing a new challenge: a QoS routing based on bandwidth and delay requirements. The importance of this challenge makes this issue focused by several researchers. Consequently, we are interested in this paper by a routing QoS oriented in AHNs. One of the major contributions of this paper concerns the proposition of a novel layered QoS architecture and a contention resolution mechanism allowing a QoS routing definition. Our proposition is based on traffic classification and requires metrics definition allowing the expression of the QoS requirements in order to provide differentiated routing according to traffic classes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LATEX DSL: A Coverage Control Protocol for heterogeneous Wireless Sensor Networks

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

    In recent years, there has been a growing interest in wireless sensor networks. Since the sensor nodes have limited available power, energy conservation is a critical issue in all researches about sensor networks. Developing a coverage control protocol to prolong networks life is one of the most important solutions. Based on analyzing the existing coverage control approaches and the features of heterogeneous sensor networks, we propose a distributed coverage control strategy based on location information (DSL) for heterogeneous sensor networks. In DSL, each node calculates the coverage degree locally, and the node scheduling strategy is based on weak time synchronization scheme. Under the premise of guaranteeing nodes k-coverage precisely , DSL can make as more as possible nodes inactive. Simulation results demonstrate that our protocol can reduce the number of active nodes effectively while achieve the required coverage degree, balance the energy consumption and maintain long network View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A J2ME transparent middleware to support HTTP connections over Bluetooth

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

    Over the last years, a call for embedding computation into the environment has been arisen. This philosophy has been often referred to as pervasive or ubiquitous computing, to remark the aim to a dense and widespread interaction among computing devices. User intervention and awareness are discarded, in opposition to an automatic adaptation of applications to location and context. To this aim, much attention is drawn to technologies supporting dynamicity and mobility over small devices which can follow the user anytime, anywhere. The Bluetooth standard particularly fits this idea, by providing a versatile and flexible wireless network technology with low power consumption. Operating in a license-free frequency, users are not charged for accessing the network nor they need an account with any company. Bluetooth dynamically sets up and manages evolving networks, by providing the possibility of automatically discovering devices and services within its transmission range. Research studies have forecasted that within a few years, most of the devices accessing the Web will be mobile, and presumably most of them will be Bluetooth-enabled. Therefore, we need solutions that encompass networking, systems, and application issues involved in realizing mobile and ubiquitous access to services. In this paper, we present a transparent middleware which extends the possibility of accessing Web resources also from Bluetooth-enabled smartphones. All the implementation details will be hidden both to users and to application developers, allowing an easy and complete portability of applications working on traditional TCP/IP communication protocols towards the Bluetooth technology. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Comparison of TCP and CBR in MAODV Ad hoc Network

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

    Multicast Ad hoc On-Demand Distance Vector (MAODV) [1] is the multicast protocol associated with the Ad hoc On-Demand Distance Vector (AODV) [2,7] routing protocol, and as such it shares many similarities and packet formats with AODV. The Route Request and Route Reply packet types are based on those used by AODV, as is the unicast Route Table. The purpose of this paper is to compare the performance of TCP and CBR in MAODV Ad hoc network, where the efficiencies of TCP and CBR are evaluated in various parameters environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Threshold Cryptography and Authentication in Ad Hoc Networks Survey and Challenges

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

    The dynamic and cooperative nature of ad hoc networks present challenges in securing these networks. There are recent research efforts in securing ad hoc networks. Amongst security approaches, there are threshold cryptography and authentication. In this paper we survey the threshold cryptography based schemes and the authentication schemes that have been proposed to secure ad hoc networks. We conclude this paper and identify the challenges and open research areas associated with each of these approaches. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Movement Prediction Using Bayesian Learning for Neural Networks

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

    A technique for reducing the wireless cost of tracking mobile users with uncertain parameters is developed in this paper. Such uncertainty arises naturally in wireless networks, since an efficient user tracking is based on a prediction of its future call and mobility parameters. The conventional approach based on dynamic tracking is not reliable in the sense that inaccurate prediction of the user mobility parameters may significantly reduce the tracking efficiency. Unfortunately, such uncertainty is unavoidable for mobile users, especially for a burst mobility patterns. In this paper, we present a novel hybrid Bayesian neural network model for predicting locations on Cellular Networks (can also be extended to other wireless networks such as WI-FI and WiMAX). We investigate different parallel implementation techniques on mobile devices of the proposed approach and compare it to many standard neural network techniques such as: Back-propagation, Elman, Resilient, Levenberg-Marqudat, and One-Step Secant models. Bayesian learning for Neural Networks predicts location better than standard neural network techniques since it uses well founded probability model to represent uncertainty about the relationships being learned. The result of Bayesian training is a posterior distribution over network weights. We use Markov chain Monte Carlo methods (MCMC) to sample N values from the posterior weights distribution. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Position-Based Routing Algorithm for the Reduction of Overhead in Ad-hoc Networks

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

    Mobile ad-hoc network is an independent system formed by a set of mobile nodes that can communicate through wireless links. The difference between these networks and cellular networks is that mobile ad-hoc networks do not have any fixed and pre-existing infrastructure. Because of mobile nodes in ad-hoc networks, the topology is not fixed and changes rapidly Hence, many routing algorithms have proposed for these networks. Position-based algorithms use physical position information of nodes in routing. In these networks each node determines its location by GPS. In this paper a new position-based routing algorithm which is called ILAR (improved location-aided routing) have proposed. In this algorithm, with insertion of routes in intermediate nodes' caches and using of position information of intermediate nodes and several other improvements in ILAR algorithm, overhead is reduced and more bandwidth is allocated to data transmission. Simulation results show that ILAR algorithm leads to an improvement in overhead. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Operators on Hyperbola and Hyperboloid

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

    Jacket matrices which are defined to be mtimesm matrices J = [jik] over a field F with the property JJdagger = mIm, J is the transpose matrix of elements inverse of J. i.e., Jdagger = [jik -1]T, was introduced by Lee in 1984 and are used for digital signal processing and coding theory. This paper presents some square matrices A2n which can be eigenvalue decomposed by Jacket matrices. Specially, A2 and its extension A3 can be used for modifying the properties of hyperbola and hyperboloid, respectively. The ideas that we will develop here have applications in computer graphics and used in many important numerical algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MANET ID : Improvement on Group Communications and ZRP

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

    A Mobile Ad hoc NETwork (MANET) could establish a communication in network infrastructure-less places. In an ad hoc network, a basic IPv6 address auto-configuration mechanism has an address allocation problem. A number of address allocation mechanisms have been suggested. However, mobile node(MN)s have high mobility and random address. Therefore, they do not guarantee fixed and shared network prefix. To guarantee equality of network prefix among connected MNs, we propose a MANET identifier (MANET.ID). This scheme allows MNs to share the same MANET_ID using a creation & negotiation phase. By sharing an equal MANET_ID, we achieve a number of enhancements for existing ad hoc network technologies: Enhanced group communication, avoiding duplicate address detection storms, and enhanced zone routing protocol (ZRP). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Adaptive Inter-Mobility Supports Scheme for NetLMM

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

    In this paper, we propose an adaptive inter- mobility supports scheme for Network-based Localized Mobility Management (NetLMM). The NetLMM approach uses Proxy Mobile IPv6 (PMIPv6) technique and employs a PMIP client to manage a mobile node (MN) within a local mobility domain (LMD). The distinguishing mark is that an MN does not need to have a mobility stack for mobility supports within the NetLMM approach. However, the NetLMM approach has not provided an inter-mobility, where the MN hands off between the LMDs. Thus, in this paper, we propose the adaptive inter-mobility supports scheme where an MN hands off between the LMDs even though the MN does not have the mobility stack. In the proposed scheme, the old LMA recognizes that the MN has been moved into a specific LMA and then the old LMA forwards the packets destined to the MN to the specific LMA. Thus, the proposed scheme provides a seamless handoff service and inter-mobility supports. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Stable Clustering Algorithm for Highly Mobile Ad Hoc Networks

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

    The dynamic topology of ad hoc networks is an important issue on which a lot of research is carried out. Because of higher speeds of movement and networks of larger scale, the algorithms of auto-organization and clustering may be inefficient. Therefore, we propose a fully distributed clustering algorithm for mobile ad hoc networks in which the nodes can move at higher speeds. The main objectives of this algorithm consists in reducing the reconstruction of the topology and stabilizing it as a long time as possible. This clustering algorithm can be used by several routing algorithms for ad hoc networks. Under proper simulations, we show that optimal cluster head characteristics: connectivity, energy and mobility, lead to a stable topology in terms of reconfiguration frequency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cluster Label-based ZigBee Routing Protocol with High Scalability

    Publication Year: 2007 , Page(s): 12
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (684 KB) |  | HTML iconHTML  

    Since the ZigBee mesh routing algorithm is similar to AODV based on flooding, the networks suffer from the scalability problem as the number of nodes or the data traffic increases. Thus, for low-rate ZigBee mesh networks it is necessary to design an effective routing protocol to take the scalability into account. In this paper, we propose a ZigBee mesh routing protocol based on cluster label (ZiCL). As ZiCL hierarchically divides a ZigBee-enabled network into one or more logical clusters, when a node starts route discovery procedure, it encourages nodes with the same cluster label to share the routing information. This results in fewer route discoveries, and hence effectively relieves the number of potential control traffic required to establish a shortest path between nodes. Simulation results show that ZiCL helps to reduce routing overhead and improve performance of ZigBee mesh networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Position-Based Routing Protocol for Reducing the Number of Exchanged Route Request Messages in Mobile Ad-hoc Networks

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

    Mobile Ad-hoc network is a network of mobile nodes that within, the mobile nodes, communicate through almost slow links. In an Ad-hoc network, two nodes can communicate with each other if their distance became lower than the minimum of their transmission range. So, sending message between two nodes in such network may need routing between intermediate nodes, therefore, a specific route between such nodes should be considered. In this paper, the reasons of route breakage which are recognized by Location Aided Routing (LAR) protocol will be studied and in the following, we propose a new routing protocol that will reduce the number of exchanged route request messages. Our experimental results show that by using this protocol, the number of nodes which participate in routing operation and also the average time of route discovery will be reduced, considerably. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Scheme to reduce the handoff latency using mSCTP in Fast Mobile IPv6

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

    As improvement of wireless and mobile technologies, mobile devices such as laptops and PDAs are widely used. To support the mobility of such devices, mobile IPv6 (MIPv6) was proposed. In addition, fast mobile IPv6 (FMIPv6) and hierarchical mobile IPv6 (HMIPv6) was proposed for the seamless handoff. On the other hands, in transport layer, mobile stream control transport protocol (mSCTP) was proposed for the mobility support. The dynamic address resolution (DAR) signal in mSCTP provides an IP configuration to the Mobile Node (MN). With the DAR, the MN can change its IP address dynamically without connectionless. In the handoff procedure of FMIPv6, access routers (ARs) make the tunnel between them to reduce packet loss during link layer handoff. However, this scheme causes AR's packet forwarding process and buffering overhead. In addition, due to exchange some message to make the tunnel, a few handoff signaling costs and latencies are occurred in FMIPv6. Thus, in this paper, we propose the integrated handoff scheme using mSCTP in FMIPv6 to solve such problems. In the proposed scheme, the tunnel is not created anymore, because the MN uses the DAR signals to the handoff. Therefore, the proposed scheme removes tunneling overhead, a few signaling costs, and latencies. Moreover, the MN not executes a binding update (BU) procedure with the correspondent node (CN) after link layer handoff, because the MN registers a new IP address to CN in advance. The result of performance evaluation show that the proposed scheme reduces handoff latency about 54% and signaling cost about 45% compared to FMIPv6. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameterized Hierarchical Layer Topology Construction for Wireless Networks

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

    Recently, a promising network topology for wireless networks, the Hierarchical Layer Graph, has been introduced. This topology consists of arbitrary many layers of nodes with low-interference short-distance links in the lower layers and long-distance links in the higher layers which allow for paths with a small number of hops. The construction algorithm which was given for this topology is based on node IDs. In this paper, we present a novel distributed construction algorithm that computes each node's rank in the hierarchy based on arbitrary metrics. A mathematical analysis shows the benefits which our algorithm entails. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Seamless Fast Handover in Mobile IPv4 Using Layer-2 Triggers

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

    In this paper, we propose a new layer-3 (L3) handover scheme which is able to provide the more seamless service than the existing schemes even without buffer. The proposed scheme uses layer-2(L2) triggers and applies the tunnel mechanism and pre- registration method of the low latency handoff scheme in mobile IPv4 (LLH) [1] simultaneously. The tunnel is used to transfer the traffic to the mobile node (MN), which has registered the care-of address of new foreign agent (FA) with home agent (HA) while being still connected to the subnet of the old FA, until the MN connects to the new link By simulation, we prove its enhanced performance in terms of throughput, delivery rate, end-to-end packet transmission delay, and delay jitter. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Certification and Revocation Schemes in Ad Hoc Networks Survey and Challenges

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

    Ad hoc networks have many features that make them attractive for the use in many applications. However, there are many unsolved problems in ad hoc networks; securing the network being one of the major concerns. The dynamic and cooperative nature of ad hoc networks present substantial challenges in securing these networks. In this paper, we focus on the role of Certification Authorities (CAs) in securing ad hoc networks communication. We introduce the concept of certification authorities and their selection, we survey and classify the certification schemes and give a brief overview on the revocation schemes. We conclude and end this paper by discussing some challenges and research issues in the certification and revocation in ad hoc networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE 802.11 network behaviour in the presence of Bluetooth network

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

    IEEE 802.11 and Bluetooth are the most popular wireless transmission interfaces. As they operate in the same unlicensed frequency band, despite spread spectrum techniques, some interferences may occur. This paper presents the results collected in an experimental, wireless network containing elements of both standards. They show how active Bluetooth piconet degrades usable parameters of IEEE 802.11. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alternative Approximation of Check Node Algorithm for DVB-S2 LDPC Decoder

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

    In this paper, a new approximation of the check node rule algorithm is proposed for updating the check nodes messages in LDPC decoding. The new technique evaluates the check node min-sum magnitude algorithm using the Taylor series and results in reduced computational complexity and hardware implementation. The architecture of a check node processing unit, implementing the new alternative approximation of the check node, is also presented. The proposed method can achieve the same BER performance with a reduction of ~20% hardware complexity in the LDPE decoder. The simulation results obtained shows that the packet error rate performance of 10-7, which is the DVB-S2 requirement for MPEG packets transmitted, can be achieved with this new method. View full abstract»

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