Abstract: The influence of humidity and low temperature on the α- amylase activity and isoenzyme composition of grains of different wheat varieties have been studied. The identified samples of varieties have significant difference in the level of enzyme induction under the impact of high humidity and low temperature. It is proposed to use this methodological approach for testing genotypes and wheat breeding lines for resistance to pre-harvest sprouting (PHS).
Abstract: In this paper, 3X3 routing nodes are proposed to
provide speedup and parallel processing capability in Data Vortex
network architectures. The new design not only significantly
improves network throughput and latency, but also eliminates the
need for distributive traffic control mechanism originally embedded
among nodes and the need for nodal buffering. The cost effectiveness
is studied by a comparison study with the previously proposed 2-
input buffered networks, and considerable performance enhancement
can be achieved with similar or lower cost of hardware. Unlike
previous implementation, the network leaves small probability of
contention, therefore, the packet drop rate must be kept low for such
implementation to be feasible and attractive, and it can be achieved
with proper choice of operation conditions.
Abstract: Optimal routing in communication networks is a
major issue to be solved. In this paper, the application of Tabu Search
(TS) in the optimum routing problem where the aim is to minimize
the computational time and improvement of quality of the solution in
the communication have been addressed. The goal is to minimize the
average delays in the communication. The effectiveness of Tabu
Search method is shown by the results of simulation to solve the
shortest path problem. Through this approach computational cost can
be reduced.
Abstract: Unstructured peer-to-peer networks are popular due to
its robustness and scalability. Query schemes that are being used in
unstructured peer-to-peer such as the flooding and interest-based
shortcuts suffer various problems such as using large communication
overhead long delay response. The use of routing indices has been a
popular approach for peer-to-peer query routing. It helps the query
routing processes to learn the routing based on the feedbacks
collected. In an unstructured network where there is no global
information available, efficient and low cost routing approach is
needed for routing efficiency.
In this paper, we propose a novel mechanism for query-feedback
oriented routing indices to achieve routing efficiency in unstructured
network at a minimal cost. The approach also applied information
retrieval technique to make sure the content of the query is
understandable and will make the routing process not just based to
the query hits but also related to the query content. Experiments have
shown that the proposed mechanism performs more efficient than
flood-based routing.
Abstract: The Cluster Dimension of a network is defined as, which is the minimum cardinality of a subset S of the set of nodes having the property that for any two distinct nodes x and y, there exist the node Si, s2 (need not be distinct) in S such that ld(x,s1) — d(y, s1)1 > 1 and d(x,s2) < d(x,$) for all s E S — {s2}. In this paper, strictly non overlap¬ping clusters are constructed. The concept of LandMarks for Unique Addressing and Clustering (LMUAC) routing scheme is developed. With the help of LMUAC routing scheme, It is shown that path length (upper bound)PLN,d < PLD, Maximum memory space requirement for the networkMSLmuAc(Az) < MSEmuAc < MSH3L < MSric and Maximum Link utilization factor MLLMUAC(i=3) < MLLMUAC(z03) < M Lc
Abstract: In order to monitor for traffic traversal, sensors can be
deployed to perform collaborative target detection. Such a sensor
network achieves a certain level of detection performance with the
associated costs of deployment and routing protocol. This paper
addresses these two points of sensor deployment and routing algorithm
in the situation where the absolute quantity of sensors or total energy
becomes insufficient. This discussion on the best deployment system
concluded that two kinds of deployments; Normal and Power law
distributions, show 6 and 3 times longer than Random distribution in
the duration of coverage, respectively. The other discussion on routing
algorithm to achieve good performance in each deployment system
was also addressed. This discussion concluded that, in place of the
traditional algorithm, a new algorithm can extend the time of coverage
duration by 4 times in a Normal distribution, and in the circumstance
where every deployed sensor operates as a binary model.
Abstract: Supply chain consists of all stages involved, directly
or indirectly, includes all functions involved in fulfilling a customer
demand. In two stage transportation supply chain problem,
transportation costs are of a significant proportion of final product
costs. It is often crucial for successful decisions making approaches
in two stage supply chain to explicit account for non-linear
transportation costs. In this paper, deterministic demand and finite
supply of products was considered. The optimized distribution level
and the routing structure from the manufacturing plants to the
distribution centres and to the end customers is determined using
developed mathematical model and solved by proposed particle
swarm optimization based genetic algorithm. Numerical analysis of
the case study is carried out to validate the model.
Abstract: Ant Colony Algorithms have been applied to difficult
combinatorial optimization problems such as the travelling salesman
problem and the quadratic assignment problem. In this paper gridbased
and random-based ant colony algorithms are proposed for
automatic 3D hose routing and their pros and cons are discussed. The
algorithm uses the tessellated format for the obstacles and the
generated hoses in order to detect collisions. The representation of
obstacles and hoses in the tessellated format greatly helps the
algorithm towards handling free-form objects and speeds up
computation. The performance of algorithm has been tested on a
number of 3D models.
Abstract: A number of routing algorithms based on learning
automata technique have been proposed for communication
networks. How ever, there has been little work on the effects of
variation of graph scarcity on the performance of these algorithms. In
this paper, a comprehensive study is launched to investigate the
performance of LASPA, the first learning automata based solution to
the dynamic shortest path routing, across different graph structures
with varying scarcities. The sensitivity of three main performance
parameters of the algorithm, being average number of processed
nodes, scanned edges and average time per update, to variation in
graph scarcity is reported. Simulation results indicate that the LASPA
algorithm can adapt well to the scarcity variation in graph structure
and gives much better outputs than the existing dynamic and fixed
algorithms in terms of performance criteria.
Abstract: A wireless sensor network with a large number of tiny sensor nodes can be used as an effective tool for gathering data in various situations. One of the major issues in wireless sensor networks is developing an energy-efficient routing protocol which has a significant impact on the overall lifetime of the sensor network. In this paper, we propose a novel hierarchical with static clustering routing protocol called Energy-Efficient Protocol with Static Clustering (EEPSC). EEPSC, partitions the network into static clusters, eliminates the overhead of dynamic clustering and utilizes temporary-cluster-heads to distribute the energy load among high-power sensor nodes; thus extends network lifetime. We have conducted simulation-based evaluations to compare the performance of EEPSC against Low-Energy Adaptive Clustering Hierarchy (LEACH). Our experiment results show that EEPSC outperforms LEACH in terms of network lifetime and power consumption minimization.
Abstract: The shortest path (SP) problem concerns with finding the shortest path from a specific origin to a specified destination in a given network while minimizing the total cost associated with the path. This problem has widespread applications. Important applications of the SP problem include vehicle routing in transportation systems particularly in the field of in-vehicle Route Guidance System (RGS) and traffic assignment problem (in transportation planning). Well known applications of evolutionary methods like Genetic Algorithms (GA), Ant Colony Optimization, Particle Swarm Optimization (PSO) have come up to solve complex optimization problems to overcome the shortcomings of existing shortest path analysis methods. It has been reported by various researchers that PSO performs better than other evolutionary optimization algorithms in terms of success rate and solution quality. Further Geographic Information Systems (GIS) have emerged as key information systems for geospatial data analysis and visualization. This research paper is focused towards the application of PSO for solving the shortest path problem between multiple points of interest (POI) based on spatial data of Allahabad City and traffic speed data collected using GPS. Geovisualization of results of analysis is carried out in GIS.
Abstract: Delay and Disruption Tolerant Networking is part of
the Inter Planetary Internet with primary application being Deep
Space Networks. Its Terrestrial form has interesting research
applications such as Alagappa University Delay Tolerant Water
Monitoring Network which doubles as test beds for improvising its
routing scheme. DTNs depend on node mobility to deliver packets
using a store-carry-and forward paradigm. Throwboxes are small and
inexpensive stationary devices equipped with wireless interfaces and
storage. We propose the use of Throwboxes to enhance the contact
opportunities of the nodes and hence improve the Throughput. The
enhancement is evaluated using Alunivdtnsim, a desktop simulator in
C language and the results are graphically presented.
Abstract: The vehicle routing problem (VRP) is a famous combinatorial optimization problem. Because of its well-known difficulty, metaheuristics are the most appropriate methods to tackle large and realistic instances. The goal of this paper is to highlight the key ideas for designing VRP metaheuristics according to the following criteria: efficiency, speed, robustness, and ability to take advantage of the problem structure. Such elements can obviously be used to build solution methods for other combinatorial optimization problems, at least in the deterministic field.
Abstract: Border Gateway Protocol (BGP) is the standard routing protocol between various autonomous systems (AS) in the internet. In the event of failure, a considerable delay in the BGP convergence has been shown by empirical measurements. During the convergence time the BGP will repeatedly advertise new routes to some destination and withdraw old ones until it reach a stable state. It has been found that the KEEPALIVE message timer and the HOLD time are tow parameters affecting the convergence speed. This paper aims to find the optimum value for the KEEPALIVE timer and the HOLD time that maximally reduces the convergence time without increasing the traffic. The KEEPALIVE message timer optimal value founded by this paper is 30 second instead of 60 seconds, and the optimal value for the HOLD time is 90 seconds instead of 180 seconds.
Abstract: In this paper, we seek to determine one reasonable
local hub port and optimal routes for a containership fleet,
performing pick-ups and deliveries, between the hub and spoke ports
in a same region. The relationship between a hub port, and traffic in
feeder lines is analyzed. A new network planning method is proposed,
an integrated hub port location and route design, a capacitated vehicle
routing problem with pick-ups, deliveries and time deadlines are
formulated and solved using an improved genetic algorithm for
positioning the hub port and establishing routes for a containership
fleet. Results on the performance of the algorithm and the feasibility
of the approach show that a relatively small fleet of containerships
could provide efficient services within deadlines.
Abstract: Using mini modules of Tmotes, it is possible to automate a small personal area network. This idea can be extended to large networks too by implementing multi-hop routing. Linking the various Tmotes using Programming languages like Nesc, Java and having transmitter and receiver sections, a network can be monitored. It is foreseen that, depending on the application, a long range at a low data transfer rate or average throughput may be an acceptable trade-off. To reduce the overall costs involved, an optimum number of Tmotes to be used under various conditions (Indoor/Outdoor) is to be deduced. By analyzing the data rates or throughputs at various locations of Tmotes, it is possible to deduce an optimal number of Tmotes for a specific network. This paper deals with the determination of optimum distances to reduce the cost and increase the reliability of the entire sensor network with Wireless Local Loop (WLL) capability.
Abstract: Routing places an important role in determining the
quality of service in wireless networks. The routing methods adopted
in wireless networks have many drawbacks. This paper aims to
review the current routing methods used in wireless networks. This
paper proposes an innovative solution to overcome the problems in
routing. This solution is aimed at improving the Quality of Service.
This solution is different from others as it involves the resuage of the
part of the virtual circuits. This improvement in quality of service is
important especially in propagation of multimedia applications like
video, animations etc. So it is the dire need to propose a new solution
to improve the quality of service in ATM wireless networks for
multimedia applications especially during this era of multimedia
based applications.
Abstract: A wireless Ad-hoc network consists of wireless nodes
communicating without the need for a centralized administration, in
which all nodes potentially contribute to the routing process.In this
paper, we report the simulation results of four different scenarios for
wireless ad hoc networks having thirty nodes. The performances of
proposed networks are evaluated in terms of number of hops per
route, delay and throughput with the help of OPNET simulator.
Channel speed 1 Mbps and simulation time 600 sim-seconds were
taken for all scenarios. For the above analysis DSR routing protocols
has been used. The throughput obtained from the above analysis
(four scenario) are compared as shown in Figure 3. The average
media access delay at node_20 for two routes and at node_20 for four
different scenario are compared as shown in Figures 4 and 5. It is
observed that the throughput will degrade when it will follow
different hops for same source to destination (i.e. it has dropped from
1.55 Mbps to 1.43 Mbps which is around 9.7%, and then dropped to
0.48Mbps which is around 35%).