This document summarizes a research paper that proposes using an ant colony optimization (ACO) algorithm to identify multiple optimal paths for data transmission in wireless sensor networks (WSNs). The algorithm is base-station driven, meaning the base station computes the optimal paths using ACO and communicates them to the sensor nodes. This approach overcomes limitations of traditional ACO routing by reducing communication overhead and identifying multiple optimal paths rather than just one. Simulation results show the proposed ACO approach finds shorter optimal paths compared to traditional ACO routing in WSNs.
Optimal path identification using ant colony optimisation in wireless sensor ...csandit
Wireless Sensor Network WSN is tightly constrained for energy, computational power and
memory. All applications of WSN require to forward data from remote sensor node SN to base
station BS. The path length and numbers of nodes in path by which data is forwarded affect the
basic performance of WSN. In this paper we present bio-Inspired Ant Colony Optimisation ACO
algorithm for Optimal path Identification OPI for packet transmission to communicate between
SN to BS. Our modified algorithm OPI using ACO considers the path length and the number of
hops in path for data packet transmission, with an aim to reduce communication overheads.
Stochastic analysis of random ad hoc networks with maximum entropy deploymentsijwmn
In this paper, we present the first stochastic analysis of the link performance of an ad hoc network modelled
by a single homogeneous Poisson point process (HPPP). According to the maximum entropy principle, the
single HPPP model is mathematically the best model for random deployments with a given node density.
However, previous works in the literature only consider a modified model which shows a discrepancy in the
interference distribution with the more suitable single HPPP model. The main contributions of this paper
are as follows. 1) It presents a new mathematical framework leading to closed form expressions of the
probability of success of both one-way transmissions and handshakes for a deployment modelled by a
single HPPP. Our approach, based on stochastic geometry, can be extended to complex protocols. 2) From
the obtained results, all confirmed by comparison to simulated data, optimal PHY and MAC layer
parameters are determined and the relations between them is described in details. 3) The influence of the
routing protocol on handshake performance is taken into account in a realistic manner, leading to the
confirmation of the intuitive result that the effect of imperfect feedback on the probability of success of a
handshake is only negligible for transmissions to the first neighbour node.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Packet Loss and Overlay Size Aware Broadcast in the Kademlia P2P SystemIDES Editor
Kademlia is a structured peer-to-peer (P2P)
application level network, which implements a distributed
hash table (DHT). Its key-value storage and lookup service is
made efficient and reliable by its well-designed binary tree
topology and dense mesh of connections between participant
nodes. While it can carry out data storage and retrieval in
logarithmic time if the key assigned to the value in question
is precisely known, no complex queries of any kind are
supported. In this article a broadcast algorithm for the
Kademlia network is presented, which can be used to
implement such queries. The replication scheme utilized is
compatible with the lookup algorithm of Kademlia, and it
uses the same routing tables. The reliability (coverage) of the
algorithm is increased by assigning the responsibility of
disseminating the broadcast message to many nodes at the
same time. The article presents a model validated with
simulation as well. The model can be used by nodes at runtime
to calculate the required level of replication for any desired
level of coverage. This calculation can take node churn, packet
loss ratio and the size of the overlay into account.
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Implementation of hybrid data collection (mobile element and hierarchical clu...IJARIIT
Wireless sensor network consider as real time embedded system deployed in a particular region to sense various types of
environmental parameters such as temperature, pressure, gas, humidity etc. The huge applications of WSN like habitant monitoring,
forest fire detection, surveillances, transport monitoring etc. have created a lot of interest among the researcher community in recent
past. Typically, WSNs are densely deployed in hazardous places where battery recharge or replacement is nearly impossible and
human monitoring scheme is highly risky.
Shortcut Path Tress for Zigbee based Wireless NetworkIJERA Editor
1) The document proposes a shortcut tree routing protocol for Zigbee wireless networks to provide near-optimal routing paths while maintaining the advantages of Zigbee tree routing such as low memory consumption and no route discovery overhead.
2) The shortcut tree routing protocol calculates remaining hops to the destination using both distance between nodes and link quality, selecting the path with the lowest "score" which is a function of distance and link quality.
3) Simulations show that the shortcut tree routing protocol provides performance comparable to AODV with only limited overhead of neighbor table maintenance, outperforming standard Zigbee tree routing.
Energy Efficient Dynamic Clustering using Mobile Sink in Wireless Sensor Netw...IJLT EMAS
Wireless Sensor Network (WSN) is a collection of small
sensor nodes in a geo-graphically distributed area to keep track
of physical or environmental conditions. If each node in the
network transmits the sensed data to the Base Station (BS), the
energy consumption is very high which directly affects the
network lifetime. By using clustering techniques, network
lifetime can be prolonged by making Cluster Head (CH) to
communicate with BS on behalf of other cluster members. We
have proposed a Mobile Sink (MS) scheme where the sink node
has more energy and resources compared to other sensor nodes.
The sink node moves near the clusters and gathers the sensed
data from the CH. Clustering is done and CHs are selected based
on the Residual Energy (RE) parameter. Simulation results and
analysis show that there is an improvement in throughput, delay,
packet delivery ratio with reduction in energy consumption
compared to schemes that use static sink or BS, where all the
CHs communicate the gathered data from the clusters members
to the static sink node. Thus mobile sink scheme increases the
network lifetime by reducing energy consumption.
Optimal path identification using ant colony optimisation in wireless sensor ...csandit
Wireless Sensor Network WSN is tightly constrained for energy, computational power and
memory. All applications of WSN require to forward data from remote sensor node SN to base
station BS. The path length and numbers of nodes in path by which data is forwarded affect the
basic performance of WSN. In this paper we present bio-Inspired Ant Colony Optimisation ACO
algorithm for Optimal path Identification OPI for packet transmission to communicate between
SN to BS. Our modified algorithm OPI using ACO considers the path length and the number of
hops in path for data packet transmission, with an aim to reduce communication overheads.
Stochastic analysis of random ad hoc networks with maximum entropy deploymentsijwmn
In this paper, we present the first stochastic analysis of the link performance of an ad hoc network modelled
by a single homogeneous Poisson point process (HPPP). According to the maximum entropy principle, the
single HPPP model is mathematically the best model for random deployments with a given node density.
However, previous works in the literature only consider a modified model which shows a discrepancy in the
interference distribution with the more suitable single HPPP model. The main contributions of this paper
are as follows. 1) It presents a new mathematical framework leading to closed form expressions of the
probability of success of both one-way transmissions and handshakes for a deployment modelled by a
single HPPP. Our approach, based on stochastic geometry, can be extended to complex protocols. 2) From
the obtained results, all confirmed by comparison to simulated data, optimal PHY and MAC layer
parameters are determined and the relations between them is described in details. 3) The influence of the
routing protocol on handshake performance is taken into account in a realistic manner, leading to the
confirmation of the intuitive result that the effect of imperfect feedback on the probability of success of a
handshake is only negligible for transmissions to the first neighbour node.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Packet Loss and Overlay Size Aware Broadcast in the Kademlia P2P SystemIDES Editor
Kademlia is a structured peer-to-peer (P2P)
application level network, which implements a distributed
hash table (DHT). Its key-value storage and lookup service is
made efficient and reliable by its well-designed binary tree
topology and dense mesh of connections between participant
nodes. While it can carry out data storage and retrieval in
logarithmic time if the key assigned to the value in question
is precisely known, no complex queries of any kind are
supported. In this article a broadcast algorithm for the
Kademlia network is presented, which can be used to
implement such queries. The replication scheme utilized is
compatible with the lookup algorithm of Kademlia, and it
uses the same routing tables. The reliability (coverage) of the
algorithm is increased by assigning the responsibility of
disseminating the broadcast message to many nodes at the
same time. The article presents a model validated with
simulation as well. The model can be used by nodes at runtime
to calculate the required level of replication for any desired
level of coverage. This calculation can take node churn, packet
loss ratio and the size of the overlay into account.
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Implementation of hybrid data collection (mobile element and hierarchical clu...IJARIIT
Wireless sensor network consider as real time embedded system deployed in a particular region to sense various types of
environmental parameters such as temperature, pressure, gas, humidity etc. The huge applications of WSN like habitant monitoring,
forest fire detection, surveillances, transport monitoring etc. have created a lot of interest among the researcher community in recent
past. Typically, WSNs are densely deployed in hazardous places where battery recharge or replacement is nearly impossible and
human monitoring scheme is highly risky.
Shortcut Path Tress for Zigbee based Wireless NetworkIJERA Editor
1) The document proposes a shortcut tree routing protocol for Zigbee wireless networks to provide near-optimal routing paths while maintaining the advantages of Zigbee tree routing such as low memory consumption and no route discovery overhead.
2) The shortcut tree routing protocol calculates remaining hops to the destination using both distance between nodes and link quality, selecting the path with the lowest "score" which is a function of distance and link quality.
3) Simulations show that the shortcut tree routing protocol provides performance comparable to AODV with only limited overhead of neighbor table maintenance, outperforming standard Zigbee tree routing.
Energy Efficient Dynamic Clustering using Mobile Sink in Wireless Sensor Netw...IJLT EMAS
Wireless Sensor Network (WSN) is a collection of small
sensor nodes in a geo-graphically distributed area to keep track
of physical or environmental conditions. If each node in the
network transmits the sensed data to the Base Station (BS), the
energy consumption is very high which directly affects the
network lifetime. By using clustering techniques, network
lifetime can be prolonged by making Cluster Head (CH) to
communicate with BS on behalf of other cluster members. We
have proposed a Mobile Sink (MS) scheme where the sink node
has more energy and resources compared to other sensor nodes.
The sink node moves near the clusters and gathers the sensed
data from the CH. Clustering is done and CHs are selected based
on the Residual Energy (RE) parameter. Simulation results and
analysis show that there is an improvement in throughput, delay,
packet delivery ratio with reduction in energy consumption
compared to schemes that use static sink or BS, where all the
CHs communicate the gathered data from the clusters members
to the static sink node. Thus mobile sink scheme increases the
network lifetime by reducing energy consumption.
This document summarizes an article from the International Journal of Electronics and Communication Engineering & Technology. The article derives an exact upper bound on the bit error rate of the decode-and-forward cooperation protocol for wireless relay networks. The destination uses maximum a posteriori decoding to optimally estimate the data sent from the source. The complexity arises because the data received at the destination does not have equal a priori probabilities due to potential errors in the source-to-relay link. Numerical results show that the derived upper bound is very tight. The closed-form expression of the upper bound can be used to fully study and understand the diversity performance of the decode-and-forward protocol.
A Survey on Rendezvous Based Techniques for Power Conservation in Wireless Se...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
Improved Performance of LEACH using Better CH Selection by Weighted Parametersijsrd.com
In recent era, the research for improving the performance of the WSN is done in the 'speed of light'. LEACH is the protocol which has changed the scenario of using WSN for any application like monitoring physical parameters, measuring parameters surveillance etc. Also LEACH-C can be used for the same with some modifications in LEACH like deciding CH centrally in fixed amount. But there is a con of LEACH; it decides the CH based on random generation value. Therefore, in proposed scheme, threshold is calculated using weighted parameter of residual energy and distance from the base station.
Trilateration-based localization (TBL) has become a corner stone of modern technology. This study
formulates the concern on how wireless sensor networks can take advantage of the computational
intelligent techniques using both single- and multi-objective particle swarm optimization (PSO) with an
overall aim of concurrently minimizing the required time for localization, minimizing energy consumed
during localization, and maximizing the number of nodes fully localized through the adjustment of wireless
sensor transmission ranges while using TBL process. A parameter-study of the applied PSO variants is
performed, leading to results that show algorithmic improvements of up to 32% in the evaluated objectives.
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s
lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
Investigation and Analysis of SNR Estimation in OFDM systemIOSR Journals
Estimation of signal to noise ratio (SNR) of received signal and to transmit the signal effectively for
the modern communication system. The performance of existing non-data-aided (NDA) SNR estimation methods
are substantially degraded for high level modulation scheme such as M-ary amplitude and phase shift keying
(APSK) or quadrature amplitude modulation (QAM).In this paper SNR estimation proposed method which uses
zero point auto-correlation of received signal per block and auto/cross- correlation of decision feedback signal
in orthogonal frequency division multiplexing (OFDM) system. Proposed method can be studied into two types;
Type 1 can estimate SNR by zero point auto-correlation of decision feedback signal based on the second
moment property. Type 2 uses both zero point auto-correlation and cross-correlation based on the fourth
moment property. In block-by-block reception of OFDM system, these two SNR estimation methods can be
possible for the practical implementation due to correlation based the estimation method and they show more
stable estimation performance than the earlier SNR estimation methods.
Performance Evaluation of DV-HOP and Amorphous Algorithms based on Localizati...TELKOMNIKA JOURNAL
In the field of high-risk observation, the nodes in Wireless Sensor Network (WSN) are distributed
randomly. The result from sensing becomes meaningless if it is not known from where the originating node
is. Therefore, a sensor node positioning scheme, known as the localization scheme, is required. The
localization scheme consists of distance estimation and position computing. Thus, this research used
connectivity as distance estimation within range free algorithm DV-Hop and Amorphous, and then trilateral
algorithm for computing the position. Besides that, distance estimation using the connectivity between
nodes is not needed for the additional hardware ranging as required by a range-based localization
scheme. In this research compared the localization algorithm based on range free localization, which are
DV-Hop algorithm and Amorphous algorithm. The simulation result shows that the amorphous alg orithm
have achieved 13.60% and 24.538% lower than dv-hop algorithm for each parameter error localization and
energy consumption. On node density variations, dv-hop algorithm gained a localization error that is
26.95% lower than amorphous algorithm, but for energy consumption parameter, amorphous gained
14.227% lower than dv-hop algorithm. In the communication range variation scenario, dv-hop algorithm
gained a localization error that is50.282% lower than amorphous. However, for energy consumption
parameter, amorphous algorithm gained 12.35%. lower than dv-hop algorithm.
A Novel Algorithm for Cooperative Spectrum Sensing in Cognitive Radio NetworksIJAEMSJORNAL
The rapid growth in wireless communication technology has led to a scarcity of spectrum. But, studies are saying that licensed spectrum is underutilized. Cognitive Radio Networks (CRNs) seem to be a promising solution to this problem by allowing unlicensed users to access the unused spectrum opportunistically. In this paper we proposed a novel spectrum sensing algorithm to improve the probabilities of detection and false alarm in a CRN, using the traditional techniques of energy and first order correlation detection. Results show a significant improvement in performance in cooperative spectrum sensing.
A QUANTITATIVE ANALYSIS OF HANDOVER TIME AT MAC LAYER FOR WIRELESS MOBILE NET...ijwmn
Extensive studies have been carried out for reducing the handover time of wireless mobile network at
medium access control (MAC) layer. However, none of them show the impact of reduced handover time
on the overall performance of wireless mobile networks. This paper presents a quantitative analysis to
show the impact of reduced handover time on the performance of wireless mobile networks. The proposed
quantitative model incorporates many critical performance parameters involve in reducing the handover
time for wireless mobile networks. In addition, we analyze the use of active scanning technique with
comparatively shorter beacon interval time in a handoff process. Our experiments verify that the active
scanning can reduce the overall handover time at MAC layer if comparatively shorter beacon intervals are
utilized for packet transmission. The performance measures adopted in this paper for experimental
verifications are network throughput under different network loads.
False Node Recovery Algorithm for a Wireless Sensor NetworkRadita Apriana
This paper proposes a fault node recovery algorithm to enhance the lifetime of a wireless sensor
network when some of the sensor nodes shut down. The algorithm is based on the grade diffusion algorithm
combined with the genetic algorithm. The algorithm can result in fewer replacements of sensor nodes and
more reused routing paths. In our simulation, the proposed algorithm increases the number of active nodes
up to 8.7 times, reduces 98.8%, and reduces the rate of energy consumption by approximately 31.1%.
This document analyzes the performance of the first-fit wavelength assignment algorithm in optical networks. It proposes a new analytical technique to calculate the blocking probability of a source-destination pair taking into account wavelength correlation and load correlation between links. The model is accurate even with a large number of wavelengths. It first calculates the probabilities that wavelengths are used on individual links and paths. Then it establishes a wavelength correlation model to calculate the blocking probability on a given path based on the wavelength usage probabilities of each link along the path.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Analyzing the performance of the dynamicIJCNCJournal
In this paper, we are focused to analyse the performance of the two dimensional dynamic
Position Location and Tracking (PL&T) of mobile nodes. The architecture of the dynamic PL&T
is developed based on determining the potential zone of the target node (s) and then tracking
using the triangulation. We assume that the nodes are mobile and have one omnidirectional
antenna per node. The network architecture under consideration is cluster based Mobile Ad Hoc
Network (MANET) where at an instance of time, three nodes are used as reference nodes to track
target node(s) using triangulation method. The novel approach in this PL&T tracking method is
the “a priori” identification of the zone of the target node(s) within a circle with a reasonable
radios, and then placing the three reference nodes for the zone such that a good geometry is
created between the reference nodes and the target nodes to improve the accuracy of
triangulation method. The geometry of the reference nodes’ triangle is closer to equilateral
triangle and all potential target nodes are inside the circle. We establish the fact that when the
target node is moving linearly, the predictive method of zone finding is sufficient to track the
target node accurately. However, when the target node changes the direction, the predictive
method of zone finding will fail and we need to place the three references outside the zone such
that proper geometry with no one angle is less than 30 degrees is maintained to get accurate
PL&T location of the target node at each instance of time. The new zone is always formed for
each instance of time prior to triangulation.
In this paper, we demonstrate the accuracy of integrated zone finding and triangulation for
detecting the PL&T location the node at each instance of time within 1.5 foot accuracy. It should
be noted that as the target node is tracked continuously by applying the integrated zone finding
and triangulation algorithm at different instances of time, one foot accuracy can no longer be
maintained. Periodically, the good PL&T data on each node has to be established by
reinitializing the PL&T locations of the nodes including those that are used as reference nodes.
In this paper, the performance of the dynamic PL&T system is derived using Additive White
Gaussian Noise (AWGN) channel; and using AWGN plus Multi-path fading channel. The impact
of multipath fading on tracking accuracy is analysed using Rician Fading channel for MANET
applications outdoors. Our real time simulations show the PL&T tracking accuracy for the
mobile target nodes in both cases to be within 1.5 foot accuracy.
Route Reservation In Adhoc Wireless NetworksIJRES Journal
this paper deals with whether and when Reservation Based (RB) communication can yield better delay performance than NRB Communication in Ad hoc Wireless Networks. In addition to posing this fundamental question (in terms of route discovery, MAC protocol and pipelining etc), the requirements for making RB switching superior to NRB switching are also identified. While the conventional wisdom in current adhoc wireless networking research favours NRB switching, when and under which conditions RB switching might be preferable. Even under these strict and futuristic conditions, while RB switching provide a better delay performances, NRB switching can generally achieve higher network good put and throughput. It is important to understand that if these conditions are not satisfied, then NRB switching will be probable preferable. A novel analytical framework is developed and the network performance under both schemes is quantified. This advantage comes at the expense of lower throughput and goodput compared to NRB schemes.
The document discusses and compares different topologies for wireless sensor networks to optimize energy efficiency and network lifetime. It analyzes hexagon, square, triangle, and strip-based topologies based on coverage area, sensing strength, reliability, and energy consumption. Strip-based topology provides the maximum coverage area using the fewest nodes and least energy consumption. Triangle-based topology offers the best reliability and sensing strength at the cost of coverage area and energy. The document also examines routing protocols that use local information to minimize hop count and data streams for maximizing total and minimum node energy.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
Spatial multiplexing ofdmoqam systems with time reversal techniqueijwmn
Orthogonal Frequency Division Multiplexing with Offset Quadrature Amplitude Modulation (OFDM/OQAM) is a multicarrier modulation scheme that can be considered as an alternative to the conventional Orthogonal Frequency Division Multiplexing (OFDM) with Cyclic Prefix (CP) for transmission over multipath fading channels. In this paper, we investigate the combination of the OFDM/OQAM with Multiple Input Multiple Output (MIMO) system with Time Reversal (TR) technique.
TR can be viewed as a precoding scheme which can be combined with OFDM/OQAM and easily carried out in a MIMO context using spatial data multiplexing.
We present the simulation results of the performance of OFDM/OQAM system in SISO case compared with the conventional CP-OFDM system and the performance of the combination MIMO-OFDM/OQAM with TR compared to MIMO-CP-OFDM. The performance is derived by computing the Bit Error Rate (BER) as a function of the transmit signal-to-noise ratio (SNR).
P ERFORMANCE A NALYSIS O F A DAPTIVE N OISE C ANCELLER E MPLOYING N LMS A LG...ijwmn
n voice communication systems, noise cancellation
using adaptive digital filter is a renowned techniq
ue
for extracting desired speech signal through elimin
ating noise from the speech signal corrupted by noi
se.
In this paper, the performance of adaptive noise ca
nceller of Finite Impulse Response (FIR) type has b
een
analysed employing NLMS (Normalized Least Mean Squa
re) algorithm.
An extensive study has been made
to investigate the effects of different parameters,
such as number of filter coefficients, number of s
amples,
step size, and input noise level, on the performanc
e of the adaptive noise cancelling system. All the
results
have been obtained using computer simulations built
on MATLAB platform.
WIRELESS MESH NETWORKS CAPACITY IMPROVEMENT USING CBF ijwmn
Wireless mesh network has recently received a great deal of attention as a promising technology to provideubiquitous high bandwidth access for a large number of users. Such network may face a significant broadcast traffic that may consequently degrade the network reliability.
In this paper, we have focused interest to wireless mesh network based IEEE 802.11s and we have designed
a self-pruning method to control and reduce the broadcast traffic forwarding. Our scheme, namely Control of Broadcast Forwarding (CBF), defines two behaviours to manage the broadcasting operation. Routing
packets are managed differently from data broadcast messages to avoid afflicting the routing process.
The simulations results show that CBF ameliorates the network capacity by reducing considerably the
number of redundant packets, improving the end to end delay and providing high reachability and packet
delivery ration.
This document summarizes an article from the International Journal of Electronics and Communication Engineering & Technology. The article derives an exact upper bound on the bit error rate of the decode-and-forward cooperation protocol for wireless relay networks. The destination uses maximum a posteriori decoding to optimally estimate the data sent from the source. The complexity arises because the data received at the destination does not have equal a priori probabilities due to potential errors in the source-to-relay link. Numerical results show that the derived upper bound is very tight. The closed-form expression of the upper bound can be used to fully study and understand the diversity performance of the decode-and-forward protocol.
A Survey on Rendezvous Based Techniques for Power Conservation in Wireless Se...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
Improved Performance of LEACH using Better CH Selection by Weighted Parametersijsrd.com
In recent era, the research for improving the performance of the WSN is done in the 'speed of light'. LEACH is the protocol which has changed the scenario of using WSN for any application like monitoring physical parameters, measuring parameters surveillance etc. Also LEACH-C can be used for the same with some modifications in LEACH like deciding CH centrally in fixed amount. But there is a con of LEACH; it decides the CH based on random generation value. Therefore, in proposed scheme, threshold is calculated using weighted parameter of residual energy and distance from the base station.
Trilateration-based localization (TBL) has become a corner stone of modern technology. This study
formulates the concern on how wireless sensor networks can take advantage of the computational
intelligent techniques using both single- and multi-objective particle swarm optimization (PSO) with an
overall aim of concurrently minimizing the required time for localization, minimizing energy consumed
during localization, and maximizing the number of nodes fully localized through the adjustment of wireless
sensor transmission ranges while using TBL process. A parameter-study of the applied PSO variants is
performed, leading to results that show algorithmic improvements of up to 32% in the evaluated objectives.
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s
lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
Investigation and Analysis of SNR Estimation in OFDM systemIOSR Journals
Estimation of signal to noise ratio (SNR) of received signal and to transmit the signal effectively for
the modern communication system. The performance of existing non-data-aided (NDA) SNR estimation methods
are substantially degraded for high level modulation scheme such as M-ary amplitude and phase shift keying
(APSK) or quadrature amplitude modulation (QAM).In this paper SNR estimation proposed method which uses
zero point auto-correlation of received signal per block and auto/cross- correlation of decision feedback signal
in orthogonal frequency division multiplexing (OFDM) system. Proposed method can be studied into two types;
Type 1 can estimate SNR by zero point auto-correlation of decision feedback signal based on the second
moment property. Type 2 uses both zero point auto-correlation and cross-correlation based on the fourth
moment property. In block-by-block reception of OFDM system, these two SNR estimation methods can be
possible for the practical implementation due to correlation based the estimation method and they show more
stable estimation performance than the earlier SNR estimation methods.
Performance Evaluation of DV-HOP and Amorphous Algorithms based on Localizati...TELKOMNIKA JOURNAL
In the field of high-risk observation, the nodes in Wireless Sensor Network (WSN) are distributed
randomly. The result from sensing becomes meaningless if it is not known from where the originating node
is. Therefore, a sensor node positioning scheme, known as the localization scheme, is required. The
localization scheme consists of distance estimation and position computing. Thus, this research used
connectivity as distance estimation within range free algorithm DV-Hop and Amorphous, and then trilateral
algorithm for computing the position. Besides that, distance estimation using the connectivity between
nodes is not needed for the additional hardware ranging as required by a range-based localization
scheme. In this research compared the localization algorithm based on range free localization, which are
DV-Hop algorithm and Amorphous algorithm. The simulation result shows that the amorphous alg orithm
have achieved 13.60% and 24.538% lower than dv-hop algorithm for each parameter error localization and
energy consumption. On node density variations, dv-hop algorithm gained a localization error that is
26.95% lower than amorphous algorithm, but for energy consumption parameter, amorphous gained
14.227% lower than dv-hop algorithm. In the communication range variation scenario, dv-hop algorithm
gained a localization error that is50.282% lower than amorphous. However, for energy consumption
parameter, amorphous algorithm gained 12.35%. lower than dv-hop algorithm.
A Novel Algorithm for Cooperative Spectrum Sensing in Cognitive Radio NetworksIJAEMSJORNAL
The rapid growth in wireless communication technology has led to a scarcity of spectrum. But, studies are saying that licensed spectrum is underutilized. Cognitive Radio Networks (CRNs) seem to be a promising solution to this problem by allowing unlicensed users to access the unused spectrum opportunistically. In this paper we proposed a novel spectrum sensing algorithm to improve the probabilities of detection and false alarm in a CRN, using the traditional techniques of energy and first order correlation detection. Results show a significant improvement in performance in cooperative spectrum sensing.
A QUANTITATIVE ANALYSIS OF HANDOVER TIME AT MAC LAYER FOR WIRELESS MOBILE NET...ijwmn
Extensive studies have been carried out for reducing the handover time of wireless mobile network at
medium access control (MAC) layer. However, none of them show the impact of reduced handover time
on the overall performance of wireless mobile networks. This paper presents a quantitative analysis to
show the impact of reduced handover time on the performance of wireless mobile networks. The proposed
quantitative model incorporates many critical performance parameters involve in reducing the handover
time for wireless mobile networks. In addition, we analyze the use of active scanning technique with
comparatively shorter beacon interval time in a handoff process. Our experiments verify that the active
scanning can reduce the overall handover time at MAC layer if comparatively shorter beacon intervals are
utilized for packet transmission. The performance measures adopted in this paper for experimental
verifications are network throughput under different network loads.
False Node Recovery Algorithm for a Wireless Sensor NetworkRadita Apriana
This paper proposes a fault node recovery algorithm to enhance the lifetime of a wireless sensor
network when some of the sensor nodes shut down. The algorithm is based on the grade diffusion algorithm
combined with the genetic algorithm. The algorithm can result in fewer replacements of sensor nodes and
more reused routing paths. In our simulation, the proposed algorithm increases the number of active nodes
up to 8.7 times, reduces 98.8%, and reduces the rate of energy consumption by approximately 31.1%.
This document analyzes the performance of the first-fit wavelength assignment algorithm in optical networks. It proposes a new analytical technique to calculate the blocking probability of a source-destination pair taking into account wavelength correlation and load correlation between links. The model is accurate even with a large number of wavelengths. It first calculates the probabilities that wavelengths are used on individual links and paths. Then it establishes a wavelength correlation model to calculate the blocking probability on a given path based on the wavelength usage probabilities of each link along the path.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Analyzing the performance of the dynamicIJCNCJournal
In this paper, we are focused to analyse the performance of the two dimensional dynamic
Position Location and Tracking (PL&T) of mobile nodes. The architecture of the dynamic PL&T
is developed based on determining the potential zone of the target node (s) and then tracking
using the triangulation. We assume that the nodes are mobile and have one omnidirectional
antenna per node. The network architecture under consideration is cluster based Mobile Ad Hoc
Network (MANET) where at an instance of time, three nodes are used as reference nodes to track
target node(s) using triangulation method. The novel approach in this PL&T tracking method is
the “a priori” identification of the zone of the target node(s) within a circle with a reasonable
radios, and then placing the three reference nodes for the zone such that a good geometry is
created between the reference nodes and the target nodes to improve the accuracy of
triangulation method. The geometry of the reference nodes’ triangle is closer to equilateral
triangle and all potential target nodes are inside the circle. We establish the fact that when the
target node is moving linearly, the predictive method of zone finding is sufficient to track the
target node accurately. However, when the target node changes the direction, the predictive
method of zone finding will fail and we need to place the three references outside the zone such
that proper geometry with no one angle is less than 30 degrees is maintained to get accurate
PL&T location of the target node at each instance of time. The new zone is always formed for
each instance of time prior to triangulation.
In this paper, we demonstrate the accuracy of integrated zone finding and triangulation for
detecting the PL&T location the node at each instance of time within 1.5 foot accuracy. It should
be noted that as the target node is tracked continuously by applying the integrated zone finding
and triangulation algorithm at different instances of time, one foot accuracy can no longer be
maintained. Periodically, the good PL&T data on each node has to be established by
reinitializing the PL&T locations of the nodes including those that are used as reference nodes.
In this paper, the performance of the dynamic PL&T system is derived using Additive White
Gaussian Noise (AWGN) channel; and using AWGN plus Multi-path fading channel. The impact
of multipath fading on tracking accuracy is analysed using Rician Fading channel for MANET
applications outdoors. Our real time simulations show the PL&T tracking accuracy for the
mobile target nodes in both cases to be within 1.5 foot accuracy.
Route Reservation In Adhoc Wireless NetworksIJRES Journal
this paper deals with whether and when Reservation Based (RB) communication can yield better delay performance than NRB Communication in Ad hoc Wireless Networks. In addition to posing this fundamental question (in terms of route discovery, MAC protocol and pipelining etc), the requirements for making RB switching superior to NRB switching are also identified. While the conventional wisdom in current adhoc wireless networking research favours NRB switching, when and under which conditions RB switching might be preferable. Even under these strict and futuristic conditions, while RB switching provide a better delay performances, NRB switching can generally achieve higher network good put and throughput. It is important to understand that if these conditions are not satisfied, then NRB switching will be probable preferable. A novel analytical framework is developed and the network performance under both schemes is quantified. This advantage comes at the expense of lower throughput and goodput compared to NRB schemes.
The document discusses and compares different topologies for wireless sensor networks to optimize energy efficiency and network lifetime. It analyzes hexagon, square, triangle, and strip-based topologies based on coverage area, sensing strength, reliability, and energy consumption. Strip-based topology provides the maximum coverage area using the fewest nodes and least energy consumption. Triangle-based topology offers the best reliability and sensing strength at the cost of coverage area and energy. The document also examines routing protocols that use local information to minimize hop count and data streams for maximizing total and minimum node energy.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
Spatial multiplexing ofdmoqam systems with time reversal techniqueijwmn
Orthogonal Frequency Division Multiplexing with Offset Quadrature Amplitude Modulation (OFDM/OQAM) is a multicarrier modulation scheme that can be considered as an alternative to the conventional Orthogonal Frequency Division Multiplexing (OFDM) with Cyclic Prefix (CP) for transmission over multipath fading channels. In this paper, we investigate the combination of the OFDM/OQAM with Multiple Input Multiple Output (MIMO) system with Time Reversal (TR) technique.
TR can be viewed as a precoding scheme which can be combined with OFDM/OQAM and easily carried out in a MIMO context using spatial data multiplexing.
We present the simulation results of the performance of OFDM/OQAM system in SISO case compared with the conventional CP-OFDM system and the performance of the combination MIMO-OFDM/OQAM with TR compared to MIMO-CP-OFDM. The performance is derived by computing the Bit Error Rate (BER) as a function of the transmit signal-to-noise ratio (SNR).
P ERFORMANCE A NALYSIS O F A DAPTIVE N OISE C ANCELLER E MPLOYING N LMS A LG...ijwmn
n voice communication systems, noise cancellation
using adaptive digital filter is a renowned techniq
ue
for extracting desired speech signal through elimin
ating noise from the speech signal corrupted by noi
se.
In this paper, the performance of adaptive noise ca
nceller of Finite Impulse Response (FIR) type has b
een
analysed employing NLMS (Normalized Least Mean Squa
re) algorithm.
An extensive study has been made
to investigate the effects of different parameters,
such as number of filter coefficients, number of s
amples,
step size, and input noise level, on the performanc
e of the adaptive noise cancelling system. All the
results
have been obtained using computer simulations built
on MATLAB platform.
WIRELESS MESH NETWORKS CAPACITY IMPROVEMENT USING CBF ijwmn
Wireless mesh network has recently received a great deal of attention as a promising technology to provideubiquitous high bandwidth access for a large number of users. Such network may face a significant broadcast traffic that may consequently degrade the network reliability.
In this paper, we have focused interest to wireless mesh network based IEEE 802.11s and we have designed
a self-pruning method to control and reduce the broadcast traffic forwarding. Our scheme, namely Control of Broadcast Forwarding (CBF), defines two behaviours to manage the broadcasting operation. Routing
packets are managed differently from data broadcast messages to avoid afflicting the routing process.
The simulations results show that CBF ameliorates the network capacity by reducing considerably the
number of redundant packets, improving the end to end delay and providing high reachability and packet
delivery ration.
Analyse Performance of Fractional Fourier Transform on Timing and Carrier Fr...ijwmn
This paper deals with the performance of the use of fractional Fourier transform (FRFT) instead of
conventional Fourier transform (FFT) in either symbol timing offset (STO) and carrier frequency offset
(CFO) estimation. Orthogonal frequency division multiplexing is widely used in many systems due to
advantages of theses technique compared with mono-carrier systems. In spite of his advantages, OFDM
presents drawbacks such as sensitivity to timing and frequency offsets. Many techniques are used in the
literature to estimate these two parameters in order to compensate them (synchronization task). These
techniques used conventional Fourier transform. In this paper, we are interested in estimating STO and
CFO using fractional Fourier transform. Monte Carlo simulation demonstrates the performance of the use
of FRFT instead of FFT.
Long-Term Evolution (LTE), an emerging and promising fourth generation mobile technology, is expected
to offer ubiquitous broadband access to the mobile subscribers. In this paper, the performance of Frame
Level Scheduler (FLS), Exponential (EXP) rule, Logarithmic (LOG) rule and Maximum-Largest Weighted
Delay First (M-LWDF) packet scheduling algorithms has been studied in the downlink 3GPP LTE cellular
network. To this aim, a single cell with interference scenario has been considered. The performance
evaluation is made by varying the number of UEs ranging from 10 to 50 (Case 1) and user speed in the
range of [3, 120] km/h (Case 2). Results show that while the number of UEs and user speed increases, the
performance of the considered scheduling schemes degrades and in both case FLS outperforms other three
schemes in terms of several performance indexes such as average throughput, packet loss ratio (PLR),
packet delay and fairness index.
Zigbee based wearable remote healthcare monitoring system for elderly patientsijwmn
Remote health care monitoring system (RHCMS) has drawn considerable attentions for the last decade. As
the aging population are increasing and at the same time the health care cost is skyrocketing there has
been a need to monitor a patient from a remote location. Moreover, many people of the World are out of
the reach of existing healthcare systems. To solve these problems many research and commercial versions
of RHCMS have been proposed and implemented till now. In these systems the performance was the main
issue in order to accurately measure, record, and analyze patients’ data. With the ascent of wireless
network RHCMS can be widely deployed to monitor the health condition of a patient inside and outside of
the hospitals. In this work we present a ZigBee based wireless healthcare monitoring system that can
provide real time online information about the health condition of a patient. The proposed system is able to
send alarming messages to the healthcare professional about the patient’s critical condition. In addition
the proposed system can send reports to a patient monitoring system, which can be used by the healthcare
professionals to make necessary medical advices from anywhere of the World at any time.
COMP-JT WITH DYNAMIC CELL SELECTION, GLOBAL PRECODING MATRIX AND IRC RECEIVER...ijwmn
Coordinated multi-point transmission and reception (CoMP) is introduced in LTE-A to mitigate co-channel
interference and improve the cell-edge user experience. In this paper we propose a joint transmission
scheme for LTE-CoMP and we enhance the performance of CoMP with two techniques: 1- dynamic MIMO
cell selection and 2- closed loop MIMO with global precoding matrix selection. A cell-edge user selects the
base stations that jointly transmit the desired signal from the available ones (we assumed 3). The user also
selects the closed loop precoding matrices for MIMO in a joint fashion to fit the independent MIMO
channels from two base stations (eNBs). In addition, edge users are likely to be subject to severe Cochannel
interference from eNBs outside the joint transmission set.To address co-channel interference from
the base station(s) that are not included in CoMP joint transmission set, the user equipment employs
Minimum Mean Squared Error receiver with Interference Rejection Combining (MMSE-IRC). We illustrate
the effect of fading correlation between elements of the transmit and receive antennas. Also, the effect of
the desired to interference eNB power ratio in case of medium correlation for 3 and 4 layers using MMSEIRC
receiver is studied. Also we compare the BER performance for 3 and 4 layers in case of different values of the desired to interference eNB power ratio. Simulation results show that the performance of CoMP with cell selection considerably improves the performance. Also, global selection of the precoding matrices outperforms local selection. In addition, using MMSE-IRC gives much better performance than the conventional minimum mean square error (MMSE) in the presence of co-channel interference.
A new channel coding technique to approach the channel capacityijwmn
After Shannon’s 1948 channel coding theorem, we have witnessed many channel coding techniques developed to achieve the Shannon limit. A wide range of channel codes is available with different complexity levels and error correction performance. Many powerful coding schemes have been deployed in the power-limited Additive White Gaussian Noise (AWGN) channel. However, it seems like we have arrived at an end of advancement path, for most of the existing channel codes. This article introduces a new coding technique that can either be used as the last coding stage of concatenated coding scheme or in parallel configuration with other powerful channel codes to achieve reliable error performance with moderately complex decoding. We will go through an example to understand the overall approach of the proposed coding technique, and finally we will look at some simulation results over an AWGN channel to demonstrate its potential.
Opportunistic and playback sensitive scheduling for video streamingijwmn
Given the strict Quality of Service (QoS) requirements of video streaming, this paper proposes a novel
solution for simultaneous streaming of multiple video sessions over a mobile cellular system. The proposed
solution combines a buffer management strategy with a packet scheduling algorithm. The buffer
management strategy selectively discards packets of a user from base station buffer whereas the packet
scheduling algorithm schedules packets of a user according to its instantaneous channel quality, average
throughput and playback buffer information. Simulation results demonstrate that the proposed solution is
effective in providing a continuous video playback with good perceptual quality for more users. If at least a
good perceptual quality is to be satisfied for all users (QoS constraint of video streaming), then the
proposed solution improves the system capacity by 40% over a conventional packet scheduling algorithm.
An educational bluetooth quizzing application in androidijwmn
Bluetooth is one of the most prevalent technologies available on mobile phones. One of the key questions
how to harness this technology in an educational manner in universities and schools. This paper is about a
Bluetooth quizzing system which will be used to administer quizzes to students of a university. The
Bluetooth quizzing application consists of a server and client mobile Android application. It will utilize a
queuing system to allow many clients to connect simultaneously to the server. When clients connect, they
can register or choose the option to complete a quiz that the lecturer selected. Results are automatically
sent when quiz is done from the client application. Data analysis can then be done to review the progress of
students.
The four basic Radio Resource Management (RRM) measurements in Long Term Evolution (LTE) system
are Channel Quality Indicator (CQI), Reference Signal Received Power (RSRP), Reference Signal
Received Quality (RSRQ), and Carrier Received Signal Strength Indicator (RSSI). A measurement of channel quality represented by Signal to Interference plus Noise Ratio (SINR) is used for link adaptation along with packet scheduling, whereas RSRP and RSRQ are needed for making handover decision during intra-eUTRAN (evolved Universal Terrestrial Random Access Network) handover in LTE. In this paper,
some practical measurement results recorded from a live LTE network of Australia using a commercial measurement tool namely NEMO Handy are analysed to verify the possible relationships among SINR, RSRP, RSSI and RSRQ as well as to evaluate the effects of SNR on throughput. In addition, the intraeUTRAN handover events occurred during the test period within the test area are studied. The analysis
yields some useful information such as: if the SINR is good for a measurement slot, higher throughput is
achieved; RSRP and SNR are proportional to each other on average; and lesser is the difference between
RSSI and RSRP, better is the RSRQ – each of which is consistent with theory. All the measurement results
are evaluated using computer programs built on MATLAB platform.
Elgamal signature for content distribution with network codingijwmn
This document proposes a scheme that uses ElGamal signature in network coding to enhance security. Network coding allows nodes to generate output packets as linear combinations of input packets. However, this makes the network vulnerable to pollution attacks where malicious nodes can insert corrupted packets. The proposed scheme signs data packets with ElGamal signatures. When nodes receive packets, they can verify the signatures' validity to check for corrupted packets without decoding. The scheme exploits the linearity of network coding and allows nodes to easily check packet integrity. An example is provided to demonstrate how the ElGamal signature scheme would work in the context of network coding for content distribution.
Advanced antenna techniques and high order sectorization with novel network t...ijwmn
Mobile operators commonly use macro cells with trad
itional wide beam antennas for wider coverage in th
e
cell, but future capacity demands cannot be achieve
d by using them only. It is required to achieve max
imum
practical capacity from macro cells by employing hi
gher order sectorization and by utilizing all possi
ble
antenna solutions including smart antennas. This pa
per presents enhanced tessellation for 6-sector sit
es
and proposes novel layout for 12-sector sites. The
main target of this paper is to compare the perform
ance
of conventional wide beam antenna, switched beam sm
art antenna, adaptive beam antenna and different
network layouts in terms of offering better receive
d signal quality and user throughput. Splitting mac
ro cell
into smaller micro or pico cells can improve the ca
pacity of network, but this paper highlights the
importance of higher order sectorization and advanc
e antenna techniques to attain high Signal to
Interference plus Noise Ratio (SINR), along with im
proved network capacity. Monte Carlo simulations a
t
system level were done for Dual Cell High Speed Dow
nlink Packet Access (DC-HSDPA) technology with
multiple (five) users per Transmission Time Interva
l (TTI) at different Intersite Distance (ISD). The
obtained results validate and estimate the gain of
using smart antennas and higher order sectorization
with
proposed network layout.
Mobile elements scheduling for periodic sensor applicationsijwmn
In this paper, we investigate the problem of designing the mobile elements tours such that the length of each tour is below a per-determined length and the depth of the multi-hop routing trees bounded by k. The path of the mobile element is designed to visit subset of the nodes (cache points). These cache points store other nodes data. To address this problem, we propose two heuristic-based solutions. Our solutions take into consideration the distribution of the nodes during the establishment of the tour. The results of our experiments indicate that our schemes significantly outperforms the best comparable scheme in the literature.
OPTIMAL PATH IDENTIFICATION USING ANT COLONY OPTIMISATION IN WIRELESS SENSOR ...cscpconf
Wireless Sensor Network WSN is tightly constrained for energy, computational power and memory. All applications of WSN require to forward data from remote sensor node SN to base
station BS. The path length and numbers of nodes in path by which data is forwarded affect the basic performance of WSN. In this paper we present bio-Inspired Ant Colony Optimisation ACO algorithm for Optimal path Identification OPI for packet transmission to communicate between SN to BS. Our modified algorithm OPI using ACO considers the path length and the number of hops in path for data packet transmission, with an aim to reduce communication overheads.
A Survey on Rendezvous Based Techniques for Power Conservation in Wireless Se...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Ant Colony Optimization Based Energy Efficient on-Demand Multipath Routing Sc...ijsrd.com
Reliable transmission has become one of the major aspects of a wireless sensor network. The current paper provides an Ant Colony Optimization based method for providing multi path routes. These routes are provided on-demand, hence they can be used in any dynamic system. The advantage of this system is that it can provide near optimal results within the stipulated time.
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed
This document proposes and evaluates a new routing protocol called Conditional Shortest Path Routing (CSPR) for delay tolerant networks. CSPR uses a new metric called conditional intermeeting time to determine link costs, which measures the average time between two nodes meeting given that one node previously met a third node. Through simulations using real mobility traces, CSPR is shown to achieve higher delivery rates and lower end-to-end delays than existing shortest path routing protocols that use conventional intermeeting times as link costs. The conditional intermeeting time better captures link characteristics and allows for more effective forwarding decisions in routing messages.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
The document proposes an energy saving multipath routing protocol (ESMRP) for wireless sensor networks. ESMRP uses a load balancing algorithm to discover multiple node-disjoint paths from sensor nodes to a sink node based on calculated node strengths. It then transmits data along the paths either by single path load balancing or splitting messages across multiple paths with error correction. Simulation results show that ESMRP consumes less energy and has higher delivery ratios than previous protocols.
An approach to dsr routing qos by fuzzy genetic algorithmsijwmn
This document summarizes a research paper that proposes improvements to the DSR routing protocol in mobile ad hoc networks through the use of genetic and fuzzy algorithms. The proposed GA-DSR protocol adds link costs to route request packets and has the destination node use the received route requests as input to a genetic algorithm to find the two best routes. It then sends these routes back to the source in a route reply packet. The protocol also uses fuzzy logic to dynamically adjust the route update period based on route error counts. The researchers believe this approach can help improve quality of service in DSR routing by selecting optimal paths based on link costs and maintaining up-to-date routes.
This document summarizes and compares the EEPB and PDCH routing protocols for wireless sensor networks. It finds that while EEPB improves upon PEGASIS by avoiding long chains, it still has deficiencies like not considering node energy or distance to the base station when selecting leaders. The document then proposes PDCH, which uses a double cluster head approach to distribute energy load and prolong network lifetime. PDCH forms clusters based on distance from the base station and then constructs chains within each cluster. It selects a main and secondary cluster head in each round based on node energy and neighbors. The secondary heads relay aggregated data from their clusters to the base station. Simulation results show PDCH outperforms EEPB in energy efficiency,
An Experimental Result of Conditional Shortest Path Routing In Delay Toleran...IOSR Journals
This document discusses an experimental study of conditional shortest path routing in delay tolerant networks. It proposes a new metric called conditional intermeeting time, which measures the average time between two nodes meeting given that one node has already met a third node. It then presents a conditional shortest path routing protocol that uses conditional intermeeting times rather than standard intermeeting times to determine path costs. Simulation results show this approach achieves higher delivery rates and lower delays compared to existing shortest path routing protocols for delay tolerant networks.
Spatial Correlation Based Medium Access Control Protocol Using DSR & AODV Rou...IOSR Journals
The document summarizes a proposed spatial correlation-based medium access control protocol for wireless sensor networks that aims to improve energy efficiency. It discusses how sensor nodes are spatially distributed and correlated in detecting events. An iterative node selection algorithm is used to select a minimum set of representative sensor nodes based on a distortion constraint, in order to reduce redundant transmissions. The protocol uses vector quantization to calculate distances between nodes and a mobile element. It then evaluates the performance of using the DSR and AODV routing protocols with this spatial correlation-based MAC protocol in terms of energy consumption and packet drop ratio through simulations. The simulation results show that the protocol with AODV routing performs better than with DSR routing.
An efficient ant optimized multipath routing in wireless sensor networkEditor Jacotech
Today, the Wireless Sensor Network is increasingly gaining popularity and importance. It is the more interesting and stimulating area of research. Now, the WSN is applied in object tracking and environmental monitoring applications. This paper presents the self-optimized model of multipath routing algorithm for WSN which considers definite parameters like delay, throughput level and loss and generates the outcomes that maximizes data throughput rate and minimizes delay and loss. This algorithm is based on ANT optimization technique that will bring out an optimal and organized route for WSN and is also to avoid congestion in WSN, the algorithm incorporate multipath capability..
Energy aware model for sensor network a nature inspired algorithm approachijdms
In this paper we are proposing to develop energy aware model for sensor network. In our approach, first
we used DBSCAN clustering technique to exploit the spatiotemporal correlation among the sensors, then
we identified subset of sensors called representative sensors which represent the entire network state. And
finally we used nature inspired algorithms such as Ant Colony Optimization, Bees Colony Optimization,
and Simulated Annealing to find the optimal transmission path for data transmission. We have conducted
our experiment on publicly available Intel Berkeley Research Lab dataset and the experimental results
shows that consumption of energy can be reduced.
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETsCSCJournals
In ad hoc networks, the nodes are dynamically and arbitrary located in a manner that the interconnections between nodes are changing frequently. Thus, designing an effective routing protocol is a critical issue. In this paper, we propose a fuzzy based routing method that selects the most stable route (FSRS) considering the number of intermediate nodes, packet queue occupancy, and internodes distances. Also it takes the produced cost of the selected route as an input to another fuzzy controller predicts its lifetime (FRLP), the evaluation of the proposed method is performed using OMNet++4.0 simulator in terms of packet delivery ratio, average end-to-end delay and normalized routing load.
A novel hierarchical ant based qos aware intelligent routing scheme for manetsIJCNCJournal
MANET is a collection of mobile devices with no centralized control and no pre-existing infrastructures.
Due to the nodal mobility, supporting QoS during routing in this type of networks is a very challenging
task. To tackle this type of overhead many routing algorithms with clustering approach have been
proposed. Clustering is an effective method for resource management regarding network performance,
routing protocol design, QoS etc. Most of the flat network architecture contains homogeneous capacity of
nodes but in real time nodes are with heterogeneous capacity and transmission power. Hierarchical
routing provides routing through this kind of heterogeneous nodes. Here, routes can be recorded
hierarchically, across clusters to increase routing flexibility. Besides this, it increases scalability and
robustness of routes. In this paper, a novel ant based QoS aware routing is proposed on a three level
hierarchical cluster based topology in MANET which will be more scalable and efficient compared to flat
architecture and will give better throughput.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
FAULT-TOLERANT MULTIPATH ROUTING SCHEME FOR ENERGY EFFICIENT WIRELESS SENSOR ...ijwmn
Themain challengein wireless sensor network is to improve the fault tolerance of each
node and also provide an energy efficient fast data routing service. In this paper we propose an
energyefficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant
multipath routing scheme for energy efficientwireless sensor network (FTMRS).The FTMRSis based on
multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and
other two backup paths are used as alternative path for faulty network and to handle the overloaded
traffic on main channel.Shortest path data routing ensures energy efficient data routing. The
performance analysis of FTMRSshows better results compared to other popular fault tolerant techniques
in wireless sensor networks.
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (2
2n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Similar to Multiple optimal path identification using ant colony optimisation in wireless sensor network (20)
Generating privacy-protected synthetic data using Secludy and MilvusZilliz
During this demo, the founders of Secludy will demonstrate how their system utilizes Milvus to store and manipulate embeddings for generating privacy-protected synthetic data. Their approach not only maintains the confidentiality of the original data but also enhances the utility and scalability of LLMs under privacy constraints. Attendees, including machine learning engineers, data scientists, and data managers, will witness first-hand how Secludy's integration with Milvus empowers organizations to harness the power of LLMs securely and efficiently.
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?Speck&Tech
ABSTRACT: A prima vista, un mattoncino Lego e la backdoor XZ potrebbero avere in comune il fatto di essere entrambi blocchi di costruzione, o dipendenze di progetti creativi e software. La realtà è che un mattoncino Lego e il caso della backdoor XZ hanno molto di più di tutto ciò in comune.
Partecipate alla presentazione per immergervi in una storia di interoperabilità, standard e formati aperti, per poi discutere del ruolo importante che i contributori hanno in una comunità open source sostenibile.
BIO: Sostenitrice del software libero e dei formati standard e aperti. È stata un membro attivo dei progetti Fedora e openSUSE e ha co-fondato l'Associazione LibreItalia dove è stata coinvolta in diversi eventi, migrazioni e formazione relativi a LibreOffice. In precedenza ha lavorato a migrazioni e corsi di formazione su LibreOffice per diverse amministrazioni pubbliche e privati. Da gennaio 2020 lavora in SUSE come Software Release Engineer per Uyuni e SUSE Manager e quando non segue la sua passione per i computer e per Geeko coltiva la sua curiosità per l'astronomia (da cui deriva il suo nickname deneb_alpha).
Monitoring and Managing Anomaly Detection on OpenShift.pdfTosin Akinosho
Monitoring and Managing Anomaly Detection on OpenShift
Overview
Dive into the world of anomaly detection on edge devices with our comprehensive hands-on tutorial. This SlideShare presentation will guide you through the entire process, from data collection and model training to edge deployment and real-time monitoring. Perfect for those looking to implement robust anomaly detection systems on resource-constrained IoT/edge devices.
Key Topics Covered
1. Introduction to Anomaly Detection
- Understand the fundamentals of anomaly detection and its importance in identifying unusual behavior or failures in systems.
2. Understanding Edge (IoT)
- Learn about edge computing and IoT, and how they enable real-time data processing and decision-making at the source.
3. What is ArgoCD?
- Discover ArgoCD, a declarative, GitOps continuous delivery tool for Kubernetes, and its role in deploying applications on edge devices.
4. Deployment Using ArgoCD for Edge Devices
- Step-by-step guide on deploying anomaly detection models on edge devices using ArgoCD.
5. Introduction to Apache Kafka and S3
- Explore Apache Kafka for real-time data streaming and Amazon S3 for scalable storage solutions.
6. Viewing Kafka Messages in the Data Lake
- Learn how to view and analyze Kafka messages stored in a data lake for better insights.
7. What is Prometheus?
- Get to know Prometheus, an open-source monitoring and alerting toolkit, and its application in monitoring edge devices.
8. Monitoring Application Metrics with Prometheus
- Detailed instructions on setting up Prometheus to monitor the performance and health of your anomaly detection system.
9. What is Camel K?
- Introduction to Camel K, a lightweight integration framework built on Apache Camel, designed for Kubernetes.
10. Configuring Camel K Integrations for Data Pipelines
- Learn how to configure Camel K for seamless data pipeline integrations in your anomaly detection workflow.
11. What is a Jupyter Notebook?
- Overview of Jupyter Notebooks, an open-source web application for creating and sharing documents with live code, equations, visualizations, and narrative text.
12. Jupyter Notebooks with Code Examples
- Hands-on examples and code snippets in Jupyter Notebooks to help you implement and test anomaly detection models.
Building Production Ready Search Pipelines with Spark and MilvusZilliz
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
CAKE: Sharing Slices of Confidential Data on BlockchainClaudio Di Ciccio
Presented at the CAiSE 2024 Forum, Intelligent Information Systems, June 6th, Limassol, Cyprus.
Synopsis: Cooperative information systems typically involve various entities in a collaborative process within a distributed environment. Blockchain technology offers a mechanism for automating such processes, even when only partial trust exists among participants. The data stored on the blockchain is replicated across all nodes in the network, ensuring accessibility to all participants. While this aspect facilitates traceability, integrity, and persistence, it poses challenges for adopting public blockchains in enterprise settings due to confidentiality issues. In this paper, we present a software tool named Control Access via Key Encryption (CAKE), designed to ensure data confidentiality in scenarios involving public blockchains. After outlining its core components and functionalities, we showcase the application of CAKE in the context of a real-world cyber-security project within the logistics domain.
Paper: https://doi.org/10.1007/978-3-031-61000-4_16
GraphRAG for Life Science to increase LLM accuracyTomaz Bratanic
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
“An Outlook of the Ongoing and Future Relationship between Blockchain Technologies and Process-aware Information Systems.” Invited talk at the joint workshop on Blockchain for Information Systems (BC4IS) and Blockchain for Trusted Data Sharing (B4TDS), co-located with with the 36th International Conference on Advanced Information Systems Engineering (CAiSE), 3 June 2024, Limassol, Cyprus.
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
Multiple optimal path identification using ant colony optimisation in wireless sensor network
1. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 5, October 2013
MULTIPLE OPTIMAL PATH IDENTIFICATION
USING ANT COLONY OPTIMISATION IN
WIRELESS SENSOR NETWORK
Aniket. A. Gurav1, Manisha. J. Nene2
Department of Applied Mathematics1
Department of Applied Mathematics and Computer Engineering 2
Defence Institute of Advance Technology12, Pune, India 411 025
ABSTRACT
Wireless Sensor Network WSN is tightly constrained for resources like energy, computational power and
memory. Many applications of WSN require to communicate sensitive information at sensor nodes SN to
Base station BS. The basic performance of WSN depends upon the path length and numbers of nodes in the
path by which data is forwarded to BS. In this paper we present bio-inspired Ant Colony Optimisation ACO
algorithm for Optimal Path Identification OPI for packet transmission to communicate between SN to BS.
Our modified algorithm OPI using ACO is base-station driven which considers the path length and the
number of hops in path for data packet transmission. This modified algorithm finds optimal path OP as
well as several suboptimal paths between SN & BS which are useful for effective communication.
KEYWORDS
WSN, Ad-Hoc Network, ACO, Optimal path Identification, Multiple optimal paths
1. INTRODUCTION
A WSN is an ad-Hoc network composed of hundreds or even thousands of SN. These SN are
capable of sensing. SN’s are battery powered. Every time replacing or recharging of battery is not
possible. The SN’s have to perform tasks such as object monitoring & tracking, detecting the
presence of certain objects, event monitoring, data fusion & localization. These tasks of SN
generate a vast amount of data. The SN has to forward this data to BS (sink node).It is found that
SN consumes lot of energy while communicating this information so over all network lifetime
will increase if WSN consumes minimum energy in communication. The reporting between SN
& BS consumes energy based on the type of communication protocol, communication path &
number of hops between SN and BS. This requires finding out optimal path OP between BS to
SN which will be useful in efficiently forwarding data, reducing delay, evenly distributing traffic
load & power consumption and communication overhead in WSN.
In our work we are focused on identifying optimal and suboptimal communication path between
SN and BS.
There are various routing protocols like Direct diffusion [9], LEACH (Low Energy Adaptive
Clustering Hierarchy) [8], SPIN (Sensor protocols for Information via Negotiation) [8] [10].The
Shortest path finding is the backbone for the routing algorithms in WSN. So it is a graph based
problem to find out the shortest path between two vertices. As WSN is resource constrained it is
not desirable to use the conventional shortest path finding techniques.
DOI : 10.5121/ijwmn.2013.5508
119
2. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 5, October 2013
So we should look at soft computing techniques. It can help us in dynamically changing
environment for setting communication paths in WSN. ACO is a soft computing technique for
Optimisation. This method is having characteristic like achieving global optimization through
local interaction, high degree of self organization and adaptiveness.
1.1 Motivation
Routing in WSN is challenging due to limited capabilities of SN, dynamically changing
communication network environment and network topology, abrupt failure of SN etc. To handle
these many routing techniques exist, such as data centric, location based and hierarchical routing.
Finding shortest path in WSN during routing can help to optimise communication and
computation overhead.
In target or object tracking, surveillance vast amount of data is generated. This data should be
forwarded to BS with an optimal path to process it in the real time. A Greedy algorithm like
Dijkstra's algorithm, Bellman Ford and Dynamic programming algorithm are useful in shortest
path finding but it is having high computational complexity. Greedy algorithm doesn’t give a
guarantee of finding the globally OP and these techniques is helping to identify a single static
shortest path but the only single shortest path is not desirable for WSN.
Bio-inspired shortest path algorithm using ACO proves to be efficient in the OP detection. By
studying traditional ACO we found its following drawback for WSN which are possible to
overcome. Firstly ACO based routing [1] [4] algorithm which is the present finds path by creating
ants in the form of data packets, Data packets are transmitted between each node i.e. peer to peer.
This increases the communication overhead which is likely to result in increased network traffic.
Also packet collision and packet loss can result decrease in efficiency.
Existing routing protocols can be improved by considering the path length and the number of
nodes in path as a critical parameter to detect the optimal path between SN to BS. Secondly the
traditional ACO [11] considers only path length not the number of hops in the path and it is not
guaranteed to lead the optimal solution every time. Considering these challenges we have
modified the Traditional ACO in an appropriate way .Our work overcomes above mentioned
issues & BS computes the OP and communicates it with the SN. So in our approach path
discovery is done prior to the data transmission.
1.2 OVERVIEW OF OUR WORK
In our work we are proposing BS driven OPI. Here BS is made aware (directly or indirectly)
about the all SN their position and topology of the network. So problem of finding the optimal
path now becomes graph based problem.
120
3. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 5, October 2013
Start
BS receives the network topology
BS computes OP using ACO for each
SN
BS transmits OP for each SN
End
FIG. 1 SHOWS OVERVIEW OF OUR WORK
Here BS calculates OP using ACO & communicates that path with respective SN. So in 1st step
BS made aware about the network topology. In 2nd OP is identified. Then in the 3rd step OP is
communicated with the respective SN. After all these steps are done then any SN who wants to
send data to BS can use above calculated OP.
1.3 ASSUMPTIONS & EXPERIMENT PARAMETERS
For applying ACO for finding OP our assumptions are as follows.
a) Assumption at BS & SN
BS is aware about co-ordinate of all SN present and so it is also aware about the topology of the
entire WSN. BS is responsible for the entire computation of ACO. These are assumed about BS.
In case of SN it is assumed that SN’s are already localized. All SN’s are static. SN’s cannot be
recharged. Communication range of all SN is same.
b) Assumption for OPI Using ACO
Traditional ACO is explained in this paper, for our experiment we have taken the value of
parameters α=1, β =3, ρ =0.2. In our experiment WSN is treated as a graph. All the SN’s which
are in communication range of each other are represented as adjacent nodes in the graph. θ is no
of nodes (hops) in the path from source to destination. a is a parameter which manages relative
importance of path length & ψ controls the importance of nodes in path (equation 6). The value
of these two variables is 3.
2 ROUTING USING ACO
Routing using ACO is a complex task due to resource constrained WSN. In routing SN node
route data to BS using the most efficient path. In ACO based approach behaviour of real ant
searching for food through pheromone deposition helps to find the optimal path.
121
4. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 5, October 2013
2.1 Routing using Traditional ACO
When ants trace out a path from their nest to a food source, ant drop chemical called pheromone
on the path. On the shorter path more pheromone gets accumulated. This is because shorter paths
accumulate pheromone deposits at a faster rate. Suppose each ant starts from the source “s” to
destination “d”, it tries to find the shortest path between these nodes. At each node “i” ant “k”
decides to visit the next node “j” based upon the probability given by formulae in equation 1.
p
k
ij
[ ij ]α * [ ij ]β
τ
η
α
= ∑ [ ij ] * [ ij ]β
τ
η
0
∀j∈ N
j
otherwise
& j∉ M
k
(1)
Where τ ij is the pheromone concentration on edge between node “i” to node “j”.ηij is the value
of heuristic related to path length, α and β are two parameters which controls the relative
k
importance of pheromone trail and heuristic value related to path length. N j is set of SN. M Is
the memory of ant “k” The heuristic value related to path length is
1
l (i, j)
Where l (i , j ) is the edge length between nodes “i” and “j”.
η
ij
=
(2)
After each iteration “t”, ants “k” deposit quantity of pheromone which is given by
∆ τ k ( t ) = (1 / j k ( t ))
(3)
k
Where j ( t ) is the length of the path from source to destination traversed by ant “k”. Total
Amount of pheromone quantity on edge “i” to “j” is given by the equation
τ ij (t ) ← τ ij (t ) + ∆τ ij (t )
(4)
With increase in number of iteration/time parameter the pheromone starts evaporating. A control
coefficient ρ ∈ [0,1] decides the amount of pheromone on each edge at any specific iteration which
is given by the equation
τ ij (t ) ← (1 − ρ )τ ij (t )
(5)
As the number of iteration increases pheromone on shortest path becomes more as compared to
other paths present in the WSN. So the number of ants gets attracted to shorter path. Finally
pheromone concentration on this path becomes higher and algorithm converges.
2.2 OPI USING ACO
Steps1 to 7 describes the working of our proposed algorithm. Our proposed algorithm is modified
according to the needs of energy constrained WSNs. The proposed algorithm considers above
mentioned two parameters path length and number of hops in path to find out OP.
Steps
Step 1: When the BS starts computing shortest path, it decides one destination node in
122
5. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 5, October 2013
WSN. An ant is created which will generate a path from BS to that destination node.
Step 2: Ant “k” at node “i” selects the next node “j” using formula in equation 1.
Here “j” is one of the adjacent node of “i”. An ant “k” has more probability to choose the
k
node with larger values of pij the next node selected is stored in memory of ant k denoted
by ( M k ).
.
Step 3: If any ant visits the node which is already visited by the same ant then that ant
Is discarded from path calculation.
Step 4: Step 2 and 3 are repeated until ant “k” finds its destination node or discarded.
Step 5: Step 1 to 4 is repeated for all ants.
Step 6: When all ants complete above procedure pheromone on the edge is updated which is
given by equation 6.
1
τ ij ( t ) ← τ ij ( t ) + (( θ ) × (1 + (
Ψ
1
))
j (t ) Ω
k
(6)
Step 7: Then the evaporation of pheromone is calculated by equation 5.
Step 8: Now the path traversed by all ants is compared. The best optimal path is selected
Among them by comparing the number of hops & distances. This optimal
The path is then deleted from the graph. Again same procedure is repeated, this time
result will be a different optimal path than the previous one because that path is already
deleted.
As the above steps are iterated, BS comes to know about the optimal & suboptimal paths between
it and the destination. Similarly the BS can calculate distance between it and all other SN.
2.3 RESULT
This section compares the result of optimal path found using modified ACO and traditional
ACO. Figures 2,3 and 4 shows deployed WSN and its communication network. The nodes which
can directly communicate is shown by edges. The distance between corresponding SN is
indicated near the edges.
123
6. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 5, October 2013
Fig. 2 Wireless Sensor Nodes and its network
Fig. 3 OP using modified ACO
Fig. 4 Optimal Path using traditional ACO
In the above scenario of figure 1 node 9 senses some event and it want to forward that
information to node 1. Node 1 which is BS is aware about co-ordinates and the topology of the
entire network .It implements proposed algorithm and finds the optimal paths between SN 1 and
9. This step is repeated for all nodes and optimal path found is communicated with all SN. So all
SN including 9 is now aware about the optimal path between itself to BS. In this way finding the
optimal paths is done. So every SN know how to forward data to BS. The initial pheromone
concentration on all edges is as shown in table number 1.The left most columns and top row
denote the node numbers. Here N in top most left block in table 1 stands for node each edge is
initialised with pheromone quantity 0.00001. This is initialisation necessary to begin the
execution of ACO. This pheromone quantity is kept as small as possible because it should not
affect the final result. As the ants traverse the path, pheromone concentration on that edge start
increasing. Finally more pheromone gets deposited on the path with the shorter length, which is
overused. This converges to the optimal path. After implementing the modified algorithm the
pheromone concentration in a 5th iteration is shown in table 2. Here left column and top row
denote the node number and N in top most left block in table 2 represents the sensor node.
124
7. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 5, October 2013
Table 1 Pheromone value
N
1
2
3
4
5
6
7
8
9
1
0
0.00001
0.00001
0.00001
0
0
0
0
0
2
0.00001
0
0.00001
0.00001
0.00001
0
0
0
0
3
0.00001
0.00001
0
0.00001
0
0
0
0.00001
0
4
0.00001
0.00001
0.00001
0
0.00001
0.00001
0
0
0
5
0
0.00001
0
0.00001
0
0.00001
0.00001
0
0
6
0
0
0
0.00001
0.00001
0
0.00001
0
0
7
0
0
0
0
0.00001
0.00001
0
0.00001
0.00001
8
0
0
0.00001
0
0
0
0.00001
0
0.00001
9
0
0
0
0
0
0
0.00001
0.00001
0
2.3.1 Optimal Path Identification from Pheromone Table
OP is detected from pheromone concentration which is given in table 2. For choosing the optimal
path we just have to look at the edges (table block) with a maximum pheromone concentration
starting from sensor 1 (in row 1) till we reach sensor 9. So from 1st node pheromone concentration
is maximum in the 3rd column (3rd column in 1st row) which is 0.0001059. So edge from 1 to 3 is
added. Then from the 3rd sensor (from 3rd row) look for maximum pheromone value. 8th column
value is 0.0001138 which is the maximum. So add edge from 3 to 8. With the node 8, the
maximum pheromone concentration is 0.001153, so edge from 8 to 9 is added. By proceeding this
way one can find a path. In Figure 3 the path with the maximum pheromone concentration is
marked with red colour. This path is optimal path. From table 2 it is clear that the pheromone
concentration on the path 1 to 3, 3 to 8, 8 to 9 is higher. So our optimal path is the 1-3-8-9.The
length of this path is 85. We can also get a parallel path if we initially choose 2nd highest node
from node 1 & then keep choosing highest pheromone node. The other parallel path proposed by
the implemented algorithm OPI using ACO is 1-2-4-5-6-7-9. This path is not optimal but it is sub
optimal. This suboptimal path selection is useful when an optimal path for communication is
required to be chosen between the communicating nodes. Especially, when one optimal path is
over utilised and there is a need to conserve energy of nodes on that path. The length of
suboptimal path is 102. Table 3 gives the number of ants choosing the sensor nodes. Where left
column and top row denote nodes. Here N in top most left block in table 3 stand for node. The
number of Ants choosing a path is proportional to the pheromone concentration on the path.
Hence many times the path found in Ant table is the same as the result given by the pheromone
value. Instead of choosing edge with the highest ant count, if 2nd highest edge is taken at node 1,
then we get another suboptimal path. That path is 1-2-4-5-7-9.This alternate path is very useful as
using the same OP will reduce the energy level of the SN in the path. This enables a dynamic
detection of alternative optimal path for communication between the communicating sensor
nodes.
Table 2 Pheromone value
N
1
2
3
4
5
6
7
8
9
0.0000353
0.0001059
0.000015
0
0
0
0
0
0.0000353
0
0.0000185
0.0000317
0.0000166
0
0
0
0
0.0001059
0.0000185
0
0.0000205
0
0
0
0.0001138
0
0.000015
0.0000317
0.0000205
0
0.0000221
0.0000158
0
0
0
0
0.0000166
0
0.0000221
0
0.0000227
0.0000216
0
0
0
0
0
0.0000158
0.0000227
0
0.0000208
0
0
0
0
0
0
0.0000216
0.0000208
0
0.0000145
0.000309
0
0
0.0001138
0
0
0
0.0000145
0
0.001153
0
0
0
0
0
0
0.000309
0.001153
0
1
2
3
0
4
5
6
7
8
9
125
8. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 5, October 2013
Table 3 Ant count
N
1
2
3
4
5
6
7
8
9
1
0
42
63
15
0
0
0
0
0
0
2
0
0
11
35
20
0
0
3
0
12
0
12
0
0
0
0
4
0
14
16
0
21
14
0
69
0
0
5
0
1
0
3
0
22
28
0
0
6
0
0
0
2
12
0
23
0
0
7
0
0
0
0
3
7
0
0
0
5
0
0
0
8
13
0
36
8
9
0
0
0
0
0
0
0
0
0
69
0
2.4 Comparison of Results with Traditional ACO
Traditional ACO is already described in this paper. The comparison of results of these two
algorithms is given below. The initial pheromone concentration of Traditional ACO is in the table
1. After 5th iteration the pheromone concentration is as shown in table 4 .From table 4, it is clear
that pheromone concentration is more on the path 1-2-4-5-6-7-9.The length of this path is 102. So
ants will start preferring this path. In the result section 6 by modified ACO we have found an
optimal path which is equal to 85.So it proves that our modified algorithm outperforms the
traditional ACO. Figure 4 shows path found by traditional ACO with red colour.
Now the same method is applied to more complex scenario shown in figure 5. In this scenario
number of SN are more & they are densely distributed. Here aim is to find the Multiple Optimal
Paths MOP between BS node 1 and SN 30. The modified ACO method which is described
previously is used for finding the single Optimal Path. While the optimising number of hops and
path length from SN to BS is considered. So these OP are having less path length as well as
number of hops. After each iteration, if ants are converged to the single path then that path is
selected as the optimal path. As our aim is to find the multiple optimal paths the path which is
discovered in previous iteration is deleted from the graph so ants in this iteration will not be able
to travel through that path. Deletion of the optimal path in the previous iteration causes ACO to
search for the new optimal path in this iteration. In this way several optimal paths are discovered.
Table 4 Pheromone value for Traditional ACO
N
1
2
3
4
5
6
7
8
9
0
1
0
11.462
0.3922
0.4440
0
0
0
0
11.462
0
0.6559
10.930
0.3302
0
0
0
0
0.3922
0.6559
0
1.066
0
0
0
1.564
0
0.4440
10.930
1.0663
0
4.457
1.422
0
0
0
0
0.3302
0
4.457
0
13.41
1.257
0
0
0
0
0
1.422
13.414
0
3.530
0
0
0
0
0
0
1.2572
3.53
0
0.539
8.275
0
0
1.564
0
0
0
0.539
0
1.799
0
0
0
0
0
0
8.275
1.799
0
2
3
4
5
6
7
8
9
126
9. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 5, October 2013
Fig. 5 Wireless sensor nodes and its network
Fig. 6 MOP using modified ACO
Figure 6 shows collection of different optimal and suboptimal paths with different colours.This
algorithm is applied for number of SN between 50 to 100. Every time we have got Multiple
Optimal paths as described.
3.CONCLUSION
Finding the optimal path in dynamically changing resource constrained WSN is challenging. Our
work proposes an approach to identify multiple optimal paths for communication between SN to
BS. Existing greedy approach is static in providing optimal path. In our computational approach
and communication overhead is reduced as BS takes the responsibility of computation & optimal
path is calculated based on pheromone concentration. Multiple optimal paths between SN and BS
are useful in forwarding data, efficiently distributing the load. This increases the throughput and
increases the network lifetime.
REFERENCES
[1]
Selcuk Okdem and Dervis Karaboga, “Routing in Wireless Sensor Networks Using an Ant Colony
Optimization (ACO) Router Chip”, Sensors 2009, 9, 909-921;doi: 10.3390/s90200909
[2]
P.K.Singh, Narendra pal singh, “Data Forwarding in Ad-hoc Wireless Sensor Network Using
Shortest Path Algorithm”, Volume 2, No. 5, May 2011 Journal of Global Research in Computer
Science
[3]
Adamu Murtala Zungeru, Li-Minn Ang, S.R.S. Prabaharan, and Kah Phooi Seng, “Ant Based
Routing Protocol for Visual Sensors”, A. Abd Manaf et al. (Eds.): ICIEIS 2011, Part II, CCIS 252,
pp. 250–264, 2011. , Springer-Verlag Berlin Heidelberg 2011.
[4]
Selcuk Okdem, Dervis Karaboga “Routing in Wireless Sensor Networks Using Ant Colony
Optimization”, Proceedings of the First NASA/ESA Conference on Adaptive Hardware and
Systems (AHS'06) 0-7695-2614-4/06 2006 IEEE
[5]
Dilpreet kaur, Dr.P.S Mundra, “Ant Colony Optimization: A Technique Used For Finding Shortest
Path”, International Journal of Engineering and Innovative Technology (IJEIT) Volume 1, Issue 5,
May 2012
[6]
Masaya Yoshikawa, Kazuo Otani, “ Ant Colony Optimization Routing Algorithm with Tabu
Search”, Masaya Yoshikawa, Kazuo Otani.
[7]
Jamal N. Al-karaki, Ahmed E.Kamal, “A Taxonomy of Routing Techniques in Wireless Sensor
Network”, in Sensor Network Protocols Taylor & Francis page 3-1 to 4-24 [8] Gizem, Aksahya
& Ayese, Ozcan (2009) Coomunications & Networks, Network Books, ABC Publishers.
127
10. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 5, October 2013
[8]
W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-Efficient Communication
Protocol for Wireless Microsensor Networks", proc. Hawaii International Conference on System
Sciences, Vol. 8, pp. 1-10, Jan. 2000.
[9]
C.Intanagonwiwat, R.Govindan, and D.Estrin, “Directed diffusion for wireless sensor network”,
IEEE /ACM transaction . Networking,11(1),2-16 ,2003
[10]
J.Kulik, W.R.Heinzelman, H.Balakrishnan, “Negotion based protocol for disseminating
information in wireless sensor network”, Wireless Networks, 8, 169-185,2002
[11]
M. Dorigo , G. Di Caro, “Ant colony optimization: a new meta-heuristic”, Proceedings of the 1999
Congress on Evolutionary Computation, Proceedings, 1999
128