By Topic

Future Networks, 2010. ICFN '10. Second International Conference on

Date 22-24 Jan. 2010

Filter Results

Displaying Results 1 - 25 of 103
  • [Front cover]

    Publication Year: 2010, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (652 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2010, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (10 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2010, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (377 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2010, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (104 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2010, Page(s):v - xi
    Request permission for commercial reuse | PDF file iconPDF (167 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2010, Page(s):xii - xiii
    Request permission for commercial reuse | PDF file iconPDF (64 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2010, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (60 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2010, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • New Algorithm for Computing Network Reliability Using Matrix Column-Transformation

    Publication Year: 2010, Page(s):3 - 7
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    In this paper, we give out some new concepts of 0-column transformation, 1-column transformation and addition of two columns. Using these transformations and network topology , combing with DFS and OBDD technology, we start from last column of the connection matrix, build a OBDD branching tree, which make use of logical expand branching condition, and last, end nodes of branching tree with 1 or so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Genetic Feedback Algorithm Based Network Security Policy Frame Work

    Publication Year: 2010, Page(s):8 - 10
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    Earlier the model suggested was much generalized and simple. It was lacking in clarity about the functioning of its components, which made it difficult to be implemented. In this paper an improved model for the security policy framework is suggested, in which functioning of each component and there interconnectivity is explained clearly. The fitness functions for the system and which parameter can... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tomlinson-Harashima Precoding in the Physical Network Coded Two Way MIMO Relay Channels

    Publication Year: 2010, Page(s):11 - 15
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2763 KB) | HTML iconHTML

    This paper considers precoding schemes in physical network coded two-way MIMO relay channels. We propose a lattice reduction aided Tomlinson-Harashima Precoding(THP) scheme at first, and compare it with the existing amplify-and-forward (AF) scheme zero-forcing (ZF) schemes traditional decode-and-forward (DF) scheme and network coding (NC) scheme. Simulations show that the proposed scheme outperfor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Effective Background Subtraction under a Continuosly and Rapidly Varying Illumination

    Publication Year: 2010, Page(s):16 - 19
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB) | HTML iconHTML

    Background subtraction is an effective method in detecting moving objects in a static scene, which requires a fixed camera, and a static background. Illumination changing is a challenging problem which causes failure of background subtraction. Most background subtract algorithms require the illumination changing slowly, so the object can be tracked accurately and the background is easy to update. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Robust Particle Filter for People Tracking

    Publication Year: 2010, Page(s):20 - 23
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (870 KB) | HTML iconHTML

    Among various tracking algorithms, particle filtering (PF) is a robust and accurate one for different applications. It also allows data fusion from different sources due to its inherent property without increasing the dimension of the state vector. In this paper, we propose three strategies to improve the performance of particle filters. First, our approach combines the foreground region with the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Background Subtraction under Single Varying Illumination in Different Background Luminance

    Publication Year: 2010, Page(s):24 - 28
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (905 KB) | HTML iconHTML

    Background subtraction is widely used in detecting moving objects in a static scene, which requires a fixed camera, and a static background. Most background subtract algorithms require the illumination changing slowly, so can be tracked and updated. If the illumination changes fast and non-monotony, many algorithms fail. Here we research one special scene in changing illumination: single continuou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Trees-Mesh Based Application Layer Multicast Using Collaborative Sub-streams

    Publication Year: 2010, Page(s):29 - 33
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    Recently, the Tree-Mesh based Application Layer Multicast (TM-ALM) has emerged as a promising solution for media streaming over the Internet. In TM-ALM, all peers first organize an auxiliary mesh overlay, and then some 'good' peers are identified to explicitly or implicitly construct a tree(s)-based backbone. The great advantage of TM-ALM is that it has more resilient to end-hosts dynamics than tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • uSD: An SD-Based Mobile Gateway to Wireless Sensor Network

    Publication Year: 2010, Page(s):34 - 38
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1155 KB) | HTML iconHTML

    This paper presents an SD-based mobile gateway to wireless sensor network (WSN), named uSD, which aims at helping users with mobile terminals to access WSN conveniently and efficiently. The prefix "u" of uSD illustrates its most significant characteristic: universality, which means uSD is platform independent and compatible with heterogeneous platforms, truly plug-and-play. In this paper, we first... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Tweakable Blockcipher Based on Dual MISTY-Type Structure

    Publication Year: 2010, Page(s):39 - 41
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB) | HTML iconHTML

    In this paper, on the basis of four round Dual MISTY-Type transformations, we give a method to solve an open problem about tweakable blockcipher proposed by Liskov et al. The problem is how to construct tweakable blockciphers without using a pre-existing blockcipher. We show that tweakable blockcipher can be created directly from dual MISTY-Type structure. Concretely, we built and analyze an optim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Review of Vulnerabilities in Identity Management Using Biometrics

    Publication Year: 2010, Page(s):42 - 49
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (289 KB) | HTML iconHTML

    Although in a number of civilian applications biometric systems have been effectively deployed the current biometric systems are not flawless. For an ID Management system consistent person recognition is an intrinsic component. By distinguishing individuals based on their physiological and/or behavioral characteristics that are innate to the person, Biometrics proposes a natural and dependable sol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power Control Based on Routing Protocol in Wireless Sensor Networks

    Publication Year: 2010, Page(s):53 - 57
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB) | HTML iconHTML

    Power control technology in wireless sensor network (WSN) is of great significance to ensure the network coverage, reduce the power consumption of the nodes, and optimize network performance. In this paper, a new power control based on routing protocol (PCBRP) in the MAC layer is proposed. It operates with the help of routing protocol and calculates optimal transmission power according to the dist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbol Error Rate of Multi-Relay Decode-and-Forward Cooperative Communication Systems under Nakagami-m Fading

    Publication Year: 2010, Page(s):58 - 62
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (409 KB) | HTML iconHTML

    In this paper, we analyze the symbol error rate (SER) performance of multi-relay decode-and-forward (DF) cooperative communications. In the analysis, we focus on the scenario in which the source, destination and relay terminals are each equipped with single antenna transceiver and receiver, and the communication channels are assumed to experience generalized Nakagami-m fading. We consider that all... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call Dropping Probability of Next Generation Wireless Cellular Networks with Mobile Relay Station

    Publication Year: 2010, Page(s):63 - 67
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB) | HTML iconHTML

    It is foreseen that the next generation of wireless cellular network would integrate the relaying scheme. In the relaying scheme, user equipments (UEs) are not only able to communicate directly to the base station (BS) but can also use some relay stations (RSs) to relay their data to the BS. In this paper, we analyze the Call Dropping Probability performance based on the variation in received sign... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Study on Performance of Inter-Vehicle Communications in Bidirectional Traffic Streams

    Publication Year: 2010, Page(s):68 - 72
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (309 KB) | HTML iconHTML

    Inter-vehicle communication (IVC) network has become an important topic in research for its potential advantages in enhancing traffic security and efficiency. This paper investigates the communication performance of IVC networks in two lane bidirectional traffic streams. By changing the transmission range of communication units and penetration rate of equipped vehicles, we studied several performa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-efficient Distributed Detection in Wireless Sensor Networks

    Publication Year: 2010, Page(s):73 - 77
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB) | HTML iconHTML

    We consider energy-efficient Distributed Detection in wireless sensor networks. It is assumed that a group of sensors observe the same quantity in independent additive observation noises with possibly different variances. Each node computes a local statistic and communicates it to a fusion center over Rayleigh fading wireless channels.At the fusion,the linear minimum mean square error (LMMSE) is u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchy Virtual Queue Based Flow Control in LTE/SAE

    Publication Year: 2010, Page(s):78 - 82
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (318 KB) | HTML iconHTML

    One of the key targets for LTE/SAE is 100 Mbps peak data rate in downlink. While compared to the lined data rate, the wireless data rate is still a bottleneck. This means if there is no flow control in aGW; packets will be buffered in eNB. While the buffer in eNB is limited, packets may be dropped. To reduce the harm to the performance of the TCP based application from packet loss, flow control is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research of Collaborative Design Task Management Method Based on Grid

    Publication Year: 2010, Page(s):83 - 87
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (259 KB) | HTML iconHTML

    In the coordination design support environment full use network resources carry on the coordination work, realizes the different person to design the identical product together the goal. In the coordination design process, a complex task is decomposed to small sub-tasks with certain granularity and assigns each sub-task for in the suitable grid node completes by the suitable person. The entire pro... View full abstract»

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