Abstract: MANEMO is the integration of Network Mobility
(NEMO) and Mobile Ad Hoc Network (MANET). A MANEMO
node has an interface to both a MANET and NEMO network, and
therefore should choose the optimal interface for packet delivery,
however such a handover between interfaces will introduce packet
loss. We define the steps necessary for a MANEMO handover,
using Mobile IP and NEMO to signal the new binding to the
relevant Home Agent(s). The handover steps aim to minimize the
packet loss by avoiding waiting for Duplicate Address Detection
and Neighbour Unreachability Detection. We present expressions for
handover delay and packet loss, and then use numerical examples to
evaluate a MANEMO handover. The analysis shows how the packet
loss depends on level of nesting within NEMO, the delay between
Home Agents and the load on the MANET, and hence can be used
to developing optimal MANEMO handover algorithms.
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.
Abstract: In multi hop wireless systems, such as ad hoc and
sensor networks, mobile ad hoc network applications are deployed,
security emerges as a central requirement. A particularly devastating
attack is known as the wormhole attack, where two or more malicious
colluding nodes create a higher level virtual tunnel in the network,
which is employed to transport packets between the tunnel end points.
These tunnels emulate shorter links in the network. In which
adversary records transmitted packets at one location in the network,
tunnels them to another location, and retransmits them into the
network. The wormhole attack is possible even if the attacker has not
compromised any hosts and even if all communication provides
authenticity and confidentiality. In this paper, we analyze wormhole
attack nature in ad hoc and sensor networks and existing methods of
the defending mechanism to detect wormhole attacks without require
any specialized hardware. This analysis able to provide in
establishing a method to reduce the rate of refresh time and the
response time to become more faster.
Abstract: With the demand of mobility by users, wireless
technologies have become the hotspot developing arena. Internet
Engineering Task Force (IETF) working group has developed Mobile
IP to support node mobility. The concept of node mobility indicates
that in spite of the movement of the node, it is still connected to the
internet and all the data transactions are preserved. It provides
location-independent access to Internet. After the incorporation of
host mobility, network mobility has undergone intense research.
There are several intricacies faced in the real world implementation
of network mobility significantly the problem of nested networks and
their consequences. This article is concerned regarding a problem of
nested network called pinball route problem and proposes a solution
to eliminate the above problem. The proposed mechanism is
implemented using NS2 simulation tool and it is found that the
proposed mechanism efficiently reduces the overload caused by the
pinball route problem.
Abstract: The important issue considered in the widespread deployment of Wireless Sensor Networks (WSNs) is an efficiency of the energy consumption. In this paper, we present a study of the optimal relay station planning problems using Binary Integer Linear Programming (BILP) model to minimize the energy consumption in WSNs. Our key contribution is that the proposed model not only ensures the required network lifetime but also guarantees the radio connectivity at high level of communication quality. Specially, we take into account effects of noise, signal quality limitation and bit error rate characteristics. Numerical experiments were conducted in various network scenarios. We analyzed the effects of different sensor node densities and distribution on the energy consumption.
Abstract: This paper describes a novel approach for deriving
modules from protein-protein interaction networks, which combines
functional information with topological properties of the network.
This approach is based on weighted clustering coefficient, which
uses weights representing the functional similarities between the
proteins. These weights are calculated according to the semantic
similarity between the proteins, which is based on their Gene
Ontology terms. We recently proposed an algorithm for identification
of functional modules, called SWEMODE (Semantic WEights for
MODule Elucidation), that identifies dense sub-graphs containing
functionally similar proteins. The rational underlying this approach is
that each module can be reduced to a set of triangles (protein triplets
connected to each other). Here, we propose considering semantic
similarity weights of all triangle-forming edges between proteins. We
also apply varying semantic similarity thresholds between
neighbours of each node that are not neighbours to each other (and
hereby do not form a triangle), to derive new potential triangles to
include in module-defining procedure. The results show an
improvement of pure topological approach, in terms of number of
predicted modules that match known complexes.
Abstract: Due to the limited lifetime of the nodes in ad hoc and sensor networks, energy efficiency needs to be an important design consideration in any routing algorithm. It is known that by employing a virtual backbone in a wireless network, the efficiency of any routing scheme for the network can be improved. One common design for routing protocols in mobile ad hoc networks is to use positioning information; we use the node-s geometric locations to introduce an algorithm that can construct the virtual backbone structure locally in 3D environment. The algorithm construction has a constant time.
Abstract: Among many different methods that are used for
optimizing different engineering problems mathematical (numerical)
optimization techniques are very important because they can easily
be used and are consistent with most of engineering problems. Many
studies and researches are done on stability analysis of three
dimensional (3D) slopes and the relating probable slip surfaces and
determination of factors of safety, but in most of them force
equilibrium equations, as in simplified 2D methods, are considered
only in two directions. In other words for decreasing mathematical
calculations and also for simplifying purposes the force equilibrium
equation in 3rd direction is omitted. This point is considered in just a
few numbers of previous studies and most of them have only given a
factor of safety and they haven-t made enough effort to find the most
probable slip surface. In this study shapes of the slip surfaces are
modeled, and safety factors are calculated considering the force
equilibrium equations in all three directions, and also the moment
equilibrium equation is satisfied in the slip direction, and using
nonlinear programming techniques the shape of the most probable
slip surface is determined. The model which is used in this study is a
3D model that is composed of three upper surfaces which can cover
all defined and probable slip surfaces. In this research the meshing
process is done in a way that all elements are prismatic with
quadrilateral cross sections, and the safety factor is defined on this
quadrilateral surface in the base of the element which is a part of the
whole slip surface. The method that is used in this study to find the
most probable slip surface is the non-linear programming method in
which the objective function that must get optimized is the factor of
safety that is a function of the soil properties and the coordinates of
the nodes on the probable slip surface. The main reason for using
non-linear programming method in this research is its quick
convergence to the desired responses. The final results show a good
compatibility with the previously used classical and 2D methods and
also show a reasonable convergence speed.
Abstract: Sensor Network are emerging as a new tool for
important application in diverse fields like military surveillance,
habitat monitoring, weather, home electrical appliances and others.
Technically, sensor network nodes are limited in respect to energy
supply, computational capacity and communication bandwidth. In
order to prolong the lifetime of the sensor nodes, designing efficient
routing protocol is very critical. In this paper, we illustrate the
existing routing protocol for wireless sensor network using data
centric approach and present performance analysis of these protocols.
The paper focuses in the performance analysis of specific protocol
namely Directed Diffusion and SPIN. This analysis reveals that the
energy usage is important features which need to be taken into
consideration while designing routing protocol for wireless sensor
network.
Abstract: The issue of real-time and reliable report delivery is extremely important for taking effective decision in a real world mission critical Wireless Sensor Network (WSN) based application. The sensor data behaves differently in many ways from the data in traditional databases. WSNs need a mechanism to register, process queries, and disseminate data. In this paper we propose an architectural framework for data placement and management. We propose a reliable and real time approach for data placement and achieving data integrity using self organized sensor clusters. Instead of storing information in individual cluster heads as suggested in some protocols, in our architecture we suggest storing of information of all clusters within a cell in the corresponding base station. For data dissemination and action in the wireless sensor network we propose to use Action and Relay Stations (ARS). To reduce average energy dissipation of sensor nodes, the data is sent to the nearest ARS rather than base station. We have designed our architecture in such a way so as to achieve greater energy savings, enhanced availability and reliability.
Abstract: Wireless Sensor Networks can be used to monitor the
physical phenomenon in such areas where human approach is nearly
impossible. Hence the limited power supply is the major constraint of
the WSNs due to the use of non-rechargeable batteries in sensor
nodes. A lot of researches are going on to reduce the energy
consumption of sensor nodes. Energy map can be used with
clustering, data dissemination and routing techniques to reduce the
power consumption of WSNs. Energy map can also be used to know
which part of the network is going to fail in near future. In this paper,
Energy map is constructed using the prediction based approach.
Adaptive alpha GM(1,1) model is used as the prediction model.
GM(1,1) is being used worldwide in many applications for predicting
future values of time series using some past values due to its high
computational efficiency and accuracy.
Abstract: Structural representation and technology mapping of
a Boolean function is an important problem in the design of nonregenerative
digital logic circuits (also called combinational logic
circuits). Library aware function manipulation offers a solution to
this problem. Compact multi-level representation of binary networks,
based on simple circuit structures, such as AND-Inverter Graphs
(AIG) [1] [5], NAND Graphs, OR-Inverter Graphs (OIG), AND-OR
Graphs (AOG), AND-OR-Inverter Graphs (AOIG), AND-XORInverter
Graphs, Reduced Boolean Circuits [8] does exist in
literature. In this work, we discuss a novel and efficient graph
realization for combinational logic circuits, represented using a
NAND-NOR-Inverter Graph (NNIG), which is composed of only
two-input NAND (NAND2), NOR (NOR2) and inverter (INV) cells.
The networks are constructed on the basis of irredundant disjunctive
and conjunctive normal forms, after factoring, comprising terms with
minimum support. Construction of a NNIG for a non-regenerative
function in normal form would be straightforward, whereas for the
complementary phase, it would be developed by considering a virtual
instance of the function. However, the choice of best NNIG for a
given function would be based upon literal count, cell count and
DAG node count of the implementation at the technology
independent stage. In case of a tie, the final decision would be made
after extracting the physical design parameters.
We have considered AIG representation for reduced disjunctive
normal form and the best of OIG/AOG/AOIG for the minimized
conjunctive normal forms. This is necessitated due to the nature of
certain functions, such as Achilles- heel functions. NNIGs are found
to exhibit 3.97% lesser node count compared to AIGs and
OIG/AOG/AOIGs; consume 23.74% and 10.79% lesser library cells
than AIGs and OIG/AOG/AOIGs for the various samples considered.
We compare the power efficiency and delay improvement achieved
by optimal NNIGs over minimal AIGs and OIG/AOG/AOIGs for
various case studies. In comparison with functionally equivalent,
irredundant and compact AIGs, NNIGs report mean savings in power
and delay of 43.71% and 25.85% respectively, after technology
mapping with a 0.35 micron TSMC CMOS process. For a
comparison with OIG/AOG/AOIGs, NNIGs demonstrate average
savings in power and delay by 47.51% and 24.83%. With respect to
device count needed for implementation with static CMOS logic
style, NNIGs utilize 37.85% and 33.95% lesser transistors than their
AIG and OIG/AOG/AOIG counterparts.
Abstract: Wireless sensor networks (WSNs) have gained
tremendous attention in recent years due to their numerous
applications. Due to the limited energy resource, energy efficient
operation of sensor nodes is a key issue in wireless sensor networks.
Cooperative caching which ensures sharing of data among various
nodes reduces the number of communications over the wireless
channels and thus enhances the overall lifetime of a wireless sensor
network. In this paper, we propose a cooperative caching scheme
called ZCS (Zone Cooperation at Sensors) for wireless sensor
networks. In ZCS scheme, one-hop neighbors of a sensor node form a
cooperative cache zone and share the cached data with each other.
Simulation experiments show that the ZCS caching scheme achieves
significant improvements in byte hit ratio and average query latency
in comparison with other caching strategies.
Abstract: COSMED K4b2 is a portable electrical device designed to test pulmonary functions. It is ideal for many applications that need the measurement of the cardio-respiratory response either in the field or in the lab is capable with the capability to delivery real time data to a sink node or a PC base station with storing data in the memory at the same time. But the actual sensor outputs and data received may contain some errors, such as impulsive noise which can be related to sensors, low batteries, environment or disturbance in data acquisition process. These abnormal outputs might cause misinterpretations of exercise or living activities to persons being monitored. In our paper we propose an effective and feasible method to detect and identify errors in applications by principal component analysis (PCA) and a back propagation (BP) neural network.
Abstract: The classification of the protein structure is commonly
not performed for the whole protein but for structural domains, i.e.,
compact functional units preserved during evolution. Hence, a first
step to a protein structure classification is the separation of the
protein into its domains. We approach the problem of protein domain
identification by proposing a novel graph theoretical algorithm. We
represent the protein structure as an undirected, unweighted and
unlabeled graph which nodes correspond the secondary structure
elements of the protein. This graph is call the protein graph. The
domains are then identified as partitions of the graph corresponding
to vertices sets obtained by the maximization of an objective function,
which mutually maximizes the cycle distributions found in the
partitions of the graph. Our algorithm does not utilize any other kind
of information besides the cycle-distribution to find the partitions. If
a partition is found, the algorithm is iteratively applied to each of
the resulting subgraphs. As stop criterion, we calculate numerically
a significance level which indicates the stability of the predicted
partition against a random rewiring of the protein graph. Hence,
our algorithm terminates automatically its iterative application. We
present results for one and two domain proteins and compare our
results with the manually assigned domains by the SCOP database
and differences are discussed.
Abstract: The health record in the Electronic Health Record
(EHR) system is more sensitive than demographic. It raises the
important issue for the EHR requirement in privacy, security, audit
trail, patient access, and archiving and data retention. The studies
about the EHR system security are deficient. The aim of this study is to
build a security environment for the EHR system by Integrating the
Healthcare Enterprise (IHE) Audit Trail and Node Authentication
Security (ATNA) profile. The CDAs can be access in a secure EHR
environment.
Abstract: A method based on the power series solution is proposed to solve the natural frequency of flapping vibration for the rotating inclined Euler beam with constant angular velocity. The vibration of the rotating beam is measured from the position of the corresponding steady state axial deformation. In this paper the governing equations for linear vibration of a rotating Euler beam are derived by the d'Alembert principle, the virtual work principle and the consistent linearization of the fully geometrically nonlinear beam theory in a rotating coordinate system. The governing equation for flapping vibration of the rotating inclined Euler beam is linear ordinary differential equation with variable coefficients and is solved by a power series with four independent coefficients. Substituting the power series solution into the corresponding boundary conditions at two end nodes of the rotating beam, a set of homogeneous equations can be obtained. The natural frequencies may be determined by solving the homogeneous equations using the bisection method. Numerical examples are studied to investigate the effect of inclination angle on the natural frequency of flapping vibration for rotating inclined Euler beams with different angular velocity and slenderness ratio.
Abstract: The purpose of this study is to suggest energy efficient
routing for ad hoc networks which are composed of nodes with limited
energy. There are diverse problems including limitation of energy
supply of node, and the node energy management problem has been
presented. And a number of protocols have been proposed for energy
conservation and energy efficiency. In this study, the critical point of
the EA-MPDSR, that is the type of energy efficient routing using only
two paths, is improved and developed. The proposed TP-MESR uses
multi-path routing technique and traffic prediction function to increase
number of path more than 2. It also verifies its efficiency compared to
EA-MPDSR using network simulator (NS-2). Also, To give a
academic value and explain protocol systematically, research
guidelines which the Hevner(2004) suggests are applied. This
proposed TP-MESR solved the existing multi-path routing problem
related to overhead, radio interference, packet reassembly and it
confirmed its contribution to effective use of energy in ad hoc
networks.
Abstract: An Ad hoc wireless network comprises of mobile
terminals linked and communicating with each other sans the aid of
traditional infrastructure. Optimized Link State Protocol (OLSR) is a
proactive routing protocol, in which routes are discovered/updated
continuously so that they are available when needed. Hello messages
generated by a node seeks information about its neighbor and if the
latter fails to respond to a specified number of hello messages
regulated by neighborhood hold time, the node is forced to assume
that the neighbor is not in range. This paper proposes to evaluate
OLSR routing protocol in a random mobility network having various
neighborhood hold time intervals. The throughput and delivery ratio
are also evaluated to learn about its efficiency for multimedia loads.