Phd Projects | IEEE Project | IEEE Projects 2020-19 in Trichy & Chennai

IEEE Projects Trichy, Best IEEE Project Centre Chennai, Final Year Projects in Trichy - We Provide IEEE projects 2018 - 2019 , IEEE 2018 Java Projects for M.E/M.Tech, IEEE 2018 Dot net Projects for B.E/B.Tech, IEEE 2018 Power electronics Projects Engineering & Diploma Students, Matlab, Embedded, NS2 Projects

Thyristor-controlled series compensator and unified Power-flow controller

by

Increased demand of bulk power transfer in the modern power network has led to an increased focus on transmission constraints and alleviation. Flexible ac transmission systems (FACTS) devices offer a versatile alternative to conventional reinforcement methods. Among them, the thyristor-controlled series compensator (TCSC) and unified power-flow controller (UPFC) are important FACTS devices, which are used […]

The Rapid Development Of Online Reputation Systems

by

Online reputation systems are playing increasingly important roles in influencing people’s online purchasing/downloading decisions. The manipulations against such systems which overly inflate or deflate reputation scores of online items are evolving rapidly. For example, for just $9.99, a video on YouTube could receive 30 “I like” ratings or 30 real user comments provided by “IncreaseYouTubeViews.com”. […]

The Rapid Development Of Online Reputation Systems

by

Online reputation systems are playing increasingly important roles in influencing people’s online purchasing/downloading decisions. The manipulations against such systems which overly inflate or deflate reputation scores of online items are evolving rapidly. For example, for just $9.99, a video on YouTube could receive 30 “I like” ratings or 30 real user comments provided by “IncreaseYouTubeViews.com”. […]

A Fine Grained Privacy Preserving Location Query Protocol

by

There are several works achieving privacy-preserving location query, which are based on k-anonymity model. The k-anonymity model has been widely used to protect data privacy. The basic idea is to remove some features such that each item is not distinguishable among other k items. The relevant techniques which achieve k-anonymity of data cannot be used […]

Encrypted Information Hiding in the Spatial Domain

by

The concept of encrypted information hiding has been presented. The use of cryptographic algorithms together with steganography and watermarking methods make it almost impossible for interceptor to recover the encrypted hidden data as this requires the interceptor to detect the existence of the information before attempting to decrypt it. To recover the original data, the […]

Security and Complexity Analysis

by

Firewalls are critical in securing private networks of businesses, institutions, and home networks. A firewall is often placed at the entrance between a private network and the external network so that it can check each incoming or outgoing packet and decide whether to accept or discard the packet based on its policy. A firewall policy […]

The real mobile computing environment in group key management

by

In next-generation mobile communication, multicast service will be a key application for supporting a large group of subscribers simultaneously. Because multicast transmits data to the group simultaneously, it reduces the communication cost significantly. Since multicast may be vulnerable to an overhearing attack, this efficiency can be achieved only when security or access control is guaranteed; […]

Cryptographic Puzzle Hiding Scheme

by

Wireless networks rely on the uninterrupted availability of the wireless medium to interconnect participating nodes. The open nature of this medium leaves it vulnerable to multiple security threats. Anyone with a transceiver can eavesdrop on wireless transmissions, inject spurious messages, or jam legitimate ones. While eaves- dropping and message injection can be prevented using cryptographic […]

A Non-Parametric Patch Sampling Method

by

The proposed method is composed of two main and sequential operations. The first one is a non-parametric patch sampling method used to fill-in missing regions. Rather than filling in missing regions at the original resolution, the inpainting algorithm is applied on a coarse version of the input picture. There are several reasons for performing the […]

A Distributed Optimal Community-Aware Opportunistic Routing (Caor) Algorithm

by

Mobile social networks (MSNs) are a special kind of delay tolerant network (DTN), in which mobile users move around and communicate with each other via their carried short-distance wireless communication devices. Typical MSNs include pocket switch networks, mobile vehicular networks, mobile sensor networks. As more users exploit portable short-distance wireless communication devices (such as smart […]