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.
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.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
DYNAMIC QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MAN...csandit
Mobile ad hoc networking does not possess any fixed infrastructure and hence, stable routing is the major problem. The mobility nature of MANET’s node facilitates rediscovery of a new path to organizing a routing. In order to intensify the Quality of Service and routing stability in MANET, we propose a Dynamic Quality of service Stability based Multicast Routing Protocol by modifying the Cuckoo Search Algorithm through a modernizing mechanism which is derived from the differential evolution algorithm. Tuned CSA is a combined feature of CSA and DE algorithms. Periodically, each node in the network creates neighbour stability and QoS database at every node by calculating the parameters like node and link stability factor,
bandwidth availability, and delays. Finally, multicast path constructs route request and route reply packets, stability information and performing route maintenance.
Load balancing In Wireless Mesh Networks Using liquid–Simulated AlgorithmIJSRED
The document proposes a hierarchical routing framework and liquid-simulated algorithm for load balancing in wireless mesh networks. Key points:
- The framework forms clusters with wireless mesh routers (WMRs) as cluster heads and simplifies clustering procedures. It uses limited topology broadcasting to allow WMRs to choose best paths between adjacent clusters.
- The liquid-simulated algorithm aims to keep load balanced between WMRs by treating load as a liquid level and allowing flows between nodes to equalize levels across the network.
- The framework uses a proactive routing approach within this load balancing algorithm, with topology broadcasting constrained within clusters and adjacent clusters to reduce overhead.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
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.
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.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
DYNAMIC QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MAN...csandit
Mobile ad hoc networking does not possess any fixed infrastructure and hence, stable routing is the major problem. The mobility nature of MANET’s node facilitates rediscovery of a new path to organizing a routing. In order to intensify the Quality of Service and routing stability in MANET, we propose a Dynamic Quality of service Stability based Multicast Routing Protocol by modifying the Cuckoo Search Algorithm through a modernizing mechanism which is derived from the differential evolution algorithm. Tuned CSA is a combined feature of CSA and DE algorithms. Periodically, each node in the network creates neighbour stability and QoS database at every node by calculating the parameters like node and link stability factor,
bandwidth availability, and delays. Finally, multicast path constructs route request and route reply packets, stability information and performing route maintenance.
Load balancing In Wireless Mesh Networks Using liquid–Simulated AlgorithmIJSRED
The document proposes a hierarchical routing framework and liquid-simulated algorithm for load balancing in wireless mesh networks. Key points:
- The framework forms clusters with wireless mesh routers (WMRs) as cluster heads and simplifies clustering procedures. It uses limited topology broadcasting to allow WMRs to choose best paths between adjacent clusters.
- The liquid-simulated algorithm aims to keep load balanced between WMRs by treating load as a liquid level and allowing flows between nodes to equalize levels across the network.
- The framework uses a proactive routing approach within this load balancing algorithm, with topology broadcasting constrained within clusters and adjacent clusters to reduce overhead.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
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.
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.
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.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
The document proposes a new routing protocol called Sector Tree-Based Clustering for Energy Efficient Routing Protocol (STB-EE) for wireless sensor networks. STB-EE partitions the sensor field into dynamic sectors to balance the number of nodes per cluster. Within each sector, STB-EE constructs a minimum spanning tree to connect nodes and reduce long-distance communication. STB-EE selects cluster heads based on remaining energy and distance to the base station. Simulation results show STB-EE can improve network lifespan by about 15-16% compared to other protocols.
Channel Aware Mac Protocol for Maximizing Throughput and FairnessIJORCS
The proper channel utilization and the queue length aware routing protocol is a challenging task in MANET. To overcome this drawback we are extending the previous work by improving the MAC protocol to maximize the Throughput and Fairness. In this work we are estimating the channel condition and Contention for a channel aware packet scheduling and the queue length is also calculated for the routing protocol which is aware of the queue length. The channel is scheduled based on the channel condition and the routing is carried out by considering the queue length. This queue length will provide a measurement of traffic load at the mobile node itself. Depending upon this load the node with the lesser load will be selected for the routing; this will effectively balance the load and improve the throughput of the ad hoc network.
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.
The document proposes an interference-oriented topology control algorithm for delay-constrained mobile ad-hoc networks (MANETs). It aims to jointly consider delay and interference to control topology while minimizing interference. The algorithm takes into account transmission delay, contention delay, queuing delay, and interference constraints. Simulation results show the algorithm effectively reduces delay and improves performance for delay-constrained MANETs by controlling topology to meet interference constraints and increasing transmit range to meet delay requirements. Node mobility impact on the algorithm is also investigated.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
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.
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.
Effect of node mobility onaomdv protocol in manetijwmn
In this paper, we have analyzed the effect of node mobility on theperformance of AOMDV multipath routing
protocol. This routing protocol in ad hoc network has been analyzed with random way point mobility model
only. This is not sufficient to evaluate the behavior of a routing protocol. Therefore, in this paper, we
have considered Random waypoint, Random Direction and Probabilistic Random Walk mobility Model for
performance analysis of AOMDV protocol. The result reveals that packet delivery ratio decreases with the
increasing node mobility forall mobility models. Also, average end-to-end delay is also vary with varying
node speed, initially upto 20 nodes in all mobility models delay is minimum.
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
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.
Effect of mobility models on the performance of multipath routing protocol in...csandit
In this paper, we have analyzed the performance of multipath routing protocol with various mobility
models for Mobile Ad Hoc Networks. The basic purpose of any multipath routing protocol
is to overcome various problems occurs while data delivery through a single path routing protocol.
For high acceptability of routing protocol, analysis of routing protocol in ad hoc network
only with random way point mobility model is not sufficient. Here, we have considered Random
waypoint, Random Direction and Probabilistic Random Walk mobility Model for proper analysis
of AOMDV routing protocol. Results obtained show that with increasing node density, packet
delivery ratio increases but with increasing node mobility Packet delivery ratio decreases.
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.
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.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Dynamic K-Means Algorithm for Optimized Routing in Mobile Ad Hoc Networks IJCSES Journal
The document proposes a dynamic K-means clustering algorithm to improve routing in mobile ad hoc networks (MANETs). It aims to address limitations of the basic K-means algorithm like fixed cluster heads and members. The dynamic algorithm elects cluster heads periodically based on distance to cluster center and node energy. It allows any node to serve as cluster head for a time slot to address head mobility. Experimental results show the dynamic approach enhances MANET routing performance metrics like route discovery time, delay, and packet delivery rate compared to basic K-means routing.
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.
Traffic-aware adaptive server load balancing for softwaredefined networks IJECEIAES
Servers in data center networks handle heterogeneous bulk loads. Load balancing, therefore, plays an important role in optimizing network bandwidth and minimizing response time. A complete knowledge of the current network status is needed to provide a stable load in the network. The process of network status catalog in a traditional network needs additional processing which increases complexity, whereas, in software defined networking, the control plane monitors the overall working of the network continuously. Hence it is decided to propose an efficient load balancing algorithm that adapts SDN. This paper proposes an efficient algorithm TAASLB-traffic-aware adaptive server load balancing to balance the flows to the servers in a data center network. It works based on two parameters, residual bandwidth, and server capacity. It detects the elephant flows and forwards them towards the optimal server where it can be processed quickly. It has been tested with the Mininet simulator and gave considerably better results compared to the existing server load balancing algorithms in the floodlight controller. After experimentation and analysis, it is understood that the method provides comparatively better results than the existing load balancing algorithms.
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.
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.
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.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
The document proposes a new routing protocol called Sector Tree-Based Clustering for Energy Efficient Routing Protocol (STB-EE) for wireless sensor networks. STB-EE partitions the sensor field into dynamic sectors to balance the number of nodes per cluster. Within each sector, STB-EE constructs a minimum spanning tree to connect nodes and reduce long-distance communication. STB-EE selects cluster heads based on remaining energy and distance to the base station. Simulation results show STB-EE can improve network lifespan by about 15-16% compared to other protocols.
Channel Aware Mac Protocol for Maximizing Throughput and FairnessIJORCS
The proper channel utilization and the queue length aware routing protocol is a challenging task in MANET. To overcome this drawback we are extending the previous work by improving the MAC protocol to maximize the Throughput and Fairness. In this work we are estimating the channel condition and Contention for a channel aware packet scheduling and the queue length is also calculated for the routing protocol which is aware of the queue length. The channel is scheduled based on the channel condition and the routing is carried out by considering the queue length. This queue length will provide a measurement of traffic load at the mobile node itself. Depending upon this load the node with the lesser load will be selected for the routing; this will effectively balance the load and improve the throughput of the ad hoc network.
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.
The document proposes an interference-oriented topology control algorithm for delay-constrained mobile ad-hoc networks (MANETs). It aims to jointly consider delay and interference to control topology while minimizing interference. The algorithm takes into account transmission delay, contention delay, queuing delay, and interference constraints. Simulation results show the algorithm effectively reduces delay and improves performance for delay-constrained MANETs by controlling topology to meet interference constraints and increasing transmit range to meet delay requirements. Node mobility impact on the algorithm is also investigated.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
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.
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.
Effect of node mobility onaomdv protocol in manetijwmn
In this paper, we have analyzed the effect of node mobility on theperformance of AOMDV multipath routing
protocol. This routing protocol in ad hoc network has been analyzed with random way point mobility model
only. This is not sufficient to evaluate the behavior of a routing protocol. Therefore, in this paper, we
have considered Random waypoint, Random Direction and Probabilistic Random Walk mobility Model for
performance analysis of AOMDV protocol. The result reveals that packet delivery ratio decreases with the
increasing node mobility forall mobility models. Also, average end-to-end delay is also vary with varying
node speed, initially upto 20 nodes in all mobility models delay is minimum.
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
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.
Effect of mobility models on the performance of multipath routing protocol in...csandit
In this paper, we have analyzed the performance of multipath routing protocol with various mobility
models for Mobile Ad Hoc Networks. The basic purpose of any multipath routing protocol
is to overcome various problems occurs while data delivery through a single path routing protocol.
For high acceptability of routing protocol, analysis of routing protocol in ad hoc network
only with random way point mobility model is not sufficient. Here, we have considered Random
waypoint, Random Direction and Probabilistic Random Walk mobility Model for proper analysis
of AOMDV routing protocol. Results obtained show that with increasing node density, packet
delivery ratio increases but with increasing node mobility Packet delivery ratio decreases.
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.
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.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Dynamic K-Means Algorithm for Optimized Routing in Mobile Ad Hoc Networks IJCSES Journal
The document proposes a dynamic K-means clustering algorithm to improve routing in mobile ad hoc networks (MANETs). It aims to address limitations of the basic K-means algorithm like fixed cluster heads and members. The dynamic algorithm elects cluster heads periodically based on distance to cluster center and node energy. It allows any node to serve as cluster head for a time slot to address head mobility. Experimental results show the dynamic approach enhances MANET routing performance metrics like route discovery time, delay, and packet delivery rate compared to basic K-means routing.
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.
Traffic-aware adaptive server load balancing for softwaredefined networks IJECEIAES
Servers in data center networks handle heterogeneous bulk loads. Load balancing, therefore, plays an important role in optimizing network bandwidth and minimizing response time. A complete knowledge of the current network status is needed to provide a stable load in the network. The process of network status catalog in a traditional network needs additional processing which increases complexity, whereas, in software defined networking, the control plane monitors the overall working of the network continuously. Hence it is decided to propose an efficient load balancing algorithm that adapts SDN. This paper proposes an efficient algorithm TAASLB-traffic-aware adaptive server load balancing to balance the flows to the servers in a data center network. It works based on two parameters, residual bandwidth, and server capacity. It detects the elephant flows and forwards them towards the optimal server where it can be processed quickly. It has been tested with the Mininet simulator and gave considerably better results compared to the existing server load balancing algorithms in the floodlight controller. After experimentation and analysis, it is understood that the method provides comparatively better results than the existing load balancing algorithms.
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.
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.
Dynamic Quality of Service Stability Based Multicast Routing Protocol for MAN...cscpconf
Mobile ad hoc networking does not possess any fixed infrastructure and hence, stable routing is
the major problem. The mobility nature of MANET’s node facilitates rediscovery of a new path
to organizing a routing. In order to intensify the Quality of Service and routing stability in
MANET, we propose a Dynamic Quality of service Stability based Multicast Routing Protocol
by modifying the Cuckoo Search Algorithm through a modernizing mechanism which is derived
from the differential evolution algorithm. Tuned CSA is a combined feature of CSA and DE
algorithms. Periodically, each node in the network creates neighbour stability and QoS
database at every node by calculating the parameters like node and link stability factor,
bandwidth availability, and delays. Finally, multicast path constructs route request and route
reply packets, stability information and performing route maintenance
A novel k-means powered algorithm for an efficient clustering in vehicular ad...IJECEIAES
Considerable attention has recently been given to the routing issue in vehicular ad-hoc networks (VANET). Indeed, the repetitive communication failures and high velocity of vehicles reduce the efficacy of routing protocols in VANET. The clustering technique is considered an important solution to overcome these difficulties. In this paper, an efficient clustering approach using an adapted k-means algorithm for VANET has been introduced to enhance network stability in a highway environment. Our approach relies on a clustering scheme that accounts for the network characteristics and the number of connected vehicles. The simulation indicates that the proposed approach is more efficient than similar schemes. The results obtained appear an overall increase in constancy, proven by an increase in cluster head lifetime by 66%, and an improvement in robustness clear in the overall reduction of the end-to-end delay by 46% as well as an increase in throughput by 74%.
Clustering based performance improvement strategies for mobile ad hoc netwoIAEME Publication
This document discusses various clustering techniques that can improve performance in mobile ad hoc networks (MANETs). It begins by introducing MANETs and clustering concepts. It then reviews several clustering algorithms including lowest-ID, highest degree, least clustering change, and trust-based clustering. It also discusses clustering based on outlier detection for identifying misbehaving nodes. The document concludes that clustering is an important technique for resource management and routing in MANETs, and that selecting optimal cluster heads is critical to network performance and energy efficiency.
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
This document lists several Java/J2EE/J2ME projects related to utility computing environments, schema matching, fuzzy ontology generation, wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing, collaborative key agreement, TCP congestion control, global roaming in mobile networks, GPS-based emergency response systems, network intrusion detection, honey pots, voice over IP, vehicle tracking, SIP-based teleconferencing, online security systems, and location-aided routing in ad hoc networks. The projects cover a wide range of topics related to distributed systems, wireless networks, and Internet applications.
This document lists several Java/J2EE/J2ME projects involving topics like adaptive resource allocation in utility computing, automatic schema matching, fuzzy ontology generation for the semantic web, energy efficient routing in wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing in internet-like environments, distributed collaborative key agreement, TCP low priority service, distributed database architecture for global roaming, shortest path finding using GPS navigation, network intrusion detection, honey pots for security, voice over internet protocol, GPS vehicle location tracking, SIP-based teleconferencing, online security systems using motion detection, and location aided routing in ad-hoc networks.
This document lists several Java/J2EE/J2ME projects including:
1. A project on adaptive resource allocation in utility computing clusters that observed a 14% increase in resource provider profit and 20% reduction in user request response time.
2. A project on automatic schema matching that introduced a framework for composing schema matchers and generating ranked schema mappings.
3. A project on automatic fuzzy ontology generation for the semantic web using fuzzy formal concept analysis.
4. A project on energy efficient routing in wireless sensor networks that jointly optimized data transmission and fusion costs.
The document describes 10 Java/J2EE/J2ME projects covering topics such as:
1) Adaptive resource allocation in utility computing and its impact on provider profit and user response times.
2) Using schema meta-matching to generate consensus mappings between schemas by composing multiple schema matchers.
3) Automatically generating fuzzy ontologies for the semantic web using fuzzy formal concept analysis.
4) An adaptive data fusion algorithm for energy efficient routing in wireless sensor networks.
5) An implicitly pipelined MAC protocol to improve channel utilization for wireless networks.
6) A distributed cache updating algorithm for the dynamic source routing protocol.
7) Investigating selfish routing in Internet-like environments using game
This document lists several Java/J2EE/J2ME projects related to utility computing environments, schema matching, fuzzy ontology generation, wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing, collaborative key agreement, TCP congestion control, global roaming in mobile networks, GPS-based emergency response systems, network intrusion detection, honey pots, voice over IP, vehicle tracking, SIP-based teleconferencing, online security systems, and location-aided routing in ad hoc networks. The projects cover a wide range of topics related to distributed systems, wireless networks, and Internet protocols.
The document describes 10 Java/J2EE/J2ME projects covering topics such as:
1) Adaptive resource allocation in utility computing and its impact on provider profit and user requirements.
2) Using schema meta-matching to generate consensus rankings from multiple schema matchers to improve automatic schema matching.
3) The FOGA framework for automatically generating fuzzy ontologies for representing uncertainty on the Semantic Web.
4) The Adaptive Fusion Steiner Tree algorithm for optimizing energy efficiency in wireless sensor networks by adaptively determining whether to perform data fusion.
This document lists several Java/J2EE/J2ME projects related to utility computing environments, schema matching, fuzzy ontology generation, wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing, collaborative key agreement, TCP congestion control, global roaming in mobile networks, GPS-based emergency response systems, network intrusion detection, honey pots, voice over IP, vehicle tracking, SIP-based teleconferencing, online security systems, and location-aided routing in ad hoc networks. The projects cover a wide range of topics related to distributed systems, wireless networks, and Internet protocols.
This document lists several Java/J2EE/J2ME projects related to utility computing environments, schema matching, fuzzy ontology generation, wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing, collaborative key agreement, TCP congestion control, global roaming in mobile networks, GPS-based emergency response systems, network intrusion detection, honey pots, voice over IP, vehicle tracking, SIP-based teleconferencing, online security systems, and location-aided routing in ad hoc networks. The projects cover a wide range of topics related to distributed systems, wireless networks, and Internet protocols.
This document lists several Java/J2EE/J2ME projects related to utility computing environments, schema matching, fuzzy ontology generation, wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing, collaborative key agreement, TCP congestion control, global roaming in mobile networks, GPS-based emergency response systems, network intrusion detection, honey pots, voice over IP, vehicle tracking, SIP-based teleconferencing, online security systems, and location-aided routing in ad hoc networks. The projects cover a wide range of topics related to distributed systems, wireless networks, and Internet protocols.
Similar to Improving QoS in VANET Using Dynamic Clustering Technique (20)
Neuroprosthetics involves using brain signals acquired from neurons for various purposes like restoring movement in paralyzed patients. Nanotechnology like nano multi-electrode arrays can be used to receive and transmit brain signals more effectively by increasing electrode conduction and reducing incorrect connections with neurons. Neuroprosthetics has applications in both in vivo and in vitro contexts and can help improve functions like movement, speech, and understanding of drug effects on animal behavior and emotions.
1) The document proposes a method to monitor intraocular pressure using a smart contact lens with an integrated nanosensor and a micro-sized relay switch placed at the canal of Schlemm opening.
2) If the pressure exceeds 20 mmHg, the relay switch opens to drain fluid through the canal of Schlemm. If pressure is below 10 mmHg, the relay closes to prevent drainage. This maintains a constant pressure to prevent glaucoma.
3) The smart lens transmits pressure readings wirelessly to an external receiver, allowing for continuous monitoring and treatment of glaucoma without vision loss.
This document proposes using nanorobots to remove plaque from arteries as an alternative to heart bypass surgery. Nanorobots 0.5-3 microns in size would be inserted into the femoral artery and navigate to the plaque site using sensors. The nanorobot would then use a rotating needle to grind plaque into particles, which are harmlessly eliminated by the body. A magnetic switch allows external control of the nanorobot. This technique could remove plaque without major surgery and complications.
This document provides an overview of embedded systems, including their implementation and applications. It discusses that embedded systems are computing devices with dedicated functions that are part of a larger system. Nearly all processors manufactured are used in embedded systems. Embedded systems are found in industrial and consumer applications. They can be categorized as stand-alone systems, real-time systems, networked devices, and mobile devices. Embedded systems combine both hardware and software and require tradeoffs in their design. The document outlines the components, architecture, and special considerations for embedded systems, such as performance and power constraints.
This project report analyzes the performance of Docker containers running MySQL databases with increasing I/O workloads. The authors created Docker containers with MySQL images and loaded them with data using the TPC-C benchmark. They collected performance metrics like I/O entries, size, CPU utilization, and read/write ratios using tools like blktrace, iostat, and tpmc as the number of containers increased from 1 to 6. The analysis showed the optimal number of containers was 3, as performance metrics like I/O entries and size peaked at this point before declining with more containers.
This document analyzes the performance of Docker containers running varying I/O intensive MySQL workloads. Key metrics like I/O entries, size, CPU utilization, and read/write ratios were collected from blktrace, blkparse, and iostat. The analysis found these metrics began saturating after 3 containers, indicating the default system cache was effectively handling redundant data between containers. While Docker performed well, a cache designed specifically for containers may further boost performance, especially with large numbers of identical containers.
The document discusses cloud computing concepts, architectures, and research challenges. It describes the key layers of cloud computing including hardware, infrastructure, platform, and application layers. It also discusses cloud service models (IaaS, PaaS, SaaS), types of clouds (public, private, hybrid), and characteristics. Several research challenges are outlined including automated provisioning, VM migration, server consolidation, traffic management, data security, and developing efficient software frameworks and storage technologies for cloud environments.
The document describes a proposed system using Micro-Electro Mechanical Systems (MEMS) and Nanorobots to detect and remove plaque buildup in arteries to prevent atherosclerosis. The system would involve three main steps:
1) Nanorobots guided by MEMS would detect initial plaque formation and perform nano-surgery to remove it.
2) A Micro-SONAR attached to the artery wall by the Nanorobots would continuously monitor for new plaque by measuring the artery diameter and round trip time of ultrasound waves.
3) If new plaque is detected, the Nanorobots would detach and navigate to the location, guided by changes in blood pressure, to perform more nano-
This document certifies that Kaushik Padmanabhan has passed the Oracle Certified Professional, Java SE 6 Programmer exam as of August 01, 2016. The certification number provided is 247336002OCPJSE6P.
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...University of Maribor
Slides from talk presenting:
Aleš Zamuda: Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapter and Networking.
Presentation at IcETRAN 2024 session:
"Inter-Society Networking Panel GRSS/MTT-S/CIS
Panel Session: Promoting Connection and Cooperation"
IEEE Slovenia GRSS
IEEE Serbia and Montenegro MTT-S
IEEE Slovenia CIS
11TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONIC AND COMPUTING ENGINEERING
3-6 June 2024, Niš, Serbia
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
ACEP Magazine edition 4th launched on 05.06.2024Rahul
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
2. International Journal of Networks and Communications 2016, 6(4): 72-79 73
decrease the exhaust emissions significantly, but it is very
difficult in real time with dynamic traffic pattern. i.e. many
number of non-platoon vehicle cause the disturbance by
varying the speed of the platoon vehicles. So it is desirable to
use the VANET technology to overcome such problems and
the particular above mentioned issue can be solved through
incorporating adaptive clustering technique like one
presented in this paper.
Clustering refer to grouping of nodes in a hierarchical
manner and improve the energy efficiency in the ad hoc
network. Each cluster should be different from other clusters,
i.e., nodes belonging to one cluster should not overlap with
the nodes of other clusters. Clustering can be done using
various kinds of algorithms. Clustering could be hard or
fuzzy. In hard clustering algorithm, each node in the traffic
belongs to a single cluster during its operation; however, in
fuzzy clustering method, a degree of membership is assigned
to each node depending on its degree of association to
several other clusters. It is also possible to convert a fuzzy
clustering to a hard clustering by associating each node to the
cluster with the highest membership. The existing single
cluster formation depends on various algorithms. A
clustering algorithm includes two technical parts, cluster
establishment and cluster maintenance. In cluster
establishment, we need to identify the task (CH, CG, or CM)
of each node in the network. The election of CHs is a core
technique. An efficient clustering algorithm should adapt to
the nature of disturbance take care of the performance
metrics.
2. Related Works
We initially describe about the platoon movement in the
heavy traffic area. Generally, the vehicular platoon, i.e. the
vehicles following one behind another, is used to increase the
fuel efficiency by reducing the air-drag. The platoon must
vary in size according to the surrounding traffic. In the
existing disturbance adaption paper [1], the platoon manages
the disturbance by increasing or reducing the platoon size
while traversing through the traffic. Since the platoon
involves a single cluster, it involves a car following model
wherein any non-platoon vehicle that acts as a disturbance
must obey the Master node and follow the platoon members
accordingly.
This single cluster is formed from several algorithms with
respect to the ID, Relative Mobility and the position of nodes.
We introduce some known clustering algorithms based on ID
and degree of nodes like Lowest ID (LID) [4] which elects a
node with the smallest ID as a Master node. This approach is
feasible as it relies only on the ID but may cause several
re-clustering and small-size clusters which acts as the
disadvantage. Then we go onto HCC (High Connectivity
Clustering) [4] which elects a node with the highest degree
value as a Master node. Here the re-clustering is minimum,
so the cost of maintaining the cluster is comparatively low
than LID but this approach is more unstable to node mobility.
LCC (Least Master Node Change) [8] improves LID and
HCC on broadcast overheads due to re-clustering. MMDA
(Max-Min D-hop clustering Algorithm) [5] and RCC
(Random Competition based clustering) [6] use a contest
method to elect Master nodes. Weighted Clustering
Algorithm (WCA) [7] elects a node based on the number of
neighbours as a Master node, and Connectivity, Energy and
Mobility driven Clustering Algorithm (CEMCA) [10]
consider several factors such as ID, mobility, node degree,
location and power level for electing the Master node.
Then we move onto election criteria based on relative
mobility wherein [9], we can see that the MOBIC (MOBIlity
metrics Clustering) makes use of relative mobility for Master
node election among the dynamic nodes to improve the
stability of clusters. Relative mobility refers to the change in
position of one node with respect to a fixed other node. The
distance between the two nodes is noted from the change in
signal strength in this MOBIC algorithm. However, MOBIC
is inaccurate and hence in order to improve the MOBIC
algorithm, it is extended with DPP (Directional Propagation
Protocol) [11], which extends MOBIC into vehicular
environments. Here, two master nodes are selected at the
head and tail of the cluster.
Finally, a simple algorithm is designed and it is referred to
as CPM (Centre Position and Mobility) from [15] which
involves the calculation of the mean positions and velocities
of the platoon members for Master node election. Here the
member with the least CPM value is chosen as the Master
node. Once the traffic level is high, the network connectivity
gets reduced between the platoon members. Hence to avoid
this, multi-head clustering technique is used so that the
network connectivity is maintained. When these multi-head
clusters are formed using CPM algorithm [2], the multiple
Master nodes do not rely upon the relative distance between
the nodes in the platoon which leads to the decline of the
cooperation behaviour. Due to multi-head clusters within a
single platoon, overlapping of cluster members occur
between two multi-head clusters. When overlapping occurs
among the cluster members between two clusters [3], the
members choose to join the cluster with high beacon signal
strength. In [2], the multi-head clusters are used only to share
the data (uploading and downloading of multimedia files).
3. Existing Disturbance Adaptation
Mechanism
The technique explained in [1] investigates the dynamics
of a VANET enabled platoon under traffic commotion,
which is a common scenario on a highway. The system
considers that there is a traffic disturbance, when the leading
vehicle of a platoon tries deceleration to a lower velocity
“Vlow” from a stable velocity “Vstb” and then keep up this
speed for a period of time before accelerating to the original
speed.
To address these disturbance issues, they investigate the
VANET- enabled platoon’s dynamics. In particular, we first
3. 74 Kaushik Padmanabhan et al.: Improving QoS in VANET Using Dynamic Clustering Technique
propound a novel disturbance adaptive platoon (DA-Platoon)
architecture, which is used to define the DA-Platoon
dynamic system. The DA-Platoon system includes a
controller that shall consider both platoon dynamics and
VANET requirements and also adapts to the disturbance
scenario.
They propose a novel DA-Platoon architecture in which
they consider both traffic dynamics under traffic commotion
and the constraints due to VANET communications. The
Platoon then adapts to the traffic by reducing the
Intra-vehicle spacing (spacing between vehicles in the same
platoon), Inter-vehicle spacing (spacing between vehicles
adjacent platoon) to reduce the platoon size (i.e. the length of
the platoon), thus helps in reducing the traffic congestion.
However, the existing system did not consider the adaption
of platoon size, when there is interruption of Non-platoon
members within the platoon. Even though in a single
considered platoon, the cluster members will try sending the
broadcast messages which can cause broadcast storm that
can be reduced by means of [16]. To reduce the performance
overheads within the cluster or platoon members, the
vehicles need to communicate with the RSU as mentioned in
[17], so that more overheads on the cluster head gets reduced.
Hence, we made a novel Multi-head clustering in a
hierarchical manner under the single platoon cluster to
provide both effective adaptation at interrupting vehicle
nodes, improve the cluster reliability and reduce the
overheads.
4. Relative Multi-Head Disturbance
Adaptation (RMDA) Algorithm
In our RMDA algorithm, we have considered both relative
distance and mobility for clustering of nodes for our
hierarchical clustering based scheme. At first the center
position is calculated among the cluster members by
involving Centre Position and Mobility algorithm as per
equation (1) which follows. We measure the Relative
Multi-Head Disturbance Adaptation (RMDA) depending on
these concepts of center position and relative mobility of
each mobile node in a sector as the criterion of Master node
election. Each mobile node is supposed to continuously
broadcast a beacon signal to its one-hop neighbors. This
beacon signal carries information about the location and
velocity of mobile node. From these periodic beacon signals,
this issue can be solved through incorporating adaptive
clustering technique like one presented in this paper. a node
maintains a neighbor table that annals the mobility-related
data of all its current one-hop neighbors (including the node
itself). We have limited that the nodes move in a single
direction as the cluster reliability decreases when dynamic
directions are considered. This won’t be a problem as we are
implementing this algorithm over the nodes in a single lane.
The neighboring table information on each node will only
have the information of nodes in the same direction. The
information recorded for an ith
node in general will have their
position (xi, yi) and their velocity (vi), represented as (xi, yi,
vi). It is assumed that the first record will be the current
node’s own data.
The RMDA value of a node is computed as the following
steps:
1) Initially, the Platoon members will exchange beacon
messages about their position, speed and direction
among them.
2) Through the beacon position information, the center
coordinates are calculated from Center Position and
Mobility algorithm,
𝑃𝑃𝑃𝑃𝑃𝑃c = (xc, yc) =
1
m
(∑ xi
m
i=1 , ∑ yi
m
i=1 ) (1)
3) The node near the center coordinates is selected as the
Relay vehicle. The Master node is made to use the
relay vehicle for single platoon cluster
communication.
4) During the interruption of adjacent lane vehicles
between the platoon members, through the beacon
messages, we update the neighboring table
information and use it to find the vehicle traffic
around each platoon member.
5) Based on traffic load, the main Master node separates
the complete platoon into sectors.
6) Within those sectors, multi-head clusters are formed.
7) To form these multi-head clusters, election for Master
node occurs.
8) The Master node election initially involves the CPM
algorithm as per the steps (1), (2) and (3).
9) Then relative distance between the nodes in a sector
and the central coordinates are calculated as,
∆𝐷𝐷𝑖𝑖𝑖𝑖 = |Posi − Posc| = sqrt((xi − xc)2
+ (yi − yc)2) (2)
10) After calculating the relative distance, relative
velocity has to be calculated. Hence, the median value
of the velocities of the vehicles is calculated,
𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀 𝑉𝑉𝑉𝑉𝑉𝑉𝑉𝑉𝑉𝑉𝑉𝑉𝑉𝑉𝑉𝑉(𝑉𝑉𝑚𝑚𝑚𝑚𝑚𝑚 ) = 𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀{ 𝑉𝑉1, 𝑉𝑉2, … . . , 𝑉𝑉𝑚𝑚 } (3)
11) Then the relative velocity is found for each vehicle’s
velocity with respect to the central velocity,
∆𝑉𝑉𝑖𝑖 𝑖𝑖𝑖𝑖𝑖𝑖 = |𝑉𝑉𝑖𝑖 − 𝑉𝑉𝑚𝑚𝑚𝑚𝑚𝑚 | (4)
12) Then the Relative ratio which is between the relative
distance of each node and the Maximum relative
distance of the sector is calculated as:
𝑅𝑅𝑅𝑅𝑅𝑅𝑅𝑅 = 𝐾𝐾 �
∆𝐷𝐷𝑖𝑖𝑖𝑖
𝑀𝑀𝑀𝑀𝑀𝑀 {∆𝐷𝐷𝑖𝑖𝑖𝑖 }
� + (1 − 𝑘𝑘) �
∆𝑉𝑉𝑖𝑖 𝑖𝑖𝑖𝑖𝑖𝑖
𝑀𝑀𝑀𝑀𝑀𝑀 {∆𝑉𝑉𝑖𝑖 𝑖𝑖𝑖𝑖𝑖𝑖 }
� (5)
where k (weighting factor) = 0.6
13) The node with the minimum relative ratio is selected
as the Master node for the corresponding sector.
By this method, sector wise multi-head clustering is done
hierarchically under the main platoon cluster. Rather than
using the single cluster, we have used dynamic multi-head
clusters which are formed hierarchically. These dynamic
clusters have improved the efficiency by improving the QOS
parameters (throughput, packet loss ratio and end to end
delay). Fig. 1 shows the movement of a single
4. International Journal of Networks and Communications 2016, 6(4): 72-79 75
platoon-cluster P1 with an intra-platoon spacing as D. Fig. 2
shows the movement of that platoon traversing through the
heavy traffic. Hence the platoon undergoes disturbance
management by including multi-head clusters within the
platoon as per Fig. 3. By this any vehicle that comes in
between the platoon members will align with the platoon
members with same intra-platoon spacing as D.
Figure 1. Single Cluster Platoon
Figure 2. Movement of platoon members in the heavy traffic
Figure 3. Hierarchical multi-head cluster formation
5. Case Study
5.1. CASE-1: Platoon and Non-platoon Members with
Stable Relative Mobility
In our first module of cluster establishment, we have
considered a platoon of five vehicles which form a single
cluster with a Master node as relay vehicle, a master vehicle,
a tail vehicle and other platoon members. Here, we
considered a number of non-platoon vehicles that act as the
disturbance for the platoon vehicles. In this module, the
non-platoon vehicles have stable relative mobility with
respect to their platoon vehicles. Hence, the main platoon
Master node splits the total cluster region into sectors of
sub-clusters with a sub-Master node in each sector. Within
these sectors, the election of the Master nodes is done by
using the same RMDA algorithm, but with the relative
mobility value as zero.
Then the RMDA value will be calculated as:
𝑅𝑅𝑅𝑅𝑅𝑅𝑅𝑅 = 𝐾𝐾 �
∆𝐷𝐷𝑖𝑖𝑖𝑖
𝑀𝑀𝑀𝑀𝑀𝑀 {∆𝐷𝐷𝑖𝑖𝑖𝑖 }
� (6)
5.2. CASE-2: Platoon and Non-platoon Members with
Unstable Relative Mobility
In the above module, we have assumed the non-platoon
vehicles have stable relative mobility (stable velocity) with
respect to their platoon vehicles. However, there exists some
non-zero relative mobility (variable velocity) while the
platoon traverses through the traffic. Hence, in this module
we have considered the non-platoon vehicles to have
unstable relative mobility with respect to their platoon
vehicles. Since the non-platoon vehicles with variable
velocity move in and out of the sectors, there is a demand for
dynamic clustering among the sectors within a platoon.
Hence, the Multi-Master node election will be done by the
RMDA algorithm by using both Relative distance and
Relative mobility.
The RMDA value is calculated in this case as:
𝑅𝑅𝑅𝑅𝑅𝑅𝑅𝑅 = 𝐾𝐾 �
∆𝐷𝐷𝑖𝑖𝑖𝑖
𝑀𝑀𝑀𝑀𝑀𝑀 {∆𝐷𝐷𝑖𝑖𝑖𝑖 }
� + (1 − 𝑘𝑘) �
∆𝑉𝑉𝑖𝑖 𝑖𝑖𝑖𝑖𝑖𝑖
𝑀𝑀𝑀𝑀𝑀𝑀 {∆𝑉𝑉𝑖𝑖 𝑖𝑖𝑖𝑖𝑖𝑖 }
� (7)
6. Simulation
In this section, we conduct simulations and present the
results to support our theoretical conclusions. In all
simulations, the transmission range is set to 100 meters. In
this experiment, we generate 30 vehicles that run according
to our mobility model on a sufficiently large region with one
traffic influx.
Table 1. Simulation Parameters
PARAMETERS VALUES
Channel type Wireless Channel
Radio propagation model Two Ray Ground
Network interface type Wireless Physical
MAC Type IEEE 802.11p
Interface Queue Drop Tail/PriQueue
Link Layer Type LL
Antenna Model Omni Antenna
Max Packet in interface queue 50
Number of mobile nodes 20
Routing Protocol AODV
5. 76 Kaushik Padmanabhan et al.: Improving QoS in VANET Using Dynamic Clustering Technique
6.1. Simulation Scenario
Fig.4 represents the existing system maintaining a fixed
intra-platoon spacing (Spacing between the same Platoon
members) for a platoon with 5 members represented by
nodes 15 – 19 moving at a fixed speed of 20.
Figure 4. VANET enabled vehicle Platoon
The fixed intra-platoon spacing is made to reduce when
the head node 15 reduces its speed from 20 during traffic
disturbance to reduce traffic congestion.
In Fig. 5(a), we can see a node 20 interrupting between the
platoon nodes 18 and 19. This node 20 is considered to be a
non-platoon vehicle which act as a disturbance for the
platoon members 18 and 19. Initially this node will be
indicated in red color as it has not undergone any clustering
with the platoon members. Immediately from Fig. 5(b), we
can see the nodes 15 – 18 increases its speed from 20 to 22
and the node 19 decreases its speed from 20 to 19 in order to
maintain a fixed spacing between the interrupting node 20
and the adjacent platoon nodes 18 and 19. In Fig. 5(c), the
disturbance node 20 has finally been aligned with the platoon
members at a corrected spacing.
Also, to improve the reliability of the system, we made a
sector wise Multi-head clustering in a hierarchical manner
under the single platoon cluster by using RMDA algorithm
as specified in Section 4.
When considering real-time conditions, the non-platoon
members will always be varying their velocity in a traffic
scenario. Hence, a periodic dynamic re-election of
multi-head cluster is made to change the cluster membership
of vehicle nodes according to the node position.
We can note that node 31 in earlier figures, Fig. 4 and
Fig. 5, was at the first cluster represented by yellow color.
Then, in Fig. 6, with change in its position as it travels at a
speed of 25 when compared to platoon nodes speed 20, it
changes its cluster membership to the second cluster
represented by blue color.
(a)
(b)
(c)
Figure 5. (a) Interruption of vehicle inside the platoon (b) Correcting the
spacing after the interrupted vehicle. (c) Corrected spacing
6. International Journal of Networks and Communications 2016, 6(4): 72-79 77
Figure 6. Dynamic Multi-head hierarchical Clustering
6.2. Simulation Results
Quality of Service (QoS) is the capability of a network to
give a better service to selected network traffic over various
kinds of technologies. QoS parameters are calculated to
determine the reliability of the communication within the
network. Simulation results involve the measurement of QoS
parameters like throughput, packet loss ratio and end to end
delay. These measurements determine the efficiency and
reliability of our proposed algorithm, i.e. Relative
Multi-Head Disturbance Adaptation (RMDA) algorithm.
6.2.1. Throughput Measurement
Figure 7. Graph between Throughput Vs No. of nodes
Throughput refers to the rate of successful message
delivery per unit time over a communication channel in a
network. Fig. 7 indicates the throughput comparison
between the existing single cluster system and the proposed
hierarchical multi-head cluster system. In existing single
cluster system, the throughput decreases with the increase in
the number of vehicles. Since the platoon size does not vary
with respect to the interrupting vehicles, the possibility of
accident occurrence is high. Hence the congestion will be
more. Thereby increase in congestion will increase the
overheads between the nodes. But in our proposed system
hierarchical multi-head cluster system, the throughput is
improved. While the platoon moves in a heavy traffic, the
formation of dynamic sub-clusters within the platoon has
improved the network connectivity between the platoon
members. These sub-clusters are formed with separate
sub-Master nodes which will reduce the congestion towards
the main platoon head as these sub-clusters take the
responsibility of exchanging the data packets between the
vehicle nodes. So throughput has been enormously improved
in our proposed model.
6.2.2. Packet Loss Ratio Measurement
Packet loss occurs as one or more packets of data fail to
reach their destination while travelling across a network.
Figure 8. Graph between Packet Loss Ratio Vs No. of nodes
Fig. 8 represents the packet loss ratio comparison between
the existing system and our proposed model. The packet loss
ratio is more in the existing system since the existing system
comprises of only one cluster, the bandwidth efficiency is
decreased. When the number of vehicles in a cluster has
increased, the broadcast messages to the Master node will
also increase simultaneously. This causes broadcast storm
within that single cluster, i.e., when one set of vehicles in the
cluster are broadcasting data over the network, and the other
set will rebroadcast the data back to the network which will
create a flood of data within the cluster. This broadcast storm
will lead to congestion and further the packets are dropped
by the Master node. This leads to more packet loss ratio in
the existing system. The loss also occurs due to long distance
propagation of waves while the number of nodes increases in
the main cluster. But in our proposed model, rather than
using the single cluster, we have introduced hierarchical
multi-head clusters within the main platoon-cluster, which
has controlled the congestion caused due to the broadcast
storm. This ultimately has reduced the packet loss ratio.
6.2.3. End to End Delay Measurement
End-to-end delay refers to the time that a packet takes for
getting transmitted from source to destination across a
network. Fig. 9 represents the end to end delay comparison in
the existing system and our proposed model. By the present
existing system of single cluster algorithm, the delay is
shown to be higher significantly. It serves as the reference
7. 78 Kaushik Padmanabhan et al.: Improving QoS in VANET Using Dynamic Clustering Technique
for the forthcoming proposed dynamic multi-clustering
algorithm which is observed for two scenarios (i.e.) a
VANET network with equal speed and a VANET network
with varying speed.
Figure 9. Graph between End to end delay Vs No. of nodes
The technical reasoning behind this graphical result is that
the packet is subjected to more delay during the transfer, due
to the presence of a single governing Master node in the
platoon. Further, the existing system is subjected to
broadcast storm, which may lead to high degree of packet
loss and in return, increases the delay in the network. But in
our proposed model, the delay has been reduced compared to
the existing system. By the implementation of this dynamic
algorithm, the interaction of outside vehicles can be
controlled by the sub Master node formed, within the main
cluster. This mechanism greatly reduces the tendency for the
broadcast storm, thereby increasing the Packet Delivery
Ratio of the network. As a result, the delay in the network is
reduced significantly. By observation, both the cases in the
proposed model are found to be similar. By the results in the
graph, it is observed that the dynamic clustering algorithm is
beneficial in terms of delay in the network, than the existing
single cluster VANET system.
7. Conclusions
QoS is an important factor to be considered, while
designing any Adhoc network. It is often considered to be
very crucial for the implementation of an improved design in
the existing system of wireless network. By our paper, we
have proposed and described the implementation of dynamic
clustering algorithm, over the existing VANET architecture.
By the results produced with respect to the QoS parameters
of Delay, Throughput and Packet Loss Ratio, the proposed
algorithm is found to be meritorious in the aspect of outside
intrusion and any other outside disturbances. With these
results in hand, it could be creditable to say that this
algorithm could be brought to good effects into the
automobile industry and governmental bodies.
REFERENCES
[1] Jia, D., Lu, K., and Wang, J., 2014, “A Disturbance-Adaptive
Design for VANET-Enabled Vehicle Platoon”, IEEE
Transactions On Vehicular Technology, 63(2), pp. 527-539.
[2] Lo, S., Lin, Y., and Gao, J., 2013 “A Multi-Head Clustering
Algorithm in Vehicular Ad Hoc Networks”, International
Journal of Computer Theory and Engineering, Vol. 5(2), pp.
242-247.
[3] Abboud, K., and Zhuang, W., “Stochastic Modeling of
Single-Hop Cluster Stability in Vehicular Ad Hoc Networks”,
IEEE Transactions on Vehicular Technology, DOI
10.1109/TVT.2015.2396298.
[4] Gerla, M., Tsai, J.T., 1995 “Multiuser, mobile, multimedia
radio network,” Wireless Networks, vol. 1, pp. 255-265.
[5] Amis, A. D., Prakash, R., Vuong, T. H. P. and Huynh, D. T.,
2000 “Max-min d-cluster formation in wireless ad hoc
networks,” in Proc. IEEE Infocom Conf., pp. 32-41.
[6] Xu, K., Gerla, M., 2002 “A heterogeneous routing protocol
based on a new stable clustering scheme,” in Proc. Milcom
Conf., vol. 2., pp. 838-843.
[7] Chatterjee, M., Sas, S. K., Turgut, D., 2000 “An on-demand
weighted clustering algorithm (WCA) for ad hoc networks,”
in Proc. IEEE Globecom Conf., pp. 1697-1701.
[8] Chiang, C. C., Wu, H. K., Liu, W., Gerla, M., 1997 “Routing
in clustered multihop, mobile wireless networks with fading
channel,” in Proc. IEEE Sicon Conf., pp. 197-211.
[9] Basu, P., Khan, N., Little, T. D. C., 2001 “A mobility based
metric for clustering in mobile ad hoc networks,” in Proc. Int.
Conf. Distributed Computing Systems Workshop, pp.
413-418.
[10] Tolba, F. D., Magoni, D., Lorenz, P., 2007 “Connectivity,
energy and mobility driven clustering algorithm for mobile
ad hoc networks,” in Proc. IEEE Global Telecommunications
Conf., pp. 2786-2790.
[11] Little, T. D. C., Agarwal, A., 2005 “An information
propagation scheme for VANETs,” in Proc. IEEE Intelligent
Transportation Systems Conf., pp. 155-160.
[12] Ji, X., Zha, H., 2004 “Sensor positioning in wireless ad-hoc
sensor networks using multidimensional scaling,” in Proc.
IEEE Infocom Conf., pp. 2652-2661.
[13] Krishna, P., Vaidya, N. H., Chatterjee, M., Pradhan, D. K.,
1997 “A cluster-based approach for routing in dynamic
networks,” ACM Sigcomm Computer Communication
Review, vol. 27 (2), pp. 49-64.
[14] Wu, T., Biswas, S., 2005 “A self-reorganizing slot allocation
protocol for multi-cluster sensor networks,” in Proc. Int.
Symp. Information Processing in Sensor Networks, pp.
309-316.
[15] Yu, J. Y., Chong, P. H. J., 2003 “3hBAC (3-hop between
adjacent cluster heads): a novel non-overlapping clustering
algorithm for mobile ad hoc networks,” in Proc. IEEE
PACRIM Conf., pp. 318-321.
[16] Gunter, Y., Wiegel, B., Grossmann, H. P., 2007
“Cluster-based medium access scheme for VANETs,” in
Proc. IEEE Intelligent Transportation, pp. 343-348.
8. International Journal of Networks and Communications 2016, 6(4): 72-79 79
[17] Stefan Ruehrup, Paul Fuxjaeger, Dieter Smely, Nov 2014
“TCP-like congestion control for broadcast channel access in
VANETs”, in International Conference on Connected
Vehicles and Expo (ICCVE).
[18] Jyotsna Rao Dawande, Sanjay Silakari and Anjana Jayant
Deen, Dec 2015 “Enhanced Distributed Multi-Hop
Clustering Algorithm for VANETs Based on Neighborhood
Follow (EDMCNF) Collaborated with Road Side Units”, in
International Conference on Computational Intelligence and
Communication Networks (CICN).