Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The
Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To
Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We
Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The
Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential
Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each
Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The
Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast
Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route
Maintenance.
DYNAMIC QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MAN...csandit
Mobile ad hoc networking does not possess any fixed infrastructure and hence, stable routing is the major problem. The mobility nature of MANET’s node facilitates rediscovery of a new path to organizing a routing. In order to intensify the Quality of Service and routing stability in MANET, we propose a Dynamic Quality of service Stability based Multicast Routing Protocol by modifying the Cuckoo Search Algorithm through a modernizing mechanism which is derived from the differential evolution algorithm. Tuned CSA is a combined feature of CSA and DE algorithms. Periodically, each node in the network creates neighbour stability and QoS database at every node by calculating the parameters like node and link stability factor,
bandwidth availability, and delays. Finally, multicast path constructs route request and route reply packets, stability information and performing route maintenance.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
An Adaptive Cluster Head Election Algorithm for Heterogeneous Mobile Ad-hoc N...IJLT EMAS
Mobile ad-hoc network characterized as a homogenous and heterogeneous on the basis of node capabilities. Heterogeneity property may make issues for mobile ad-hoc network in context of coverage area, link stability, lifetime etc. To resolve these issues, require a mechanism to adapt different characteristics and make decision for smooth functioning. Heterogeneity also leads effective routing problem that occurs instability in route or path. Though to make effective routing in this situation, efficient clustering algorithm may be apply. In this paper, the effects of heterogeneity property are studied and analyzed. A cluster head algorithm is also suggested to deal with the effects of the property. Suggested algorithm is simulated in network simulation and performance is evaluated in context of computation cost, lifetime and number of clusters.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
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.
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.
DYNAMIC QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MAN...csandit
Mobile ad hoc networking does not possess any fixed infrastructure and hence, stable routing is the major problem. The mobility nature of MANET’s node facilitates rediscovery of a new path to organizing a routing. In order to intensify the Quality of Service and routing stability in MANET, we propose a Dynamic Quality of service Stability based Multicast Routing Protocol by modifying the Cuckoo Search Algorithm through a modernizing mechanism which is derived from the differential evolution algorithm. Tuned CSA is a combined feature of CSA and DE algorithms. Periodically, each node in the network creates neighbour stability and QoS database at every node by calculating the parameters like node and link stability factor,
bandwidth availability, and delays. Finally, multicast path constructs route request and route reply packets, stability information and performing route maintenance.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
An Adaptive Cluster Head Election Algorithm for Heterogeneous Mobile Ad-hoc N...IJLT EMAS
Mobile ad-hoc network characterized as a homogenous and heterogeneous on the basis of node capabilities. Heterogeneity property may make issues for mobile ad-hoc network in context of coverage area, link stability, lifetime etc. To resolve these issues, require a mechanism to adapt different characteristics and make decision for smooth functioning. Heterogeneity also leads effective routing problem that occurs instability in route or path. Though to make effective routing in this situation, efficient clustering algorithm may be apply. In this paper, the effects of heterogeneity property are studied and analyzed. A cluster head algorithm is also suggested to deal with the effects of the property. Suggested algorithm is simulated in network simulation and performance is evaluated in context of computation cost, lifetime and number of clusters.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
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.
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.
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.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied protocols.
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
On Demand Bandwidth Reservation for Real- Time Traffic in Cellular IP Network...IDES Editor
As real-time traffic requires more attention, it
is given priority over non-real-time traffic in Cellular IP
networks. Bandwidth reservation is often applied to serve
such traffic in order to achieve better Quality of Service
(QoS). Evolutionary Algorithms are quite useful in
solving optimization problems of such nature. This paper
employs Genetic Algorithm (GA) for bandwidth
management in Cellular IP network. It compares the
performance of the model with another model used for
optimizing Connection Dropping Probability (CDP) using
Particle Swarm Optimization (PSO). Both models, GA
based and PSO based, try to minimize the Connection
Dropping Probability for real-time users in the network
by searching the free available bandwidth in the user’s
cell or in the neighbor cells and assigning it to the realtime
users. Alternatively, if the free bandwidth is not
available, the model borrows the bandwidth from nonreal
time-users and gives it to the real-time users.
Experimental results evaluate the performance of the GA
based model. The comparative study between both the
models indicates that GA based model has an edge over
the PSO based one.
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).
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.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
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.
Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint
Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with
respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on
improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone
structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved
Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to
adapt the virtual backbone to topology changes. This assumes significance especially in networks that
experience very high mobility. Changes in the network topology caused by node additions, node deletions
and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR
protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying
mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR
protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions.
Founded in 2006 as a Polish-Dutch IT company, Goyello is a full service Agile Software Solution Provider
with over 100 employees, working in 3 offices, both in The Netherlands and in Poland (Gdańsk and Koszalin).
Talented, dedicated developers, consultants, designers, front-end developers, project managers, testers, support
and management team – all working as an energetic team for our clients in Europe and America.
ROBUST FEATURE EXTRACTION USING AUTOCORRELATION DOMAIN FOR NOISY SPEECH RECOG...sipij
Previous research has found autocorrelation domain as an appropriate domain for signal and noise
separation. This paper discusses a simple and effective method for decreasing the effect of noise on the
autocorrelation of the clean signal. This could later be used in extracting mel cepstral parameters for
speech recognition. Two different methods are proposed to deal with the effect of error introduced by
considering speech and noise completely uncorrelated. The basic approach deals with reducing the effect
of noise via estimation and subtraction of its effect from the noisy speech signal autocorrelation. In order
to improve this method, we consider inserting a speech/noise cross correlation term into the equations used
for the estimation of clean speech autocorrelation, using an estimate of it, found through Kernel method.
Alternatively, we used an estimate of the cross correlation term using an averaging approach. A further
improvement was obtained through introduction of an overestimation parameter in the basic method. We
tested our proposed methods on the Aurora 2 task. The Basic method has shown considerable improvement
over the standard features and some other robust autocorrelation-based features. The proposed techniques
have further increased the robustness of the basic autocorrelation-based method.
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.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied protocols.
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
On Demand Bandwidth Reservation for Real- Time Traffic in Cellular IP Network...IDES Editor
As real-time traffic requires more attention, it
is given priority over non-real-time traffic in Cellular IP
networks. Bandwidth reservation is often applied to serve
such traffic in order to achieve better Quality of Service
(QoS). Evolutionary Algorithms are quite useful in
solving optimization problems of such nature. This paper
employs Genetic Algorithm (GA) for bandwidth
management in Cellular IP network. It compares the
performance of the model with another model used for
optimizing Connection Dropping Probability (CDP) using
Particle Swarm Optimization (PSO). Both models, GA
based and PSO based, try to minimize the Connection
Dropping Probability for real-time users in the network
by searching the free available bandwidth in the user’s
cell or in the neighbor cells and assigning it to the realtime
users. Alternatively, if the free bandwidth is not
available, the model borrows the bandwidth from nonreal
time-users and gives it to the real-time users.
Experimental results evaluate the performance of the GA
based model. The comparative study between both the
models indicates that GA based model has an edge over
the PSO based one.
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).
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.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
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.
Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint
Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with
respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on
improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone
structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved
Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to
adapt the virtual backbone to topology changes. This assumes significance especially in networks that
experience very high mobility. Changes in the network topology caused by node additions, node deletions
and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR
protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying
mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR
protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions.
Founded in 2006 as a Polish-Dutch IT company, Goyello is a full service Agile Software Solution Provider
with over 100 employees, working in 3 offices, both in The Netherlands and in Poland (Gdańsk and Koszalin).
Talented, dedicated developers, consultants, designers, front-end developers, project managers, testers, support
and management team – all working as an energetic team for our clients in Europe and America.
ROBUST FEATURE EXTRACTION USING AUTOCORRELATION DOMAIN FOR NOISY SPEECH RECOG...sipij
Previous research has found autocorrelation domain as an appropriate domain for signal and noise
separation. This paper discusses a simple and effective method for decreasing the effect of noise on the
autocorrelation of the clean signal. This could later be used in extracting mel cepstral parameters for
speech recognition. Two different methods are proposed to deal with the effect of error introduced by
considering speech and noise completely uncorrelated. The basic approach deals with reducing the effect
of noise via estimation and subtraction of its effect from the noisy speech signal autocorrelation. In order
to improve this method, we consider inserting a speech/noise cross correlation term into the equations used
for the estimation of clean speech autocorrelation, using an estimate of it, found through Kernel method.
Alternatively, we used an estimate of the cross correlation term using an averaging approach. A further
improvement was obtained through introduction of an overestimation parameter in the basic method. We
tested our proposed methods on the Aurora 2 task. The Basic method has shown considerable improvement
over the standard features and some other robust autocorrelation-based features. The proposed techniques
have further increased the robustness of the basic autocorrelation-based method.
A NOVEL METHOD FOR PERSON TRACKING BASED K-NN : COMPARISON WITH SIFT AND MEAN...sipij
Object tracking can be defined as the process of detecting an object of interest from a video scene and
keeping track of its motion, orientation, occlusion etc. in order to extract useful information. It is indeed a
challenging problem and it’s an important task. Many researchers are getting attracted in the field of
computer vision, specifically the field of object tracking in video surveillance. The main purpose of this
paper is to give to the reader information of the present state of the art object tracking, together with
presenting steps involved in Background Subtraction and their techniques. In related literature we found
three main methods of object tracking: the first method is the optical flow; the second is related to the
background subtraction, which is divided into two types presented in this paper, then the temporal
differencing and the SIFT method and the last one is the mean shift method. We present a novel approach
to background subtraction that compare a current frame with the background model that we have set
before, so we can classified each pixel of the image as a foreground or a background element, then comes
the tracking step to present our object of interest, which is a person, by his centroid. The tracking step is
divided into two different methods, the surface method and the K-NN method, both are explained in the
paper. Our proposed method is implemented and evaluated using CAVIAR database.
““USATESTDOWN” A PROPOSAL OF A USABILITY TESTING GUIDE FOR MOBILE APPLICATION...csandit
The usability testing of mobile applications involving persons with Down syndrome is an issue
that has not be comprehensively investigated and there is no single proposal that takes on board
all the issues that could be taken into account[1]. This study aims to propose a practical guide
¨USATESTDOWN¨ to measure and evaluate the usability of mobile applications focusing on
Down syndrome users and their primary limitations. The study starts with an analysis of
existing methodologies and tools to evaluate usability and integrates concepts related to
inspection and inquiry methods into a proposal. The proposal includes the opinions of experts
and representative users; their limitations, the applicability during the development process and
the accessibility. This guide is based on the literature review and the author
SEGMENTATION AND CLASSIFICATION OF BRAIN TUMOR CT IMAGES USING SVM WITH WEIGH...csandit
In this article a method is proposed for segmentation and classification of benign and malignant
tumor slices in brain Computed Tomography (CT) images. In this study image noises are
removed using median and wiener filter and brain tumors are segmented using Support Vector
Machine (SVM). Then a two-level discrete wavelet decomposition of tumor image is performed
and the approximation at the second level is obtained to replace the original image to be used
for texture analysis. Here, 17 features are extracted that 6 of them are selected using Student’s
t-test. Dominant gray level run length and gray level co-occurrence texture features are used for
SVM training. Malignant and benign tumors are classified using SVM with kernel width and
Weighted kernel width (WSVM) and k-Nearest Neighbors (k-NN) classifier. Classification
accuracy of classifiers are evaluated using 10 fold cross validation method. The segmentation
results are also compared with the experienced radiologist ground truth. The experimental
results show that the proposed WSVM classifier is able to achieve high classification accuracy
effectiveness as measured by sensitivity and specificity.
A WIND POWER PREDICTION METHOD BASED ON BAYESIAN FUSIONcsandit
Wind power prediction (WPP) is of great importance to the safety of the power grid and the
effectiveness of power generations dispatching. However, the accuracy of WPP obtained by
single numerical weather prediction (NWP) is difficult to satisfy the demands of the power
system. In this research, we proposed a WPP method based on Bayesian fusion and multisource
NWPs. First, the statistic characteristics of the forecasted wind speed of each-source
NWP was analysed, pre-processed and transformed. Then, a fusion method based on Bayesian
method was designed to forecast the wind speed by using the multi-source NWPs, which is more
accurate than any original forecasted wind speed of each-source NWP. Finally, the neural
network method was employed to predict the wind power with the wind speed forecasted by
Bayesian method. The experimental results demonstrate that the accuracy of the forecasted
wind speed and wind power prediction is improved significantly.
INFORMATION SECURITY MATURITY MODEL FOR NIST CYBER SECURITY FRAMEWORK Sultancsandit
The National Institute of Standards and Technology (NIST) has issued a framework to provide
guidance for organizations within critical infrastructure sectors to reduce the risk associated
with cyber security. The framework is called NIST Cyber Security Framework for Critical
Infrastructure (CSF). Many organizations are currently implementing or aligned to different
information security frameworks. The implementation of NIST CSF needs to be aligned with and
complement the existing frameworks. NIST states that the NIST CSF is not a maturity
framework. Therefore, there is a need to adopt an existing maturity model or create one to have
a common way to measure the CSF implementation progress. This paper explores the
applicability of number of maturity models to be used as a measure to the security poster of
organizations implementing the NIST CSF. This paper reviews the NIST CSF and compares it to
other information security related frameworks such as COBIT, ISO/IEC 27001 and the ISF
Standard of Good Practice (SoGP) for Information Security. We propose a new information
security maturity model (ISMM) that fills the gap in the NIST CSF.
CORRELATION BASED FUNDAMENTAL FREQUENCY EXTRACTION METHOD IN NOISY SPEECH SIGNALijcseit
This paper proposed a correlation based method using the autocorrelation function and the YIN. The
autocorrelation function and also YIN is a popular measurement in estimating fundamental frequency in
time domain. The performance of these two methods, however, is effected due to the position of dominant
harmonics (usually the first formant) and the presence of spurious peaks introduced in noisy conditions.
The experimental results of computer simulations on female and male voices in different noises perform
that the gross pitch errors are lower in proposed method as compared to other related method in different
types of signal to noise ratio conditions.
EXPOSURE AND AVOIDANCE MECHANISM OF BLACK HOLE AND JAMMING ATTACK IN MOBILE A...ijcseit
Mobile ad hoc network (MANETs) is an infrastructure-less/self-configurable system in which every node
carries on as host or router and every node can participate in the transmission of packets. Because of its
dynamic behaviour such system is more susceptible against various sorts of security threats, for example,
Black hole, Wormhole , Jamming , Sybil, Byzantine attack and so on which may block the transmission of
the system. Black hole attack and Jamming attack is one of them which promote itself has shortest or new
fresh route to the destination while jamming attack which make activity over the system. This paper
introduces the thorough literature study for the Black hole attack and jamming attack of both the attack by
various researchers.
Dynamic Quality of Service Stability Based Multicast Routing Protocol for MAN...cscpconf
Mobile ad hoc networking does not possess any fixed infrastructure and hence, stable routing is
the major problem. The mobility nature of MANET’s node facilitates rediscovery of a new path
to organizing a routing. In order to intensify the Quality of Service and routing stability in
MANET, we propose a Dynamic Quality of service Stability based Multicast Routing Protocol
by modifying the Cuckoo Search Algorithm through a modernizing mechanism which is derived
from the differential evolution algorithm. Tuned CSA is a combined feature of CSA and DE
algorithms. Periodically, each node in the network creates neighbour stability and QoS
database at every node by calculating the parameters like node and link stability factor,
bandwidth availability, and delays. Finally, multicast path constructs route request and route
reply packets, stability information and performing route maintenance
Adaptive Bandwidth Management Model for Wireless Mobile Ad-hoc NetworkIJCNCJournal
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and authentic data transfer. During real-time data transfer, to make communication effective, we make use of bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance networks. In our proposed model we are concentrating on the maximum utilization of resources, and using the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources. Our simulation result also shows that our model improves the network performance.
ADAPTIVE BANDWIDTH MANAGEMENT MODEL FOR WIRELESS MOBILE AD-HOC NETWORKIJCNCJournal
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current
network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network
resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient
mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and
authentic data transfer. During real-time data transfer, to make communication effective, we make use of
bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance
networks. In our proposed model we are concentrating on the maximum utilization of resources, and using
the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to
reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources.
Our simulation result also shows that our model improves the network performance.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
IEEE 2014 DOTNET MOBILE COMPUTING PROJECTS A qos-oriented-distributed-routing...IEEEMEMTECHSTUDENTPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSijwmn
Wireless sensor networks are useful for streaming multimedia in infrastructure-free and hazardous environments. However, these networks are quite different from their wired counterpart and are composed of nodes with constrained bandwidth and energy. Multiple-path transmission is one of the methods for ensuring QoS routing in both wired and wireless environment. Directed diffusion, a well known wireless sensor network protocol, only routes packets through a single path, which barely meets the throughput requirement of multimedia data. Instead, we propose a multipath algorithm based on directed diffusion that reinforces multiple routes with high link quality and low latency. This algorithm retains the merits of the original directed diffusion algorithms, including its energy efficiency and scalability. A hybrid metric of link quality and latency is used as the criterion for path selection. In order to select disjoint paths, we propose a scheme for reinforced nodes to respond negatively to multiple reinforcement messages. We use the NS-2 simulation tool with video trace generated by Multiple Description Coding (MDC) to evaluate the performance. The results show that our algorithm gives better throughput and delay performance, i.e higher video quality, than standard directed diffusion that transmits over a single path, with low overheads and energy consumption.
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
Ant Colony with Colored Pheromones Routing for Multi Objectives Quality of Se...IJORCS
In this article, we present a new Ant-routing algorithm with colored pheromones and clustering techniques for satisfying users’ Quality of Service (QoS) requirements in Wireless Sensor Networks (WSNs). An important problem is to detect the best route from a source node to the destination node. Moreover, it is considered that the feature of non-uniformly distributed traffic load and possibility existing of the traffic requiring various performances; therefore, it is assumed the different class of traffic required for QoS of communication. In this paper, novel protocol, the suitability of using meta-heuristic an ant colony optimization based on energy saving and multi objectives, the demand of QoS routing protocol for WSN will be very adaptive ,resident power and mainly decrease end-to-end delay. These metrics are used by colored pheromones adapted to the traffic classes. Moreover, we reinforce the proposed method for scalability issue by clustering techniques. We use a proactive route discover algorithms in clusters and reactive discovery mechanism between different clusters. Compared to existing QoS routing protocols, the novel algorithm has been designed for various service categories such as real time (RT) and best effort (BE) traffic, resulted lower packet deadline miss ratio and higher energy efficiency and better QoS and longer lifetime.
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...GiselleginaGloria
Wireless mesh networking has transpired as a gifted technology for potential broadband wireless access. In a communication network, wireless mesh network plays a vital role in transmission and are structured in a mesh topology. The coordination of mesh routers and mesh clients forms the wireless mesh networks which are routed through the gateways. Wireless mesh networks uses IEEE 802.11 standards and has its wide applications broadband home networking and enterprise networking deployment such as Microsoft wireless mesh and MIT etc. A professional Qos provisioning in intra cluster packet level resource allocation for WMN approach takes power allocation, sub carrier allocation and packet scheduling. This approach combines the merits of a Karush-Kuhn-Tucker (KKT) algorithm and a genetic algorithm (GA) based approach. The KKT algorithm uses uniform power allocation over all the subcarriers, based on the optimal allocation criterion. The genetic algorithm is used to generate useful solutions to optimization and search problems and it is also used for search problems. By combining the intrinsic worth of both the approaches, it facilitates effective QOS provisioning at the packet level. It is concluded that, this approach achieves a preferred stability between system implementation and computational convolution.
Enhancenig OLSR routing protocol using K-means clustering in MANETs IJECEIAES
The design of robust routing protocol schemes for MANETs is quite complex, due to the characteristics and structural constraints of this network. A numerous variety of protocol schemes have been proposed in literature. Most of them are based on traditional method of routing, which doesn’t guarantee basic levels of Qos, when the network becomes larger, denser and dynamic. To solve this problem we use one of the most popular methods named clustering. In this work we try to improve the Qos in MANETs. We propose an algorithm of clustering based in the new mobility metric and K-Means method to distribute the nodes into several clusters; it is implemented to standard OLSR protocol giving birth a new protocol named OLSR Kmeans-SDE. The simulations showed that the results obtained by OLSR Kmeans-SDE exceed those obtained by standard OLSR Kmeans and OLSR Kmed+ in terms of, traffic Control, delay and packet delivery ratio.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
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.
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.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Similar to QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETS (20)
We describe the deployment and use of Globus Compute for remote computation. This content is aimed at researchers who wish to compute on remote resources using a unified programming interface, as well as system administrators who will deploy and operate Globus Compute services on their research computing infrastructure.
In software engineering, the right architecture is essential for robust, scalable platforms. Wix has undergone a pivotal shift from event sourcing to a CRUD-based model for its microservices. This talk will chart the course of this pivotal journey.
Event sourcing, which records state changes as immutable events, provided robust auditing and "time travel" debugging for Wix Stores' microservices. Despite its benefits, the complexity it introduced in state management slowed development. Wix responded by adopting a simpler, unified CRUD model. This talk will explore the challenges of event sourcing and the advantages of Wix's new "CRUD on steroids" approach, which streamlines API integration and domain event management while preserving data integrity and system resilience.
Participants will gain valuable insights into Wix's strategies for ensuring atomicity in database updates and event production, as well as caching, materialization, and performance optimization techniques within a distributed system.
Join us to discover how Wix has mastered the art of balancing simplicity and extensibility, and learn how the re-adoption of the modest CRUD has turbocharged their development velocity, resilience, and scalability in a high-growth environment.
Into the Box Keynote Day 2: Unveiling amazing updates and announcements for modern CFML developers! Get ready for exciting releases and updates on Ortus tools and products. Stay tuned for cutting-edge innovations designed to boost your productivity.
Unleash Unlimited Potential with One-Time Purchase
BoxLang is more than just a language; it's a community. By choosing a Visionary License, you're not just investing in your success, you're actively contributing to the ongoing development and support of BoxLang.
Field Employee Tracking System| MiTrack App| Best Employee Tracking Solution|...informapgpstrackings
Keep tabs on your field staff effortlessly with Informap Technology Centre LLC. Real-time tracking, task assignment, and smart features for efficient management. Request a live demo today!
For more details, visit us : https://informapuae.com/field-staff-tracking/
May Marketo Masterclass, London MUG May 22 2024.pdfAdele Miller
Can't make Adobe Summit in Vegas? No sweat because the EMEA Marketo Engage Champions are coming to London to share their Summit sessions, insights and more!
This is a MUG with a twist you don't want to miss.
OpenFOAM solver for Helmholtz equation, helmholtzFoam / helmholtzBubbleFoamtakuyayamamoto1800
In this slide, we show the simulation example and the way to compile this solver.
In this solver, the Helmholtz equation can be solved by helmholtzFoam. Also, the Helmholtz equation with uniformly dispersed bubbles can be simulated by helmholtzBubbleFoam.
top nidhi software solution freedownloadvrstrong314
This presentation emphasizes the importance of data security and legal compliance for Nidhi companies in India. It highlights how online Nidhi software solutions, like Vector Nidhi Software, offer advanced features tailored to these needs. Key aspects include encryption, access controls, and audit trails to ensure data security. The software complies with regulatory guidelines from the MCA and RBI and adheres to Nidhi Rules, 2014. With customizable, user-friendly interfaces and real-time features, these Nidhi software solutions enhance efficiency, support growth, and provide exceptional member services. The presentation concludes with contact information for further inquiries.
Code reviews are vital for ensuring good code quality. They serve as one of our last lines of defense against bugs and subpar code reaching production.
Yet, they often turn into annoying tasks riddled with frustration, hostility, unclear feedback and lack of standards. How can we improve this crucial process?
In this session we will cover:
- The Art of Effective Code Reviews
- Streamlining the Review Process
- Elevating Reviews with Automated Tools
By the end of this presentation, you'll have the knowledge on how to organize and improve your code review proces
Globus Connect Server Deep Dive - GlobusWorld 2024Globus
We explore the Globus Connect Server (GCS) architecture and experiment with advanced configuration options and use cases. This content is targeted at system administrators who are familiar with GCS and currently operate—or are planning to operate—broader deployments at their institution.
Quarkus Hidden and Forbidden ExtensionsMax Andersen
Quarkus has a vast extension ecosystem and is known for its subsonic and subatomic feature set. Some of these features are not as well known, and some extensions are less talked about, but that does not make them less interesting - quite the opposite.
Come join this talk to see some tips and tricks for using Quarkus and some of the lesser known features, extensions and development techniques.
AI Pilot Review: The World’s First Virtual Assistant Marketing SuiteGoogle
AI Pilot Review: The World’s First Virtual Assistant Marketing Suite
👉👉 Click Here To Get More Info 👇👇
https://sumonreview.com/ai-pilot-review/
AI Pilot Review: Key Features
✅Deploy AI expert bots in Any Niche With Just A Click
✅With one keyword, generate complete funnels, websites, landing pages, and more.
✅More than 85 AI features are included in the AI pilot.
✅No setup or configuration; use your voice (like Siri) to do whatever you want.
✅You Can Use AI Pilot To Create your version of AI Pilot And Charge People For It…
✅ZERO Manual Work With AI Pilot. Never write, Design, Or Code Again.
✅ZERO Limits On Features Or Usages
✅Use Our AI-powered Traffic To Get Hundreds Of Customers
✅No Complicated Setup: Get Up And Running In 2 Minutes
✅99.99% Up-Time Guaranteed
✅30 Days Money-Back Guarantee
✅ZERO Upfront Cost
See My Other Reviews Article:
(1) TubeTrivia AI Review: https://sumonreview.com/tubetrivia-ai-review
(2) SocioWave Review: https://sumonreview.com/sociowave-review
(3) AI Partner & Profit Review: https://sumonreview.com/ai-partner-profit-review
(4) AI Ebook Suite Review: https://sumonreview.com/ai-ebook-suite-review
Paketo Buildpacks : la meilleure façon de construire des images OCI? DevopsDa...Anthony Dahanne
Les Buildpacks existent depuis plus de 10 ans ! D’abord, ils étaient utilisés pour détecter et construire une application avant de la déployer sur certains PaaS. Ensuite, nous avons pu créer des images Docker (OCI) avec leur dernière génération, les Cloud Native Buildpacks (CNCF en incubation). Sont-ils une bonne alternative au Dockerfile ? Que sont les buildpacks Paketo ? Quelles communautés les soutiennent et comment ?
Venez le découvrir lors de cette session ignite
Large Language Models and the End of ProgrammingMatt Welsh
Talk by Matt Welsh at Craft Conference 2024 on the impact that Large Language Models will have on the future of software development. In this talk, I discuss the ways in which LLMs will impact the software industry, from replacing human software developers with AI, to replacing conventional software with models that perform reasoning, computation, and problem-solving.
TROUBLESHOOTING 9 TYPES OF OUTOFMEMORYERRORTier1 app
Even though at surface level ‘java.lang.OutOfMemoryError’ appears as one single error; underlyingly there are 9 types of OutOfMemoryError. Each type of OutOfMemoryError has different causes, diagnosis approaches and solutions. This session equips you with the knowledge, tools, and techniques needed to troubleshoot and conquer OutOfMemoryError in all its forms, ensuring smoother, more efficient Java applications.
Navigating the Metaverse: A Journey into Virtual Evolution"Donna Lenk
Join us for an exploration of the Metaverse's evolution, where innovation meets imagination. Discover new dimensions of virtual events, engage with thought-provoking discussions, and witness the transformative power of digital realms."
Climate Science Flows: Enabling Petabyte-Scale Climate Analysis with the Eart...Globus
The Earth System Grid Federation (ESGF) is a global network of data servers that archives and distributes the planet’s largest collection of Earth system model output for thousands of climate and environmental scientists worldwide. Many of these petabyte-scale data archives are located in proximity to large high-performance computing (HPC) or cloud computing resources, but the primary workflow for data users consists of transferring data, and applying computations on a different system. As a part of the ESGF 2.0 US project (funded by the United States Department of Energy Office of Science), we developed pre-defined data workflows, which can be run on-demand, capable of applying many data reduction and data analysis to the large ESGF data archives, transferring only the resultant analysis (ex. visualizations, smaller data files). In this talk, we will showcase a few of these workflows, highlighting how Globus Flows can be used for petabyte-scale climate analysis.
Climate Science Flows: Enabling Petabyte-Scale Climate Analysis with the Eart...
QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETS
1. Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
DOI:10.5121/cseij.2017.7101 1
QUALITY OF SERVICE STABILITY BASED MULTICAST
ROUTING PROTOCOL FOR MANETS
M.Vijayalakshmi1
and D.SreenivasaRao2
1
Department of Electronics and Communication Engineering, GNITS, India
2
Department of Electronics and Communication Engineering, JNTUH, India
ABSTRACT
Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The
Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To
Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We
Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The
Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential
Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each
Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The
Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast
Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route
Maintenance.
KEYWORDS: MANETS, QOS, TUNED CSA, DQSMRP
1. INTRODUCTION
Mobile Ad hoc Networks (MANETs) are foremost in class kind of wireless communication
networks in which mobile nodes link on an on-demand basis. MANETs are having the ability to
configure on their own and easing peer-level communications among mobile nodes independent
by having no fixed infrastructure. When the route traffic occurs, constructing a MANET with
each node’s to continuously retain the information remains a major challenge. Normally,
MANETs are used for group communications where multicast protocols are efficiently compared
to unicast protocols since they improve the efficiency of the wireless links in MANETs. The
multicast protocols are also used as application demands for transmitting copies from either single
or multiple sources to the receivers.
Multicasting reduces the communication costs by sending the single copy of the data to multiple
recipients through which it minimizes link bandwidth, processing and transmission delay.
Previous researchers have developed different algorithms to improvise the ability for selecting the
routing path(s) and thereby, effectively met the desired Quality of Service (QoS) [1]. This
infrastructure consequences in a highly dynamic topology causing a challenging task for QoS
Routing.
When compared with well-established networks such as Wi-Fi, Global System for Mobile
communication (GSM) and Code Division Multiple Access (CDMA), MANET was not reliable
to meet QoS performances. The MANET performance is determined by the QoS through the
basic parameters like bandwidth or delay or loss. QoS routing addresses both the issues of
deciding a path from source to destination and fulfilling the QoS constraints like bandwidth, delay
2. Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
2
and loss. Route selection method is used to fulfill QoS requirements. The goal of QoS routing
strategy is to maximize the network resources in order to reduce the constraints in MANET’s
mobile nodes.
In real time applications, QoS routing protocol works based on multi-hop mobile networks [3, 4].
Particularly, QoS requirement depends on constraints such as link constraints, path constraints
and tree constraints. End to End delay is usually affected by path constraint whereas, delay-jitter
[5] by tree constraint. In order to meet all the constraints, robust techniques are required to solve
the QoS requirements. Heuristic techniques are better to solve these constraints rather than
deterministic methods. Researchers have studied various improvements based on heuristic
methods [5, 6] and at the same time devised various solutions to solve QoS routing problems
using heuristic methods[7].
Ad hoc mobile routing (AM Routing) was studied through which a specific unicast routing
protocol was identified as more feasible than other unicast routing protocols (8). In QoS routing,
network topology was constructed in which bandwidth link works in destination point [9]. A new
protocol was proposed for ad hoc networks which are used to establish and maintain a shared
mesh for each multicast group called Policy-based Unified Multi-radio, Architecture for Agile
Mesh Networking (PUMA) [10]. A new single mixed metrics have been delineated for multi-
constraint QoS routing [11]. Previous literaturehas found that Agent Based Multicast Routing
Scheme (ABMRS) on MANET’s could be used as a set of static and mobile agents for QoS
routing [12, 13]. Optimized link state routing protocol was launched and scrutinized in different
research papers [14].
Besides that, several heuristic methods are examined to study the multi-constraint QoS routing. In
[15], Simulated Annealing (SA) was introduced to solve the QoS routing problems. Reference
[16]] discussed Bees Life Algorithm (BLA) to solve the QoS multicast routing problem and
constraints such as delay, allowed jitter, and requested bandwidth have been studied. Similarly, a
Tabu search [17] based method concentrates on two important constraints in QoS such as
bandwidth and end-to-end delay. Ant algorithm optimization was globally accepted for the
effective and systematic handling of QoS routing [18][19] Harmony search (HS) algorithm, a
unique algorithm was used to find the path of the MANET and it was discussed based on
bandwidth-delay-constraints in multicast routing problem [20].
Hybrid methods have been proposed to address the delay of premature convergence [21]. A PSO-
GA algorithm was evolved using a combination of both particle swarm optimization (PSO)
method and genetic algorithm (GA) which provides an effective and efficient search for the
solution. In [22], the new fuzzy genetic algorithm is also introduced for QoS multicast routing is
also discussed.
Thus in this paper, we propose Dynamic Quality of Service Stability based multicast routing
protocol (DQSMRP) for the multi-constraint QoS routing problem. Recently, Cuckoo Search
(CS) is derived from reproduction strategies [23] which are widely used in heuristic based
algorithms. [24, 25].It is more exhaustive and provides quick search to obtain better solutions to
routing in more reliable and robust manner.
2. PROBLEM DEFINITION, RESEARCH METHODOLOGY
The optimization problem is used to solve the QoS routing problem which is the primary
objective to find a multicast tree constraints based on the cost function in order to reduce the
practical constraints. Four different constraints are considered for formulating the current study
3. Computer Science & Engineering: An Internati
such as delay, packet loss, bandwidth
for computation [5] QoS routing
Reasons to merge both cost optimization and
Formulations are based on multiple constraints and the multicast structure in order to spot
an attainable path for each node having source and destination.
To shrink the network resource utilization by users.
In progressively,
The Delay Constraint is defined as the allowed delay limit that
network. When there is no link provided between any two nodes, a penalty
The Bandwidth Constraint is the re
network.
Specifically , , , , are the bandwidth, delay, delay
corresponding penalty constants. The
QoS routing problem as described by numerical experiments in the coming section.
2.1 TUNED CUCKOO SEARCH
A technique that produces simple implementation and quality
provider. This paper provides better results over the existing algorithms such as meta
techniques. Before analyzing the proposed method, the
2.1.1. AN OVERVIEW OF CUCKOO
By analogy of reproduction strategy, CS algorithm is
algorithms which follow the principle of cuckoos (chosen nests of other birds for laying eggs)
[26, 27]. Generally, the host bird would n
vice-versa. The important optimization procedure is as follows:
Initial Solution: Cuckoo egg symbolizes a set of solutions and its value of
dimensions was extracted from various nests randomly;
Next Generation: The best eggs with common solutions only able to proceed to the next
generation.
Acceptance Rule: New egg will succeed in the
of CS are explained as follows:
Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
bandwidth and jitter. The following equation provides formulation data
function is formulated as below
…………………….(1)
Reasons to merge both cost optimization and multi-constrained routing are as follows
Formulations are based on multiple constraints and the multicast structure in order to spot
an attainable path for each node having source and destination.
To shrink the network resource utilization by users.
…………………………… (2)
The Delay Constraint is defined as the allowed delay limit that exists in any branch of the
network. When there is no link provided between any two nodes, a penalty occurs.
………………….(3)
The Bandwidth Constraint is the requirement of average bandwidth among all tree branches in the
………………….(4)
, are the bandwidth, delay, delay-jitter and packet-loss for the
corresponding penalty constants. The objective of the initiated solution is to solve the multicast
QoS routing problem as described by numerical experiments in the coming section.
EARCH MULTICAST ROUTING PROTOCOL
A technique that produces simple implementation and quality solutions is the best solution
provider. This paper provides better results over the existing algorithms such as meta
the proposed method, the cuckoo algorithm is discussed as follows.
UCKOO SEARCH ALGORITHM
By analogy of reproduction strategy, CS algorithm is a well known prominent heuristic search
the principle of cuckoos (chosen nests of other birds for laying eggs)
[26, 27]. Generally, the host bird would not permit the cuckoo eggs to easily differentiate and
versa. The important optimization procedure is as follows:
Cuckoo egg symbolizes a set of solutions and its value of
extracted from various nests randomly;
The best eggs with common solutions only able to proceed to the next
New egg will succeed in the nest if eggs are unknown. Important step
as follows:
onal Journal (CSEIJ), Vol.7, No.1, February 2017
3
and jitter. The following equation provides formulation data
routing are as follows
Formulations are based on multiple constraints and the multicast structure in order to spot
in any branch of the
quirement of average bandwidth among all tree branches in the
loss for the
objective of the initiated solution is to solve the multicast
solutions is the best solution
provider. This paper provides better results over the existing algorithms such as meta-heuristic
discussed as follows.
heuristic search
the principle of cuckoos (chosen nests of other birds for laying eggs)
ot permit the cuckoo eggs to easily differentiate and
Cuckoo egg symbolizes a set of solutions and its value of
The best eggs with common solutions only able to proceed to the next
Important step
4. Computer Science & Engineering: An Internati
Step 1: Randomly set “Pop” host nests, a
Step 2: Evaluate the fitness of all nests
Step 3: Do Iterations <Max. Iterations
Step 4: Produce a cuckoo egg
Step 5: Compute the fitness of
Step 6: Check for existence: choose again a random nest
Step 7: if then
Step 8:
Step 9: end if
Step 10: Remove a fraction of the worst nests at the rate of
Step 11: Randomly, Building
Step 12:End While
The benefit of this heuristics is its simplicity. The single parameter of CS algorithm should be
considered enough when compared with PSO and Ant colony algori
2.1.2 NODE STABILITY
For efficient better packet delivery services in forwarding group, the
stable .The way of providing stability is that moving node around its current position. Node
stability metric have been used in pr
stable path nodes have been found from packets
stability and neighbor nodes stability are two metrics to represent node stability.
Following steps to find stability of a node:
In MANET’s nodes, it
previous position.
MANET’s node gives the node stability factor from
Actually, stability is based on the distance between the movements of nodes positioning
within transmission range. Stable node is created when movement within transmission
range.
2.1.3 NEIGHBOR NODE STABILITY
It can be defined as how the node
Whenever nodes are in transmission range, it can exchange messages with each other. Each node
consists of connectivity information, the
a neighbor list. The degree of a node n is denoted as number of links (or nodes) which connected
to it and denoted as ND.
Where, α is the weighting factor (lies between 0 and 1) and is distributed between 0.6 an
since they yield better results in simulation.
Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
“Pop” host nests, a group of the population. (e.g., ∑
Evaluate the fitness of all nests ∑ )
Iterations.
Produce a cuckoo egg by applying a Lévy flight from a random nest
Compute the fitness of
Check for existence: choose again a random nest J
then
Remove a fraction of the worst nests at the rate of
Randomly, Building new nests at new locations using Levy flights replacements
The benefit of this heuristics is its simplicity. The single parameter of CS algorithm should be
considered enough when compared with PSO and Ant colony algorithms.
For efficient better packet delivery services in forwarding group, the mobile node is to be very
stable .The way of providing stability is that moving node around its current position. Node
stability metric have been used in previous work of authors is given in [28]. It is studied that
stable path nodes have been found from packets from the source to the multicast
and neighbor nodes stability are two metrics to represent node stability.
find stability of a node:
establishes self-stability, i.e., node movement is relative to its
MANET’s node gives the node stability factor from self-stability and neighbor stability.
Actually, stability is based on the distance between the movements of nodes positioning
within transmission range. Stable node is created when movement within transmission
TY
node is being connected to its neighbour to obtain
Whenever nodes are in transmission range, it can exchange messages with each other. Each node
consists of connectivity information, the signal stability of one-hop neighbors, and also maintains
a neighbor list. The degree of a node n is denoted as number of links (or nodes) which connected
………………… (5)
factor (lies between 0 and 1) and is distributed between 0.6 an
since they yield better results in simulation.
onal Journal (CSEIJ), Vol.7, No.1, February 2017
4
)
flights replacements
The benefit of this heuristics is its simplicity. The single parameter of CS algorithm should be
node is to be very
stable .The way of providing stability is that moving node around its current position. Node
evious work of authors is given in [28]. It is studied that
multicast group. Self-
, i.e., node movement is relative to its
and neighbor stability.
Actually, stability is based on the distance between the movements of nodes positioning
within transmission range. Stable node is created when movement within transmission
its neighbour to obtain self-stability.
Whenever nodes are in transmission range, it can exchange messages with each other. Each node
neighbors, and also maintains
a neighbor list. The degree of a node n is denoted as number of links (or nodes) which connected
factor (lies between 0 and 1) and is distributed between 0.6 and 0.7
5. Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
5
2.1.4 LINK STABILITY
Link stability between the nodes defines quality and existence of the connection. It is reckoned
based on two parameters:
Received Signal Strength and
A lifetime of the Link.
The algorithm represents a pseudocode for updating link stability status between the
nodes.
The different parameters used in the algorithm are as follows:
Lifetime – Duration of continuous connectivity between the nodes
Lifetime threshold – Indicates the maximum limit of link lifetime that decides
link stability
Link stability status – It is a Boolean variable that defines link stability between
the nodes.
Recent – Indicates most recent response received for a Hello packet from a
neighbor
P – Represents Total Number of Hello packets
Received signal strength – Represents the strength of the signal received from a
neighbor
Signal threshold – Is acceptable signal strength to be received from neighbors
2.1.5 ALGORITHM: LINK STABILITY STATUS BETWEEN THE NODES
Step 1: P = No of Hello Packets;
Step 2: Lifetime = 0;
Step 3: Link stability status = 0;
Step 4: Recent = 0;
Step 5: Lifetime threshold = P × Hello Packet Interval;
Step 6: While P > 0 do
Step 7: If received signal strength ≥ signal threshold then
Step 8: Lifetime = lifetime + 1;
Step 9: Recent = 1;
Step 10: P = P−1;
Step 11: else
Step 12: Recent = 0;
Step 13: P = P−1;
Step 14: end if
Step 15: end while
Step 16: lifetime sec = lifetime × Hello Packet Interval;
Step 17: if (lifetime sec > lifetime threshold) and (Recent)
Then
Step 18: link stability status = 1;
Step 19: else
Step 20: link stability status = 0;
Step 21: end if
6. Computer Science & Engineering: An Internati
2.1.6 DELAY ESTIMATION
For delay estimation, an arbitrary node that contributes to traffic forwarding using the M/M/1
queuing system is modeled. This queue represents a single queuing station with a single server
[29]. The authors assume that the contributing nodes are served by a single server with first come
first serve queuing policy. Packets arrive according to a Poisso
probability distribution of the service rate is exponential, denoted by µ. The maximum size of the
queue in every node is represented by K.
To satisfy delay requirements in multimedia
multicast receivers which satisfy the application delay constraints. When a packet is to be sent
either by a source node or forwarding group of nodes, it experiences three types of delays:
queuing, contention and transmission delay. The total
nodes is given by
………………………………(6)
The queuing delay denoted by
and the time it starts transmission. The packet waits and
are transmitted at this particular time. This is the amount of time a packet is spent in the
interfacing queue (T).
2.1.7 BANDWIDTH ESTIMATION
Bandwidth is one of the key principles for assessing Quality of service (QoS). The authors
considered their previous work presented in [30], to calculate the available bandwidth based on
their channel status of the radio link to calculate the idle and busy periods of the sha
media. Bandwidth is measured by the node activities and its surrounding neighbors using the
channel utility.
In IEEE 802.11 MANETs, once it is achieved to gain the channel access, a node can be able to
transmitting data packets. Hence, a node
idle and busy times in a predefined interval. This is expressed
…………………………………….(7)
2.1.8 ROUTE DISCOVERY PROCESS USING
Multicast stable QoS path creation involves two phases: a request and a reply phase. Request
phase invokes route discovery process to find routes having a
QoS intermediate nodes. It helps to reply phase for updating of RIC and also performs
confirmation process. It acts as intermediate nodes that help to create a
group of receivers.
RR packets are used in source node to find the route to its group of receivers. The sequences of
operations that occur are as follows:
Source node prepares
requirements.
Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
For delay estimation, an arbitrary node that contributes to traffic forwarding using the M/M/1
euing system is modeled. This queue represents a single queuing station with a single server
[29]. The authors assume that the contributing nodes are served by a single server with first come
first serve queuing policy. Packets arrive according to a Poisson distribution rate (λ), and the
probability distribution of the service rate is exponential, denoted by µ. The maximum size of the
queue in every node is represented by K.
To satisfy delay requirements in multimedia real-time applications, packets must be received by
multicast receivers which satisfy the application delay constraints. When a packet is to be sent
either by a source node or forwarding group of nodes, it experiences three types of delays:
queuing, contention and transmission delay. The total delay considered over a link between two
………………………………(6)
is the delay between the time the packet is assigned to a queue
and the time it starts transmission. The packet waits and gives other packets in transmission queue
this particular time. This is the amount of time a packet is spent in the
STIMATION
the key principles for assessing Quality of service (QoS). The authors
considered their previous work presented in [30], to calculate the available bandwidth based on
their channel status of the radio link to calculate the idle and busy periods of the sha
media. Bandwidth is measured by the node activities and its surrounding neighbors using the
In IEEE 802.11 MANETs, once it is achieved to gain the channel access, a node can be able to
transmitting data packets. Hence, a node senses the channel and estimates bandwidth by using the
idle and busy times in a predefined interval. This is expressed by the following equation.
…………………………………….(7)
ROCESS USING TUNED CUCKOO PROCESS
creation involves two phases: a request and a reply phase. Request
phase invokes route discovery process to find routes having a group of receivers using stable and
QoS intermediate nodes. It helps to reply phase for updating of RIC and also performs
as intermediate nodes that help to create a multicast
RR packets are used in source node to find the route to its group of receivers. The sequences of
operations that occur are as follows:
ode prepares an RR packet with an application of bandwidth and delay
onal Journal (CSEIJ), Vol.7, No.1, February 2017
6
For delay estimation, an arbitrary node that contributes to traffic forwarding using the M/M/1
euing system is modeled. This queue represents a single queuing station with a single server
[29]. The authors assume that the contributing nodes are served by a single server with first come
n distribution rate (λ), and the
probability distribution of the service rate is exponential, denoted by µ. The maximum size of the
e received by
multicast receivers which satisfy the application delay constraints. When a packet is to be sent
either by a source node or forwarding group of nodes, it experiences three types of delays:
delay considered over a link between two
is the delay between the time the packet is assigned to a queue
other packets in transmission queue
this particular time. This is the amount of time a packet is spent in the
the key principles for assessing Quality of service (QoS). The authors
considered their previous work presented in [30], to calculate the available bandwidth based on
their channel status of the radio link to calculate the idle and busy periods of the shared wireless
media. Bandwidth is measured by the node activities and its surrounding neighbors using the
In IEEE 802.11 MANETs, once it is achieved to gain the channel access, a node can be able to
senses the channel and estimates bandwidth by using the
equation.
creation involves two phases: a request and a reply phase. Request
of receivers using stable and
QoS intermediate nodes. It helps to reply phase for updating of RIC and also performs
multicast mesh to the
RR packets are used in source node to find the route to its group of receivers. The sequences of
packet with an application of bandwidth and delay
7. Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
7
Selective transmission of RR packet to neighbors once satisfies stability criteria, i.e.,
SFBN greater than SFTH, and bandwidth requirement, i.e., estimated bandwidth greater
than twice the application requirements.
Once received, node discards RR packet (both sequence number and source address).
If RR packet is not a duplicate, check if the availability of Routing Information Cache
(RIC); if available, RP packet create and start reply propagation to the source.
If RR packet is a duplicate, then discard it and stop transmission of RR packet.
If not duplicate and no route available in RIC, transmit the RR packet by updating its
fields (route record, Stability Factor Between Nodes (SFBN ) record, bandwidth record,
delay record, time to live, and nexthop address) to its neighbors as in step 2.
Perform steps 3 to 6 (Till destination reached).
If the receiver is not reached within certain hops, send RE packet to the source node.
Figure 1: Route request paths from S to R1 and R2
3. RESULTS AND DISCUSSION
3.1 SIMULATIONS AND PERFORMANCE EVALUATION
In this section, the performance of proposed protocol with DQSMRP and Fully Distributed
Multicast Routing Protocol (FDMRP) [31] is compared, through a considerable set of
simulations. These etiquettes have been taken for comparison because both are mesh based. These
protocols are collated in terms of packet delivery ratio, control overhead and average end-to-end
delay. Simulations considering the values of the production parameters are taken for several
iterations, and these are computing the mean. The values lying within 95% of the confidence
interval of the mean are used for computing the mean value, which is shown in the graphs in
result analysis section. The various network scenarios have been simulated. Simulation
environment consists of four models: Network, Channel, Mobility and Traffic. An ad hoc network
is created at an area of l × b square meters as network model; it is having N number of mobile
nodes spaced randomly. Limited bandwidths in coverage area around each node have shared to its
8. Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
8
neighbors. It is assumed that the operating range of transmitted power and communication range
are constant.
3.1.1 PERFORMANCE PARAMETERS
Following metrics have been used to scrutinize the performance:
Packet Delivery Ratio (PDR) : The ratio of a number of average data packets received at
the multicast receivers to the number of data packets sent by the source.
Packet Over Head : The ratio of control packets sent to the network to the total number
of average data packets delivered to the receivers.
Average End-to-End Delay: The average delay experienced by the successfully
delivered packets in reaching their receiver.
No. of Nodes 50,100,150 and 200.
Routing Protocol DQSMRP
Area Size 1000 X 1000
Mac 802.11
Radio Range 250m
Simulation Time 10 sec
Traffic Source CBR
Packet Size 512
Receiving Power 0.395
Sending power 0.660
Idle Power 0.035
Initial Energy 10.0 J
Node Speed 5,10,10 and,20 ms
No of destinations 2,4,6 and 8
Table 1: Simulation scenario
3.2 RESULT ANALYSIS
The simulation results of DQSMRP and FDMRP present the comparison results by varying
number of multiple destinations and node speed. According to the simulation results in Fig 2 to
Fig 7, the performance of TCSMRP is more reliable than FDMRP. The execution of DQSMRP
packet delivery ratio is gathered more than 14.2% compare to FDMRP. Moreover, the rendering
of DQSMRP starts to end delay is less than FDMRP. The performance rate is almost 18% less and
the delay ratio is varied with respective of node speed and number of destinations. According to
the overhead performance scenario, the overhead rate is 22% less than FDMRP.
9. Computer Science & Engineering: An Internati
Figure 2:
Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
Figure 2: PDR vs Number of Destinations
Figure 3: PDR vs Node Speed
onal Journal (CSEIJ), Vol.7, No.1, February 2017
9
10. Computer Science & Engineering: An Internati
Figure 5:
Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
Figure 4: Overhead vs Node Speed
Figure 5: Overhead vs Number of destinations
onal Journal (CSEIJ), Vol.7, No.1, February 2017
10
11. Computer Science & Engineering: An Internati
Figure 6:
Figure 7:
4. CONCLUSIONS
This paper clarifies about a hybrid
Search Algorithm (TCSA), that includes the dominant
techniques have been used to solve QoS multicast routing.
Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
Figure 6: End - End Delays vs Speed
Figure 7: End - End Delays vs Number of Destinations
hybrid computational intellectual algorithm i.e., Tuned Cuckoo
Search Algorithm (TCSA), that includes the dominant characteristic of two different heuristic
techniques have been used to solve QoS multicast routing. The QoS routing in a MANET is a
onal Journal (CSEIJ), Vol.7, No.1, February 2017
11
algorithm i.e., Tuned Cuckoo
of two different heuristic
in a MANET is a
12. Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
12
intricate to determine a prime routing. The general conclusion from presented simulation
experiments reveals that proposed routing protocol performs better than FDMRP in terms of
packet delivery ratio, packet overhead and average delay from start to end as a function of
varying number of receivers, sources and node speeds. In future works, the author’s aims to study
further by comparing our Tuned Cuckoo Search Multicast Routing Protocol with some more QoS
based routing protocols in MANETs. Numerical experiments have shown that the propounded
hybrid TCSA algorithm provides advanced search multicast trees, particularly in both swift
convergence and robustness, when compared to other algorithms. This proposed algorithm shall
be the escort for real-time networks with suitable sophistication based on when and where it
utilized.
REFERENCES
[1] R. A. Guérin and A. Orda, “QoS routing in networks with inaccurate information: theory and
algorithms,” IEEE/ACM Transactions on Networking, vol. 7, no. 3, pp. 350–364, 1999.
[2] D. H. Lorenz and A. Orda, “QoS routing in networks with uncertain parameters,” IEEE/ACM
Transactions on Networking, vol. 6, no. 6, pp. 768–778, 1998.
[3] L. Hanzo II and R. Tafazolli, “A survey of QoS routing solutions for mobile ad hoc networks” IEEE
Communications Surveys & Tutorials, vol. 9, no. 2, pp. 50–70, 2007.
[4] C. R. Lin and J.-S. Liu, “QoS routing in ad hoc wireless networks,” IEEE Journal on Selected Areas
in Communications, vol. 17, no. 8, pp. 1426–1438, 1999.
[5] L. Zhang, L. B. Cai, M. Li, and F. H. Wang, “A method for least-cost QoS multicast routing based on
genetic simulated annealing algorithm,” Computer Communications, vol. 32, no. 1, pp. 105–110,
2009.
[6] X. Yuan and X. Liu, “Heuristic algorithms for themulti-constrained quality of service routing,”
inProceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications
Societies (INFOCOM '01), vol. 2, pp. 844–853, IEEE, 2001.
[7] M. Abolhasan, T. Wysocki, and E. Dutkiewicz, “A review of routing protocols for mobile ad hoc
networks,” Ad Hoc Networks, vol. 2, no. 1, pp. 1–22, 2004.
[8] J. Xie, R. R. Talpade, A. Mcauley, and M. Liu, “AMRoute: ad hoc multicast routing protocol,” Mobile
Networks and Applications, vol. 7, no. 6, pp. 429–439, 2002.
[9] Y. S. Chen, Y. C. Tseng, J. P. Sheu, and P. H. Kuo, “An on-demand, link-state, multi-path QoS routing
in a wireless mobile ad-hoc network,” Computer Communications, vol. 27, no. 1, pp. 27–40, 2004.
[10] R. Vaishampayan and J. J. Garcia-Luna-Aceves, “Efficient and robust multicast routing in mobile ad
hoc networks” in Proceedings of the IEEE International Conference on “Mobile Ad-hoc and Sensor
Systems”, pp. 304–313, IEEE, October 2004.
[11] P. Khadivi, S. Samavi, and T. D. Todd, “Multi-constraint QoS routing using a new single mixed
metrics,”Journal of Network and Computer Applications, vol. 31, no. 4, pp. 656–676, 2008.
[12] S. S. Manvi and M. S. Kakkasageri, “Multicast routing in mobile ad hoc networks by using a multi-
agent system” Information Sciences, vol. 178, no. 6, pp. 1611–1628, 2008.
[13] F. Kuipers, P. Van Mieghem, T. Korkmaz, and M. Krunz, “An overview of constraint-based path
selection algorithms for QoS routing,” IEEE Communications Magazine, vol. 40, no. 12, 2002.
[14] K. Kunavut and T. Sanguankotchakorn, “Multi-Constrained Path (MCP) QoS routing in OLSR based
on multiple additive QoS metrics,” in Proceedings of the International Symposium on
Communications and Information Technologies (ISCIT '10), pp. 226–231, IEEE, Tokyo, Japan,
October 2010.
13. Computer Science & Engineering: An International Journal (CSEIJ), Vol.7, No.1, February 2017
13
[15] L. Liu and G. Feng, “Simulated annealing based multi-constrained QoS routing in mobile ad hoc
networks,” Wireless Personal Communications, vol. 41, no. 3, pp. 393–405, 2007.
[16] S. Bitam and A. Mellouk, “Bee life-based multi-constraints multicast routing optimization for
vehicular ad hoc networks,” Journal of Network and Computer Applications, vol. 36, no. 3, pp. 981–
991, 2013.
[17] N. Ghaboosi and A. T. Haghighat, “Tabu search based algorithms for bandwidth-delay-constrained
least-cost multicast routing,” Telecommunication Systems, vol. 34, no. 3-4, pp. 147–166, 2007.
[18] Z. Subing and L. Zemin, “A QoS routing algorithm based on ant algorithm,” in Proceedings of the
IEEE International Conference on Communications (ICC '01), vol. 5, pp. 1581–1585, IEEE, 2001.
[19] C.-H. Chu, J. Gu, X. D. Hou, and Q. Gu, “A heuristic ant algorithm for solving QoS multicast routing
problem,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '02), vol. 2, pp.
1630–1635, IEEE, Honolulu, Hawaii, USA, May 2002.
[20] R. Forsati, A. T. Haghighat, and M. Mahdavi, “Harmony search based algorithms for bandwidth-
delay-constrained least-cost multicast routing” Computer Communications, vol. 31, no. 10, pp. 2505–
2519, 2008.
[21] R. F. Abdel-Kader, “Hybrid discrete PSO with GA operators for efficient QoS-multicast routing,” Ain
Shams Engineering Journal, vol. 2, no. 1, pp. 21–31, 2011.
[22] P. Chen and T. L. Dong “A fuzzy genetic algorithm for QoS multicast routing” Computer
Communications, vol. 26, no. 6, pp. 506–512, 2003.
[23] X. S. Yang and S. Deb, “Engineering optimization by cuckoo search,” International Journal of
Mathematical Modelling and Numerical Optimisation, vol. 1, no. 4, pp. 330–343, 2010.
[24] S. Walton, O. Hassan, K. Morgan, and M. R. Brown, “Modified cuckoo search: a new gradient-
freeoptimization algorithm,” Chaos, Solitons & Fractals, vol. 44, no. 9, pp. 710–718, 2011.
[25] X. S. Yang and S. Deb, “Cuckoo search: recent advances and applications,” Neural Computing and
Applications, vol. 24, no. 1, pp. 169–174, 2014.
[26] O. Baskan, “Determining optimal link capacity expansions in road networks using cuckoo search
algorithm with levy flights,” Journal of Applied Mathematics, vol. 2013, Article ID 718015, 11 pages,
2013.
[27] P. Civicioglu and E. Besdok, “A conceptual comparison of the Cuckoo-search, particle swarm
optimization, differential evolution and artificial bee colony algorithms” Artificial Intelligence
Review, vol. 39, no. 4, pp. 315–346, 2013.
[28] P. I. Basarkod, S. S. Manvi, and D. S. Albur, “Mobility-based estimation of node stability in
MANETs”, in Proc. Int. Conf. Emerg. Trends in Comput., Commun. and Nanotechnol. ICE-CCN
2013, Tuticorin, India, 2013, pp. 126–130.
[29] K. S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science
Applications, 2 ed. Wiley Interscience, 2005
[30] P. I. Basarkod and S. S. Manvi, “Multiple parameters based approach to estimate bandwidth in mobile
ad hoc networks”, Int. J. Comp. Sci. Issues, Special Issue (IJCSI), vol. 1, no. 1, pp. 37–43, 2011.
[31] Woongsoo Na, Yunseong Lee, Jongha Yoon, Junho Park, and Sungrae Cho, “Fully Distributed
Multicast Routing Protocol for IEEE 802.15.8 Peer-Aware Communication”, International Journal of
Distributed Sensor Networks Volume 2015.