Abstract: Wireless Sensor Networks (WSNs) enable new
applications and need non-conventional paradigms for the protocol
because of energy and bandwidth constraints, In WSN, sensor node’s
life is a critical parameter. Research on life extension is based on
Low-Energy Adaptive Clustering Hierarchy (LEACH) scheme,
which rotates Cluster Head (CH) among sensor nodes to distribute
energy consumption over all network nodes. CH selection in WSN
affects network energy efficiency greatly. This study proposes an
improved CH selection for efficient data aggregation in sensor
networks. This new algorithm is based on Bacterial Foraging
Optimization (BFO) incorporated in LEACH.
Abstract: Feature selection has been used in many fields such as
classification, data mining and object recognition and proven to be
effective for removing irrelevant and redundant features from the
original dataset. In this paper, a new design of distributed intrusion
detection system using a combination feature selection model based
on bees and decision tree. Bees algorithm is used as the search
strategy to find the optimal subset of features, whereas decision tree
is used as a judgment for the selected features. Both the produced
features and the generated rules are used by Decision Making Mobile
Agent to decide whether there is an attack or not in the networks.
Decision Making Mobile Agent will migrate through the networks,
moving from node to another, if it found that there is an attack on one
of the nodes, it then alerts the user through User Interface Agent or
takes some action through Action Mobile Agent. The KDD Cup 99
dataset is used to test the effectiveness of the proposed system. The
results show that even if only four features are used, the proposed
system gives a better performance when it is compared with the
obtained results using all 41 features.
Abstract: Geographical routing protocol requires node physical
location information to make forwarding decision. Geographical
routing uses location service or position service to obtain the position
of a node. The geographical information is a geographic coordinates
or can be obtained through reference points on some fixed coordinate
system. Link can be formed between two nodes. Link lifetime plays a
crucial role in MANET. Link lifetime represent how long the link is
stable without any failure between the nodes. Link failure may occur
due to mobility and because of link failure energy of nodes can be
drained. Thus this paper proposes survey about link lifetime
prediction using geographical information.
Abstract: Mobile Ad hoc Network is a set of self-governing
nodes which communicate through wireless links. Dynamic topology
MANETs makes routing a challenging task. Various routing
protocols are there, but due to various fundamental characteristic
open medium, changing topology, distributed collaboration and
constrained capability, these protocols are tend to various types of
security attacks. Black hole is one among them. In this attack,
malicious node represents itself as having the shortest path to the
destination but that path not even exists. In this paper, we aim to
develop a routing protocol for detection and prevention of black hole
attack by modifying AODV routing protocol. This protocol is able to
detect and prevent the black hole attack. Simulation is done using
NS-2, which shows the improvement in network performance.
Abstract: File sharing in networks is generally achieved using
Peer-to-Peer (P2P) applications. Structured P2P approaches are
widely used in adhoc networks due to its distributed and scalability
features. Efficient mechanisms are required to handle the huge
amount of data distributed to all peers. The intrinsic characteristics of
P2P system makes for easier content distribution when compared to
client-server architecture. All the nodes in a P2P network act as both
client and server, thus, distributing data takes lesser time when
compared to the client-server method. CHORD protocol is a resource
routing based where nodes and data items are structured into a 1-
dimensional ring. The structured lookup algorithm of Chord is
advantageous for distributed P2P networking applications. However,
structured approach improves lookup performance in a high
bandwidth wired network it could contribute to unnecessary overhead
in overlay networks leading to degradation of network performance.
In this paper, the performance of existing CHORD protocol on
Wireless Mesh Network (WMN) when nodes are static and dynamic
is investigated.
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: 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: 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: 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: A model was constructed to predict the amount of
solar radiation that will make contact with the surface of the earth in
a given location an hour into the future. This project was supported
by the Southern Company to determine at what specific times during
a given day of the year solar panels could be relied upon to produce
energy in sufficient quantities. Due to their ability as universal
function approximators, an artificial neural network was used to
estimate the nonlinear pattern of solar radiation, which utilized
measurements of weather conditions collected at the Griffin, Georgia
weather station as inputs. A number of network configurations and
training strategies were utilized, though a multilayer perceptron with
a variety of hidden nodes trained with the resilient propagation
algorithm consistently yielded the most accurate predictions. In
addition, a modeled direct normal irradiance field and adjacent
weather station data were used to bolster prediction accuracy. In later
trials, the solar radiation field was preprocessed with a discrete
wavelet transform with the aim of removing noise from the
measurements. The current model provides predictions of solar
radiation with a mean square error of 0.0042, though ongoing efforts
are being made to further improve the model’s accuracy.
Abstract: Wireless Sensor Networks (WSNs) have wide variety
of applications and provide limitless future potentials. Nodes in
WSNs are prone to failure due to energy depletion, hardware failure,
communication link errors, malicious attacks, and so on. Therefore,
fault tolerance is one of the critical issues in WSNs. We study how
fault tolerance is addressed in different applications of WSNs. Fault
tolerant routing is a critical task for sensor networks operating in
dynamic environments. Many routing, power management, and data
dissemination protocols have been specifically designed for WSNs
where energy awareness is an essential design issue. The focus,
however, has been given to the routing protocols which might differ
depending on the application and network architecture.
Abstract: In urban context, urban nodes such as amenity or
hazard will certainly affect house price, while classic hedonic analysis
will employ distance variables measured from each urban nodes.
However, effects from distances to facilities on house prices generally
do not represent the true price of the property. Distance variables
measured on the same surface are suffering a problem called
multicollinearity, which is usually presented as magnitude variance
and mean value in regression, errors caused by instability. In this paper,
we provided a theoretical framework to identify and gather the data
with less bias, and also provided specific sampling method on locating
the sample region to avoid the spatial multicollinerity problem in three
distance variable’s case.