You are on page 1of 10

Data Alcott Systems, Chennai

(0)9600095046

IEEE 2010- 2011 TITLES

DATA ALCOTT SYSTEMS
Chennai http://www.finalsemprojects.com http://www.dataalcott.com

Ph: (0)9600095047

http://www.finalsemprojects.com

http://www.dataalcott.com

Data Alcott Systems, Chennai

(0)9600095046

IEEE 2010- 2011 TITLES IEEE 2010- 2011 TITLES
A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS - NETWORKING-JUNE 2010 In multihop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. Traditional maximal-weight scheduling (MWS), although throughput-optimal, is difficult to implement in distributed networks. On the other hand, a distributed greedy protocol similar to IEEE 802.11 does not guarantee the maximal throughput. In this paper, we introduce an adaptive carrier sense multiple access (CSMA) scheduling algorithm that can achieve the maximal throughput distributively. Some of the major advantages of the algorithm are that it applies to a very general interference model and that it is simple, distributed, and asynchronous. Furthermore, the algorithm is combined with congestion control to achieve the optimal utility and fairness of competing flows. Simulations verify the effectiveness of the algorithm. Also, the adaptive CSMA scheduling is a modular MAC-layer algorithm that can be combined with various protocols in the transport layer and network layer. Finally, the paper explores some implementation issues in the setting of 802.11 networks.

A DISTRIBUTED EFFICIENT FLOW CONTROL SCHEME FOR MULTIRATE MULTICAST NETWORKS - PARALLEL AND DISTRIBUTED SYSTEMS- FEB 2010 This paper proposes a novel and efficient distributed flow control scheme for multirate multicast (MR-M), based on the wellknown Proportional Integral and Derivative (PID) controllers. The PID controller at each router computes its expected incoming rate and feed backs this rate to its upstream router, such that the local buffer occupancy can be stabilized at an appropriate value. We give the theoretical analysis of the proposed PID controller in terms of system stability. The proposed MR-M controller achieves the fairness in two aspects: 1) The intrasession fairness, i.e., the receivers from the same source within the same multicast session can receive data at different rates, if they subscribe networks with different capacities; 2) The intersession fairness, i.e., the link bandwidth is fairly shared among multiple multicast sessions from different sources. Extensive simulations have been conducted and the results have demonstrated a superior performance of the proposed scheme in terms of system stability, high link utilization, and high throughput.

http://www.finalsemprojects.com

http://www.dataalcott.com

Data Alcott Systems, Chennai

(0)9600095046

IEEE 2010- 2011 TITLES
A HYBRID GROUP KEY HETEROGENEOUS MANET MANAGEMENT ARCHITECTURE FOR

Group key management scheme for mobile ad-hoc network is a research hotspot. A group key management architecture for a heterogeneous MANET model with UAV-aid and its detailed re-key methods are offered in this paper. At last, the performance analysis result of the architecture is also offered. The overload values of key storage and re-key computing show our scheme suits for heterogeneous mobile ad-hoc network environment.

A NEAR-OPTIMAL ALGORITHM ATTACKING THE TOPOLOGY MISMATCH PROBLEM IN UNSTRUCTURED PEER-TO-PEER NETWORKS - PARALLEL AND DISTRIBUTED SYSTEMS -JULY 2010 In an unstructured peer-to-peer (P2P) network (e.g., Gnutella), participating peers choose their neighbors randomly such that the resultant P2P network mismatches its underlying physical network, resulting in the lengthy communication between the peers and redundant network traffics generated in the underlying network. Previous solutions to the topology mismatch problem in the literature either have no performance guarantees or are far from the optimum. In this paper, we propose a novel topology matching algorithm based on the Metropolis-Hastings method. Our proposal is guided by our insight analytical model and is close to the optimal design. Specifically, we show that our proposal constructs an unstructured P2P network in which a broadcast message, originated by any node v, reaches any other node u by taking approximately the only physical end-to-end delay between v and u. In addition, our design guarantees the exponential broadcast scope. We verify our solution through extensive simulations and show that our proposal considerably outperforms state-of-the-art solutions. ADAPTIVE JOIN OPERATORS FOR RESULT RATE OPTIMIZATION ON STREAMING INPUTS -KNOWLEDGE AND DATA ENGINEERING- AUGUST 2010 Adaptive join algorithms have recently attracted a lot of attention in emerging applications where data are provided by autonomous data sources through heterogeneous network environments. Their main advantage over traditional join techniques is that they can start producing join results as soon as the first input tuples are available, thus, improving pipelining by smoothing join result production and by masking source or network delays. In this paper, we first propose Double Index NEsted-loops Reactive join (DINER), a new adaptive two-way join algorithm for result rate maximization. DINER combines two key elements: an intuitive flushing policy that aims to increase the productivity of in-memory tuples in producing results during the online phase of the join, and a novel reentrant join technique that allows the algorithm to rapidly switch between processing in-memory and disk-resident tuples, thus, better exploiting temporary delays when new data are not available. We then extend the applicability of the proposed

http://www.finalsemprojects.com

http://www.dataalcott.com

Data Alcott Systems, Chennai

(0)9600095046

IEEE 2010- 2011 TITLES
technique for a more challenging setup: handling more than two inputs. Multiple Index NEsted-loop Reactive join (MINER) is a multiway join operator that inherits its principles from DINER. Our experiments using real and synthetic data sets demonstrate that DINER outperforms previous adaptive join algorithms in producing result tuples at a significantly higher rate, while making better use of the available memory. Our experiments also shows that in the presence of multiple inputs, MINER manages to produce a high percentage of early results, outperforming existing techniques for adaptive multiway join.

ADAPTIVE WORKLOAD PREDICTION OF GRID PERFORMANCE IN CONFIDENCE WINDOWS - PARALLEL AND DISTRIBUTED SYSTEMS-JULY 2010 Predicting grid performance is a complex task because heterogeneous resource nodes are involved in a distributed environment. Long execution workload on a grid is even harder to predict due to heavy load fluctuations. In this paper, we use Kalman filter to minimize the prediction errors. Weapply Savitzky-Golay filter to train a sequence of confidence windows. The purpose is to smooth the prediction process from being disturbed by load fluctuations. We present a new adaptive hybrid method (AHModel) for load prediction guided by trained confidence windows. We test the effectiveness of this new prediction scheme with real-life workload traces on the AuverGrid and Grid5000 in France. Both theoretical and experimental results are reported in this paper. As the lookahead span increases from 10 to 50 steps (5 minutes per step), the AHModel predicts the grid workload with a mean-square error (MSE) of 0.04-0.73 percent, compared with 2.54-30.2 percent in using the static point value autoregression (AR) prediction method. The significant gain in prediction accuracy makes the new model very attractive to predict Grid performance. The model was proved especially effective to predict large workload that demands very long execution time, such as exceeding 4 hours on the Grid5000 over 5,000 processors. With minor changes of some system parameters, the AHModel can apply to other computational grids as well. At the end, we discuss extended research issues and tool development for Grid performance prediction

http://www.finalsemprojects.com

http://www.dataalcott.com

Data Alcott Systems, Chennai

(0)9600095046

IEEE 2010- 2011 TITLES
BINRANK: SCALING DYNAMIC AUTHORITY-BASED SEARCH USING MATERIALIZED SUBGRAPHS - KNOWLEDGE AND DATA ENGINEERING-AUGUST 2010 Dynamic authority-based keyword search algorithms, such as ObjectRank and personalized PageRank, leverage semantic link information to provide high quality, high recall search in databases, and the Web. Conceptually, these algorithms require a querytime PageRank-style iterative computation over the full graph. This computation is too expensive for large graphs, and not feasible at query time. Alternatively, building an index of precomputed results for some or all keywords involves very expensive preprocessing. We introduce BinRank, a system that approximates ObjectRank results by utilizing a hybrid approach inspired by materialized views in traditional query processing. We materialize a number of relatively small subsets of the data graph in such a way that any keyword query can be answered by running ObjectRank on only one of the subgraphs. BinRank generates the subgraphs by partitioning all the terms in the corpus based on their co-occurrence, executing ObjectRank for each partition using the terms to generate a set of random walk starting points, and keeping only those objects that receive non-negligible scores. The intuition is that a subgraph that contains all objects and links relevant to a set of related terms should have all the information needed to rank objects with respect to one of these terms. We demonstrate that BinRank can achieve subsecond query execution time on the English Wikipedia data set, while producing high-quality search results that closely approximate the results of ObjectRank on the original graph. The Wikipedia link graph contains about 108 edges, which is at least two orders of magnitude larger than what prior state of the art dynamic authority-based search systems have been able to demonstrate. Our experimental evaluation investigates the trade-off between query execution time, quality of the results, and storage requirements of BinRank. CONTROLLED WI-FI SHARING IN CITIES: A APPROACH RELYING ON INDIRECT RECIPROCITY -MOBILE COMPUTING-AUGUST 2010 DECENTRALIZED

In densely populated cities, Wi-Fi networks—private or otherwise—are ubiquitous. We focus on the provision of citywide broadband communication capability to mobile users through private Wi-Fi networks that are in range but belong to others. We form a club that relies on indirect reciprocity: Members participate in the club and provide free Wi-Fi access to other members in order to enjoy the same benefit when they are away from their own Wi-Fi network. Our club scheme does not require registration with an authority and does not rely on centrally issued club identities: Members create their own identities (public-private key pairs) and receive signed digital receipts when they provide Wi-Fi service to other members. These receipts form a distributed receipt graph, parts of which are used as input to an indirect reciprocity algorithm that classifies club members according to their contribution. We show that our algorithm can sustain cooperation within the club and is robust to attacks by free-riders. We implement and evaluate our proposed club algorithms on commodity Wi-Fi routers and dual-mode cellular/Wi-Fi

http://www.finalsemprojects.com

http://www.dataalcott.com

Data Alcott Systems, Chennai

(0)9600095046

IEEE 2010- 2011 TITLES
phones. Because we anticipate that Wi-Fi telephony will be a popular club application, we present and evaluate a secure and decentralized architecture for citywide voice (and multimedia) communications that is compatible with our club both from an architectural as well as an incentives perspective.

DECENTRALIZED ALGORITHMS MULTICLASS LOSS NETWORKS -NETWORKING-JUNE 2010

FOR

ADAPTIVE

PRICING

IN

We introduce a set of algorithms for pricing calls on a multiclass loss network with unknown demand elasticity. The algorithms are design to observe the network and use real-time pricing to estimate demand elasticity and other unknown system parameters, and modify per-class prices in order to improve the long-run average revenue. The algorithms can be implemented online, have small memory and computational requirements, and are robust to parametric uncertainty.We provide sufficient conditions for the convergence of the algorithms to a local optimum, and illustrate their performance through numerous numerical examples. The paper also discusses how these algorithms can be distributed to multiple agents on a per-class basis, and provide bounds to error estimates introduced by our decoupling approach. DECENTRALIZED QOS-AWARE CHECKPOINTING ARRANGEMENT IN MOBILE GRID COMPUTING -MOBILE COMPUTING-AUGUST 2010 This paper deals with decentralized, QoS-aware middleware for checkpointing arrangement in Mobile Grid (MoG) computing systems. Checkpointing is more crucial in MoG systems than in their conventional wired counterparts due to host mobility, dynamicity, less reliable wireless links, frequent disconnections, and variations in mobile systems. We’ve determined the globally optimal checkpoint arrangement to be NPcomplete and so consider Reliability Driven (ReD) middleware, employing decentralized QoS-aware heuristics, to construct superior checkpointing arrangements efficiently. With ReD, an MH (mobile host) simply sends its checkpointed data to one selected neighboring MH, and also serves as a stable point of storage for checkpointed data received from a single approved neighboring MH. ReD works to maximize the probability of checkpointed data recovery during job execution, increasing the likelihood that a distributed application, executed on the MoG, completes without sustaining an unrecoverable failure. It allows collaborative services to be offered practically and autonomously by the MoG. Simulations and actual testbed implementation show ReD’s favorable recovery probabilities with respect to Random Checkpointing Arrangement (RCA) middleware, a QoS-blind comparison protocol producing random arbitrary checkpointing arrangements.

http://www.finalsemprojects.com

http://www.dataalcott.com

Data Alcott Systems, Chennai

(0)9600095046

IEEE 2010- 2011 TITLES
FAST AND MESSAGE-EFFICIENT GLOBAL SNAPSHOT ALGORITHMS FOR LARGE-SCALE DISTRIBUTED SYSTEMS -PARALLEL AND DISTRIBUTED SYSTEMS-JANUARY 2010 Abstract—Large-scale distributed systems such as supercomputers and peer-to-peer systems typically have a fully connected logical topology over a large number of processors. Existing snapshot algorithms in such systems have high response time and/or require a large number of messages, typically Oðn2Þ, where n is the number of processes. In this paper, we present a suite of two algorithms: simple_tree, and hypercube, that are both fast and require a small number of messages. This makes the algorithms highly scalable. Simple_tree requires OðnÞ messages and has Oðlog nÞ response time. Hypercube requires Oðn log nÞ messages and has Oðlog nÞ response time, in addition to having the property that the roles of all the processes are symmetrical. Process symmetry implies greater potential for balanced workload and congestionfreedom. All the algorithms assume non-FIFO channels. LOCALIZED MULTICAST: EFFICIENT AND DISTRIBUTED REPLICA DETECTION IN LARGE-SCALE SENSOR NETWORKS -MOBILE COMPUTING-JULY 2010 Due to the poor physical protection of sensor nodes, it is generally assumed that an adversary can capture and compromise a small number of sensors in the network. In a node replication attack, an adversary can take advantage of the credentials of a compromised node to surreptitiously introduce replicas of that node into the network. Without an effective and efficient detection mechanism, these replicas can be used to launch a variety of attacks that undermine many sensor applications and protocols. In this paper, we present a novel distributed approach called Localized Multicast for detecting node replication attacks. The efficiency and security of our approach are evaluated both theoretically and via simulation. Our results show that, compared to previous distributed approaches proposed by Parno et al., Localized Multicast is more efficient in terms of communication and memory costs in large-scale sensor networks, and at the same time achieves a higher probability of detecting node replicas.

http://www.finalsemprojects.com

http://www.dataalcott.com

Data Alcott Systems, Chennai

(0)9600095046

IEEE 2010- 2011 TITLES
ON HIGH-ORDER DENOISING MODELS AND FAST ALGORITHMS FOR VECTOR-VALUED IMAGES -IMAGE PROCESSING-JUNE 2010 Variational techniques for gray-scale image denoising have been deeply investigated for many years; however, little research has been done for the vector-valued denoising case and the very few existent works are all based on total-variation regularization. It is known that total-variation models for denoising gray-scaled images suffer from staircasing effect and there is no reason to suggest this effect is not transported into the vector-valued models. High-order models, on the contrary, do not present staircasing. In this paper, we introduce three high-order and curvature-based denoising models for vector-valued images. Their properties are analyzed and a fast multigrid algorithm for the numerical solution is provided. AMS subject classifications: 68U10, 65F10, 65K10.

ON WIRELESS SCHEDULING ALGORITHMS FOR MINIMIZING THE QUEUE-OVERFLOW PROBABILITY -NETWORKING-JUNE 2010 In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a largedeviation setting, we are interested in algorithms that maximize the asymptotic decay rate of the queue-overflow probability, as the queue-overflow threshold approaches infinity.We first derive an upper bound on the decay rate of the queue-overflow probability over all scheduling policies. We then focus on a class of scheduling algorithms collectively referred to as the “ -algorithms.” For a given , the -algorithm picks the user for service at each time that has the largest product of the transmission rate multiplied by the backlog raised to the power . We show that when the overflow metric is appropriately modified, the minimum-cost-to-overflow under the -algorithm can be achieved by a simple linear path, and it can be written as the solution of a vectoroptimization problem. Using this structural property, we then show that when approaches infinity, the -algorithms asymptotically achieve the largest decay rate of the queueoverflow probability. Finally, this result enables us to design scheduling algorithms that are both close to optimal in terms of the asymptotic decay rate of the overflow probability and empirically shown to maintain small queue-overflow probabilities over queue-length ranges of practical interest

http://www.finalsemprojects.com

http://www.dataalcott.com

Data Alcott Systems, Chennai

(0)9600095046

IEEE 2010- 2011 TITLES
P2P REPUTATION MANAGEMENT USING DISTRIBUTED IDENTITIES AND DECENTRALIZED RECOMMENDATION CHAINS -KNOWLEDGE AND DATA ENGINEERING-JULY 2010 Peer-to-peer (P2P) networks are vulnerable to peers who cheat, propagate malicious code, leech on the network, or simply do not cooperate. The traditional security techniques developed for the centralized distributed systems like client-server networks are insufficient for P2P networks by the virtue of their centralized nature. The absence of a central authority in a P2P network poses unique challenges for reputation management in the network. These challenges include identity management of the peers, secure reputation data management, Sybil attacks, and above all, availability of reputation data. In this paper, we present a cryptographic protocol for ensuring secure and timely availability of the reputation data of a peer to other peers at extremely low costs. The past behavior of the peer is encapsulated in its digital reputation, and is subsequently used to predict its future actions. As a result, a peer’s reputation motivates it to cooperate and desist from malicious activities. The cryptographic protocol is coupled with selfcertification and cryptographic mechanisms for identity management and countering Sybil attack. We illustrate the security and the efficiency of the system analytically and by means of simulations in a completely decentralized Gnutella-like P2P network. PAM: AN EFFICIENT AND PRIVACY-AWARE MONITORING FRAMEWORK FOR CONTINUOUSLY MOVING OBJECTS -KNOWLEDGE AND DATA ENGINEERING-MARCH 2010 Efficiency and privacy are two fundamental issues in moving object monitoring. This paper proposes a privacy-aware monitoring (PAM) framework that addresses both issues. The framework distinguishes itself from the existing work by being the first to holistically address the issues of location updating in terms of monitoring accuracy, efficiency, and privacy, particularly, when and how mobile clients should send location updates to the server. Based on the notions of safe region and most probable result, PAM performs location updates only when they would likely alter the query results. Furthermore, by designing various client update strategies, the framework is flexible and able to optimize accuracy, privacy, or efficiency. We develop efficient query evaluation/reevaluation and safe region computation algorithms in the framework. The experimental results show that PAM substantially outperforms traditional schemes in terms of monitoring accuracy, CPU cost, and scalability while achieving close-to-optimal communication cost.

http://www.finalsemprojects.com

http://www.dataalcott.com

Data Alcott Systems, Chennai

(0)9600095046

IEEE 2010- 2011 TITLES
SECURE DATA COLLECTION IN WIRELESS SENSOR NETWORKS USING RANDOMIZED DISPERSIVE ROUTES -MOBILE COMPUTING _JULY 2010 Compromised-node and denial-of-service are two key attacks in wireless sensor networks (WSNs). In this paper, we study routing mechanisms that circumvent (bypass) black holes formed by these attacks.We argue that existing multi-path routing approaches are vulnerable to such attacks, mainly due to their deterministic nature. So once an adversary acquires the routing algorithm, it can compute the same routes known to the source, and hence endanger all information sent over these routes. In this paper, we develop mechanisms that generate randomized multipath routes. Under our design, the routes taken by the “shares” of different packets change over time. So even if the routing algorithm becomes known to the adversary, the adversary still cannot pinpoint the routes traversed by each packet. Besides randomness, the routes generated by our mechanisms are also highly dispersive and energy-efficient, making them quite capable of bypassing black holes at low energy cost. Extensive simulations are conducted to verify the validity of our mechanisms.

http://www.finalsemprojects.com

http://www.dataalcott.com