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.
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.
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.
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new
challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of
MIMO communication in such type of network is enhancing the packet transmission capabilities. There
are different techniques for cooperative transmission and broadcasting packet in MIMO equipped
Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a
new scheduling algorithm based on investigating the different broadcasting algorithm. The new
broadcasting algorithm improves the packet transmission rate of the network based on energy
performance of the network and minimizes the BER for different transmission mode which is illustrated
in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result
for the packet transmission rate are collected and shown in the tabular form. Also simulate the network
for generating a comparative statement for each mobile node. And performance analysis is also done for
the model network. The main focus is to minimize BER and improve information efficiency of the
network.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
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.
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.
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.
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new
challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of
MIMO communication in such type of network is enhancing the packet transmission capabilities. There
are different techniques for cooperative transmission and broadcasting packet in MIMO equipped
Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a
new scheduling algorithm based on investigating the different broadcasting algorithm. The new
broadcasting algorithm improves the packet transmission rate of the network based on energy
performance of the network and minimizes the BER for different transmission mode which is illustrated
in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result
for the packet transmission rate are collected and shown in the tabular form. Also simulate the network
for generating a comparative statement for each mobile node. And performance analysis is also done for
the model network. The main focus is to minimize BER and improve information efficiency of the
network.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
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.
Improved Good put using Harvest-Then-Transmit Protocol for Video TransferEswar Publications
In multiple wireless networks, large end-to-end delay and packet losses can decrease meaningfully the traffic flow goodput due to path irregularity and multiplicity. To report these problems, current methods are proposed by using management of queue and decision making process. Hence, this paper proposesa Harvest-Then-Transmit (HTT) Protocol which selects an energy efficient path based on multiple parameters i.e. energy, delay, transmission time and perform transmission of video to handle number of video packets. A multipath environment is establishing where a server performs transferring of video along the energy efficient path of wireless network. Simulation shows the proposed protocol improves the overall goodput up to 10%, increases packet delivery rate up to 12%, and reduces end-to-end delay up to 3%, compared to existing system.
Performance analysis for Adaptive Subcarriers Allocation in Coherent Optical ...iosrjce
The constraint to satisfy the need of increased bandwidth requirement for high speed applications
with higher performance has been a motivation to work on Optical Orthogonal Frequency division multiplexing
(OOFDM) technique with coherent detection. We implement the coherent optical OFDM (CO-OOFDM)
technique and investigate the effect of the number of sub-carriers on performance over single mode fiber (SMF)
links. To explore improvement in performance adaptive subcarriers has been selected by assigning subcarriers
to user according to the conditions of channel. An adaptive subcarrier allocation has been investigated and
performance comparison for proportional and equal allocation has been carried over.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Evaluation of Energy Consumption of Reactive and Proactive Routing Protocols ...IJCNCJournal
Mobile Ad hoc Network (MANET) is a distributed, infrastructure-less and decentralized network. A routing
protocol in MANET is used to find routes between mobile nodes to facilitate communication within the
network. Numerous routing protocols have been proposed for MANET. Those routing protocols are
designed to adaptively accommodate for dynamic unpredictable changes in network's topology. The mobile
nodes in MANET are often powered by limited batteries and network lifetime relies heavily on the energy
consumption of nodes. In consequence, the lack of a mobile node can lead to network partitioning. In this
paper we analyse, evaluate and measure the energy efficiency of three prominent MANET routing protocols
namely DSR, AODV and OLSR in addition to modified protocols. These routing protocols follow the
reactive and the proactive routing schemes. A discussion and comparison highlighting their particular
merits and drawbacks are also presented. Evaluation study and simulations are performed using NS-2 and
its accompanying tools for analysis and investigation of results.
RP BASED OPTIMIZED IMAGE COMPRESSING TECHNIQUEprj_publication
Colorization is a method that adds color components to a gray scale image using only
a few representative pixels (RP) by the user. A novel approach to image compression called
colorization-based coding is being done. It automatically extracts representative pixels from
an original color image at an encoder and restores a full color image by using colorization at
the decoder. However past studies on colorization based coding obtain redundant
representative pixels and do not remove the pixels required for suppressing coding errors.
The main issue in colorization based coding is how to extract representative pixels (RP) so
that compression rate is high and the reconstructed images have good visual quality. In this
work we formulate the colorization based coding into an optimization problem i.e., an
minimization problem. We use the colorization matrix that colorizes the image in a multi
scale manner and this is combined with RP extraction method allows us to choose a very
small set of RP. Simulation results revealed that implemented method compress the color
image with higher compression rate and has good quality and is comparable to conventional
JPEG standard.
DETECTION OF HUMAN BLADDER CANCER CELLS USING IMAGE PROCESSINGprj_publication
Bladder cancer presents a spectrum of different diatheses. A precise assessment for
individualized treatment depends on the accuracy of the initial diagnosis. In this method the
performance of the level set segmentation is subject to appropriate initialization and optimal
configuration of controlling parameters, which require substantial manual intervention. A
new fuzzy level set algorithm is proposed in this paper to facilitate medical image
segmentation. It is able to directly evolve from the initial segmentation by spatial fuzzy
clustering. The Spatial induced fuzzy c-means using pixel classification and level set
methods are utilizing dynamic variational boundaries for image segmentation. The
controlling parameters of level set evolution are also estimated from the results of clustering.
The fuzzy level set algorithm is enhanced with locally regularized evolution. Such
improvements facilitate level set manipulation and lead to more robust segmentation.
Performance evaluation of the proposed algorithm was carried on medical images
FAULTY NODE RECOVERY AND REPLACEMENT ALGORITHM FOR WIRELESS SENSOR NETWORKFprj_publication
This paper proposes an algorithm by combining grade diffusion and genetic algorithm
to enhance the lifetime of a wireless sensor network. The algorithm is named as Fault Node
Recovery and Replacement algorithm. The algorithm enhances the lifetime of the wireless
sensor network with fewer replacements of sensor nodes. In the simulation it is shown that
the proposed algorithm increases the number of active node, reduces the rate of data loss,
increases the life time of the wireless sensor network and reduces the rate of energy
consumption.
MULTI WAVELET BASED IMAGE COMPRESSION FOR TELE MEDICAL APPLICATIONprj_publication
Analysis and compression of medical image is an important area of biomedical
engineering. Analysis of medical image and data compression are rapidly evolving field with
growing applications in the teleradiology, Bio-medical, tele-medicine and medical data
analysis. Wavelet based techniques are latest development in the field of medical image
compression. The ROI must be compressed by a Lossless or a near lossless compression
algorithm. Wavelet based techniques are most recent growth in the area of medical image
compression.
Wavelet multi-resolution decomposition of images has shown its efficiency in many
image processing areas and specifically in compression. Transformed coefficients are
obtained by expanding a signal on a wavelet basis. The transformed signal is a different
representation of the same underlying data. Such representation is efficient if a relevant part
of the original information is found in a relative small number of coefficients. In this sense,
wavelets are near optimal bases for a wide class of signals with some smoothness, which is
the reason for compression.
Keywords: Image compression, Integer Multiwavelet Transform.
1. INTRODUCTION
Image Compression is used to reduce the number of bits required to represent an
image or a video sequence. A Compression algorithm takes an input X and generates
compressed information that requires fewer bits. The Decompression algorithm reconstructs
the compressed information and gives the original.
A compression of medical image is an important area of biomedical and telemedici
Mems based optical sensorMEMS BASED OPTICAL SENSOR FOR SALINITY MEASUREMENTprj_publication
In this paper, we purpose a two dimensional photonic crystal based optical sensor for
salinity measurement. The salinity percentage of is sea water changes as we go down the sea
water surface. This gives change to the index of refraction of the sea water at the different
levels. Thus the salinity percentage of sea water can be detected by measuring this change in the
effective refractive index of sea water. In this paper, the effective refractive index method has
been used for the detection of the salinity concentration from (0-40%). The slab waveguide is
designed and the effective refractive changed is captured. Even as the refractive index change
for the change in salinity of the sea water, is very small, the effective index change is visible,
making the sensor very sensitive.
Improved Good put using Harvest-Then-Transmit Protocol for Video TransferEswar Publications
In multiple wireless networks, large end-to-end delay and packet losses can decrease meaningfully the traffic flow goodput due to path irregularity and multiplicity. To report these problems, current methods are proposed by using management of queue and decision making process. Hence, this paper proposesa Harvest-Then-Transmit (HTT) Protocol which selects an energy efficient path based on multiple parameters i.e. energy, delay, transmission time and perform transmission of video to handle number of video packets. A multipath environment is establishing where a server performs transferring of video along the energy efficient path of wireless network. Simulation shows the proposed protocol improves the overall goodput up to 10%, increases packet delivery rate up to 12%, and reduces end-to-end delay up to 3%, compared to existing system.
Performance analysis for Adaptive Subcarriers Allocation in Coherent Optical ...iosrjce
The constraint to satisfy the need of increased bandwidth requirement for high speed applications
with higher performance has been a motivation to work on Optical Orthogonal Frequency division multiplexing
(OOFDM) technique with coherent detection. We implement the coherent optical OFDM (CO-OOFDM)
technique and investigate the effect of the number of sub-carriers on performance over single mode fiber (SMF)
links. To explore improvement in performance adaptive subcarriers has been selected by assigning subcarriers
to user according to the conditions of channel. An adaptive subcarrier allocation has been investigated and
performance comparison for proportional and equal allocation has been carried over.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Evaluation of Energy Consumption of Reactive and Proactive Routing Protocols ...IJCNCJournal
Mobile Ad hoc Network (MANET) is a distributed, infrastructure-less and decentralized network. A routing
protocol in MANET is used to find routes between mobile nodes to facilitate communication within the
network. Numerous routing protocols have been proposed for MANET. Those routing protocols are
designed to adaptively accommodate for dynamic unpredictable changes in network's topology. The mobile
nodes in MANET are often powered by limited batteries and network lifetime relies heavily on the energy
consumption of nodes. In consequence, the lack of a mobile node can lead to network partitioning. In this
paper we analyse, evaluate and measure the energy efficiency of three prominent MANET routing protocols
namely DSR, AODV and OLSR in addition to modified protocols. These routing protocols follow the
reactive and the proactive routing schemes. A discussion and comparison highlighting their particular
merits and drawbacks are also presented. Evaluation study and simulations are performed using NS-2 and
its accompanying tools for analysis and investigation of results.
RP BASED OPTIMIZED IMAGE COMPRESSING TECHNIQUEprj_publication
Colorization is a method that adds color components to a gray scale image using only
a few representative pixels (RP) by the user. A novel approach to image compression called
colorization-based coding is being done. It automatically extracts representative pixels from
an original color image at an encoder and restores a full color image by using colorization at
the decoder. However past studies on colorization based coding obtain redundant
representative pixels and do not remove the pixels required for suppressing coding errors.
The main issue in colorization based coding is how to extract representative pixels (RP) so
that compression rate is high and the reconstructed images have good visual quality. In this
work we formulate the colorization based coding into an optimization problem i.e., an
minimization problem. We use the colorization matrix that colorizes the image in a multi
scale manner and this is combined with RP extraction method allows us to choose a very
small set of RP. Simulation results revealed that implemented method compress the color
image with higher compression rate and has good quality and is comparable to conventional
JPEG standard.
DETECTION OF HUMAN BLADDER CANCER CELLS USING IMAGE PROCESSINGprj_publication
Bladder cancer presents a spectrum of different diatheses. A precise assessment for
individualized treatment depends on the accuracy of the initial diagnosis. In this method the
performance of the level set segmentation is subject to appropriate initialization and optimal
configuration of controlling parameters, which require substantial manual intervention. A
new fuzzy level set algorithm is proposed in this paper to facilitate medical image
segmentation. It is able to directly evolve from the initial segmentation by spatial fuzzy
clustering. The Spatial induced fuzzy c-means using pixel classification and level set
methods are utilizing dynamic variational boundaries for image segmentation. The
controlling parameters of level set evolution are also estimated from the results of clustering.
The fuzzy level set algorithm is enhanced with locally regularized evolution. Such
improvements facilitate level set manipulation and lead to more robust segmentation.
Performance evaluation of the proposed algorithm was carried on medical images
FAULTY NODE RECOVERY AND REPLACEMENT ALGORITHM FOR WIRELESS SENSOR NETWORKFprj_publication
This paper proposes an algorithm by combining grade diffusion and genetic algorithm
to enhance the lifetime of a wireless sensor network. The algorithm is named as Fault Node
Recovery and Replacement algorithm. The algorithm enhances the lifetime of the wireless
sensor network with fewer replacements of sensor nodes. In the simulation it is shown that
the proposed algorithm increases the number of active node, reduces the rate of data loss,
increases the life time of the wireless sensor network and reduces the rate of energy
consumption.
MULTI WAVELET BASED IMAGE COMPRESSION FOR TELE MEDICAL APPLICATIONprj_publication
Analysis and compression of medical image is an important area of biomedical
engineering. Analysis of medical image and data compression are rapidly evolving field with
growing applications in the teleradiology, Bio-medical, tele-medicine and medical data
analysis. Wavelet based techniques are latest development in the field of medical image
compression. The ROI must be compressed by a Lossless or a near lossless compression
algorithm. Wavelet based techniques are most recent growth in the area of medical image
compression.
Wavelet multi-resolution decomposition of images has shown its efficiency in many
image processing areas and specifically in compression. Transformed coefficients are
obtained by expanding a signal on a wavelet basis. The transformed signal is a different
representation of the same underlying data. Such representation is efficient if a relevant part
of the original information is found in a relative small number of coefficients. In this sense,
wavelets are near optimal bases for a wide class of signals with some smoothness, which is
the reason for compression.
Keywords: Image compression, Integer Multiwavelet Transform.
1. INTRODUCTION
Image Compression is used to reduce the number of bits required to represent an
image or a video sequence. A Compression algorithm takes an input X and generates
compressed information that requires fewer bits. The Decompression algorithm reconstructs
the compressed information and gives the original.
A compression of medical image is an important area of biomedical and telemedici
Mems based optical sensorMEMS BASED OPTICAL SENSOR FOR SALINITY MEASUREMENTprj_publication
In this paper, we purpose a two dimensional photonic crystal based optical sensor for
salinity measurement. The salinity percentage of is sea water changes as we go down the sea
water surface. This gives change to the index of refraction of the sea water at the different
levels. Thus the salinity percentage of sea water can be detected by measuring this change in the
effective refractive index of sea water. In this paper, the effective refractive index method has
been used for the detection of the salinity concentration from (0-40%). The slab waveguide is
designed and the effective refractive changed is captured. Even as the refractive index change
for the change in salinity of the sea water, is very small, the effective index change is visible,
making the sensor very sensitive.
AN APPROACH TO DESIGN A RECTANGULAR MICROSTRIP PATCH ANTENNA IN S BAND BY TLM...prj_publication
In this paper we have designed a rectangular microstrip antenna in ‘S’ band
transmission line model. The S band frequency ranges from 2 GHz to 4GHz for wireless
application. The desired frequency is chosen to be 2.4 GHz at which the patch antenna is
designed to improve the bandwidth. After calculating the various parameters such as width,
effective dielectric constant, effective length and actual length. The antenna impedance is
matched to 50 ohm using inset feed. The results are obtained (Input Impedance, reflection
coefficient, SWR and bandwidth) by using MATLAB software.
An approach to design a rectangular microstrip patch antenna in s band by tlm...prj_publication
In this paper we have designed a rectangular microstrip antenna in ‘S’ band
transmission line model. The S band frequency ranges from 2 GHz to 4GHz for wireless
application. The desired frequency is chosen to be 2.4 GHz at which the patch antenna is
designed to improve the bandwidth. After calculating the various parameters such as width,
effective dielectric constant, effective length and actual length. The antenna impedance is
matched to 50 ohm using inset feed. The results are obtained (Input Impedance, reflection
coefficient, SWR and bandwidth) by using MATLAB software.
A DESIGN AND SIMULATION OF OPTICAL PRESSURE SENSOR BASED ON PHOTONIC CRYSTAL ...prj_publication
ABSTRACT
MOEMS based micro-sized pressure sensor can be developed to detect even
sub-micron range dimension change using the photonic crystal. The applied pressure on the
object will change the dimension of the waveguide carved in the photonic crystal. As a result,
this change in spacing can alter the propagation feature of electromagnetic waves that pass
through them that is changing the transmission spectrum. So, this change can directly be
mapped to pressure on the observed object. In this paper, the pressure sensor using photonic
crystal has been modeled and analyzed.
Администрация Президента Петра Порошенко для продвижения интересов Украины наняла компанию BGR Group, основанную бывшим председателем комитета Республиканской партии США и губернатором штата Миссисипи Хейли Барбур
If you want to start reselling a well-tried business tool, take a look at Intis Telecom mass texting service presentation. With this platform, many different businesses may solve problems with "slow-business" days and strengthen their customer services in a matter of seconds.
Delicious Foods of the Internet | Stephen OvertonStephen Overton
Check out some of these mouth-watering images of food. Find me at hiddenpennies@yahoo.com if you'd like to contribute some images of truly delicious food. Bonus if it's a grilled cheese!
Energy Efficient Multipath Routing For Mobile Ad Hoc NetworksZac Darcy
Energy consumption is a significant issue in ad hoc networks since mobile nodes are battery powered. In
order to prolong the lifetime of ad hoc networks, it is the most critical issue to minimize the energy
consumption of nodes. In this paper, we propose an energy efficient multipath routing protocol for
choosing energy efficient path. This system also considers transmission power of nodes and residual energy
as energy metrics in order to maximize the network lifetime and to reduce energy consumption of mobile
nodes. The objective of our proposed system is to find an optimal route based on two energy metrics while
choosing a route to transfer data packets. This system is implemented by using NS-2.34. Simulation results
show that the proposed routing protocol with transmission power and residual energy control mode can
extend the life-span of network and can achieve higher performance when compared to traditional ad-hoc
on-demand multipath distance vector (AOMDV) routing protocol.
Energy Efficient Multipath Routing For Mobile Ad Hoc NetworksZac Darcy
Energy consumption is a significant issue in ad hoc networks since mobile nodes are battery powered. In
order to prolong the lifetime of ad hoc networks, it is the most critical issue to minimize the energy
consumption of nodes. In this paper, we propose an energy efficient multipath routing protocol for
choosing energy efficient path. This system also considers transmission power of nodes and residual energy
as energy metrics in order to maximize the network lifetime and to reduce energy consumption of mobile
nodes. The objective of our proposed system is to find an optimal route based on two energy metrics while
choosing a route to transfer data packets. This system is implemented by using NS-2.34. Simulation results
show that the proposed routing protocol with transmission power and residual energy control mode can
extend the life-span of network and can achieve higher performance when compared to traditional ad-hoc
on-demand multipath distance vector (AOMDV) routing protocol.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
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.
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.
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.
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.
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
GPS Enabled Energy Efficient Routing for ManetCSCJournals
In this paper, we propose an energy aware reactive approach by introducing energy and distance based threshold criteria. Cross Layer interaction is exploited the performance of physical layer which leads to significant improvement in the energy efficiency of a network.
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such Networks are frequently limited by the network split due to either energy depletion or node mobility of the mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric system of measurement used to select the paths takes into account the stability of the nodes and the equivalent links.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such
Networks are frequently limited by the network split due to either energy depletion or node mobility of the
mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths
becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path
breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric
system of measurement used to select the paths takes into account the stability of the nodes and the
equivalent links.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
Similar to MMINIMUM RESOURCE CONSUMPTIONS ROUTING FOR OPTICAL NETWORKS (20)
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Democratizing Fuzzing at Scale by Abhishek Aryaabh.arya
Presented at NUS: Fuzzing and Software Security Summer School 2024
This keynote talks about the democratization of fuzzing at scale, highlighting the collaboration between open source communities, academia, and industry to advance the field of fuzzing. It delves into the history of fuzzing, the development of scalable fuzzing platforms, and the empowerment of community-driven research. The talk will further discuss recent advancements leveraging AI/ML and offer insights into the future evolution of the fuzzing landscape.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
TECHNICAL TRAINING MANUAL GENERAL FAMILIARIZATION COURSEDuvanRamosGarzon1
AIRCRAFT GENERAL
The Single Aisle is the most advanced family aircraft in service today, with fly-by-wire flight controls.
The A318, A319, A320 and A321 are twin-engine subsonic medium range aircraft.
The family offers a choice of engines
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
2. International Journal of Electronics and Communication Engineering Research and Development
(IJECERD), ISSN 2248-9525(Print), ISSN- 2248-9533 (Online) Volume 4, Number 2, April-June (2014)
65
failure. The key challenge is to devise a strategy to determine the primary and the backup
path such that the network throughput is maximized and the resource consumption is
minimized [1].
The above problem is addressed by either separate path selection (SPS) or joint path
selection (JPS). In SPS the algorithm first selects the path with minimum cost and then link
disjoint least cost backup path. Least loaded routing (LLR) selects path having more free
wavelengths, Conversion free primary routing (CFPR) minimizes the number of converters in
the primary path. In JPS algorithm tries to minimize combined cost of primary and the
backup paths [2]. Routing in WDM networks is accomplished by two approaches: 1) static
and 2) dynamic.
In static routing approach the routes between the node pairs are fixed, i.e.., the routes
do not change with the network status. Common mechanisms include fixed path routing and
alternate path routing. Fixed path routing is supposed to have a weaker performance as only
path is established between nodes. A connection requested is blocked if no wavelength is
available on that path. Alternate path routing, in which more than one candidate path are
provided between nodes for a connection request, improves the network performance
significantly. However the candidate path and their preferences are pre-determined without
considering the change in the current network status.
In dynamic routing, the routes are dynamically selected according to the current
network status as in Least Congestion Routing and WDM aware link weight functions. The
results show that the blocking probability of least congestion routing is one or two orders less
in magnitude than that of the alternate path routing in mesh-torus networks [1].
A fundamental property of light-path is its continuity. A connection must be assigned
the same wavelength on all hops of its path. This can lead to blocking of connection request
when same wavelength is not available on given path. Wavelength converters provide
solution to this problem by shifting the wavelength of an incoming signal to another
wavelength. This reduces the blocking due to wavelength unavailability on a hop, as any one
of the wavelengths being available suffices the cause [2]. All optical wavelength converters
are costly and the design should aim at minimizing the total number of converters while
achieving good blocking performance.
Wavelength-division multiplexing (WDM) is a method of combining multiple signals
of laser beams at various infrared (IR) wavelengths for transmission along fiber optic media.
Each laser is modulated by an independent set of signals. Wavelength-sensitive filters, the IR
analog of visible-light color filters, are used at the receiving end.
WDM is similar to frequency-division multiplexing (FDM). But instead of occupying
place at radio frequencies (RF), WDM is exploits the IR portion of the electromagnetic
spectrum. Each IR channel carries several RF signals combined by means of FDM or time-
division multiplexing (TDM). Using FDM or TDM in each IR channel in combination with
WDM or several IR channels, data in different formats and at different speeds can be
transmitted simultaneously on a single fiber.
II. BACKGROUND AND RELATED WORK
Survivability in optical networks can be achieved using protection (proactive) or
restoration (reactive) mechanisms [13] using two different approaches, namely:
1) Separate path selection (SPS)
2) Joint path selection (JPS)
3. International Journal of Electronics and Communication Engineering Research and Development
(IJECERD), ISSN 2248-9525(Print), ISSN- 2248-9533 (Online) Volume 4, Number 2, April-June (2014)
66
1) Separate Path Selection
This is the typical approach where the algorithm first selects the path with the
minimum cost as the primary path and then selects a link-disjoint path with least cost as the
backup. The algorithms proposed in the literature differ in the way in which they model the
cost of the paths, as described in the subsequent sections.
a) Shortest path algorithm: This algorithm models the route cost as the number of hops
between the source node and the destination node. This is a static routing approach. The
backup for this shortest path is then computed as follows. The links that comprise the primary
path are removed and the new shortest path is found. This path will be link-disjoint with the
primary. The advantages of this method are its simplicity and its ease of implementation.
However, it is not the most efficient algorithm and many studies [12] have shown that a
dynamic algorithm that takes into account the network state performs better.
b) Least loaded routing (LLR) algorithm: In this dynamic routing approach, the link load
is taken into account when determining a new path. When a connection request arrives, the
path with the least average load is chosen as the primary path. The average load is calculated
as the average of the number of wavelengths that are currently reserved in each link of the
path. Once the primary path is chosen, the links corresponding to the primary path are
removed and the new least loaded path between the source and destination is chosen as the
backup path. This algorithm aims to distribute the load equally among all the links of the
network. The execution overhead of this approach is higher compared to the shortest path.
This algorithm is shown in [4] to improve the blocking performance. However, this algorithm
has not been studied in the presence of limited wavelength converters per node. Further, it
has been shown that the path produced using this mechanism tends to be longer thereby
utilizing more resources.
c) Conversion free primary routing (CFPR):
This method [6] uses a dynamic routing approach that tries to minimize the use of
converters in the primary path. The objective is to eliminate conversion delay, possible signal
degradation and also to reduce the number of converters needed in the network, thereby
reducing the cost. At the arrival of a connection request, the primary path is determined as the
path that requires no converters. The backup path is then determined as the shortest path that
is link-disjoint with this primary path.
2) Joint Path Selection: Here, the algorithm tries to optimize the combined cost of the
primary and the backup paths. SPS approaches that take into account the current network
state (e.g., LLR and CFPR) were seen to perform better than the basic hop count (HC)
scheme. However, a technique that tries to optimize the combined cost of the primary and
backup paths has been shown to perform even better [14], [15].
III. IMPLEMENT ALGORITHM
A Network Model
The network model that is used here is circuit switched network. There are N nodes
and L links, the number of wavelengths between two connected nodes is W. The dynamic
routing is made used. For every OD pair a primary path is established, which the shortest path
considered the route cost. The number of back up paths are chosen by the user for the purpose
4. International Journal of Electronics and Communication Engineering Research and Development
(IJECERD), ISSN 2248-9525(Print), ISSN- 2248-9533 (Online) Volume 4, Number 2, April-June (2014)
67
an under selection or over selection of this number either increases blocking probability or
increases the complexity. A primary path or a back up path between certain pair could be
used as either primary path or a back up path for some other pair, making maximum use of
the route capacity to carry data over the channel where every signal is identified by a
wavelength.
B RWA algorithm
The objective of dynamic RWA is usually to minimize the blocking probability or in
other words, to maximize the number of connections that are established in the network at
any time. The difference in performance mainly lies in different routing strategies. Among all
wavelength assignment algorithms, First-Fit algorithm is the most well-known. Wavelength
continuity can cause the wastage of wavelength resources, resulting in low resource
utilization. One possible way to overcome this problem is to use wavelength converters at a
routing node. The care is taken to minimize the number of converters by first maintaining
light path continuity. When the continuity fails at some node the presence of converters at
that node establishes lightpath by assigning the signal the nearest possible wavelength. If
there is no converter at the node where continuity fails, the request is routed through the next
back up path till a success in routing is achieved or the request is dropped for no wavelength
availability over all the set of routes for the OD pair in concern.
C Route Cost Model
Traffic at each node is the measure of requests arrives at a node. The requests are
assumed to arrive following poisons variable with certain mean. The traffic matrix entries
TM(i,j) correspond to traffic demand on the link between node i and node j, directed from
node i to node j.
Link load: this represents the load on a link which is defined as follows
The load on link is the sum of the primary load on that link and part of load from
other OD paths using this same link in their back ups.
Hop counts Hp: this represents the number of hops between the OD pair throughout
the chosen path.
Mean load: this represents the mean load throughout the path.
Variance of the load on path= In case a decision between the two path selection is
trivial due to same mean over paths, the variance is considered. The one with lower variance
is selected.
5. International Journal of Electronics and Communication Engineering Research and Development
(IJECERD), ISSN 2248-9525(Print), ISSN- 2248-9533 (Online) Volume 4, Number 2, April-June (2014)
68
D. MRCR Algorithm
When a connection request arrives at source s to destination d following steps are executed
1. Chose the primary path and check if the same wavelength as at s is free at next link of
the path.
2. If the continuity exists forward the request updating the status at the node until the
next node is d.
3. If same wavelength is not available then check for continuity in subsequent back up
paths and repeat step 2.
4. If the continuity for the wavelength is not found after all paths in step then chose e the
primary path and check if any wavelength is free at next link of the path.
5. If a free wavelength is available then convert the signal transmission to next nearest
wavelength (first fit). And forward the request to next link by updating the node status
until the next node is d.
6. If a free wavelength is not available then check in subsequent back up paths for a free
wavelength and repeat step5.
7. Failure to find a free wavelength in step 6 results in dropping the connection request.
IV. RESULTS AND PERFORMANCE
The simulation were performed using MATLAB 2011b, considering a 30 node
network and a 14 node NSFNET. The results are shown for a 30 node network in this paper.
Traffic is modelled to be poissions distribution event with respect to some mean. The mean
associated is the total session requests per link when the traffic matrix is generated for
N(N-1) OD pairs.
1. Optimal back up paths; Experiments are carried out with varying load to determine
the number of back up paths to be chosen, as lower number of back up increases the
blocking and higher number burdens the network with additional complexity and
lower resource usage. The results in fig 1 show that three back up paths give better
results considering blocking probability as important parameter. Fig2 shows the link
utilisation for the chosen back up paths.
2. Link utilization: this factor gives the measure if all the links of the fibre cable are
used and laying cable is not a financial waste. This factor is higher the better.
6. International Journal of Electronics and Communication Engineering Research and Development
(IJECERD), ISSN 2248-9525(Print), ISSN- 2248-9533 (Online) Volume 4, Number 2, April-June (2014)
69
Fig 1: Blocking probability v/s back paths Fig 2: Link utilization v/s back up paths
3. Number of converters: wavelength converters form the major part of financial
restriction. Hence usage of minimal number of converters for acceptable blocking is
to be taken care of. The results are shown in fig 3 and fig4.
Fig 3: Blocking probability v/s converters Fig 4: Link utilization v/s converters
4. Reserving wavelengths for primary and back up paths will ensure the priority to
primary requests and continuity. But at the same time blocking and link utilization
should also be acceptable. Fig5 and 6 show the scenario.
7. International Journal of Electronics and Communication Engineering Research and Development
(IJECERD), ISSN 2248-9525(Print), ISSN- 2248-9533 (Online) Volume 4, Number 2, April-June (2014)
70
Fig 5: blocking probability v/s reserved Fig 6: Link utilization v/s reserved
primary wavelengths primary wavelengths
5. The three wavelength routing algorithms, full range converter at every node, full
range converter at limited nodes, and wavelengths reserved primary and back up
routing are compared in fig7 giving the best individual performance scenarios.
Fig 7: Blocking probability v/s routing method
8. International Journal of Electronics and Communication Engineering Research and Development
(IJECERD), ISSN 2248-9525(Print), ISSN- 2248-9533 (Online) Volume 4, Number 2, April-June (2014)
71
V. CONCLUSION
In this paper three RWA algorithms were implemented and experimented to find the
optimal number of converters, number of back up paths and number of wavelengths to be
reserved for acceptable performance given variable load. The project tries to minimize the
combined cost of the optical network under consideration also link utilization factor can
decide whether a cable link is useful if laid physically on field.
REFERENCES
[1] Manoj shivkumar and Krishna shivlingam. “Least resource consumption for survivable
optical networks”, 2005 IEEE.
[2] Manoj shivkumar and Krishna shivlingam. “A routing algorithm framework for
survivable optical networks based on resource consumption minimization,. Journal of
light wave technology”, vol 25 no.7, july2007.
[3] “Tabor Fabry-asztalos, Nilesh Bhide and Krishna shivlingam. Adaptive weight
functions for shortest path algorithms for multi-wavelength optical WDM networks”.,
2000 IEEE
[4] H. Zang, J. P. Jue, and B.Mukherjee, “A review of routing and wavelength assignment
approaches for wavelength-routed optical WDM networks,” Opt. Netw. Mag., vol. 1,
no. 1, pp. 47–60, Jan. 2000.
[5] A. Birman, “Computing approximate blocking probabilities for a class of all-optical
networks,” in Proc. IEEE INFOCOM, Apr. 1995, pp. 651–658.
[6] S. Gowda and K. M. Sivalingam, “Protection mechanisms for optical WDM networks
based on wavelength converter multiplexing and backup path relocation techniques,” in
Proc. IEEE INFOCOM, San Francisco, CA, Mar. 2003, pp. 12–21.
[7] N. M. Bhide, K. M. Sivalingam, and T. Fabry-Asztalos, “Routing mechanisms
employing adaptive weight functions for shortest path routing in multi-wavelength
optical WDM networks,” Springer J. Photon. Netw. Commun., vol. 3, no. 3, pp. 227–
236, Jul. 2001. 1692 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 25, NO. 7,
JULY 2007
[8] M. M. H. Harai and H. Miyahara, “Performance of alternate routing methods in all-
optical switching networks,” in Proc. IEEE INFOCOM, Apr. 1997, vol. 2, pp. 517–525.
[9] S. amamurthy and B. Mukherjee, “Fixed-alternate routing and wavelength conversion
in wavelength-routed optical networks,” in Proc. IEEE Globecom, Sydney, Australia,
Nov. 1998, vol. 4, pp. 2295–2303.
[10] L. Li and A. K. Somani, “Fiber requirement in multifiber WDM networks with
alternate-path routing,” in Proc. ICCCN, Boston, MA, 1999, pp. 338–343.
[11] A. Girard, Routing and Dimensioning in Circuit-Switched Networks. Reading,
MA:Addison-Wesley, 1990.
[12] L. Li and A. K. Somani, “Dynamic wavelength routing using congestion and
neighborhood information,” IEEE/ACM Trans. Netw., vol. 7, no. 5, pp. 779–786, Oct.
1999.
[13] W. Grover, Mesh-Based Survivable Networks: Options and Strategies for Optical,
MPLS, SONET and ATM Networking. Englewood Cliffs, NJ: Prentice-Hall, 2003.
[14] D. Xu, Y. Chen, Y. Xiong, C. Qiao, and X. He, “On finding disjoint paths in single and
dual link cost networks,” in Proc. IEEE INFOCOM, Hong Kong, Mar. 2004,
pp. 715–725.
9. International Journal of Electronics and Communication Engineering Research and Development
(IJECERD), ISSN 2248-9525(Print), ISSN- 2248-9533 (Online) Volume 4, Number 2, April-June (2014)
72
[15] P.-H. Ho, J. Topolcai, and H. T. Mouftah, “On achieving optimal survivable routing for
shared protection in survivable next-generation internet,” IEEE Trans. Rel., vol. 53,
no. 2, pp. 216–225, Jun. 2004.
[16] C. Xin, Y. Ye, S. Dixit, and C. Qiao, “A joint working and protection path selection
approach in WDM optical networks,” in Proc. IEEE GLOBECOM, Nov. 2001, vol. 4,
pp. 2165–2168.
[17] R. He, H. Wen, G. Wang, and L. Li, “Joint optimal path selection algorithm in
survivable WDM networks,” in Proc. 4th Int. Conf. PDCAT, Aug. 2003, pp. 259–262.
[18] J. Zhang, K. Zhu, L. Sahasrabuddhe, J. B. Yoo, and B. Mukherjee, “On the study of
routing and wavelength assignment approaches for survivable wavelength-routed WDM
mesh networks,” Opt. Netw. Mag., vol. 4, no. 6, pp. 16–27, Oct. 2003.
[19] C. S. Ou, J. Zhang, H. Zang, L. Sahasrabuddhe, and B. Mukherjee, “Nearoptimal
approaches for shared-path protection in WDM mesh networks,” in Proc. ICC,
Anchorage, AK, May 2003, pp. 1320–1324.
[20] L. Guo, H. Yu, and L. Li, “Joint routing-selection algorithm for a shared path with
differentiated reliability in survivable wavelength-division multiplexing mesh
networks,” Opt. Express, vol. 12, no. 11, pp. 2327–2337, May 2004.