The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and authentic data transfer. During real-time data transfer, to make communication effective, we make use of bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance networks. In our proposed model we are concentrating on the maximum utilization of resources, and using the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources. Our simulation result also shows that our model improves the network performance.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
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.
MULTI-HOP BANDWIDTH MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKSIJMIT JOURNAL
An admission control scheme should play the role of a coordinator for flows in a data communication network, to provide the guarantees as the medium is shared. The nodes of a wired network can monitor the medium to know the available bandwidth at any point of time. But, in wireless ad hoc networks, a node must consume the bandwidth of neighboring nodes, during a communication. Hence, the consumption of bandwidth by a flow and the availability of resources to any wireless node strictly depend upon the neighboring nodes within its transmission range. We present a scalable and efficient admission control scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS requirements
in multi-hop ad hoc networks. We simulate several options to design MBMP and compare the performances of these options through mathematical analysis and simulation results, and compare its effectiveness with the existing admission control schemes through extensive simulations.
DATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKSEditor IJMTER
Hybrid networks are next generation of wireless networks that could be a
combination of Mobile wireless adhoc (MANET) networks and Wireless Infrastructure
networks. They are increasingly utilized in wireless communications that are extremely
supporting real time transmission with restricted Quality of Service. Invalid reservation and
race condition issues happens in MANET. In existing system, QoS-Oriented Distributed
routing protocol (QOD) is employed to boost the QoS support capability of hybrid networks,
it transforms the packet routing problem to resource scheduling problem that has 5
algorithms. They are, QoS guaranteed neighbor selection algorithm, Distributed packet
scheduling algorithm, Mobility based segment resizing algorithm, Traffic redundant
elimination algorithm and Data redundancy elimination based transmission algorithm. The
main drawback of hybrid networks is so far examined in minimum transmission hops and has
less beneficial feature with restricted number of mobile access points, mobility speeds, and
mobile workloads and with different network sizes. It will extremely perform on random
way point model and less in real mobility model. This paper present Data Transparent
Authentication to authenticates data streams by adjusting interpacket delay. Data Transparent
Authentication while not Communication overhead is an approach which reduces breakdown
of original information or sends out of band authentication data.
In this project, we proposed a framework to support heterogenous traffic with different QoS demand in
WiMAX. This framework dynamically changes the bandwidth allocation (BA) for ongoing and new arrival
connections based on network condition and service demand. The objective is to efficiently use the
available bandwidth and provide QoS support in a fair manner. Dynamic allocation of spectrum prior to
transmission can mitigate the starvation problem of Non Real time application. The WFQ based dynamic
bandwidth allocation framework uses architecture that has packet scheduler scheme (PS), call admission
policy and a dynamic bandwidth allocation mechanism. By the simulation result we have showed that this
architecture could provide QoS support by being fair to all classes of services.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
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.
MULTI-HOP BANDWIDTH MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKSIJMIT JOURNAL
An admission control scheme should play the role of a coordinator for flows in a data communication network, to provide the guarantees as the medium is shared. The nodes of a wired network can monitor the medium to know the available bandwidth at any point of time. But, in wireless ad hoc networks, a node must consume the bandwidth of neighboring nodes, during a communication. Hence, the consumption of bandwidth by a flow and the availability of resources to any wireless node strictly depend upon the neighboring nodes within its transmission range. We present a scalable and efficient admission control scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS requirements
in multi-hop ad hoc networks. We simulate several options to design MBMP and compare the performances of these options through mathematical analysis and simulation results, and compare its effectiveness with the existing admission control schemes through extensive simulations.
DATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKSEditor IJMTER
Hybrid networks are next generation of wireless networks that could be a
combination of Mobile wireless adhoc (MANET) networks and Wireless Infrastructure
networks. They are increasingly utilized in wireless communications that are extremely
supporting real time transmission with restricted Quality of Service. Invalid reservation and
race condition issues happens in MANET. In existing system, QoS-Oriented Distributed
routing protocol (QOD) is employed to boost the QoS support capability of hybrid networks,
it transforms the packet routing problem to resource scheduling problem that has 5
algorithms. They are, QoS guaranteed neighbor selection algorithm, Distributed packet
scheduling algorithm, Mobility based segment resizing algorithm, Traffic redundant
elimination algorithm and Data redundancy elimination based transmission algorithm. The
main drawback of hybrid networks is so far examined in minimum transmission hops and has
less beneficial feature with restricted number of mobile access points, mobility speeds, and
mobile workloads and with different network sizes. It will extremely perform on random
way point model and less in real mobility model. This paper present Data Transparent
Authentication to authenticates data streams by adjusting interpacket delay. Data Transparent
Authentication while not Communication overhead is an approach which reduces breakdown
of original information or sends out of band authentication data.
In this project, we proposed a framework to support heterogenous traffic with different QoS demand in
WiMAX. This framework dynamically changes the bandwidth allocation (BA) for ongoing and new arrival
connections based on network condition and service demand. The objective is to efficiently use the
available bandwidth and provide QoS support in a fair manner. Dynamic allocation of spectrum prior to
transmission can mitigate the starvation problem of Non Real time application. The WFQ based dynamic
bandwidth allocation framework uses architecture that has packet scheduler scheme (PS), call admission
policy and a dynamic bandwidth allocation mechanism. By the simulation result we have showed that this
architecture could provide QoS support by being fair to all classes of services.
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.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
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.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
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.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
One of the key challenges for research in wireless sensor networks is the development of routing protocols that provide application-specific service guarantees. This paper presents a new cluster-based Route Optimisation and Load-balancing protocol, called ROL, that uses various quality of service (QoS) metrics to meet application requirements. ROL combines several application requirements, specifically it attempts to provide an inclusive solution to prolong network life, provide timely message delivery and improve network robustness. It uses a combination of routing metrics that can be configured according to the priorities of user-level applications to improve overall network performance. To this end, an optimisation tool for balancing the communication resources for the constraints and priorities of user applications has been developed and Nutrient-flow-based Distributed Clustering (NDC), an algorithm for load balancing is proposed. NDC works seamlessly with any clustering algorithm to equalise, as far as possible, the diameter and the membership of clusters. This paper presents simulation results to show that ROL/NDC gives a higher network lifetime than other similar schemes, such Mires++. In simulation, ROL/NDC maintains a maximum of 7\% variation from the optimal cluster population, reduces the total number of set-up messages by up to 60%, reduces the end-to-end delay by up to 56%, and enhances the data delivery ratio by up to 0.98% compared to Mires++.
Quality of Service Stability Based Multicast Routing Protocol for MANETsCSEIJJournal
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.
QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETScseij
ABSTRACT :
Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route Maintenance.
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.
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.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
More Related Content
Similar to Adaptive Bandwidth Management Model for Wireless Mobile Ad-hoc Network
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.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
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.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
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.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
One of the key challenges for research in wireless sensor networks is the development of routing protocols that provide application-specific service guarantees. This paper presents a new cluster-based Route Optimisation and Load-balancing protocol, called ROL, that uses various quality of service (QoS) metrics to meet application requirements. ROL combines several application requirements, specifically it attempts to provide an inclusive solution to prolong network life, provide timely message delivery and improve network robustness. It uses a combination of routing metrics that can be configured according to the priorities of user-level applications to improve overall network performance. To this end, an optimisation tool for balancing the communication resources for the constraints and priorities of user applications has been developed and Nutrient-flow-based Distributed Clustering (NDC), an algorithm for load balancing is proposed. NDC works seamlessly with any clustering algorithm to equalise, as far as possible, the diameter and the membership of clusters. This paper presents simulation results to show that ROL/NDC gives a higher network lifetime than other similar schemes, such Mires++. In simulation, ROL/NDC maintains a maximum of 7\% variation from the optimal cluster population, reduces the total number of set-up messages by up to 60%, reduces the end-to-end delay by up to 56%, and enhances the data delivery ratio by up to 0.98% compared to Mires++.
Quality of Service Stability Based Multicast Routing Protocol for MANETsCSEIJJournal
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.
QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETScseij
ABSTRACT :
Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route Maintenance.
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.
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.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
How to Create Map Views in the Odoo 17 ERPCeline George
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
How to Split Bills in the Odoo 17 POS ModuleCeline George
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
This is a presentation by Dada Robert in a Your Skill Boost masterclass organised by the Excellence Foundation for South Sudan (EFSS) on Saturday, the 25th and Sunday, the 26th of May 2024.
He discussed the concept of quality improvement, emphasizing its applicability to various aspects of life, including personal, project, and program improvements. He defined quality as doing the right thing at the right time in the right way to achieve the best possible results and discussed the concept of the "gap" between what we know and what we do, and how this gap represents the areas we need to improve. He explained the scientific approach to quality improvement, which involves systematic performance analysis, testing and learning, and implementing change ideas. He also highlighted the importance of client focus and a team approach to quality improvement.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Adaptive Bandwidth Management Model for Wireless Mobile Ad-hoc Network
1. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
DOI: 10.5121/ijcnc.2023.15106 87
ADAPTIVE BANDWIDTH MANAGEMENT MODEL
FOR WIRELESS MOBILE AD-HOC NETWORK
Nibedita Jagadev1
,Binod Kumar Pattanayak1
,Ahmadkhader habboush2
, Bassam
Mohammad Elzaghmouri3
, Mahmoud Ali Al Shugran2
1
Department of Computer Science and Engineering, Siksha’O’ Anusandhan Deemed to
be University, Odisha, India.
2
Department of Computer Networks, Faculty of Computer Science and Information
Technology, Jerash University, Jerash, Jordan
3
Department of Computer Science, Faculty of Computer Science and Information
Technology, Jerash University, Jerash, Jordan
ABSTRACT
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current
network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network
resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient
mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidth-
sharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and
authentic data transfer. During real-time data transfer, to make communication effective, we make use of
bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance
networks. In our proposed model we are concentrating on the maximum utilization of resources, and using
the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to
reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources.
Our simulation result also shows that our model improves the network performance.
KEYWORDS
Quality of service (QoS), Ad-Hoc Networks, Available bandwidth estimation, Bandwidth Reservation
Demand, bandwidth estimator, AODV
1. INTRODUCTION
Ad hoc network consists of self-governing, autonomous wireless mobile nodes. The absence of
fixed infrastructure and topology change due to node mobility makes communication more
difficult. Hence multi-hop communication satisfying the QoS demands for this type of network is
a challenging task [1]. So the development of wireless communication networks and satisfying
the demand for transmission of multimedia traffic in MANET is becoming a crucial task
nowadays in such networks. The uniqueness of a Mobile multi-hop wireless network is that it
needs to focus on certain difficulties such as random link characteristics, node mobility,
inadequate battery span, and so on [2]. In these years, research on QoS support also has gathered
more and more prominence in MANET. This incorporates matters related to QoS MAC
protocols, QoS signalling, QoS model, QoS routing, etc.
In this work, we have proposed a simple, distributed, and stateless network model with BRD
(bandwidth reservation demand) to dynamically manage the accepted real-time traffic. In our
2. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
88
model in-between nodes do not keep track of traffic information. Therefore the network overhead
will be less. Topology change and link failure don't affect its performance which makes our
model simple, robust, and scalable. The bandwidth management approach along with source-
based admission control ensures facilitates the throughput and manages the delay requirements of
the real-time traffic.
The performance evaluation of the proposed QoS model in varied network flows has been
demonstrated. A well-organized QoS model can provide a robust communication channel,
improved QoS performance with a resource reservation facility, and minimum end-to-end delay
[3]. Our model focuses on the bandwidth parameter, which is a basic parameter for admission
control, flow management, congestion control, etc. There are two types of traffic flows. The first
one is the QoS flow which incorporates multimedia data, videos, real-time traffic, etc. This type
of flow needs guaranteed bandwidth reservation. The second one is the best-effort traffic which
is not restricted by any kind of bandwidth guarantee. The proposed QoS model can distinguish
the flows into classes and offers adequate bandwidth and fewer delay guarantees to high-priority
flows [4].
Existing work emphasizes QoS routing which finds the shortest path to meet the preferred
requirements of a flow. Here we have considered a combination of QoS flow and the best effort
flow. To enhance the quality of service (QoS) guarantee two common procedures used are
admission control and resource reservation. With the arrival of new flows the intelligent agent at
the source node searches for the availability of required resource by the new flow. If the required
basic resources are accessible then the transmission begins along the reserved path linking the
source and destination. In this work, we are focusing on the available bandwidth which is the
performance requirement of a flow.
In our model we are concentrating on the maximum utilization of resources, so using the
scheduling concept minimum required bandwidth guarantee has been given to QoS flows and a
fair portion of residual bandwidth is shared among all other flows. Section 2 explains the
background study on different QoS models. The network strategy and proposed Bandwidth
Management System are described in Section 3-4. Section 5 describes network analysis and
problem formulation. Section 6-7 describes the result discussion and conclusion.
2. RELATED WORK
In a wireless ad-hoc network, considerable research has been carried out to provide QoS service
amenities. Significant relevant sources for the presented studies have included different issues
related to QoS support of MANET. Bandwidth management for optimized resource utilization has
received significant attention in recent times. The QoS model for MANET has extended the
conventional Internet models to make them suitable for MANET. To provide QoS assurance
different basic architectures are proposed such as integrated services (IntServer) [5], Differentiated
services (Diffserv) [6], INSIGNIA [7], and a stateless network model [8].
Maintenance of per-flow information amplifies with the high traffic input in the case of IntServ in
which a large database and a high managing cost on routers. The principle of DiffServ is to use the
priority scheme to eradicate the complexity of executing and arranging IntServ and RSVP on web.
Due to the dynamic nature and inadequate resources of MANET, so providing QoS services is
intricate in case of instantaneous-varying conditions.
Agbaria et al. [9] have proposed a novel bandwidth approach in which the bandwidth allocation
and requirements are considered only for 2-hop neighbors. The proposed approach is incorporated
into AODV protocol and it gives low latency and advanced reliability. This work doesn't support
communication beyond 2-hop neighbors. A QoS routing protocol focused on an on-demand
protocol M-QoS –AODV which integrates a channel assignment scheme and route discovery
3. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
89
process to support QoS service in MANET [10]. This protocol gives reduced delay performance
by using a deterministic method than AODV and M-AODV-R protocols. The performance can be
improved by reusing the channel. An Adaptive bandwidth management protocol (LANMAR) has
been emphasized on a large-scale network by incorporating MBNs structure to boost network
performance by Xu et al. [11].
A flexible QoS model (FQMM) has been framed by Xiao et al [12]. In FQMM a hybrid per-flow
and per-class provisioning provide better throughput performance in small to medium-size
MANET. But this model is unable to handle more complex network scenarios. Youn and Hong
[13] have developed a novel admission control protocol DACP that can calculate available
bandwidth in each node and at the MAC layer so that it can allow the new flow on a per-hop basis.
DACP reduces control overhead and provides the end-to-end resource. A dynamic bandwidth
management system has been suggested by Shah et al.[14] to control the data traffic. This scheme
can provide a share of channel time to each flow according to its requirement using the max-min
fairness algorithm. By using this model the flows can get the lowest amount of requested
bandwidth from the available network bandwidth. To regulate the best-effort traffic and accept
more numbers of QOS flow a cross-layer protocol DRBT was put forward by Khalfallah et al.[15].
This protocol decreases the throughput of the best effort flow to guarantee maximal use of radio
link but this protocol can't handle the carrier sensing mechanism and can't deal with mobility.
DCDR (Dynamic Congestion Detection and Control Routing) [16,17] dynamically deals with
congestion detection and a warning is sent to the neighboring nodes. After receiving the message
the neighbors become alert and search for some other alternate path to the destination. Here the
shortcoming is if the network traffic is high then the packet loss although reduced but still there.
According to Al-Dhief et al. [2], the Cost and Bandwidth constraints can be optimized with GA in
a multi-state computational grid network. A node location is predicted by using a hybrid model
with the help of path diversion so that routing performance can be enhanced instead of larger
packet overhead [18,19].
3. BANDWIDTH MANAGEMENT SYSTEM
One of the shared resources which get accessed by various neighboring nodes in a wireless
network is Bandwidth. So, always there is a requirement for bandwidth management which can
coordinate among the nodes who share the wireless channel.
In MANET the traffic characteristic and the network topology change recurrently because of its
dynamic nature. So before admission of any new flow, one-time admission control in the source
node by the centralized Bandwidth Manager is required. The bandwidth manager registers each
flow before the commencement of its transmission. Each flow has been assigned a minimum
bandwidth requirement of Bmin(f) and a maximum bandwidth requirement of Bmax(f) [14].
According to the requirement of any flow, the exact share of bandwidth is to be allotted to that
flow at the establishment of the connection. If the Bandwidth Manager is unable to provide a fair
amount of bandwidth then it refuses to admit the new flow. Therefore the Bandwidth Manager at
the source node along with the admission control carries out dynamic bandwidth management to
locate the amount of accessible bandwidth in the network.
4. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
90
4. ARCHITECTURE OF ADAPTIVE BANDWIDTH MANAGEMENT MODEL
(ABMM)
Figure 1. Architecture of Adaptive Bandwidth Management Model.
The Adaptive Bandwidth Management Model (ABMM) includes various modules for the
regulation of the traffic flow at the source node. The proposed novel architecture of ABMM
consists of four basic components, to be precise, total bandwidth estimator, admission controller
(intelligent agent), classifier, and the adaptation module.
The bandwidth estimator collects information about available bandwidth from the intermediate
nodes with the help of control packets. The intermediate nodes do not maintain any information
regarding the session only provide information about available bandwidth. Available bandwidth
means the difference between the actual bandwidth and the exhaust of bandwidth usage of other
flows. With the updated information from the intermediate nodes, the bandwidth estimator can
efficiently detect locally available bandwidth before a new call admission. The admission
controller decides based on the retrieved information from the bandwidth estimator to accept or
reject any new flow. Then the classifier differentiates the flows and the scheduler schedules them
according to their priority.
The adaptation module has a great deal of importance for our QoS architecture. In MANET,
although admission control is performed to provide guaranteed bandwidth reservation due to the
mobility and dynamic nature of the network to avoid congestion and provide a satisfactory
quality of service the adaptive bandwidth management component is essential. Once a real-time
session is accepted it is vital to preserving the service quality and this is the foremost task of the
bandwidth adaptation module. The transmission delay for each flow is determined by the rate
controller. The admission controller will assign the maximum needed bandwidth to a flow when a
flow is introduced. In case of network congestion the adaptation module renegotiates with the
existing flows and reallocation of the flows takes place.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
91
When there is more demand for bandwidth with the increase in the number of flows the BM will
ask the low-priority flows to release the maximum bandwidth assigned to them and work with
their minimum need, so that it can be assigned to the flows having higher priority. If still the
existing resources are not adequate for the new flow then the BM will pause some of the least
priority flows to release resources. In this way, the BM can avoid the reservation of the flows
having the least priority. Here we are using a bandwidth-sharing network design. Bandwidth
sharing can provide considerable cost reduction in comparison to other bandwidth reservation
algorithms. For working on ABMM, we have proposed the bandwidth reservation algorithm
which computes the reservation options with maximum efficiency and earliest completion time.
4.1. Algorithm
Input –Flow (data packet, size, start time, end time)
Output –Bandwidth Management (less delay, throughput, routing)
Input flow into the Admission Controller
4.2. Proposed algorithm for Bandwidth Estimator
Input: QoS routing information
Output: Keeps updated information about network such as ; bandwidth availability
For all the incoming flow
Get the bandwidth available
If
The bandwidth available is less than required minimum
Repeat step 1 and 2 for each new session
Step1.Send probe / control packet
Step2.Receives the information about bandwidth availability
Else
Assign the available bandwidth
Step 3.End
4.3. Proposed algorithm for Bandwidth Adaptor
Input: Flow ()
Output: Adequate bandwidth availability
Step 1.Assign min. Bandwidth to low priority flow
Step 2.Check the adequacy of bandwidth
If “no”
choose some low priority flow to be “paused “
else
send notification to the admission controller about availability
Step 3.End
5. NETWORK ANALYSIS AND PROBLEM FORMULATION
Here we are considering a set of nodes as 'N' and a set of links as "L" to represent a scheduling
network scenario. We have represented BRD (Bandwidth Reservation Demand) as R(NS, ND,
Bmax, M,ts,tf,p) where NS is the source node, ND is the destination node, Bmax is the
maximum bandwidth available, M total size of data to be transferred in Mbps, within a period of
starting time and finishing time tf with the flow priority p. In figure 2, we are illustrating a
simplified topology T' with a high-performance scheduling network. In T'=(A,B,C.D) are the
nodes and L=L1,L2,L3,L4,L5are the connecting links. The values on the corresponding link
6. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
92
signify the availability of bandwidth. At a certain point in time, the source node receives a
request with Bandwidth Request Demand as M(A, D,400MBs, 1200MB,0, 10s)
5.1. Scenario1: Scheduling of a flow on available Bandwidth without considering
the priority
Figure 2. Topology of scheduling Network
If a BRD can be scheduled means the bandwidth demand can be fulfilled it is referred as a
feasible reservation (FR) and is represented as FR(NS,ND, P, BW, M,ts, tf,L)
Where,
NS= the source node
ND=Destination node
P = path
BW=Bandwidth Reserved
ts=starting time
tf=Finishing time
L = qualified link
BW ≤ Bmax , ts < tf
Figure 3. Available bandwidth on each link
L4
C
A
L1
L5
700MB/s)
L3
900MB/s)
L2
500M
B/s
800MB/s)
600MB/s)
D
B
Flow1(𝐴, 𝐷, 400 𝑀𝐵
𝑠
⁄ , 1200𝑀𝐵, 0, 10𝑠)
7. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
93
We have defined the longest time slot as the period during which the link bandwidth of a
considered path remains unaltered. According to the availability of bandwidth, 4-time slots are
found in figure 3 i.e. (0,3s),(3,5s),(5,7s),(7,10s). A time window may consist of one or many time
slots.
The minimum time required to transfer data of size M is tmin which is calculated as MBmax. The
minimum bandwidth required for a FR to transfer 'M' amount of data in a time period of (tf-ts) is
M(tf-ts).
Example:
For a FR (A,D,400MBs, 1200MB,0, 10s), the minimum bandwidth is required 1200(10-
0)=120MB/s.
Figure 3 represents the time windows of the scheduling network within (0,10s). The BRA
algorithm can select a path with a substantial amount of required bandwidth and the least time
duration for transmission of a message from the source node to the destination node
There are more than one-time window during (0, 10 s) which is (0s, 3s), (0s, 5s), (0, 7s), (3s,
10s), (5s, 7s), (5, 10s), (7s, 10s). With the given network topology, as the Bandwidth Reservation
Demand is MA,D,400MBs, 1200MB,0, 10s. The minimum bandwidth is 120 MB/s. So no edge
will be removed from the edge set on the basis of minimum bandwidth. So the edge has to be
removed on the basis of the minimum required time. The minimum time required to transfer
1200MB of data at a rate of 400MBs is 3s. So (0s, 5s), (0, 7s), (3s, 10s), (5s, 7s), (5, 10s) is
removed as the time duration is more than 3s. From the remaining time windows, L1 has the
largest available bandwidth i.e. 500MB/s in the time slot (0s, 3s). So the link L1 will be
considered for the scheduling which will accomplish the flow within the minimum time. The
advantage of bandwidth sharing is discussed in the 2nd scenario by considering different kinds of
flows such as Real-time flow, multimedia flow, and best-effort flow.
5.2. Scenario 2: Scheduling of a flow on available Bandwidth considering the
priority of the flow
Figure 4. Topology of scheduling Network with a Real time flow
In the second scenario in figure 4 we have considered the priority of the flow. In addition to the
first scenario suppose we have received real-time data. Always real-time data has the highest
priority over multimedia and best-effort flows. So we have to rearrange the sequence of the flow
in order that the real-time data can get the maximum bandwidth if the available bandwidth is not
adequate. Rescheduling can be done by withdrawing the allocated bandwidth from the existing
low-priority incomplete flows.
8. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
94
For an instance suppose a real-time BRD (A,D,600MBs, 1800MB,0, 5s) arrived. From fig.4 it
can be observed the available bandwidth of the different links. The time window during (0, 10 s)
which is (0s, 3s), (0s, 5s), (0, 7s), (3s, 10s), (5s, 7s), (5, 10s), (7s, 10s). The minimum bandwidth
required for the new real-time flow is 1800/ (5-0) = 360 MB/s. The minimum time required to
transfer 1800MB of data at a rate of 600MBs is 3s. If we will consider a link from the available
bandwidth, on the basis of minimum bandwidth only L5 is eligible. But as it's a real-time flow
always it will be assigned with the maximum possible bandwidth i.e. 600MB/s.
Figure 5. Available bandwidth on each link during a new real time flow
Hence all previous BRDs which are using link L1 will release the maximum assigned bandwidth
and will use their minimum required bandwidth. If still the existing resources are not adequate for
the new real-time flow then the BM will pause some of the least priority flows to release
resources.
6. PERFORMANCE ANALYSIS
Here the devised QoS model is evaluated using simulation. The network attainment is compared
with or without our developed model. The primary output considered for performance evaluation
is throughput i.e. the packets delivered and the secondary is end–to–end delay calculation.
The proposed FBRA technique is implemented by using MATLAB simulator with a network
range of 1000*1000 m size and mobile nodes varied from 50 to 500 in steps of 50. The time
frame for the scheduling is stipulated from 0 to 200 s. Due to the mobility of the nodes, the
proposed ABMM model uses the random waypoint as a mobility model. In this simulation, we
will examine the performance of the proposed method with different flows with unlike bandwidth
demands and a varied number of nodes.
0
100
200
300
400
500
600
700
800
900
1000
0 1 2 3 4 5 6 7 8 9 10
L1 L2 L3 L4 L5
Time(s)
Available
Bandwidth
(MB/s)
9. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
95
For our analysis, we have considered that several BRD's are assembled through this period.
Bmax is the bandwidth value between 1 to 100 mbps and 20J initial energy. The total data to be
transferred through the qualified link varies according to the BRD. The priority of the flow is
considered between1 to 3. The real-time flow is given the highest priority which is 1, the
multimedia flow and best-effort flow is given priority 2 and the 3 respectively.
Here we have considered the mobility of the node to be constant during a particular scheduling
period. The real-time flow is emulated using CBR traffic. While we consider the QoS scheme the
network becomes more heavily congested than its non-QoS counterpart. So, to improve the
performance some of the low-priority flows may get discarded to maintain the service quality.
From figure 6 and 8, we can observe that with the amplification of flow in the network, the data
packet delivery fraction is decreased and end-to-end delay is increased with general scheduling
algorithms like FIFO, priority queue algorithm, and weighted fair queue (WFQ) algorithm. We
can deduce from the graph that our proposed algorithm gives improved results in comparison to
general scheduling algorithms.
6.1. Performance Analysis of Delay
Table 1 lists the simulation results of the average end-to-end delay for the number of data packets
sent or the number of flows. As shown in Table 1, the delay increases with the increase in the
number of data packets sent from the source node. However, the proposed ABMM Model
reduces the delay than the other existing techniques due to the adaptive resource-sharing
technique.
Table 1. Performance matrix comparison for end to-end delay
Load (kbps) BRA FIFO PQ WFQ
60 0.0661 0.0732 0.0693 0.07
50 0.0685 0.08011 0.072 0.0734
40 0.0729 0.0888 0.0762 0.0778
30 0.0784 0.0931 0.0854 0.0861
20 0.0857 0.101 0.0907 0.091
10 0.10349 0.123 0.1191 0.11379
10. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
96
Figure 6. End to-end delay Comparison with Load
Figure 6 shows the plot of delay versus load for the three techniques. Through the proposed
FBRA technique, the data packets from the source node to the destination node are effectively
transmitted with less time consumption. By selecting the best neighboring node with the highest
residual bandwidth, the optimal route path is determined in order to successfully route the data
packets to the destination from the source node in MANET with minimal time. Hence, the end-
to-end delay also gets reduced.
Due to the focus on scheduling and reservation of bandwidth different flows in our model have
been assigned to different priority queues which can be served with different possibilities. Here
the low-priority flows are served with a lower probability than the high-priority flows. Figure 6
depicts that with the surge of network load, the delay observed by FIFO will be highest as there is
no concept of priority given to any of the flows. We can observe from the graph that in the case
of priority and WFQ the resources cannot be utilized properly but in the FBRA the end-to-end
delay dropped prominently due to the concept of resource sharing.
Before beginning the communication the pair of communicating processes establishes a
connection which results in less delay. For a particular time frame, we consider the topology to
be static. From the graph obtained we can conclude that our derived algorithm FBRA gives
improved results than FIFO, Priority, and WFQ algorithms.
6.2. Performance Analysis of Packet Delivery Ratio
The packet delivery ratio is measured in terms of percentage (%). A higher value of packet
delivery ratio ensures better performance of the system. Table 2 lists the values of the packet
delivery ratio for the number of data packets sent in MANET for four different techniques. The
number of data packets sent is varied from 10 to 60 in step 10. As shown in Table 2, the proposed
model provides better results in packet delivery ratio than the other existing techniques first in
first out (FIFO), Priority Queue (PQ), and weighted fair queue (WFQ) algorithm.
11. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
97
Table 2 . Performance matrix comparison for Packet Delivery Ratio
Load (kbps) BRA FIFO PQ WFQ
10 0.908 0.827 0.844 0.87
20 0.9 0.794 0.837 0.86
30 0.88 0.7705 0.8302 0.859
40 0.862 0.7247 0.829 0.846
50 0.859 0.702 0.828 0.83
60 0.85 0.685 0.821 0.827
Figure 7. Packet Delivery Ratio Comparison with Load
Figure 7 shows the plot of the packet delivery ratio versus the number of packets sent or load for
the proposed ABMM model and the existing techniques as FIFO, PQ, and WFQ. It reveals that
the proposed FBRA technique provides a better improvement in the packet delivery ratio than the
other existing techniques. This is because the proposed ABMM technique uses FBRA algorithm
for finding the resource-optimized route path from the source node to the destination node. This
is done by selecting less delay and high residual bandwidth mobile nodes among the large
quantity of mobile nodes between the source and the destination node and then routing using the
resource-optimized route path. Hence, the chances of data loss get minimized while routing the
data packets and the packet delivery ratio at the destination node is improved. The packet
delivery ratio is improved in the proposed ABMM model up to 37% on average compared to the
FIFO protocol and 27% compared to the WFQ protocol.
12. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
98
In our model, various traffic flows have been considered with varied priorities by the scheduler
so the flows perform with different packet loss rates. Figure 7 describes the performance of the
Packet Delivery Ratio with the change in network load. The proposed algorithm presents
enhanced packet delivery results as compared to other algorithms since the priorities of the
considered flows are different. The higher priority flow results in lower packet loss as they are
assigned with the required bandwidth.
6.3. Performance Analysis of Bandwidth Utilization Rate
The bandwidth utilization rate is defined as the ratio of the amount of bandwidth consumed to the
total available bandwidth while routing the data packets from source to destination node. The
Bandwidth Utilization Rate BUR is mathematically expressed
𝐵𝑈𝑅 =
Utilized bandwidth
Total available bandwidth
(1)
The bandwidth utilization rate is measured in terms of percentage (%). The lower value of the
bandwidth utilization rate ensures better performance of the technique.
Table 3 lists the values of the % bandwidth utilization rate for the number of data packets sent in
MANET. The number of data packets sent varied from 10 to 60 in step 10. While routing the data
packets between the source node and the destination node, the bandwidth utilization rate is
increased by using the proposed FBRA technique than the existing techniques.
Table 3. Performance matrix comparison for bandwidth utilization (%)
Load (kbps) BRA FIFO PQ WFQ
10 80.8 70.71 73.7 76
20 76.24 63.1 69.4 70.1
30 73.78 60.72 59.78 62.78
40 69.81 58.52 59.2 60.1
50 64.12 55.9 56.7 57.3
60 60 55.421 52.5 52.9
13. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
99
Figure 8. Bandwidth utilization Comparison with Load
Figure 8 shows the plot of bandwidth utilization rate versus number of packets sent using the four
techniques. It is observed that the proposed FBRA technique ensures a better enhancement in the
bandwidth utilization rate than the other existing techniques. This is because, the proposed FBRA
technique selects the links with maximum bandwidth and less delay for transmitting the data
packets in a resource optimized route path. This helps to increase the bandwidth utilization rate
for routing the data packets between the source and the destination node.
Fig 8 explains the effect on bandwidth utilization while there is a change in network load. The
above graph gives an idea about proper utilization of bandwidth as compared to FIFO, priority
and WFQ algorithm. The bandwidth manager reschedules the bandwidth and distributes it among
the flows depending on the priority.
6.4. Performance Analysis of Routing Stability
The routing stability is defined as the ratio of number of mobile nodes with high bandwidth that
are addressed to the total number of mobile nodes in MANET. The Routing Stability ‟RS‟ is
mathematically expressed as
𝑅𝑆 =
Number of mobile nodes high energy and bandwidth that are addressed
Total number of mobile nodes
(2)
The routing stability is measured in terms of percentage (%). The high value of routing stability
provides better performance of the technique.
14. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
100
Table 4. Performance matrix comparison for Routing Stability (%)
Numbers of Nodes BRA FIFO PQ WFQ
50 81 55 62 69
100 84 56 63 73
150 86 59 67 75
200 89 63 69 76
250 90 67 72 79
300 93 70 73 82
Figure 9. Routing Stability (%) Comparison with Load
Table 4 list the values of the percentage of routing stability in the four techniques. It can be
observed that it increases gradually with the increase in the number of mobile nodes. The
improvement in FBRA technique is better than the existing FIFO, PQ, and WFQ methods. Due to
the effective resource optimization, the proposed FBRA technique attains stable routing for
transmitting the data packets more than the other existing techniques.
Figure 9 shows the plot of routing stability versus the number of mobile nodes for the proposed
ABMM model and the existing techniques such as FIFO, PQ, and WFQ and it is observed that
the proposed technique ensures better improvement in the routing stability than the other existing
techniques. This is due to the application of FBRA algorithm in the proposed ABMM model. The
selection of a mobile node with higher remaining bandwidth is achieved to ensure the resource-
optimized route path between mobile nodes. The detection of resource-optimized route paths
ensures the stability for routing the data packets.
7. CONCLUSION
We have proposed a bandwidth reservation model for the proper utilization of resources in
MANETs. In this work, a novel bandwidth reservation model with a bandwidth management
mechanism for the proper utilization of resources in MANETs has been proposed. The proposed
0
10
20
30
40
50
60
70
80
90
100
1 2 3 4 5 6
Routing
Stability
(%)
Number of Nodes
BRA FIFO PQ WFQ
15. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
101
algorithm combines channel rescheduling with routing and can considerably boost the network
throughput, which is used to control congestion. In this technique, the source node forwards the
data packet to the destination node through the intermediate nodes. Based on the percentage of
channel utilization and queue length, the nodes are verified for congestion status. After the
reception of the data packet, the destination node checks for the status of routing nodes in the
defined route. Along with other essential fields, the estimated bandwidth is also copied to an
acknowledgment packet and fed back to the sender. Since the acknowledgment packet transmits
the remaining bandwidth status based on the estimated rate from the intermediate nodes, this
technique is better than the traditional congestion control technique. Based on the various
analyses, it has been shown that the proposed scheme is suitable to control congestion for real-
time and multimedia applications. The proposed FBRA technique is developed for ensuring
routing stability with the reduction of resource utilization among the mobile nodes. Here, the end-
to-end delay and the bandwidth utilization rate are reduced for routing the data packets. The data
packets are then transmitted through the resource-optimized route path from the source node to
the destination node which leads to improved routing stability in MANET. Simulation results
revealed that the proposed FBRA technique has provided higher routing stability, lesser energy
consumption, lesser bandwidth utilization rate, higher packet delivery ratio and higher throughput
than the existing techniques. Hence, stable routing between mobile nodes is achieved with the
reduction of resource (bandwidth) utilization while using the ABMM model. The future scope is
we will implement the algorithm along with the bandwidth management model in large-scale
networks with some Meta heuristic approach.
REFERENCES
[1] Jagadev, N., Pattanayak, B. K., Singh, D., &Sahoo, S., 2018. A survey on bandwidth management in
manet. International Journal of Engineering & Technology, 7(3.4), 38-41.
[2] Al-Dhief, F. T., Sabri, N., Fouad, S., Latiff, N. A., &Albader, M. A. A., 2019. A review of forest fire
surveillance technologies: Mobile ad-hoc network routing protocols perspective. Journal of King
Saud University-Computer and Information Sciences. 31(2), 135-146.
[3] Rath, M., &Pattanayak, B. K. ,2021. Performance evaluation of optimised protocol in
MANET. International Journal of Information and Computer Security, 14(3-4), 318-326.
[4] Panda, N., &Pattanayak, B. K. ,2020. ACO-based secure routing protocols in MANETs. In New
Paradigm in Decision Science and Management,195-206.
[5] Braden, R., Clark, D., Shenker, S., 1994. Integrated services in the internet architecture: an overview.
RFC1633.
[6] Black, D., & Jones, P.,2015. Differentiated services (DiffServ) and real-time communication. RFC
7657, ISSN 2070-1721.
[7] Lee, S. B., Ahn, G. S., Zhang, X., & Campbell, A. T.,2000. INSIGNIA: An IP-based quality of
service framework for mobile ad hoc networks. Journal of Parallel and distributed Computing, 60(4),
374-406.
[8] Ahn, G. S., Campbell, A. T., Veres, A., & Sun, L. H., 2002. SWAN: Service differentiation in
stateless wireless ad hoc networks. In Proceedings. Twenty-First Annual Joint Conferences of the
IEEE Computer and Communications. IEEE, Societies. 2, 457-466.
[9] Agbaria, A., Gershinsky, G., Naaman, N., Shagin, K., 2009. A bandwidth management approach for
quality of service support in mobile ad hoc networks. In 2009 IEEE International Conference on
Pervasive Computing and Communications. IEEE, 1-5.
[10] Zhou, J., Liu, L., Deng, Y.,Huang, S.,2014. A QoS routing protocol with bandwidth allocation in
multichannel ad hoc networks. Wireless personal communications, 75(1), 273-291.
[11] Xu, K., Tang, K., Bagrodia, R., Gerla, M., Bereschinsky, M., 2003. Adaptive bandwidth management
and QoS provisioning in large scale ad hoc networks. In IEEE Military Communications
Conference,(2),1018-1023.
[12] Xiao, H., Seah, W. K., Lo, A., & Chua, K. C. ,2000. A flexible quality of service model for mobile
ad-hoc networks. In VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference
Proceedings, (1), 445-449.
16. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.1, January 2023
102
[13] Youn, J., Pack, S., Hong, Y. G., 2011. Distributed admission control protocol for end-to-end QoS
assurance in ad hoc wireless networks. EURASIP Journal on Wireless Communications and
Networking, (1), 1-18.
[14] Shah, S. H., Chen, K., &Nahrstedt, K., 2005. Dynamic bandwidth management in single-hop ad hoc
wireless networks. Mobile Networks and Applications, 10(1), 199-217.
[15] Khalfallah, S., Sarr, C., &Lassous, I. G., 2007. Dynamic bandwidth management for multihop
wireless ad hoc networks. In 2007 IEEE 65th Vehicular Technology Conference-VTC2007-Spring,
198-202.
[16] Senthilkumaran, T., Sankaranarayanan, V. ,2013. Dynamic congestion detection and control routing
in ad hoc networks. Journal of King Saud University-Computer and Information Sciences, 25(1), 25-
34.
[17] Talau, M., &Wille, E. C. G. (2013). Available network bandwidth schema to improve performance in
TCP protocols. International Journal of Computer Networks & Communications, 5(5), 45.
[18] Farheen, N. S., & Jain, A., 2020. Improved Routing in MANET with Optimized Multipath routing
fine-tuned with Hybrid modelling. Journal of King Saud University-Computer and Information
Sciences.
[19] Baliyan, A., &Pareek, V. (2014). MULTIPATH QOS AWARE ROUTING PROTOCOL FOR
ADHOC NETWORK. International Journal of Computer Networks & Communications, 6(2), 17.
AUTHORS
Nibedita Jagadev is currently pursuing a Ph.D. degree and working as an Assistant Professor in
the Department of Computer Science and Engineering, Siksha'O' Anusandhan Deemed to be
University, Odisha, India. Her research interests include Mobile Adhoc Networks, Big Data
analytics, cloud computing, Machine Learning
Email:nibeditajagadev@soa.ac.in
Dr. Binod Kumar Pattanayak, working as a Professor in Department of Computer Science and
Engineering, Siksha’O’ Anusandhan Deemed to be University, Odisha, India. His research
interests include computer networking, Big Data Analytics, IoT, Compiler Design and Software
Engineering.
Email:binodpattanayak@soa.ac.in
Dr. Ahmad Habboush, working as a Professor Department of networks, Faculty of Computer
Science and Information Technology, Jerash University, Jerash, Jordan. His research interests
include Mobile Adhoc Network, cloud computing.
Email:ahmad_ram2001@jpu.edu.jo
Dr Bassam Mohammad Elzaghmouri, working as a Associate in Department of Computer
Science, Faculty of Computer Science and Information Technology, Jerash University, Jerash,
Jordan. His research interests include computer networking, System Modeling; also he is
interested in electrical networks and computer systems.
Email:b.el-zaghmouri@jpu.edu.jo
Dr. Mahmoud Ali Al Shugran is an associate professor at the Department of computer
science/networking in the Faculty of Computer Science and Information Technology, Jerash
University. Mahmoud's research focuses on Wireless and Mobile Networks, routing protocols
design, Internet of Things and IoT Security. Mahmoud is the author of several articles and
coauthor of other articles in the area of interest. He is currently working on designing a new
position-based routing protocol for VANET.
Email:m.shquran@jpu.edu.jo