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]

    Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (652 KB)  
    Freely Available from IEEE
  • [Title page i]

    Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (10 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (377 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (104 KB)  
    Freely Available from IEEE
  • Table of contents

    Page(s): v - xi
    Save to Project icon | Request Permissions | PDF file iconPDF (167 KB)  
    Freely Available from IEEE
  • Preface

    Page(s): xii - xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (64 KB)  
    Freely Available from IEEE
  • Organizing Committee

    Page(s): xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (60 KB)  
    Freely Available from IEEE
  • list-reviewer

    Page(s): xv
    Save to Project icon | Request Permissions | PDF file iconPDF (47 KB)  
    Freely Available from IEEE
  • New Algorithm for Computing Network Reliability Using Matrix Column-Transformation

    Page(s): 3 - 7
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 some variable logical expression. With branching tree nodes, we can write out factored expression of s-t reliability of network G. This method, combining with technique, can make the obtained OBDD branching tree compacted, and execution by computers may use little memory and avoid sub-graph redundancy. 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

    Page(s): 8 - 10
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 be used to decide to define a gene for a network event is also discussed and a method to calculate the fitness of a network event is also given. 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

    Page(s): 11 - 15
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 outperforms the existing schemes. This improvement is because we have combined the advantages of both THP and lattice reduction thus the effective transmitting power is significantly increased. 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

    Page(s): 16 - 19
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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. If the illumination changes rapidly and nonmonotonously, many algorithms fail. In this paper, we do some research on the condition when there is a single light which simulates a continuously and rapidly varying illumination. This kind of condition has many applicable scenes in daily life. This scene can be seen not only in doors or in the dark or in underground architecture but also out doors or in the light. We propose a new algorithm based on the illumination factor which can be applied to not only the indoor environment but also outdoors with natural illumination. In our algorithm, illumination factor is computed through the comparison of background and the current frame. The background is estimated and updated based on this factor, which tracks the change of background accurately and reduces the chance of failure. Experiments have proven the effectiveness of our method. 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

    Page(s): 20 - 23
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 particle initialization and similarity measure step to lower the background distraction. Second, we form the proposal distribution for particle filters from the dynamic model predicted from the previous time step. The combination of the two approach leads to fewer failure than traditional particle filters. Fusion of multiple cues including the spatial-color cues and edge cues is also used to improve the estimation performance. It is shown that with the improved proposal distribution above, the particle filter can provide greatly improved estimation accuracy and robustness for complicated tracking problems. 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

    Page(s): 24 - 28
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 continuous varying illumination. This scene can be seen indoor or in the dark or in underground architecture and in some daytime conditions. We consider three different conditions on the background luminance, and a new algorithm based on these conditions through calculating the illumination factor is advanced, it can relative precisely obtain the moving objects in this scene compared to other algorithms. 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

    Page(s): 29 - 33
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 tree-based approach and offers a better tradeoff between control overhead and delay performance than mesh-pull approach. However, this hybrid design brings about new issues, such as how to distinguish `good' nodes, seamless push-pull switching, as well as load-balance and fine-grained bandwidth control in backbone overlay, where we propose corresponding approaches to address these issues.Experimental results obtained via network simulation demonstrate that our hybrid solution boosts the multicasting quality and also effectively reduces the control overhead. 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

    Page(s): 34 - 38
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 discuss some related works. Then the design and implementation of uSD are amply illustrated, especially about the uSD's superiority over SDIO-based method. Through simulation, one important parameter is obtained. At last, a practical work is shown. The result of this work not only validates uSD's feasibility, but also well demonstrates its platform independence. 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

    Page(s): 39 - 41
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (148 KB)  

    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 optimal four round tweakable dual MISTY-Type transformation which use the XOR-universal permutation to replace some round pseudo random permutation and reduce the number of the pseudorandom permutation by using some permutation repeatedly. 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

    Page(s): 42 - 49
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 solution to the difficulty of identity determination. In this paper various obstacles that prevent biometric systems from achieving foolproof automatic person recognition are represented, some problems faced by single modal biometric systems are explained and vulnerabilities of biometrics systems are discussed with on how to safeguard them from some ordinary attacks. 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

    Page(s): 53 - 57
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 distance between neighbor nodes. A mapping table including optimal transmission power and node's address is established during the route building procedure. The transmission power can be gotten through searching the table with the address of next hop in latter data transmission. Finally, we implement the PCBRP scheme in a real system and set up a test-bed to illustrate its operations. 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

    Page(s): 58 - 62
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 the channel links are mutually independent and the destination terminal combines signals received from the source and relay terminals based on the principle of maximal ratio combining (MRC). Finally, we verify our analysis by comparing with another way of relaying. 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

    Page(s): 63 - 67
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 signal power over distance due to path loss and shadowing. We mainly focus on the scenario in which RSs are fitted on a fast-moving train to cover UEs on the train and improve the communication quality of conventional wireless cellular networks along the railway. By comparing with conventional wireless cellular network without relaying, the results show that under certain conditions mobile relays offer tangible Call Dropping Probability performance improvement benefits. 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

    Page(s): 68 - 72
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 performance measures, such as average throughput, end to end delay and number of hops. The simulations were conducted in network simulator 2 (ns-2) with Monte Carlo method and the equipped vehicles were generated randomly according to the penetration rate. From the simulation results we found that the bidirectional traffic streams indeed affect each other's communication performance. In addition, the average throughput and end to end delay can be improved by increasing the transmission range and penetration rate. The study could help to fix some network parameters such as transmission range to advance the communication performance of IVC networks. 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

    Page(s): 73 - 77
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 used. In this paper Two types of constraints are considered: 1) transmission power constraints at the nodes, and 2) the communication channel between the nodes and the decision center. we propose a optimal distributed estimation algorithm in energy-constrained wireless sensor networks. Finally, we demonstrate the applicability of our results through numerical examples. 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

    Page(s): 78 - 82
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 needed. There are huge amount of flows in one eNB and the rate varies from 10 kbps to 10 0Mbps. In addition, the radio channel has the time-varying nature. All of them produce the challenge to the flow control of LTE/SAE. This paper proposes the hierarchy virtual queue (HVQ) based flow control mechanism to solve the problems. Simulation results show HVQ flow control requires fewer resources but produces better system performance. 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

    Page(s): 83 - 87
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 product design process is one kind of lamination nesting structure, its design task decomposition is whether reasonable, will directly affect the product design flow and the design cycle, moreover the task coupling relations will involve the design change dissemination and the design recollection, therefore, will have to carry on the coordination and the control to each sub-task advancement, under certain rule control each task distribution for the different design personnel, will avoid as far as possible with the reduced coordination design process in the conflict, thus the guarantee coordination design overall task will complete smoothly. This article has studied the task theory of dissociation, has given the product coordination design task concrete decomposition method, uses the design structure matrix to judge the rationality which the task decomposes and to the task to carry on the reorganization, gives the coupling task collection the decoupling method. Finally, it has given the task plan function module network realization flow. View full abstract»

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