Abstract: In the past few years, the use of wireless sensor networks (WSNs) potentially increased in applications such as intrusion detection, forest fire detection, disaster management and battle field. Sensor nodes are generally battery operated low cost devices. The key challenge in the design and operation of WSNs is to prolong the network life time by reducing the energy consumption among sensor nodes. Node clustering is one of the most promising techniques for energy conservation. This paper presents a novel clustering algorithm which maximizes the network lifetime by reducing the number of communication among sensor nodes. This approach also includes new distributed cluster formation technique that enables self-organization of large number of nodes, algorithm for maintaining constant number of clusters by prior selection of cluster head and rotating the role of cluster head to evenly distribute the energy load among all sensor nodes.
Abstract: In this paper we present a full performance analysis of an energy conserving routing protocol in mobile ad hoc network, named ER-AODV (Energy Reverse Ad-hoc On-demand Distance Vector routing). ER-AODV is a reactive routing protocol based on a policy which combines two mechanisms used in the basic AODV protocol. AODV and most of the on demand ad hoc routing protocols use single route reply along reverse path. Rapid change of topology causes that the route reply could not arrive to the source node, i.e. after a source node sends several route request messages, the node obtains a reply message, and this increases in power consumption. To avoid these problems, we propose a mechanism which tries multiple route replies. The second mechanism proposes a new adaptive approach which seeks to incorporate the metric "residual energy " in the process route selection, Indeed the residual energy of mobile nodes were considered when making routing decisions. The results of simulation show that protocol ER-AODV answers a better energy conservation.
Abstract: Topological changes in mobile ad hoc networks
frequently render routing paths unusable. Such recurrent path failures
have detrimental effects on quality of service. A suitable technique
for eliminating this problem is to use multiple backup paths between
the source and the destination in the network. This paper proposes an
effective and efficient protocol for backup and disjoint path set in ad
hoc wireless network. This protocol converges to a highly reliable
path set very fast with no message exchange overhead. The paths
selection according to this algorithm is beneficial for mobile ad hoc
networks, since it produce a set of backup paths with more high
reliability. Simulation experiments are conducted to evaluate the
performance of our algorithm in terms of route numbers in the path
set and its reliability. In order to acquire link reliability estimates, we
use link expiration time (LET) between two nodes.
Abstract: XML data consists of a very flexible tree-structure
which makes it difficult to support the storing and retrieving of XML
data. The node numbering scheme is one of the most popular
approaches to store XML in relational databases. Together with the
node numbering storage scheme, structural joins can be used to
efficiently process the hierarchical relationships in XML. However, in
order to process a tree-structured XPath query containing several
hierarchical relationships and conditional sentences on XML data,
many structural joins need to be carried out, which results in a high
query execution cost. This paper introduces mechanisms to reduce the
XPath queries including branch nodes into a much more efficient form
with less numbers of structural joins. A two step approach is proposed.
The first step merges duplicate nodes in the tree-structured query and
the second step divides the query into sub-queries, shortens the paths
and then merges the sub-queries back together. The proposed
approach can highly contribute to the efficient execution of XML
queries. Experimental results show that the proposed scheme can
reduce the query execution cost by up to an order of magnitude of the
original execution cost.
Abstract: Due to the limited energy resources, energy efficient operation of sensor node is a key issue in wireless sensor networks. Clustering is an effective method to prolong the lifetime of energy constrained wireless sensor network. However, clustering in wireless sensor network faces several challenges such as selection of an optimal group of sensor nodes as cluster, optimum selection of cluster head, energy balanced optimal strategy for rotating the role of cluster head in a cluster, maintaining intra and inter cluster connectivity and optimal data routing in the network. In this paper, we propose a protocol supporting an energy efficient clustering, cluster head selection/rotation and data routing method to prolong the lifetime of sensor network. Simulation results demonstrate that the proposed protocol prolongs network lifetime due to the use of efficient clustering, cluster head selection/rotation and data routing.
Abstract: In this paper, we propose improved versions of DVHop
algorithm as QDV-Hop algorithm and UDV-Hop algorithm for
better localization without the need for additional range measurement
hardware. The proposed algorithm focuses on third step of DV-Hop,
first error terms from estimated distances between unknown node and
anchor nodes is separated and then minimized. In the QDV-Hop
algorithm, quadratic programming is used to minimize the error to
obtain better localization. However, quadratic programming requires
a special optimization tool box that increases computational
complexity. On the other hand, UDV-Hop algorithm achieves
localization accuracy similar to that of QDV-Hop by solving
unconstrained optimization problem that results in solving a system
of linear equations without much increase in computational
complexity. Simulation results show that the performance of our
proposed schemes (QDV-Hop and UDV-Hop) is superior to DV-Hop
and DV-Hop based algorithms in all considered scenarios.
Abstract: This paper presents performance analysis of the
Evolutionary Programming-Artificial Neural Network (EPANN)
based technique to optimize the architecture and training parameters
of a one-hidden layer feedforward ANN model for the prediction of
energy output from a grid connected photovoltaic system. The ANN
utilizes solar radiation and ambient temperature as its inputs while the
output is the total watt-hour energy produced from the grid-connected
PV system. EP is used to optimize the regression performance of the
ANN model by determining the optimum values for the number of
nodes in the hidden layer as well as the optimal momentum rate and
learning rate for the training. The EPANN model is tested using two
types of transfer function for the hidden layer, namely the tangent
sigmoid and logarithmic sigmoid. The best transfer function, neural
topology and learning parameters were selected based on the highest
regression performance obtained during the ANN training and testing
process. It is observed that the best transfer function configuration for
the prediction model is [logarithmic sigmoid, purely linear].
Abstract: Wireless sensor networks is an emerging technology
that serves as environment monitors in many applications. Yet
these miniatures suffer from constrained resources in terms of
computation capabilities and energy resources. Limited energy
resource in these nodes demands an efficient consumption of that
resource either by developing the modules itself or by providing
an efficient communication protocols. This paper presents a
comprehensive summarization and a comparative study of the
available MAC protocols proposed for Wireless Sensor Networks
showing their capabilities and efficiency in terms of energy
consumption and delay guarantee.
Abstract: Because nodes are usually battery-powered, the energy
presents a very scarce resource in wireless sensor networks. For this
reason, the design of medium access control had to take energy
efficiency as one of its hottest concerns. Accordingly, in order to
improve the energy performance of MAC schemes in wireless sensor
networks, several ways can be followed. In fact, some researchers try
to limit idle listening while others focus on mitigating overhearing
(i.e. a node can hear a packet which is destined to another node)
or reducing the number of the used control packets. We, in this
paper, propose a new hybrid MAC protocol termed ELE-MAC
(i.e. Energy Latency Efficient MAC). The ELE-MAC major design
goals are energy and latency efficiencies. It adopts less control
packets than SMAC in order to preserve energy. We carried out ns-
2 simulations to evaluate the performance of the proposed protocol.
Thus, our simulation-s results prove the ELE-MAC energy efficiency.
Additionally, our solution performs statistically the same or better
latency characteristic compared to adaptive SMAC.
Abstract: This paper presents an online method that learns the
corresponding points of an object from un-annotated grayscale images
containing instances of the object. In the first image being
processed, an ensemble of node points is automatically selected
which is matched in the subsequent images. A Bayesian posterior
distribution for the locations of the nodes in the images is formed.
The likelihood is formed from Gabor responses and the prior assumes
the mean shape of the node ensemble to be similar in a translation
and scale free space. An association model is applied for separating
the object nodes and background nodes. The posterior distribution is
sampled with Sequential Monte Carlo method. The matched object
nodes are inferred to be the corresponding points of the object
instances. The results show that our system matches the object nodes
as accurately as other methods that train the model with annotated
training images.
Abstract: For a quick and accurate calculation of spatial neutron
distribution in nuclear power reactors 3D nodal codes are usually
used aiming at solving the neutron diffusion equation for a given
reactor core geometry and material composition. These codes use a
second order polynomial to represent the transverse leakage term. In
this work, a nodal method based on the well known nodal expansion
method (NEM), developed at COPPE, making use of this polynomial
expansion was modified to treat the transverse leakage term for the
external surfaces of peripheral reflector nodes.
The proposed method was implemented into a computational
system which, besides solving the diffusion equation, also solves the
burnup equations governing the gradual changes in material
compositions of the core due to fuel depletion. Results confirm the
effectiveness of this modified treatment of peripheral nodes for
practical purposes in PWR reactors.
Abstract: For collecting data from all sensor nodes, some
changes in Dynamic Source Routing (DSR) protocol is proposed. At
each hop level, route-ranking technique is used for distributing
packets to different selected routes dynamically. For calculating rank
of a route, different parameters like: delay, residual energy and
probability of packet loss are used. A hybrid topology of
DMPR(Disjoint Multi Path Routing) and MMPR(Meshed Multi Path
Routing) is formed, where braided topology is used in different
faulty zones of network. For reducing energy consumption, variant
transmission ranges is used instead of fixed transmission range. For
reducing number of packet drop, a fuzzy logic inference scheme is
used to insert different types of delays dynamically. A rule based
system infers membership function strength which is used to
calculate the final delay amount to be inserted into each of the node
at different clusters.
In braided path, a proposed 'Dual Line ACK Link'scheme is
proposed for sending ACK signal from a damaged node or link to a
parent node to ensure that any error in link or any node-failure
message may not be lost anyway. This paper tries to design the
theoretical aspects of a model which may be applied for collecting
data from any large hanging iron structure with the help of wireless
sensor network. But analyzing these data is the subject of material
science and civil structural construction technology, that part is out
of scope of this paper.
Abstract: Plant tissue culture is an important in vitro technology applied for agricultural and industrial production. A sterile condition of culture medium is one of the main aspects. The alternative technique for medium sterilization to replace autoclaving was carried out. For sterilization of plant tissue culture medium without autoclaving, ten commercial pure essential oils and 5 disinfectants were tested. Each essential oil or disinfectant was added to a 20-mL Murashige and Skoog (MS) medium before medium was solidified in a 120-mL container, kept for 2 weeks before evaluating sterile conditions. Treated media, supplemented with essential oils or disinfectants, were compared to control medium, autoclaved at 121 degree Celsius for 15 min. Sterile conditions of MS medium were found 100% from betel oil or clove oil (18 mL/20 mL medium), cinnamon oil (36 mL/20 mL medium), lavender oil or holy basil oil (108 mL/20 mL medium), and lemon oil or tea tree oil or turmeric oil (252 mL/20 mL medium), compared to 100% sterile condition from autoclaved medium. For disinfectants, 2% iodine + 2.4% potassium iodide, 2% merbromine solution, 10% povidone-iodine, 6% sodium hypochlorite or 0.1% thimerosal at 36 mL/20 mL medium provided 100% sterile conditions. Furthermore, growth of new shoots from chrysanthemum node explants on treated media (fresh weight, shoot length, root length and number of node) were also reported and discussed in the comparison of those on autoclaved medium.
Abstract: During signal transmission, the combined effect of the
transmitter filter, the transmission medium, and additive white
Gaussian noise (AWGN) are included in the channel which distort
and add noise to the signal. This causes the well defined signal
constellation to spread causing errors in bit detection. A compact pi
neural network with minimum number of nodes is proposed. The
replacement of summation at each node by multiplication results in
more powerful mapping. The resultant pi network is tested on six
different channels.
Abstract: Fuzzy Cognitive Maps (FCMs) have successfully
been applied in numerous domains to show relations between
essential components. In some FCM, there are more nodes, which
related to each other and more nodes means more complex in system
behaviors and analysis. In this paper, a novel learning method used to
construct FCMs based on historical data and by using data mining
and DEMATEL method, a new method defined to reduce nodes
number. This method cluster nodes in FCM based on their cause and
effect behaviors.
Abstract: Nodes in mobile Ad Hoc Network (MANET) do not
rely on a central infrastructure but relay packets originated by other
nodes. Mobile ad hoc networks can work properly only if the
participating nodes collaborate in routing and forwarding. For
individual nodes it might be advantageous not to collaborate, though.
In this conceptual paper we propose a new approach based on
relationship among the nodes which makes them to cooperate in an
Adhoc environment. The trust unit is used to calculate the trust
values of each node in the network. The calculated trust values are
being used by the relationship estimator to determine the relationship
status of nodes. The proposed enhanced protocol was compared with
the standard DSR protocol and the results are analyzed using the
network simulator-2.
Abstract: Mobile ad-hoc networks (MANETs) are a form of
wireless networks which do not require a base station for providing
network connectivity. Mobile ad-hoc networks have many
characteristics which distinguish them from other wireless networks
which make routing in such networks a challenging task. Cluster
based routing is one of the routing schemes for MANETs in which
various clusters of mobile nodes are formed with each cluster having
its own clusterhead which is responsible for routing among clusters.
In this paper we have proposed and implemented a distributed
weighted clustering algorithm for MANETs. This approach is based
on combined weight metric that takes into account several system
parameters like the node degree, transmission range, energy and
mobility of the nodes. We have evaluated the performance of
proposed scheme through simulation in various network situations.
Simulation results show that proposed scheme outperforms the
original distributed weighted clustering algorithm (DWCA).
Abstract: In communication networks where communication nodes are connected with finite capacity transmission links, the packet inter-arrival times are strongly correlated with the packet length and the link capacity (or the packet service time). Such correlation affects the system performance significantly, but little attention has been paid to this issue. In this paper, we propose a mathematical framework to study the impact of the correlation between the packet service times and the packet inter-arrival times on system performance. With our mathematical model, we analyze the system performance, e.g., the unfinished work of the system, and show that the correlation affects the system performance significantly. Some numerical examples are also provided.
Abstract: It is the living conditions in the cities that determine the future of our livelihood. “To change life, we must first change space"- Henri Lefebvre. Sustainable development is a utopian aspiration for South African cities (especially the case study of the Gauteng City Region), which are currently characterized by unplanned growth and increasing urban sprawl. While the reasons for poor environmental quality and living conditions are undoubtedly diverse and complex, having political, economical and social dimensions, it is argued that the prevailing approach to layout planning in South Africa is part of the problem. This article seeks a solution to the problem of sustainability, from a spatial planning perspective. The spatial planning tool, the urban development boundary, is introduced as the concept that will ensure empty talk being translated into a sustainable vision. The urban development boundary is a spatial planning tool that can be used and implemented to direct urban growth towards a more sustainable form. The urban development boundary aims to ensure planned urban areas, in contrast to the current unplanned areas characterized by urban sprawl and insufficient infrastructure. However, the success of the urban development boundary concept is subject to effective implementation measures, as well as adequate and efficient management. The concept of sustainable development can function as a driving force underlying societal change and transformation, but the interface between spatial planning and environmental management needs to be established (as this is the core aspects underlying sustainable development), and authorities needs to understand and implement this interface consecutively. This interface can, however, realize in terms of the objectives of the planning tool – the urban development boundary. The case study, the Gauteng City Region, is depicted as a site of economic growth and innovation, but there is a lack of good urban and regional governance, impacting on the design (layout) and function of urban areas and land use, as current authorities make uninformed decisions in terms of development applications, leading to unsustainable urban forms and unsustainable nodes. Place and space concepts are thus critical matters applicable to planning of the Gauteng City Region. The urban development boundary are thus explored as a planning tool to guide decision-making, and create a sustainable urban form, leading to better environmental and living conditions, and continuous sustainability.
Abstract: The cellular network is one of the emerging areas of
communication, in which the mobile nodes act as member for one
base station. The cluster based communication is now an emerging
area of wireless cellular multimedia networks. The cluster renders
fast communication and also a convenient way to work with
connectivity. In our scheme we have proposed an optimization
technique for the fuzzy cluster nodes, by categorizing the group
members into three categories like long refreshable member, medium
refreshable member and short refreshable member. By considering
long refreshable nodes as static nodes, we compute the new
membership values for the other nodes in the cluster. We compare
their previous and present membership value with the threshold value
to categorize them into three different members. By which, we
optimize the nodes in the fuzzy clusters. The simulation results show
that there is reduction in the cluster computational time and
iterational time after optimization.