Академический Документы
Профессиональный Документы
Культура Документы
Singapore | Madurai | Chennai | Trichy | Coimbatore | Cochin | Ramnad | Pondicherry | Trivandrum | Salem | Erode | Tirunelveli http://www.elysiumtechnologies.com, info@elysiumtechnologies.com
13 Years of Experience Automated Services 24/7 Help Desk Support Experience & Expertise Developers Advanced Technologies & Tools Legitimate Member of all Journals Having 1,50,000 Successive records in all Languages More than 12 Branches in Tamilnadu, Kerala & Karnataka. Ticketing & Appointment Systems. Individual Care for every Student. Around 250 Developers & 20 Researchers
227-230 Church Road, Anna Nagar, Madurai 625020. 0452-4390702, 4392702, + 91-9944793398. info@elysiumtechnologies.com, elysiumtechnologies@gmail.com
S.P.Towers, No.81 Valluvar Kottam High Road, Nungambakkam, Chennai - 600034. 044-42072702, +91-9600354638, chennai@elysiumtechnologies.com
15, III Floor, SI Towers, Melapudur main Road, Trichy 620001. 0431-4002234, + 91-9790464324. trichy@elysiumtechnologies.com
577/4, DB Road, RS Puram, Opp to KFC, Coimbatore 641002 0422- 4377758, +91-9677751577. coimbatore@elysiumtechnologies.com
1st Floor, A.R.IT Park, Rasi Color Scan Building, Ramanathapuram - 623501. 04567-223225, +919677704922.ramnad@elysiumtechnologies.com
Plot No: 4, C Colony, P&T Extension, Perumal puram, Tirunelveli627007. 0462-2532104, +919677733255, tirunelveli@elysiumtechnologies.com
74, 2nd floor, K.V.K Complex,Upstairs Krishna Sweets, Mettur Road, Opp. Bus stand, Erode-638 011. 0424-4030055, +919677748477 erode@elysiumtechnologies.com
No: 88, First Floor, S.V.Patel Salai, Pondicherry 605 001. 0413 4200640 +91-9677704822 pondy@elysiumtechnologies.com
TNHB A-Block, D.no.10, Opp: Hotel Ganesh Near Busstand. Salem 636007, 0427-4042220, +91-9894444716. salem@elysiumtechnologies.com
Abstract: Many mobile applications retrieve content from remote servers via user generated queries. Processing these queries is often needed before the desired content can be identified. Processing the request on the mobile devices can quickly sap the limited battery resources. Conversely, processing user queries at remote servers can have slow response times due communication latency incurred during transmission of the potentially large query. We evaluate a network-assisted mobile computing scenario where mid-network nodes with leasing capabilities are deployed by a service provider. Leasing computation power can reduce battery usage on the mobile devices and improve response times. However, borrowing processing power from mid-network nodes comes at a leasing cost which must be accounted for when making the decision of where processing should occur. We study the tradeoff between battery usage, processing and transmission latency, and mid-network leasing. We use the dynamic programming framework to solve for the optimal processing policies that suggest the amount of processing to be done at each mid-network node in order to minimize the processing and communication latency and processing costs. Through numerical studies, we examine the properties of the optimal processing policy and the core tradeoffs in such systems. ETPL Predicting Human Movement Based on Telecom's Handoff in Mobile Networks MC-002 Abstract: Investigating human movement behavior is important for studying issues such as prediction of vehicle traffic and spread of contagious diseases. Since mobile telecom network can efficiently monitor the movement of mobile users, the telecom's mobility management is an ideal mechanism for studying human movement issues. The problem can be abstracted as follows: What is the probability that a person at location A will move to location B after T hours. The answer cannot be directly obtained because commercial telecom networks do not exactly trace the movement history of every mobile user. In this paper, we show how to use the standard outputs (handover rates, call arrival rates, call holding time, and call traffic) measured in a mobile telecom network to derive the answer for this problem. ETPL Modeling and Restraining Mobile Virus Propagation MC-003 Abstract: Viruses and malwares can spread from computer networks into mobile networks with the rapid growth of smart cellphone users. In a mobile network, viruses and malwares can cause privacy data leakage, extra charges, and remote listening. Furthermore, they can jam wireless servers by sending thousands of spam messages or track user positions through GPS. Because of the potential damages of mobile viruses, it is important for us to gain a deep understanding of the propagation mechanisms of mobile viruses. In this paper, we propose a two-layer network model for simulating virus propagation through both Bluetooth and SMS. Different from previous work, our work addresses the impacts of human behaviors, i.e., operational behavior and mobile behavior, on virus propagation. Our simulation results provide further insights into the determining factors of virus propagation in mobile networks. Moreover, we examine two strategies for restraining mobile virus propagation, i.e., preimmunization and adaptive dissemination strategies drawing on the methodology of autonomy-oriented computing (AOC). The experimental results show that our strategies can effectively protect large-scale and/or highly dynamic mobile networks. ETPL Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks MC-004
Abstract: Connected dominating set (CDS) has a wide range of applications in multihop wireless networks. The Minimum CDS problem has been studied extensively in multihop wireless networks with uniform communication ranges. However, in practice, the nodes may have different communication ranges either because of the heterogeneity of the nodes, or due to interference mitigation, or due to a chosen range assignment for energy conservation. In this paper, we present a greedy approximation algorithm for computing a Minimum CDS in multihop wireless networks with disparate communications ranges and prove that its approximation ratio is better than the best one known in the literature. Our analysis utilizes a tighter relation between the independence number and the connected domination number. ETPL MC-031 DCIM: Distributed Cache Invalidation Method for Maintaining Cache Consistency in Wireless Mobile Networks
Abstract: This paper proposes distributed cache invalidation mechanism (DCIM), a client-based cache consistency scheme that is implemented on top of a previously proposed architecture for caching data items in mobile ad hoc networks (MANETs), namely COACS, where special nodes cache the queries and the addresses of the nodes that store the responses to these queries. We have also previously proposed a server-based consistency scheme, named SSUM, whereas in this paper, we introduce DCIM that is totally client-based. DCIM is a pull-based algorithm that implements adaptive time to live (TTL), piggybacking, and prefetching, and provides near strong consistency capabilities. Cached data items are assigned adaptive TTL values that correspond to their update rates at the data source, where items with expired TTL values are grouped in validation requests to the data source to refresh them, whereas unexpired ones but with high request rates are prefetched from the server. In this paper, DCIM is analyzed to assess the delay and bandwidth gains (or costs) when compared to polling every time and push-based schemes. DCIM was also implemented using ns2, and compared against client-based and server-based schemes to assess its performance experimentally. The consistency ratio, delay, and overhead traffic are reported versus several variables, where DCIM showed to be superior when compared to the other systems. ETPL MC-032 Evolutionarily Stable Spectrum Access
Abstract: In this paper, we design distributed spectrum access mechanisms with both complete and incomplete network information. We propose an evolutionary spectrum access mechanism with complete network information, and show that the mechanism achieves an equilibrium that is globally evolutionarily stable. With incomplete network information, we propose a distributed learning mechanism, where each user utilizes local observations to estimate the expected throughput and learns to adjust its spectrum access strategy adaptively over time. We show that the learning mechanism converges to the same evolutionary equilibrium on the time average. Numerical results show that the proposed mechanisms achieve up to 35 percent performance improvement over the distributed reinforcement learning mechanism in the literature, and are robust to the perturbations of users' channel selections. ETPL MC-033 Tula: Balancing Energy for Sensing and Communication in a Perpetual Mobile System
Abstract: Conventional wireless broadcast protocols rely heavily on the 802.11-based CSMA/CA model, which avoids interference and collision by conservative scheduling of transmissions. While CSMA/CA is amenable to multiple concurrent unicasts, it tends to degrade broadcast performance significantly, especially in lossy and large-scale networks. In this paper, we propose a new protocol called Chorus that improves the efficiency and scalability of broadcast service with a MAC/PHY layer that allows packet collisions. Chorus is built upon the observation that packets carrying the same data can be effectively detected and decoded, even when they overlap with each other and have comparable signal strengths. It resolves collision using symbol-level interference cancellation, and then combines the resolved symbols to restore the packet. Such a collision-tolerant mechanism significantly improves the transmission diversity and spatial reuse in wireless broadcast. Chorus' MAC-layer cognitive sensing and scheduling scheme further facilitates the realization of such an advantage, resulting in an asymptotic broadcast delay that is proportional to the network radius. We evaluate Chorus' PHY-layer collision resolution mechanism with symbol-level simulation, and validate its network-level performance via ns-2, in comparison with a typical CSMA/CA-based broadcast protocol. Our evaluation validates Chorus's superior performance with respect to scalability, reliability, delay, etc., under a broad range of network scenarios (e.g., single/multiple broadcast sessions, static/mobile topologies). ETPL MC-110 Path Selection under Budget Constraints in Multihop Cognitive Radio Networks
Abstract: Cognitive radio (CR) technology opens the licensed spectrum bands for opportunistic usage and initiates spectrum trading to improve the spectrum utilization. In this paper, we investigate the path selection problem in multihop cognitive radio networks (CRNs) under constraints on flow routing, link scheduling and CR source's budget. We extend the per-user-based spectrum trading in prior work to CR session-based spectrum trading, and effectively develop the spectrum trading mechanisms based on the cross-layer optimization in multihop CRNs. We introduce a new service provider, called secondary service provider (SSP), to help CR sessions to select the paths for packet delivery. Considering the price of bands and the potential returning of primary services at different CR links, the SSP purchases the licensed spectrum and jointly conducts flow routing and link scheduling under the budget constraints. We also propose a 4D conflict graph to characterize the conflict relationship among CR links and mathematically formulate the path selection problem under multiple constraints into an optimization problem with the objective of maximizing the end-to-end throughput. Due to the NP-hardness of the
Abstract: This paper presents an enhanced least-squares positioning algorithm for locating and tracking within indoor environments where multipath and nonline-of-sight propagation conditions predominate. The ranging errors are modeled as a zero-mean random component plus a bias component that is assumed to be a linear function of the range. Through minimizing the mean-square error of the position estimation, an expression for the optimal estimate of the bias parameter is obtained. Both range and pseudo-rangebased positioning are considered. Simulations and experimentation are conducted which show that a significant accuracy gain can be achieved for range-based positioning using the enhanced least-squares algorithm. It is also observed that the pseudo-range-based least-squares algorithm is little affected by the choice of the bias parameter. The results demonstrate that the experimental 5.8-GHz ISM band positioning system can achieve positional accuracy of around half a meter when using the proposed algorithm. ETPL MC-112 Cooperative Wireless-Based Obstacle/Object Mapping and See-Through Capabilities in Robotic Networks
Abstract: In this paper, we develop a theoretical and experimental framework for the mapping of obstacles (including occluded ones), in a robotic cooperative network, based on a small number of wireless channel measurements. This would allow the robots to map an area before entering it. We consider three approaches based on coordinated space, random space, and frequency sampling, and show how the robots can exploit the sparse representation of the map in space, wavelet or spatial variations, in order to build it with minimal sensing. We then show the underlying tradeoffs of all the possible sampling, sparsity and reconstruction techniques. Our simulation and experimental results show the feasibility and performance of the proposed framework. More specifically, using our experimental robotic platform, we show preliminary results in successfully mapping a number of real obstacles and having seethrough capabilities with real structures, despite the practical challenges presented by multipath fading. ETPL MC-113 Optimal Online Sensing Sequence in Multichannel Cognitive Radio Networks
Abstract: We address the problem of rapidly discovering spectrum opportunities for seamless service provisioning in cognitive radio networks (CRNs). In particular, we focus on multichannel communications via channel-bonding with heterogeneous channel characteristics of ON/OFF patterns, sensing time, and channel capacity. Using dynamic programming (DP), we derive an optimal online sensing sequence incurring a minimal opportunity-discovery delay, and propose a suboptimal sequence that presents a near-optimal performance while incurring significantly less computational overhead than the DP algorithm. To facilitate fast opportunity discovery, we also propose a channel-management strategy that maintains a list of backup channels to be used at building the optimal sequence. A hybrid of maximum likelihood (ML) and Bayesian inference is introduced as well for flexible estimation of ON/OFF channel-usage patterns, which selectively chooses the better between the two according to the frequency of sensing and ON/OFF durations. The performance of the proposed schemes, in terms of the opportunity-discovery delay, is evaluated via in-depth simulation, and for the scenarios we considered,
Abstract: Adaptation of modulation and transmission bit-rates for video multicast in a multirate wireless network is a challenging problem because of network dynamics, variable video bit-rates, and heterogeneous clients who may expect differentiated video qualities. Prior work on the leader-based schemes selects the transmission bit-rate that provides reliable transmission for the node that experiences the worst channel condition. However, this may penalize other nodes that can achieve a higher throughput by receiving at a higher rate. In this work, we investigate a rate-adaptive video multicast scheme that can provide heterogeneous clients differentiated visual qualities matching their channel conditions. We first propose a rate scheduling model that selects the optimal transmission bit-rate for each video frame to maximize the total visual quality for a multicast group subject to the minimum-visual-quality-guaranteed constraint. We then present a practical and easy-to-implement protocol, called QDM, which constructs a cluster-based structure to characterize node heterogeneity and adapts the transmission bit-rate to network dynamics based on video quality perceived by the representative cluster heads. Since QDM selects the rate by a sample-based technique, it is suitable for real-time streaming even without any preprocess. We show that QDM can adapt to network dynamics and variable video-bit rates efficiently, and produce a gain of 2-5 dB in terms of the average video quality as compared to the leader-based approach. ETPL MC-115 Analytical Framework for WLAN-Cellular Voice Handover Evaluation
Abstract: The development of handheld mobile terminals (MT) capable of operating over both Wireless Local Area Networks (WLAN) and the cellular media is an important step toward the evolution of nextgeneration integrated networks. For real-time applications like voice, efficient vertical handover (VH) algorithms are required in maintaining a seamless connectivity and an acceptable level of quality for mobile users in heterogeneous environments. This paper proposes an analytical method for evaluating the performance of a VH algorithm that relies on the Received Signal Strength Indicator (RSSI) samples. The system model is portrayed upon addressing relevant factors that affect the quality and continuity of a voice call, and a set of performance metrics is proposed. A rigorous signal strength time series is utilized in characterizing the instantaneous decision metrics, and a novel intermediary system model, namely the N-model, is proposed to capture the large-scale shadowing effects. The performance of a generic algorithm that relies on the RSSI, which itself is susceptible to estimation error, is evaluated for an MT roaming in and out of the WLAN coverage area. Results obtained using the analytical expressions are validated by comparing them to that obtained through Monte Carlo simulation. ETPL MC-116 A Traffic-Aware Channel and Rate Reassignment Algorithm for Wireless Mesh Networks
Abstract: Channel assignment is among the most challenging issues for multiradio wireless mesh networks, given the variety of objectives that can be pursued and the computational complexity of the resulting problems. The channel assignment problem has been also shown to be interdependent with the
Abstract: Cognitive Radio (CR) networks allow users to opportunistically transmit in the licensed spectrum bands, as long as the performance of the Primary Users (PUs) of the band is not degraded. Consequently, variation in spectrum availability with time and periodic spectrum sensing undertaken by the CR users have a pronounced effect on the higher layer protocol performance, such as at the transport layer. This paper investigates the limitations of classical TCP newReno in a CR ad hoc network environment, and proposes TCP CRAHN, a window-based TCP-friendly protocol. Our approach incorporates spectrum awareness by a combination of explicit feedback from the intermediate nodes and the destination. This is achieved by adapting the classical TCP rate control algorithm running at the source to closely interact with the physical layer channel information, the link layer functions of spectrum sensing and buffer management, and a predictive mobility framework that is developed at the network layer. An analysis of the expected throughput in TCP CRAHN is provided, and simulation results reveal significant improvements by using our approach. To the best of our knowledge, our approach takes the first steps toward the design of a transport layer for CR ad hoc networks. ETPL MC-117 Hearing Is Believing: Detecting Wireless Microphone Emulation Attacks in White Space
Abstract: In cognitive radio networks, an attacker transmits signals mimicking the characteristics of primary signals, in order to prevent secondary users from transmitting. Such an attack is called primary user emulation (PUE) attack. TV towers and wireless microphones are two main types of primary users in white space. Existing work on PUE attack detection only focused on the first category. For the latter category, primary users are mobile and their transmission power is low. These properties introduce great challenges on PUE detection and existing methods are not applicable. In this paper, we propose a novel method to detect the emulation attack of wireless microphones. We exploit the relationship between RF signals and acoustic information to verify the existence of wireless microphones. The effectiveness of our approach is validated through real-world implementation. Extensive experiments show that our method achieves both false positive rate and false negative rate lower than 0.1 even in a noisy environment. ETPL MC-118 UACAP: A Unified Auxiliary Channel Authentication Protocol
Abstract: This paper proposes a control-based approach to the duty cycle adaptation for wireless sensor networks. The proposed method controls the duty cycle through the queue management to achieve highperformance under variable traffic rates. To have energy efficiency while minimizing the delay, we design a feedback controller, which adapts the sleep time to the traffic change dynamically by constraining the queue length at a predetermined value. In addition, we propose an efficient synchronization scheme using an active pattern, which represents the active time slot schedule for synchronization among sensor nodes, without affecting neighboring schedules. Based on the control theory, we analyze the adaptation behavior of the proposed controller and demonstrate system stability. The simulation results show that the proposed method outperforms existing schemes by achieving more power savings while minimizing the delay. ETPL MC-118 Distributed MAC Protocol Supporting Physical-Layer Network Coding
Abstract: Physical-layer network coding (PNC) is a promising approach for wireless networks. It allows nodes to transmit simultaneously. Due to the difficulties of scheduling simultaneous transmissions, existing works on PNC are based on simplified medium access control (MAC) protocols, which are not applicable to general multihop wireless networks, to the best of our knowledge. In this paper, we propose a distributed MAC protocol that supports PNC in multihop wireless networks. The proposed MAC protocol is based on the carrier sense multiple access (CSMA) strategy and can be regarded as an extension to the IEEE 802.11 MAC protocol. In the proposed protocol, each node collects information on the queue status of its neighboring nodes. When a node finds that there is an opportunity for some of its neighbors to perform PNC, it notifies its corresponding neighboring nodes and initiates the process of packet exchange using PNC, with the node itself as a relay. During the packet exchange process, the relay also works as a coordinator which coordinates the transmission of source nodes. Meanwhile, the proposed protocol is compatible with conventional network coding and conventional transmission schemes. Simulation results show that the proposed protocol is advantageous in various scenarios of wireless applications.
Abstract: In this paper, we propose a new Distributed Cooperation and Diversity Combining framework. Our focus is on heterogeneous networks with devices equipped with two types of radio frequency (RF) interfaces: short-range high-rate interface (e.g., IEEE802.11), and a long-range low-rate interface (e.g., cellular) communicating over urban Rayleigh fading channels. Within this framework, we propose and evaluate a set of distributed cooperation techniques operating at different hierarchical levels with resource constraints such as short-range RF bandwidth. We propose a Priority Maximum-Ratio Combining (PMRC) technique, and a Post Soft-Demodulation Combining (PSDC) technique. We show that the proposed techniques achieve significant improvements on Signal to Noise Ratio (SNR), Bit Error Rate (BER) and throughput through analysis, simulation, and experimentation on our software radio testbed. Our results also indicate that, under several communication scenarios, PMRC and PSDC can improve the throughput performance by over an order of magnitude.