Mobile Computing

                                                                                                  Back to Project List
                                            Domain Description

verify in www.ieee.org

                                                        

1.AN OBFUSCATION BASED APPROACH FOR PROTECTING LOCATION PRIVACY

                                                                                                    View Abstract

                Location Based Services (LBS) are information services accessible with mobile devices through the mobile network and utilizing the ability to make use of the location of the mobile device. Location-based services offer many opportunities for Business, Social or Informational purpose. Information of users can be misused thereby raising the issues of security both for the personal privacy and national security. Our project deals with the ongoing problems and possible solutions to PRIVACY in LBS which have become a major concern, looking from the end user’s point of view. We proposed an Obfuscation Operators to protect the privacy of users consists in decreasing the accuracy of location information according to their preferences (location obfuscation).The right of individuals to decide how, when, and for which purposes their location information can be released to other parties.

System Requirement Specification:-

DOMAIN : Transactions on Depentable And Secure Computing
SOFTWARE : Operating System: Windows xp, Platform: JAVA, DataBase: MySQL Protocal: UDP
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD:80 GB

2.OPPORTUNISTIC MANAGEMENT OF SPONTANEOUS AND HETEROGENEOUS WIRELESS
    MESH NETWORKS

                                                                                                    View Abstract

                In the traditional model for wireless mesh networks, a two-tiered architecture classifies nodes into mesh routers or clients. Such an approach, based on strong separation of roles, is interesting when an administrative entity deploys and controls the network. Nevertheless, in spontaneous and self-organized networks, where there is no administrative entity behind the network formation, this model does not hold anymore. In such a scenario the heterogeneity of nodes should be fully exploited in order to increase, as much as possible, network availability and usability. In this article we propose an approach for opportunistic wireless mesh network formation and maintenance that breaks the rigidness of the traditional architecture. We relax the role separation constraint and consider the case of spontaneous network formation relying on the concept of self-organization and collaboration. The main idea is to make the network take advantage of the specific resources and characteristics of the nodes in an opportunistic fashion. In our vision, any node (routers and clients) can perform any network functionality, if they can and if they wish.

System Requirement Specification:-

DOMAIN     : TRANSACTION ON Mobile Computing
SOFTWARE : Operating System: windows xp ,Platform: Java
HARDWARE : Processor: Pentium-IV,Speed: 1.8 GHZ ,RAM: 512 MB , HDD: 80 GB

3. VEBEK: VIRTUAL ENERGY-BASED ENCRYPTION AND KEYING FOR WIRELESS SENSOR NETWORKS

                                                                                                    View Abstract

                 Designing cost-efficient, secure network protocols for Wireless Sensor Networks (WSNs) is a challenging problem because sensors are resource-limited wireless devices. Since the communication cost is the most dominant factor in a sensor�s energy consumption, we introduce an energy-efficient Virtual Energy-Based Encryption and Keying (VEBEK) scheme for WSNs that significantly reduces the number of transmissions needed for rekeying to avoid stale keys. In addition to the goal of saving energy, minimal transmission is imperative for some military applications of WSNs where an adversary could be monitoring the wireless spectrum. VEBEK is a secure communication framework where sensed data is encoded using a scheme based on a permutation code generated via the RC4 encryption mechanism. The key to the RC4 encryption mechanism dynamically changes as a function of the residual virtual energy of the sensor. Thus, a one-time dynamic key is employed for one packet only and different keys are used for the successive packets of the stream. The intermediate nodes along the path to the sink are able to verify the authenticity and integrity of the incoming packets using a predicted value of the key generated by the sender�s virtual energy, thus requiring no need for specific rekeying messages. VEBEK is able to efficiently detect and filter false data injected into the network by malicious outsiders. The VEBEK framework consists of two operational modes (VEBEK-I and VEBEK-II), each of which is optimal for different scenarios. In VEBEK-I, each node monitors its one-hop neighbors where VEBEK-II statistically monitors downstream nodes. We have evaluated VEBEK�s feasibility and performance analytically and through simulations. Our results show that VEBEK, without incurring transmission overhead (increasing packet size or sending control messages for rekeying), is able to eliminate malicious data from the network in an energyefficient manner. We also show that our framework performs better than other comparable schemes in the literature with an overall 60-100 percent improvement in energy savings without the assumption of a reliable medium access control layer.

System Requirement Specification:-

DOMAIN     : TRANSACTION ON Mobile Computing
SOFTWARE : Operating System: windows xp ,Platform: Java
HARDWARE : Processor: Pentium-IV,Speed: 1.8 GHZ ,RAM: 512 MB , HDD: 80 GB

4. ROBUST MULTILAYER CONTROL FOR ENHANCED WIRELESS TELEMEDICAL VIDEO STREAMING

                                                                                                    View Abstract

                 M-health is an emerging area of research and one of the key challenges in future research in this area is medical video streaming over wireless channels. Contrasting requirements of almost lossless compression and low available bandwidth have to be tackled in medical quality video streaming in ultrasound and radiology applications. On one side, compression techniques need to be conservative, in order to avoid removing perceptively important information; on the other side, error resilience and correction should be provided, with the constraint of a limited bandwidth. A quality-driven, network-aware approach for joint source and channel coding based on a controller structure specifically designed for enhanced video streaming in a robotic teleultrasonography system is presented. The designed application based on robotic teleultrasonography is described and the proposed method is simulated in a wireless environment in two different scenarios; the video quality improvement achievable through the proposed scheme in such an application is remarkable, resulting in a peak signal-to-noise ratio (PSNR) improvement of more than 4 dB in both scenarios. Designing cost-efficient, secure network protocols for Wireless Sensor Networks (WSNs) is a challenging problem because sensors are resource-limited wireless devices. Since the communication cost is the most dominant factor in a sensor�s energy consumption, we introduce an energy-efficient Virtual Energy-Based Encryption and Keying (VEBEK) scheme for WSNs that significantly reduces the number of transmissions needed for rekeying to avoid stale keys. In addition to the goal of saving energy, minimal transmission is imperative for some military applications of WSNs where an adversary could be monitoring the wireless spectrum. VEBEK is a secure communication framework where sensed data is encoded using a scheme based on a permutation code generated via the RC4 encryption mechanism. The key to the RC4 encryption mechanism dynamically changes as a function of the residual virtual energy of the sensor. Thus, a one-time dynamic key is employed for one packet only and different keys are used for the successive packets of the stream. The intermediate nodes along the path to the sink are able to verify the authenticity and integrity of the incoming packets using a predicted value of the key generated by the sender�s virtual energy, thus requiring no need for specific rekeying messages. VEBEK is able to efficiently detect and filter false data injected into the network by malicious outsiders. The VEBEK framework consists of two operational modes (VEBEK-I and VEBEK-II), each of which is optimal for different scenarios. In VEBEK-I, each node monitors its one-hop neighbors where VEBEK-II statistically monitors downstream nodes. We have evaluated VEBEK�s feasibility and performance analytically and through simulations. Our results show that VEBEK, without incurring transmission overhead (increasing packet size or sending control messages for rekeying), is able to eliminate malicious data from the network in an energyefficient manner. We also show that our framework performs better than other comparable schemes in the literature with an overall 60-100 percent improvement in energy savings without the assumption of a reliable medium access control layer.

System Requirement Specification:-

DOMAIN     : TRANSACTION ON Mobile Computing
SOFTWARE : Operating System: windows xp ,Platform: Java
HARDWARE : Processor: Pentium-IV,Speed: 1.8 GHZ ,RAM: 512 MB , HDD: 80 GB

5. DATA BROADCAST WITH ADAPTIVE NETWORKS CODING IN HETEROGENEOUS IN 
    WIRELESS  NETWORK (IEEE-2009)

                                                                                                    View Abstract

                  In this paper, we propose a new data broadcast mechanism with network coding in heterogeneous wireless networks. Our mechanism adaptively clusters the mobile costs in fewer cells to minimize the bandwidth consumption. In addition, we adaptively code he data according to the data temporarily stored in each mobile host with a distributed manner. Our mechanism allows each delivered message to be coded from only a subset of data to further reduce the number of required messages. We formulate the cell selection and broadcast coding problem with integer programming and prove that the problem is NP-hard. We design a distributed algorithm based on Lagrange an relaxation. Our algorithm needs no server to record the location, queried, and stored information of receivers. Moreover, our algorithm is adaptive to the dynamic group membership, mobility, queried, and stored
data of receivers.

System Requirement Specification:-
DOMAIN     : TRANSACTIONS MOBILE COMPUTING
SOFTWARE : Operating System:windows xp, Platform: JAVA, Algorithm: COBOP, DB: MySQL
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ RAM: 512 MB HDD: 80 GB

6. A SCHEDULING ALGORITHM WITH DYNAMIC PRIORITY ASSIGNMENT FOR WCDMA STEMS
   (IEEE-2009)

                                                                                                    View Abstract

              In third generation WCDMA systems, shared channels allow many users to jointly utilize a single Orthogonal Variable Spreading Factor (OVSF) code. In this paper, we propose a Scheduling Algorithm with Dynamic Priority Assignment (DPA), which is designed for the Downlink-Shared Channel (DSCH) of 3G WCDMA systems and operates within a cross-layer framework. The DPA scheduler has low computational complexity and is able to provide Quos differentiation among traffic flows based on their delay sensitivity. Through the cross-layer framework, DPA takes into account the variations of the wireless channel and exploits processing gain to improve transmission quality and enable service provisioning when possible. Additionally, by providing a guaranteed rate per traffic flow at each scheduling period, DPA can offer a deterministic delay bound to each connection when transmissions are reliable. Stochastic delay guarantees under transmission power limitations are also provided when the traffic flows are identical. Simulation results show that DPA outperforms Feasible Earliest Due Date (FEDD), a variation of EDD for wireless environments.

System Requirement Specification:-
DOMAIN      : TRANSACTION ON NETWORKING SECURITY
SOFTWARE : Operating System: Windows XP ,Platform: DOTNET,Algorithm: DPA, OVSFB
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ ,RAM: 512 MB , HDD: 80 GB

7. ACTIVE QUEUE MANAGEMENT FOR FAIR RESOURCE ALLOCATION IN WIRELESS
    NETWORKS (IEEE-2008)

                                                                                                    View Abstract

             This paper investigates the interaction between end-to-end flow control and MAC-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a commonaccess point; each user suffers fading, and a scheduler allocates the channel based on channel quality,but subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport layer flow control of TCP NewReno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender bysetting the TCP receiver' s advertised window limit, and this allows the scheduler to allocate bandwidth fairlybetween the users.

System Requirement Specification:-
DOMAIN      : TRANSACTIONS ON MOBILE COMPUTING
SOFTWARE : Operating System: windows xp, Platform: JAVA, Protocal:CLAMP
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ RAM: 512 MB HDD: 80 GB

8. A NEW MODEL OF IMPLEMENTING VIDEO MULTICASTING IN MULTIRADIO MULTICELLULAR
    WIRELESS NETWORK USING WIFI  (IEEE-2008)

                                                                                                    View Abstract

                 In this paper, we propose a new mechanism to select the cells and the wireless technologies for layer-encoded video multicasting in the heterogeneous wireless networks. Different from the previous mechanisms, each mobile host in our mechanism can select a different cell with a different wireless technology to subscribe each layer of a video stream, and each cell can deliver only a subset of layers of the video stream to reduce the bandwidth consumption. We formulate the Cell and Technology Selection Problem (CTSP) to multicast each layer of a video stream as an optimization problem. We use Integer Linear Programming to model the problem and show that the problem is NP-hard. To solve the problem, we propose a distributed algorithm based on LaGrange an relaxation and a protocol based on the proposed algorithm. Our mechanism requires no change of the current video multicasting mechanisms and the current wireless network infrastructures. Our algorithm is adaptive not only to the change of the subscribers at each layer but also the change of the locations of each mobile host.

System Requirement Specification:-
DOMAIN     : TRANSACTIONS ON MOBILE COMPUTING
SOFTWARE : Operating System: windows xp Platform: JAVA, TooI: JMF
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ RAM: 512 MB HDD: 80 GB

9. BENEFIT BASED DATA CACHING IN AD HOC NETWORKS (IEEE-2008)

                                                                                                    View Abstract

                 Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing efficient distributed caching algorithms is non-trivial when network nodes have limited memory. In this article, we consider the cache placement problem of minimizing total data access cost in ad hocnetworks with multiple data items and nodes with limited memory capacity. The above optimization problem is known to be NP-hard. Defining benefit as the reduction in total access cost, we present a polynomial-time centralized approximation algorithm that provably delivers a solution whose benefit is at least one-fourth (one-half for uniform-size data items) of the optimal benefit. The approximation algorithm is amenable to localized distributed implementation, which is shown via simulations to perform close to the approximation algorithm. Our distributed algorithm naturally extends to networks with mobile nodes. We simulate our distributed algorithm using a network simulator (ns2), and demonstrate that it significantly outperforms another existing caching technique (by Yin and Cao [30]) in all important performance metrics. The performance differential is particularly large in more challenging scenarios, such as higher access frequency and smaller memory.

System Requirement Specification:-
DOMAIN      : TRANSACTIONS ON MOBILE COMPUTING
SOFTWARE : Operating System: windows xp, Platform : JAVA, Algorithm: Disatributed 
                  Greedy algorithm
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ RAM: 512 MB HDD: 80 GB

10. MESSAGE BASED AUTO TRANSFER RATE ADJUSTMENT IN STOCHASTIC WIRELESS
    NETWORKS (IEEE-2008)

                                                                                                    View Abstract

                  Current research trend towards mobile computing emphasizes the need for distribution of data among various clients in wireless environment. Sharing the data in J2ME opens the data to be accessible for all MIDLETs present on the device, hence creating a number of vulnerabilities to the confidential information that is intended to be shared with specific MIDLETs, e.g. a malicious MIDLET can delete, copy or move the Shared Record Store, in J2ME based application. This project aims at overcoming record store sharing problem through the concept of Multi- Agent System by providing a shared storage with explicit access to authenticated & authorized MIDLETs. With this mechanism data can be shared among specific MIDLETs. The implementation uses the SAGE-Lite framework as a solution to our proposed work.

System Requirement Specification:-
DOMAIN     : TRANSACTIONS ON MOBILE COMPUTING
SOFTWARE : Operating System: Windows XP; Platform: DOTNET, Protocol :UDP
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ, RAM: 512 MB, HDD: 80 GB

11. DNSSEC HASHED AUTHENTICATED DENIAL OF EXISTENCE PROCESS     (IEEE-2008)

                                                                                                    View Abstract

                 The domain name system is the global lookup service for network resources. To protect DNS information, the DNS security extensions have been developed and deployed on branches of the DNS to provide authentication and integrity protection using digital signatures. However, signed DNS nodes were found to have an unfortunate side effect: an attacker can query them as reconnaissance before attacking hosts on a particular network. There are different ways a zone administrator can minimize information leakage and still take advantage of DNSSEC for integrity and source authetication. This article describes the risk and examines the protocol and operational options and looks at their advantages and drawbacks

System Requirement Specification:-
DOMAIN      : TRANSACTION ON NETWORKING
SOFTWARE : Operating System: Windows xp, Platform: JAVA, Algorithm: SHA,
                  Back end: MySql
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB



                                                       
                                                                                                                              Back to Project List