This document summarizes a research paper on privacy in location-based services. It discusses how location privacy is an important issue for location-based services. It describes an architecture used to implement privacy-preserving location services with a client-server model. It also discusses various techniques used for preserving privacy, including obfuscation-based methods, SP-filtering protocols, and Hide and Seek protocols. The paper focuses on implementing and combining the SP-filtering and Hide and Seek protocols to determine if two users are in proximity while preserving their location privacy. It provides details on how these protocols work and how they are implemented using obfuscated locations.
SURVEY PAPER ON PRIVACY IN LOCATION BASED SEARCH QUERIES.ijiert bestjournal
Due to tremendous growth in mobile phones,the mark et for Location Based Services is growing fast. Man y mobile phone applications uses location based services suc h as nearest store finder,car navigation system et c. Location � Based Services provides services to mobile device u sers based on the location information as well as d ata profile of the users. Using these services mobile users retrie ve information about nearest POI. This involves loc ation and data profile of the user�s to be misused. In order to pr otect user�s private information many solutions ar e offered but most of them only addressed on snapshot and no supp ort for continuous query and MQMO .Some papers add ressed MQMO but fails to provide privacy. This paper focus es on MQMO and also protect user�s private informat ion using PIR (private information retrieval) .
Privacy preserving location sharing services for social networks(1)Kamal Spring
A common functionality of many location-based social networking applications is a location sharing service that allows a group of friends to share their locations. With a potentially un-trusted server, such a location sharing service may threaten the privacy of users. Existing solutions for Privacy-Preserving Location Sharing Services (PPLSS) require a trusted third party that has access to the exact location of all users in the system or rely on expensive algorithms or protocols in terms of computational or communication overhead. Other solutions can only provide approximate query answers. To overcome these limitations, we propose a new encryption notion, called Order-Retrievable Encryption (ORE), for PPLSS for social networking applications. The distinguishing characteristics of our PPLSS are that it allows a group of friends to share their exact locations without the need of any third party or leaking any location information to any server or users outside the group, achieves low computational and communication cost by allowing users to receive the exact location of their friends without requiring any direct communication between users or multiple rounds of communication between a user and a server, provides efficient query processing by designing an index structure for our ORE scheme, supports dynamic location updates, and provides personalized privacy protection within a group of friends by specifying a maximum distance where a user is willing to be located by his/her friends. Experimental results show that the computational and communication cost of our PPLSS is much better than the state-of-the-art solution.
The document discusses privacy-preserving algorithms for determining an optimal meeting location for a group of users. It proposes two algorithms that take advantage of homomorphic cryptosystems to privately compute a fair rendezvous point from user location preferences, without revealing the actual locations. The algorithms are evaluated through a prototype implementation on mobile devices and a user study to analyze usability and privacy protections.
On limits of Wireless Communications in a Fading Environment: a General Param...ijeei-iaes
The reliable services along with high throughput can be achieved by using wireless communication systems. These systems also provides a wide coverage because of their features, no doubt MIMO Communication System [1] is one among them. Features provided by these systems ensure the improved system coverage and increased data transmission rate by considering multiple numbers of transmitter and receiver antennas. In this article, the concept of equalization has been considered and finally the performance of the MIMO Systems in Rician flat fading [5] channel is compared with the Rayleigh flat fading channel. It has also been observed that the performance of these Systems in Rician Flat Fading Channel is the best as compare to the Rayleigh Flat Fading Channel [10]. It has been concluded that the successive interference methods provide better performance as compare to others, but their complexity is high. Simulation results shows that ML provides the better performance in comparison to other equalizers but Sphere decoder provides the best performance.
Selfish Node Isolation & Incentivation using Progressive ThresholdsIDES Editor
The problems associated with selfish nodes in
MANET are addressed by a collaborative watchdog approach
which reduces the detection time for selfish nodes thereby
improves the performance and accuracy of watchdogs[1]. In
the related works they make use of credit based systems, reputation
based mechanisms, pathrater and watchdog mechanism
to detect such selfish nodes. In this paper we follow an approach
of collaborative watchdog which reduces the detection
time for selfish nodes and also involves the removal of such
selfish nodes based on some progressively assessed thresholds.
The threshold gives the nodes a chance to stop misbehaving
before it is permanently deleted from the network.
The node passes through several isolation processes before it
is permanently removed. Another version of AODV protocol
is used here which allows the simulation of selfish nodes in
NS2 by adding or modifying log files in the protocol.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The proposed System for Indoor Location TrackingEditor IJCATR
Indoor location tracking systems are used to locate people or certain objects in buildings and in closed areas. For example,
finding co-workers in a large office building, locating customers within a shopping mall and locating patients in the hospital are a few
applications of indoor location tracking systems. Indoor tracking capability opens up multiple possibilities. To address this need, this
paper describes the implementation of a Bluetooth-based indoor location tracking system that utilizes the integrated Bluetooth modules
in any today's mobile phones to specify and display the location of the individuals in a certain building. The proposed system aims for
location tracking/monitoring and marketing applications for whom want to locate individuals carrying mobile phones and advertise
products and services.
This document evaluates Bluetooth positioning and describes three methods for positioning using Bluetooth: 1) a registered positioning service where a Bluetooth device sends its position on request, 2) using a Bluetooth device's unique address to look up its position in a database, and 3) forwarding a position via Bluetooth's peer-to-peer capabilities. Empirical tests show positioning with Bluetooth is possible and meets theoretical time requirements, though accuracy can be improved by combining methods. Future work includes allowing parallel connections to multiple devices to reduce positioning time.
SURVEY PAPER ON PRIVACY IN LOCATION BASED SEARCH QUERIES.ijiert bestjournal
Due to tremendous growth in mobile phones,the mark et for Location Based Services is growing fast. Man y mobile phone applications uses location based services suc h as nearest store finder,car navigation system et c. Location � Based Services provides services to mobile device u sers based on the location information as well as d ata profile of the users. Using these services mobile users retrie ve information about nearest POI. This involves loc ation and data profile of the user�s to be misused. In order to pr otect user�s private information many solutions ar e offered but most of them only addressed on snapshot and no supp ort for continuous query and MQMO .Some papers add ressed MQMO but fails to provide privacy. This paper focus es on MQMO and also protect user�s private informat ion using PIR (private information retrieval) .
Privacy preserving location sharing services for social networks(1)Kamal Spring
A common functionality of many location-based social networking applications is a location sharing service that allows a group of friends to share their locations. With a potentially un-trusted server, such a location sharing service may threaten the privacy of users. Existing solutions for Privacy-Preserving Location Sharing Services (PPLSS) require a trusted third party that has access to the exact location of all users in the system or rely on expensive algorithms or protocols in terms of computational or communication overhead. Other solutions can only provide approximate query answers. To overcome these limitations, we propose a new encryption notion, called Order-Retrievable Encryption (ORE), for PPLSS for social networking applications. The distinguishing characteristics of our PPLSS are that it allows a group of friends to share their exact locations without the need of any third party or leaking any location information to any server or users outside the group, achieves low computational and communication cost by allowing users to receive the exact location of their friends without requiring any direct communication between users or multiple rounds of communication between a user and a server, provides efficient query processing by designing an index structure for our ORE scheme, supports dynamic location updates, and provides personalized privacy protection within a group of friends by specifying a maximum distance where a user is willing to be located by his/her friends. Experimental results show that the computational and communication cost of our PPLSS is much better than the state-of-the-art solution.
The document discusses privacy-preserving algorithms for determining an optimal meeting location for a group of users. It proposes two algorithms that take advantage of homomorphic cryptosystems to privately compute a fair rendezvous point from user location preferences, without revealing the actual locations. The algorithms are evaluated through a prototype implementation on mobile devices and a user study to analyze usability and privacy protections.
On limits of Wireless Communications in a Fading Environment: a General Param...ijeei-iaes
The reliable services along with high throughput can be achieved by using wireless communication systems. These systems also provides a wide coverage because of their features, no doubt MIMO Communication System [1] is one among them. Features provided by these systems ensure the improved system coverage and increased data transmission rate by considering multiple numbers of transmitter and receiver antennas. In this article, the concept of equalization has been considered and finally the performance of the MIMO Systems in Rician flat fading [5] channel is compared with the Rayleigh flat fading channel. It has also been observed that the performance of these Systems in Rician Flat Fading Channel is the best as compare to the Rayleigh Flat Fading Channel [10]. It has been concluded that the successive interference methods provide better performance as compare to others, but their complexity is high. Simulation results shows that ML provides the better performance in comparison to other equalizers but Sphere decoder provides the best performance.
Selfish Node Isolation & Incentivation using Progressive ThresholdsIDES Editor
The problems associated with selfish nodes in
MANET are addressed by a collaborative watchdog approach
which reduces the detection time for selfish nodes thereby
improves the performance and accuracy of watchdogs[1]. In
the related works they make use of credit based systems, reputation
based mechanisms, pathrater and watchdog mechanism
to detect such selfish nodes. In this paper we follow an approach
of collaborative watchdog which reduces the detection
time for selfish nodes and also involves the removal of such
selfish nodes based on some progressively assessed thresholds.
The threshold gives the nodes a chance to stop misbehaving
before it is permanently deleted from the network.
The node passes through several isolation processes before it
is permanently removed. Another version of AODV protocol
is used here which allows the simulation of selfish nodes in
NS2 by adding or modifying log files in the protocol.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The proposed System for Indoor Location TrackingEditor IJCATR
Indoor location tracking systems are used to locate people or certain objects in buildings and in closed areas. For example,
finding co-workers in a large office building, locating customers within a shopping mall and locating patients in the hospital are a few
applications of indoor location tracking systems. Indoor tracking capability opens up multiple possibilities. To address this need, this
paper describes the implementation of a Bluetooth-based indoor location tracking system that utilizes the integrated Bluetooth modules
in any today's mobile phones to specify and display the location of the individuals in a certain building. The proposed system aims for
location tracking/monitoring and marketing applications for whom want to locate individuals carrying mobile phones and advertise
products and services.
This document evaluates Bluetooth positioning and describes three methods for positioning using Bluetooth: 1) a registered positioning service where a Bluetooth device sends its position on request, 2) using a Bluetooth device's unique address to look up its position in a database, and 3) forwarding a position via Bluetooth's peer-to-peer capabilities. Empirical tests show positioning with Bluetooth is possible and meets theoretical time requirements, though accuracy can be improved by combining methods. Future work includes allowing parallel connections to multiple devices to reduce positioning time.
This document summarizes a research paper on providing privacy and security in cloud Database-as-a-Service. The paper proposes using a RADIUS server for authentication, authorization, and accounting to secure the cloud service provider's main server and data center storing user databases. When users access or store data in the cloud data center, their passwords will be used to encrypt and decrypt their data, providing privacy while the RADIUS server monitors access.
This document summarizes a research paper on providing privacy and security in cloud Database-as-a-Service. The paper proposes using a RADIUS server for authentication, authorization, and accounting to secure the cloud service provider's main server and data center storing user databases. When users access or store data in the cloud data center, their passwords will be used to encrypt and decrypt their data, providing privacy while the RADIUS server monitors access.
This paper proposes using a honeypot to improve the efficiency of intrusion detection systems (IDS) in detecting zero-day attacks. It presents a network architecture that deploys a honeypot and uses packet analysis tools to generate IDS signatures for new attacks. The honeypot records an attacker's activities without their knowledge. The recorded data is analyzed to write custom IDS rules matching payloads to detect similar future attacks. This allows the IDS to identify threats even without prior signatures.
Corporate social responsibility of chemical fertlizer companies – a study wit...Editor Jacotech
This document summarizes a journal article about the corporate social responsibility practices of Fertilizers and Chemicals Travancore Limited (FACT), a major fertilizer manufacturer in India. It discusses FACT's CSR activities such as village adoption programs to educate farmers, field demonstrations of fertilizer applications, soil testing services, and various environmental protection initiatives. The document also briefly discusses trends in CSR practices across Indian companies, noting they have evolved from simple philanthropy to focus more on sustainability and equitable social development. It concludes that FACT is committed to CSR and complies with applicable laws regarding workplace safety, environment, and corporate governance.
Traffic Detection System is an Android application that aims at determining the behavior of traffic in a particular location. It calculates the speed of the vehicle and the level of congestion or the amount of traffic is determined on the basis of the values of sensors. If any such obstruct found, then the driver is provided an option to send messages regarding high traffic to his/her friends. After a distinct number of repeated low speed and breaks, the location of the vehicle (latitude and longitude) send to a pre-specified contact (selected in case of traffic congestion) through an SMS. This application uses the features of the Global positioning system. The Latitude, as well as the longitude of the location where traffic jams are formed, is sent to the friends of the user. The Goggle map of the location also sends to the friends. It uses the SMS Manager a functionality of Android. The friends receiving the messages will thereby avoid taking the congested route and hence the level of traffic on the congested road will decrease, and the friends will reach the destination in comparatively less time.
Implementation and evaluation of novel scheduler of UC/OS (RTOS)Editor Jacotech
The document summarizes proposed modifications to the scheduler of the UC/OS real-time operating system (RTOS) to allow tasks with the same priority level to be queued. The proposed scheduler uses time-slicing to schedule multiple tasks at the same priority level. Amendments were made to task management structures and system calls related to scheduling and time management. Evaluation on a hardware board showed the modified scheduler added minimal overhead.
The document proposes a novel anti-phishing approach based on dynamic watermarking technique. The approach has three main phases: 1) Registration where the user provides credentials including a watermark image and its position; 2) Login verification where the user verifies the authentic watermark before entering login details; 3) Website closing where the watermark position is changed for the next login. This makes it difficult for attackers to determine the correct watermark compared to stationary watermarks in previous approaches. Experimental results show that the approach helps users identify legitimate websites based on changing watermark positions.
Pulse Compression Sequence (PCS) are widely used in radar to increase the range resolution. Binary sequence has the limitation that the compression ratio is small. Ternary code is suggested as an alternative. The design of ternary sequence with good Discriminating Factor (DF) and merit factor can be considered as a nonlinear multivariable optimization problem which is difficult to solve. In this paper, we proposed a new method for designing ternary sequence by using Modified Simulated Annealing Algorithm (MSAA). The general features such as global convergence and robustness of the statistical algorithm are revealed.
This document summarizes a research paper about error-correcting codes derived from the cyclic group of order three. It describes generating two linear codes by using the regular representation of the cyclic group and bordering the resulting block matrices. The codes are investigated over Galois fields of characteristic p, where p is a prime number. For p not equal to three, the codes are shown to have no error-correction capability. For p equal to three, the generator matrix of the code is determined and its weight distribution is given by a theorem.
IDP: A Privacy Provisioning Framework for TIP Attributes in Trusted Third Par...Rida Qayyum
Location-Based Services (LBS) System is rapidly growing due to radio communication services with wireless mobile devices having a positioning component in it. LBS System offers location-based services by knowing the actual user position. A mobile user uses LBS to access services relevant to their locations. In order to provide Point of Interest (POI), LBS confronts numerous privacy related challenges in three different formats including Non-Trusted Third Party (NTTP), Trusted Third Party (TTP), and Mobile Peer-to-Peer (P2P). The current study emphasized the TTP based LBS system where the Location server does not provide full privacy to mobile users. In TTP based LBS system, a user’s privacy is concerned with personal identity, location information, and time information. In order to accomplish privacy under these concerns, state-of-the-art existing mechanisms have been reviewed. Hence, the aim to provide a promising roadmap to research and development communities for the right selection of privacy approach has achieved by conducting a comparative survey of the TTP based approaches. Leading to these privacy attributes, the current study addressed the privacy challenge by proposing a new privacy protection model named “Improved Dummy Position” (IDP) that protects TIP (Time, Identity, and Position) attributes under TTP LBS System. In order to validate the privacy level, a comparative analysis has been conducted by implementing the proposed IDP model in the simulation tool, Riverbed Modeler academic edition. The different scenarios of changing query transferring rate evaluate the performance of the proposed model. Simulation results demonstrate that our IDP could be considered as a promising model to protect user’s TIP attributes in a TTP based LBS system due to better performance and improved privacy level. Further, the proposed model extensively compared with the existing work.
LPM: A DISTRIBUTED ARCHITECTURE AND ALGORITHMS FOR LOCATION PRIVACY IN LBSIJNSA Journal
Recent advances in mobile communication and development of sophisticated equipments lead to the wide spread use of Location Based Services (LBS). A major concern for large-scale deployment of LBSs is the potential abuse of their client location data, which may imply sensitive personal information. Protecting location information of the mobile user is challenging because a location itself may reveal user identity. Several schemes have been proposed for location cloaking. In our paper, we propose a generic Enhanced Location Privacy Model (LPM), which describes the concept, the architecture, algorithms and the functionalities for location privacy in LBS. As per the architecture, the system ensures location privacy, without trusting anybody including the peers or LBS servers. The system is fully distributed and evaluation shows its efficiency and high level of privacy with QoS
PERTURBED ANONYMIZATION: TWO LEVEL SMART PRIVACY FOR LBS MOBILE USERS cscpconf
The use of smart mobile devices like tablets, smart phones and navigational gadgets provide
most promising communication and better services to mobile users. Location Based Services
(LBS) have become very common in recent years. Mobile users submit their location dependent
queries to the untrusted LBS server to acquire a particular service. Ideally, user’s personal
information such as location data is supposed to be protected while communicating to LBS and
at the same time quality of service must be maintained. Therefore, there is a need to have a
balanced trade-off between privacy and quality of service. To fulfil such trade-off, this paper
proposes a solution that first forms the cloaking region at mobile device, perform perturbation
to handle the problem of trusted third party and the anonymizer further anonymizes the location
to remove the problem of enough users required to form the cloaking region. The proposed
approach protects the location privacy of the user and also maintains the quality of service by
selecting appropriate service to the particular user. The proposed algorithm provides two-level
location protection to the user, and thus ensures smart mobility of the LBS user.
This document summarizes a research paper on generating random regions in a spatial cloaking algorithm to preserve location privacy. The paper proposes two algorithms - the first provides a direct list of locations ordered by proximity, while the second generates regions of different shapes to minimize the chances of a user's location being disclosed. Spatial cloaking techniques blur a user's exact location into a cloaked region to satisfy privacy requirements like k-anonymity. The paper presents a system model where users communicate directly with location-based services instead of through peers, and describes how queries are processed by the services to search for points of interest within cloaked regions.
This document proposes a user-centric approach called MobiCrowd to improve location privacy in location-based services. MobiCrowd allows mobile users to collaborate by storing each other's location information and responding to queries, hiding users from the location server unless no collaborative peers have the requested information. An epidemic model is developed to analyze how parameters like query rates and data lifetime affect privacy. Results show MobiCrowd hides a high fraction of queries, significantly enhancing privacy, and implementation shows it is lightweight with negligible collaboration costs.
The document proposes a privacy-preserving reputation system for location-based queries. It aims to allow users to query a database of location data (points of interest) while protecting their location information and preventing unauthorized access. The system uses an adaptive oblivious transfer protocol for secure data transmission between the user and location server. It also establishes a secure communication mechanism using encryption and decryption during the data retrieval process. Additionally, the system incorporates a privacy-preserving reputation technique using authorization rules and data integrity checks to control misleading data and ensure data accuracy. The experimental results show that the proposed system using elliptic curve cryptography encryption has lower overhead and delay than existing systems using RSA encryption for private information retrieval.
Privacy - Preserving Reputation with Content Protecting Location Based Queriesiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
DESIGN AND ANALYSIS OF DKRINGA PROTOCOL FOR LOCATION PRIVACY IN TRUSTED ENVIR...ijsptm
Originally K-anonymity principle was first used in relational databases to tackle the problem of data anonymity. In earlier protection techniques K threshold is used as personalization factor for mobile users. In case, K users are not present around needy client mobile user, query can be delayed and thus it will not help to achieve the Quality of service parameter. Moreover, authors have adopted methodology that if K-1
additional travelling users or queries are not seen by needy users, dummies are populated in the environment to improve the quality of service. Earlier architectures shows poor usage of K-principle, cryptography and cloaking space, which leads to threat during communication, more communication cost,
more computation cost. We present here enhanced privacy model in a trustworthy third party privacy context that employs the notion of K-anonymity. In this work, enhanced algorithms are introduced, that guarantees a success of Location Based Services (LBS) query replies coming back to mobile client. Client sends the query to the anonymization server (AS), where this server cloaks the users with other at least K
users. Our novelty in the experiment is that we have introduced cryptography from client to AS, modified
earlier algorithms for Ring-Band approach, smart location updates and simulated the scaled experiment in populated cities environment. The AS add the dummies but creates ring-band cloaking area and sends it to LBS server. Cryptography adds some time however ring-band approach reduces communication overhead. We have studied the performance with variation of different parameters. The response from LBS comes to AS with Point of Interests (POIs) along the ring-band. After which AS filters for precise POIs and sends reply to mobile client. With ring-band approach we may also skip the AS and have client to LBS approach directly but without identity protection.
A Survey of Privacy-Preserving Algorithms for Finding meeting point in Mobile...IJERA Editor
Location privacy in Location Based Services (LBS) is the capability to protect the connection between user’s identity, uncertainty sources, servers and database, thereby restraining an impending attacker from conveniently linking users of LBS to convinced locations. Smart Phones have become most important gadget for maintaining the daily activities, highly interconnected urban population is also increasingly dependent on these gadgets to regulate and schedule their daily lives. These applications often depend on current location of user or a class of user. Use of Smart Mapping technology is also increasing in large area; this system provides an easy attainable online platform that can be used for accessing many services. This survey paper projects the privacy-preserving algorithm to find the most favorable meeting location for a class of users. GSM calculates the location of all users.
External Defense (TTP based LBS System) Rida Qayyum
Muhammad Usman Ashraf, Rida Qayyum, and Hina Ejaz, ”STATE- OF-THE-ART, CHALLENGES: PRIVACY PROVISIONING IN TTP LOCATION BASED SERVICES SYSTEMS”, International Journal of Advanced Research in Computer Science (IJARCS), Vol. 10, No. 2, pp. 68-75, April 2019. DOI: https://doi.org/10.26483/ijarcs.v10i2
Rida Qayyum, Hina Ejaz “Provisioning Privacy for TIP Attribute in Trusted Third Party (TTP) Location Based Services (LBS) System”, May 2019. DOI: 10.13140/RG.2.2.25631.59041
Rida Qayyum, Hina Ejaz, " Data Security in Mobile Cloud Computing: A State of the Art Review", International Journal of Modern Education and Computer Science (IJMECS), Vol. 12, No. 2, pp. 30-35, April 2020. DOI: 10.5815/ijmecs.2020.02.04
Muhammad Usman Ashraf, Kamal M. Jambi, Rida Qayyum, Hina Ejaz, and Iqra Ilyas “IDP: A Privacy Provisioning Framework for TIP Attributes in Trusted Third Party-based Location-based Services Systems”, International Journal of Advanced Computer Science and Applications(IJACSA), 11(7), pp. 604-617, July 2020. DOI: 10.14569/IJACSA.2020.0110773
Rida Qayyum. " A Roadmap Towards Big Data Opportunities, Emerging Issues and Hadoop as a Solution ", International Journal of Education and Management Engineering (IJEME), Vol.10, No.4, pp.8-17, 2020. DOI: 10.5815/ijeme.2020.04.02
Rida Qayyum,Hina Ejaz."A Comparative Study of Location Based Services Simulators". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.7, Issue 11,pp.1-12, November 2020, DOI :10.22362/ijcert/2020/v7/i11/v7i1101
A survey on hiding user privacy in location based services through clusteringeSAT Journals
Abstract Smartphone’s are being more and more popular as the technology being evolve. The Smartphone’s are capable of providing the location aware services like GPS. They share all the location information with the central location server. When user submit any query then these query also carries some personal information of the user. This query and information is then submitted to the LGS server. At the LBS server this information is not much confidential. Someone can use this information to make user panic. To overcome this we are proposing the new collaborative approach to hide user’s personal data from the LBS server. Our approach does not lead to make changes in the architecture of the LBS server. And we are also not going to use the third party server. Here we are going to use the other user’s device to search other users query so that other user can be get hide from the LBS server. Keywords: Mobile networks, location-based services, location privacy, Bayesian inference attacks, epidemic models
Exploiting Service Similarity for Privacy in Location Based Search QueriesMigrant Systems
This document proposes a privacy-supportive architecture for location-based services that allows users to make informed decisions about location privacy without significantly affecting service quality. The key aspects are:
1) Users first submit queries with generalized locations and receive a "service similarity profile" showing how results may vary across locations.
2) Users can then select a noisy location based on their privacy preferences while observing how it impacts results.
3) An example local search application is described to demonstrate how result set boundaries with no change can be identified, allowing large default privacy regions. Testing found users can add significant location noise while still getting accurate results.
Cloaking Areas Location Based Services Using Dynamic Grid System & Privacy En...IJMTST Journal
Due to the large increasing use of Location Based Services (LBS), which require personal data of the user to provide the continuous service, protecting the privacy of these data has become a challenge. An approach to preserving a privacy is through anonymity, by hiding the identity and user location data of the mobile device from the service provider(third party) or from any unauthorized party who has access at the user’s request .Considering the challenge mentioned, in this paper gives a classification according to the Architecture, approaches and techniques used in previous works, and presents a survey of solutions to provide anonymity in LBS including the open issues or possible improvements to current solutions. All of this, in order to provide guidelines for choosing the best solution approach to a specific scenery in which anonymity is required.
This document summarizes a research paper on providing privacy and security in cloud Database-as-a-Service. The paper proposes using a RADIUS server for authentication, authorization, and accounting to secure the cloud service provider's main server and data center storing user databases. When users access or store data in the cloud data center, their passwords will be used to encrypt and decrypt their data, providing privacy while the RADIUS server monitors access.
This document summarizes a research paper on providing privacy and security in cloud Database-as-a-Service. The paper proposes using a RADIUS server for authentication, authorization, and accounting to secure the cloud service provider's main server and data center storing user databases. When users access or store data in the cloud data center, their passwords will be used to encrypt and decrypt their data, providing privacy while the RADIUS server monitors access.
This paper proposes using a honeypot to improve the efficiency of intrusion detection systems (IDS) in detecting zero-day attacks. It presents a network architecture that deploys a honeypot and uses packet analysis tools to generate IDS signatures for new attacks. The honeypot records an attacker's activities without their knowledge. The recorded data is analyzed to write custom IDS rules matching payloads to detect similar future attacks. This allows the IDS to identify threats even without prior signatures.
Corporate social responsibility of chemical fertlizer companies – a study wit...Editor Jacotech
This document summarizes a journal article about the corporate social responsibility practices of Fertilizers and Chemicals Travancore Limited (FACT), a major fertilizer manufacturer in India. It discusses FACT's CSR activities such as village adoption programs to educate farmers, field demonstrations of fertilizer applications, soil testing services, and various environmental protection initiatives. The document also briefly discusses trends in CSR practices across Indian companies, noting they have evolved from simple philanthropy to focus more on sustainability and equitable social development. It concludes that FACT is committed to CSR and complies with applicable laws regarding workplace safety, environment, and corporate governance.
Traffic Detection System is an Android application that aims at determining the behavior of traffic in a particular location. It calculates the speed of the vehicle and the level of congestion or the amount of traffic is determined on the basis of the values of sensors. If any such obstruct found, then the driver is provided an option to send messages regarding high traffic to his/her friends. After a distinct number of repeated low speed and breaks, the location of the vehicle (latitude and longitude) send to a pre-specified contact (selected in case of traffic congestion) through an SMS. This application uses the features of the Global positioning system. The Latitude, as well as the longitude of the location where traffic jams are formed, is sent to the friends of the user. The Goggle map of the location also sends to the friends. It uses the SMS Manager a functionality of Android. The friends receiving the messages will thereby avoid taking the congested route and hence the level of traffic on the congested road will decrease, and the friends will reach the destination in comparatively less time.
Implementation and evaluation of novel scheduler of UC/OS (RTOS)Editor Jacotech
The document summarizes proposed modifications to the scheduler of the UC/OS real-time operating system (RTOS) to allow tasks with the same priority level to be queued. The proposed scheduler uses time-slicing to schedule multiple tasks at the same priority level. Amendments were made to task management structures and system calls related to scheduling and time management. Evaluation on a hardware board showed the modified scheduler added minimal overhead.
The document proposes a novel anti-phishing approach based on dynamic watermarking technique. The approach has three main phases: 1) Registration where the user provides credentials including a watermark image and its position; 2) Login verification where the user verifies the authentic watermark before entering login details; 3) Website closing where the watermark position is changed for the next login. This makes it difficult for attackers to determine the correct watermark compared to stationary watermarks in previous approaches. Experimental results show that the approach helps users identify legitimate websites based on changing watermark positions.
Pulse Compression Sequence (PCS) are widely used in radar to increase the range resolution. Binary sequence has the limitation that the compression ratio is small. Ternary code is suggested as an alternative. The design of ternary sequence with good Discriminating Factor (DF) and merit factor can be considered as a nonlinear multivariable optimization problem which is difficult to solve. In this paper, we proposed a new method for designing ternary sequence by using Modified Simulated Annealing Algorithm (MSAA). The general features such as global convergence and robustness of the statistical algorithm are revealed.
This document summarizes a research paper about error-correcting codes derived from the cyclic group of order three. It describes generating two linear codes by using the regular representation of the cyclic group and bordering the resulting block matrices. The codes are investigated over Galois fields of characteristic p, where p is a prime number. For p not equal to three, the codes are shown to have no error-correction capability. For p equal to three, the generator matrix of the code is determined and its weight distribution is given by a theorem.
IDP: A Privacy Provisioning Framework for TIP Attributes in Trusted Third Par...Rida Qayyum
Location-Based Services (LBS) System is rapidly growing due to radio communication services with wireless mobile devices having a positioning component in it. LBS System offers location-based services by knowing the actual user position. A mobile user uses LBS to access services relevant to their locations. In order to provide Point of Interest (POI), LBS confronts numerous privacy related challenges in three different formats including Non-Trusted Third Party (NTTP), Trusted Third Party (TTP), and Mobile Peer-to-Peer (P2P). The current study emphasized the TTP based LBS system where the Location server does not provide full privacy to mobile users. In TTP based LBS system, a user’s privacy is concerned with personal identity, location information, and time information. In order to accomplish privacy under these concerns, state-of-the-art existing mechanisms have been reviewed. Hence, the aim to provide a promising roadmap to research and development communities for the right selection of privacy approach has achieved by conducting a comparative survey of the TTP based approaches. Leading to these privacy attributes, the current study addressed the privacy challenge by proposing a new privacy protection model named “Improved Dummy Position” (IDP) that protects TIP (Time, Identity, and Position) attributes under TTP LBS System. In order to validate the privacy level, a comparative analysis has been conducted by implementing the proposed IDP model in the simulation tool, Riverbed Modeler academic edition. The different scenarios of changing query transferring rate evaluate the performance of the proposed model. Simulation results demonstrate that our IDP could be considered as a promising model to protect user’s TIP attributes in a TTP based LBS system due to better performance and improved privacy level. Further, the proposed model extensively compared with the existing work.
LPM: A DISTRIBUTED ARCHITECTURE AND ALGORITHMS FOR LOCATION PRIVACY IN LBSIJNSA Journal
Recent advances in mobile communication and development of sophisticated equipments lead to the wide spread use of Location Based Services (LBS). A major concern for large-scale deployment of LBSs is the potential abuse of their client location data, which may imply sensitive personal information. Protecting location information of the mobile user is challenging because a location itself may reveal user identity. Several schemes have been proposed for location cloaking. In our paper, we propose a generic Enhanced Location Privacy Model (LPM), which describes the concept, the architecture, algorithms and the functionalities for location privacy in LBS. As per the architecture, the system ensures location privacy, without trusting anybody including the peers or LBS servers. The system is fully distributed and evaluation shows its efficiency and high level of privacy with QoS
PERTURBED ANONYMIZATION: TWO LEVEL SMART PRIVACY FOR LBS MOBILE USERS cscpconf
The use of smart mobile devices like tablets, smart phones and navigational gadgets provide
most promising communication and better services to mobile users. Location Based Services
(LBS) have become very common in recent years. Mobile users submit their location dependent
queries to the untrusted LBS server to acquire a particular service. Ideally, user’s personal
information such as location data is supposed to be protected while communicating to LBS and
at the same time quality of service must be maintained. Therefore, there is a need to have a
balanced trade-off between privacy and quality of service. To fulfil such trade-off, this paper
proposes a solution that first forms the cloaking region at mobile device, perform perturbation
to handle the problem of trusted third party and the anonymizer further anonymizes the location
to remove the problem of enough users required to form the cloaking region. The proposed
approach protects the location privacy of the user and also maintains the quality of service by
selecting appropriate service to the particular user. The proposed algorithm provides two-level
location protection to the user, and thus ensures smart mobility of the LBS user.
This document summarizes a research paper on generating random regions in a spatial cloaking algorithm to preserve location privacy. The paper proposes two algorithms - the first provides a direct list of locations ordered by proximity, while the second generates regions of different shapes to minimize the chances of a user's location being disclosed. Spatial cloaking techniques blur a user's exact location into a cloaked region to satisfy privacy requirements like k-anonymity. The paper presents a system model where users communicate directly with location-based services instead of through peers, and describes how queries are processed by the services to search for points of interest within cloaked regions.
This document proposes a user-centric approach called MobiCrowd to improve location privacy in location-based services. MobiCrowd allows mobile users to collaborate by storing each other's location information and responding to queries, hiding users from the location server unless no collaborative peers have the requested information. An epidemic model is developed to analyze how parameters like query rates and data lifetime affect privacy. Results show MobiCrowd hides a high fraction of queries, significantly enhancing privacy, and implementation shows it is lightweight with negligible collaboration costs.
The document proposes a privacy-preserving reputation system for location-based queries. It aims to allow users to query a database of location data (points of interest) while protecting their location information and preventing unauthorized access. The system uses an adaptive oblivious transfer protocol for secure data transmission between the user and location server. It also establishes a secure communication mechanism using encryption and decryption during the data retrieval process. Additionally, the system incorporates a privacy-preserving reputation technique using authorization rules and data integrity checks to control misleading data and ensure data accuracy. The experimental results show that the proposed system using elliptic curve cryptography encryption has lower overhead and delay than existing systems using RSA encryption for private information retrieval.
Privacy - Preserving Reputation with Content Protecting Location Based Queriesiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
DESIGN AND ANALYSIS OF DKRINGA PROTOCOL FOR LOCATION PRIVACY IN TRUSTED ENVIR...ijsptm
Originally K-anonymity principle was first used in relational databases to tackle the problem of data anonymity. In earlier protection techniques K threshold is used as personalization factor for mobile users. In case, K users are not present around needy client mobile user, query can be delayed and thus it will not help to achieve the Quality of service parameter. Moreover, authors have adopted methodology that if K-1
additional travelling users or queries are not seen by needy users, dummies are populated in the environment to improve the quality of service. Earlier architectures shows poor usage of K-principle, cryptography and cloaking space, which leads to threat during communication, more communication cost,
more computation cost. We present here enhanced privacy model in a trustworthy third party privacy context that employs the notion of K-anonymity. In this work, enhanced algorithms are introduced, that guarantees a success of Location Based Services (LBS) query replies coming back to mobile client. Client sends the query to the anonymization server (AS), where this server cloaks the users with other at least K
users. Our novelty in the experiment is that we have introduced cryptography from client to AS, modified
earlier algorithms for Ring-Band approach, smart location updates and simulated the scaled experiment in populated cities environment. The AS add the dummies but creates ring-band cloaking area and sends it to LBS server. Cryptography adds some time however ring-band approach reduces communication overhead. We have studied the performance with variation of different parameters. The response from LBS comes to AS with Point of Interests (POIs) along the ring-band. After which AS filters for precise POIs and sends reply to mobile client. With ring-band approach we may also skip the AS and have client to LBS approach directly but without identity protection.
A Survey of Privacy-Preserving Algorithms for Finding meeting point in Mobile...IJERA Editor
Location privacy in Location Based Services (LBS) is the capability to protect the connection between user’s identity, uncertainty sources, servers and database, thereby restraining an impending attacker from conveniently linking users of LBS to convinced locations. Smart Phones have become most important gadget for maintaining the daily activities, highly interconnected urban population is also increasingly dependent on these gadgets to regulate and schedule their daily lives. These applications often depend on current location of user or a class of user. Use of Smart Mapping technology is also increasing in large area; this system provides an easy attainable online platform that can be used for accessing many services. This survey paper projects the privacy-preserving algorithm to find the most favorable meeting location for a class of users. GSM calculates the location of all users.
External Defense (TTP based LBS System) Rida Qayyum
Muhammad Usman Ashraf, Rida Qayyum, and Hina Ejaz, ”STATE- OF-THE-ART, CHALLENGES: PRIVACY PROVISIONING IN TTP LOCATION BASED SERVICES SYSTEMS”, International Journal of Advanced Research in Computer Science (IJARCS), Vol. 10, No. 2, pp. 68-75, April 2019. DOI: https://doi.org/10.26483/ijarcs.v10i2
Rida Qayyum, Hina Ejaz “Provisioning Privacy for TIP Attribute in Trusted Third Party (TTP) Location Based Services (LBS) System”, May 2019. DOI: 10.13140/RG.2.2.25631.59041
Rida Qayyum, Hina Ejaz, " Data Security in Mobile Cloud Computing: A State of the Art Review", International Journal of Modern Education and Computer Science (IJMECS), Vol. 12, No. 2, pp. 30-35, April 2020. DOI: 10.5815/ijmecs.2020.02.04
Muhammad Usman Ashraf, Kamal M. Jambi, Rida Qayyum, Hina Ejaz, and Iqra Ilyas “IDP: A Privacy Provisioning Framework for TIP Attributes in Trusted Third Party-based Location-based Services Systems”, International Journal of Advanced Computer Science and Applications(IJACSA), 11(7), pp. 604-617, July 2020. DOI: 10.14569/IJACSA.2020.0110773
Rida Qayyum. " A Roadmap Towards Big Data Opportunities, Emerging Issues and Hadoop as a Solution ", International Journal of Education and Management Engineering (IJEME), Vol.10, No.4, pp.8-17, 2020. DOI: 10.5815/ijeme.2020.04.02
Rida Qayyum,Hina Ejaz."A Comparative Study of Location Based Services Simulators". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.7, Issue 11,pp.1-12, November 2020, DOI :10.22362/ijcert/2020/v7/i11/v7i1101
A survey on hiding user privacy in location based services through clusteringeSAT Journals
Abstract Smartphone’s are being more and more popular as the technology being evolve. The Smartphone’s are capable of providing the location aware services like GPS. They share all the location information with the central location server. When user submit any query then these query also carries some personal information of the user. This query and information is then submitted to the LGS server. At the LBS server this information is not much confidential. Someone can use this information to make user panic. To overcome this we are proposing the new collaborative approach to hide user’s personal data from the LBS server. Our approach does not lead to make changes in the architecture of the LBS server. And we are also not going to use the third party server. Here we are going to use the other user’s device to search other users query so that other user can be get hide from the LBS server. Keywords: Mobile networks, location-based services, location privacy, Bayesian inference attacks, epidemic models
Exploiting Service Similarity for Privacy in Location Based Search QueriesMigrant Systems
This document proposes a privacy-supportive architecture for location-based services that allows users to make informed decisions about location privacy without significantly affecting service quality. The key aspects are:
1) Users first submit queries with generalized locations and receive a "service similarity profile" showing how results may vary across locations.
2) Users can then select a noisy location based on their privacy preferences while observing how it impacts results.
3) An example local search application is described to demonstrate how result set boundaries with no change can be identified, allowing large default privacy regions. Testing found users can add significant location noise while still getting accurate results.
Cloaking Areas Location Based Services Using Dynamic Grid System & Privacy En...IJMTST Journal
Due to the large increasing use of Location Based Services (LBS), which require personal data of the user to provide the continuous service, protecting the privacy of these data has become a challenge. An approach to preserving a privacy is through anonymity, by hiding the identity and user location data of the mobile device from the service provider(third party) or from any unauthorized party who has access at the user’s request .Considering the challenge mentioned, in this paper gives a classification according to the Architecture, approaches and techniques used in previous works, and presents a survey of solutions to provide anonymity in LBS including the open issues or possible improvements to current solutions. All of this, in order to provide guidelines for choosing the best solution approach to a specific scenery in which anonymity is required.
Need a project proposal for my computer science 3 course. I dont eve.pdfaristogifts99
Need a project proposal for my computer science 3 course. I dont even know where to start.
Need a unique program proposal as well as the program itself with all header files,
implementation files, and source files. Also need it commented.
In the proposal, describe what you intend to do for your project in terms of:
-general description of the problem you will be solving
-itemized list of use cases
-list of parameters that will be part of the user interface
-what structures and algorithms will you be using
Your proposal should be submitted as a Word document giving your name, project title and four
sections for each of the bulleted items listed above. Each section should have one paragraph
summarizing the section, followed by text or bullets detailing them. At the end should be a
References section that lists any outside sources (such as a particular implementation or problem
or code library) you plan on using.
Solution
HIDING IN THE MOBILE CROWD LOCATION PRIVACY THROUGH COLLABORATION
ABSTRACT
Location-aware smartphones support various location-based services (LBSs): users query the
LBS server and learnon the fly about their surroundings. However, such queries give away
private information, enabling the LBS to track users. A user-collaborative privacy-preserving
approach is proposed for LBSs. This solution does not requirechanging the LBS server
architecture and does not assume third party servers; yet, it significantly improves users’
locationprivacy. The gain stems from the collaboration of mobile devices: they keep their context
information in a buffer and pass it toothers seeking such information. Thus, a user remains
hidden from the server, unless all the collaborative peers in the vicinity lackthe sought
information. A novel epidemic model is developed to capture possibly time-dependent,dynamics
of information propagation among users. Used in the Bayesian inference framework, this model
helps analyze theeffects of various parameters, such as users’ querying rates and the lifetime of
context information, on users’ location privacy.The results show that our scheme hides a high
fraction of location-based queries, thus significantly enhancing users’ locationprivacy. Finally,
implementation indicates that it is lightweight and the cost of collaboration is negligible.
EXISTING SYSTEM
To enhance privacy for LBS users several solutions have been proposed and two main
categories are
Centralizedand
User-centric
Centralized approaches
Centralized approaches introduce a third party inthe system, which protects users’ privacy by
operatingbetween the user and the LBS. Such an intermediaryproxy server could anonymize
queriesby removing any information that identifies the useror her device.
It could blend a user’squery with those of other users, so that the LBS serveralways sees a group
of queries.
User-centric approaches
User-centric approaches operate on the device. Typicallythey aim to blur the location
information by,for example, having the user’s s.
Privacy preserving optimal meeting location determination on mobile devicesIGEEKS TECHNOLOGIES
This paper proposes privacy-preserving algorithms for determining an optimal meeting location for a group of users. It addresses the privacy issues in location-based services (LBS) that require sharing of user locations. Two algorithms are presented that allow each user to provide a single location preference to the solver while preserving privacy from other users and the service provider. The paper evaluates the security and privacy of the algorithms through theoretical analysis and implementation on mobile devices. A user study provides insights into privacy concerns with LBS and the usability of the proposed solutions.
USER-DEFINED PRIVACY GRID SYSTEM FOR CONTINUOUS LOCATION-BASED SERVICES - IEE...Nexgen Technology
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
User-Defined Privacy Grid System for Continuous Location-Based Services1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Securing Location of User in Geo Social NetworkingIRJET Journal
The document describes a technique called LocX that aims to improve location privacy in geo-social networks without adding uncertainty to query results. LocX works by having each user apply a secret coordinate transformation to their actual locations before sharing them with the server. This allows queries to be evaluated correctly by the user while preventing servers from seeing users' actual location data. The technique is designed to provide strong location privacy even against powerful attackers and to be efficient enough for use on mobile devices.
This seminar presentation discusses the development of a mobile distributed system for personal security. The system uses GPS and LBS technologies to track a user's location and send emergency alerts via SMS or email with their coordinates. It has a client-server architecture with the mobile phone as the client and synchronization between servers. The system aims to provide location tracking and alerts even when GPS is unavailable by using cell tower or WiFi access point information to determine approximate location. It addresses the problem of location tracking without GPS through a combination of existing technologies and custom developments.
An Efficient User Privacy and Protecting Location Content in Location Based S...IJRST Journal
In location-based query a user wants to query a database of location data, known as Points Of Interest (POIs), and does not want to reveal his/her location to the server due to privacy concerns; (ii) the owner of the location data, that is, the location server, do Abstract: Nowadays, it is very easy for a person to learn his/her location with the help of a Global Positioning System (GPS) enabled device. A location s not want to simply distribute its data to all users. The location server desires to have some control over its data, since the data is its asset. A major enhancement upon previous solutions by introducing a two stage approach, the first step is based on Oblivious Transfer using homomorphic encryption and the second step is based on Private Information Retrieval, to achieve a secure solution for both parties. Introduce a security model and analyse the security in the context of our protocol. To highlight a security weakness of our previous work and present a solution using efficient homomorphic system.
Performance of Wideband Mobile Channel with Perfect Synchronism BPSK vs QPSK ...Editor Jacotech
Direct-sequence code-division multiple access (DS-CDMA) is
currently the subject of much research as it is a promising
multiple access capability for third and fourth generations
mobile communication systems. The synchronous DS-CDMA
system is well known for eliminating the effects of multiple
access interference (MAI) which limits the capacity and
degrades the BER performance of the system. In this paper,
we investigate the bit error rate (BER) performance of a
synchronous DS-CDMA system over a wideband mobile
radio channel. The BER performance is affected by the
difference in path length ΔL and the number of arriving
signals N. Furthermore, the effect of these parameters is
examined on the synchronous DS-CDMA system for different
users’ number as well as different processing gain Gp. In this
environment and under the above conditions the performances
of the BPSK (Binary Phase Shift Keying) and the QPSK
(Quadrature Phase Shift Keying) modulations are compared.
The promising simulation results showed the possibility of
applying this system to the wideband mobile radio channel.
MOVIE RATING PREDICTION BASED ON TWITTER SENTIMENT ANALYSISEditor Jacotech
With microblogging platforms such as Twitter generating
huge amounts of textual data every day, the possibilities of
knowledge discovery through Twitter data becomes
increasingly relevant. Similar to the public voting mechanism
on websites such as the Internet Movie Database (IMDb) that
aggregates movies ratings, Twitter content contains
reflections of public opinion about movies. This study aims to
explore the use of Twitter content as textual data for
predicting the movie rating. In this study, we extract number
of tweets and compiled to predict the rating scores of newly
released movies. Predictions were done with the algorithms,
exploring the tweet polarity. In addition, this study explores
the use of several different kinds of tweet classification
Algorithm and movie rating algorithm. Results show that
movie rating developed by our application is compared to
IMDB and Rotten Tomatoes.
Non integer order controller based robust performance analysis of a conical t...Editor Jacotech
The design of robust controller for any non linear process is a
challenging task because of the presence of various types of
uncertainties. In this paper, various design methods of robust
PID controller for the level control of conical tank are
discussed. Uncertainties are of different types, among that
structured uncertainty of 30% is introduced to the nominal
plant for analysing the robustness. As a first step, the control
of level is done by using conventional integer order controller
for both nominal and uncertain system. Then, the control is
done by means of Fractional Order Proportional Integral
Derivative (FOPID) controller for achieving robustness. With
the help of time series parameters, a comparison is made
between conventional PID and FOPID with respect to the
simulated output using MATLAB and also analyzed the
robustness.
FACTORS CAUSING STRESS AMONG FEMALE DOCTORS (A COMPARATIVE STUDY BETWEEN SELE...Editor Jacotech
This document summarizes a research study that examined factors causing stress among female doctors working in public and private sector hospitals in India. The study aimed to identify whether there were associations between hospital sector (public or private) and 12 different stress measures among 300 female doctors. A survey was administered to collect data. Chi-square tests found statistically significant associations (p < 0.05) between hospital sector and 11 of the 12 stress measures, including stress due to workload, working conditions, physical exertion, emotional exhaustion, job security, organizational support, work-family conflict, family adjustment, task demands, patient expectations, and working hours. Only the association between sector and stress due to psychosomatic problems was not statistically significant. The results indicate
ANALYSIS AND DESIGN OF MULTIPLE WATERMARKING IN A VIDEO FOR AUTHENTICATION AN...Editor Jacotech
Watermarking technique be employ instance & for a second time for
validation and protection of digital data (images, video and audio
files, digital repositories and libraries, web publishing). It is helpful
to copyright protection and illegal copying of digital data like video
frames and making digital data more robust and imperceptible. With
the advent of internet, creation and delivery of digital data has grown
many fold. In that Scenario has to need a technique for transferring
digital data securely without changing their originality and
robustness. In this paper proposed a plan of latest watermarking
method which involves inserting and adding two or more digital data
or pictures in a single video frame for the principle of protection and
replicate the similar procedure for N no video frames for
authentication of entire digital video. After that digital video is
encrypted and decrypted by using motion vector bit-xor encryption
and decryption technique.
The Impact of Line Resistance on the Performance of Controllable Series Compe...Editor Jacotech
In recent years controllable FACTS devices are increasingly
integrated into the transmission system. FACTS devices that
provide series control such as Controllable Series Compensator
(CSC) has significant effect on the voltage stability of Electric
Power system. In this work impact of line resistance on the
performance of CSC in a single-load infinitive-bus (SLIB)
model is investigated. The proposed framework is applied to
SLIB model and obtained results demonstrates that line
resistance has considerable effect on voltage stability limits and
performance of CSC.
Security Strength Evaluation of Some Chaos Based Substitution-BoxesEditor Jacotech
Recently, handful amount of S-boxes, using the various
methods such as affine transformations, gray coding,
optimization, chaotic systems, etc, have been suggested. It is
prudent to use cryptographically strong S-boxes for the design
of powerful ciphers. In this paper, we sampled some widely
used 8×8 S-boxes which are recently synthesized and security
analysis and evaluation is executed to uncover the best
candidate(s). The performance analysis is exercised against
the crucial measures like nonlinearity, linear approximation
probability, algebraic immunity, algebraic complexity,
differential uniformity. These parameters are custom selected
because their scores decide the security strength against
cryptographic assaults like linear cryptanalysis, algebraic
attacks, and differential cryptanalysis. The anticipated
analysis in this work facilitates the cryptographers, designers,
researchers to choose suitable candidate decided over many
parameters and can be engaged in modern block encryption
systems that solely rely on 8×8 S-box. Moreover, the analysis
assists in articulating efficient S-boxes and to evaluate the
attacks resistivity of their S-boxes.
Traffic Detection System is an Android application that aims at determining the behavior of traffic in a particular location. It calculates the speed of the vehicle and the level of congestion or the amount of traffic is determined on the basis of the values of sensors. If any such obstruct found, then the driver is provided an option to send messages regarding high traffic to his/her friends. After a distinct number of repeated low speed and breaks, the location of the vehicle (latitude and longitude) send to a pre-specified contact (selected in case of traffic congestion) through an SMS. This application uses the features of the Global positioning system. The Latitude, as well as the longitude of the location where traffic jams are formed, is sent to the friends of the user. The Goggle map of the location also sends to the friends. It uses the SMS Manager a functionality of Android. The friends receiving the messages will thereby avoid taking the congested route and hence the level of traffic on the congested road will decrease, and the friends will reach the destination in comparatively less time.
Performance analysis of aodv with the constraints of varying terrain area and...Editor Jacotech
Mobile Ad Hoc Networks (MANETs) are wireless networks,
where there is no requirement for any infrastructure support to
transfer data packets between mobile nodes. These nodes
communicate in a multi-hop mode; each mobile node acts
both as a host and router. The main job of Quality of Service
(QoS)[1][2] routing in MANETs is to search and establish
routes among different mobile nodes for satisfying QoS
requirements of wireless sensor networks as PDR, Average
end-to-end delay, Average Throughput. The QoS routing
protocols efficient for commercial, real-time and multimedia
applications are in demand for day to day activities[2].
Modeling of solar array and analyze the current transient response of shunt s...Editor Jacotech
Spacecraft bus voltage is regulated by power
conditioning unit using switching shunt voltage regulator having
solar array cells as the primary source of power. This source
switches between the bus loads and the shunt switch for fine
control of spacecraft bus voltage. The effect of solar array cell
capacitance [5][6] along with inductance and resistance of the
interface wires between solar cells and power conditioning
unit[1], generates damped sinusoidal currents superimposed on
the short circuit current of solar cell when shunted through
switch. The peak current stress on the shunt switch is to be
considered in the selection of shunt switch in power conditioning
unit. The analysis of current transients of shunt switch in PCU
considering actual spacecraft interface wire length by
illumination of solar panel (combination of series and parallel
solar cells) is difficult with hardware simulation. Software
simulation by modeling solar cell is carried out for a single string
(one parallel) in Pspice [6]. Since in spacecrafts number of
parallels and interface cable length are variable parameters the
analysis of current transients of shunt switch is carried out by
modeling solar array with the help of solar cell model[6] for the
actual spacecraft condition.
License plate recognition an insight to the proposed approach for plate local...Editor Jacotech
License Plate Recognition (LPR) system for vehicles is an innovative and a very challenging area for research due to the innumerous plate formats and the nonuniform outdoor illumination conditions during which images are acquired. Thus, most approaches developed, work under certain restrictions such as fixed illumination, stationary background and limited speed. Algorithms developed for LPR systems are generally composed of three significant stages: 1] localization of the license plate from an entire scene image; 2] segmentation of the characters on the plate; 3] recognition of each of the segmented characters. A simple approach for preprocessing of the images, localization and extraction phase has been described in this paper. Numerous procedures have been developed for LPR systems and are assessed in this paper taking into consideration issues like processing time, computational power and recognition rate wherever available.
Design of airfoil using backpropagation training with mixed approachEditor Jacotech
Levenberg-Marquardt back-propagation training method has some limitations associated with over fitting and local optimum problems. Here, we proposed a new algorithm to increase the convergence speed of Backpropagation learning to design the airfoil. The aerodynamic force coefficients corresponding to series of airfoil are stored in a database along with the airfoil coordinates. A feedforward neural network is created with aerodynamic coefficient as input to produce the airfoil coordinates as output. In the proposed algorithm, for output layer, we used the cost function having linear & nonlinear error terms then for the hidden layer, we used steepest descent cost function. Results indicate that this mixed approach greatly enhances the training of artificial neural network and may accurately predict airfoil profile.
Ant colony optimization based routing algorithm in various wireless sensor ne...Editor Jacotech
Wireless Sensor Network has several issues and challenges due to limited battery backup, limited computation capability, and limited computation capability. These issues and challenges must be taken care while designing the algorithms to increase the Network lifetime of WSN. Routing, the act of moving information across an internet world from a source to a destination is one of the vital issue associated with Wireless Sensor Network. The Ant Colony Optimization (ACO) algorithm is a probabilistic technique for solving computational problems that can be used to find optimal paths through graphs. The short route will be increasingly enhanced therefore become more attractive. The foraging behavior and optimal route finding capability of ants can be the inspiration for ACO based algorithm in WSN. The nature of ants is to wander randomly in search of food from their nest. While moving, ants lay down a pheromone trail on the ground. This chemical pheromone has the ability to evaporate with the time. Ants have the ability to smell pheromone. When selecting their path, they tend to select, probably the paths that has strong pheromone concentrations. As soon as an ant finds a food source, carries some of it back to the nest. While returning, the quantity of chemical pheromone that an ant lay down on the ground may depend on the quantity and quality of the food. The pheromone trails will lead other ants towards the food source. The path which has the strongest pheromone concentration is followed by the ant which is the shortest paths between their nest and food source. This paper surveys the ACO based routing in various Networking domains like Wireless Sensor Networks and Mobile Ad Hoc Networks.
An efficient ant optimized multipath routing in wireless sensor networkEditor Jacotech
Today, the Wireless Sensor Network is increasingly gaining popularity and importance. It is the more interesting and stimulating area of research. Now, the WSN is applied in object tracking and environmental monitoring applications. This paper presents the self-optimized model of multipath routing algorithm for WSN which considers definite parameters like delay, throughput level and loss and generates the outcomes that maximizes data throughput rate and minimizes delay and loss. This algorithm is based on ANT optimization technique that will bring out an optimal and organized route for WSN and is also to avoid congestion in WSN, the algorithm incorporate multipath capability..
A mobile monitoring and alert sms system with remote configuration – a case s...Editor Jacotech
One of the parent´s main concerns nowadays it to know their children´s whereabouts. Some applications exist to address this issue and most of them rely on internet connection which makes the solution expensive. In this paper we present a low cost solution, based on SMS, and with the ability to remotely configure the child monitoring process. We also present the architecture and the full flowchart of the child application whenever a SMS is received. This case study uses Android and the more recent location API – the Fused Location Provider. For obvious reasons, the security issue has been a concern, which resulted in a configuration module in the child application to specify authorized senders
Leader Election Approach: A Comparison and SurveyEditor Jacotech
In distributed system, the coordinator is needed to manage the use of the resources in the shared environment. Many algorithms have been proposed for the same. They have various positive and negative parts. Here we will discuss those issues which ensure the efficiency of the algorithm for election leader. Here a comparison will be provided to show the advantages and disadvantages of different election algorithms. The comparison would be based on the number of messages passing and the order of time complexity.
Leader election approach a comparison and surveyEditor Jacotech
This document summarizes and compares several leader election algorithms in distributed systems. It discusses the Bully algorithm and some modifications, including using two successors, dividing nodes into sets, and using max-heap and Fibonacci heap data structures. The algorithms are compared based on time complexity, number of messages required, and memory usage. The Fibonacci heap approach is identified as the most efficient with O(log n) time complexity and minimum message passing of log(n).
Modeling of solar array and analyze the current transientEditor Jacotech
Spacecraft bus voltage is regulated by power
conditioning unit using switching shunt voltage regulator having
solar array cells as the primary source of power. This source
switches between the bus loads and the shunt switch for fine
control of spacecraft bus voltage. The effect of solar array cell
capacitance [5][6] along with inductance and resistance of the
interface wires between solar cells and power conditioning
unit[1], generates damped sinusoidal currents superimposed on
the short circuit current of solar cell when shunted through
switch. The peak current stress on the shunt switch is to be
considered in the selection of shunt switch in power conditioning
unit. The analysis of current transients of shunt switch in PCU
considering actual spacecraft interface wire length by
illumination of solar panel (combination of series and parallel
solar cells) is difficult with hardware simulation. Software
simulation by modeling solar cell is carried out for a single string
(one parallel) in Pspice [6]. Since in spacecrafts number of
parallels and interface cable length are variable parameters the
analysis of current transients of shunt switch is carried out by
modeling solar array with the help of solar cell model[6] for the
actual spacecraft condition.
Performance analysis of aodv with the constraints ofEditor Jacotech
This document summarizes a research paper that analyzed the performance of the AODV routing protocol in wireless sensor networks under different terrain area sizes and pause times using the NS-3 simulator. The researchers found that packet delivery ratio remained nearly constant for small terrain areas but decreased for larger areas. Average throughput decreased with larger terrain areas, while average delay remained nearly constant for small areas but increased for larger ones. The paper concludes that AODV has better performance in networks with high mobility and size and is preferred for real-time traffic over other protocols like DSR and DSDV.
License plate recognition an insight to the proposed approach for plate local...Editor Jacotech
This document summarizes a journal article that proposes an approach for license plate localization and binarization in license plate recognition systems. The article describes the typical three-stage process of license plate recognition including localization, character segmentation, and character recognition. It then discusses challenges with existing localization approaches for Indian license plates due to variations in formats. The proposed approach exploits features like aspect ratio, texture, and color similarity to localize and extract license plates from images as a preprocessing step before character segmentation and recognition.
Northern Engraving | Nameplate Manufacturing Process - 2024Northern Engraving
Manufacturing custom quality metal nameplates and badges involves several standard operations. Processes include sheet prep, lithography, screening, coating, punch press and inspection. All decoration is completed in the flat sheet with adhesive and tooling operations following. The possibilities for creating unique durable nameplates are endless. How will you create your brand identity? We can help!
Fueling AI with Great Data with Airbyte WebinarZilliz
This talk will focus on how to collect data from a variety of sources, leveraging this data for RAG and other GenAI use cases, and finally charting your course to productionalization.
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/temporal-event-neural-networks-a-more-efficient-alternative-to-the-transformer-a-presentation-from-brainchip/
Chris Jones, Director of Product Management at BrainChip , presents the “Temporal Event Neural Networks: A More Efficient Alternative to the Transformer” tutorial at the May 2024 Embedded Vision Summit.
The expansion of AI services necessitates enhanced computational capabilities on edge devices. Temporal Event Neural Networks (TENNs), developed by BrainChip, represent a novel and highly efficient state-space network. TENNs demonstrate exceptional proficiency in handling multi-dimensional streaming data, facilitating advancements in object detection, action recognition, speech enhancement and language model/sequence generation. Through the utilization of polynomial-based continuous convolutions, TENNs streamline models, expedite training processes and significantly diminish memory requirements, achieving notable reductions of up to 50x in parameters and 5,000x in energy consumption compared to prevailing methodologies like transformers.
Integration with BrainChip’s Akida neuromorphic hardware IP further enhances TENNs’ capabilities, enabling the realization of highly capable, portable and passively cooled edge devices. This presentation delves into the technical innovations underlying TENNs, presents real-world benchmarks, and elucidates how this cutting-edge approach is positioned to revolutionize edge AI across diverse applications.
zkStudyClub - LatticeFold: A Lattice-based Folding Scheme and its Application...Alex Pruden
Folding is a recent technique for building efficient recursive SNARKs. Several elegant folding protocols have been proposed, such as Nova, Supernova, Hypernova, Protostar, and others. However, all of them rely on an additively homomorphic commitment scheme based on discrete log, and are therefore not post-quantum secure. In this work we present LatticeFold, the first lattice-based folding protocol based on the Module SIS problem. This folding protocol naturally leads to an efficient recursive lattice-based SNARK and an efficient PCD scheme. LatticeFold supports folding low-degree relations, such as R1CS, as well as high-degree relations, such as CCS. The key challenge is to construct a secure folding protocol that works with the Ajtai commitment scheme. The difficulty, is ensuring that extracted witnesses are low norm through many rounds of folding. We present a novel technique using the sumcheck protocol to ensure that extracted witnesses are always low norm no matter how many rounds of folding are used. Our evaluation of the final proof system suggests that it is as performant as Hypernova, while providing post-quantum security.
Paper Link: https://eprint.iacr.org/2024/257
Taking AI to the Next Level in Manufacturing.pdfssuserfac0301
Read Taking AI to the Next Level in Manufacturing to gain insights on AI adoption in the manufacturing industry, such as:
1. How quickly AI is being implemented in manufacturing.
2. Which barriers stand in the way of AI adoption.
3. How data quality and governance form the backbone of AI.
4. Organizational processes and structures that may inhibit effective AI adoption.
6. Ideas and approaches to help build your organization's AI strategy.
Main news related to the CCS TSI 2023 (2023/1695)Jakub Marek
An English 🇬🇧 translation of a presentation to the speech I gave about the main changes brought by CCS TSI 2023 at the biggest Czech conference on Communications and signalling systems on Railways, which was held in Clarion Hotel Olomouc from 7th to 9th November 2023 (konferenceszt.cz). Attended by around 500 participants and 200 on-line followers.
The original Czech 🇨🇿 version of the presentation can be found here: https://www.slideshare.net/slideshow/hlavni-novinky-souvisejici-s-ccs-tsi-2023-2023-1695/269688092 .
The videorecording (in Czech) from the presentation is available here: https://youtu.be/WzjJWm4IyPk?si=SImb06tuXGb30BEH .
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfChart Kalyan
A Mix Chart displays historical data of numbers in a graphical or tabular form. The Kalyan Rajdhani Mix Chart specifically shows the results of a sequence of numbers over different periods.
"Choosing proper type of scaling", Olena SyrotaFwdays
Imagine an IoT processing system that is already quite mature and production-ready and for which client coverage is growing and scaling and performance aspects are life and death questions. The system has Redis, MongoDB, and stream processing based on ksqldb. In this talk, firstly, we will analyze scaling approaches and then select the proper ones for our system.
Generating privacy-protected synthetic data using Secludy and MilvusZilliz
During this demo, the founders of Secludy will demonstrate how their system utilizes Milvus to store and manipulate embeddings for generating privacy-protected synthetic data. Their approach not only maintains the confidentiality of the original data but also enhances the utility and scalability of LLMs under privacy constraints. Attendees, including machine learning engineers, data scientists, and data managers, will witness first-hand how Secludy's integration with Milvus empowers organizations to harness the power of LLMs securely and efficiently.
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
What is an RPA CoE? Session 1 – CoE VisionDianaGray10
In the first session, we will review the organization's vision and how this has an impact on the COE Structure.
Topics covered:
• The role of a steering committee
• How do the organization’s priorities determine CoE Structure?
Speaker:
Chris Bolin, Senior Intelligent Automation Architect Anika Systems
"Frontline Battles with DDoS: Best practices and Lessons Learned", Igor IvaniukFwdays
At this talk we will discuss DDoS protection tools and best practices, discuss network architectures and what AWS has to offer. Also, we will look into one of the largest DDoS attacks on Ukrainian infrastructure that happened in February 2022. We'll see, what techniques helped to keep the web resources available for Ukrainians and how AWS improved DDoS protection for all customers based on Ukraine experience
"Frontline Battles with DDoS: Best practices and Lessons Learned", Igor Ivaniuk
1377179967 42797809
1. Journal of Advanced Computing and Communication Technologies (ISSN: 2347 - 2804)
Volume No.1 Issue No. 1, August 2013
Privacy in Location-Based Services using SP-Filtering in Hide
and Seek Protocol with Obfuscation- Based Methods
By
Munmun Sharma
California State University East Bay,USA
Munmun.kinshuk@gmail.com
ABSTRACT
Privacy in Location based services has always been a question
in terms of Security and Privacy. And lately there has been
some work done on Privacy part of Location Based Services
(LBS). This Privacy known name as “Privacy aware
Proximity based services.” In Privacy aware Proximity based
services; two mobile users will check if they're in proximity to
every alternative while not revealing their actual locations .
This paper will describe the implementation of one such
protocol which is used for preserving the privacy of user’s
exact location called “Hide and Seek Protocol using SPfiltering Protocol”.
precise. Some examples can be: Bluetooth[2], WLAN[3],
RFID[4] and many more.[1]
2. ARCHITECTURE
In order to ensure that location privacy is enforced,
architecture is needed to be described. It is important that
Privacy services should not interfere the existing services, it is
better to apply privacy thus implementation can be done in
service layer. Figure 1 shows service layer will follow a client
server architecture model [5].
Keywords
Location-Based Services, Privacy, Proximity, Obfuscation
Based Methods, SP-Filtering, Hide and Seek Protocol.
1. INTRODUCTION
LBS are position dependent services which are available
for IP capable devices and are used to identify the location of
a user or object. These services can be either Push based or
Query based services. Apart from other technologies used in
LBS, positioning the mobile terminal requires specific
infrastructure. Positioning is defined as location of an object
either in co-ordinate system, route system or areal division.
Here in this paper we will be considering Geocoding in order
to make reference as coordinates to objects [1].
Fig. 1. Architecture of Location Based Services
In LBS, Positioning is defined in 3 main classes Satellite
Positioning, Network Positioning and Local Positioning.
Satellite Positioning is an infrastructure used between
terminals and earth orbiting satellites. Positioning is
calculated with the help of 3 or more satellites which sends
radio signals to terminals. This method provides 10-40 m
accuracy. In Network Based Positioning, Position is
calculated on the basis of signals sent by three or more base
stations and received by terminal. Local Positioning is used
for restricted areas like buildings, malls etc. Where the
satellites signals and network based positioning signals are not
Client takes the responsibility to allow users to manage
privacy policies and server helps in providing authorization to
location based services. Here is the description of architecture
and relationship of modules with the sub modules. The system
architecture of location based services comprises of 3 main
components, Location Provider, Mobile Device and Service
Provider. Location Provider contains GPS receiver and GPS
Locator. GPS Receiver receives GPS request from mobile
devices. GPS Locator takes the responsibility of computing
the actual physical location. When all these results are
computed, they are sent back to the mobile devices which
1
2. Journal of Advanced Computing and Communication Technologies (ISSN: 2347 - 2804)
Volume No.1 Issue No. 1, August 2013
requested the query. In Mobile Devices all the devices which
consist of GPS capabilities like phones and PDAs are
included in Mobile Devices. Location updates are sent by
these mobile phones to respective service Providers. Once
these updates are sent to respective service providers, these
service providers will provide protections that are required in
LBS. Application logic takes the responsibility for managing
the communication between service provider and mobile
devices. Application Logic also helps in sending the updates
from mobile devices and receiving event notification from SP.
Second component is Access Management User Interface.
This interface helps mobile users to manage own policies for
privacy like creating and updating the policies. It also
communicates directly to Privacy Agent Module through
secure channel .Context elements and policy objects are sent
via secure communication channel. Location based Services
are provided by Service Provider to its subscribed mobile
users. Services provided can be either event driven or per-use
requests. It has Communication Services, Application services
Location Services and Privacy agent. And these communicate
through Users, Event Handlers, LBS Database, Authentication
Database and Policies Database. [5]
In the next sections, Classification of Privacy Preserving
Technique are explained, including implementation of
Obfuscation Based methods, SP-Filtering and Hide & Seek
Protocol.
3. PRIVACY PRESERVING
TECHNIQUES
Numbers of attacks are possible in Location Based
Services. Some examples are Multi Query Attacks which
includes Shrink Region Attack and Region Intersection
Attack [6], Location-Based Quasi-Identifiers [7], Passive
Attacks, Active Attacks including Replay Attacks, Timing
Attacks and Result Tempering Attacks [8].
As shown in Figure 2 LBS privacy methods are divided
into 2 main categories Trusted Third Party Based (TTPbased) and Trusted Third Party–Free Based (TTP-Free based).
Fig. 2. Classification of LBS Privacy methods
TTP Based schemes are are very common because they are
easy to understand/develop, and because they offer a
reasonable trade-off between efficiency, accuracy and
privacy. These can be classified into Simple scheme, Policybased schemes, Pseudonym- Based and Anonymity- Based.
[9]
TTP-free schemes solves the drawbacks of TTP-Based
Schemes (i) the architecture relies on a TTP, so that the user
relay the platform mediating between him and the LBS
provider; (ii)
it is assumed that LBS providers are not
malicious but semi-honest, which might turn out to be too
much of an idealization; and (iii) the architecture is
centralized, which makes it vulnerable to DoS attacks. There
are various methods which are used by TTP-free schemes like
Collaboration-based methods, PIR- based methods and
Obfuscation-based methods.[9] Some of the Protocols which
works on TTP- Free based schemes are, Boneh Protocol 3[10],Hide and Crypt Protocol [4] and other protocols which
are TTP based are Boneh Protocol-2 [10] Homomorphic
Encryptions [11].
In the coming sections Obfuscation Based methods, SPFiltering, Hide and Seek Protocol and their Implementation
are explained.
4. OBFUSCATION BASED METHODS
In Obfuscation Based Methods, the space is modeled as a
graph where vertices are locations and edges indicate
adjacency. Hence, in order to obtain an imprecise location, the
user sends a set of vertices instead of the single vertex in
which he is located. The LBS provider cannot distinguish
which of the vertices is the real one. The article proposes
negotiation algorithms that allow users to increase the QoS
whilst maintaining their privacy. The main problem of this
technique is that users and providers must share the graph
modeling the space or other methods where the real location
of LBS users is replaced by circular areas of variable center
and radius. The main advantages of this method are: (i) no
TTP and no collaboration are needed; (ii) the closest interest
point is always found; (iii) the location of the user is hidden in
a controlled area. However, due to the shortage of
collaboration, this technique isn't ready to attain the kanonymity and/or the l-diversity properties.[12]
In the coming Sections , we will explain how this
Obfuscation Based Methods will be used
during the
Implementation of SP-Filter Protocol and Hide & Seek
Protocol.
5. SP- FILTERING PROTOCOL
SP-Filtering Protocol is called a Three Party Protocol where
there are three parties Alice, Bob and Service Provider
(SP).SP act as a server between 2 clients Alice and Bob. This
Protocol is used to provide proximity between 2 buddies Alice
and Bob. Privacy provided by this protocol is a minimum
level of Privacy and computes the Proximity of Bob to Alice
[13].
Here is the working of the protocol. Whenever Alice
updates her location, she doesn’t send the exact location to the
Service Provider. Instead, she will send a generalized location
to the service Provider.
This generalized location is computed as a function of GUA
and the granule GSPA (i) where A is located. More precisely, A
sends to SP the location LA (i) that is computed as the union
of the granules of GUA that intersects with GSPA (i). [13]
LA (i) =
U
i' € N|GUA(i')∩ GSPA (i)≠Ɵ
Similarly Bob will also update his location and the index j
will be used and the location will be defined in GSPB (j). It is
the responsibility of Service Provider to compute the LB
(j).After this is done Service Provider Computes the distances
between LA (i) and LB (j). Since these are granules, there will
be 2 distances. One will be d which will be the minimum
distance between LA (i) and LB (j) and another will be D
which is maximum distance between LA (i) and
LB (j).
2
3. Journal of Advanced Computing and Communication Technologies (ISSN: 2347 - 2804)
Volume No.1 Issue No. 1, August 2013
There is another term called δA which explains the preferred
proximity of Alice .Now three conditions establishes which
are shown in Figure 3. A) If D < δA, then Bob is in proximity
of Alice.
To start with the implementation, there will requirement for
a couple of statistics. First, In order to know, weather the
buddy Bob is in Proximity or not, there will be a requirement
of preferred proximity which is δA [4]. Second the exact
location of Alice in the form of latitude and longitude.
After these two fields are known to the mobile device,
another eight co-ordinates will be generated in a form of
square around the exact location defining granularity of A i.e.
GUA (i).
δA is in the form of Distance (eg. Miles). In order to get the
other co-ordinates, it needs to change into degrees. 1° of
Latitude is 69 miles and 1° of Longitude is 53 miles.
Fig 3. Regions LA and LB
B) If D > δA, then Bob is not in proximity of Alice. C) If d ≤
δA ≤ D, then Bob Possibly be in Proximity of Alice. Condition
C arises because exact location of Alice and Bob is not
known. Bob can reside anywhere in LB (j).If Bob is located in
bottom left corner of LB (j) and Alice is located in upper right
corn or of LA (i), then Bob will be in proximity of Alice.
Otherwise it is not.
Fig 4. Defining Granularity of A
SP- filtering works very well in the Conditions A and B.
But for condition C it is not able to show the accurate results.
Therefore, In order to solve the Problem of Sp-Filtering, the
SP-protocol can be combined with more accurate method of
Hide and Seek which is discussed in the next section.
6. HIDE AND SEEK PROTOCOL
To remove the drawback of SP-Filtering Protocol (When it
declares Bob possibly in proximity of Alice), we are
combining the Hide and Seek Protocol in order to provide
accurate proximity results.
In this paper, we are considering Hide and Seek Protocol as a
2-party protocol. In 2- party protocol, first Alice will send to
Bob the values of i' and δA. . Here i' is granule where GUA is
located and δA is the preferred proximity of Alice. Now, Bob
will compute minimum distance between any 2 points GUA(i')
and GUB(j'),where GUB(j') is the granule where B is located.
This minimum distance will be given by d’. Now 2 conditions
will arise A) If d’> δA then Bob is not in Proximity B) If d’<
δA then Bob is not in Proximity.[13]
In the next Sections, we will explain how these,
Obfuscation method, SP-Filter Protocol and Hide and Seek
Protocol are combined and implemented together, in order to
provide proximity results.
As shown in Figure 4, with the help of A(x,y) , eight coordinates are generated. Taken A as center and δA as radius,
first 4 points are generated. U, W, S and Q. Now, with the
help of these four points another four points will be
calculated. Since, now U and W are already known, point V
(v1, v2)can be calculated.
v1= x+( δA/69) and v2= y- (δA/53)
Similarly P, V and R can be found out. Once all the 8 points
are calculated, then all the eight points are sent to Service
Provider (SP).
Similarly User B will also send his eight points in the form
of GUB (j) to the Service Provider. Once the service provider
gets all the 16 points, implementation of SP-Filtering Protocol
begins.
SP-Filtering Protocol works on the principle of comparing
distance. Once the comparison is made, results are declared in
the form of In-Proximity, Might-be in Proximity and not in
Proximity [13].
7. IMPLEMENTATION
Implementation of Hide and Seek starts with the
implementation of SP-Filtering Protocol. There will be 2 users
A and B and a Service Provider. User A won’t send his exact
location to the Service Provider. Instead she will send a
generalized location to A. Now two questions arise, who is
going to decide the scope of granules and how the granules
will be defined? Here are the answers. User A herself will
decide the scope of granularity through her mobile device.
Second, The granules will be decided using the obfuscation
method [12]. Here we will be using co-ordinate system to
define the scope of granularity.
Fig 5. Distance calculation by Service Provider
3
4. Journal of Advanced Computing and Communication Technologies (ISSN: 2347 - 2804)
Volume No.1 Issue No. 1, August 2013
Figure 5 above shows the description of how the distances
are calculated among these sixteen co-ordinates.
Distance 1=
Each point of GUA (i) will be compared to each point of GUB
(j). For example, if point (XA1, YA1) are taken then distance of
(XA1, YA1) are compared to all eight points of GUB (j).As given
in figure distance are shown from number 1 to 8.
When distance of each point with every point is calculated,
there will be total 64 distances calculated. From the set of
these 64 distances, Maximum Distance (D) and Minimum
Distance (d) is calculated.
Fig 7. Division of area into smaller grids
Once all the distances D and d are calculated, Proximity
Calculation begins. If D≤ δA then result shows “B is in
proximity of A”. If d≥δA then “B is not in Proximity of A”. If
d≤ δA≥D the “B might be in Proximity of A”. [13]
First two conditions are straight forward in SP-Filtering
Protocol. Problem arises when there is third condition i.e.
might be in-proximity condition. Because in Might be
Condition User B may be or may not be in proximity shown
in Figure 3.
Area1, Area2, Area 3 and Area4 are the four grids into which
area Gamma is divided. Table 1 below shows the index
numbers and area defined by the index with their coordinates.
For implementation purpose, only one co-ordinate is used to
define the area of grid. Here values of m and n represents the
number of granules in the area Gamma.
Table 1: Defining and Naming the index of the grids
To remove this problem, Protocol Hide and Seek comes in
action. When there is a might be condition, the last thing done
by Service provider is that, it will divide the whole area into
smaller grids and index is provided to the grids. Grids are
given index number and size of grid is similar to the Granules
of B i.e. GUB (j).
Area
Index m
n
Latitude
Area 1
1
1
1
max Lat.of GUB
Area 2
2
1
2
Max.Lat.of GUB
Area 3
3
2
1
Area 4
4
2
2
Longitude
min Long.of GUB
min Long of GUB
+n((δB/53))
max.Lat.of GUB(j)- min.Long.of GUB(j)
(m(δB/69))
max.Lat.-(m(δB/69)) min.Long.+(n(δB/53))
When all the grids are defined GUA (i´) will be Area 1,
area 2, area 3 and Area 4 as A’s exact location is not known
and GUB (j’) will be definitely area 1. Now these GUA (i´) and
GUB (j’) will be sent by SP to user A and User B with message
“B might be in proximity”. From this point Hide and Seek
protocol will start.
Fig. 6 Defining of Area Gamma for dividing into the grids
Figure 6 shows the Area which will be divided into the
grids. Area will be defined in the form of square, where both
GUA (i) and GUB (j) are residing. Co-ordinates of this square
will be defined as maximum latitude and minimum longitude
of GUB (j) to minimum latitude and maximum longitude of
GUA (i) and from minimum latitude and minimum longitude
of GUA (i) and GUB (j) to maximum latitude to maximum
longitude of GUA (i) and GUB (j).
As of now, the area Gamma of further division is defined.
Now the actual division into grids will take pace as shown in
figure 7 and index will be provided.
After receiving this message, A will start a 2 party protocol
and send B the value of i´ and δA where i´ is the grid where A
is located. Suppose A is in area 3, then it will send index 3 to
B.
Now B will calculate the minimum distance between any
2 points of GUA (i´) and GUB (j’) and will be given the name
d´. If d´ is greater than or equal to δA then result will be send
by B to A that B is not in proximity else it will send B is in
proximity.
In the next coming sections, Code, Screenshots ,Analysis ,
Road blocks and conclusion are described.
8. ANALYSIS
Analysis of project Hide and Seek includes the time to
calculate the proximity of user B from A. For this purpose we
have chosen clock to find out the time. The Performance
analysis is done on the basis of Table 2 :
4
5. Journal of Advanced Computing and Communication Technologies (ISSN: 2347 - 2804)
Volume No.1 Issue No. 1, August 2013
Table 2: Parameters used in calculating performance
9. REFERENCES
Parameter
Values
Proximity (δ) in Miles(M)
1, 3 , 5, 10
Area of GUA(M2)
2,3,4,5,6,7,8,9,10
Stefano Berretti, Alberto Del Bimbo, Pietro Pala,
Francisco Jos`e
SilvaMata ,“Face Recognition By
SVM Classification Of 2D And 3D
Radial Geodesics”
University of Firenze, Italy IEEE 2008.
4 ,36,100 ,400
Number of Buddies in Group
[1]
Fig. 11. shows the performance of SP-Filtering Protocol.
This is done so as to analyze the time in calculating the server
side computation.X-axis shows number of buddies and Y-axis
shows the computation time in milliseconds. It can be seen
that as the number of buddies increases computation time
increases and thus the time increases.
[2] Nils J. Nilsson, “Introduction to Machine Learning”,
Department of
Computer Science Stanford
University, December 1996.
[3] Jun-Ying Gan, Si-Bin He, “Face Recognition Based on
2DLDA and
Support
Vector Machine”,
Proceedings
of
the
2009
International
Conference on Wavelet Analysis and Pattern
Recognition, Baoding,
IEEE 2009, pp.211-214.
10. [4] Praseeda Lekshmi V, Dr. M Sasikumar, Divya S
Vidyadharan “Facial
Expression Classification from
Gabor features using SVM” .
[5] Du Hongle, Teng Shaohua, Zhu Qingfang, “Fast SVM
Incremental
Learning Based on Clustering
Algorithm”, College of Mathematics
Luoyang normal university Luoyang, China, IEEE
2009, pp.13-17.
Fig. 11. Performance of SP-Filtering Protocol
Fig. 12. Shows the performance of Hide and Seek Protocol .
This is done to understand the client to client communication
performance. It can be seen fro mthe table that as the number
of buddies increases , computation time also increases.
[6]
Qian-Ying Chen, Qiang Yang' “Segmentation Of
Images Using Support
Vector Machines”
Proceedings of the Third International Conference on
Machine Learning and Cybernetics, Shanghai, 26-29
August 2004.
[7] M. Palaniswami, A. Shilton, D. Ralph and B.D. Owen
“ Machine
Learning Using Support Vector
Machines ” The University of
Melbourne,
Victoria-3101, Australia.
Fig. 12. Performance of Hide and Seek Protocol
Fig. 13 shows the comparison between 2 protocol
performance. It can be seen that both the performance are
increasing linearly but server side time computation is more
as they are dealing with big granules , where as Hide and seek
computes the area of index and that too only one ppoint,
which is considered small.
[8]
Ethem Alpaydin, “Introduction To Machine Learning”,
The MIT Press
Cambridge, Massachusetts
London, England, 2004 Massachusetts
Institute of
Technology.
[9]
Shigeo Abe, “Support Vector Machines for pattern
Classification” ,
Springer-Verlag London Limited
2005.
[10] Kebin Cui, Yingshuag Du, “Application of Boolean
Kernel Function
SVM in Face Recognition”,2009
International Conference on Networks
Security,
Wireless Communications and Trusted Computing.
[11]
Fig 13. Comparison between Hide and Seek and SP-Filtering
Protocol
Xia Sun, Qingzhou Zhang, Ziqiang Wang, “ Face
Recognition Based on
NMF and SVM ”, 2009
Second International Symposium on Electronic
Commerce and Security.
[12] Yi - Min Wen and Bao - Liang Lu, “Incremental
Learning of Support
Vector Machines by Classifier
Combining”, Department of Computer
Science and
Engineering, Shanghai Jiao Tong University.
5
6. Journal of Advanced Computing and Communication Technologies (ISSN: 2347 - 2804)
Volume No.1 Issue No. 1, August 2013
[13] Stefan R.Uping. “Incremental Learning with Support
Vector Machines”, Department of Computer Science,
AI Unit University of Dortmund,
Germany. ICDM
2001.
[14] Du Hongle, Teng Shaohua, Zhu Qingfang, “Fast SVM
Incremental
Learning Based on Clustering
Algorithm”, IEEE 2009, pp. 13-17.
[15] Yuanzhi Wang, Fei Zhang, Liwei Chen, “An Approach
to Incremental
SVM Learning Algorithm”, 2008
ISECS International Colloquium on
Computing,
Communication, Control, and 2008 ISECS International
Colloquium on Computing, Communication, Control,
and Management,
IEEE 2008, pp.352-354.
[16] Aouatif Amine, Sanaa Ghouzali, Mohammed Rziza,
Driss Aboutajdine,
“Investigation of Feature
Dimension Reduction based DCT/SVM for Face
Recognition”, 2008 IEEE, pp. 188-193.
[17]
Guo-Yun Zhang, Shi-Yu Peng, Hong-Min Li
“Combination Of DualTree Complex Wavelet And
SVM For Face Recognition”, Proceedings of the
Seventh International Conference on Machine Learning
and
Cybernetics, Kunming, 12-15 July 2008.
[18] Praseeda Lekshmi V, Dr. M Sasikumar, Divya S
Vidyadharan “Facial
Expression Classification from
Gabor features using SVM” .
[19] Zhong-We Li, Jian-Pe Zhang, Jing Yang, “A Heuristic
Algorithm To
Incremental Support Vector Machine
Learning”, Proceedings of Third
International
Conference on Machine Learning and Cybernetics,
Shanghai, IEEE 2004, pp.1764-1767.
[20]
Jin-Long An, Zhengou Wang, Zhen-Ping Ma, “An
Incremental Learning
Algorithm For Support Vector
Machine”, Proceedings of the Second
International
Conference on Machine Learning and Cybernetics, San,
IEEE 2003, pp.1153-1156.
[21] Pei Jiang, Yongjie Li, “A Hybrid Face Recognition
Algorithm Based on
WT, NMFs and SVM”,
University of Electronics Science and Technology of
China, IEEE 2008, pp.734-737.
[22] Xiaoguang Lu, “Image Analysis for Face Recognition”,
Dept. of Computer Science & Engineering Michigan
State University, East Lansing.
[23] C. C. Chang and C.J. Lin. “LIBSVM - A Library for
support
Vector
Machines”
Available
on:
http://www.csie.ntu.edu.tw/~cjlin/libsvm/ 2008.
[24] A. Shilton, M. Palaniswami, “Incremental Training of
Support
Vector
Machines”Available
on:
http://people.eng.unimelb.edu.au/shiltona/publications/in
crement.pdf/2008
6