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

An Adaptive Network Coded Retransmission Scheme for Single-Hop Wireless Multicast Broadcast Services

by

Network coding has recently attracted attention as a substantial improvement to packet retransmission schemes in wireless multicast broadcast services (MBS). Since the problem of finding the optimal network code maximizing the bandwidth efficiency is hard to solve and hard to approximate, two main network coding heuristic schemes, namely opportunistic and full network coding, were suggested […]

Call Admission Control Performance Analysis in Mobile Networks Using Stochastic Well-Formed Petri Nets

by

(This work is an extension of our conference paper at Valuetools 2006 [18].) Stochastic Well-formed Petri Nets (SWNs) are a powerful tool for modeling complex systems with concurrency, synchronization, and cooperation. Call Admission Control (CAC) is an important mechanism for mobile networks. While several studies have been done on GSM/GPRS and on UMTS system with […]

Missing Value Estimation for Mixed-Attribute Data Sets

by

Missing data imputation is a key issue in learning from incomplete data. Various techniques have been developed with great successes on dealing with missing values in data sets with homogeneous attributes (their independent attributes are all either continuous or discrete). This paper studies a new setting of missing data imputation, i.e., imputing missing data in […]

Authenticated Multistep Nearest Neighbor Search

by

Multistep processing is commonly used for nearest neighbor (NN) and similarity search in applications involving high-dimensional data and/or costly distance computations. Today, many such applications require a proof of result correctness. In this setting, clients issue NN queries to a server that maintains a database signed by a trusted authority. The server returns the NN […]

On Computing Farthest Dominated Locations

by

In reality, spatial objects (e.g., hotels) not only have spatial locations but also have quality attributes (e.g., price, star). An object p is said to dominate another one p’, if p is no worse than p’ with respect to every quality attribute and p is better on at least one quality attribute. Traditional spatial queries […]

Mining Group Movement Patterns for Tracking Moving Objects Efficiently

by

Existing object tracking applications focus on finding the moving patterns of a single object or all objects. In contrast, we propose a distributed mining algorithm that identifies a group of objects with similar movement patterns. This information is important in some biological research domains, such as the study of animals’ social behavior and wildlife migration. […]

Improving Security and Efficiency in Attribute-Based Data Sharing

by

One of the most challenging issues in data sharing systems is the enforcement of access policies and the support of policies updates. Ciphertext policy attribute-based encryption (CP-ABE) is becoming a promising cryptographic solution to this issue. However, the advantage comes with a major drawback which is known as a key escrow problem. The key generation […]

Dynamics of Malware Spread in Decentralized Peer-to-Peer Networks

by

In this paper, we formulate an analytical model to characterize the spread of malware in decentralized, Gnutella type peer-to-peer (P2P) networks and study the dynamics associated with the spread of malware. Using a compartmental model, we derive the system parameters or network conditions under which the P2P network may reach a malware free equilibrium. The […]

Prime: Byzantine Replication under Attack

by

Existing Byzantine-resilient replication protocols satisfy two standard correctness criteria, safety and liveness, even in the presence of Byzantine faults. The runtime performance of these protocols is most commonly assessed in the absence of processor faults and is usually good in that case. However, faulty processors can significantly degrade the performance of some protocols, limiting their […]

Replica Placement for Route Diversity in Tree-Based Routing Distributed Hash Tables

by

Distributed hash tables (DHTs) share storage and routing responsibility among all nodes in a peer-to-peer network. These networks have bounded path length unlike unstructured networks. Unfortunately, nodes can deny access to keys or misroute lookups. We address both of these problems through replica placement. We characterize tree-based routing DHTs and define MaxDisjoint, a replica placement […]