By Topic

Advances in Mobile Network, Communication and its Applications (MNCAPPS), 2012 International Conference on

Date 1-2 Aug. 2012

Filter Results

Displaying Results 1 - 25 of 45
  • [Cover art]

    Publication Year: 2012 , Page(s): C4
    Save to Project icon | Request Permissions | PDF file iconPDF (278 KB)  
    Freely Available from IEEE
  • [Title page i]

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

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

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

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

    Publication Year: 2012 , Page(s): viii
    Save to Project icon | Request Permissions | PDF file iconPDF (81 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Program Committee and Reviewers

    Publication Year: 2012 , Page(s): ix - x
    Save to Project icon | Request Permissions | PDF file iconPDF (107 KB)  
    Freely Available from IEEE
  • Energy conservation in wireless communication systems with relays

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

    The primary purpose of the tutorial is to analyze wireless systems, which employ some sort of relays, from energy efficiency perspective, and explore techniques to make them greener, i.e. to improve their energy efficiency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novelistic Approach for Rapid Beam Forming in Smart Antennas for Wireless Applications Using Smart-Fractal Concepts and New Algorithm

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

    Smart antennas offer a broad range of ways to improve wireless system performance. It provides enhanced coverage through range extension, hole filling and better building penetration. Smart antennas use an array of low gain antenna elements which are connected by a network. Fractal concepts are used in antenna arrays recently. The important properties of fractal arrays are frequency independent multi-band characteristics, schemes for realizing low side lobe designs, systematic approaches to thinning and the ability to develop rapid beam forming algorithms. In this paper, an attempt has been made to apply assignment of usage time and location tag algorithm for smart antennas combined with the fractal concepts to reduce the computational complexity and enhance resource allocation for rapid beam forming algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Issues in Time and Frequency Synchronization in WCDMA System

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

    In the wireless world, the demand for advanced information services is growing. Voice and low-rate data services are insufficient in a world where high-speed internet access is taken for granted. The trend is toward global information networks that offer flexible multimedia information services to users on demand, anywhere, anytime. The third-generation (3G) mobile communication (International Mobile Telecommunications-2000, IMT-2000) systems are being developed to support a wide range of bearer services with low to high data rates Wideband CDMA (W-CDMA), proposed by 3GPP (Third Generation Partnership Project), is one of the major proposals for ITU IMT-2000 RTT (Radio Transmission Technology) standards. In a WCDMA cellular system, the process of the mobile station searching for a cell and achieving code and time synchronization to its downlink scrambling code is referred to as cell search. Cell search is performed in three scenarios: initial cell search when a mobile station is switched on, idle mode search when inactive, and active mode search during a call. The latter two are also called target cell search. This paper presents various issues in time and frequency synchronization for initial cell search scenarios for the Wideband CDMA (W-CDMA) standard. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overhead-Aware Composition of Parallel Components Using Lazy-Parallel Function Calls

    Publication Year: 2012 , Page(s): 17 - 22
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (208 KB) |  | HTML iconHTML  

    Parallel programming languages, APIs and tools available today try to extract as much performance as possible from parallel programs. But when components are parallelized this way, and are composed inside parallelized sections of code, multiple instances of the component are created, each creating more parallel tasks, resulting in much higher overhead. In this paper we propose a method which forces parallel components to execute serially if parallel execution would cause a high overhead of execution. Three variants of the technique are presented, and simulation results used to gain an insight into the efficacy of the different techniques are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-intensity Analysis for Overlapping of Invariant Textures in Mobile Communications

    Publication Year: 2012 , Page(s): 23 - 28
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (223 KB) |  | HTML iconHTML  

    In the era of information technology explosion in mobile communications, many computationally challenging problem are encountered on surfing of complex scene in the multi-window environment. In this paper, we address the issue of texture based multi-intensity analysis for multiwindow overlapping. In current literature, the various methods have suggested for texture analysis but there are abundant limitations in the algorithm when deploying in the mobile environment. Here, we have developed a basis function in order to achieve minimum possibilities of overlapping windows and enhance the texture appearance on the scene. Furthermore, multi-intensity of textures are decayed into quadrangle in order to analyze intensity parameters such as contrast, homogeneity, energy and correlation. Experimental results show that the proposed method provides an improved performance on gray level matrix of co-occurrence features for overlapping texture in diverse degree of orientations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Designing Approach to Recursive Coding in VLSI Design

    Publication Year: 2012 , Page(s): 29 - 33
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (238 KB) |  | HTML iconHTML  

    The focus of this paper is towards developing an application specific design methodology for low power solutions in recursive coding system. The methodology starts from high level models which can be used for software solution and proceeds towards high performance hardware solutions. Recursive encoder/decoder, a key component of the emerging 3G mobile communications is used for the implementation. The application performance measure, namely bit-error rate (BER) is used as a design constraint while optimizing for power and area coverage. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Route Optimized Secured and Improved Encryption Protocol for Wireless Ad Hoc Network

    Publication Year: 2012 , Page(s): 34 - 38
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (215 KB) |  | HTML iconHTML  

    Wired Equivalent Privacy (WEP) protocol was adopted to protect authorized users from unauthorized access and eavesdropping in the IEEE 802.11 wireless LANs (WLAN). However, it has been proved that the WEP protocol fails to provide data confidentiality and authentication. The WEP provides encrypted communication using an encryption key between the client station and Access point (AP). All client stations and APs on a network use the same key to encrypt and decrypt data. The key resides on both the client station and the AP. The above rendered WEP protocol is naked to major forms of attack. Thus in this paper a keyed-message authentication code aimed at preventing an intruder from tampering with packets in transit is proposed, with a revised authentication scheme to avoid authentication spoofing and reduce replay attacks. We also employed private key scheme alongside the use of day and session keys that counters several attacks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Administrator and Trust Based Secure Routing in MANET

    Publication Year: 2012 , Page(s): 39 - 45
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (420 KB) |  | HTML iconHTML  

    The advent of mobile ad hoc (MANET) network had spurred in a new era of communication where users (nodes) communicate with each other via a self configuring infrastructure less network of mobile devices connected by wireless links. Nodes can participate both as a host as well as a router willing to forward packets for other nodes. So here arises the need of a routing protocol. Now the dynamic topology of the network owing to the node mobility becomes the most challenging part of a routing protocol as it demands a protocol which quickly adapts to topology changes with minimizing control traffic such as periodic update message because of limited resource like storage capacity, battery power and bandwidth. In this paper, we have proposed a new routing scheme, Administrator and Trust Based Secure Routing in MANET (ATSR) which provides routing by making an important use of a parameter, trust, an integer value, helping in the selection of administrator inside the network for routing. The message confidentiality and integrity has also being implemented. The simulation result shows the efficiency, lustiness and trustworthiness of our proposed routing scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use of Support Vector Machines through Linear-Polynomial (LP) Kernel for Speech Recognition

    Publication Year: 2012 , Page(s): 46 - 49
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (217 KB) |  | HTML iconHTML  

    The kernel functions are playing a very important role in machine learning. In this paper, the speech recognition problem is considered as a machine learning problem. The new kernel function called Linear-Polynomial kernel (LP) used to design the support vector machines for speech recognition for improving the generalization performance of speech recognition. The LP kernel performance is very good as compared to linear kernel and polynomial kernel and has improved the generalization performance ability of the speech recognition system. The One-versus-One approach is used for improving the systems efficiency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shortest Path Routing for Co-ordinate Based Mobile Networks: A Genetic Algorithm Approach

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

    A genetic algorithm approach for shortest routing path has been proposed in this paper. The different genetic operations have been modeled with co-ordinate based mobile networks. The simulation study confirms the convergence with the Dijkstra's Algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MIMO Capacity Analysis Using Novel Adaptive Semi Blind Estimation Scheme for Spatial Channel

    Publication Year: 2012 , Page(s): 54 - 59
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (211 KB) |  | HTML iconHTML  

    Multiple Input Multiple Output(MIMO) has been remained in much importance in recent past because of high capacity gain over a single antenna system. In this article, analysis over the capacity of the MIMO channel systems with spatial channel has been considered when the channel state information(CSI) is considered imperfect or partial. The dynamic CSI model has also been tried consisting channel mean and covariance which leads to the extracting of channel estimates and error covariance. Both parameters indicated the CSI quality since these are the functions of temporal correlation factor, and based on this, the model covers data from perfect to statistical CSI, either partial or full blind. It is found that in the case of partial & imperfect CSI, the capacity depends on the statistical properties of the error in the CSI. Based on the knowledge of statistical distribution of the deviations in CSI knowledge, a new estimation approach which maximizes a capacity of spatial channel model has been tried. The interference then interactively reduced by employing the iterative channel estimation and data detection approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Game Theory for Security in Cognitive Radio Networks

    Publication Year: 2012 , Page(s): 60 - 63
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (140 KB) |  | HTML iconHTML  

    Cognitive Radio Networks (CRNs) appear as a probable solution for the shortage of spectrum. However, the Security in cognitive radio network becomes a challenging issue, since more chances are given to attackers by cognitive radio technology compared to general wireless network. These chances may cause degradation the network quality of service but currently there are no specific secure protocols for cognitive radio networks. By this motivation, we present the state of art in security of cognitive radio network. In addition, we present the existing game theory models and non-game theory model for security issues in CRN. The attacks in different protocols layers were also investigated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Study on Various Cryptographic Key Management and Distribution System in Secure Multicast Communications

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

    Many emerging web and Internet applications are based on group communication model. In the Internet, multicast has been used successfully to provide an efficient, best-effort delivery service from a sender to a large group of receivers. Thus, securing group communication (i.e., providing confidentiality, authenticity, and integrity of messages delivered between group members) becomes an important Internet design issue. This paper presents a comprehensive summary of recent works addressing the number of scalable approaches which have been proposed for Key Distribution in Secure Multicast Communication. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative Machine Learning with Information Fusion for Dynamic Decision Making in Diagnostic Applications

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

    In many applications, use of all relevant data to extract more information from multiple sources of information and achieve higher accuracy in prediction is desirable. Cooperative learning is observed in human and some animal societies. Sound knowledge and information acquisition, cooperation in learning amongst multi-agent systems may result in a higher effectiveness compared to individual learning. Cooperative learning in multi agent systems is generally expected to improve both quality & speed of learning. According to survey maximum research papers focus on coordinated approach of agents. Multiple sources of data can be viewed as different, related views of the same learning problem, where dependencies between the views could potentially take on complex structures. This gives rise to interesting and challenging machine learning problems where data sources are combined for learning. This framework encompasses several data fusion tasks and related topics, such as transfer learning, multitask learning, multiview learning, and learning under covariate shift. The advantages of the multiple source learning paradigm is seen in situations where individual data sources are noisy, incomplete, and learning from more than one source can filter out problem-independent noise. Cooperative learning is an approach where one or more team of learners work together towards reaching a better understanding of a specified task. The purpose of this paper is to use this approach to describe a proposal for designing and building a cooperative machine learning system (Multi-Learning system) that contains two or more machine learners that cooperate together. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Design for Slot Synchronization in WCDMA Cell Search

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

    Among the 3G cellular systems being considered, IS-2000 and Wideband Code-Division-Multiple-Access (WCDMA) are both based on direct-sequence code-division multiple-access (DS-CDMA) technology. In these systems, spreading codes are used to differentiate physical channels from the same transmitter, and scrambling codes are used to differentiate transmitters. A mobile station (MS) needs to code and time synchronized to the scrambling code used by the serving cell before any communications with the base station can take place. The synchronization process in W-CDMA can thus be viewed as the five stage process of 1) slot synchronization, 2) frame synchronization and scrambling code group identification, 3) scrambling code identification, 4) frequency acquisition, and 5) cell identification. This paper suggests the improved design of matched filter, used in first stage of WCDMA synchronization. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of DV Hop Localization Algorithm in Wireless Sensor Networks

    Publication Year: 2012 , Page(s): 79 - 82
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (137 KB) |  | HTML iconHTML  

    Today wireless sensor networks has become a key technology for different kinds of smart environments. Sensor node localization which is determining where a given sensor node is physically or relatively located is extremely crucial for most of the applications in wireless sensor networks. Localization has been identified as one of key issues in Wireless Sensor Network (WSN). The widely used localization technique is range-free algorithm, especially DV-HOP (Distance Vector Hop) algorithm. Many localization algorithms have been proposed for wireless sensor network. In this article, we review and estimate the performance limit by changing number of parameters like node density and radio range. The most unsighted parameter is standard deviation of error which is stable in the Simulation results of DV-HOP algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent Path Finder for Goal Directed Queries in Spatial Networks

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

    The Advancements in wireless technologies have led mobile users Geo-savvy. The integration of Geographical Information System (GIS) and Geo Positioning system (GPS) technologies and their wide use in mobile devices, car navigation systems, vehicle tracking system facilitates more users to search for geographical points of interest. The most popular location based application in road networks is k-Nearest Neighbor query. In this paper, a new Goal directed multi-constrained nearest neighbor query (GD-kNN) is introduced. The algorithm finds the data objects in the user direction of travel and shortest path to reach the data objects based on the dynamic constraints that are placed on allowable set of edges that appear on valid path (we restrict multimodal transport and types of roads). The algorithm returns nearest points of interest with their shortest network distance and travel times. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Patient Monitoring for Multiple Patients Using WSN

    Publication Year: 2012 , Page(s): 87 - 90
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (292 KB) |  | HTML iconHTML  

    Real motivation of this research work is to develop an efficient system that can monitor multiple patients' health parameters simultaneously and can effectively deliver the data to a patient monitoring system where it is stored permanently. Current traditional health monitoring is accomplished by individual PCs attached to each patient's bed. The multiple parameters that are monitored are blood pressure, temperature, ECG, and EEG. Our research investigates the potential of WSN to reliably, wirelessly collect, send and process these multiple parameters of multiple patients simultaneously, in real-time. This research succeeds in transforming the traditional individual patient monitoring apparatus and its requirements into an apparatus that is capable of reliably monitoring the multiple parameters of up to six patients simultaneously, in real-time. Managing interference and ensuring the accurate delivery of the information to the monitoring system using the most effective wireless communication technique are the challenges taken in to consideration. This is achieved by identifying each patient's monitored parameter using a unique ID and employing a time scheduling scheme during data transmission. The system also alerts the doctor/nurse of some measured value cross threshold limits. A real time data storage mechanism employed here helps to look further into the recorded data by the doctor. This contribution succeeds in indicating where there could be huge savings in power consumption and cost for hospitals. Currently employed systems use a one patient monitoring system per patient which is expensive, whereas this system uses the same resources to monitor up to six patients, with more comfort to the patients and more convenience for the healthcare professionals. View full abstract»

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