IEEE Final Year Projects 2011-2012 :: Elysium Technologies Pvt Ltd::Paralleldistributed

Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Trichy | Coimbatore | Kollam| Singapore
Website: elysiumtechnologies.com, elysiumtechnologies.info
Email: info@elysiumtechnologies.com

IEEE Final Year Project List 2011-2012

Abstract Parallel And Distributed Computing
2
2011 - 2012

01 A Cooperative Diversity-Based Robust MAC Protocol in Wireless Ad Hoc Networks

In interference-rich and noisy environment, wireless communication is often hampered by unreliable
communication links. Recently, there has been active research on cooperative communication that improves the
communication reliability by having a collection of radio terminals transmit signals in a cooperative way. This
paper proposes a medium access control (MAC) algorithm, called Cooperative Diversity MAC (CD-MAC), which
exploits the cooperative communication capability of the physical (PHY) layer to improve robustness in wireless
ad hoc networks. In CD-MAC, each terminal proactively selects a partner for cooperation and lets it transmit
simultaneously so that this mitigates interference from nearby terminals, and thus, improves the network
performance. For practicability, CD-MAC is designed based on the widely adopted IEEE 802.11 MAC. For
accurate evaluation, this study presents and uses a realistic reception model by taking bit error rate (BER),
derived from Intersil HFA3861B radio hardware, and the corresponding frame error rate (FER) into consideration.
System-level simulation study shows that CD-MAC significantly outperforms the original IEEE 802.11 MAC in
terms of packet delivery ratio and end-to-end delay.

02 A Data Throughput Prediction and Optimization Service for Widely Distributed Many-Task Computing

In this paper, we present the design and implementation of an application-layer data throughput prediction and
optimization service for many-task computing in widely distributed environments. This service uses multiple
parallel TCP streams to improve the end-to-end throughput of data transfers. A novel mathematical model is
developed to determine the number of parallel streams, required to achieve the best network performance. This
model can predict the optimal number of parallel streams with as few as three prediction points. We implement
this new service in the Stork Data Scheduler, where the prediction points can be obtained using Iperf and
GridFTP samplings. Our results show that the prediction cost plus the optimized transfer time is much less than
the non optimized transfer time in most cases. As a result, Stork data transfer jobs with optimization service can
be completed much earlier, compared to nonoptimized data transfer jobs.

03 A Delay-Efficient Algorithm for Data Aggregation in Multihop Wireless Sensor Networks

Data aggregation is a key functionality in wireless sensor networks (WSNs). This paper focuses on data
aggregation scheduling problem to minimize the delay (or latency). We propose an efficient distributed
algorithm that produces a collision-free schedule for data aggregation in WSNs. We theoretically prove that the
delay of the aggregation schedule generated by our algorithm is at most 16R +delta- 14 time slots. Here, R is the
network radius and delta is the maximum node degree in the communication graph of the original network. Our
algorithm significantly improves the previously known best data aggregation algorithm with an upper bound of
delay of 24D + 6delta+ 16 time slots, where D is the network diameter (note that D can be as large as 2R). We
conduct extensive simulations to study the practical performances of our proposed data aggregation algorithm.
Our simulation results corroborate our theoretical results and show that our algorithms perform better in

Madurai Trichy Kollam
Elysium Technologies Private Limited Elysium Technologies Private Limited Elysium Technologies Private Limited
230, Church Road, Annanagar, 3rd Floor,SI Towers, Surya Complex,Vendor junction,
Madurai , Tamilnadu – 625 020. 15 ,Melapudur , Trichy, kollam,Kerala – 691 010.
Contact : 91452 4390702, 4392702, 4394702. Tamilnadu – 620 001. Contact : 91474 2723622.
eMail: info@elysiumtechnologies.com Contact : 91431 - 4002234. eMail: elysium.kollam@gmail.com
eMail: elysium.trichy@gmail.com

1



practice. We prove that the overall lower bound of delay for data aggregation under any interference model is
maxflog n;Rg, where n is the network size. We provide an example to show that the lower bound is
(approximately) tight under the protocol interference model when rI ¼ r, where rI is the interference range and r
is the transmission range. We also derive the lower bound of delay under the protocol interference model when r
< rI < 3r and rI >= 3r.

04 A Framework for Evaluating High-Level Design Methodologies for High-Performance Reconfigurable Computers

High-performance reconfigurable computers have potential to provide substantial performance improvements
over traditional supercomputers. Their acceptance, however, has been hindered by productivity challenges
arising from increased design complexity, a wide array of custom design languages and tools, and often
overblown sales literature. This paper presents a review and taxonomy of High-Level Languages (HLLs) and a
framework for the comparative analysis of their features. It also introduces new metrics and a model based on
computational effort. The proposed concepts are inspired by Netwon’s equations of motion and the notion of
work and power in an abstract multidimensional space of design specifications. The metrics are devised to
highlight two aspects of the design process: the total time-to-solution and the efficient utilization of user and
computing resources at discrete time steps along the development path. The study involves analytical and
experimental evaluations demonstrating the applicability of the proposed model.

05 A Generic Framework for Three-Factor Authentication: Preserving Security and Privacy in Distributed Systems

As part of the security within distributed systems, various services and resources need protection from
unauthorized use. Remote authentication is the most commonly used method to determine the identity of a
remote client. This paper investigates a systematic approach for authenticating clients by three factors, namely
password, smart card, and biometrics. A generic and secure framework is proposed to upgrade two-factor
authentication to three-factor authentication. The conversion not only significantly improves the information
assurance at low cost but also protects client privacy in distributed systems. In addition, our framework retains
several practice-friendly properties of the underlying two-factor authentication, which we believe is of
independent interest.

06 A Physical/Virtual Carrier-Sense-Based Power Control MAC Protocol for Collision Avoidance in Wireless Ad Hoc Networks

A kind of hidden terminal problem, called the POINT problem, which is caused by the expansion of the
interference range of the receiver due to the controlled transmission power of the sender, is deemed a
notorious problem in wireless ad hoc networks. This paper utilizes physical and virtual carrier-sensing
schemes to avoid the POINT problem. We analyze the relationships among the transmission range, the
carrier-sensing range, and the interference range in case power control is adopted, and based on the
analyzed results, we propose four mechanisms to prevent the POINT problem from occurring in wireless ad
hoc networks. This paper further analyzes the superiority of each mechanism under certain situations and
proposes an adaptive range-based power control (ARPC) MAC protocol to make use of the advantages of the


2



four mechanisms to avoid the POINT problem from happening. The proposed protocol cannot only prevent
collisions caused by the POINT problem, but it can also reduce the energy consumption of STAs. Simulation
results also verify the advantages of the proposed protocol.

07 A Pyramidal Security Model for Large-Scale Group-Oriented Computing in Mobile Ad Hoc Networks:
The Key Management Study

In mobile ad hoc networks (MANETs), many applications require group-oriented computing among a large
number of nodes in an adversarial environment. To deploy these largescale cooperative applications, secure
multicast service must be provided to efficiently and safely exchange data among nodes. The existing
literature has extensively studied security protection for a single multicast group, in which all nodes are
assumed to have the same security level. However, such an assumption may not be valid in practice
because, formany applications, different users can play different roles and thus naturally be classified into
multiple security levels. In this paper, we propose a pyramidal security model to safeguard the multisecurity-
level information sharing in one cooperation domain. As a prominent feature, a pyramidal security model
contains a set of hierarchical security groups and multicast groups. To find an efficient key management
solution that covers all the involved multicast groups, we develop the following three schemes for the
proposed security model: 1) separated star key graph; 2) separated tree key graph, and 3) integrated tree key
graph. Performance comparison demonstrates that the scheme of integrated tree key graph has advantages
over its counterparts.

08 A Switch-Tagged Routing Methodology for PC Clusters with VLAN Ethernet

Ethernet has been used for connecting hosts in PC clusters, besides its use in local area networks.
Although a layer-2 Ethernet topology is limited to a tree structure because of the need to avoid
broadcast storms and deadlocks of frames, various deadlock-free routing algorithms on topologies that
include loops suitable for parallel processing can be employed by the application of IEEE 802.1Q VLAN
technology. However, the MPI communication libraries used in current PC clusters do not always
support tagged VLAN technology; therefore, at present, the design of VLAN-based Ethernet cannot be
applied to such PC clusters. In this study, we propose a switch-tagged routing methodology in order to
implement various deadlock-free routing algorithms on such PC clusters by using at most the same
number of VLANs as the degree of a switch. Since the MPI communication libraries do not need to
perform VLAN operations, the proposed methodology has advantages in both simple host
configuration and high portability. In addition, when it is used with on/off and multispeed link
regulation, the power consumption of Ethernet switches can be reduced. Evaluation results using NAS
parallel benchmarks showed that the performance of the topologies that include loops using the
proposed methodology was comparable to that of an ideal one-switch (full crossbar) network, and the
torus topology in particular had up to a 27 percent performance improvement compared with a tree
topology with link aggregation.


3



09 Accelerating Pairwise Computations on Cell Processors

Direct computation of all pairwise distances or interactions is a fundamental problem that arises in many
application areas including particle or atomistic simulations, fluid dynamics, computational electro magnetics,
materials science, genomics and systems biology, and clustering and data mining. In this paper, we present
methods for performing such pairwise computations efficiently in parallel on Cell processors. This problem is
particularly challenging on the Cell processor due to the small sized Local Stores of the Synergistic Processing
Elements, the main computational cores of the processor. We present techniques for different variants of this
problem including those with large number of entities or when the dimensionality of the information per entity is
large. We demonstrate our methods in the context of multiple applications drawn from fluid dynamics, materials
science and systems biology, and present detailed experimental results. Our software library is an open source
and can be readily used by application scientists to accelerate pairwise computations using Cell accelerators.

10 Accelerating the Execution of Matrix Languages on the Cell Broadband Engine Architecture

Matrix languages, including MATLAB and Octave, are established standards for applications in science and
engineering. They provide interactive programming environments that are easy to use due to their script languages
with matrix data types. Current implementations of matrix languages do not fully utilize high-performance, special-
purpose chip architectures, such as the IBM Power X Cell processor (Cell). We present a new framework that extends
Octave to harvest the computational power of the Cell. With this framework, the programmer is alleviated of the burden
of introducing explicit notions of parallelism. Instead, the programmer uses a new matrix data type to execute matrix
operations in parallel on the synergistic processing elements (SPEs) of the Cell. We employ lazy evaluation semantics
for our new matrix data type to obtain execution traces of matrix operations. Traces are converted to data dependence
graphs; operations in the data dependence graph are lowered (split into sub matrices), scheduled and executed on the
SPEs. Thereby, we exploit 1) data parallelism, 2) instruction level parallelism, 3) pipeline parallelism, and 4) task
parallelism of matrix language programs. We conducted extensive experiments to show the validity of our approach.
Our Cell-based implementation achieves speedups of up to a factor of 12 over code run on recent Intel Core2 Quad
processors.

11 Achieving 100% Throughput in Input-Buffered WDM Optical Packet Interconnects

Packet scheduling algorithms that deliver 100% throughput under various types of traffic enable an interconnect to
achieve its full capacity. Although such algorithms have been proposed for electronic interconnects, they cannot be
directly applied to WDM optical interconnects due to the following reasons. First, the optical counterpart of electronic
random access memory (RAM) is absent; second, the wavelength conversion capability of WDM interconnects changes
the conditions for admissible traffic. To address these issues, in this paper, we first introduce a new fiber-delay-line
(FDL)-based input buffering fabric that is able to provide flexible buffering delay, followed by a discussion on the
conditions that admissible traffic must satisfy in a WDM interconnect. We then propose a weight based scheduling
algorithm, named Most-Packet Wavelength-Fiber Pair First (MPWFPF), and theoretically prove that given a buffering
fabric with flexible delay, MPWFPF delivers 100% throughput for input-buffered WDM interconnects with no speedup
required. Finally, we further propose the WDM-iSLIP algorithm, a generalized version of the iSLIP algorithm for WDM


4



interconnects, which efficiently finds an approximate optimal schedule with low time complexity. Extensive simulations
have been conducted to verify the theoretical results, and test the performance of the proposed scheduling algorithms
in input-buffered WDM interconnects.

12 Active Queue Management for Flow Fairness and Stable Queue Length

Two major goals of queue management are flow fairness and queue-length stability However, most prior works dealt
with these goals independently. In this paper, we show that both goals can be effectively achieved at the same time. We
propose a novel scheme that realizes flow fairness and queue-length stability. In the proposed scheme, high-bandwidth
flows are identified via a multilevel caching technique. Then, we calculate the base drop probability for resolving
congestion with a stable queue, and apply it to individual flows differently depending on their sending rates. Via
extensive simulations, we show that the proposed scheme effectively realizes flow fairness between unresponsive and
TCP flows, and among heterogeneous TCP flows, while maintaining a stable queue.

13 An sychronous Mltithread Algorithm for the Maximum Network flow problem with Non blocking Global Relabating Heurisatic

In this paper, we present a novel asynchronous multithreaded algorithm for the maximum network flow problem. The
algorithm is based on the classical push-relabel algorithm, which is essentially sequential and requires intensive and
costly lock usages to parallelize it. The novelty of the algorithm is in the removal of lock and barrier usages, thereby
enabling a much more efficient multithreaded implementation. The newly designed push and relabel operations are
executed completely asynchronously and each individual process/thread independently decides when to terminate
itself. We further propose an asynchronous global relabeling heuristic to speed up the algorithm. We prove that our
algorithm finds a maximum flow with OðjV j2kEjÞ operations, where jV j is the number of vertices and jEj is the number
of edges in the graph. We also prove the correctness of the relabeling heuristic. Extensive experiments show that our
algorithm exhibits better scalability and faster execution speed than the lock-based parallel push-relabel algorithm.

14 Assessing Accelerator-Based HPC Reverse Time Migration

Oil and gas companies trust Reverse Time Migration (RTM), the most advanced seismic imaging technique, with
crucialdecisions on drilling investments. The economic value of the oil reserves that require RTM to be localized is in
the order of 1013 dollars. But RTM requires vast computational power, which somewhat hindered its practical success.
Although, accelerator-based architectures deliver enormous computational power, little attention has been devoted to
assess the RTM implementations effort. The aim of this paper is to identify the major limitations imposed by different
accelerators during RTM implementations, and potential bottlenecks regarding architecture features. Moreover, we
suggest a wish list, that from our experience, should be included as features in the next generation of accelerators, to
cope with the requirements of applications like RTM. We present an RTM algorithm mapping to the IBM Cell/B.E.,
NVIDIA Tesla and an FPGA platform modeled after the Convey HC-1. All three implementations outperform a traditional
processor (Intel Harpertown) in terms of performance (10x), but at the cost of huge development effort, mainly due to
immature development frameworks and lack of well-suited programming models. These results show that accelerators
are well positioned platforms for this kind of workload. Due to the fact that our RTM implementation is based on an
explicit high order finite difference scheme, some of the conclusions of this work can be extrapolated to applications
with similar numerical scheme, for instance, magneto-hydrodynamics or atmospheric flow simulations.


5



15 Association Control for Vehicular WiFi Access: Pursuing Efficiency and Fairness

Deploying road-side WiFi access points has made possible internet access in a vehicle, nevertheless it is challenging
to maintain client performance at vehicular speed especially when multiple mobile users exist. This paper considers
the association control problem for vehicular WiFi access in the Drive-thru Internet scenario. In particular, we aim to
improve the efficiency and fairness for all users. We design efficient algorithms to achieve these objectives through
several techniques including approximation. Our simulation results demonstrate that our algorithms can achieve
significantly better performance than conventional approaches.

16 Attribute-Based Access Control with Efficient Revocation in Data Outsourcing Systems

Some of the most challenging issues in data outsourcing scenario are the enforcement of authorization policies and
the support of policy updates. Cipher text-policy attribute-based encryption is a promising cryptographic solution to
these issues for enforcing access control policies defined by a data owner on outsourced data. However, the problem
of applying the attribute-based encryption in an outsourced architecture introduces several challenges with regard to
the attribute and user revocation. In this paper, we propose an access control mechanism using cipher text-policy
attribute-based encryption to enforce access control policies with efficient attribute and user revocation capability. The
fine-grained access control can be achieved by dual encryption mechanism which takes advantage of the attribute-
based encryption and selective group key distribution in each attribute group. We demonstrate how to apply the
proposed mechanism to securely manage the outsourced data. The analysis results indicate that the proposed scheme
is efficient and secure in the data outsourcing systems.

17 Automatic Generation of Multi core Chemical Kernels

This work presents the Kinetics Pre Processor: Accelerated (KPPA), a general analysis and code generation tool that
achieves significantly reduced time-to-solution for chemical kinetics kernels on three multi core platforms: NVIDIA
GPUs using CUDA, the Cell Broadband Engine, and Intel Quad-Core Xeon CPUs. A comparative performance analysis
of chemical kernels from WRF Chem and the Community Multi scale Air Quality Model (CMAQ) is presented for each
platform in double and single precision on coarse and fine grids. We introduce the multi core architecture
parameterization that KPPA uses to generate a chemical kernel for these platforms and describe a code generation
system that produces highly tuned platform-specific code. Compared to state-of-the-art serial implementations,
speedups exceeding 25x are regularly observed, with a maximum observed speedup of 41:1x in single precision.


6



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

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 mixed voice and data, to the best of our knowledge, limited CAC models for mobile networks
that have been proposed in the literature are represented with a unidimensional Markov chain, where the
communication system was mainly based upon voice calls in order to reduce the state space of the Markov chain.
Another drawback of those studies is the lack of a clear synchronization between mobile nodes and the servers. In this
paper, we propose an efficient CAC scheme for mobile networks that takes into account voice connections as well as
synchronous and asynchronous data connections. Furthermore, we use SWNs to model the system interaction, which
consists of several mobile nodes, gateways, cells, and servers. We describe our scheme and present its analytical
performance results using the WNSIM symbolic simulator of GreatSPN tool.

19 Chunk Distribution in Mesh-Based Large-Scale P2P Streaming Systems: A Fluid Approach

We consider large-scale mesh-based P2P systems for the distribution of real-time video content. Our goal is to study
the impact that different design choices adopted while building the overlay topology may have on the system
performance. In particular, we show that the adoption of different strategies leads to overlay topologies with different
macroscopic properties. Representing the possible overlay topologies with different families of random graphs, we
develop simple, yet accurate, fluid models that capture the dominant dynamics of the chunk distribution process over
several families of random graphs. Our fluid models allow us to compare the performance of different strategies
providing a guidance for the design of new and more efficient systems. In particular, we show that system performance
can be significantly improved when possibly available information about peers location and/or peer access bandwidth
is carefully exploited in the overlay topology formation process.

20 A Dual Churn-Resilient Protocol for Massive Data Dissemination in P2P Networks

A variety Massive data dissemination is often disrupted by frequent join and departure or failure of client
nodes in a peer-to-peer (P2P) network. We propose a new churn-resilient protocol (CRP) to assure alternating
path and data proximity to accelerate the data dissemination process under network churn. The CRP enables
the construction of proximity-aware P2P content delivery systems. We present new data dissemination
algorithms using this proximity-aware overlay design. We simulated P2P networks up to 20,000 nodes to
validate the claimed advantages. Specifically, we make four technical contributions: 1). The CRP scheme
promotes proximity awareness, dynamic load balancing, and resilience to node failures and network
anomalies. 2). The proximity-aware overlay network has a 28-50 percent speed gain in massive data
dissemination, compared with the use of scope-flooding or epidemic tree schemes in unstructured P2P
networks. 3). The CRP-enabled network requires only 1/3 of the control messages used in a large CAM-Chord
network. 4) Even with 40 percent of node failures, the CRP network guarantees atomic broadcast of all data


7



items. These results clearly demonstrate the scalability and robustness of CRP networks under churn
conditions. The scheme appeals especially to webscale applications in digital content delivery, network worm
containment, and consumer relationship management over hundreds of datacenters in cloud computing
services.

21 A Multidimensional Critical State Analysis for Detecting Intrusions in SCADA Systems

A relatively A relatively new trend in Critical Infrastructures (e.g., power plants, nuclear plants, energy grids,
etc.) is the massive migration from the classic model of isolated systems, to a system-of-systems model,
where these infrastructures are intensifying their interconnections through Information and Communications
Technology (ICT) means. The ICT core of these industrial installations is known as Supervisory Control And
Data Acquisition Systems (SCADA). Traditional ICT security countermeasures (e.g., classic firewalls, anti-
viruses and IDSs) fail in providing a complete protection to these systems since their needs are different from
those of traditional ICT. This paper presents an innovative approach to Intrusion Detection in SCADA systems
based on the concept of Critical State Analysis and State Proximity. The theoretical framework is supported
by tests conducted with an Intrusion Detection System prototype implementing the proposed detection
approach.

22 Collective Receiver-Initiated Multicast for Grid Applications

Demand Grid applications often need to distribute large amounts of data efficiently from one cluster to
multiple others (multicast). Existing sender-initiated methods arrange nodes in optimized tree structures,
based on external network monitoring data. This dependence on monitoring data severely impacts both ease
of deployment and adaptivity to dynamically changing network conditions. In this paper, we present Robber, a
collective, receiver-initiated, high-throughput multicast approach inspired by the BitTorrent protocol. Unlike
BitTorrent, Robber is specifically designed to maximize the throughput between multiple cluster computers.
Nodes in the same cluster work together as a collective that tries to steal data from peer clusters. Instead of
using potentially outdated monitoring data, Robber automatically adapts to the currently achievable
bandwidth ratios. Within a collective, nodes automatically tune the amount of data they steal remotely to their
relative performance. Our experimental evaluation compares Robber to BitTorrent, to Balanced Multicasting,
and to its predecessor MOB. Balanced Multicasting optimizes multicast trees based on external monitoring
data, while MOB uses collective, receiver-initiated multicast with static load balancing. We show that both
Robber and MOB outperform BitTorrent. They are competitive with Balanced Multicasting as long as the
network bandwidth remains stable, and outperform it by wide margins when bandwidth changes dynamically.
In large environments and heterogeneous clusters, Robber outperforms MOB. response has become a key
feature of the future smart grid. In addition to having advanced communication and computing
infrastructures, a successful demand response program must respond to the needs of a power system. In
other words, the efficiency and security of a power system dictate the locations, amounts and speeds of the
load reductions of a demand response program. In this paper, we propose an event-driven emergency
demand response scheme to prevent a power system from experiencing voltage collapse. A technique to
design such a scheme is presented. This technique is able to provide key setting parameters such as the
amount of demand reductions at various locations to arm the demand response infrastructure. The validity of
the proposed technique has been verified by using several test power systems.


8



04 Data Replication in Data Intensive Scientific Applications with Performance Guarantee

Data replication has been well adopted in data intensive scientific applications to reduce data file transfer
time and bandwidth consumption. However, the problem of data replication in Data Grids, an enabling
technology for data intensive applications, has proven to be NP-hard and even non approximable, making this
problem difficult to solve. Meanwhile, most of the previous research in this field is either theoretical
investigation without practical consideration, or heuristics-based with little or no theoretical performance
guarantee. In this paper, we propose a data replication algorithm that not only has a provable theoretical
performance guarantee, but also can be implemented in a distributed and practical manner. Specifically, we
design a polynomial time centralized replication algorithm that reduces the total data file access delay by at
least half of that reduced by the optimal replication solution. Based on this centralized algorithm, we also
design a distributed caching algorithm, which can be easily adopted in a distributed environment such as
Data Grids. Extensive simulations are performed to validate the efficiency of our proposed algorithms. Using
our own simulator, we show that our centralized replication algorithm performs comparably to the optimal
algorithm and other intuitive heuristics under different network parameters. Using GridSim, a popular
distributed Grid simulator, we demonstrate that the distributed caching technique significantly outperforms
an existing popular file caching technique in Data Grids, and it is more scalable and adaptive to the dynamic
change of file access patterns in Data Grids.

05 Dynamic Monitoring and Decision Systems for Enabling Sustainable Energy Services

This paper concerns the role of smart grids comprising man-made electric power networks and their
supporting information communications technology (ICT) as enablers of sustainable energy services. A
proposed socio-ecological energy system (SEES) framework used to characterize the corelevel subsystems
(resources, users, and governance) in terms of second-level and deeper level variables is motivated by the
more general multilevel nested socio-ecological system (SES) framework. Second-level and deeper level
variables are introduced as a means of characterizing how sustainable a SEES is likely to be by assessing their
characteristics. Given vast spatial and temporal complexities in a typical SEES, it becomes necessary to
enhance the physical power network with just-in-time (JIT), just-in-place (JIP), and just-in-context (JIC)
functionalities. These, in turn, support sustainable energy services by aligning temporal, spatial, and
contextual characteristics of resources and users. We refer to the ICT implementation in support of these
functionalities as dynamic monitoring and decision systems (DYMONDS). The tradeoffs between the ability of
the SEES to ensure sustainable services and the complexity of the supporting smart grid are discussed for
several representative energy system architectures.

06 Fault-Tolerant and Scalable Key Management for Smart Grid

In this paper, we study the problem of secure keymanagement for smart grid. Since existing key management
schemes are not suitable for deployment in smart grid, in this paper, we propose a novel key management
scheme which combines symmetric key technique and elliptic curve public key technique. The symmetric key


9



scheme is based on the Needham-Schroeder authentication protocol. We show that the known threats
including the man-in-the-middle attack and the replay attack can be effectively eliminated under the proposed
scheme. The advantages of the new key management scheme include strong security, scalability, fault-
tolerance, accessibility, and efficiency.

07 Feasibility Analysis of the Positioning of Superconducting Fault Current Limiters for the Smart Grid Application
Using Simulink and SimPowerSystem

One of the most important topics regarding the application of superconducting fault current limiters (SFCL) for
upcoming smart grid is related to its possible effect on the reduction of abnormal fault current and the suitable
location in the micro grids. Due to the grid connection of the micro grids with the current power grids,
excessive fault current is a serious problem to be solved for successful implementation of micro grids.
However, a shortage of research concerning the location of SFCL in micro grid is felt. In this work, a resistive
type SFCL model was implemented by integrating Simulink and SimPowerSystem blocks in Matlab. The
designed SFCL model could be easily utilized for determining an impedance level of SFCL according to the
fault-current-limitation requirements of various kinds of the smart grid system. In addition, typical smart grid
model including generation, transmission and distribution network with dispersed energy resource was
modeled to determine the location and the performance of the SFCL. As for a dispersed energy resource, 10
MVA wind farm was considered for the simulation. Three phase faults have been simulated at different
locations in smart grid and the effect of the SFCL and its location on the wind farm fault current was evaluated.
Consequently, the optimum arrangement of the SFCL location in Smart Grid with renewable resources has
been proposed and its remarkable performance has been suggested.

08 Grid Service Reliability Modeling and Optimal Task Scheduling Considering Fault Recovery

There has been quite some research on the development of tools and techniques for grid systems, yet some
important issues, e.g., grid service reliability and task scheduling in the grid, have not been sufficiently
studied. For some grid services which have large subtasks requiring time-consuming computation, the
reliability of grid service could be rather low. To resolve this problem, this paper introduces Local Node Fault
Recovery (LNFR) mechanism into grid systems, and presents an in-depth study on grid service reliability
modeling and analysis with this kind of fault recovery. To make LNFR mechanism practical, some constraints,
i.e. the life times of subtasks, and the numbers of recoveries performed in grid nodes, are introduced; and grid
service reliability models under these practical constraints are developed. Based on the proposed grid service
reliability model, a multi-objective task scheduling optimization model is presented, and an ant colony
optimization (ACO) algorithm is developed to solve it effectively. A numerical example is given to illustrate the
influence of fault recovery on grid service reliability, and show a high efficiency of ACO in solving the grid task
scheduling problem.

09 GRISSOM Platform: Enabling Distributed Processing and Management of Biological Data Through Fusion of Grid and Web

Technologies


10



Transcriptomic technologies have a critical impact in the revolutionary changes that reshape biological
research. Through the recruitment of novel high-throughput instrumentation and advanced computational
methodologies, an unprecedented wealth of quantitative data is produced. Microarray experiments are
considered high-throughput, both in terms of data volumes (data intensive) and processing complexity
(computationally intensive). In this paper, we present grids for in silico systems biology and medicine
(GRISSOM), a web-based application that exploits GRID infrastructures for distributed data processing and
management, of DNA microarrays (cDNA, Affymetrix, Illumina) through a generic, consistent, computational
analysis framework. GRISSOM performs versatile annotation and integrative analysis tasks, through the use of
third-party application programming interfaces, delivered as web services. In parallel, by conforming to
service-oriented architectures, it can be encapsulated in other biomedical processing workflows, with the help
of workflow enacting software, like Taverna Workbench, thus rendering access to its algorithms, transparent
and generic. GRISSOM aims to set a generic paradigm of efficient metamining that promotes translational
research in biomedicine, through the fusion of grid and semantic web computing technologies.

10 Local Restoration With Multiple Spanning Trees in Metro Ethernet Networks

Ethernet is becoming a preferred technology to be extended to metropolitan area networks (MANs) due to its
low cost, simplicity, and ubiquity. However, current Ethernet lacks a fast failure recovery mechanism as it
reconstructs the spanning tree after the failure is detected, which commonly requires tens of seconds. Some
fast failure-handling methods based on multiple spanning trees have been proposed in the literature, but these
approaches are either centralized or require periodic message broadcasting over the entire network. In this
paper, we propose a local restoration mechanism for metro Ethernet using multiple spanning trees, which is
distributed and fast and does not need failure notification. Upon failure of a single link, the upstream switch
locally restores traffic to preconfigured backup spanning trees. We propose two restoration approaches,
connection-based and destination-based, to select backup trees. We formulate the tree preconfiguration
problem that includes working spanning tree assignment and backup spanning tree configuration. We prove
that the preconfiguration problem is NP-complete and develop an integer linear programming model. We also
develop heuristic algorithms for each restoration approach to reduce the computation complexity. To evaluate
the effectiveness of our heuristic algorithms, we carry out the simulation on grid and random networks. The
simulation results show that our heuristic algorithms have comparable performance close to the optimal
solutions, and both restoration approaches can efficiently utilize the network bandwidth to handle single link
failures.

11 Modeling Load Redistribution Attacks in Power Systems

State estimation is a key element in today’s power systems for reliable system operation and control. State
estimation collects information from a large number of meter measurements and analyzes it in a centralized
manner at the control center. Existing state estimation approaches were traditionally assumed to be able to
tolerate and detect random bad measurements. They were, however, recently shown to be vulnerable to
intentional false data injection attacks. This paper fully develops the concept of load redistribution (LR)
attacks, a special type of false data injection attacks, and analyzes their damage to power system operation in
different time steps with different attacking resource limitations. Based on damaging effect analysis, we
differentiate two attacking goals from the adversary’s perspective, i.e., immediate attacking goal and delayed
attacking goal. For the immediate attacking goal, this paper identifies the most damaging LR attack through a
max-min attacker-defender model. Then, the criterion of determining effective protection strategies is
explained. The effectiveness of the proposed model is tested on a 14-bus system. To the author’s best


11



knowledge, this is the first work of its kind, which quantitatively analyzes the damage of the false data injection
attacks to power system operation and security. Our analysis hence provides an in-depth insight on effective
attack prevention with limited protection resource budget.

12 Multicloud Deployment of Computing Clusters for Loosely Coupled MTC Applications

Cloud computing is gaining acceptance in many IT organizations, as an elastic, flexible, and variable-cost way
to deploy their service platforms using outsourced resources. Unlike traditional utilities where a single
provider scheme is a common practice, the ubiquitous access to cloud resources easily enables the
simultaneous use of different clouds. In this paper, we explore this scenario to deploy a computing cluster on
the top of a multicloud infrastructure, for solving loosely coupled Many-Task Computing (MTC) applications. In
this way, the cluster nodes can be provisioned with resources from different clouds to improve the cost
effectiveness of the deployment, or to implement high-availability strategies. We prove the viability of this kind
of solutions by evaluating the scalability, performance, and cost of different configurations of a Sun Grid
Engine cluster, deployed on a multicloud infrastructure spanning a local data center and three different cloud
sites: Amazon EC2 Europe, Amazon EC2 US, and ElasticHosts. Although the testbed deployed in this work is
limited to a reduced number of computing resources (due to hardware and budget limitations), we have
complemented our analysis with a simulated infrastructure model, which includes a larger number of
resources, and runs larger problem sizes. Data obtained by simulation show that performance and cost results
can be extrapolated to large-scale problems and cluster infrastructures.


12




13

IEEE Final Year Projects 2011-2012 :: Elysium Technologies Pvt Ltd::Paralleldistributed

More Related Content

What's hot

Similar to IEEE Final Year Projects 2011-2012 :: Elysium Technologies Pvt Ltd::Paralleldistributed

More from sunda2011

Recently uploaded

IEEE Final Year Projects 2011-2012 :: Elysium Technologies Pvt Ltd::Paralleldistributed