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
QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETScseij
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.
Improving QoS in VANET Using Dynamic Clustering TechniqueKaushik Padmanabhan
The document presents a new dynamic multi-clustering technique to improve quality of service (QoS) in vehicular ad hoc networks (VANETs) used for vehicle platooning. It begins by discussing limitations of existing single clustering approaches. It then proposes a hierarchical clustering approach that forms multiple clusters within each platoon dynamically based on traffic conditions. A new Relative Multi-Head Disturbance Adaptation (RMDA) algorithm is introduced to select cluster heads. This algorithm considers both relative distance and mobility between nodes to select stable cluster heads. Simulation results show the approach improves QoS metrics like packet delay, throughput and packet loss ratio over existing single clustering techniques.
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.
Link Stability Based On Qos Aware On - Demand Routing In Mobile Ad Hoc NetworksIOSR Journals
This document summarizes a research paper that proposes a new routing protocol for mobile ad hoc networks (MANETs) that considers link stability and quality of service (QoS) metrics. The protocol estimates link quality based on node mobility prediction using GPS data. It calculates a "cost" metric factoring in link stability and power consumption to select paths with more stable, lower-cost links. Simulation results show the proposed protocol achieves higher throughput and packet delivery ratio compared to existing protocols, with lower control overhead. Future work could incorporate additional link quality metrics and statistical classifiers to further optimize path selection in MANETs.
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.
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.
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
A cross layer delay-aware multipath routing algorithm for mobile adhoc networkscsandit
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS)
mechanism to support diverse applications with varying and stringent requirements. Routing
protocols such as AODV, AOMDV, DSR and OLSR use minimum hop count as the metric for
path selection, hence are not suitable for delay sensitive real time applications. To support such
applications delay constrained routing protocols are employed. These Protocols makes path
selection based on the delay over the discovered links during routing discovery and routing
table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol
called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDM-AODV) based on
delay constraint. It employs cross-layer communications between MAC and routing layers to
achieve link and channel-awareness. It regularly updates the path status in terms of lowest
delay incurred at each intermediate node. Performance of the proposed protocol is compared
with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of
better packet delivery and reduced overhead between intermediate nodes.
QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETScseij
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.
Improving QoS in VANET Using Dynamic Clustering TechniqueKaushik Padmanabhan
The document presents a new dynamic multi-clustering technique to improve quality of service (QoS) in vehicular ad hoc networks (VANETs) used for vehicle platooning. It begins by discussing limitations of existing single clustering approaches. It then proposes a hierarchical clustering approach that forms multiple clusters within each platoon dynamically based on traffic conditions. A new Relative Multi-Head Disturbance Adaptation (RMDA) algorithm is introduced to select cluster heads. This algorithm considers both relative distance and mobility between nodes to select stable cluster heads. Simulation results show the approach improves QoS metrics like packet delay, throughput and packet loss ratio over existing single clustering techniques.
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.
Link Stability Based On Qos Aware On - Demand Routing In Mobile Ad Hoc NetworksIOSR Journals
This document summarizes a research paper that proposes a new routing protocol for mobile ad hoc networks (MANETs) that considers link stability and quality of service (QoS) metrics. The protocol estimates link quality based on node mobility prediction using GPS data. It calculates a "cost" metric factoring in link stability and power consumption to select paths with more stable, lower-cost links. Simulation results show the proposed protocol achieves higher throughput and packet delivery ratio compared to existing protocols, with lower control overhead. Future work could incorporate additional link quality metrics and statistical classifiers to further optimize path selection in MANETs.
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.
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.
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
A cross layer delay-aware multipath routing algorithm for mobile adhoc networkscsandit
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS)
mechanism to support diverse applications with varying and stringent requirements. Routing
protocols such as AODV, AOMDV, DSR and OLSR use minimum hop count as the metric for
path selection, hence are not suitable for delay sensitive real time applications. To support such
applications delay constrained routing protocols are employed. These Protocols makes path
selection based on the delay over the discovered links during routing discovery and routing
table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol
called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDM-AODV) based on
delay constraint. It employs cross-layer communications between MAC and routing layers to
achieve link and channel-awareness. It regularly updates the path status in terms of lowest
delay incurred at each intermediate node. Performance of the proposed protocol is compared
with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of
better packet delivery and reduced overhead between intermediate nodes.
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).
AAA (Allocation, Admission and Assignment Control) for Network managementcontactmvrk
The document proposes a joint Allocation, Assignment, and Admission Control (AAA) framework for next generation cellular networks. It introduces a novel semi-distributed resource allocation method using both central and local allocation. It also presents a Markov-based assignment approach that calculates packet dropping probabilities considering queuing and adaptive modulation/coding. The admission control is based on calculating mean resource usage of existing users and buffer conditions. The AAA framework aims to improve overall network throughput, cell-edge throughput, and number of admitted users while guaranteeing quality of service.
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.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
Improvement of QoS Contained by AODV Routing Protocol On the Basis of Varying...IOSR Journals
The document proposes improvements to the AODV routing protocol in mobile ad hoc networks to enhance quality of service. It introduces two techniques: 1) Using a dynamic time-to-live value rather than a fixed value to establish connections over longer routes. 2) Implementing a varying queue length technique where the queue size increases instead of dropping packets if the node buffer is full, to minimize packet loss. The performance of the improved AODV protocol is evaluated based on metrics like packet delivery ratio, routing overhead, and throughput, and shows better results compared to the normal AODV protocol.
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.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
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.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
Multicast Routing Protocol with Group-Level Congestion Prediction and Perman...IOSR Journals
This document proposes a cross-layered model for congestion prediction and management in mobile ad hoc networks that aims to efficiently distribute network resources. The model incorporates two algorithms: Group-level Congestion Prediction (GCP) that predicts congestion levels at relay nodes with high accuracy, and Group-level Egress Permanence (GEP) that works sequentially with GCP for congestion detection and management. The document discusses related work on multicast routing protocols and energy-efficient multicasting. It then describes the proposed congestion control mechanism under constrained energy utilization and outlines the proposed model with relevant notations before focusing on the GCP and GEP algorithms.
Fuzzy Based Node Disjoint QoS Routing in MANETs by Using Agentsidescitation
Support for real time multimedia applications such
as, video telephony, financial stock quote services, and
multiplayer interactive games etc., is very essential in Mobile
Ad hoc Networks (MANETs). Such applications require
multiple Quality of Service (QoS) parameters to be satisfied,
like bandwidth, end-to- end delay, packet loss rate, jitter, etc.
This paper considers the problem of finding node disjoint and
multi-constrained QoS multipaths from source to destination
by using agent based fuzzy inference system. The proposed
scheme, Fuzzy based Node Disjoint Multipath QoS Routing
(FNDMQR) operates in the following steps by integrating
static and mobile agents. (1) Determination of multiple paths
and picking up of resource information (available bandwidth,
link delay, and packet loss rate) of the intermediate nodes
from source to destination. (2) Recognition of node disjoint,
and multi-constrained QoS fit paths by using Takagi-Sugeno
Fuzzy Inference System (TSFIS). TSFIS extracts a fuzzy QoS
weight from available resource information of the
intermediate nodes. (3) Selection of the best path depending
on the fuzzy QoS weight. (4) Maintenance of QoS path when
path breaks due to mobility of node or link failure. To test the
performance effectiveness of the approach, we have analyzed
the performance parameters like packet delivery ratio, average
end-to-end delay and overall control overhead. The scheme
performs better as compared to a node-disjoint multipath
routing in MANETs.
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.
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.
This document summarizes a research paper that proposes a new routing protocol called Dynamically Adaptable Improved OLSR (DA-IOLSR) for mobile ad hoc networks. DA-IOLSR uses a connected dominating set (CDS) as its virtual backbone structure and dynamically adapts the backbone in response to network topology changes from node mobility. The paper describes related work on improving the OLSR protocol's multipoint relay selection and on CDS approaches that are adaptable to topology changes. It then presents the DA-IOLSR protocol and evaluates its performance against the standard OLSR protocol through simulations of varying node mobility conditions.
An Adaptive Cluster Head Election Algorithm for Heterogeneous Mobile Ad-hoc N...IJLT EMAS
This document proposes an adaptive cluster head election algorithm for heterogeneous mobile ad-hoc networks. It begins by discussing how mobile ad-hoc networks can be homogeneous or heterogeneous based on node capabilities. The effects of heterogeneity, including issues with coverage area, link stability and lifetime, are analyzed. An algorithm is then suggested that considers node mobility, power and transmission range to adaptively elect cluster heads in heterogeneous networks. The proposed algorithm is simulated and evaluated based on parameters like cluster formation overhead and cluster lifetime under different transmission ranges. The results show the algorithm can help ensure stable cluster formations and address issues caused by node heterogeneity in mobile ad-hoc networks.
This document summarizes a research paper that proposes an energy and bandwidth constrained routing technique for mobile ad hoc networks (MANETs). It presents an available bandwidth measurement algorithm that estimates available bandwidth more accurately by considering node capacity, link utilization, idle time synchronization, collision probability, and overhead from backoff mechanisms. It also proposes a probability-based overhearing method to reduce energy consumption from overhearing without affecting route quality. The techniques are evaluated using NS2 simulations to analyze network performance in terms of quality of service parameters.
Ad hoc networks are mobile wireless networks where each node is acting as a router. The existing routing protocols such as Destination sequences distance vector (DSDV), Optimized list state routing protocols (OLSR), Ad hoc on demand routing protocol (AODV), dynamic source routing (DSR) are optimized versions of distance vector or link state routing protocols. Reinforcement Learning is new method evolved recently which is learning from interaction with an environment. Q Learning which is based on reinforcement learning that learns from the delayed reinforcements and becomes more popular in areas of networking. Q Learning is applied to the routing algorithms where the routing tables in the distance vector algorithms are replaced by the estimation tables called as Q values. These Q values are based on the link delay. In this paper, various optimization techniques over Q routing are described in detail with their algorithms.
This document discusses different encoding mechanisms that can be used to perform secure communication in sensor networks in an energy-efficient manner. It first discusses routing approaches in sensor networks such as unicast routing, multicast routing, global routing and maze routing. It then examines various error detection techniques like repetition schemes, parity schemes and error-correcting codes. The document goes on to explain different encoding techniques - convolution codes, Hamming codes, Reed Solomon encoding. Convolution codes use shift registers and modulo-2 addition to encode input bits into output bits. Hamming codes are block codes that use a generator matrix to encode data bits into codewords. Reed Solomon encoding is a block encoding scheme that forms codewords by adding parity bits to the data using
Quality of Service Stability Based Multicast Routing Protocol for MANETsCSEIJJournal
This document proposes a Dynamic Quality of Service Stability based multicast routing protocol (DQSMRP) for mobile ad hoc networks (MANETs). It aims to improve routing stability and quality of service in MANETs. The protocol modifies the Cuckoo Search algorithm using a technique called Tuned CSA, which combines CSA with differential evolution algorithms. Each node periodically calculates parameters like node stability, link stability, bandwidth availability, and delays to create a neighbor stability and QoS database. The DQSMRP then uses this information to construct route request and reply packets and perform route maintenance for multicasting.
QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETScseij
This document proposes a Dynamic Quality of Service Stability based multicast routing protocol (DQSMRP) for mobile ad hoc networks (MANETs). It aims to improve routing stability and quality of service in MANETs. The protocol modifies the Cuckoo Search algorithm using a technique called Tuned CSA, which combines CSA with differential evolution algorithms. Each node periodically calculates parameters like node stability, link stability, bandwidth availability, and delays to create a neighbor stability and QoS database. The DQSMRP then uses this information to construct route request and reply packets and perform route maintenance for multicasting while aiming to meet constraints like bandwidth, delay, jitter and packet loss.
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.
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 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).
AAA (Allocation, Admission and Assignment Control) for Network managementcontactmvrk
The document proposes a joint Allocation, Assignment, and Admission Control (AAA) framework for next generation cellular networks. It introduces a novel semi-distributed resource allocation method using both central and local allocation. It also presents a Markov-based assignment approach that calculates packet dropping probabilities considering queuing and adaptive modulation/coding. The admission control is based on calculating mean resource usage of existing users and buffer conditions. The AAA framework aims to improve overall network throughput, cell-edge throughput, and number of admitted users while guaranteeing quality of service.
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.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
Improvement of QoS Contained by AODV Routing Protocol On the Basis of Varying...IOSR Journals
The document proposes improvements to the AODV routing protocol in mobile ad hoc networks to enhance quality of service. It introduces two techniques: 1) Using a dynamic time-to-live value rather than a fixed value to establish connections over longer routes. 2) Implementing a varying queue length technique where the queue size increases instead of dropping packets if the node buffer is full, to minimize packet loss. The performance of the improved AODV protocol is evaluated based on metrics like packet delivery ratio, routing overhead, and throughput, and shows better results compared to the normal AODV protocol.
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.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
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.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
Multicast Routing Protocol with Group-Level Congestion Prediction and Perman...IOSR Journals
This document proposes a cross-layered model for congestion prediction and management in mobile ad hoc networks that aims to efficiently distribute network resources. The model incorporates two algorithms: Group-level Congestion Prediction (GCP) that predicts congestion levels at relay nodes with high accuracy, and Group-level Egress Permanence (GEP) that works sequentially with GCP for congestion detection and management. The document discusses related work on multicast routing protocols and energy-efficient multicasting. It then describes the proposed congestion control mechanism under constrained energy utilization and outlines the proposed model with relevant notations before focusing on the GCP and GEP algorithms.
Fuzzy Based Node Disjoint QoS Routing in MANETs by Using Agentsidescitation
Support for real time multimedia applications such
as, video telephony, financial stock quote services, and
multiplayer interactive games etc., is very essential in Mobile
Ad hoc Networks (MANETs). Such applications require
multiple Quality of Service (QoS) parameters to be satisfied,
like bandwidth, end-to- end delay, packet loss rate, jitter, etc.
This paper considers the problem of finding node disjoint and
multi-constrained QoS multipaths from source to destination
by using agent based fuzzy inference system. The proposed
scheme, Fuzzy based Node Disjoint Multipath QoS Routing
(FNDMQR) operates in the following steps by integrating
static and mobile agents. (1) Determination of multiple paths
and picking up of resource information (available bandwidth,
link delay, and packet loss rate) of the intermediate nodes
from source to destination. (2) Recognition of node disjoint,
and multi-constrained QoS fit paths by using Takagi-Sugeno
Fuzzy Inference System (TSFIS). TSFIS extracts a fuzzy QoS
weight from available resource information of the
intermediate nodes. (3) Selection of the best path depending
on the fuzzy QoS weight. (4) Maintenance of QoS path when
path breaks due to mobility of node or link failure. To test the
performance effectiveness of the approach, we have analyzed
the performance parameters like packet delivery ratio, average
end-to-end delay and overall control overhead. The scheme
performs better as compared to a node-disjoint multipath
routing in MANETs.
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.
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.
This document summarizes a research paper that proposes a new routing protocol called Dynamically Adaptable Improved OLSR (DA-IOLSR) for mobile ad hoc networks. DA-IOLSR uses a connected dominating set (CDS) as its virtual backbone structure and dynamically adapts the backbone in response to network topology changes from node mobility. The paper describes related work on improving the OLSR protocol's multipoint relay selection and on CDS approaches that are adaptable to topology changes. It then presents the DA-IOLSR protocol and evaluates its performance against the standard OLSR protocol through simulations of varying node mobility conditions.
An Adaptive Cluster Head Election Algorithm for Heterogeneous Mobile Ad-hoc N...IJLT EMAS
This document proposes an adaptive cluster head election algorithm for heterogeneous mobile ad-hoc networks. It begins by discussing how mobile ad-hoc networks can be homogeneous or heterogeneous based on node capabilities. The effects of heterogeneity, including issues with coverage area, link stability and lifetime, are analyzed. An algorithm is then suggested that considers node mobility, power and transmission range to adaptively elect cluster heads in heterogeneous networks. The proposed algorithm is simulated and evaluated based on parameters like cluster formation overhead and cluster lifetime under different transmission ranges. The results show the algorithm can help ensure stable cluster formations and address issues caused by node heterogeneity in mobile ad-hoc networks.
This document summarizes a research paper that proposes an energy and bandwidth constrained routing technique for mobile ad hoc networks (MANETs). It presents an available bandwidth measurement algorithm that estimates available bandwidth more accurately by considering node capacity, link utilization, idle time synchronization, collision probability, and overhead from backoff mechanisms. It also proposes a probability-based overhearing method to reduce energy consumption from overhearing without affecting route quality. The techniques are evaluated using NS2 simulations to analyze network performance in terms of quality of service parameters.
Ad hoc networks are mobile wireless networks where each node is acting as a router. The existing routing protocols such as Destination sequences distance vector (DSDV), Optimized list state routing protocols (OLSR), Ad hoc on demand routing protocol (AODV), dynamic source routing (DSR) are optimized versions of distance vector or link state routing protocols. Reinforcement Learning is new method evolved recently which is learning from interaction with an environment. Q Learning which is based on reinforcement learning that learns from the delayed reinforcements and becomes more popular in areas of networking. Q Learning is applied to the routing algorithms where the routing tables in the distance vector algorithms are replaced by the estimation tables called as Q values. These Q values are based on the link delay. In this paper, various optimization techniques over Q routing are described in detail with their algorithms.
This document discusses different encoding mechanisms that can be used to perform secure communication in sensor networks in an energy-efficient manner. It first discusses routing approaches in sensor networks such as unicast routing, multicast routing, global routing and maze routing. It then examines various error detection techniques like repetition schemes, parity schemes and error-correcting codes. The document goes on to explain different encoding techniques - convolution codes, Hamming codes, Reed Solomon encoding. Convolution codes use shift registers and modulo-2 addition to encode input bits into output bits. Hamming codes are block codes that use a generator matrix to encode data bits into codewords. Reed Solomon encoding is a block encoding scheme that forms codewords by adding parity bits to the data using
Quality of Service Stability Based Multicast Routing Protocol for MANETsCSEIJJournal
This document proposes a Dynamic Quality of Service Stability based multicast routing protocol (DQSMRP) for mobile ad hoc networks (MANETs). It aims to improve routing stability and quality of service in MANETs. The protocol modifies the Cuckoo Search algorithm using a technique called Tuned CSA, which combines CSA with differential evolution algorithms. Each node periodically calculates parameters like node stability, link stability, bandwidth availability, and delays to create a neighbor stability and QoS database. The DQSMRP then uses this information to construct route request and reply packets and perform route maintenance for multicasting.
QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETScseij
This document proposes a Dynamic Quality of Service Stability based multicast routing protocol (DQSMRP) for mobile ad hoc networks (MANETs). It aims to improve routing stability and quality of service in MANETs. The protocol modifies the Cuckoo Search algorithm using a technique called Tuned CSA, which combines CSA with differential evolution algorithms. Each node periodically calculates parameters like node stability, link stability, bandwidth availability, and delays to create a neighbor stability and QoS database. The DQSMRP then uses this information to construct route request and reply packets and perform route maintenance for multicasting while aiming to meet constraints like bandwidth, delay, jitter and packet loss.
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.
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
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.
Solving QoS multicast routing problem using ACO algorithmAbdullaziz Tagawy
The document discusses using an ant colony optimization (ACO) algorithm to solve the quality of service (QoS) constrained multicast routing problem. The ACO algorithm is inspired by how real ants find the shortest path to food sources. In the algorithm, artificial ants probabilistically construct multicast trees and update pheromone values on the paths/edges to gradually converge on high quality solutions. The document provides details of the ACO algorithm and gives an example of applying it to find the shortest path between a source and destination node to demonstrate how it works.
This document proposes an Enhanced and Integrated Ant Colony-Artificial Bee Colony (EIAC-ABCMR) approach for multicast routing in Vehicular Ad Hoc Networks (VANETs) that satisfies quality of service (QoS) constraints. EIAC-ABCMR determines an optimal multicast tree using a metaheuristic algorithm that integrates ant colony optimization and artificial bee colony algorithms. This prevents stagnation and delayed convergence issues. The algorithm formulates the multicast routing problem as a multi-objective function minimizing delay, cost, jitter while maximizing bandwidth. Simulation results show EIAC-ABCMR outperforms other multicast routing techniques in reducing multicast groups
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.
The document describes a proposed multi-hop clustering (MHC) approach for vehicular ad-hoc networks (VANETs). The MHC approach selects cluster heads based on the node's speed being closest to the average speed and having a high network life. It calculates distrust values to isolate malicious nodes and determines a QoS value considering bandwidth, number of neighbors, distance and velocity ratios. The approach aims to improve stability, reliability and security compared to previous work. It was simulated in NS2 and showed better results than existing techniques for parameters like overhead, throughput, delay, loss and delivery ratio. The key contribution is adding calculations for percentage of stability and path length.
The document presents the QoS-Oriented Distributed (QOD) routing protocol for hybrid wireless networks. QOD incorporates five algorithms: 1) a QoS-guaranteed neighbour selection algorithm, 2) a distributed packet scheduling algorithm, 3) a mobility-based segment resizing algorithm, 4) a soft-deadline based forwarding scheduling algorithm, and 5) a data redundancy elimination based transmission algorithm. The goal of QOD is to enhance QoS support in hybrid networks by leveraging both infrastructure networks and mobile ad hoc networks to meet stringent end-to-end QoS requirements. The document outlines the key components and objectives of the QOD protocol.
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.
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.
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.
A Systematic Review on Routing Protocols for VANETsIRJET Journal
This document provides a systematic review and comparative analysis of 10 routing protocols for vehicular ad hoc networks (VANETs). It summarizes the key methods, benefits, and conclusions of each protocol. The protocols use various techniques like clustering, machine learning, Q-learning, firefly algorithm, and particle swarm optimization to address the challenges of frequent topology changes in VANETs. Simulation results show the protocols improve metrics like packet delivery ratio, end-to-end delay, and network throughput compared to other existing protocols. In conclusion, an efficient routing protocol is needed to meet the unique requirements of VANETs and achieve good performance.
QoS Realization for Routing Protocol on VANETs using Combinatorial OptimizationsUday Mane
This document summarizes a research paper that aims to improve quality of service (QoS) for routing protocols in vehicular ad hoc networks (VANETs) using combinatorial optimization techniques. The paper applies Ant Colony Optimization (ACO), a metaheuristic algorithm, to optimize the Ad hoc On-demand Distance Vector (AODV) routing protocol. Network simulations are conducted in NS2 to evaluate QoS metrics like end-to-end delay for multimedia traffic under different node densities. The results show that applying ACO to AODV reduces end-to-end delay significantly compared to the existing AODV protocol. Delays are further reduced at higher node densities, demonstrating that ACO helps find shorter paths
This document proposes a hybrid optimization algorithm using ant colony optimization and particle swarm optimization to solve the multiobjective multicast routing problem in wireless sensor networks. The goal is to optimize two objectives simultaneously - end-to-end delay and total transmitted power. ACO and PSO are combined to find Pareto-optimal solutions efficiently. Simulation results show the algorithm can find near-optimal solutions for minimizing delay and power consumption when routing data from a source to multiple destinations in wireless sensor networks.
Wireless Sensor Network Using Six Sigma Multi Hop RoutingIOSR Journals
Abstract: The most significant problem in the design of wireless sensor networks is to coordinate the sensors with dynamism into a wireless communication network and route sensed data to the base station. The energy efficiency is the most important key point of the network routing designing. This paper presents the efficient multi hop routing algorithm to extend the lifetime of sensor networks and focuses by employing six sigma principles to obtain the Quality of Service. To attain QoS support, we have to find either a route to assure the application requirements or offering network response to the application when the requirements cannot be met. Keywords: Wireless Sensor Networks, Multi hop routing, six sigma, QoS
Similar to Dynamic Quality of Service Stability Based Multicast Routing Protocol for MANETs (DQSMRP) (20)
ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR cscpconf
The progressive development of Synthetic Aperture Radar (SAR) systems diversify the exploitation of the generated images by these systems in different applications of geoscience. Detection and monitoring surface deformations, procreated by various phenomena had benefited from this evolution and had been realized by interferometry (InSAR) and differential interferometry (DInSAR) techniques. Nevertheless, spatial and temporal decorrelations of the interferometric couples used, limit strongly the precision of analysis results by these techniques. In this context, we propose, in this work, a methodological approach of surface deformation detection and analysis by differential interferograms to show the limits of this technique according to noise quality and level. The detectability model is generated from the deformation signatures, by simulating a linear fault merged to the images couples of ERS1 / ERS2 sensors acquired in a region of the Algerian south.
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATIONcscpconf
A novel based a trajectory-guided, concatenating approach for synthesizing high-quality image real sample renders video is proposed . The lips reading automated is seeking for modeled the closest real image sample sequence preserve in the library under the data video to the HMM predicted trajectory. The object trajectory is modeled obtained by projecting the face patterns into an KDA feature space is estimated. The approach for speaker's face identification by using synthesise the identity surface of a subject face from a small sample of patterns which sparsely each the view sphere. An KDA algorithm use to the Lip-reading image is discrimination, after that work consisted of in the low dimensional for the fundamental lip features vector is reduced by using the 2D-DCT.The mouth of the set area dimensionality is ordered by a normally reduction base on the PCA to obtain the Eigen lips approach, their proposed approach by[33]. The subjective performance results of the cost function under the automatic lips reading modeled , which wasn’t illustrate the superior performance of the
method.
MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...cscpconf
Universities offer software engineering capstone course to simulate a real world-working environment in which students can work in a team for a fixed period to deliver a quality product. The objective of the paper is to report on our experience in moving from Waterfall process to Agile process in conducting the software engineering capstone project. We present the capstone course designs for both Waterfall driven and Agile driven methodologies that highlight the structure, deliverables and assessment plans.To evaluate the improvement, we conducted a survey for two different sections taught by two different instructors to evaluate students’ experience in moving from traditional Waterfall model to Agile like process. Twentyeight students filled the survey. The survey consisted of eight multiple-choice questions and an open-ended question to collect feedback from students. The survey results show that students were able to attain hands one experience, which simulate a real world-working environment. The results also show that the Agile approach helped students to have overall better design and avoid mistakes they have made in the initial design completed in of the first phase of the capstone project. In addition, they were able to decide on their team capabilities, training needs and thus learn the required technologies earlier which is reflected on the final product quality
PROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIEScscpconf
This document discusses using social media technologies to promote student engagement in a software project management course. It describes the course and objectives of enhancing communication. It discusses using Facebook for 4 years, then switching to WhatsApp based on student feedback, and finally introducing Slack to enable personalized team communication. Surveys found students engaged and satisfied with all three tools, though less familiar with Slack. The conclusion is that social media promotes engagement but familiarity with the tool also impacts satisfaction.
A SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGICcscpconf
In real world computing environment with using a computer to answer questions has been a human dream since the beginning of the digital era, Question-answering systems are referred to as intelligent systems, that can be used to provide responses for the questions being asked by the user based on certain facts or rules stored in the knowledge base it can generate answers of questions asked in natural , and the first main idea of fuzzy logic was to working on the problem of computer understanding of natural language, so this survey paper provides an overview on what Question-Answering is and its system architecture and the possible relationship and
different with fuzzy logic, as well as the previous related research with respect to approaches that were followed. At the end, the survey provides an analytical discussion of the proposed QA models, along or combined with fuzzy logic and their main contributions and limitations.
DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS cscpconf
Human beings generate different speech waveforms while speaking the same word at different times. Also, different human beings have different accents and generate significantly varying speech waveforms for the same word. There is a need to measure the distances between various words which facilitate preparation of pronunciation dictionaries. A new algorithm called Dynamic Phone Warping (DPW) is presented in this paper. It uses dynamic programming technique for global alignment and shortest distance measurements. The DPW algorithm can be used to enhance the pronunciation dictionaries of the well-known languages like English or to build pronunciation dictionaries to the less known sparse languages. The precision measurement experiments show 88.9% accuracy.
INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS cscpconf
In education, the use of electronic (E) examination systems is not a novel idea, as Eexamination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments.
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTICcscpconf
African Buffalo Optimization (ABO) is one of the most recent swarms intelligence based metaheuristics. ABO algorithm is inspired by the buffalo’s behavior and lifestyle. Unfortunately, the standard ABO algorithm is proposed only for continuous optimization problems. In this paper, the authors propose two discrete binary ABO algorithms to deal with binary optimization problems. In the first version (called SBABO) they use the sigmoid function and probability model to generate binary solutions. In the second version (called LBABO) they use some logical operator to operate the binary solutions. Computational results on two knapsack problems (KP and MKP) instances show the effectiveness of the proposed algorithm and their ability to achieve good and promising solutions.
DETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAINcscpconf
In recent years, many malware writers have relied on Dynamic Domain Name Services (DDNS) to maintain their Command and Control (C&C) network infrastructure to ensure a persistence presence on a compromised host. Amongst the various DDNS techniques, Domain Generation Algorithm (DGA) is often perceived as the most difficult to detect using traditional methods. This paper presents an approach for detecting DGA using frequency analysis of the character distribution and the weighted scores of the domain names. The approach’s feasibility is demonstrated using a range of legitimate domains and a number of malicious algorithmicallygenerated domain names. Findings from this study show that domain names made up of English characters “a-z” achieving a weighted score of < 45 are often associated with DGA. When a weighted score of < 45 is applied to the Alexa one million list of domain names, only 15% of the domain names were treated as non-human generated.
GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...cscpconf
The document proposes a blockchain-based digital currency and streaming platform called GoMAA to address issues of piracy in the online music streaming industry. Key points:
- GoMAA would use a digital token on the iMediaStreams blockchain to enable secure dissemination and tracking of streamed content. Content owners could control access and track consumption of released content.
- Original media files would be converted to a Secure Portable Streaming (SPS) format, embedding watermarks and smart contract data to indicate ownership and enable validation on the blockchain.
- A browser plugin would provide wallets for fans to collect GoMAA tokens as rewards for consuming content, incentivizing participation and addressing royalty discrepancies by recording
IMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEMcscpconf
This document discusses the importance of verb suffix mapping in discourse translation from English to Telugu. It explains that after anaphora resolution, the verbs must be changed to agree with the gender, number, and person features of the subject or anaphoric pronoun. Verbs in Telugu inflect based on these features, while verbs in English only inflect based on number and person. Several examples are provided that demonstrate how the Telugu verb changes based on whether the subject or pronoun is masculine, feminine, neuter, singular or plural. Proper verb suffix mapping is essential for generating natural and coherent translations while preserving the context and meaning of the original discourse.
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...cscpconf
In this paper, based on the definition of conformable fractional derivative, the functional
variable method (FVM) is proposed to seek the exact traveling wave solutions of two higherdimensional
space-time fractional KdV-type equations in mathematical physics, namely the
(3+1)-dimensional space–time fractional Zakharov-Kuznetsov (ZK) equation and the (2+1)-
dimensional space–time fractional Generalized Zakharov-Kuznetsov-Benjamin-Bona-Mahony
(GZK-BBM) equation. Some new solutions are procured and depicted. These solutions, which
contain kink-shaped, singular kink, bell-shaped soliton, singular soliton and periodic wave
solutions, have many potential applications in mathematical physics and engineering. The
simplicity and reliability of the proposed method is verified.
AUTOMATED PENETRATION TESTING: AN OVERVIEWcscpconf
The document discusses automated penetration testing and provides an overview. It compares manual and automated penetration testing, noting that automated testing allows for faster, more standardized and repeatable tests but has limitations in developing new exploits. It also reviews some current automated penetration testing methodologies and tools, including those using HTTP/TCP/IP attacks, linking common scanning tools, a Python-based tool targeting databases, and one using POMDPs for multi-step penetration test planning under uncertainty. The document concludes that automated testing is more efficient than manual for known vulnerabilities but cannot replace manual testing for discovering new exploits.
CLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORKcscpconf
Since the mid of 1990s, functional connectivity study using fMRI (fcMRI) has drawn increasing
attention of neuroscientists and computer scientists, since it opens a new window to explore
functional network of human brain with relatively high resolution. BOLD technique provides
almost accurate state of brain. Past researches prove that neuro diseases damage the brain
network interaction, protein- protein interaction and gene-gene interaction. A number of
neurological research paper also analyse the relationship among damaged part. By
computational method especially machine learning technique we can show such classifications.
In this paper we used OASIS fMRI dataset affected with Alzheimer’s disease and normal
patient’s dataset. After proper processing the fMRI data we use the processed data to form
classifier models using SVM (Support Vector Machine), KNN (K- nearest neighbour) & Naïve
Bayes. We also compare the accuracy of our proposed method with existing methods. In future,
we will other combinations of methods for better accuracy.
VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...cscpconf
The document proposes a new validation method for fuzzy association rules based on three steps: (1) applying the EFAR-PN algorithm to extract a generic base of non-redundant fuzzy association rules using fuzzy formal concept analysis, (2) categorizing the extracted rules into groups, and (3) evaluating the relevance of the rules using structural equation modeling, specifically partial least squares. The method aims to address issues with existing fuzzy association rule extraction algorithms such as large numbers of extracted rules, redundancy, and difficulties with manual validation.
PROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATAcscpconf
In many applications of data mining, class imbalance is noticed when examples in one class are
overrepresented. Traditional classifiers result in poor accuracy of the minority class due to the
class imbalance. Further, the presence of within class imbalance where classes are composed of
multiple sub-concepts with different number of examples also affect the performance of
classifier. In this paper, we propose an oversampling technique that handles between class and
within class imbalance simultaneously and also takes into consideration the generalization
ability in data space. The proposed method is based on two steps- performing Model Based
Clustering with respect to classes to identify the sub-concepts; and then computing the
separating hyperplane based on equal posterior probability between the classes. The proposed
method is tested on 10 publicly available data sets and the result shows that the proposed
method is statistically superior to other existing oversampling methods.
CHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCHcscpconf
Data collection is an essential, but manpower intensive procedure in ecological research. An
algorithm was developed by the author which incorporated two important computer vision
techniques to automate data cataloging for butterfly measurements. Optical Character
Recognition is used for character recognition and Contour Detection is used for imageprocessing.
Proper pre-processing is first done on the images to improve accuracy. Although
there are limitations to Tesseract’s detection of certain fonts, overall, it can successfully identify
words of basic fonts. Contour detection is an advanced technique that can be utilized to
measure an image. Shapes and mathematical calculations are crucial in determining the precise
location of the points on which to draw the body and forewing lines of the butterfly. Overall,
92% accuracy were achieved by the program for the set of butterflies measured.
SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...cscpconf
Smart cities utilize Internet of Things (IoT) devices and sensors to enhance the quality of the city
services including energy, transportation, health, and much more. They generate massive
volumes of structured and unstructured data on a daily basis. Also, social networks, such as
Twitter, Facebook, and Google+, are becoming a new source of real-time information in smart
cities. Social network users are acting as social sensors. These datasets so large and complex
are difficult to manage with conventional data management tools and methods. To become
valuable, this massive amount of data, known as 'big data,' needs to be processed and
comprehended to hold the promise of supporting a broad range of urban and smart cities
functions, including among others transportation, water, and energy consumption, pollution
surveillance, and smart city governance. In this work, we investigate how social media analytics
help to analyze smart city data collected from various social media sources, such as Twitter and
Facebook, to detect various events taking place in a smart city and identify the importance of
events and concerns of citizens regarding some events. A case scenario analyses the opinions of
users concerning the traffic in three largest cities in the UAE
SOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGEcscpconf
The anonymity of social networks makes it attractive for hate speech to mask their criminal
activities online posing a challenge to the world and in particular Ethiopia. With this everincreasing
volume of social media data, hate speech identification becomes a challenge in
aggravating conflict between citizens of nations. The high rate of production, has become
difficult to collect, store and analyze such big data using traditional detection methods. This
paper proposed the application of apache spark in hate speech detection to reduce the
challenges. Authors developed an apache spark based model to classify Amharic Facebook
posts and comments into hate and not hate. Authors employed Random forest and Naïve Bayes
for learning and Word2Vec and TF-IDF for feature selection. Tested by 10-fold crossvalidation,
the model based on word2vec embedding performed best with 79.83%accuracy. The
proposed method achieve a promising result with unique feature of spark for big data.
GENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXTcscpconf
This article presents Part of Speech tagging for Nepali text using General Regression Neural
Network (GRNN). The corpus is divided into two parts viz. training and testing. The network is
trained and validated on both training and testing data. It is observed that 96.13% words are
correctly being tagged on training set whereas 74.38% words are tagged correctly on testing
data set using GRNN. The result is compared with the traditional Viterbi algorithm based on
Hidden Markov Model. Viterbi algorithm yields 97.2% and 40% classification accuracies on
training and testing data sets respectively. GRNN based POS Tagger is more consistent than the
traditional Viterbi decoding technique.
In the realm of cybersecurity, offensive security practices act as a critical shield. By simulating real-world attacks in a controlled environment, these techniques expose vulnerabilities before malicious actors can exploit them. This proactive approach allows manufacturers to identify and fix weaknesses, significantly enhancing system security.
This presentation delves into the development of a system designed to mimic Galileo's Open Service signal using software-defined radio (SDR) technology. We'll begin with a foundational overview of both Global Navigation Satellite Systems (GNSS) and the intricacies of digital signal processing.
The presentation culminates in a live demonstration. We'll showcase the manipulation of Galileo's Open Service pilot signal, simulating an attack on various software and hardware systems. This practical demonstration serves to highlight the potential consequences of unaddressed vulnerabilities, emphasizing the importance of offensive security practices in safeguarding critical infrastructure.
Salesforce Integration for Bonterra Impact Management (fka Social Solutions A...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on integration of Salesforce with Bonterra Impact Management.
Interested in deploying an integration with Salesforce for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
Digital Marketing Trends in 2024 | Guide for Staying AheadWask
https://www.wask.co/ebooks/digital-marketing-trends-in-2024
Feeling lost in the digital marketing whirlwind of 2024? Technology is changing, consumer habits are evolving, and staying ahead of the curve feels like a never-ending pursuit. This e-book is your compass. Dive into actionable insights to handle the complexities of modern marketing. From hyper-personalization to the power of user-generated content, learn how to build long-term relationships with your audience and unlock the secrets to success in the ever-shifting digital landscape.
Your One-Stop Shop for Python Success: Top 10 US Python Development Providersakankshawande
Simplify your search for a reliable Python development partner! This list presents the top 10 trusted US providers offering comprehensive Python development services, ensuring your project's success from conception to completion.
zkStudyClub - LatticeFold: A Lattice-based Folding Scheme and its Application...Alex Pruden
Folding is a recent technique for building efficient recursive SNARKs. Several elegant folding protocols have been proposed, such as Nova, Supernova, Hypernova, Protostar, and others. However, all of them rely on an additively homomorphic commitment scheme based on discrete log, and are therefore not post-quantum secure. In this work we present LatticeFold, the first lattice-based folding protocol based on the Module SIS problem. This folding protocol naturally leads to an efficient recursive lattice-based SNARK and an efficient PCD scheme. LatticeFold supports folding low-degree relations, such as R1CS, as well as high-degree relations, such as CCS. The key challenge is to construct a secure folding protocol that works with the Ajtai commitment scheme. The difficulty, is ensuring that extracted witnesses are low norm through many rounds of folding. We present a novel technique using the sumcheck protocol to ensure that extracted witnesses are always low norm no matter how many rounds of folding are used. Our evaluation of the final proof system suggests that it is as performant as Hypernova, while providing post-quantum security.
Paper Link: https://eprint.iacr.org/2024/257
Dandelion Hashtable: beyond billion requests per second on a commodity serverAntonios Katsarakis
This slide deck presents DLHT, a concurrent in-memory hashtable. Despite efforts to optimize hashtables, that go as far as sacrificing core functionality, state-of-the-art designs still incur multiple memory accesses per request and block request processing in three cases. First, most hashtables block while waiting for data to be retrieved from memory. Second, open-addressing designs, which represent the current state-of-the-art, either cannot free index slots on deletes or must block all requests to do so. Third, index resizes block every request until all objects are copied to the new index. Defying folklore wisdom, DLHT forgoes open-addressing and adopts a fully-featured and memory-aware closed-addressing design based on bounded cache-line-chaining. This design offers lock-free index operations and deletes that free slots instantly, (2) completes most requests with a single memory access, (3) utilizes software prefetching to hide memory latencies, and (4) employs a novel non-blocking and parallel resizing. In a commodity server and a memory-resident workload, DLHT surpasses 1.6B requests per second and provides 3.5x (12x) the throughput of the state-of-the-art closed-addressing (open-addressing) resizable hashtable on Gets (Deletes).
leewayhertz.com-AI in predictive maintenance Use cases technologies benefits ...alexjohnson7307
Predictive maintenance is a proactive approach that anticipates equipment failures before they happen. At the forefront of this innovative strategy is Artificial Intelligence (AI), which brings unprecedented precision and efficiency. AI in predictive maintenance is transforming industries by reducing downtime, minimizing costs, and enhancing productivity.
Taking AI to the Next Level in Manufacturing.pdfssuserfac0301
Read Taking AI to the Next Level in Manufacturing to gain insights on AI adoption in the manufacturing industry, such as:
1. How quickly AI is being implemented in manufacturing.
2. Which barriers stand in the way of AI adoption.
3. How data quality and governance form the backbone of AI.
4. Organizational processes and structures that may inhibit effective AI adoption.
6. Ideas and approaches to help build your organization's AI strategy.
GraphRAG for Life Science to increase LLM accuracyTomaz Bratanic
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
A Comprehensive Guide to DeFi Development Services in 2024Intelisync
DeFi represents a paradigm shift in the financial industry. Instead of relying on traditional, centralized institutions like banks, DeFi leverages blockchain technology to create a decentralized network of financial services. This means that financial transactions can occur directly between parties, without intermediaries, using smart contracts on platforms like Ethereum.
In 2024, we are witnessing an explosion of new DeFi projects and protocols, each pushing the boundaries of what’s possible in finance.
In summary, DeFi in 2024 is not just a trend; it’s a revolution that democratizes finance, enhances security and transparency, and fosters continuous innovation. As we proceed through this presentation, we'll explore the various components and services of DeFi in detail, shedding light on how they are transforming the financial landscape.
At Intelisync, we specialize in providing comprehensive DeFi development services tailored to meet the unique needs of our clients. From smart contract development to dApp creation and security audits, we ensure that your DeFi project is built with innovation, security, and scalability in mind. Trust Intelisync to guide you through the intricate landscape of decentralized finance and unlock the full potential of blockchain technology.
Ready to take your DeFi project to the next level? Partner with Intelisync for expert DeFi development services today!
Skybuffer AI: Advanced Conversational and Generative AI Solution on SAP Busin...Tatiana Kojar
Skybuffer AI, built on the robust SAP Business Technology Platform (SAP BTP), is the latest and most advanced version of our AI development, reaffirming our commitment to delivering top-tier AI solutions. Skybuffer AI harnesses all the innovative capabilities of the SAP BTP in the AI domain, from Conversational AI to cutting-edge Generative AI and Retrieval-Augmented Generation (RAG). It also helps SAP customers safeguard their investments into SAP Conversational AI and ensure a seamless, one-click transition to SAP Business AI.
With Skybuffer AI, various AI models can be integrated into a single communication channel such as Microsoft Teams. This integration empowers business users with insights drawn from SAP backend systems, enterprise documents, and the expansive knowledge of Generative AI. And the best part of it is that it is all managed through our intuitive no-code Action Server interface, requiring no extensive coding knowledge and making the advanced AI accessible to more users.
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
2. 160 Computer Science & Information Technology (CS & IT)
routing path(s) and thereby, effectively met the desired Quality of Service (QoS) [1]. This
infrastructure results 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 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.
3. Computer Science & Information Technology (CS & IT) 161
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
such as delay, packet loss, bandwidth and jitter. The following equation provides formulation data
for computation [5] QoS routing function is formulated as:
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.
In progressively,
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.
The Bandwidth Constraint is the requirement of average bandwidth among all tree branches in the
network.
Specifically 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.
4. 162 Computer Science & Information Technology (CS & IT)
2.1 Tuned Cuckoo Search 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-heuristic
techniques. Before analyzing the proposed method, the cuckoo algorithm is discussed as follows.
2.1.1. An Overview of Cuckoo Search Algorithm
By analogy of reproduction strategy, CS algorithm is a well known prominent heuristic search
algorithms which follow 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
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 nest if eggs are unknown
Important step of CS are explained as follows:
Step 1-Randomly set“Pop” host nests, a group of the population. (e.g.,ܲ = ∑ ܲ
ୀଵ )
Step 2-Evaluate the fitness of all nestsܨ = ∑ ݂(ܲ
ୀଵ )
Step 3- Do Iterations < Max.Iterations
Step 4- Produce a cuckoo egg ܲ
by applying a Lévy flight from a random nest
Step 5- Compute the fitness of ݂(ܲ)
Step 6- Check for existence: choose again a random nest J
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 new nests at new locations using Levy flights replacements
Step 12- End While
5. Computer Science & Information Technology (CS & IT) 163
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.
2.1.2 Node Stability
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 group. Self-
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 establishes self-stability, i.e., node movement is relative to its
previous position.
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
range.
2.1.3 Neighbor node stability
It can be defined as how the node is being connected to its neighbour to obtain self-stability.
Whenever nodes are in transmission range, it can exchange messages with each other. Each node
consists of connectivity information, the signal stability of one-hopneighbors, and also maintains
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 and 0.7
since they yield better results in simulation.
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 1 represents a pseudocode for updating link stability status between the
nodes. The different parameters used in the algorithm are as follows:
6. 164 Computer Science & Information Technology (CS & IT)
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;
7. Computer Science & Information Technology (CS & IT) 165
Step 21: end if
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 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
nodes is given by
The queuing delay denoted by 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
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 shared wireless
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 senses the channel and estimates bandwidth by using the
idle and busy times in a predefined interval. This is expressed by the following equation.
2.1.8 Route Discovery Process using Tuned Cuckoo Process
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 group of receivers using stable and
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 multicast mesh to the
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:
8. 166 Computer Science & Information Technology (CS & IT)
Source node prepares an RR packet with an application of bandwidth and delay
requirements.
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
9. Computer Science & Information Technology (CS & IT) 167
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
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.
Table 1: Simulation scenario
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
10. 168 Computer Science & Information Technology (CS & IT)
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 startsto 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.
Figure 2: PDR vs Number of Destinations
Figure 3: PDR vs Node Speed
11. Computer Science & Information Technology (CS & IT) 169
Figure 4: Overhead vs Node Speed
Figure 5: Overhead vs Number of destinations
12. 170 Computer Science & Information Technology (CS & IT)
Figure 6: End - End Delays vs Speed
Figure 7: End - End Delays vs Number of Destinations
4. CONCLUSIONS
This paper clarifies about a hybrid computational intelligent algorithm i.e., Tuned Cuckoo Search
Algorithm (TCSA), that includes the dominant attribute of two different heuristic techniques have
been used to solve QoS multicast routing. The QoS routing in a MANET is a complicated 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,
13. Computer Science & Information Technology (CS & IT) 171
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 superior search multicast trees, particularly in both swift convergence and robustness,
when compared to other algorithms. This proposed algorithm shall be the lead for real-time
networks with suitable refinement 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. 172 Computer Science & Information Technology (CS & IT)
[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.
[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.
15. Computer Science & Information Technology (CS & IT) 173
[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.
AUTHORS
M. Vijayalakshmi Completed B.E and M.E in E.C.E from Osmania University. Presently pursuing Ph.D in
the area of Wireless Networks at Jawaharlal Nehru Technological University, Hyderabad,(JNTUH) Under
the guidance of Prof., Dr.D.Sreenivasarao, JNTUH. And working as an Assoc.Prof. in G.N.I.T.S.,
Hyderabad. Total teaching experience is of 16 years.