Abstract: Sensor network applications are often data centric and
involve collecting data from a set of sensor nodes to be delivered
to various consumers. Typically, nodes in a sensor network are
resource-constrained, and hence the algorithms operating in these
networks must be efficient. There may be several algorithms available
implementing the same service, and efficient considerations may
require a sensor application to choose the best suited algorithm. In
this paper, we present a systematic evaluation of a set of algorithms
implementing the data gathering service. We propose a modular
infrastructure for implementing such algorithms in TOSSIM with
separate configurable modules for various tasks such as interest
propagation, data propagation, aggregation, and path maintenance.
By appropriately configuring these modules, we propose a number
of data gathering algorithms, each of which incorporates a different
set of heuristics for optimizing performance. We have performed
comprehensive experiments to evaluate the effectiveness of these
heuristics, and we present results from our experimentation efforts.
Abstract: Optical burst switching (OBS) has been proposed to
realize the next generation Internet based on the wavelength division
multiplexing (WDM) network technologies. In the OBS, the burst
contention is one of the major problems. The deflection routing has
been designed for resolving the problem. However, the deflection
routing becomes difficult to prevent from the burst contentions as the
network load becomes high. In this paper, we introduce a flow rate
control methods to reduce burst contentions. We propose new flow
rate control methods based on the leaky bucket algorithm and
deflection routing, i.e. separate leaky bucket deflection method, and
dynamic leaky bucket deflection method. In proposed methods, edge
nodes which generate data bursts carry out the flow rate control
protocols. In order to verify the effectiveness of the flow rate control in
OBS networks, we show that the proposed methods improve the
network utilization and reduce the burst loss probability through
computer simulations.
Abstract: This article presents the results of researchrelated to the assessment protocol weightedcumulative expected transmission time (WCETT)applied to cognitive radio networks.The development work was based on researchdone by different authors, we simulated a network,which communicates wirelessly, using a licensedchannel, through which other nodes are notlicensed, try to transmit during a given time nodeuntil the station's owner begins its transmission.
Abstract: Wireless sensor networks can be used to measure and monitor many challenging problems and typically involve in monitoring, tracking and controlling areas such as battlefield monitoring, object tracking, habitat monitoring and home sentry systems. However, wireless sensor networks pose unique security challenges including forgery of sensor data, eavesdropping, denial of service attacks, and the physical compromise of sensor nodes. Node in a sensor networks may be vanished due to power exhaustion or malicious attacks. To expand the life span of the sensor network, a new node deployment is needed. In military scenarios, intruder may directly organize malicious nodes or manipulate existing nodes to set up malicious new nodes through many kinds of attacks. To avoid malicious nodes from joining the sensor network, a security is required in the design of sensor network protocols. In this paper, we proposed a security framework to provide a complete security solution against the known attacks in wireless sensor networks. Our framework accomplishes node authentication for new nodes with recognition of a malicious node. When deployed as a framework, a high degree of security is reachable compared with the conventional sensor network security solutions. A proposed framework can protect against most of the notorious attacks in sensor networks, and attain better computation and communication performance. This is different from conventional authentication methods based on the node identity. It includes identity of nodes and the node security time stamp into the authentication procedure. Hence security protocols not only see the identity of each node but also distinguish between new nodes and old nodes.
Abstract: In large Internet backbones, Service Providers
typically have to explicitly manage the traffic flows in order to
optimize the use of network resources. This process is often referred
to as Traffic Engineering (TE). Common objectives of traffic
engineering include balance traffic distribution across the network
and avoiding congestion hot spots. Raj P H and SVK Raja designed
the Bayesian network approach to identify congestion hors pots in
MPLS. In this approach for every node in the network the
Conditional Probability Distribution (CPD) is specified. Based on
the CPD the congestion hot spots are identified. Then the traffic can
be distributed so that no link in the network is either over utilized or
under utilized. Although the Bayesian network approach has been
implemented in operational networks, it has a number of well known
scaling issues.
This paper proposes a new approach, which we call the Pragati
(means Progress) Node Popularity (PNP) approach to identify the
congestion hot spots with the network topology alone. In the new
Pragati Node Popularity approach, IP routing runs natively over the
physical topology rather than depending on the CPD of each node as
in Bayesian network. We first illustrate our approach with a simple
network, then present a formal analysis of the Pragati Node
Popularity approach. Our PNP approach shows that for any given
network of Bayesian approach, it exactly identifies the same result
with minimum efforts. We further extend the result to a more
generic one: for any network topology and even though the network
is loopy. A theoretical insight of our result is that the optimal routing
is always shortest path routing with respect to some considerations of
hot spots in the networks.
Abstract: Wireless Mesh Networks (WMNs) are an emerging
technology for last-mile broadband access. In WMNs, similar to ad
hoc networks, each user node operates not only as a host but also as a
router. User packets are forwarded to and from an Internet-connected
gateway in multi-hop fashion. The WMNs can be integrated with
other networking technologies i.e. ad hoc networks, to implement a
smooth network extension. The meshed topology provides good
reliability and scalability, as well as low upfront investments. Despite
the recent start-up surge in WMNs, much research remains to be
done in standardizing the functional parameters of WMNs to fully
exploit their full potential. An edifice of the security concerns of
these networks is authentication of a new client joining an integrated
ad hoc network and such a scenario will require execution of a multihop
authentication technique. Our endeavor in this paper is to
introduce a secure authentication technique, with light over-heads
that can be conveniently implemented for the ad-hoc nodes forming
clients of an integrated WMN, thus facilitating their inter-operability.
Abstract: This paper proposes an analytical method for the
dynamics of generating firms- alliance networks along with business
phases. Dynamics in network developments have previously been
discussed in the research areas of organizational strategy rather than in
the areas of regional cluster, where the static properties of the
networks are often discussed. The analytical method introduces the
concept of business phases into innovation processes and uses
relationships called prior experiences; this idea was developed in
organizational strategy to investigate the state of networks from the
viewpoints of tradeoffs between link stabilization and node
exploration. This paper also discusses the results of the analytical
method using five cases of the network developments of firms. The
idea of Embeddedness helps interpret the backgrounds of the
analytical results. The analytical method is useful for policymakers of
regional clusters to establish concrete evaluation targets and a
viewpoint for comparisons of policy programs.
Abstract: Bandwidth allocation in wired network is less complex
and to allocate bandwidth in wireless networks is complex and
challenging, due to the mobility of source end system.This paper
proposes a new approach to bandwidth allocation to higher and lower
priority mobile nodes.In our proposal bandwidth allocation to new
mobile node is based on bandwidth utilization of existing mobile
nodes.The first section of the paper focuses on introduction to
bandwidth allocation in wireless networks and presents the existing
solutions available for allocation of bandwidth. The second section
proposes the new solution for the bandwidth allocation to higher and
lower priority nodes. Finally this paper ends with the analytical
evaluation of the proposed solution.
Abstract: Estimating the lifetime distribution of computer networks in which nodes and links exist in time and are bound for failure is very useful in various applications. This problem is known to be NP-hard. In this paper we present efficient combinatorial approaches to Monte Carlo estimation of network lifetime distribution. We also present some simulation results.
Abstract: In this paper, a mathematical model of human immunodeficiency
virus (HIV) is utilized and an optimization problem is
proposed, with the final goal of implementing an optimal 900-day
structured treatment interruption (STI) protocol. Two type of commonly
used drugs in highly active antiretroviral therapy (HAART),
reverse transcriptase inhibitors (RTI) and protease inhibitors (PI), are
considered. In order to solving the proposed optimization problem an
adaptive memetic algorithm with population management (AMAPM)
is proposed. The AMAPM uses a distance measure to control the
diversity of population in genotype space and thus preventing the
stagnation and premature convergence. Moreover, the AMAPM uses
diversity parameter in phenotype space to dynamically set the population
size and the number of crossovers during the search process.
Three crossover operators diversify the population, simultaneously.
The progresses of crossover operators are utilized to set the number
of each crossover per generation. In order to escaping the local optima
and introducing the new search directions toward the global optima,
two local searchers assist the evolutionary process. In contrast to
traditional memetic algorithms, the activation of these local searchers
is not random and depends on both the diversity parameters in
genotype space and phenotype space. The capability of AMAPM in
finding optimal solutions compared with three popular metaheurestics
is introduced.
Abstract: Wireless Sensor Networks (WSNs) are used to monitor/observe vast inaccessible regions through deployment of large number of sensor nodes in the sensing area. For majority of WSN applications, the collected data needs to be combined with geographic information of its origin to make it useful for the user; information received from remote Sensor Nodes (SNs) that are several hops away from base station/sink is meaningless without knowledge of its source. In addition to this, location information of SNs can also be used to propose/develop new network protocols for WSNs to improve their energy efficiency and lifetime. In this paper, range free localization protocols for WSNs have been proposed. The proposed protocols are based on weighted centroid localization technique, where the edge weights of SNs are decided by utilizing fuzzy logic inference for received signal strength and link quality between the nodes. The fuzzification is carried out using (i) Mamdani, (ii) Sugeno, and (iii) Combined Mamdani Sugeno fuzzy logic inference. Simulation results demonstrate that proposed protocols provide better accuracy in node localization compared to conventional centroid based localization protocols despite presence of unintentional radio frequency interference from radio frequency (RF) sources operating in same frequency band.
Abstract: The wireless adhoc network is comprised of wireless
node which can move freely and are connected among themselves
without central infrastructure. Due to the limited transmission range
of wireless interfaces, in most cases communication has to be relayed
over intermediate nodes. Thus, in such multihop network each node
(also called router) is independent, self-reliant and capable to route
the messages over the dynamic network topology. Various protocols
are reported in this field and it is very difficult to decide the best one.
A key issue in deciding which type of routing protocol is best for
adhoc networks is the communication overhead incurred by the
protocol. In this paper STAR a table driven and DSR on demand
protocols based on IEEE 802.11 are analyzed for their performance
on different performance measuring metrics versus varying traffic
CBR load using QualNet 5.0.2 network simulator.
Abstract: A mathematical model for the hydrodynamic
lubrication of parabolic slider bearings with couple stress lubricants
is presented. A numerical solution for the mathematical model using
finite element scheme is obtained using three nodes isoparametric
quadratic elements. Stiffness integrals obtained from the weak form
of the governing equations were solved using Gauss Quadrature to
obtain a finite number of stiffness matrices. The global system of
equations was obtained for the bearing and solved using Gauss Seidel
iterative scheme. The converged pressure solution was used to obtain
the load capacity of the bearing. Parametric studies were carried out
and it was shown that the effect of couple stresses and profile
parameter are to increase the load carrying capacity of the parabolic
slider bearing. Numerical experiments reveal that the magnitude of
the profile parameter at which maximum load is obtained increases
with decrease in couple stress parameter. The results are presented in
graphical form.
Abstract: In recent years, the research in wireless sensor
network has increased steadily, and many studies were focusing on
reducing energy consumption of sensor nodes to extend their lifetimes.
In this paper, the issue of energy consumption is investigated and two
adaptive mechanisms are proposed to extend the network lifetime.
This study uses high-energy-first scheme to determine cluster heads
for data transmission. Thus, energy consumption in each cluster is
balanced and network lifetime can be extended. In addition, this study
uses cluster merging and dynamic routing mechanisms to further
reduce energy consumption during data transmission. The simulation
results show that the proposed method can effectively extend the
lifetime of wireless sensor network, and it is suitable for different base
station locations.
Abstract: The paper is concerned with developing stochastic delay mechanisms for efficient multicast protocols and for smooth mobile handover processes which are capable of preserving a given Quality of Service (QoS). In both applications the participating entities (receiver nodes or subscribers) sample a stochastic timer and generate load after a random delay. In this way, the load on the networking resources is evenly distributed which helps to maintain QoS communication. The optimal timer distributions have been sought in different p.d.f. families (e.g. exponential, power law and radial basis function) and the optimal parameter have been found in a recursive manner. Detailed simulations have demonstrated the improvement in performance both in the case of multicast and mobile handover applications.
Abstract: Access control is a critical security service in Wire- less
Sensor Networks (WSNs). To prevent malicious nodes from joining
the sensor network, access control is required. On one hand, WSN
must be able to authorize and grant users the right to access to the
network. On the other hand, WSN must organize data collected by
sensors in such a way that an unauthorized entity (the adversary)
cannot make arbitrary queries. This restricts the network access only
to eligible users and sensor nodes, while queries from outsiders will
not be answered or forwarded by nodes. In this paper we presentee
different access control schemes so as to ?nd out their objectives,
provision, communication complexity, limits, etc. Using the node
density parameter, we also provide a comparison of these proposed
access control algorithms based on the network topology which can
be flat or hierarchical.
Abstract: In this paper, a new approach based on the extent of
friendship between the nodes is proposed which makes the nodes to
co-operate in an ad hoc environment. The extended DSR protocol is
tested under different scenarios by varying the number of malicious
nodes and node moving speed. It is also tested varying the number of
nodes in simulation used. The result indicates the achieved
throughput by extended DSR is greater than the standard DSR and
indicates the percentage of malicious drops over total drops are less
in the case of extended DSR than the standard DSR.
Abstract: Time varying network induced delays in networked
control systems (NCS) are known for degrading control system-s
quality of performance (QoP) and causing stability problems. In
literature, a control method employing modeling of communication
delays as probability distribution, proves to be a better method. This
paper focuses on modeling of network induced delays as probability
distribution.
CAN and MIL-STD-1553B are extensively used to carry periodic
control and monitoring data in networked control systems.
In literature, methods to estimate only the worst-case delays for
these networks are available. In this paper probabilistic network
delay model for CAN and MIL-STD-1553B networks are given.
A systematic method to estimate values to model parameters from
network parameters is given. A method to predict network delay in
next cycle based on the present network delay is presented. Effect of
active network redundancy and redundancy at node level on network
delay and system response-time is also analyzed.
Abstract: Transaction management is one of the most crucial requirements for enterprise application development which often require concurrent access to distributed data shared amongst multiple application / nodes. Transactions guarantee the consistency of data records when multiple users or processes perform concurrent operations. Existing Fault Tolerance Infrastructure for Mobile Agents (FTIMA) provides a fault tolerant behavior in distributed transactions and uses multi-agent system for distributed transaction and processing. In the existing FTIMA architecture, data flows through the network and contains personal, private or confidential information. In banking transactions a minor change in the transaction can cause a great loss to the user. In this paper we have modified FTIMA architecture to ensure that the user request reaches the destination server securely and without any change. We have used triple DES for encryption/ decryption and MD5 algorithm for validity of message.
Abstract: Octree compression techniques have been used
for several years for compressing large three dimensional data
sets into homogeneous regions. This compression technique
is ideally suited to datasets which have similar values in
clusters. Oil engineers represent reservoirs as a three dimensional
grid where hydrocarbons occur naturally in clusters. This
research looks at the efficiency of storing these grids using
octree compression techniques where grid cells are broken
into active and inactive regions. Initial experiments yielded
high compression ratios as only active leaf nodes and their
ancestor, header nodes are stored as a bitstream to file on
disk. Savings in computational time and memory were possible
at decompression, as only active leaf nodes are sent to the
graphics card eliminating the need of reconstructing the original
matrix. This results in a more compact vertex table, which can
be loaded into the graphics card quicker and generating shorter
refresh delay times.