Abstract: Mobile Adhoc Networks (MANETs) are
infrastructure-less, dynamic network of collections of wireless mobile
nodes communicating with each other without any centralized
authority. A MANET is a mobile device of interconnections through
wireless links, forming a dynamic topology. Routing protocols have a
big role in data transmission across a network. Routing protocols,
two major classifications are unipath and multipath. This study
evaluates performance of an on-demand multipath routing protocol
named Adhoc On-demand Multipath Distance Vector routing
(AOMDV). This study proposes Energy Aware AOMDV (EAAOMDV)
an extension of AOMDV which decreases energy
consumed on a route.
Abstract: Based on application requirements, nodes are static or
mobile in Wireless Sensor Networks (WSNs). Mobility poses
challenges in protocol design, especially at the link layer requiring
mobility adaptation algorithms to localize mobile nodes and predict
link quality to be established with them. This study implements
XMAC and Berkeley Media Access Control (BMAC) routing
protocols to evaluate performance under WSN’s static and mobility
conditions. This paper gives a comparative study of mobility-aware
MAC protocols. Routing protocol performance, based on Average
End to End Delay, Average Packet Delivery Ratio, Average Number
of hops, and Jitter is evaluated.
Abstract: To tackle the air pollution issues, Plug-in Hybrid
Electric Vehicles (PHEVs) are proposed as an appropriate solution.
Charging a large amount of PHEV batteries, if not controlled, would
have negative impacts on the distribution system. The control process
of charging of these vehicles can be centralized in parking lots that
may provide a chance for better coordination than the individual
charging in houses. In this paper, an optimization-based approach is
proposed to determine the optimum PHEV parking capacities in
candidate nodes of the distribution system. In so doing, a profile for
charging and discharging of PHEVs is developed in order to flatten
the network load profile. Then, this profile is used in solving an
optimization problem to minimize the distribution system losses. The
outputs of the proposed method are the proper place for PHEV
parking lots and optimum capacity for each parking. The application
of the proposed method on the IEEE-34 node test feeder verifies the
effectiveness of the method.
Abstract: In this paper, we consider a cognitive relay network
(CRN) in which the primary receiver (PR) is protected by peak
transmit power ¯PST and/or peak interference power Q constraints.
In addition, the interference effect from the primary transmitter (PT)
is considered to show its impact on the performance of the CRN. We
investigate the outage probability (OP) and outage capacity (OC) of
the CRN by deriving closed-form expressions over Rayleigh fading
channel. Results show that both the OP and OC improve by increasing
the cooperative relay nodes as well as when the PT is far away from
the SR.
Abstract: Transparent nickel doped cobalt sulfide was fabricated
on a SnO2:F electrode and tested as an efficient electrocatalyst and as
an alternative to the expensive platinum counter electrode. In order to
investigate how this electrode could affect the electrical
characteristics of a dye-sensitized solar cell, we manufactured cells
with the same TiO2 photoanode sensitized with dye (N719) and
employing the same quasi-solid electrolyte, altering only the counter
electrode used. The cells were electrically and electrochemically
characterized and it was observed that the ones with the Ni doped
CoS2 outperformed the efficiency of the cells with the Pt counter
electrode (3.76% and 3.44% respectively). Particularly, the higher
efficiency of the cells with the Ni doped CoS2 counter electrode (CE)
is mainly because of the enhanced photocurrent density which is
attributed to the enhanced electrocatalytic ability of the CE and the
low charge transfer resistance at the CE/electrolyte interface.
Abstract: Durability of Membrane Electrode Assembly for
Proton Exchange Membrane Fuel Cells was evaluated in both steady
state and accelerated decay modes. Steady state mode was carried out
at constant current of 800mA/cm2 for 2500 hours using air as cathode
feed and pure hydrogen as anode feed. The degradation of the cell
voltage was 0.015V after such 2500 hrs operation. The degradation
rate was therefore calculated to be 6uV/hr. Continuously Vigorous
fluctuation of the cell voltage, which was switched between OCV and
0.2V, was employed for the accelerated decay mode. No obvious
change in performance of the MEA was observed after 10000 cycles
of such operation.
Abstract: This paper proposes a novel heuristic algorithm that aims to determine the best size and location of distributed generators in unbalanced distribution networks. The proposed heuristic algorithm can deal with the planning cases where power loss is to be optimized without violating the system practical constraints. The distributed generation units in the proposed algorithm is modeled as voltage controlled node with the flexibility to be converted to constant power factor node in case of reactive power limit violation. The proposed algorithm is implemented in MATLAB and tested on the IEEE 37 -node feeder. The results obtained show the effectiveness of the proposed algorithm.
Abstract: Designing cost-efficient, secure network protocols for
Wireless Sensor Networks (WSNs) is a challenging problem because
sensors are resource-limited wireless devices. Security services such
as authentication and improved pairwise key establishment are
critical to high efficient networks with sensor nodes. For sensor
nodes to correspond securely with each other efficiently, usage of
cryptographic techniques is necessary. In this paper, two key
predistribution schemes that enable a mobile sink to establish a
secure data-communication link, on the fly, with any sensor nodes.
The intermediate nodes along the path to the sink are able to verify
the authenticity and integrity of the incoming packets using a
predicted value of the key generated by the sender’s essential power.
The proposed schemes are based on the pairwise key with the mobile
sink, our analytical results clearly show that our schemes perform
better in terms of network resilience to node capture than existing
schemes if used in wireless sensor networks with mobile sinks.
Abstract: A sensory network consists of multiple detection
locations called sensor nodes, each of which is tiny, featherweight
and portable. A single path routing protocols in wireless sensor
network can lead to holes in the network, since only the nodes
present in the single path is used for the data transmission. Apart
from the advantages like reduced computation, complexity and
resource utilization, there are some drawbacks like throughput,
increased traffic load and delay in data delivery. Therefore, multipath
routing protocols are preferred for WSN. Distributing the traffic
among multiple paths increases the network lifetime. We propose a
scheme, for the data to be transmitted through a dominant path to
save energy. In order to obtain a high delivery ratio, a basic route
reconstruction protocol is utilized to reconstruct the path whenever a
failure is detected. A basic reconstruction routing (BRR) algorithm is
proposed, in which a node can leap over path failure by using the
already existing routing information from its neighbourhood while
the composed data is transmitted from the source to the sink. In order
to save the energy and attain high data delivery ratio, data is
transmitted along a multiple path, which is achieved by BRR
algorithm whenever a failure is detected. Further, the analysis of
how the proposed protocol overcomes the drawback of the existing
protocols is presented. The performance of our protocol is compared
to AOMDV and energy efficient node-disjoint multipath routing
protocol (EENDMRP). The system is implemented using NS-2.34.
The simulation results show that the proposed protocol has high
delivery ratio with low energy consumption.
Abstract: The main function of Medium Access Control (MAC) is to share the channel efficiently between all nodes. In the real-time scenario, there will be certain amount of wastage in bandwidth due to back-off periods. More bandwidth will be wasted in idle state if the back-off period is very high and collision may occur if the back-off period is small. So, an optimization is needed for this problem. The main objective of the work is to reduce delay due to back-off period thereby reducing collision and increasing throughput. Here a method, called the virtual back-off algorithm (VBA) is used to optimize the back-off period and thereby it increases throughput and reduces collisions. The main idea is to optimize the number of transmission for every node. A counter is introduced at each node to implement this idea. Here counter value represents the sequence number. VBA is classified into two types VBA with counter sharing (VBA-CS) and VBA with no counter sharing (VBA-NCS). These two classifications of VBA are compared for various parameters. Simulation is done in NS-2 environment. The results obtained are found to be promising.
Abstract: The novel 3D SnO cabbages self-assembled by
nanosheets were successfully synthesized via template-free
hydrothermal growth method under facile conditions. The XRD
results manifest that the as-prepared SnO is tetragonal phase. The
TEM and HRTEM results show that the cabbage nanosheets are
polycrystalline structure consisted of considerable single-crystalline
nanoparticles. Two typical Raman modes A1g=210 and Eg=112 cm-1
of SnO are observed by Raman spectroscopy. Moreover, galvanostatic
cycling tests has been performed using the SnO cabbages as anode
material of lithium ion battery and the electrochemical results suggest
that the synthesized SnO cabbage structures are a promising anode
material for lithium ion batteries.
Abstract: The Trustworthy link failure recovery algorithm is
introduced in this paper, to provide the forwarding continuity even
with compound link failures. The ephemeral failures are common in
IP networks and it also has some proposals based on local rerouting.
To ensure forwarding continuity, we are introducing the compound
link failure recovery algorithm, even with compound link failures.
For forwarding the information, each packet carries a blacklist, which
is a min set of failed links encountered along its path, and the next
hop is chosen by excluding the blacklisted links. Our proposed
method describes how it can be applied to ensure forwarding to all
reachable destinations in case of any two or more link or node
failures in the network. After simulating with NS2 contains lot of
samples proved that the proposed protocol achieves exceptional
concert even under elevated node mobility using Trustworthy link
Failure Recovery Algorithm.
Abstract: This paper presents a novel algorithm for secure,
reliable and flexible transmission of big data in two hop wireless
networks using cooperative jamming scheme. Two hop wireless
networks consist of source, relay and destination nodes. Big data has
to transmit from source to relay and from relay to destination by
deploying security in physical layer. Cooperative jamming scheme
determines transmission of big data in more secure manner by
protecting it from eavesdroppers and malicious nodes of unknown
location. The novel algorithm that ensures secure and energy balance
transmission of big data, includes selection of data transmitting
region, segmenting the selected region, determining probability ratio
for each node (capture node, non-capture and eavesdropper node) in
every segment, evaluating the probability using binary based
evaluation. If it is secure transmission resume with the two- hop
transmission of big data, otherwise prevent the attackers by
cooperative jamming scheme and transmit the data in two-hop
transmission.
Abstract: This research paper presents highly optimized barrel
shifter at 22nm Hi K metal gate strained Si technology node. This
barrel shifter is having a unique combination of static and dynamic
body bias which gives lowest power delay product. This power delay
product is compared with the same circuit at same technology node
with static forward biasing at ‘supply/2’ and also with normal reverse
substrate biasing and still found to be the lowest. The power delay
product of this barrel sifter is .39362X10-17J and is lowered by
approximately 78% to reference proposed barrel shifter at 32nm bulk
CMOS technology. Power delay product of barrel shifter at 22nm Hi
K Metal gate technology with normal reverse substrate bias is
2.97186933X10-17J and can be compared with this design’s PDP of
.39362X10-17J. This design uses both static and dynamic substrate
biasing and also has approximately 96% lower power delay product
compared to only forward body biased at half of supply voltage. The
NMOS model used are predictive technology models of Arizona state
university and the simulations to be carried out using HSPICE
simulator.
Abstract: The iron environment in Fe-doped Vycor Anode was
investigated with EXAFS using Brookhaven Synchrotron Light
Source. The iron-reducing Shewanella oneidensis culture was grown
in a microbial fuel cell under anaerobic respiration. The Fe bond
length was found to decrease and correlate with the amount of
biofilm growth on the Fe-doped Vycor Anode. The data suggests that
Fe-doped Vycor Anode would be a good substrate to study the
Shewanella oneidensis nanowire structure using EXAFS.
Abstract: In this paper we propose a novel methodology for
extracting a road network and its nodes from satellite images of
Algeria country.
This developed technique is a progress of our previous research
works. It is founded on the information theory and the mathematical
morphology; the information theory and the mathematical
morphology are combined together to extract and link the road
segments to form a road network and its nodes.
We therefore have to define objects as sets of pixels and to study
the shape of these objects and the relations that exist between them.
In this approach, geometric and radiometric features of roads are
integrated by a cost function and a set of selected points of a crossing
road. Its performances were tested on satellite images of Algeria
country.
Abstract: Cloud computing is the innovative and leading
information technology model for enabling convenient, on-demand
network access to a shared pool of configurable computing resources
that can be rapidly provisioned and released with minimal
management effort. In this paper, we aim at the development of
workflow management system for cloud computing platforms based
on our previous research on the dynamic allocation of the cloud
computing resources and its workflow process. We took advantage of
the HTML5 technology and developed web-based workflow interface.
In order to enable the combination of many tasks running on the cloud
platform in sequence, we designed a mechanism and developed an
execution engine for workflow management on clouds. We also
established a prediction model which was integrated with job queuing
system to estimate the waiting time and cost of the individual tasks on
different computing nodes, therefore helping users achieve maximum
performance at lowest payment. This proposed effort has the potential
to positively provide an efficient, resilience and elastic environment
for cloud computing platform. This development also helps boost user
productivity by promoting a flexible workflow interface that lets users
design and control their tasks' flow from anywhere.
Abstract: This paper presents an optimal broadcast algorithm
for the hypercube networks. The main focus of the paper is the
effectiveness of the algorithm in the presence of many node faults.
For the optimal solution, our algorithm builds with spanning tree
connecting the all nodes of the networks, through which messages
are propagated from source node to remaining nodes. At any given
time, maximum n − 1 nodes may fail due to crashing. We show
that the hypercube networks are strongly fault-tolerant. Simulation
results analyze to accomplish algorithm characteristics under many
node faults. We have compared our simulation results between our
proposed method and the Fu’s method. Fu’s approach cannot tolerate
n − 1 faulty nodes in the worst case, but our approach can tolerate
n − 1 faulty nodes.
Abstract: Grid is an environment with millions of resources
which are dynamic and heterogeneous in nature. A computational
grid is one in which the resources are computing nodes and is meant
for applications that involves larger computations. A scheduling
algorithm is said to be efficient if and only if it performs better
resource allocation even in case of resource failure. Resource
allocation is a tedious issue since it has to consider several
requirements such as system load, processing cost and time, user’s
deadline and resource failure. This work attempts in designing a
resource allocation algorithm which is cost-effective and also targets
at load balancing, fault tolerance and user satisfaction by considering
the above requirements. The proposed Budget Constrained Load
Balancing Fault Tolerant algorithm with user satisfaction (BLBFT)
reduces the schedule makespan, schedule cost and task failure rate
and improves resource utilization. Evaluation of the proposed
BLBFT algorithm is done using Gridsim toolkit and the results are
compared with the algorithms which separately concentrates on all
these factors. The comparison results ensure that the proposed
algorithm works better than its counterparts.
Abstract: Association rule mining is one of the most important fields of data mining and knowledge discovery. In this paper, we propose an efficient multiple support frequent pattern growth algorithm which we called “MSFP-growth” that enhancing the FPgrowth algorithm by making infrequent child node pruning step with multiple minimum support using maximum constrains. The algorithm is implemented, and it is compared with other common algorithms: Apriori-multiple minimum supports using maximum constraints and FP-growth. The experimental results show that the rule mining from the proposed algorithm are interesting and our algorithm achieved better performance than other algorithms without scarifying the accuracy.