In this paper, we present a detailed study of Minimum Reconfiguration Probability Routing (MRPR) algorithm, and its performance evaluation in comparison with Adaptive unconstrained routing (AUR) and Least Loaded routing (LLR) algorithms. We have minimized the effects of failures on link and router failure in the network under changing load conditions, we assess the probability of service and number of light path failures due to link or route failure on Wavelength Interchange(WI) network. The computation complexity is reduced by using Kalman Filter(KF) techniques. The minimum reconfiguration probability
routing (MRPR) algorithm selects most reliable routes and assign wavelengths to connections in a manner that utilizes the light path(LP) established efficiently considering all possible requests.
Routing in All-Optical Networks Using Recursive State Space Techniquesipij
In this papr, we have minimized the effects of failures on network performace, by using suitable Routing
and Wavelenghth Assignment(RWA) method without disturbing other performance criteria such as blocking
probability(BP) and network management(NM). The computation complexity is reduced by using Kalaman
Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm must be
able to select most reliable routes and assign wavelengths to connections in a manner that utilizes the light
path(LP) established efficiently considering all possible requests.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
This document summarizes a research paper that proposes an Energy Efficient Reserved Path Routing Topology (RPRT) routing scheme for mobile ad hoc networks. The RPRT aims to improve energy efficiency and reduce end-to-end delay compared to the existing M-Trace routing scheme. It allows nodes to use estimated energy levels to make better channel admission control decisions for providing quality of service guarantees. The paper presents the RPRT scheme and its energy level estimation, routing discovery, route maintenance, and path selection mechanisms. Simulation results demonstrate that the RPRT achieves a 16% increase in energy efficiency and 37% reduction in end-to-end delay compared to M-Trace.
This document proposes an improved position-based power aware routing algorithm for mobile ad-hoc networks. It introduces using a weighted metric of remaining battery power, speed, and distance of nodes to determine routes. The existing MFR (Most Forward within Radius) algorithm does not consider factors like battery power and speed differences, which can lead to unreliable communication or packet loss. The proposed algorithm uses a weighted combination of distance, velocity, and battery power metrics to select routes, aiming to balance load, increase network lifetime, and improve network performance compared to MFR. Simulation results showed the proposed algorithm reduces packet loss and increases throughput compared to MFR.
The Impact of Signal Strength over Routing Protocols in Wireless NetworksDr. Amarjeet Singh
In ad hoc routing protocols the source node
may need an intermediate nodes to transmit the packets into
the destination if the destination is not within transmission
range of the source. This paper studies the impact of signal
strength of nodes over ad hoc routing protocols and explains
an important effect of signal strength on ad hoc routing
protocols in four different directions including the routes and
the nodes. As a result the study give an important
improvement in ad hoc routing protocols when using signal
strength compared to other ad hoc routing protocols without
considering signal strength.
Design A Congestion Aware Routing Algorithm for Synchronous Cam Designijtsrd
The effect of process variation (PV) on delay is a major reason to decay the performance in advanced technologies. The performance of front routing algorithms is determined with or without PV for different traffic patterns. The saturation throughput and average message delay are used as performance metrics to evaluate the throughput. PV decreases the saturation throughput and increases the average message delay. Adaptive routing algorithm should be manipulated with the PV. A novel PV delay and congestion aware routing (PDCR) algorithm is presented for asynchronous network-on-chip (NOC) design. The routing algorithm performs various adaptive routing algorithms in the average delay and saturation throughput for different traffic patterns. A low-power content-addressable memory (CAM) by a new algorithm is proposed for associativity between the input tag and the corresponding address of the output data. The proposed architecture is depends on a recently developed sparse clustered network by utilizing binary connections that on-average eliminates most of the parallel comparisons performed during a search. P. Mounica | R. Umamaheswari | R. Madhavi | R. Nischala | N. Ramesh Babu"Design A Congestion Aware Routing Algorithm for Synchronous Cam Design" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11547.pdf http://www.ijtsrd.com/engineering/electronics-and-communication-engineering/11547/design-a-congestion-aware-routing-algorithm-for-synchronous-cam-design/p-mounica
Abstract In optical circuit switching the high values of blocking probability is resolved by dynamic wavelength routing algorithms with wavelength conversion. The aim of this paper is to study these algorithms. Then the algorithm is selected which gives good results with and without wavelength conversion. The selected algorithm is then checked for other parameters of networking namely throughput, packet delivery ratio, and delay. A comparative study is then carried out for increasing traffic. We try to prove that these algorithms satisfy the criteria of QoS parameters by this comparative study. The results of simulation show that the parameters follow the trend of blocking probability of the selected algorithm. Keywords: optical burst switching, throughput, packet delivery ratio, delay.
MPC-EAR : Maximal Power Conserved And Energy Aware Routing in Ad hoc Networksijsrd.com
Power preservation in wireless ad hoc networks is a decisive factor as energy resources are inadequate at the electronic devices in use. Power-aware routing strategies are fundamentally route selection strategies built on accessible ad hoc routing protocols. This paper proposed a new Maximal Power Conserved And Energy Aware Routing (MPC-EAR ) topology for mobile ad hoc networks that enhances the network life span. Simulation results prove that the projected protocol has a higher performance other minimal energy usage, energy level aware and energy conserving routing protocols such as MTPR, MMECR and CMMECR.
Routing in All-Optical Networks Using Recursive State Space Techniquesipij
In this papr, we have minimized the effects of failures on network performace, by using suitable Routing
and Wavelenghth Assignment(RWA) method without disturbing other performance criteria such as blocking
probability(BP) and network management(NM). The computation complexity is reduced by using Kalaman
Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm must be
able to select most reliable routes and assign wavelengths to connections in a manner that utilizes the light
path(LP) established efficiently considering all possible requests.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
This document summarizes a research paper that proposes an Energy Efficient Reserved Path Routing Topology (RPRT) routing scheme for mobile ad hoc networks. The RPRT aims to improve energy efficiency and reduce end-to-end delay compared to the existing M-Trace routing scheme. It allows nodes to use estimated energy levels to make better channel admission control decisions for providing quality of service guarantees. The paper presents the RPRT scheme and its energy level estimation, routing discovery, route maintenance, and path selection mechanisms. Simulation results demonstrate that the RPRT achieves a 16% increase in energy efficiency and 37% reduction in end-to-end delay compared to M-Trace.
This document proposes an improved position-based power aware routing algorithm for mobile ad-hoc networks. It introduces using a weighted metric of remaining battery power, speed, and distance of nodes to determine routes. The existing MFR (Most Forward within Radius) algorithm does not consider factors like battery power and speed differences, which can lead to unreliable communication or packet loss. The proposed algorithm uses a weighted combination of distance, velocity, and battery power metrics to select routes, aiming to balance load, increase network lifetime, and improve network performance compared to MFR. Simulation results showed the proposed algorithm reduces packet loss and increases throughput compared to MFR.
The Impact of Signal Strength over Routing Protocols in Wireless NetworksDr. Amarjeet Singh
In ad hoc routing protocols the source node
may need an intermediate nodes to transmit the packets into
the destination if the destination is not within transmission
range of the source. This paper studies the impact of signal
strength of nodes over ad hoc routing protocols and explains
an important effect of signal strength on ad hoc routing
protocols in four different directions including the routes and
the nodes. As a result the study give an important
improvement in ad hoc routing protocols when using signal
strength compared to other ad hoc routing protocols without
considering signal strength.
Design A Congestion Aware Routing Algorithm for Synchronous Cam Designijtsrd
The effect of process variation (PV) on delay is a major reason to decay the performance in advanced technologies. The performance of front routing algorithms is determined with or without PV for different traffic patterns. The saturation throughput and average message delay are used as performance metrics to evaluate the throughput. PV decreases the saturation throughput and increases the average message delay. Adaptive routing algorithm should be manipulated with the PV. A novel PV delay and congestion aware routing (PDCR) algorithm is presented for asynchronous network-on-chip (NOC) design. The routing algorithm performs various adaptive routing algorithms in the average delay and saturation throughput for different traffic patterns. A low-power content-addressable memory (CAM) by a new algorithm is proposed for associativity between the input tag and the corresponding address of the output data. The proposed architecture is depends on a recently developed sparse clustered network by utilizing binary connections that on-average eliminates most of the parallel comparisons performed during a search. P. Mounica | R. Umamaheswari | R. Madhavi | R. Nischala | N. Ramesh Babu"Design A Congestion Aware Routing Algorithm for Synchronous Cam Design" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11547.pdf http://www.ijtsrd.com/engineering/electronics-and-communication-engineering/11547/design-a-congestion-aware-routing-algorithm-for-synchronous-cam-design/p-mounica
Abstract In optical circuit switching the high values of blocking probability is resolved by dynamic wavelength routing algorithms with wavelength conversion. The aim of this paper is to study these algorithms. Then the algorithm is selected which gives good results with and without wavelength conversion. The selected algorithm is then checked for other parameters of networking namely throughput, packet delivery ratio, and delay. A comparative study is then carried out for increasing traffic. We try to prove that these algorithms satisfy the criteria of QoS parameters by this comparative study. The results of simulation show that the parameters follow the trend of blocking probability of the selected algorithm. Keywords: optical burst switching, throughput, packet delivery ratio, delay.
MPC-EAR : Maximal Power Conserved And Energy Aware Routing in Ad hoc Networksijsrd.com
Power preservation in wireless ad hoc networks is a decisive factor as energy resources are inadequate at the electronic devices in use. Power-aware routing strategies are fundamentally route selection strategies built on accessible ad hoc routing protocols. This paper proposed a new Maximal Power Conserved And Energy Aware Routing (MPC-EAR ) topology for mobile ad hoc networks that enhances the network life span. Simulation results prove that the projected protocol has a higher performance other minimal energy usage, energy level aware and energy conserving routing protocols such as MTPR, MMECR and CMMECR.
This document summarizes a research paper that proposes a novel cross-layer routing technique for mobile ad hoc networks. The technique calculates both signal strength and node mobility to select the most efficient and stable path for data transmission. It aims to improve on traditional ad hoc routing protocols like AODV by considering both link quality metrics from the physical layer (signal strength) and node mobility. The proposed method selects routes based on signal strength if mobility is high, and on traditional hop count if mobility is low, in order to find paths that reduce link failure and improve throughput.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
Modeling and Simulation of Wavelength-Routed optical Networksijceronline
All-optical Wavelength Division Multiplexing (WDM) networks providing extremely large bandwidths are among the most promising solutions to the increasing need for high-speed data transport. A lightpath has a specific route and one or more wavelengths through which the information is routed from the source to the destination node. In wavelength-routed optical networks, data are transmitted solely in the optical domain along lightpaths from source to destination without being converted into the electronic form and each lightpath is allowed to use the same wavelength on all the links along its path. This restriction is known as the wavelength continuity constraint. And it leads to an issue called as blocking in networks. Optical wavelength conversion with suitable Routing and wavelength assignment (RWA) can increase the performance and capacity of optical networks by eliminating this restriction and relaxing the wavelength continuity constraint. In this research, we analyze the problem of placing a limited number of wavelength converters in a mesh network using Weighted Maximum Segment Length (WMSL) converter placement algorithm. It employs Least-Loaded Routing and First-Fit (LLR-FF) RWA algorithm. It is tested on varying number of nodes in network and its respective blocking probabilities are calculated. The proposed algorithm provides the minimum blocking probability on optimal wavelength converters placement.
M-EPAR to Improve the Quality of the MANETsIJERA Editor
In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose modified efficient power aware routing (M-EPAR), a new power aware routing protocol that increases the network lifetime of MANET. Designing a power aware routing algorithm or technique is one of the most important point considered in Mobile Ad Hoc Networks. These nodes are driven by reactive protocols where broadcasting is mandatory to form a path between two nodes. So in case of death of the node resulting out of less battery calls for re-routing. Since many existing techniques focuses on energy aware routing this paper presents combination of energy aware routing merged with link quality determined by packet drop rate. The proposed scheme has outperformed the existing technique in terms of packet delivery ratio, throughput and energy consumption.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
IRJET- Proactive Neighbor Knowledge-based Hybrid Broadcasting in MANETIRJET Journal
This document presents a proactive neighbor knowledge-based hybrid broadcasting (PNKHB) scheme for routing in mobile ad hoc networks (MANETs). The key goals of PNKHB are to reduce routing overhead and energy consumption compared to existing routing protocols like AODV. PNKHB works by proactively building routing tables using neighbor connectivity information, power levels, and link failure probabilities to select stable routes. Simulation results show that PNKHB decreases average energy consumption by up to 43% and 9% compared to AODV and ANKB respectively. It also increases packet delivery ratio by up to 7% over the other protocols.
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.
Throughput Maximization of Cognitive Radio Multi Relay Network with Interfere...IJECEIAES
In this paper, an Orthogonal Frequency Division Multiplexing (OFDM) based cognitive multi relay network is investigated to maximize the transmission rate of the cognitive radio (CR) with enhanced fairness among CR users with interference to the primary users (PUs) being managed below a certain threshold level. In order to improve the transmission rate of the CR, optimization of the subcarrier pairing and power allocation is to be carried out simultaneously. Firstly joint optimization problem is formulated and Composite Genetic and Ordered Subcarrier Pairing (CGOSP) algorithm is proposed to solve the problem. The motivation behind merging genetic and OSP algorithm is to reduce the complexity of Genetic Algorithm (GA). Further, to have a fair allocation of resources among CR users, the Round Robin allocation method is adopted so as to allocate subcarrier pairs to relays efficiently. The degree of fairness of the system is calculated using Jain‟s Fairness Index (JFI). Simulation results demonstrate the significant improvement in transmission rate of the CR, low computational complexity and enhanced fairness.
Performance Comparison of Different Mobility Model on Topology Managed MANETEswar Publications
A wireless ad hoc network is a sovereign system in which users can communicate with each other freely. It can be deployed rapidly at a very low cost, and can be easily managed and extended. Topology management has main objective to maintain a topology connectivity that improves wireless network performance by minimizing energy consumption. Also Topology control with cooperative communication was recently research initiated .Cooperative Communication (CC) is a technique that allows no. of nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. Topology management with cooperative communication is new research
initiated in the field of Mobile Ad-hoc Network. In this paper, we analyze the effect of multi-traffic on the topology managed MANET. We implemented some applications on different mobility models that is OLSR move and random mobility. To simulate all scenario OPNET 14.5 software is used. OPNET is a comprehensive suite of tools for modelling large wired and wireless networks. It uses simulation and emulation to predict the behaviour and performance of networks to improve their design, operation and management.
In the first part of paper, implemented the existed network on the OPNET simulator and evaluate the performance (Download Response Time, Traffic Send and Traffic Receive) of OLSR move based topology control network.
In the second part of paper, evaluated the QoS performanc (Delay, Download Response Time, Traffic Send and Receive Response) of Random Mobility based topology control network. From the simulation results we observed that compare with OLSR move models, the Random mobility model performance is good. We implemented different traffic pattern on two Topology managed MANET.
In the third part of paper, implemented the dynamic traffic pattern like Email, FTP & Voice and video conferencing on the proposed network. Simulation results show that FTP and E-mail both have large download response time in case of OLSR move model rather than Random Mobility model. Traffic send and receive performance of email is good in OLSR-move model. Video Conferencing has good response of traffic send and receive in Random Mobility model.
Impact of energy and link quality indicator with link quality estimators in w...graphhoc
The Link Quality Indicator (LQI) and Residual Energy have a fundamental impact on the network
performance in Wireless Sensor Networks (WSNs) and affects as well in the life time of nodes. This paper
will provide a comparative of Link Quality Estimator, the Link Quality Estimator with Link Quality
Indicator and Link Quality Estimator with Residual Energy. In this paper we develop a Collect Tree
Protocol (CTP) and compare the performance of LQI and Residual Energy, and show their effect on the
packet delivery ratio and throughput, covering the characteristics of low-power links, and their
performance to the best of our knowledge, we believe that our efforts would have implementations on
embedded application.
PALBMRP: Power Aware Load Balancing Multipath Routing Protocol for MANETEswar Publications
A set of mobile hosts or nodes that form a dynamic topology which is ad hoc in nature is called MANET. There are several challenges while designing a routing protocol for MANET due to the limited energy, less processing capability, fewer resources and dynamic environmental changes. Most of the existing energy efficient protocols focuses on choosing a route or path through the nodes with maximum residual energy and distribute a network traffic blindly among generated paths. Network congestion caused due to traffic and node packet carrying capability based on its remaining energy are not considered which leads to increasing number of dead nodes and result in more energy depletion. Hence we have proposed a Power Aware Load Balancing Multipath Routing Protocol (PALBMRP) which selects an optimal energy efficient route based on multiple parameters i.e. residual energy, delay, congestion and hop count and perform load balancing by considering nodes minimal residual energy to transmit packets according to its capacity. The simulation shows the proposed protocol reduced overall energy consumption up to 9%, increased packet delivery ratio up to 12%, and reduced end to end delay up to 3%, compared to AOMDV and LBMMRE-AOMDV [1].
Interference-Aware Multipath Routing In Wireless Sensor NetworksMinor projr...Rakesh Behera
Routing in wireless sensor networks has been considered an important field of research over the past decade. Wireless sensor network essentially consists of data Sensor Nodes and Video Sensor Nodes, which senses both sound and motion of events. Single path routing protocol has been used for route discovery. Though this protocol reduces computation complexity and resource utilization, there are some disadvantages like reduced network throughput, network performance, increased traffic load and delay in data delivery. To overcome these drawbacks a new protocol called Interference Aware Multi-path Routing(IAMR) is proposed to improve the reliability of data transmission, fault-tolerance, Quality of Service. Here, the traffic intersection spread out among the multiple paths. This technique is applied between the sources and sink to reduce routing overhead and energy consumption. The proposed protocol is simulated using NS2
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT On the real time hardware implementa...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Authentication of Secure Data Transmission In Wireless RoutingIJERA Editor
The major objective of our work is to explore a security enhanced dynamic routing algorithm based on distributed routing information widely supported in existing wired and wireless networks. The message authentication is the main area to be considered in WSN’s. Most of the wireless networks are attacked for detecting the data’s that are transmitted in between the users. We aim at the randomization of delivery paths for data transmission to provide considerably small path similarity (i.e., the number of common links between two delivery paths) of two consecutive transmitted packets. The proposed algorithm should be easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP) for wired networks and Destination-Sequenced Distance Vector (DSDV) protocol for wireless networks over existing infrastructures. These protocols shall not increase the number of control messages if the proposed algorithm is adopted. An analytic study will be presented for the proposed routing algorithm, and a series of simulation study will be conducted to verify the analytic results and to show the capability of the proposed algorithm.
Modulation aware connection admission control and uplink scheduling algorithm...ijwmn
Mobile WiMAX standard defines air interface for mobile broadband wireless access (BWA) systems and aimed to provide high data rate with seamless mobility while maintaining the quality of service (QoS). However, QoS of real-time applications depends on the link quality, which necessitate the channel-aware connection admission control (CAC) and scheduling schemes. In this paper Modulation aware CAC scheme and base station (BS) uplink scheduling algorithm are proposed to improve the system capacity and QoS performance respectively. The proposed CAC scheme aims to increase the admission of higher priority real time services by degrading the bandwidth of admitted lower priority connections on the basis of their channel status without deteriorating their QoS performance much. The performances of proposed algorithms are evaluated through simulation by considering the metrics like throughput, delay and number of connections admitted.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Implementing Energy Efficient Strategies in the MANET on-demand routing Proto...IJEEE
Mobile Ad-hoc networks are self-configuring multi-hop wireless networks where, the structure of the network changes dynamically. Because of the nodes in the MANET are mobile and battery operated, energy optimization is one of the major constraints in the MANET. Failure of some nodes operation can greatly impede the performance of the network and even affect the basic availability of the network, i.e., routing. To improve the lifetime of these networks can be improving the energy levels of the individual nodes of the network. This paper presents an analysis of the effects of different design choices for this on- demand routing protocols DSR and AODV in wireless ad hoc networks. In this paper, the energy efficient strategies are implemented in the AODV and DSR protocols to improve the life time of the Mobile ad hoc network. The CBEER-NN is developed using the existing DSR protocol and the AO- EEDTR is developed using the existing AODV protocol. GloMoSIM simulator is used to simulate the proposed MANET environment. This paper also compares the existing DSR and AODV protocols with proposed CBEER- NN and AO-EEDTR protocols. From the simulated results, this paper concludes that the proposed CBEER-NN and AO- EEDTR protocols are improving the life time of the network by improving the average residual energy of the nodes over the existing DSR and AO-EEDTR protocols.
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.
Performance evaluation of proactive, reactive and hybrid routing protocols wi...eSAT Journals
Abstract Our work mainly focused on the performance and effects of different mobility models like Random Waypoint, Reference Point Group, and Manhattan mobility models in different aspects to improve and analyze the behavior of Optimized Link-State Routing (OLSR), Temporally-Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP) routing protocols. These three routing protocols can be classified into the following three general categories, based on the timing when the routes are discovered and updated-proactive (OLSR), reactive (TORA) and hybrid (ZRP). In literature various researchers have discussed the performance issues in AODV, DSDV and DSR routing protocols in Random Waypoint mobility model on Mobile Ad hoc Networks (MANETs) is not satisfactory due to link failure and late acknowledgement. To resolve the specified issue, we have come up with other alternatives like Reference Point Group, and Manhattan mobility model and also other routing protocols like OSLR, TORA and ZRP. A simulation was carried out in NS2 and Bonnmotion for above said protocols and mobility models in Constant Bit Rate (CBR) traffic to analyzed using various metrics like packet delivery fraction, end to end delay and normalized routing load. In our simulation it was shown that few mobility model performed better in different routing protocols. In our simulation results, we got a high Normalized Routing Load for Random Waypoint compared to Reference Point Group, and Manhattan mobility model in both DRP and OSLR protocols. Index Terms: MANET, CBR, Routing protocols, Mobility models, NS2
In wireless distributed sensor networks, one open problem is how to guarantee the reliable relay
selection based on the quality of services diversity. To address this problem, we focus on the reliable
adaptive relay selection approach and adaptive QoS supported algorithm, based on which we present a
Markov chain model, in consideration of different packet states and error control algorithm assignment.
The mathematical analyses and MATLAB simulation results show that the proposed relay selection
approach could perform better in terms of saturation throughput, reliability, and energy efficiency,
compared with the traditional approaches. More importantly, the quality of real-time multimedia streaming
is improved significantly, in terms of decodable frame ratio and delay.
Ultrasound images and SAR i.e. synthetic aperture radar images are usually corrupted because of speckle
noise also called as granular noise. It is quite a tedious task to remove such noise and analyze those
corrupted images. Till now many researchers worked to remove speckle noise using frequency domain
methods, temporal methods, and adaptive methods. Different filters have been developed as Mean and
Median filters, Statistic Lee filter, Statistic Kuan filter, Frost filter, Srad filter. This paper reviews filters
used to remove speckle noise.
TARGET LOCALIZATION IN WIRELESS SENSOR NETWORKS BASED ON RECEIVED SIGNAL STRE...sipij
We consider the problem of localizing a target taking the help of a set of anchor beacon nodes. A small
number of beacon nodes are deployed at known locations in the area. The target can detect a beacon
provided it happens to lie within the beacon’s transmission range. Thus, the target obtains a measurement
vector containing the readings of the beacons: ‘1’ corresponding to a beacon if it is able to detect the
target, and ‘0’ if the beacon is not able to detect the target. The goal is twofold: to determine the location
of the target based on the binary measurement vector at the target; and to study the behaviour of the
localization uncertainty as a function of the beacon transmission range (sensing radius) and the number of
beacons deployed. Beacon transmission range means signal strength of the beacon to transmit and receive
the signals which is called as Received Signal Strength (RSS). To localize the target, we propose a gridmapping
based approach, where the readings corresponding to locations on a grid overlaid on the region
of interest are used to localize the target. To study the behaviour of the localization uncertainty as a
function of the sensing radius and number of beacons, extensive simulations and numerical experiments
are carried out. The results provide insights into the importance of optimally setting the sensing radius and
the improvement obtainable with increasing number of beacons.
This document summarizes a research paper that proposes a novel cross-layer routing technique for mobile ad hoc networks. The technique calculates both signal strength and node mobility to select the most efficient and stable path for data transmission. It aims to improve on traditional ad hoc routing protocols like AODV by considering both link quality metrics from the physical layer (signal strength) and node mobility. The proposed method selects routes based on signal strength if mobility is high, and on traditional hop count if mobility is low, in order to find paths that reduce link failure and improve throughput.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
Modeling and Simulation of Wavelength-Routed optical Networksijceronline
All-optical Wavelength Division Multiplexing (WDM) networks providing extremely large bandwidths are among the most promising solutions to the increasing need for high-speed data transport. A lightpath has a specific route and one or more wavelengths through which the information is routed from the source to the destination node. In wavelength-routed optical networks, data are transmitted solely in the optical domain along lightpaths from source to destination without being converted into the electronic form and each lightpath is allowed to use the same wavelength on all the links along its path. This restriction is known as the wavelength continuity constraint. And it leads to an issue called as blocking in networks. Optical wavelength conversion with suitable Routing and wavelength assignment (RWA) can increase the performance and capacity of optical networks by eliminating this restriction and relaxing the wavelength continuity constraint. In this research, we analyze the problem of placing a limited number of wavelength converters in a mesh network using Weighted Maximum Segment Length (WMSL) converter placement algorithm. It employs Least-Loaded Routing and First-Fit (LLR-FF) RWA algorithm. It is tested on varying number of nodes in network and its respective blocking probabilities are calculated. The proposed algorithm provides the minimum blocking probability on optimal wavelength converters placement.
M-EPAR to Improve the Quality of the MANETsIJERA Editor
In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose modified efficient power aware routing (M-EPAR), a new power aware routing protocol that increases the network lifetime of MANET. Designing a power aware routing algorithm or technique is one of the most important point considered in Mobile Ad Hoc Networks. These nodes are driven by reactive protocols where broadcasting is mandatory to form a path between two nodes. So in case of death of the node resulting out of less battery calls for re-routing. Since many existing techniques focuses on energy aware routing this paper presents combination of energy aware routing merged with link quality determined by packet drop rate. The proposed scheme has outperformed the existing technique in terms of packet delivery ratio, throughput and energy consumption.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
IRJET- Proactive Neighbor Knowledge-based Hybrid Broadcasting in MANETIRJET Journal
This document presents a proactive neighbor knowledge-based hybrid broadcasting (PNKHB) scheme for routing in mobile ad hoc networks (MANETs). The key goals of PNKHB are to reduce routing overhead and energy consumption compared to existing routing protocols like AODV. PNKHB works by proactively building routing tables using neighbor connectivity information, power levels, and link failure probabilities to select stable routes. Simulation results show that PNKHB decreases average energy consumption by up to 43% and 9% compared to AODV and ANKB respectively. It also increases packet delivery ratio by up to 7% over the other protocols.
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.
Throughput Maximization of Cognitive Radio Multi Relay Network with Interfere...IJECEIAES
In this paper, an Orthogonal Frequency Division Multiplexing (OFDM) based cognitive multi relay network is investigated to maximize the transmission rate of the cognitive radio (CR) with enhanced fairness among CR users with interference to the primary users (PUs) being managed below a certain threshold level. In order to improve the transmission rate of the CR, optimization of the subcarrier pairing and power allocation is to be carried out simultaneously. Firstly joint optimization problem is formulated and Composite Genetic and Ordered Subcarrier Pairing (CGOSP) algorithm is proposed to solve the problem. The motivation behind merging genetic and OSP algorithm is to reduce the complexity of Genetic Algorithm (GA). Further, to have a fair allocation of resources among CR users, the Round Robin allocation method is adopted so as to allocate subcarrier pairs to relays efficiently. The degree of fairness of the system is calculated using Jain‟s Fairness Index (JFI). Simulation results demonstrate the significant improvement in transmission rate of the CR, low computational complexity and enhanced fairness.
Performance Comparison of Different Mobility Model on Topology Managed MANETEswar Publications
A wireless ad hoc network is a sovereign system in which users can communicate with each other freely. It can be deployed rapidly at a very low cost, and can be easily managed and extended. Topology management has main objective to maintain a topology connectivity that improves wireless network performance by minimizing energy consumption. Also Topology control with cooperative communication was recently research initiated .Cooperative Communication (CC) is a technique that allows no. of nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. Topology management with cooperative communication is new research
initiated in the field of Mobile Ad-hoc Network. In this paper, we analyze the effect of multi-traffic on the topology managed MANET. We implemented some applications on different mobility models that is OLSR move and random mobility. To simulate all scenario OPNET 14.5 software is used. OPNET is a comprehensive suite of tools for modelling large wired and wireless networks. It uses simulation and emulation to predict the behaviour and performance of networks to improve their design, operation and management.
In the first part of paper, implemented the existed network on the OPNET simulator and evaluate the performance (Download Response Time, Traffic Send and Traffic Receive) of OLSR move based topology control network.
In the second part of paper, evaluated the QoS performanc (Delay, Download Response Time, Traffic Send and Receive Response) of Random Mobility based topology control network. From the simulation results we observed that compare with OLSR move models, the Random mobility model performance is good. We implemented different traffic pattern on two Topology managed MANET.
In the third part of paper, implemented the dynamic traffic pattern like Email, FTP & Voice and video conferencing on the proposed network. Simulation results show that FTP and E-mail both have large download response time in case of OLSR move model rather than Random Mobility model. Traffic send and receive performance of email is good in OLSR-move model. Video Conferencing has good response of traffic send and receive in Random Mobility model.
Impact of energy and link quality indicator with link quality estimators in w...graphhoc
The Link Quality Indicator (LQI) and Residual Energy have a fundamental impact on the network
performance in Wireless Sensor Networks (WSNs) and affects as well in the life time of nodes. This paper
will provide a comparative of Link Quality Estimator, the Link Quality Estimator with Link Quality
Indicator and Link Quality Estimator with Residual Energy. In this paper we develop a Collect Tree
Protocol (CTP) and compare the performance of LQI and Residual Energy, and show their effect on the
packet delivery ratio and throughput, covering the characteristics of low-power links, and their
performance to the best of our knowledge, we believe that our efforts would have implementations on
embedded application.
PALBMRP: Power Aware Load Balancing Multipath Routing Protocol for MANETEswar Publications
A set of mobile hosts or nodes that form a dynamic topology which is ad hoc in nature is called MANET. There are several challenges while designing a routing protocol for MANET due to the limited energy, less processing capability, fewer resources and dynamic environmental changes. Most of the existing energy efficient protocols focuses on choosing a route or path through the nodes with maximum residual energy and distribute a network traffic blindly among generated paths. Network congestion caused due to traffic and node packet carrying capability based on its remaining energy are not considered which leads to increasing number of dead nodes and result in more energy depletion. Hence we have proposed a Power Aware Load Balancing Multipath Routing Protocol (PALBMRP) which selects an optimal energy efficient route based on multiple parameters i.e. residual energy, delay, congestion and hop count and perform load balancing by considering nodes minimal residual energy to transmit packets according to its capacity. The simulation shows the proposed protocol reduced overall energy consumption up to 9%, increased packet delivery ratio up to 12%, and reduced end to end delay up to 3%, compared to AOMDV and LBMMRE-AOMDV [1].
Interference-Aware Multipath Routing In Wireless Sensor NetworksMinor projr...Rakesh Behera
Routing in wireless sensor networks has been considered an important field of research over the past decade. Wireless sensor network essentially consists of data Sensor Nodes and Video Sensor Nodes, which senses both sound and motion of events. Single path routing protocol has been used for route discovery. Though this protocol reduces computation complexity and resource utilization, there are some disadvantages like reduced network throughput, network performance, increased traffic load and delay in data delivery. To overcome these drawbacks a new protocol called Interference Aware Multi-path Routing(IAMR) is proposed to improve the reliability of data transmission, fault-tolerance, Quality of Service. Here, the traffic intersection spread out among the multiple paths. This technique is applied between the sources and sink to reduce routing overhead and energy consumption. The proposed protocol is simulated using NS2
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT On the real time hardware implementa...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Authentication of Secure Data Transmission In Wireless RoutingIJERA Editor
The major objective of our work is to explore a security enhanced dynamic routing algorithm based on distributed routing information widely supported in existing wired and wireless networks. The message authentication is the main area to be considered in WSN’s. Most of the wireless networks are attacked for detecting the data’s that are transmitted in between the users. We aim at the randomization of delivery paths for data transmission to provide considerably small path similarity (i.e., the number of common links between two delivery paths) of two consecutive transmitted packets. The proposed algorithm should be easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP) for wired networks and Destination-Sequenced Distance Vector (DSDV) protocol for wireless networks over existing infrastructures. These protocols shall not increase the number of control messages if the proposed algorithm is adopted. An analytic study will be presented for the proposed routing algorithm, and a series of simulation study will be conducted to verify the analytic results and to show the capability of the proposed algorithm.
Modulation aware connection admission control and uplink scheduling algorithm...ijwmn
Mobile WiMAX standard defines air interface for mobile broadband wireless access (BWA) systems and aimed to provide high data rate with seamless mobility while maintaining the quality of service (QoS). However, QoS of real-time applications depends on the link quality, which necessitate the channel-aware connection admission control (CAC) and scheduling schemes. In this paper Modulation aware CAC scheme and base station (BS) uplink scheduling algorithm are proposed to improve the system capacity and QoS performance respectively. The proposed CAC scheme aims to increase the admission of higher priority real time services by degrading the bandwidth of admitted lower priority connections on the basis of their channel status without deteriorating their QoS performance much. The performances of proposed algorithms are evaluated through simulation by considering the metrics like throughput, delay and number of connections admitted.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Implementing Energy Efficient Strategies in the MANET on-demand routing Proto...IJEEE
Mobile Ad-hoc networks are self-configuring multi-hop wireless networks where, the structure of the network changes dynamically. Because of the nodes in the MANET are mobile and battery operated, energy optimization is one of the major constraints in the MANET. Failure of some nodes operation can greatly impede the performance of the network and even affect the basic availability of the network, i.e., routing. To improve the lifetime of these networks can be improving the energy levels of the individual nodes of the network. This paper presents an analysis of the effects of different design choices for this on- demand routing protocols DSR and AODV in wireless ad hoc networks. In this paper, the energy efficient strategies are implemented in the AODV and DSR protocols to improve the life time of the Mobile ad hoc network. The CBEER-NN is developed using the existing DSR protocol and the AO- EEDTR is developed using the existing AODV protocol. GloMoSIM simulator is used to simulate the proposed MANET environment. This paper also compares the existing DSR and AODV protocols with proposed CBEER- NN and AO-EEDTR protocols. From the simulated results, this paper concludes that the proposed CBEER-NN and AO- EEDTR protocols are improving the life time of the network by improving the average residual energy of the nodes over the existing DSR and AO-EEDTR protocols.
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.
Performance evaluation of proactive, reactive and hybrid routing protocols wi...eSAT Journals
Abstract Our work mainly focused on the performance and effects of different mobility models like Random Waypoint, Reference Point Group, and Manhattan mobility models in different aspects to improve and analyze the behavior of Optimized Link-State Routing (OLSR), Temporally-Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP) routing protocols. These three routing protocols can be classified into the following three general categories, based on the timing when the routes are discovered and updated-proactive (OLSR), reactive (TORA) and hybrid (ZRP). In literature various researchers have discussed the performance issues in AODV, DSDV and DSR routing protocols in Random Waypoint mobility model on Mobile Ad hoc Networks (MANETs) is not satisfactory due to link failure and late acknowledgement. To resolve the specified issue, we have come up with other alternatives like Reference Point Group, and Manhattan mobility model and also other routing protocols like OSLR, TORA and ZRP. A simulation was carried out in NS2 and Bonnmotion for above said protocols and mobility models in Constant Bit Rate (CBR) traffic to analyzed using various metrics like packet delivery fraction, end to end delay and normalized routing load. In our simulation it was shown that few mobility model performed better in different routing protocols. In our simulation results, we got a high Normalized Routing Load for Random Waypoint compared to Reference Point Group, and Manhattan mobility model in both DRP and OSLR protocols. Index Terms: MANET, CBR, Routing protocols, Mobility models, NS2
In wireless distributed sensor networks, one open problem is how to guarantee the reliable relay
selection based on the quality of services diversity. To address this problem, we focus on the reliable
adaptive relay selection approach and adaptive QoS supported algorithm, based on which we present a
Markov chain model, in consideration of different packet states and error control algorithm assignment.
The mathematical analyses and MATLAB simulation results show that the proposed relay selection
approach could perform better in terms of saturation throughput, reliability, and energy efficiency,
compared with the traditional approaches. More importantly, the quality of real-time multimedia streaming
is improved significantly, in terms of decodable frame ratio and delay.
Ultrasound images and SAR i.e. synthetic aperture radar images are usually corrupted because of speckle
noise also called as granular noise. It is quite a tedious task to remove such noise and analyze those
corrupted images. Till now many researchers worked to remove speckle noise using frequency domain
methods, temporal methods, and adaptive methods. Different filters have been developed as Mean and
Median filters, Statistic Lee filter, Statistic Kuan filter, Frost filter, Srad filter. This paper reviews filters
used to remove speckle noise.
TARGET LOCALIZATION IN WIRELESS SENSOR NETWORKS BASED ON RECEIVED SIGNAL STRE...sipij
We consider the problem of localizing a target taking the help of a set of anchor beacon nodes. A small
number of beacon nodes are deployed at known locations in the area. The target can detect a beacon
provided it happens to lie within the beacon’s transmission range. Thus, the target obtains a measurement
vector containing the readings of the beacons: ‘1’ corresponding to a beacon if it is able to detect the
target, and ‘0’ if the beacon is not able to detect the target. The goal is twofold: to determine the location
of the target based on the binary measurement vector at the target; and to study the behaviour of the
localization uncertainty as a function of the beacon transmission range (sensing radius) and the number of
beacons deployed. Beacon transmission range means signal strength of the beacon to transmit and receive
the signals which is called as Received Signal Strength (RSS). To localize the target, we propose a gridmapping
based approach, where the readings corresponding to locations on a grid overlaid on the region
of interest are used to localize the target. To study the behaviour of the localization uncertainty as a
function of the sensing radius and number of beacons, extensive simulations and numerical experiments
are carried out. The results provide insights into the importance of optimally setting the sensing radius and
the improvement obtainable with increasing number of beacons.
Automatic meal inspection system using lbp hf feature for central kitchensipij
This paper proposes an intelligent and automatic meal inspection system which can be applied to the meal
inspection for the application of central kitchen automation. The diet specifically designed for the patients are required with providing personalized diet such as low sodium intake or some necessary food. Hence,
the proposed system can benefit the inspection process that is often performed manually. In the proposed
system, firstly, the meal box can be detected and located automatically with the vision-based method and
then all the food ingredients can be identified by using the color and LBP-HF texture features. Secondly,
the quantity for each of food ingredient is estimated by using the image depth information. The experimental results show that the meal inspection accuracy can approach 80%, meal inspection efficiency can reach1200ms, and the food quantity accuracy is about 90%. The proposed system is expected to increase the capacity of meal supply over 50% and be helpful to the dietician in the hospital for saving the time in the diet inspection process.
FUZZY CLUSTERING BASED GLAUCOMA DETECTION USING THE CDR sipij
This document presents a new method for glaucoma detection using cup-to-disc ratio (CDR) calculation on fundus eye images. The method uses fuzzy C-means clustering combined with thresholding to extract the optic disc and optic cup from color fundus images. It calculates the vertical CDR automatically. The method was tested on 365 fundus images from public databases and an ophthalmologist, showing promising results for clinical use in glaucoma screening.
A Hybrid Architecture for Tracking People in Real-Time Using a Video Surveill...sipij
This paper describes a novel method for tracking customers using images taken from video-surveillance
cameras. This system analyzes the number of customers and their motions through the aisles of big-box
stores (supermarkets) in real-time. The originality of our approach is based on the study of the blobs
properties for managing the splitting/merging issues using a mathematical morphology operator. In the
order hand, in order to manage a high number of customers in real-time, we combine the advantage of two
tracking algorithms.
DESIGN REALIZATION AND PERFORMANCE EVALUATION OF AN ACOUSTIC ECHO CANCELLATIO...sipij
Nowadays, in the field of communications, AEC (acoustic echo cancellation) is truly essential with respect
to the quality of multimedia transmission. In this paper, we designed and developed an efficient AEC based
on adaptive filters to improve quality of service in telecommunications against the phenomena of acoustic
echo, which is indeed a problem in hands-free communications.The main advantage of the proposed algorithm is its capacity of tracking non-stationary signals such as acoustic echo. In this work the acoustic echo cancellation (AEC) is modeled using a digital signal
processing technique especially Simulink Blocksets. The algorithm’s code is generated in Matlab Simulink
programming environment. At simulation level, results of simulink implementation prove that module
behavior is realistic when it comes to cancellation of echo in hands free communication using adaptive algorithm.Results obtained with our algorithm in terms of ERLE criteria are confronted to IUT-T recommendation
G.168.
A R EVIEW P APER : N OISE M ODELS IN D IGITAL I MAGE P ROCESSINGsipij
Noise is always presents in digital images during
image acquisition, coding, transmission, and proces
sing
steps. Noise is very difficult to remove it from t
he digital images without the prior knowledge of no
ise
model. That is why, review of noise models are esse
ntial in the study of image denoising techniques. I
n this
paper, we express a brief overview of various noise
models. These noise models can be selected by anal
ysis
of their origin. In this way, we present a complete
and quantitative analysis of noise models availabl
e in
digital images.
A FLUXGATE SENSOR APPLICATION: COIN IDENTIFICATIONsipij
Today, coins are used to operate many electric devices that are open to the public service. Washing machines, play stations, computers, auto brooms, foam machines, beverage machines, telephone chargers, hair dryers and water heaters are some examples of these devices These devices include coin recognition systems. In these systems, there are coils at two different radius, which become electromagnets when the
current is passed through them. The AC current supplied to the coils creates a variable magnetic field, which induces the eddy current on the coil during the passing of money. The magnetic field generated by the Eddy current reduces the current passing through the coil. The amount of change of current in the coil gives information about the coin; the type of metal (element) and the amount of metal (element). In this
study, a new coin identification system (magnetic measurement system) is designed. In this system, the
magnetic anomaly generated by the coin as a result of applying direct current to the coils is tried to be
detected by fluxgate sensor. In this study, sensor voltages are acquired in computer environment by using
developed electronic unit and LabVIEW based software. In the paper, experimental results have been
discussed in detail.
Stem calyx recognition of an apple using shape descriptorssipij
This paper presents a novel method to recognize stem - calyx of an apple using shape descriptors. The main
drawback of existing apple grading techniques is that stem - calyx part of an apple is treated as defects,
this leads to poor grading of apples. In order to overcome this drawback, we proposed an approach to
recognize stem-calyx and differentiated from true defects based on shape features. Our method comprises
of steps such as segmentation of apple using grow-cut method, candidate objects such as stem-calyx and
small defects are detected using multi-threshold segmentation. The shape features are extracted from
detected objects using Multifractal, Fourier and Radon descriptor and finally stem-calyx regions are
recognized and differentiated from true defects using SVM classifier. The proposed algorithm is evaluated
using experiments conducted on apple image dataset and results exhibit considerable improvement in
recognition of stem-calyx region compared to other techniques.
Efficient pu mode decision and motion estimation for h.264 avc to hevc transc...sipij
H.264/AVC has been widely applied to various applications. However, a new video compression standard,
High Efficient Video Coding (HEVC), had been finalized in 2013. In this work, a fast transcoder from
H.264/AVC to HEVC is proposed. The proposed algorithm includes the fast prediction unit (PU) decision
and the fast motion estimation. With the strong relation between H.264/AVC and HEVC, the modes,
residuals, and variance of motion vectors (MVs) extracted from H.264/AVC can be reused to predict the
current encoding PU of HEVC. Furthermore, the MVs from H.264/AVC are used to decide the search
range of PU during motion estimation. Simulation results show that the proposed algorithm can save up to
53% of the encoding time and maintains the rate-distortion (R-D) performance for HEVC.
Optimized Biometric System Based on Combination of Face Images and Log Transf...sipij
The biometrics are used to identify a person effectively. In this paper, we propose optimised Face
recognition system based on log transformation and combination of face image features vectors. The face
images are preprocessed using Gaussian filter to enhance the quality of an image. The log transformation
is applied on enhanced image to generate features. The feature vectors of many images of a single person
image are converted into single vector using average arithmetic addition. The Euclidian distance(ED) is
used to compare test image feature vector with database feature vectors to identify a person. It is
experimented that, the performance of proposed algorithm is better compared to existing algorithms.
The document describes an optical character recognition (OCR) system for recognizing characters in historical records written in the Kannada language. The system uses Gabor and zonal feature extraction along with an artificial neural network for classification. It was tested on nearly 150 samples of ancient Kannada epigraphs from the Ashoka and Hoysala periods, achieving average recognition accuracies of 80.2% and 75.6% respectively. The key steps of the OCR system include preprocessing images, segmenting characters, extracting Gabor and zonal features, training an ANN classifier, and mapping recognized characters to a modern form.
MULTIPLE OBJECTS TRACKING IN SURVEILLANCE VIDEO USING COLOR AND HU MOMENTSsipij
Multiple objects tracking finds its applications in many high level vision analysis like object behaviour
interpretation and gait recognition. In this paper, a feature based method to track the multiple moving
objects in surveillance video sequence is proposed. Object tracking is done by extracting the color and Hu
moments features from the motion segmented object blob and establishing the association of objects in the
successive frames of the video sequence based on Chi-Square dissimilarity measure and nearest neighbor
classifier. The benchmark IEEE PETS and IEEE Change Detection datasets has been used to show the
robustness of the proposed method. The proposed method is assessed quantitatively using the precision and
recall accuracy metrics. Further, comparative evaluation with related works has been carried out to exhibit
the efficacy of the proposed method.
A BINARY TO RESIDUE CONVERSION USING NEW PROPOSED NON-COPRIME MODULI SETsipij
Residue Number System is generally supposed to use co-prime moduli set. Non-coprime moduli sets are a
field in RNS which is little studied. That's why this work was devoted to them. The resources that discuss
non-coprime in RNS are very limited. For the previous reasons, this paper analyses the RNS conversion
using suggested non-coprime moduli set.
This paper suggests a new non-coprime moduli set and investigates its performance. The suggested new
moduli set has the general representation as {2n
–2, 2n
, 2n+2}, where n ∈ {2,3,…..,∞}. The calculations
among the moduli are done with this n value. These moduli are 2 spaces apart on the numbers line from
each other. This range helps in the algorithm’s calculations as to be shown.
The proposed non-coprime moduli set is investigated. Conversion algorithm from Binary to Residue is
developed. Correctness of the algorithm was obtained through simulation program. Conversion algorithm
is implemented.
An Innovative Moving Object Detection and Tracking System by Using Modified R...sipij
The ultimate goal of this study is to afford enhanced video object detection and tracking by eliminating the
limitations which are existing nowadays. Although high performance ratio for video object detection and
tracking is achieved in the earlier work it takes more time for computation. Consequently we are in need to
propose a novel video object detection and tracking technique so as to minimize the computational
complexity. Our proposed technique covers five stages they are preprocessing, segmentation, feature
extraction, background subtraction and hole filling. Originally the video clip in the database is split into
frames. Then preprocessing is performed so as to get rid of noise, an adaptive median filter is used in this
stage to eliminate the noise. The preprocessed image then undergoes segmentation by means of modified
region growing algorithm. The segmented image is subjected to feature extraction phase so as to extract
the multi features from the segmented image and the background image, the feature value thus obtained
are compared so as to attain optimal value, consequently a foreground image is attained in this stage. The
foreground image is then subjected to morphological operations of erosion and dilation so as to fill the
holes and to get the object accurately as these foreground image contains holes and discontinuities. Thus
the moving object is tracked in this stage. This method will be employed in MATLAB platform and the
outcomes will be studied and compared with the existing techniques so as to reveal the performance of the
novel video object detection and tracking technique.
Objective Quality Assessment of Image Enhancement Methods in Digital Mammogra...sipij
Breast cancer is the most common cancer among women worldwide constituting more than 25%
of all cancer incidences occurring in the world [1]. Statistics show that US, India and China
account for more than one third of all breast cancer cases [2]. Also, there has been a steady
increase in the breast cancer incidence among young generation in the world. In India, one out of
two women die after being detected with breast cancer where as in China it is one in four and in
USA it is one in eight [2]. Therefore, the statistics show that cancer mortality is highest in India
among all other nations in the world. In US, though the number of women diagnosed with cancer
is more than that in India, their mortality
INHIBITION AND SET-SHIFTING TASKS IN CENTRAL EXECUTIVE FUNCTION OF WORKING ME...sipij
Understanding of neuro-dynamics of a complex higher cognitive process, Working Memory (WM) is
challenging. In WM, information processing occurs through four subsystems: phonological loop, visual
sketch pad, memory buffer and central executive function (CEF). CEF plays a principal role in WM. In this
study, our objective was to understand the neurospatial correlates of CEF during inhibition and set-shifting
processes. Thirty healthy educated subjects were selected. Event-Related Potential (ERP) related to visual
inhibition and set-shifting task was collected using 32 channel EEG system. Activation of those ERPs
components was analyzed using amplitudes of positive and negative peaks. Experiment was controlled
using certain parametric constraints to judge behavior, based on average responses in order to establish
relationship between ERP and local area of brain activation and represented using standardized low
resolution brain electromagnetic tomography. The average score of correct responses was higher for
inhibition task (87.5%) as compared to set-shifting task (59.5%). The peak amplitude of neuronal activity
for inhibition task was lower compared to set-shifting task in fronto-parieto-central regions. Hence this
proposed paradigm and technique can be used to measure inhibition and set-shifting neuronal processes in
understanding pathological central executive functioning in patients with neuro-psychiatric disorders.
DETERMINATION OF BURIED MAGNETIC MATERIAL’S GEOMETRIC DIMENSIONSsipij
It is important to find buried magnetic material’s geometric features that are parallel to the soil surface in
order to determine anti-tank and anti-personnel mine compatible to standards. So that it is possible to
decrease the number of false alarms by separating the samples that have got non-standard geometries. For
this purpose, in this study the anomalies occurred at horizontal component of the earth’s magnetic field by
buried samples are determined with magnetic sensor. In the study, KMZ51 AMR is used as the magnetic
sensor. The position-controlled movement of the sensor along x-y axis is provided with 2D scanning system.
Trigger values of sensor output are evaluated with respect to the scanning field. The experiments are
redone for the samples at different geometries and variables are defined for geometric analysis. The
experimental conclusions obtained from this paper will be discussed in detail.
IMPACT OF ENERGY AND LINK QUALITY INDICATOR WITH LINK QUALITY ESTIMATORS IN W...Fransiskeran
The Link Quality Indicator (LQI) and Residual Energy have a fundamental impact on the network
performance in Wireless Sensor Networks (WSNs) and affects as well in the life time of nodes. This paper
will provide a comparative of Link Quality Estimator, the Link Quality Estimator with Link Quality
Indicator and Link Quality Estimator with Residual Energy. In this paper we develop a Collect Tree
Protocol (CTP) and compare the performance of LQI and Residual Energy, and show their effect on the
packet delivery ratio and throughput, covering the characteristics of low-power links, and their
performance to the best of our knowledge, we believe that our efforts would have implementations on
embedded application.
MMINIMUM RESOURCE CONSUMPTIONS ROUTING FOR OPTICAL NETWORKSprj_publication
The problem of determining primary and backup paths for survivable optical WDM
networks is considered. Results of various available routing techniques that try to minimize
the combined cost of primary and the backup path are analyzed for the effects on network
parameters such as mean load, variance of the load on route, number of converters required
by the route and the length of the route. The route cost is modelled such a way that it is
extensible to include any new parameter and vary their relative importance. The efficiency of
such wavelength routed networks has been proved to improve for certain parameters, such as
reduction in blocking probability and number of converters required for desired performance.
The routing is enhanced to analyse effect on network parameters for all node full range
converters, limited number full converters, reserved primary and back up wavelengths and
with no such reservation.
Fault Tolerant Congestion based Algorithms in OBS NetworkCSCJournals
In Optical Burst Switched networks, each light path carry huge amount of traffic, path failures may damage the user application. Hence fault-tolerance becomes an important issue on these networks. Blocking probability is a key index of quality of service in Optical Burst Switched (OBS) network. The Erlang formula has been used extensively in the traffic engineering of optical communication to calculate the blocking probability. The paper revisits burst contention resolution problems in OBS networks. When the network is overloaded, no contention resolution scheme would effectively avoid the collision and cause blocking. It is important to first decide, a good routing algorithm and then to choose a wavelength assignment scheme. In this paper we have developed two algorithms, Fault Tolerant Optimized Blocking Algorithm (FTOBA) and Fault Tolerant Least Congestion Algorithm (FTLCA) and then compare the performance of these algorithms on the basis of blocking probability. These algorithms are based upon the congestion on path in OBS network and based on the simulation results, we shows that the reliable and fault tolerant routing algorithms reduces the blocking probability.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR
Enhancing Performance for Orthogonal Frequency Division Multiplexing in Wirel...IRJET Journal
The document discusses enhancing the performance of Orthogonal Frequency Division Multiplexing (OFDM) in wireless systems. It proposes using a technique called Selective Level Mapping (SLM) to reduce the peak-to-average power ratio (PAPR) of OFDM signals. PAPR reduction is important for OFDM systems to improve power amplifier efficiency. The document describes a "Class-III SLM scheme" that can generate multiple alternative OFDM signal sequences using only one inverse fast Fourier transform, helping to reduce complexity. It proposes a selection method for rotation values that can achieve optimal PAPR reduction while balancing the load across components. Simulation results show the proposed method achieves better PAPR reduction performance than conventional methods
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...inventionjournals
This document summarizes a research paper that proposes a new routing algorithm called the Link Prediction Routing Algorithm (LPRA) for mobile ad hoc networks. The LPRA aims to establish reliable links and perform persistent data forwarding based on predicting node and link lifetimes. It does so by selecting routes with the longest predicted lifetimes. The algorithm is evaluated through simulation and shown to improve performance metrics like throughput, delivery ratio, and delay compared to existing techniques. It aims to efficiently route data in unstable mobile ad hoc networks where topology frequently changes.
Analysis of FSR, LANMAR and DYMO under MANETidescitation
A movable ad hoc system (MANET) is a self-configuring communications set of
connections of mobile procedure associated by wireless. Each mechanism in a MANET is
free to move independently in some way, and will therefore modify its relations to other
devices frequently [2]. The primary purpose of any ad-hoc network routing protocol is to
meet the challenges of the dynamically changing topology and establish an efficient route
connecting every two nodes. In this paper three protocols FSR, LANMAR and DYMO are
compared by using random waypoint mobility in few nodes with varying packet sizes in
CBR traffic. The parameters or metrics are used to assess the performance of protocols with
and without Black Hole attack, that are data Packet Delivery ratio and Average Jitter with
varying data traffic CBR (Constant Bit Ratio) using Qual Net 5.0.2 simulator.
4 ijaems jan-2016-8-performance analysis of mixed line rate optical wdm netwo...INFOGAIN PUBLICATION
Due to heterogeneous traffic in next generation Mixed Line Rate (MLR) networks are capable of delivering different bandwidth in a flexible manner. In this paper a simple routing algorithm is proposed to study the case of any link failure in MLR WDM networks. Here Poisson random traffic is used as a dynamic traffic for 24-hour duration. The proposed work can be achieved by deleting the failed link and then finding the new best possible shortest path between source and destination node. According to the traffic load light paths adjustments employ the addition of light paths under congestion and deletion of lightpaths which are not being used at a particular time. Simulation result shows the total number of lightpaths used, total number of addition and deletion of light paths under link safe and link failure case in mixed line rate (MLR) and single line rate (SLR) optical WDM networks.
This document proposes a new fuzzy logic-based routing protocol for mobile ad-hoc networks (MANETs) that considers path stability, residual energy of nodes, and bandwidth for optimal path selection at the source node. It also proposes adjusting the transmission rate at the source node based on end-to-end delay and packet loss ratio measured at the destination node. This cross-layer approach uses two fuzzy logic systems - one for path selection based on stability and bandwidth, and another for transmission rate adjustment based on delay and packet loss. The goal is to select stable paths and prevent congestion for more efficient data transmission in MANETs.
Performance Analysis of Energy Efficient Cross Layer Load Balancing in Tactic...IRJET Journal
This document analyzes the performance of energy efficient cross-layer load balancing in tactical multi-gateway wireless sensor networks. It compares the performance of AODV routing under four different modes: Normal, Optimal, Compressed, and Optimal Compressed. The Optimal Compressed mode uses both load balancing and data compression (Run Length Encoding) and performs best with the lowest delay, highest energy fairness, lowest packet loss rate, and lowest routing overhead according to simulations run in NS2. The proposed approach of using both load balancing and compression outperforms using either technique alone or without them, improving important network metrics like lifetime.
Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energ...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
Solving bandwidth guaranteed routing problem using routing dataIJCNCJournal
This paper introduces a traffic engineering routing algorithm that aims to accept as many routing demands
as possible on the condition that a certain amount of bandwidth resource is reserved for each accepted
demand. The novel idea is to select routes based on not only network states but also information derived
from routing data such as probabilities of the ingress egress pairs and usage frequencies of the links.
Experiments with respect to acceptance ratio and computation time have been conducted against various
test sets. Results indicate that the proposed algorithm has better performance than the existing popular algorithms including Minimum Interference Routing Algorithm (MIRA) and Random Race based Algorithm for Traffic Engineering (RRATE)
.
QUALITY OF SERVICE ROUTING IN MOBILE AD HOC NETWORKS USING LOCATION AND ENERG...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multi path protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
Joint Routing and Congestion Control in Multipath Channel based on Signal to ...IJECEIAES
Routing protocol and congestion control in Transmission Control Protocol (TCP) have important roles in wireless mobile network performance. In wireless communication, the stability of the path and successful data transmission will be influenced by the channel condition. This channel condition constraints come from path loss and the multipath channel fading. With these constraints, the algorithm in the routing protocol and congestion control is confronted with the uncertainty of connection quality and probability of successful packet transmission, respectively. It is important to investigate the reliability and robustness of routing protocol and congestion control algorithms in dealing with such situation. In this paper, we develop a detailed approach and analytical throughput performance with a cross layer scheme (CLS) between routing and congestion control mechanism based on signal to noise ratio (SNR) in Rician and Rayleigh as multipath fading channel. We proposed joint routing and congestion control TCP with a cross layer scheme model based on SNR (RTCP-SNR). We compare the performance of RTCP-SNR with conventional routing-TCP and routing-TCP that used CLS with routing aware (RTCP-RA) model. The analyses and the simulation results showed that RTCP-SNR in a multipath channel outperforms conventional routing-TCP and RTCP-RA.
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 Wavelength and Converter Assignment Scheme Using Converter Usage History in...IJCNCJournal
The document proposes a wavelength and converter assignment scheme for wavelength-routed networks to decrease lightpath blocking probability with a limited number of converters. The key points are:
1) The scheme avoids contention among multiple lightpath requests by making each node-pair perform wavelength conversion at different intermediate nodes, based on the intermediate nodes' converter usage history.
2) It assigns wavelength conversion costs to intermediate nodes based on their historical converter usage and number of idle converters, aiming to use different converters for different node-pairs and keep more converters available.
3) Simulation results show the proposed scheme decreases blocking probability by 44-83% compared to conventional schemes, and needs 1-2 fewer converters per node to achieve near-
ANALYSIS AND STUDY OF MATHEMATICAL MODELS FOR RWA PROBLEM IN OPTICAL NETWORKSIJEEE
Blocking probability has been one of the key performance to solve Routing and Wavelength Assignment problem (RWA) indexes in the design of wavelength-routed all-optical WDM networks. To evaluate blocking probability different analytical model are introduced.
A Performance Comparison of Routing Protocols for Ad Hoc NetworksIJERA Editor
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many routing protocols have been proposed like OLSR, AODV so far to improve the routing performance and reliability. In this paper, we describe the Optimized Link State Routing Protocol (OLSR) and the Ad hoc On-Demand Distance Vector (AODV). We evaluate their performance through exhaustive simulations using the Network Simulator 2 (ns2) by varying conditions (node mobility, network density).
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...ijngnjournal
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing protocols is to establish routes between node pairs so that messages may be delivered reliably and in a timely manner. The objective of any routing protocol is to have packet delivered with least possible cost in terms of receiving power, transmission power, battery energy consumption and distance. All these factors basically effect the establishment of link between the mobile nodes and liability and stability of these links. In this paper, we implement a data link quality scheme on two protocols ODMRP and ADMR and compare them on the bases link quality and link stability.
Similar to AN MINIMUM RECONFIGURATION PROBABILITY ROUTING ALGORITHM FOR RWA IN ALL-OPTICAL NETWORKS (20)
Elevate Your Nonprofit's Online Presence_ A Guide to Effective SEO Strategies...TechSoup
Whether you're new to SEO or looking to refine your existing strategies, this webinar will provide you with actionable insights and practical tips to elevate your nonprofit's online presence.
How to Setup Default Value for a Field in Odoo 17Celine George
In Odoo, we can set a default value for a field during the creation of a record for a model. We have many methods in odoo for setting a default value to the field.
How to Download & Install Module From the Odoo App Store in Odoo 17Celine George
Custom modules offer the flexibility to extend Odoo's capabilities, address unique requirements, and optimize workflows to align seamlessly with your organization's processes. By leveraging custom modules, businesses can unlock greater efficiency, productivity, and innovation, empowering them to stay competitive in today's dynamic market landscape. In this tutorial, we'll guide you step by step on how to easily download and install modules from the Odoo App Store.
Andreas Schleicher presents PISA 2022 Volume III - Creative Thinking - 18 Jun...EduSkills OECD
Andreas Schleicher, Director of Education and Skills at the OECD presents at the launch of PISA 2022 Volume III - Creative Minds, Creative Schools on 18 June 2024.
AN MINIMUM RECONFIGURATION PROBABILITY ROUTING ALGORITHM FOR RWA IN ALL-OPTICAL NETWORKS
1. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
DOI : 10.5121/sipij.2016.7604 39
AN MINIMUM RECONFIGURATION
PROBABILITY ROUTING ALGORITHM FOR
RWA IN ALL-OPTICAL NETWORKS
Mohan Kumar S1
and Jagadeesha S N2
1
Ph.D, Research Center, Jawaharalal Nehru National College of Engineering, Shimoga,
Karnataka, India
2
Department of Electronics and Communication Engineering, PES Institute of Technology and
Management, shivamogga. Karnataka, India
ABSTRACT
In this paper, we present a detailed study of Minimum Reconfiguration Probability Routing (MRPR)
algorithm, and its performance evaluation in comparison with Adaptive unconstrained routing (AUR) and
Least Loaded routing (LLR) algorithms. We have minimized the effects of failures on link and router failure
in the network under changing load conditions, we assess the probability of service and number of light
path failures due to link or route failure on Wavelength Interchange(WI) network. The computation
complexity is reduced by using Kalman Filter(KF) techniques. The minimum reconfiguration probability
routing (MRPR) algorithm selects most reliable routes and assign wavelengths to connections in a manner
that utilizes the light path(LP) established efficiently considering all possible requests.
KEYWORDS
Routing Wavelength Assignment (RWA), Blocking Probability(BP) Network Management(NM), Kalman
Filter(KF), Wavelength Interchange(WI), Light Path(LP), Process Noise(PN), Least Loaded Routing(LLR),
Minimum Reconfiguration Probability Routing (MRPR), Adaptive Unconstrained Routing(AUR)
1. INTRODUCTION
In this paper, we have considered Minimum Reconfiguration Probability Routing algorithm for
Routing and Wavelength Assignment (RWA) for Wavlength Interchange(WI) network. It has
scalable architecture and has mesh like structure consisting of links having one or more fibers at
each input port to output port in the optical domain. The challenging problem in these networks
are Routing and Wavelength Assignment and controlling problems. In these problems, provision
of connections, called lightpaths in a scalable architecture usually span multiple links. Hence,
light path might be assigned to different links along its route. This process is called Routing and
Wavelength Assignment. In this process, a lightpath shares one or more fibers links and different
wavelengths. To establish a lightpath, a route should be discovered between source and
destination, and suitable wavelength need to be assigned to that route. Some of the commonly
used performance criteria for Routing and Wavelength Assignment are throughput and blocking
2. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
40
probability[10]. There are many RWA algorithms proposed for this purpose with optimal
solutions[10]. The main assumption of these algorithms are that, traffic volume is static for a
long time period and these networks are reconfigured only to reflect changes in the long term
traffic demand[1]. Although static demand has been reasonable a assumption for voice data
communication. In current trends and future, data intensive networks are rapidly changing.
Therefore dynamic RWA algorithms which support request arrivals and lightpath terminations at
stochastic/randaom times are needed. Hence, predefined set of routes are searched in a predefined
order to accommodate the request. Then the smallest index randomly selects a wavelength
available on the route. If not, request is blocked. Usually one or more minimum hop routes are
used and fixed order search is carried out without taking into account, the congestion on the link.
In this paper, we present the comparative study and performance evaluation of Minimum
Reconfiguration Probability Routing (MRPR) algorithm, over Adaptive Unconstrained Routing
(AUR) and Least Loaded Routing (LLR) methods.
An Optical switch has ability to minimize the effects of failures on network performance by using
a suitable routing and wavelength assignment method without disturbing other performance
criteria such as network management and blocking probability[4]. The main challenge in the
Wavelength Interchange (WI) and Wavelength Routing Network (WRN) are the provision of
connections called lightpaths between the users of network. One of the Routing Wavelength
Assignment method known as Minimum Reconfiguration Probability Routing algorithm is
implemented [3][15]. Its performance comparison study over AUR and LLR are presented. This
algorithm makes use of the network state information at the time of routing to find the optimum
path. By choosing as much reliable router/links as possible in the RWA process, it is possible to
minimize the mean number of light paths broken due to failure. However, considering only
reliability characteristics, lightpaths may have to be routed on longer routes and blocking
performance may be reduced significantly. For this reason, the algorithm is based on the joint
optimization of the probability of reconfiguration due to router/link failures and probability of
blocking for the future requests. Therefore effect of potential router/link failures and blocking
probability is measured and also minimized without disturbing performance. Hence, lightpath
arrival/holding time and failure arrival statistics collected for each link and router, as well as the
network state information collected and updated using kalman filter methods at the time of
request arrival are used in routing decisions. That is, the behavior of the network is predicted by
current state information and statistics of the past, to assign the most reliable path to the lightpath
requests[9]. The routing algorithms proposed so far for optical networks uses present state of
the network[3]. Using this information most of authors proposed wavelength pair routing and
wavelenght assigment function. An adaptive RWA algorithm makes use of the network state
information at the time of routing to find the optimum path. Least loaded routing(LLR) and
Adaptive Unconstrained Routing (AUR) are the examples for adaptive RWA process[3].
In the following section, we present a MRPR for routing and wavelength assignment for the most
reliable route-wavelength pair for a light path request. It uses the lightpath request arrival
statistics between the routers, and failure arrival statistics for links and Kalman filter employed on
router/linker to predict network state and the reconfiguration probability of route-wavelength
pairs, and hence selects the most reliable route-wavelength pair. Finally a comparative study and
performance are presented in the section 3.0. The results and concluding remarks and directions
for future work are presented in the section 4.0 and section 5.0.
3. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
41
2. MRPR IN WI NETWORKS
In Wavelength Interchange networks, wavelength routers have a full set of wavelength converters
at the output ports and they are able to change the wavelength over every light path passing
through it. Hence, blocking of requests leading to wavelength conficts, can be measured and
reduced significantly[15]. Wavelength router can also change the wavelength, it optimally reduce
the ligth path routing problem after wavelength assignment problem is solved.
The minimum reconfiguration probability routing algorithm is statistically predictive optimal
routing and wavelength assignment algorithm because; it aims to assign the most reliable route-
wavelength pair for a lightpath request. It uses the lightpath request arrival and failure statistics
information from the routers, and predicts the reconfiguration probability of route-wavelength
pairs, and selects the most reliable route-wavelength pair. The algorithm starts by assigning a cost
value to each network element (router/link) and a multiple shortest path computed, then an
optimal shortest path is used as the most reliable path. To find the shortest route with minimum
reconfiguration probability of light path request for reliable path for share per node (SpN)
network, we use the Bellman Ford algorithm to find the shortest path. A kalman filter is
employed at each router/link to retrieve the state of network and minimum reconfiguration
probability of light path request for reliable path reconfiguring for the WI network. The following
two sections determine these costs, and its route, a lightpath through the network.
2.1 COST DETERMINATION
Let ‘x’ be a random variable representing failure inter-arrival times, ݂ሺݔሻ be the probability
density function of failure inter-arrival times for link (i, j), y be a random variable representing
lightpath holding times and ℎ௦ௗሺݕሻ be the probability density function of lightpath times for the
router/link pair from source to destination (s-d). It is possible to evaluate the probability of failure
of lightpath of the link (i, j), between routers source‘s’ and destination ‘d’ using these parameters.
Let ܲ௦ௗ
be the probability of failure of lightpath in link (i, j) between router source and
destination. It is given by:
ܲ௦ௗ
= ሺ ℎ௦ௗሺݕሻ݂ሺݔሻ݀ݔ݀ݕ ሻ
௬
௫ୀିஶ
∞
௬ୀିஶ
(1)
It is assumed that the failure arrival method is memory-less, hence it is the probability of failure of
lightpath of the link (i, j) in the interval (t, t+dt). It will not fail prior to the time t, hence it is
independent of time t.
Rewriting the equation (1).
ܲ௦ௗ
= ൣ ݂ሺݔሻ
௬
௫ୀିஶ
݀ݔ൧
∞
௬ୀିஶ
ℎ௦ௗሺݕሻ݀ݕ = ݃ሺݕሻℎ௦ௗሺݕሻ݀ݕ
∞
௬ୀିஶ
(2)
Tchebycheff Inequality[21], is a measure of the concentration of a random variable near its mean
µ and its variance v= σ2
, and can be used to find the upper bound for equation (2).
ܲ௦ௗ
ሾݔ − ߤሿ ≥ ε} = ݂ሺݔሻ݀ݔ +
௫ିఓ
ିஶ
݂ሺݔሻ݀ݔ ≤
∞
௫ାఓ
ఌమ
(3)
4. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
42
Where ε>0 and the ݂ሺݔሻ is symmetric around its mean value.
Hence,
݃ሺݕሻ = ݂ሺݔሻ݀ݔ ≤
ೞ
ೕ
ଶሺఓೞ
ೕ
ି௬ሻమ
௬
௫ୀିஶ
(4)
Using equation (4) and equation (2), we get
ܲ௦ௗ
≤
ೞ
ೕ
ଶሺఓೞ
ೕ
ି௬ሻమ
∞
௬ୀିஶ
ℎ௦ௗሺݕሻ݀ݕ (5)
The estimation of upper bound is as follows
The mean of g(y) is given by
ܧሼ݃ሺݕሻ} = ݃ሺݕሻℎሺݕሻ݀ݕ
ஶ
ିஶ
≅ ݃ሺߤሻ + ݃ᇱ ሺߤሻ
ଶ
(6)
By using equation (6) in equation (2), we get
ܲ௦ௗ
≤
ೞ
ೕ
ଶሺఓೞ
ೕ
ି௬ሻమ
∞
௬ୀିஶ
ℎ௦ௗሺݕሻ݀ݕ ≅
ೞ
ೕ
ଶሺఓೞ
ೕ
ିఓ
ೞ
ሻమ
+
ଷೞ
ೕ
ೞ
ೞ
ଶሺఓೞ
ೕ
ିఓ
ೞ
ሻర
(7)
After simplification, we get:
ܲ௦ௗ
≤
ೞ
ೕ
ଶሺఓೞ
ೕ
ିఓ
ೞ
ሻమ
1 +
ଷ
ೞ
ሺఓೞ
ೕ
ିఓ
ೞ
ሻమ
൨ (8)
From the above, the link (i, j) failure probability is given by,
ܲ௦ௗ
= ቐ
1
݉݅݊ ቊ1,
ೞ
ೕ
ଶቀఓೞ
ೕ
ିఓ
ೞ
ቁ
మ ቈ1 +
ଷ
ೞ
ቀఓೞ
ೕ
ିఓ
ೞ
ቁ
మ ቋ
ሺ,ሻ௦ ௨௬ ௨ௗ
௧௪௦
(9)
And similarly, the router jth
failure probability is given by
ܳ௦ௗ
= ቐ
1
݉݅݊ ቊ1,
ೕ
ଶሺఓೞ
ೕ
ିఓ
ೞ
ሻమ
1 +
ଷ
ೞ
ሺఓೞ
ೕ
ିఓ
ೞ
ሻమ
൨ቋ
ௗ ௦ ௗ,
௧௪௦
(10)
From the above method, the cost of using link (i,j) and router j for a lightpath from source to
destination can be written as:
ܥ௦ௗ
= − ln൫1 − ܲ௦ௗ
൯ , ܥ௦ௗ
= − ln൫1 − ܳ௦ௗ
൯, (11)
5. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
43
2.2 Routing decision for MRPR, LLR and AUR techniques
In the previous section ܲ௦ௗ
and ܳ௦ௗ
represent the estimated failure probabilities. Then the
൫1 − ܲ௦ௗ
൯ and ൫1 − ܳ௦ௗ
൯ gives the probabilities of links (i, j) and route j are considered for
routing a lightpath between source s to destination d. Here, probabilities are estimated for each
network element independently. Hence, finding the shortest the path between router s and
destination d in terms of cost can be written as:
ܥ௦ௗ
= − lnሾ൫1 − ܲ௦ௗ
൯ ൫1 − ܳ௦ௗ
൯] (12)
ܥ = ܥ௦ௗ
+ ܥ௦ௗ
(13)
Suppose if all link cost are equal, then the AUR and LLR routing approach will be adopted for
routing decision. The kalman filter method is well suited for distributed operation since, it is
possible to build an algorithm based on distributed routing algorithm. In this study, routers collect
the failure statistics for present state, future prediction, updation of network state, their adjacent
links and collects the arrival statistics from the router. Hence, router can initiate the routing
algorithm with parameters’ ߤ
௦ௗ
and ݒ
௦ௗ
.
Suppose if wavelength converters are employed in routers, a wavelength can be assigned to a
lightpath randomly or statistically at each link. This approach is called statistically predictive and
optimal wavelength routing. It is also called Minimum Reconfiguration Probability Routing. The
two possibilities for wavelength selection are first fit or random. In first fit wavelength
assignment, the smallest index wavelength is chosen. In random wavelength assignment, one of
the available wavelengths can be selected. First fit assignment methods are reported to be better
than random methods and it is used in most of RWA algorithms [19].
A Markov Decision Process is used in WI networks to estimate the average number of future
rejections on a router. The total cost is the estimation of the Mean number future rejections
requests in the WI network. By accommodating the MRPR algorithm in the router, the statistics
related lightpath arrival/holding time, failure arrival statistics for each link and routers, network
state information at the time of request arrival are used in routing decision.
After solving the routing problem, wavelengths on the links along the route can be assigned
randomly. In order to find the route with minimum reconfiguration probability for a lightpath
request, a simple auxiliary graph G= (N,E),where nodes N represent the routers and each directed
edge(i,j), E represents the link (i,j) from router i to router j, is constructed. Then, cost of each
edge(i,j) is set to:
ܥ = − ln൫1 − ܨ൯ − ln൫1 − ܨ൯ , − ln൫1 − ܴ൯ (14)
Where, Fij is the probability of reconfiguration due to failure of the link (i,j) and Fj is the
probability of reconfiguration due to failure on router j for the lightpath to be routed and ܴ is
the probability of reconfiguration due to repacking on the link (i j). In equation (14), Edge cannot
be used which means that the link (i,j) has no free wavelength channel at the time of
routing[3][15], if the lightpaths assigned are uniformly distributed over the wavelength in link
(i,j) (i.e arrival rates of lightpaths at different wavelenghts are the same).
6. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
44
Wavelength converters are exclusively expensive devices and hence it is treated as routers or
switches. Therefore, some router architectures required Share per Node (SpN) and share per link
method. Share per node architectures (network) are limited numbers of converters, among the
lightpaths, in these networks, light path requests arrive at each routers randomly, and not blocked,
they stay on the network for a random amount of time. It is assumed that, each links/router may
fail at random times, so failures are re-routed on new path [14]. Hence, most of authors proposed
share a limited channel number based WI routers. Although MRPR can be employed for the WI
architectures. MRPR routing method may cause blocking of future requests, which need
wavelength conversion at the router. Therefore, we consider the repacking of lightpaths, which
are using converters in a router. For this purpose, we use converter usage statistics such as mean
arrival time rate and mean holding time of light paths. Establishing a light path between the
routers source ‘s’ and destination ‘d’ in SpN network can be constructed as follows.
• For each wavelength w=1..W and router n, create the nodes ݅௪ and ௪ which represent
the input and output ports of the routers n at wavelength w respectively.
• For each wavelength v, w=1..W and routers n create the edges (݅௩, ௪) corresponding
to wavelength conversion in the router n,
• For each wavelength w=1..W and each link (m, n) from router m to router n, create the
directed edges (௪, ݅௪) which represent the channels at wavelength w in the link (m, n).
• Create the nodes ݎ௦ and ݎௗ corresponding to source and destination terminals for the
lightpath
• For each wavelength w=1..W create the edges (ݎ௦, ݅௦௪) and (ௗ௪, ݎௗ)
After construction of graph for a share per node to route a lightpath from a source to destination
are illustrated as shown in Figure (2). The graph is constructed for v, w=1, 2,..W and each router
n and m, the cost of edges (ݎ௦, ݅௦௪) and (ௗ௪, ݎௗ) as shown in Figure (2). for w=1..W are set to
zero. The cost of each edge (௪, ݅௪) are set to:
ܥ௪ = ቄ
∞
− lnሺ1 − ܨሻ − lnሺ1 − ܴሻ
௧
௪௩௧ ௪ ሺ,ሻ
௧ ௪௦
ሺ15ሻ
Cost of each edge (݅௩, ௪), for v ≠ w,
ܺ௩௪ = ቄ
∞
− lnሺ1 − ܨሻ − lnሺ1 − ܴሻ
݊ ݂݁݁ݎ ܿݏݎ݁ݐݎ݁ݒ݊
݅݊ ݊ ݎ ݊ ℎܽݏ ݂݈ܽ݅݁݀,
ݐℎ݁ݎ ݁ݏ݅ݓ
ሺ16ሻ
And the cost of each edge (݅௪, ௪)
ܺఓ = ቄ
∞
− lnሺ1 − ܨሻ
௦ ௗ
௧ ௪௦
ሺ17)
Figure 1 : A share per node network
7. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
45
Where ܨ and ܨ are the probabilities of reconfiguration due to failure on the WI router n and
link (m, n) respectively, ܴ is the probability of reconfiguration due to repacking on the link
(m,n) and ܴ is the probability of reconfiguration due to repacking for a lightpath using a
converter on the router n which is obtained from the equation (15).
ܴ =
ாሺ௫,ఘሻ
௫.ாሺ௫బ,ఘሻ
(18)
Similarly, LLR and AUR methods are applied to WI network to find out the route and reliable
path of network. Routing in optical networks is simply inherited from traditional circuit
switching. Among all the routing algorithms, the Least Load Routing (LLR) is the most popular
one in traditional circuit switched networks [22]. Naturally there were also attempts at studying
LLR in the context of optical networks in; however, it has only been applied in two types of
optical networks: a network with no wavelength conversion and a network with full wavelength
conversion (i.e. every node has a wavelength converter). An LLR-based routing algorithm in
optical networks with wavelength conversion neither has been formulated nor studied to the
extent of our knowledge. In AUR algorithm, all paths between source and destination are
considered in routing decisions. In LLR all paths between source and destination considered
based on least cost and routing decision will be taken.
AUR is fundamentally different from LLR, in that, it is not limited to a set of predefined search
sequence. The optimal lightpath is obtained by finding the shortest path in WI networks, both do
not use convertor.
Figure 2 : Share per node graphical representation
3. PERFORMANCE EVALUATION
In order to evaluate the performance of network, we have considered the network shown in the
Figure (3) having 6 routers and 13 links. All the links are unidirectional light paths and are
8. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
46
established between the source to destination for each request. A Light path request arrives at a
time of each request as a poisson process, and lightpat holding times are assumed to be
exponential process. Each link is composed of single fiber length with three wavelength on each
fiber link. We deploy kalman filter at link/routers to make use of the network state information at
the time of routing to find the optimum path for the request. Light path requests arrive at the
network as a poisson process of rate ߣ் and are uniformly distributed from source to destination
over the routers and routing decisions are made randomly for a lightpath request. The lightpath
holding times are exponentially distributed with unit mean. The blocked lighpath requests are
assumed to be lost.
Figure 3: Assued topoogy having 6 routers and 13 links with single fiber
In order to assess the performance of MRPR, AUR and LLR, we consider two different types of
routers characterised as reliable routers and un-reliable routers. The failures arrival at each
reliable path or route, In all the computer simulations, the mean arrial of request rate and mean
holding time are assumed to be poission processes of rates 0.0001 and 0.01 respectively. The
service begin time, service elsaped time, serive ended and customer waiting time have been
taken in to account in order to make routing decisions and reconfiguration of the network. We are
interested in (1) blocking probability of a light path request (2) probability of re-routing due to
link or router failure. We also measure the performance under changing load and reliablity
conditions. The objective function is given by
ߣ =
ߣ் ܪ
ܹܮ
ሺ19ሻ
Where ߣ் is the total network load, and H is the average number of fibers per link per path. W is
the number of wavelength per fiber and L is the number of fibers used in WI network.
The performance of network purely depends on reconfiguration and blocking performance with
different reliablity and load values. Hence, for each load and reliabilty ratio values, we carried out
10 simulations.
In order to compute repacking probability, we need to know the initial arrival rate of lighpath and
load offered to network for each resource. It is very difficult to determine actual offered load in
the network, hence, we use light path arrival rates on each resource or service begin at network
for link/router as its initial capacity (numbers of wavelength available on link/router). Then the
number of occupied wavelengths are scanned every δ times and offered loads are updated using φ
kalman functions.
9. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
47
For i= 1 to φ
݊ሺ݅ሻ = ݊ݎܾ݁݉ݑ ݂ ݈݅݃ℎݐܽݐℎݏ ݃݊݅ݏݑ ݁ܿݎݑݏ݁ݎ ,ݎ
ܫ = ቄ
0
1
݊ሺ݅ሻ <
݊ሺ݅ሻ =
ܿ
ܿ
ሺ20ሻ
ܰ = ݊ ሺ݅ሻ ߶, ܤ ܫሺ݅ሻ ߶⁄
థ
ୀଵ
൘
థ
ୀଵ
⇒ ߣ =
ܰ
ℎሺ1 − ܤሻ
ሺ21ሻ
Where ݊, ܤ and ߣ are the number of lightpaths using resource r, blocking on resource r and
light path arrival rate on the resource called offered load on resource and h is the average
lightpath holding time.
4. RESULTS AND DISCUSSION
The performance of MRPR algorithm has been evaluated and compared with the performance of
AUR and LLR algorithms. These alogrithms have been computer simulated using GNU Octave
tool and Ubuntu Operating system 14.04 version. We try to find the shortest path from ‘A’ to ‘H’
as shown in Figure (3). In order to demostrate effect of the blocking probability and
reconfiguration probability on the performace of MRPR, AUR and LLR, routing and wavelength
assignment methods under changing load are presented. The reliabilty ratio is fixed at 0.05356,
which means the network has un-reliable routers.
The reconfiguration probability is defined as the probability that a lightpath is re-routed due to a
router or link failure. Since MRPR algorithm distinguishes between the available paths according
to the failure statistics of the routers and links, and lightpath arrival statistics of routers, different
failure arrival rates and variances are used for links and routers. For this purpose, some of the
links/routers are assumed to be unreliable compared to others, and failure arrival rates, λf, for
unreliable and reliable network elements are taken as 1/1500 and 1/1000 respectively in
simulations.
Figure 4: Performance in WI network whe reliablity ratio =0.05356 and wavelength per fiber =3 nos.
10. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
48
Figure 5: Performance in WI network when reliabilty ratio=0.05356 and wavelength per fiber=3nos.
In Figure (4) blocking probability as a function of load per wavelength obtained from the
simulations are given. In these simulations, approximately 12% of routers are assumed to be
unreliable. The results show that, from Figure (4) the blocking probabilities for AUR and MRPR
algorithms are close to each other. This is an expected result, since AUR and MRPR are
equivalent to each other, if all failure statistics are assumed to be the same. And also if the link
costs in MRPR are taken as identical, then MRPR will be behave similar to AUR and LLR.
If reconfiguration probability is considered, MRPR algorithm performs 8% better than the AUR
and LLR algorithm, and reconfiguration probabilities increase as the load per wavelength
increases. This is due to the fact that, as the load per wavelength increases, utilization of fibers
and routers increase and the number of lightpaths affected from a failure increases.
Table 1: Reconfiguration due to repacking
No of
channels
Mean failure
inter-arrival
time (µsec)
Mean inter-
arrival time
(µsec)
Mean
holding time
(µsec)
Rp Rf Cost
1/3 1 3 2 0.00156 0.002781 1.100176
2/3 1 3 2 0.01853 0.002934 1.117317
3/3 1 3 2 0.33333 0.003045 1.504077
4/3 1 3 2
0.799
(above TH)
0.003075 INF
In Figure (5) blocking probability and reconfiguration probability as a function of the ratio of
unreliable routers and links are given. As expected, blocking performance of AUR and MRPR
algorithms are close to each other. On the other hand, as the ratio of unreliable elements gets
larger, the reconfiguration probability increases for both of the algorithms. Simulations show that
MRPR algorithm performs approximately 13% better than AUR and 15% better than LLR
algorithms. Table(1) shows the computed values for Bellman Ford algorithm to find the three
shortest-paths that are encircled in Figure(2) using state space approach, Where Rp is Probability
of reconfiguration due to repacking, Rf is Probability of reconfiguration due to failure at node
and TH is Threshold level. As can be seen from the Table(1), for the channel three, the mean
11. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
49
failure inter-arrival time is 1.0 µsec. Mean inter-arrival time 3.0 µsec, and mean holding time is
2.0µsec. The Probability of reconfiguration due to repacking is 0.33333, and Probability of
reconfiguration due to failure is 0.003045 and the cost 1.504077. The proposed method to be any
pratical value obviously, the process of taking statistics should not imply prohibitive costs. The
cost is not prohibitive and Probability of reconfiguration is neglible.
In MRPR algorithm reliable paths between souce and destination are considered in the routing
decisions. Since the statistics are used in conjunction with the present state information, it is
naturally expected, that Kalman filter apporach, achieves optimaly better routing performance
compared to earlier adaptive RWA algorithms.
5. CONCLUSION
In this paper, a detailed study of MRPR algorithm has been presented and its performance has
been evaluated in comparision with AUR and LLR algorithms for the RWA problem in all optical
networks. The study has been made considering the probability of reconfiguration due to failure
of the link (i, j) and the probability of reconfiguration due to failure on router j for the lightpath
to be routed and the probability of reconfiguration due to repacking on the link (i j). The
extensive computer simulations have reaveled that the MRPR algorithm is a better choice for
solving the RWA problems. We suggest that further research in this direction is likely to find the
over-head time taken to MRPR alogrithm for RWA problems.
REFERENCES
[1] Stefano Baroni and Polina Bayvel, Wavelength requirements in arbitrarily connected wavelength-
routed optical networks, Lightwave Technology, Journal of 15 (1997), no. 2, 242-251.
[2] Ezhan Karasan and Ender Ayanoglu, Performance of wdm transport networks, Selected Areas in
Communications, IEEE Journal on 16 (1998), no. 7, 1081-1096.
[3] Altan Kocyigit and Semih Bilgen, Statistically predictive optimal wavelength routing, Optical
Networks Magazine (2003).
[4] Altan Kocyigit, and Semih Bilgen, All-optical networking, Turkish Journal of Electrical Engineering
& Computer Sciences 9 (2001), no. 2, 69-122.
[5] Peter S Maybeck, Stochastic models, estimation, and control, vol. 3, Academic press, 1982.
[6] The kalman filter, an introduction to concepts, Autonomous Robot Vehicles, Springer, 1990, pp. 194-
204.
[7] Athanasios Papoulis and S Unnikrishna Pillai, Probability, random variables, and stochastic
processes, Tata McGraw-Hill Education, 2002.
[8] Rajiv Ramaswami, Multiwavelength lightwave networks for computer communication,
Communications Magazine, IEEE 31 (1993), no. 2, 78-88.
[9] Marcelo Yannuzzi, Xavier Masip-Bruin, Sergio Sanchez-Lopez, Eva Marin-Tordera, Josep Sole-
Pareta, and Jordi Domingo-Pascual, Interdomain rwa based on stochastic estimation methods and
adaptive filtering for optical networks., GLOBECOM, 2006.
12. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
50
[10] Jay Y Yoo and Subrata Banerjee, Design, analysis, and implementation of wavelength-routed all-
optical networks: routing and wavelength assignment approach, IEEE Communications Surveys,
Broadband Network area (1997).
[11] Y.Donoso G.A Montoya, F.Solano, An Energy-Efficient and Routing Approach for Position,
Estimation using Kalman Filter Techniques in Mobile WSNs, CCC publications, International Journal
of Computer Communications and Control ISSN-1841-9836, 10(4):500-507 August 2015.
[12] Mohana Kumar S, and Jagadeesh S N, “Routing and Wavelength Assignment for Optical Networks
using Link State Space Technique”, in Proceedings of the 6th IETE National Conference on RF &
Wireless, 09-11 May 2013 shimoga Karnataka pp. 116–119.
[13] Mohan Kumar S, Jagadeesh SN, Swaroop “A case study on Markov model for double fault tolerance,
comparing cloud based storage system”, IJARCCE vol 4, Issue 11, November (2015) pp 240-245.
[14] Boudriga, Noureddine. "Optical burst switching protocols for supporting QoS and adaptive routing."
Computer Communications 26.15 (2003): 1804-1812.
[15] SN, Jagadeesha, and Mohan Kumar S. "Routing in all optical networks using recursive state space
technique." Signal & Image Processing: An International Journal (SIPIJ) Vol.7, No.2, (2016) pp 23-
37.
[16] Xiang, Lei, Dingshan Gao, Yu Yu, "Silicon-Based Integrated Comb Filter and Demultiplexer for
Simultaneous WDM Signal Processing." Selected Topics in Quantum Electronics, IEEE Journal of
20.4 (2014): 240-247.
[17] Qin, Haohao, et al. "Power allocation and time-domain artificial noise design for wiretap OFDM with
discrete inputs." Wireless Communications, IEEE Transactions on 12.6 (2013): 2717-2729.
[18] Boudriga, Noureddine. "Optical burst switching protocols for supporting QoS and adaptive routing."
Computer Communications 26.15 (2003): 1804-1812.
[19] Karasan, E., Ayanoglu, E., “Effects of Wavelength Routing and Selection Algorithms on Wavelength
Conversion Gain in WDM Optical Networks”, IEEE/ACM Trans. On Networking, vol. 6, no. 2, pp
186-195, April 1998.
[20] Gerstel, O., Ramaswami, R., “Optical Layer Survivability: A Services Perspective”, IEEE Comm.
Mag., pp. 104-113, March 2000.
[21] Papoulis, A., “Probability, Random Variables, and Stochastic Processes”, McGraw-Hill, 1984.
[22] Karasan, Ezhan, and Ender Ayanoglu. "Effects of wavelength routing and selection algorithms on
wavelength conversion gain in WDM optical networks." IEEE/ACM Transactions on networking 6.2
(1998): 186-196.
13. Signal & Image Processing : An International Journal (SIPIJ) Vol.7, No.6, December 2016
51
AUTHORS
Mohan Kumar S. received his Bachelor of Engineering in Computer Science &
Engineering and Master of .Technology, in Networking and Internet Engineering,
from Visvesvaraya Technological University, Belgaum, Karnataka, India
respectively. He is currently pursuing a Doctoral Degree from Visvesvaraya
Technological University, Belgaum, and Karnataka, India. At present he is
working as Assistant Professor, Department of Information Science and
Engineering M.S.Ramaiah Institute of Technology Bangalore. Karnataka. India
(Affiliated to Visvesvaraya Technological University Belgaum). His research
interest includes Communication and networking.
Dr. Jagadeesha S N received his Bachelor of Engineering., in Electronics and
Communication Engineering, from University B. D. T College of Engineering.,
Davangere affiliated to Mysore University, Karnataka, India in 1979, M.E. from
Indian Institute of Science (IISC), Bangalore, India specializing in Electrical
Communication Engineering., in 1987 and Ph.D. in Electronics and Computer
Engineering., from University of Roorkee, Roorkee, India in 1996. He is an IEEE
member. His research interest includes Array Signal Processing, Wireless Sensor
Networks and Mobile Communications. He has published and presented many
papers on Adaptive Array Signal Processing and Direction-of-Arrival estimation.
Currently he is professor in the Department of Electronics and Communication Engineering, PES college of
Engineering. (Affiliated to Visvesvaraya Technological University), Shivamogga, Karnataka, India.