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.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
A survey on routing algorithms and routing metrics for wireless mesh networksMohammad Siraj
This document summarizes a survey on routing algorithms and metrics for wireless mesh networks. It discusses the requirements of efficient mesh routing protocols including being distributed, adaptable to topology changes, loop-free, secure, scalable, and supporting quality of service. It reviews several important proactive routing protocols including destination-sequenced distance-vector routing, optimized link state routing, and mesh networking routing protocol. It also discusses reactive routing protocols and examples like dynamic source routing and ad hoc on-demand distance vector routing. Finally, it examines routing metrics and their impact on the performance of wireless mesh networks.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
This document proposes a secured-bandwidth reservation distance vector routing protocol for mobile ad hoc networks (MANETs). It aims to improve quality of service (QoS) parameters like bandwidth reservation while providing security. The protocol is an extension of the Destination Sequence Distance Vector Routing Protocol (DSDV) that additionally reserves bandwidth along routing paths and includes nodes' bandwidth information in routing table updates. It uses an intruder detection method and secure key agreement between source and destination nodes using RSA encryption to authenticate nodes and securely transmit data. The protocol is evaluated through network simulations which show it can authorize nodes, authenticate nodes, ensure non-repudiation and protect message integrity.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
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 QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
A survey on routing algorithms and routing metrics for wireless mesh networksMohammad Siraj
This document summarizes a survey on routing algorithms and metrics for wireless mesh networks. It discusses the requirements of efficient mesh routing protocols including being distributed, adaptable to topology changes, loop-free, secure, scalable, and supporting quality of service. It reviews several important proactive routing protocols including destination-sequenced distance-vector routing, optimized link state routing, and mesh networking routing protocol. It also discusses reactive routing protocols and examples like dynamic source routing and ad hoc on-demand distance vector routing. Finally, it examines routing metrics and their impact on the performance of wireless mesh networks.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
This document proposes a secured-bandwidth reservation distance vector routing protocol for mobile ad hoc networks (MANETs). It aims to improve quality of service (QoS) parameters like bandwidth reservation while providing security. The protocol is an extension of the Destination Sequence Distance Vector Routing Protocol (DSDV) that additionally reserves bandwidth along routing paths and includes nodes' bandwidth information in routing table updates. It uses an intruder detection method and secure key agreement between source and destination nodes using RSA encryption to authenticate nodes and securely transmit data. The protocol is evaluated through network simulations which show it can authorize nodes, authenticate nodes, ensure non-repudiation and protect message integrity.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
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.
This document summarizes a research paper that proposes an energy and bandwidth constrained routing technique for mobile ad hoc networks (MANETs). It presents an available bandwidth measurement algorithm that estimates available bandwidth more accurately by considering node capacity, link utilization, idle time synchronization, collision probability, and overhead from backoff mechanisms. It also proposes a probability-based overhearing method to reduce energy consumption from overhearing without affecting route quality. The techniques are evaluated using NS2 simulations to analyze network performance in terms of quality of service parameters.
This document describes a routing protocol designed for reliable and efficient communication in wireless sensor networks (WSNs). It discusses four existing routing protocols - Gradient-Based Routing (GBR), Gradient Broadcast (GRAB), Dynamic Source Routing (DSR), and Adhoc On-demand Distance Vector Routing (AODV) - and analyzes their performance tradeoffs. It then proposes a new light-weight routing protocol called Efficient and Reliable routing (EAR) that aims to achieve reliable and efficient routing in single-hub and multi-hub WSNs while minimizing energy consumption and communication overhead. The protocol design and operation are explained in detail.
Mtadf multi hop traffic aware data for warding for congestion control in wir...ijwmn
The document summarizes a proposed algorithm called MTADF (Multi Hop Traffic-Aware Data Forwarding) for congestion control in wireless sensor networks. The algorithm uses two potential fields - depth potential field and queue length potential field - to route data packets around congested areas along multiple paths. This helps distribute traffic more evenly and utilize less busy nodes, reducing packet drops and improving throughput compared to existing one-hop routing algorithms. The algorithm constructs the two potential fields independently and then combines them to make dynamic forwarding decisions for data packets. Simulations show the MTADF algorithm performs better than previous work in mitigating congestion.
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
Network parameters impact on dynamic transmission power control in vehicular ...ijngnjournal
the throughput of the wireless vehicular network and decrease the delay of the message communication
between vehicular nodes on the highway. Whenever an event occurs on the highway, the reliability
of the communication in the vehicular network becomes so vital so that event created messages should
reach to all the moving network nodes. It becomes necessary that there should be no interference from
outside of the network and all the neighbor nodes should lie in the transmission range of the
reference vehicular node. Transmission range is directly proportional to the transmission power the
moving node. If the transmission power will be high, the interference increases that can cause higher
delay in message reception at receiver end, hence the performance of the network decreased. In this
paper, it is analyzed that how transmission power can be controlled by considering other different
parameter of the network such as; density, distance between moving nodes, different types of messages
dissemination with their priority, selection of an antenna also affects on the transmission power. The
dynamic control of transmission power in VANET serves also for the optimization of the resources
where it needs, can be decreased and increased depending on the circumstances of the network.
Different applications and events of different types also cause changes in transmission power to enhance
the reachability. The analysis in this paper is comprised of density, distance with single hop and multi
hop message broadcasting based dynamic transmission power control as well as antenna selection and
applications based. Some summarized tables are produced according to the respective parameters of
the vehicular network. At the end some valuable observations are made and discussed in detail. This
paper concludes with a grand summary of all the protocols discussed in it.
Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sen...IOSR Journals
This document proposes a Multihop Multi-Channel Distributed QoS Scheduling MAC scheme (MMDQS-MAC) to improve the performance of wireless sensor networks. MMDQS-MAC supports dynamic channel assignment where each sensor node is equipped with a directional antenna. It aims to decrease collisions and interference, improve overall network performance, and is suitable for low traffic networks. Simulation results show that MMDQS-MAC improves aggregate throughput, transmission success rate, packet delivery ratio, energy efficiency, and end-to-end delay.
A secure qos distributed routing protocol for hybrid wireless networksAAKASH S
The succeeding wireless network is Hybrid Wireless Networks. It can provide Quality of Service
(QoS) requirements in real time transmission for wireless application. But it stream including critical mission
application like military use or emergency recovery. Hybrid wireless networks is unified mobile ad-hoc network
(MANET) and wireless infrastructure networks. It inherits invalid reservation and race condition problem in
Mobile ad-hoc network (MANET). Whereas open medium and wide distribution of node make vulnerable to
malicious attackers in Hybrid wireless networks. How to secure the Quality of Service (QoS) routing in Hybrid
wireless networks. In this paper, we propose a Secure QoS-Oriented Distributed routing protocol (SQOD) to
upgrade the secure Quality of Service (QoS) routing in Hybrid wireless networks. SQOD contain two
contrivances: 1.QoS-Oriented Distributed Routing Protocol (QOD)-to reduce transmission delay, transmission
time. And also increase wireless network transmission throughput. 2. Enhanced Adaptive ACKnowledgment
(EAACK)-implement a new intrusion-detection system for Hybrid wireless networks. It protect Hybrid wireless
networks from attacks that have higher malicious behavior detection rate. Analytical and simulation result
based on the real human mobility mode. SQOD can provide high secure performance in terms of Intrusion detection,overhead, transmission delay.
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
Delay Tolerant Network (DTNs) is a wireless network that experiences frequent connectivity and due to mobility of nodes long duration partitions occurred during transmission of data. DTN has the main feature that there is not full path present from source to destination. In Delay Tolerant Network (DTN), traditional routing protocol for mobile Ad-hoc protocol to be ineffective to extend of message transmission between different nodes. Delay tolerant networks (DTNs) are used in many applications like in deep space communications, under water Acoustic Network, Sparsely Populated Areas Networks Etc. In such network a routing with minimum energy congumption is major issue. In this paper, we try to explore a routing issue in DTN. First energy requirement and routing with their corresponding countermeasures in DTN are explained. Moving nodes in DTN keep the updating of network as well energy at every stage. By using the geographical concept the location of each node is maintained by updating in topology. There are many routing protocols are available for routing purpose in DTN.
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.
This document summarizes a research paper that proposes a novel cross-layer routing technique for mobile ad hoc networks. The technique calculates both signal strength and node mobility to select the most efficient and stable path for data transmission. It aims to improve on traditional ad hoc routing protocols like AODV by considering both link quality metrics from the physical layer (signal strength) and node mobility. The proposed method selects routes based on signal strength if mobility is high, and on traditional hop count if mobility is low, in order to find paths that reduce link failure and improve throughput.
Improving data transmission in the vanet using multi criteria decision making...ijfcstjournal
In vehicular ad
-
hoc networks the packets are sent using multi
-
hop methods and the receiving limit of a
message is gradually extended, but the exponential increment of the number of nodes re
-
broadcasting a
message results in broadcast storm problem in data
broadcasting in this case. Some characteristics like
high speed of nodes, rapid topological changes and repetitive discontinuities have made it difficult
to
design an efficient broadcasting protocol for these networks.
We have offered a novel fuzzy method
based on multi
-
criteria decision
-
making (MCDM) for prioritizing the
vehicles in selection of the most proper neighbor to broadcast data in this paper. With using this f
uzzy
method, the most proper vehicles participate in data broadcasting. The results of
simulation using NS show
that because of selecting the neighboring vehicles with high priority in data broadcasting, the spee
d of
sending the packs is increased and the network load is considerably decreased. This method also
considerably decreases broadca
sting traffic.
Reduce Handover Delay Using the HSBCC Based Buffer Over Flow In Wimax Networkinventionjournals
In wireless networks to improve the competence for event account. Due to the in complete transmission size of nodes, a single path often cannot meet the condition of data transmission. Consequently, multipath show is needed. However, not every path originate by multipath routing algorithms maybe appropriate for conveying image, because a extended routing pathway with a long end to end show delay may not satisfied the time constraint. Furthermore, each data stream includes two kinds of material data handover. We have coming a novel explicit rate-based congestion control method, for supportive requests hand over process. Handover Streaming based Congestion Control (HSBCC), a new adaptive media handover streaming congestion organization in which the assembly packet broadcast rate is adjusted rendering to the active bandwidth share of the connection. They prepare not maintain or continually inform their route tables with the newest route in network. If a node requirements to send a pack to another node then this protocol explorations for the route in an on-demand method and begins the joining in order to communicate and receive the packet. The route detection usually happens by flooding the route application packets throughout the network. It makes sense to simply disregard a packet loss due to random frequency errors than to multiplicatively reduction the current transport rate and it is more suitable to periodically investigation the network during interruption period for a prompt retrieval than to slow down and exponentially increase the retransmission timer.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
Hybrid networks is integrate MANETs and infrastructure wireless networks
It have proven to be a better network structure for the next generation networks
It can act Base station and Ad hoc according to the environment conditions
The widespread use of mobile devices the increasing demand for mobile multimedia streaming services
The future of real time need of high Quality of Service (QoS) support in wireless and mobile networking environments
The QoS support reduces end to end transmission delay and enhances throughput to guarantee the seamless communication between mobile devices and wireless infrastructures
Specifically, infrastructure networks improve the scalability of MANETs, while MANETs automatically establish self-organizing networks, extending the coverage of the infrastructure networks
A QoS oriented distributed routing protocol for Hybrid Wireless Network :Firs...AAKASH S
This document presents an outline for a project on developing a QoS-oriented distributed routing protocol for hybrid wireless networks. It discusses existing work that suffers from overhead and scalability issues. The proposed work incorporates five algorithms to select neighbors, schedule packets, adjust segment size based on mobility, eliminate redundant traffic, and reduce redundant data to improve QoS metrics like transmission delay, throughput, and capacity while reducing overhead. It is claimed that using single-hop transmissions can improve performance by reducing overhead, link failures, and improving QoS.
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
ADAPTIVE BANDWIDTH MANAGEMENT MODEL FOR WIRELESS MOBILE AD-HOC NETWORKIJCNCJournal
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current
network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network
resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient
mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and
authentic data transfer. During real-time data transfer, to make communication effective, we make use of
bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance
networks. In our proposed model we are concentrating on the maximum utilization of resources, and using
the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to
reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources.
Our simulation result also shows that our model improves the network performance.
Adaptive Bandwidth Management Model for Wireless Mobile Ad-hoc NetworkIJCNCJournal
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and authentic data transfer. During real-time data transfer, to make communication effective, we make use of bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance networks. In our proposed model we are concentrating on the maximum utilization of resources, and using the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources. Our simulation result also shows that our model improves the network performance.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
This document analyzes the performance of a neighbor knowledge based broadcast protocol called BCAST in mobile ad hoc networks using network simulator NS-2. It varies the number of data senders (multicast group size) and data sending rate to analyze packet delivery ratio, end-to-end delay, packet loss probability, and network control overhead. The simulation results show that BCAST generally performs well and provides robust performance even with high traffic loads.
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.
This document summarizes a research paper that proposes an energy and bandwidth constrained routing technique for mobile ad hoc networks (MANETs). It presents an available bandwidth measurement algorithm that estimates available bandwidth more accurately by considering node capacity, link utilization, idle time synchronization, collision probability, and overhead from backoff mechanisms. It also proposes a probability-based overhearing method to reduce energy consumption from overhearing without affecting route quality. The techniques are evaluated using NS2 simulations to analyze network performance in terms of quality of service parameters.
This document describes a routing protocol designed for reliable and efficient communication in wireless sensor networks (WSNs). It discusses four existing routing protocols - Gradient-Based Routing (GBR), Gradient Broadcast (GRAB), Dynamic Source Routing (DSR), and Adhoc On-demand Distance Vector Routing (AODV) - and analyzes their performance tradeoffs. It then proposes a new light-weight routing protocol called Efficient and Reliable routing (EAR) that aims to achieve reliable and efficient routing in single-hub and multi-hub WSNs while minimizing energy consumption and communication overhead. The protocol design and operation are explained in detail.
Mtadf multi hop traffic aware data for warding for congestion control in wir...ijwmn
The document summarizes a proposed algorithm called MTADF (Multi Hop Traffic-Aware Data Forwarding) for congestion control in wireless sensor networks. The algorithm uses two potential fields - depth potential field and queue length potential field - to route data packets around congested areas along multiple paths. This helps distribute traffic more evenly and utilize less busy nodes, reducing packet drops and improving throughput compared to existing one-hop routing algorithms. The algorithm constructs the two potential fields independently and then combines them to make dynamic forwarding decisions for data packets. Simulations show the MTADF algorithm performs better than previous work in mitigating congestion.
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
Network parameters impact on dynamic transmission power control in vehicular ...ijngnjournal
the throughput of the wireless vehicular network and decrease the delay of the message communication
between vehicular nodes on the highway. Whenever an event occurs on the highway, the reliability
of the communication in the vehicular network becomes so vital so that event created messages should
reach to all the moving network nodes. It becomes necessary that there should be no interference from
outside of the network and all the neighbor nodes should lie in the transmission range of the
reference vehicular node. Transmission range is directly proportional to the transmission power the
moving node. If the transmission power will be high, the interference increases that can cause higher
delay in message reception at receiver end, hence the performance of the network decreased. In this
paper, it is analyzed that how transmission power can be controlled by considering other different
parameter of the network such as; density, distance between moving nodes, different types of messages
dissemination with their priority, selection of an antenna also affects on the transmission power. The
dynamic control of transmission power in VANET serves also for the optimization of the resources
where it needs, can be decreased and increased depending on the circumstances of the network.
Different applications and events of different types also cause changes in transmission power to enhance
the reachability. The analysis in this paper is comprised of density, distance with single hop and multi
hop message broadcasting based dynamic transmission power control as well as antenna selection and
applications based. Some summarized tables are produced according to the respective parameters of
the vehicular network. At the end some valuable observations are made and discussed in detail. This
paper concludes with a grand summary of all the protocols discussed in it.
Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sen...IOSR Journals
This document proposes a Multihop Multi-Channel Distributed QoS Scheduling MAC scheme (MMDQS-MAC) to improve the performance of wireless sensor networks. MMDQS-MAC supports dynamic channel assignment where each sensor node is equipped with a directional antenna. It aims to decrease collisions and interference, improve overall network performance, and is suitable for low traffic networks. Simulation results show that MMDQS-MAC improves aggregate throughput, transmission success rate, packet delivery ratio, energy efficiency, and end-to-end delay.
A secure qos distributed routing protocol for hybrid wireless networksAAKASH S
The succeeding wireless network is Hybrid Wireless Networks. It can provide Quality of Service
(QoS) requirements in real time transmission for wireless application. But it stream including critical mission
application like military use or emergency recovery. Hybrid wireless networks is unified mobile ad-hoc network
(MANET) and wireless infrastructure networks. It inherits invalid reservation and race condition problem in
Mobile ad-hoc network (MANET). Whereas open medium and wide distribution of node make vulnerable to
malicious attackers in Hybrid wireless networks. How to secure the Quality of Service (QoS) routing in Hybrid
wireless networks. In this paper, we propose a Secure QoS-Oriented Distributed routing protocol (SQOD) to
upgrade the secure Quality of Service (QoS) routing in Hybrid wireless networks. SQOD contain two
contrivances: 1.QoS-Oriented Distributed Routing Protocol (QOD)-to reduce transmission delay, transmission
time. And also increase wireless network transmission throughput. 2. Enhanced Adaptive ACKnowledgment
(EAACK)-implement a new intrusion-detection system for Hybrid wireless networks. It protect Hybrid wireless
networks from attacks that have higher malicious behavior detection rate. Analytical and simulation result
based on the real human mobility mode. SQOD can provide high secure performance in terms of Intrusion detection,overhead, transmission delay.
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
Delay Tolerant Network (DTNs) is a wireless network that experiences frequent connectivity and due to mobility of nodes long duration partitions occurred during transmission of data. DTN has the main feature that there is not full path present from source to destination. In Delay Tolerant Network (DTN), traditional routing protocol for mobile Ad-hoc protocol to be ineffective to extend of message transmission between different nodes. Delay tolerant networks (DTNs) are used in many applications like in deep space communications, under water Acoustic Network, Sparsely Populated Areas Networks Etc. In such network a routing with minimum energy congumption is major issue. In this paper, we try to explore a routing issue in DTN. First energy requirement and routing with their corresponding countermeasures in DTN are explained. Moving nodes in DTN keep the updating of network as well energy at every stage. By using the geographical concept the location of each node is maintained by updating in topology. There are many routing protocols are available for routing purpose in DTN.
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.
This document summarizes a research paper that proposes a novel cross-layer routing technique for mobile ad hoc networks. The technique calculates both signal strength and node mobility to select the most efficient and stable path for data transmission. It aims to improve on traditional ad hoc routing protocols like AODV by considering both link quality metrics from the physical layer (signal strength) and node mobility. The proposed method selects routes based on signal strength if mobility is high, and on traditional hop count if mobility is low, in order to find paths that reduce link failure and improve throughput.
Improving data transmission in the vanet using multi criteria decision making...ijfcstjournal
In vehicular ad
-
hoc networks the packets are sent using multi
-
hop methods and the receiving limit of a
message is gradually extended, but the exponential increment of the number of nodes re
-
broadcasting a
message results in broadcast storm problem in data
broadcasting in this case. Some characteristics like
high speed of nodes, rapid topological changes and repetitive discontinuities have made it difficult
to
design an efficient broadcasting protocol for these networks.
We have offered a novel fuzzy method
based on multi
-
criteria decision
-
making (MCDM) for prioritizing the
vehicles in selection of the most proper neighbor to broadcast data in this paper. With using this f
uzzy
method, the most proper vehicles participate in data broadcasting. The results of
simulation using NS show
that because of selecting the neighboring vehicles with high priority in data broadcasting, the spee
d of
sending the packs is increased and the network load is considerably decreased. This method also
considerably decreases broadca
sting traffic.
Reduce Handover Delay Using the HSBCC Based Buffer Over Flow In Wimax Networkinventionjournals
In wireless networks to improve the competence for event account. Due to the in complete transmission size of nodes, a single path often cannot meet the condition of data transmission. Consequently, multipath show is needed. However, not every path originate by multipath routing algorithms maybe appropriate for conveying image, because a extended routing pathway with a long end to end show delay may not satisfied the time constraint. Furthermore, each data stream includes two kinds of material data handover. We have coming a novel explicit rate-based congestion control method, for supportive requests hand over process. Handover Streaming based Congestion Control (HSBCC), a new adaptive media handover streaming congestion organization in which the assembly packet broadcast rate is adjusted rendering to the active bandwidth share of the connection. They prepare not maintain or continually inform their route tables with the newest route in network. If a node requirements to send a pack to another node then this protocol explorations for the route in an on-demand method and begins the joining in order to communicate and receive the packet. The route detection usually happens by flooding the route application packets throughout the network. It makes sense to simply disregard a packet loss due to random frequency errors than to multiplicatively reduction the current transport rate and it is more suitable to periodically investigation the network during interruption period for a prompt retrieval than to slow down and exponentially increase the retransmission timer.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
Hybrid networks is integrate MANETs and infrastructure wireless networks
It have proven to be a better network structure for the next generation networks
It can act Base station and Ad hoc according to the environment conditions
The widespread use of mobile devices the increasing demand for mobile multimedia streaming services
The future of real time need of high Quality of Service (QoS) support in wireless and mobile networking environments
The QoS support reduces end to end transmission delay and enhances throughput to guarantee the seamless communication between mobile devices and wireless infrastructures
Specifically, infrastructure networks improve the scalability of MANETs, while MANETs automatically establish self-organizing networks, extending the coverage of the infrastructure networks
A QoS oriented distributed routing protocol for Hybrid Wireless Network :Firs...AAKASH S
This document presents an outline for a project on developing a QoS-oriented distributed routing protocol for hybrid wireless networks. It discusses existing work that suffers from overhead and scalability issues. The proposed work incorporates five algorithms to select neighbors, schedule packets, adjust segment size based on mobility, eliminate redundant traffic, and reduce redundant data to improve QoS metrics like transmission delay, throughput, and capacity while reducing overhead. It is claimed that using single-hop transmissions can improve performance by reducing overhead, link failures, and improving QoS.
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
ADAPTIVE BANDWIDTH MANAGEMENT MODEL FOR WIRELESS MOBILE AD-HOC NETWORKIJCNCJournal
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current
network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network
resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient
mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and
authentic data transfer. During real-time data transfer, to make communication effective, we make use of
bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance
networks. In our proposed model we are concentrating on the maximum utilization of resources, and using
the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to
reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources.
Our simulation result also shows that our model improves the network performance.
Adaptive Bandwidth Management Model for Wireless Mobile Ad-hoc NetworkIJCNCJournal
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and authentic data transfer. During real-time data transfer, to make communication effective, we make use of bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance networks. In our proposed model we are concentrating on the maximum utilization of resources, and using the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources. Our simulation result also shows that our model improves the network performance.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
This document analyzes the performance of a neighbor knowledge based broadcast protocol called BCAST in mobile ad hoc networks using network simulator NS-2. It varies the number of data senders (multicast group size) and data sending rate to analyze packet delivery ratio, end-to-end delay, packet loss probability, and network control overhead. The simulation results show that BCAST generally performs well and provides robust performance even with high traffic loads.
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.
Link Stability Based On Qos Aware On - Demand Routing In Mobile Ad Hoc NetworksIOSR Journals
This document summarizes a research paper that proposes a new routing protocol for mobile ad hoc networks (MANETs) that considers link stability and quality of service (QoS) metrics. The protocol estimates link quality based on node mobility prediction using GPS data. It calculates a "cost" metric factoring in link stability and power consumption to select paths with more stable, lower-cost links. Simulation results show the proposed protocol achieves higher throughput and packet delivery ratio compared to existing protocols, with lower control overhead. Future work could incorporate additional link quality metrics and statistical classifiers to further optimize path selection in MANETs.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
Performance analysis of multilayer multicast MANET CRN based on steiner minim...TELKOMNIKA JOURNAL
In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel’s bandwidth increased while dropped as the value of packet size D increased. The network’s performance grew with rise in the value of idle probability (푃퐼) since the primary user’s (PU) traffic load is low when the value of 푃퐼 is high.
IMPROVED QUALITY OF SERVICE PROTOCOL FOR REAL TIME TRAFFIC IN MANETIJCNCJournal
This document proposes an improved quality of service protocol for real-time traffic in mobile ad hoc networks. It presents a modified version of the AODV routing protocol that provides two key improvements: 1) A balanced best-effort traffic aware route discovery mechanism that selects paths with lower ratios of best-effort packets to minimize their impact on real-time traffic. 2) A packet forwarding procedure that gives transmission priority to real-time packets by transmitting them immediately from the queue while best-effort packets have to wait, improving throughput for real-time applications. Simulation results show the proposed protocol performs better than basic AODV in terms of throughput and delay for real-time traffic.
Dynamic Slot Allocation for Improving Traffic Performance in Wireless Sensor ...IRJET Journal
This document proposes a dynamic slot allocation algorithm to improve traffic performance in wireless sensor networks. It aims to reduce energy consumption and improve network lifetime by dynamically allocating channels based on traffic load. The algorithm works as follows:
1. Nodes initialize parameters like queue thresholds and check their congestion level based on queue length, channel utilization, and energy.
2. Based on the congestion level, nodes determine the frequency of transmitting data packets. If congestion is low, no action is taken. If medium, low data transmission is allowed. If high, an alternate path is established.
3. The algorithm also monitors the data packet distribution ratio and dynamically establishes an alternate path if it drops below a threshold, to
TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...cscpconf
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
Reliable and efficient data dissemination scheme in VANET: a review IJECEIAES
Vehicular ad-hoc network (VANET), identified as a mobile ad hoc network MANETs with several added constraints. Basically, in VANETs, the network is established on the fly based on the availability of vehicles on roads and supporting infrastructures along the roads, such as base stations. Vehicles and road-side infrastructures are required to provide communication facilities, particularly when enough vehicles are not available on the roads for effective communication. VANETs are crucial for providing a wide range of safety and non-safety applications to road users. However, the specific fundamental problem in VANET is the challenge of creating effective communication between two fast-moving vehicles. Therefore, message routing is an issue for many safety and non-safety of VANETs applications. The challenge in designing a robust but reliable message dissemination technique is primarily due to the stringent QoS requirements of the VANETs safety applications. This paper investigated various methods and conducted literature on an idea to develop a model for efficient and reliable message dissemination routing techniques in VANET.
The document proposes a multi-channel MAC protocol called MMDQS-MAC for wireless sensor networks. It aims to improve network performance by selecting the best channel for each sensor node and supporting dynamic channel assignment. MMDQS-MAC is designed to decrease collision probability, interference, and improve throughput, energy efficiency, packet delivery ratio, and end-to-end delay. It analyzes the performance of MMDQS-MAC through mathematical modeling and simulation.
The document proposes a clustering-based approach to dynamically allocate bandwidth in wireless networks. It extracts student data from a university's course timetable to predict user distributions over time. It then applies K-means clustering to group buildings into wireless nodes based on expected user loads. This clusters student devices and allows wireless nodes to adapt their bandwidth allocation according to predicted user demands at different times. The approach is tested on a university campus network, extracting student data to predict building loads and applying K-means clustering to allocate optimal bandwidth across wireless nodes over time.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Quality of Service in bandwidth adapted hybrid UMTS/WLAN interworking networkTELKOMNIKA JOURNAL
Integration of Universal Mobile Telecommunications System (UMTS) and Wireless Local Area Network (WLAN) result in ubiquitous connection for end users. In the integrated network, ensuring the quality of service to users and enhancing capacity of network are prominent issues. Bandwidth adaptation technique is one of the solutions to overcome these issues. Bandwidth adaptation based on per flow and per class schemes were proposed for loosely coupled interworking network. In this paper, hybrid coupled UMTS and WLAN interworking network is analyzed with bandwidth adaptation based on per flow and per class schemes and the performances have been compared. Simulation result shows that the proposed hybrid coupled interworking network with bandwidth adaptation based on per class scheme performs better with enhanced quality of service and network capacity.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
The document describes a new routing protocol called Route Optimization and Load-balancing (ROL) for wireless sensor networks. ROL aims to balance several objectives like prolonging network lifetime, providing timely message delivery, and improving network robustness. It uses a combination of routing metrics that can be configured according to application priorities to optimize overall network performance. Simulation results show that ROL maintains balanced cluster sizes and populations, reduces overhead, end-to-end delays, and improves data delivery ratios compared to other protocols like Mires++.
This document summarizes a research paper that proposes using a hotspot algorithm to improve node stability in mobile ad hoc networks (MANETs). The paper first provides background on MANETs and challenges with routing in dynamic network topologies. It then discusses the importance of node stability and proposes using a hotspot algorithm to identify stable nodes. The algorithm calculates stability factors for nodes based on their mobility and neighbors' mobility. Routing is done through stable nodes to improve efficiency. The paper models this approach in a network simulator and analyzes results on parameters like packet loss and throughput. Future work involves further optimizing the network using this routing method.
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.
Similar to A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL IN MOBILE AD HOC NETWORKS (20)
Your LinkedIn Success Starts Here.......SocioCosmos
In order to make a lasting impression on your sector, SocioCosmos provides customized solutions to improve your LinkedIn profile.
https://www.sociocosmos.com/product-category/linkedin/
UR BHatti Academy dedicated to providing the finest IT courses training in the world. Under the guidance of experienced trainer Usman Rasheed Bhatti, we have established ourselves as a professional online training firm offering unparalleled courses in Pakistan. Our academy is a trailblazer in Dijkot, being the first institute to officially provide training to all students at their preferred schedules, led by real-world industry professionals and Google certified staff.
STUDY ON THE DEVELOPMENT STRATEGY OF HUZHOU TOURISMAJHSSR Journal
ABSTRACT: Huzhou has rich tourism resources, as early as a considerable development since the reform and
opening up, especially in recent years, Huzhou tourism has ushered in a new period of development
opportunities. At present, Huzhou tourism has become one of the most characteristic tourist cities on the East
China tourism line. With the development of Huzhou City, the tourism industry has been further improved, and
the tourism degree of the whole city has further increased the transformation and upgrading of the tourism
industry. However, the development of tourism in Huzhou City still lags far behind the tourism development of
major cities in East China. This round of research mainly analyzes the current development of tourism in
Huzhou City, on the basis of analyzing the specific situation, pointed out that the current development of
Huzhou tourism problems, and then analyzes these problems one by one, and put forward some specific
solutions, so as to promote the further rapid development of tourism in Huzhou City.
KEYWORDS:Huzhou; Travel; Development
EASY TUTORIAL OF HOW TO USE REMINI BY: FEBLESS HERNANEFebless Hernane
Using Remini is easy and quick for enhancing your photos. Start by downloading the Remini app on your phone. Open the app and sign in or create an account. To improve a photo, tap the "Enhance" button and select the photo you want to edit from your gallery. Remini will automatically enhance the photo, making it clearer and sharper. You can compare the before and after versions by swiping the screen. Once you're happy with the result, tap "Save" to store the enhanced photo in your gallery. Remini makes your photos look amazing with just a few taps!
This tutorial presentation provides a step-by-step guide on how to use Facebook, the popular social media platform. In simple and easy-to-understand language, this presentation explains how to create a Facebook account, connect with friends and family, post updates, share photos and videos, join groups, and manage privacy settings. Whether you're new to Facebook or just need a refresher, this presentation will help you navigate the features and make the most of your Facebook experience.
Project Serenity is an innovative initiative aimed at transforming urban environments into sustainable, self-sufficient communities. By integrating green architecture, renewable energy, smart technology, sustainable transportation, and urban farming, Project Serenity seeks to minimize the ecological footprint of cities while enhancing residents' quality of life. Key components include energy-efficient buildings, IoT-enabled resource management, electric and autonomous transportation options, green spaces, and robust waste management systems. Emphasizing community engagement and social equity, Project Serenity aspires to serve as a global model for creating eco-friendly, livable urban spaces that harmonize modern conveniences with environmental stewardship.
Telegram is a messaging platform that ushers in a new era of communication. Available for Android, Windows, Mac, and Linux, Telegram offers simplicity, privacy, synchronization across devices, speed, and powerful features. It allows users to create their own stickers with a user-friendly editor. With robust encryption, Telegram ensures message security and even offers self-destructing messages. The platform is open, with an API and source code accessible to everyone, making it a secure and social environment where groups can accommodate up to 200,000 members. Customize your messenger experience with Telegram's expressive features.
EASY TUTORIAL OF HOW TO USE G-TEAMS BY: FEBLESS HERNANEFebless Hernane
Using Google Teams (G-Teams) is simple. Start by opening the Google Teams app on your phone or visiting the G-Teams website on your computer. Sign in with your Google account. To join a meeting, click on the link shared by the organizer or enter the meeting code in the "Join a Meeting" section. To start a meeting, click on "New Meeting" and share the link with others. You can use the chat feature to send messages and the video button to turn your camera on or off. G-Teams makes it easy to connect and collaborate with others!
The Evolution of SEO: Insights from a Leading Digital Marketing AgencyDigital Marketing Lab
Explore the latest trends in Search Engine Optimization (SEO) and discover how modern practices are transforming business visibility. This document delves into the shift from keyword optimization to user intent, highlighting key trends such as voice search optimization, artificial intelligence, mobile-first indexing, and the importance of E-A-T principles. Enhance your online presence with expert insights from Digital Marketing Lab, your partner in maximizing SEO performance.
Lifecycle of a GME Trader: From Newbie to Diamond Handsmediavestfzllc
Your phone buzzes with a Reddit notification. It's the WallStreetBets forum, a cacophony of memes, rocketship emojis, and fervent discussions about Gamestop (GME) stock. A spark ignites within you - a mix of internet bravado, a rebellious urge to topple the hedge funds (remember Mr. Mayo?), and maybe that one late-night YouTube rabbit hole about tendies. You decide to YOLO (you only live once, right?).
Ramen noodles become your new best friend. Every spare penny gets tossed into the GME piggy bank. You're practically living on fumes, but the dream of a moonshot keeps you going. Your phone becomes an extension of your hand, perpetually glued to the GME ticker. It's a roller-coaster ride - every dip a stomach punch, every rise a shot of adrenaline.
Then, it happens. Roaring Kitty, the forum's resident legend, fires off a cryptic tweet. The apes, as the GME investors call themselves, erupt in a frenzy. Could this be it? Is the rocket finally fueled for another epic launch? You grip your phone tighter, heart pounding in your chest. It's a wild ride, but you're in it for the long haul.
This tutorial presentation offers a beginner-friendly guide to using THREADS, Instagram's messaging app. It covers the basics of account setup, privacy settings, and explores the core features such as close friends lists, photo and video sharing, creative tools, and status updates. With practical tips and instructions, this tutorial will empower you to use THREADS effectively and stay connected with your close friends on Instagram in a private and engaging way.
HOW TO USE THREADS an Instagram App_ by Clarissa Credito
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL IN MOBILE AD HOC NETWORKS
1. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
DOI : 10.5121/ijasuc.2010.1309 106
A QUALITY OF SERVICE ARCHITECTURE FOR
RESOURCE PROVISIONING AND RATE CONTROL IN
MOBILE AD HOC NETWORKS
S.Venkatasubramanian1
and Dr.N.P.Gopalan2
1
Department of Computer Science & Engineering, Saranathan College of Engineering,
Panjapur, Tiruchirapalli, Tamilnadu, India
vsgomes@rediffmail.com
2
Department of Computer Applications, National Institute of Technology,
Tiruchirapalli, Tamilnadu, India
gopalan@nitt.edu
ABSTRACT
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.
KEYWORDS
QoS, DRQOS, Rate control, multipath routing,
1. INTRODUCTION
A mobile ad hoc network includes a group of wireless nodes which develops a network without
the deployment of existing network infrastructure. A node can communicate with the other
nodes by multi-hop, when the nodes cooperate to forward packets with each other. In MANETs,
the design of a Quality of Service (QoS) routing protocol is more difficult than the conventional
networks because the host mobility can cause frequently unpredictable topology changes [1].
Since the last decade, MANETS are under the focus of the research community. It supports a
variety of services by forming an infrastructure-less network immediately. Initially, MANETs
are proposed for the emergency situations such as natural disasters, military conflicts, medical
facilities etc but nowadays it is required to support the increasing demand for multimedia
communications. Due to high rate requirements and severe delay constraints, maintaining real-
time media traffics such as audio and video in presence of dynamic network topology is difficult
[2].
There are two solutions for QoS provisioning on the Internet such as [3] such as Integrated
Services (IntServ) and Differentiated Services (DiffServ). The objective of the Integrated
Services (Intserv) is to provide applications with a guaranteed share of bandwidth. The requested
2. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
107
QoS for a flow is either fully granted or rejected because the Intserv operates on a per-flow
basis.
• Guaranteed Services: It provides an assured amount of bandwidth, strict end-to-end
delay bounds, and minimal queuing delay to packets
• Controlled Load Services: It gives a service that is as close as possible to a best-effort
service in a lightly loaded network and
• Best Effort Services: It is characterized by the absence of a QoS specification.
The first two service classes use parameters, such as token bucket rate and size, peak data rate,
and minimum and maximum packet size. The routers are able to produce detailed reservations
with the detailed information provided by these services about the intended packet stream.
DiffServ is a lightweight model and it is significantly proposed for the interior (core network)
routers because the individual state flows are aggregated into a set of flows. It is not necessary to
maintain the flow states within the core of the network because the service differentiation
depends upon the per hop behaviors. Simplicity, efficiency and scalability are the advantages of
the DiffServ. Hence this model can be a promising QoS model for MANETs. However, the
DiffServ architecture should be suitably adapted such that it can be applied to the features of
MANETs [3].
Generally, the existing solutions for QoS provisioning in MANETs can be classified into two
categories [3] namely stateful approach based on resource reservation. Eg: INSIGNIA [13] and
stateless approach which do not rely on resource reservation, and try to provide a certain degree
of service differentiation. Eg: SWAN [14].
1.2 Priority of Traffic
Generally in QoS provisioning, the bandwidth is allocated first to the higher priority traffic in
preference and then allocated to the lower priority traffic. The lower priority traffic can utilize
the bandwidth only after the utilization of the higher priority traffic. If a high priority flow’s
traffic pattern satisfies the behavior described in the service agreement, its packets should be
delivered in preference to other packets with lower priorities. On the other hand, flows with
lower priorities should use as much bandwidth as possible after the transmission requirements of
higher priority flows have been satisfied [6].
1.3 Rate Control in MANET
Since the available bandwidth of the wireless channel is variable and unpredictable, rate control
becomes more complicated in MANETs than in the wired networks. When a source-based
admission control mechanism uses rate measurements from aggregated real-time traffic as
feedback, a rate control mechanism uses the per-hop MAC delay measurements from packet
transmissions as feedback [4].
The rate control of TCP and UDP best effort traffic is performed locally at every mobile node in
a fully distributed and decentralized manner to make sure that the bandwidth and delay
requirements of real-time UDP traffic are met. In order to restrict the best effort traffic to
produce the essential bandwidth required for supporting real time traffic, rate control is designed.
It can also be used to allow the best effort traffic to efficiently utilize the bandwidth which is not
currently utilized by the real-time traffic at any particular moment. In order to reduce the
3. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
108
excessive delays, the total rate of all best effort and real-time traffic transported over each load
shared media channel is maintained below a particular threshold rate [4].
1.4 QoS Provisioning Challenges in MANETs
Due to several problems, QoS provisioning in MANETs is much complicated when compared to
wired networks. The following are some of the main QoS provisioning and maintenance
problems in MANETs.
It requires knowledge of the available bandwidth, which is difficult to be accurately
estimated in a dynamic environment.
Bandwidth reservation has to be made through negotiation between neighbors within
two to three hops other than only the direct neighbors sharing the same channel, and this
needs signaling message exchanges between them. Moreover, when the neighbor moves
out of the reservation area of the node, the reserved bandwidth in a neighbor should be
released through some mechanism. Hence, an extra control overhead will be introduced
by these signaling messages and consumes limited bandwidth and energy.
The reserved bandwidth over the entire duration of an active session cannot be
guaranteed. Some of the reserved bandwidth might be stolen by the oncoming node, if a
communicating node moves towards a node which has reserved some bandwidth for
flow(s). The reserved bandwidth over the link between them might be unavailable or the
link might be broken, if two nodes on the end of a link move away from each other.
In MANETs, due to the dynamic topology, there is no clear definition of what is core,
ingress or egress router. Since all the nodes in the network cooperate to provide services,
there is no clear definition of a Service Level Agreement (SLA). On the other hand, an
infrastructured network where the services to the users in the network are provisioned by
one or more service providers [3].
Since the wireless bandwidth and capacity in MANETs are affected by interference,
noise and multi-path fading, it is limited and the channel is not reliable. Moreover, the
available bandwidth at a node cannot be estimated exactly because it involves in a large
variations based on the mobility of the node and other wireless device transmitting in the
vicinity etc [5].
In this paper, we propose to design a QoS architecture for resource provisioning and rate control
of various traffic classes.
2. RELATED WORK
R. Gunasekaran et al [7] have proposed a model called High-Privileged and Low-Privileged
Architecture (HPLP) for the forthcoming Ad Hoc networks where the differentiated services can
be achieved for different classes of users. They have considered only the bandwidth reservation
among the various factors influencing the differentiated services and identified the different
factors that can influence the efficiency of the bandwidth reservation.
Claude Chaudet et al, [8] have proposed a distributed algorithm to allocate bandwidth to each
mobile according to the topology of the network and the available bandwidth on each mobile for
stable ad hoc networks. Their algorithm guarantees a non null minimum bandwidth to each
4. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
109
mobile. With their algorithm, each mobile computes its bandwidth usage in order to avoid
saturating its capacity or its neighbors and congestion is less likely to appear in the network.
M. Mirhakkak et al [9] have developed a prototype implementation of resource reservation,
running as an extension to the Reservation Setup Protocol (RSVP) protocol. Their approach is to
expand the semantics of the reservation, so that, instead of being a single value indicating the
level of service needed by an application, it becomes a range of service levels in which the
application can operate, together with the current reserved value within that range.
Kumar Manoj et al [10] have proposed a bandwidth control management (BWCM) model to
improve the QoS performance by minimized end-to-end delay. In addition to end-to-end delay,
they have proposed an algorithm for end-to-end bandwidth calculation and allocation. They have
considered different QoS traffic flows in the network to evaluate the performance of their
proposed algorithm of BWCM model. Their algorithm includes a set of mechanisms: control
management, co-ordination temporary resource reservation process.
Belkadi Malika et al [11] have proposed a new solution combining QoS (Quality of Service)
routing protocol and flow control mechanism. This QoS routing protocol selects the routes with
more resources in an intelligent manner rather than diffusion. It returns the best route offering a
higher transmission rate, a less delay and a more stability. Their protocol uses a new metric to
compute the most stable route. To reinforce the congestion avoidance, they have added a flow
control mechanism to adjust the sender's transmission rate for each route.
Marek Hejmo et al [12] have proposed a distributed QoS signaling protocol which is an
extension to the SWAN protocol. Their proposed DoS-resistant QoS (DRQoS) signaling scheme
employs distributed rate control to manage the bandwidth resources of the network, but does not
rely on the maintenance of per-flow state. Their signaling protocol provides QoS for real-time
traffic and employs mechanisms at the medium access control (MAC) layer, which serve to
avoid potential attacks on network resource usage. Their proposed signaling scheme achieves a
compromise between signaling protocols that require the maintenance of per-flow state and
those that are completely stateless.
3. PROPOSED QOS ARCHITECTURE
3.1 Overview of the Architecture
In this paper, we propose to design a QoS architecture which has four basic components:
• Adaptive Bandwidth Management
• QoS Routing
• Call Admission Control
• Rate Control.
The adaptive bandwidth management measures the available bandwidth at each node in real-
time. This bandwidth information is then propagated pro-actively or retrieved on demand by the
scalable QoS routing. The source nodes in the DiffServ model perform call admission control for
real-time flows based on the bandwidth information provided by the QoS routing. The
congestion control part is unique to mobile ad hoc networks. In a MANET, even though
admission control is performed to guarantee enough available bandwidth before accepting any
real-time flow, the network can still experience congestion due to mobility or connectivity
changes. Thus, the fourth component, congestion control, is extremely important to our QoS
5. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
110
architecture. It monitors the network bandwidth utilization continuously and detects network
congestion in advance with the help of the adaptive bandwidth management component. A rate
control is then used to regulate best-effort traffic and ensure that best-effort traffic coexist well
with real-time traffic.
3.2 Adaptive Bandwidth Management
In our QoS architecture, each node will continuously estimate its available bandwidth. The
bandwidth information will then be used for QoS capable routing protocols to provide support to
admission control.
We compute the available bandwidth based on the channel status of the radio to determine the
busy and idle periods of the share wireless media. By examining the channel usage of a node, we
are able to take into account the activities of both the node itself and its surrounding neighbors
and therefore obtain a good approximation of the bandwidth usage. The channel utilization ratio
is defined as the fraction of time within which a node is sensing the channel as being utilized. An
802.11 wireless radio has four states:
1. Busy state (transmitting or receiving packets)
2. Carrier sensing channel busy (some other nodes within its neighborhood are transmitting
packets)
3. Virtual carrier sensing busy (deferral to RTS or CTS packets)
4. Idle state (not in any of the above states).
Among the four states, the states the first three states can be treated as busy state and the fourth
state as the idle state. Each node will constantly monitor the channel state changes (from busy to
idle or from idle to busy) and record the time period that the radio is in each state.
For each time period T, we then calculate the channel utilization ratio CHutil as
T
period
busy
channel
CHutil
−
−
= (1)
To smooth the channel utilization estimation, we define a smoothing constant ∈
δ [0,1].
Suppose the last channel utilization ratio is CHutil(t-1) and the channel utilization ratio measured
in the current sampling time window is CHutil. Then, the current channel utilization ratio is given
as CHutil(t) = δ CHutil(t-1) + (1- δ) CHutil. The channel utilization ratio CHutil(t) is bounded
between 0 and 1. After correctly estimating the channel utilization at time t, we then are able to
calculate the available bandwidth of a node at time t as
ABWt = CHBW(1- CHutil(t)). (2)
Here, CHBW is the raw channel bandwidth.
3.2.1 Bandwidth Reservation
In our scheme, we use a soft bandwidth reservation where each node in the network will
periodically calculate its own available bandwidth, based on the bandwidth measurement
technique discussed in the previous subsection. The available bandwidth calculation will be used
by our call admission control component to determine if flows can be admitted for a particular
service class. Once a flow is admitted and starts sending data traffic, the bandwidth resource
occupied by the flow will be automatically taken into consideration during the periodic available
6. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
111
bandwidth measurement intervals. Therefore, resource reservation is done implicitly without the
need to keep track of per flow information; only per class information is needed.
3.3 QoS Routing
We use our previously designed QOS based multipath routing protocol intended for mobile ad
hoc networks [15]. Enabling a QoS constrained route from source to destination is the objective
of this routing protocol.
A QoS-based routing metric for MANETs should incorporate minimum available bandwidth and
end-to-end latency along with congestion around a link. Congestion is related to channel
quality, which depends on the MAC access contention and channel reliability. So our algorithm
should rely on the following metrics to allocate weights to individual links.
• End-to-End Delay
• Channel Quality
• Link Quality
We now introduce the weight metric W which assigns a cost to each link in the network. The
weight W combines the link quality Lq, channel quality Cocc and the average delay Davg , to select
maximum throughput paths, avoiding the most congested links.For an intermediate node i with
established transmission with several of its neighbors, the W for the link from node i to a
particular neighboring node is given by
W = Lq + Cocc + Davg (3)
3.3.1 Route Request
During the route discovery phase of the protocol, each intermediate node uses an admission
control scheme to check whether the flow can be accepted or not. If accepted, a Flow Table (FT)
entry for that particular flow is created. The FT contains the fields Source (Src), Destination
(Dst), Reserved Bandwidth (BWres), Minimum bandwidth (BWmin). Each node collects the
bandwidth reserved at its one hop neighbors (piggybacked on periodic HELLO packets) and
stores it in its Neighbor Table (NT) .The Neighbor Table contains fields Destination (Dst),
Reserved Bandwidth (BWres), No. of Hello Packets (No Hello).
Let us consider the scenario and the route
S ------- R1---–-- R2 ---–-- R3-- ---– D
To initiate QoS-aware routing discovery, the source host S sends a RREQ. When the
intermediate host R1 receives the RREQ packet, it first estimates all the metrics as described in
the previous section.
The host R1 then calculates its weight WR1 using (3).
WR1
RREQR1 ======= R2
R2 then calculates its weight WR2 in the same way and adds it to the weight of R1. R2 then
forward the RREQ packet with this added weight.
7. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
112
WR1+ WR2
RREQR2 ============= R3
Finally the RREQ reaches the destination node D with the sum of node weights
WR1+ WR2 + WR3
RREQR3 ==================== D
3.3.2 Route Reply
The Destination node D sends the route reply packet RREP along with the total node weight to
the immediate upstream node R3.
WR1+ WR2 + WR3
RREP ================= R3
Now R3 calculates its cost C based on the information from RREP as
CR3 = (WR1+ WR2 +WR3) - (WR1+ WR2) (4)
By proceeding in the same way, all the intermediate hosts calculate its cost.
On receiving the RREP from all the routes, the source selects the route with minimum cost
value.
3.4 Call Admission Control
With the support from the above described QoS routing, the source node can then decide
whether to admit a new real-time flow. This is usually referred to as call admission control
(CAC). When a new request with certain bandwidth requirement comes, the source will perform
admission control following the procedure described below.
• The source node first consults the local routing table. If the destination is within the
local scope and the available bandwidth is enough, then the flow is accepted. If the
destination is within scope, but bandwidth is not enough, then, reject the flow.
• If the destination is not within the local scope, the source node then consults the
landmark routing table. It first examines whether it has enough bandwidth to the
corresponding landmark node of the destination. If not enough, the flow is rejected.
• If bandwidth to the landmark node is enough, the source node then has to further check
the minimal and maximal bandwidth propagated by that landmark. If the requested
bandwidth is smaller than BWmin, the flow can be admitted. If the requested bandwidth
is larger than BWmax, the flow is rejected.
• If, however, the requested bandwidth falls between BWmin and BWmax, the bandwidth
information in the landmark routing table is not enough to make an admission decision.
A probing packet is then sent by the source node to the corresponding landmark to
collect the exact available bandwidth to the destination node. After getting the reply
8. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
113
back, if the available bandwidth can meet the requirement, then accept the flow.
Otherwise, the flow is rejected.
3.5 Rate Control
The Packet Generation Rate (PGR) of the low priority flow is computed at low priority source
based on the formula as follows:
)
(
1
)
(
t
PGI
t
PGR L
new
L
new = (5)
where )
(t
PGI L
new is the computed Packet Generation Interval of low priority flow L at time t
given by
)
(
])
[
1
(
)
( t
PGI
ER
t
PGI L
old
H
L
new ×
×
−
= δ (6)
where, ERH is the detected error in Packet Arrival Interval of high priority flow and it is given
as,
H
Detected
H
Desired
H PAI
PAI
ER −
= (7)
where, PAI is the Packet Arrival Interval, H
Desired
PAI is the desired high priority Packet Arrival
Interval and H
Detected
PAI is the detected high priority Packet Arrival Interval. Here δ is the
proportionality constant. We assume that each high priority flow has a pre-specified Packet
Generation Rate which should correspond to the Packet Arrival Interval at any intermediate node
when high priority flow does not have to face any contention. This value is known to every node
in the network and this corresponds to the desired high priority Packet Arrival Interval.
The positive or negative adjustment required in the PGI at low priority source is a fraction of the
old PGI of the low priority flow, which is proportional to the error introduced in high priority
Packet Arrival Interval. On high priority flow detection, if low priority PGR is decreased, its
effect on the improvement of high priority Packet Arrival Interval requires some time. Hence,
taking control decision on each back propagated value of (Transmitted Packet Arrival Interval)
Li
t
s
TPAI )
( would be incorrect and will lead to more unnecessary oscillations of both Detected
high priority Packet Arrival Interval as well as PGR of low priority flow. Hence, a window is
introduced at the low priority source, which effectively stores Li
t
s
TPAI )
( . So, the PGR or PGI of
low priority source Li is controlled with the Average of Li
t
s
TPAI )
( , where averaging is done on
the Window-Size W. Hence, Detected Packet Arrival Interval at source S for the low priority
flow Li at time t or )
(t
PAI Li
Detected is computed as
W
s
TPAI
t
PAI
W
j
Li
t
Li
Detected
∑
−
=
=
1
0
)
(
)
( (8)
9. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
114
4. SIMULATION RESULTS
4.1. Simulation Model and Parameters
The Network Simulator (NS2) [16], is used to simulate the proposed architecture. In the
simulation, the channel capacity of mobile hosts is set to the same value: 2 Mbps. The
distributed coordination function (DCF) of IEEE 802.11 is used for wireless LANs as the MAC
layer protocol. It has the functionality to notify the network layer about link breakage. In the
simulation, 50 mobile nodes move in a 1000 meter x 1000 meter region for 100 seconds
simulation time. We assume each node moves independently with the same average speed. All
nodes have the same transmission range of 250 meters. In our simulation, the speed is 10 m/s
and pause time is 5 sec. The simulated traffic is Constant Bit Rate (CBR).
The simulation settings and parameters are summarized in table
No. of Nodes 50
Area Size 1000 X 1000
Mac 802.11
Radio Range 250m
Simulation Time 100 sec
Traffic Source CBR
Packet Size 512
Speed 10m/s
Flows 2,4,6,8 and 10
Rate 0.5,1.0,1.5 and
2Mb
4.2 Performance Metrics
The proposed QoS Architecture for Resource Provisioning and Rate Control (QARP-RC) is
compared with the DRQoS [12] scheme. The performance is evaluated mainly, according to the
following metrics.
i. Average End-to-End delay: The end-to-end-delay is averaged over all surviving data
packets from the sources to the destinations.
ii. Aggregated Throughput: We measure aggregated throughput in terms of no. of
packets received.
iii. Fairness: For each CBR flow, we measure the fairness as the ratio of throughput of
each flow and total no. of flows.
iv. Packet Loss: We measure the packet loss, which is the no. of packets lost per unit
time.
v. Blocking Probability: We measure the blocking probability as the ratio of rejected
requests per total no. of requests.
4.3 Results
A. Effect of Varying Rate
In the first experiment, the transmission rate is varied as 0.5, 1.0, 1.5 and 2Mb and the above
metrics are measured.
10. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
115
Fig.1 Rate Vs Delay
Fig.2 Rate Vs Throughput
Fig.3 Rate Vs Fairness
End-to-End Delay
0
0.5
1
1.5
2
2.5
3
3.5
0.5 1.0 1.5 2.0
Rate(kb)
Delay(s)
QARP-RC
DRQoS
Throughput
0
1000
2000
3000
4000
5000
6000
7000
0.5 1.0 1.5 2.0
Rate(kb)
QARP-RC
DRQoS
Packets
Rate Vs Fairness
0
0.2
0.4
0.6
0.8
1
1.2
0.5 1.0 1.5 2.0
Rate
QARP-RC
DRQoS
Fairness
11. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
116
Fig.4 Rate Vs Packets Loss
Fig.5 Rate Vs Blocking Probability
Fig 1 shows the end-to-end delay values when the rate is increased. It is clear that QARP-RC has
less delay when compared to DRQoS, since it has the QoS routing protocol which selects best
path. Fig 2 and 3 show the result of throughput and fairness when the rate is increased. From the
figures, it can be seen that the throughput and fairness are more in the case of QARP-RC scheme
than DRQoS, because of the adaptive bandwidth management and rate control schemes of
OQARP-RC. Fig. 4 presents the packets loss for both the schemes. Because of QoS routing and
rate control policies, QARP-RC has less packet loss than DRQoS.Fig.5 shows the blocking
probability when the rate is increased. From the figure it is clear that QARP-RC attains less
blocking probability than the DRQoS, since it has the effective call admission control
mechanism.
B. Effect of Varying Flows
In the second experiment, we vary the number of data flows as 2,4,6,8 and10.
Rate Vs Packet Loss
0
10000
20000
30000
40000
50000
60000
0.5 1.0 1.5 2.0
Rate
QARP-RC
DRQoS
Rate Vs Blocking Probability
0
0.1
0.2
0.3
0.4
0.5
0.5 1.0 1.5 2.0
Rate
QARP-RC
DRQoS
Blocking
Probability
Packet Loss
12. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
117
Fig.6 Flow Vs Delay
Fig.6 Flow Vs End-to-End delay
Fig.7 Flow Vs Throughput
Fig.8 Flow Vs Fairness
Throughput
0
2000
4000
6000
8000
2 4 6 8 10
Flows
packets QARP-RC
DRQoS
Flow Vs Fairness
0
0.1
0.2
0.3
0.4
0.5
2 4 6 8 10
Flow
Fairness
QARP-RC
DRQoS
End-to-End Delay
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
2 4 6 8 10
Flows
delay(s)
QARP-RC
DRQoS
13. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
118
Fig.9 Flow Vs Packet Loss
Fig.9 Flow Vs packet Loss
Fig.10 Flow Vs Blocking Probability
When the flows are increased, the cumulative delay is increased. Fig. 6 shows the end-to-end
delay values when the flow is increased. It is clear that QARP-RC has less delay when compared
to DRQoS, since it has the QoS routing protocol which selects best path. Fig. 7 and 8 show the
result of throughput and fairness when the flows are increased. From the figures, it can be seen
that the throughput and fairness are more in the case of QARP-RC scheme outperforming
DRQoS, because of the adaptive bandwidth management and rate control schemes of OQARP-
RC.Fig. 9 presents the packets loss for both the schemes. Because of the QoS routing and rate
control policies, QARP-RC has less packet loss than DRQoS.
When the flows are increased, the resulting blocking probability is also increased. Fig.10 shows
the blocking probability when the flow is increased. From the figure it is clear that QARP-RC
attains less blocking probability than the DRQoS, since it has the effective call admission control
mechanism.
5. CONCLUSION
In this paper, we propose to design QoS architecture for Bandwidth Management and Rate
Control in MANETs. In our QoS architecture, each node will continuously estimate its available
bandwidth. The bandwidth information will then be used for QoS capable routing protocols to
provide support to admission control. For this, we have used our previous Robust Multipath
Routing (QRMR) protocol. It allocates weights to individual links on the basis of the metrics
Flow Vs Packet Loss
0
2000
4000
6000
8000
10000
2 4 6 8 10
Flow
QARP-RC
DRQoS
P
a
c
k
e
t
L
O
s
s
Flow Vs Blocking Probability
0
0.05
0.1
0.15
0.2
0.25
0.3
2 4 6 8 10
Flow
QARP-RC
DRQoS
Blocking
Probability
14. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
119
link quality, channel quality and end-to-end delay. The traffic is balanced and the network
capacity is improved as the weight value assists the routing protocol to evade routing traffic
through congested area. The source nodes then perform call admission control for different
priority of flows based on the bandwidth information provided by the QoS routing. In addition to
this, a rate control mechanism is used to regulate best-effort traffic, whenever network
congestion is detected. In this mechanism, the packet generation rate of the low-priority traffic is
adjusted to incorporate the high-priority traffic.
REFERENCES
[1] Yuh-Shyan Chen, Shin-Jr Jan and Ming-Chin Chuang, “A Shoelace-Based QoS Routing Protocol
for Mobile Ad Hoc Networks Using Directional Antenna”, Wireless Personal Communications,
SpringerLink, 2009.
[2] A.N. Al-Khwildi, S. Khan, K.K. Loo and H.S. Al-Raweshidy, “Adaptive Link-Weight Routing
Protocol using Cross-Layer Communication for MANET”, WSEAS Transactions on
Communications, 2007.
[3] Bosheng Zhou, Alan Marshall and Tsung-Han Lee, “A Cross-Layer Architecture for DiffServ in
Mobile Ad-hoc Networks”, International Conference on Wireless Networks, Communications
and Mobile Computing, WIRELESSCOM 2005
[4] Gahng-Seop Ahn, Andrew T. Campbell, Andras Veres and Li-Hsiang Sun, “Supporting Service
Differentiation for Real-Time and Best-Effort Traffic in Stateless Wireless Ad Hoc Networks
(SWAN)”, IEEE Transactions on Mobile Computing, 2002.
[5] Shivanajay Marwaha, Jadwiga Indulska and Marius Portmann, “Challenges and Recent Advances
in QoS Provisioning, Signaling, Routing and MAC protocols for MANETs”, Australasian
Telecommunication Networks and Applications Conference, 2008.
[6] Xue Yang and Nitin H.Vaidya, “Priority Scheduling in Wireless Ad Hoc Networks”, Proceedings
of the 3rd ACM international symposium on Mobile ad hoc networking computing, 2002.
[7] R. Gunasekaran and V. Rhymend Uthariaraj, “Differentiated Bandwidth Allocation in Mobile Ad
Hoc Networks (MANET) – A Profile Based Approach”, Asian Journal of Information
Technology, 2007.
[8] Claude Chaudet —Isabelle Guerin Lassous and Janez Zerovnik, “A Distributed Algorithm for
Bandwidth Allocation in Stable Ad Hoc Networks”, International Conference on Wireless On-
Demand Network Systems, WONS 2004.
[9] M. Mirhakkak, N. Schult and D. Thomson, “A New Approach for Providing Quality-Of-Service
In A Dynamic Network Environment”, In the IEEE Proceedings of 21st Century Military
Communications Conference, MILCOM 2000.
[10] Kumar Manoj, S. C. Sharma and S.P. Singh, “Dynamic Behavior of Bandwidth Control
Management in Mobile Ad-Hoc Network”, Proceedings of the World Congress on Engineering and
Computer Science 2009.
[11] Belkadi Malika, Lalam Mustapha, M'zoughi Abdelaziz, Tamani Nordine, Daoui
Mehammed and Aoudjit Rachida, “Intelligent Routing and Flow Control In MANETs”, Journal
of Computing and Information Technology, 2010.
[12] Marek Hejmo, Brian L. Mark, Charikleia Zouridaki and Roshan K. Thomas, “Design
and Analysis of a Denial-of-Service-Resistant Quality-of-Service Signaling Protocol for
MANETs”, IEEE Transactions on Vehicular Technology, 2006.
15. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
120
[13] Seoung-Bum Lee, Gahng-Seop Ahn, Xiaowei Zhang, and Andrew T. Campbell,
“INSIGNIA: An IP-Based Quality of Service Framework for Mobile ad Hoc Networks”, Journal
of Parallel and Distributed Computing, 2000.
[14] Gahng-Seop Ahn, Andrew T. Campbell, Andras Veres and Li-Hsiang Sun, “SWAN:
Service Differentiation in Stateless Wireless Ad Hoc Networks”, In the Proceedings of the 21st
Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM
2002.
[15] S.Venkatasubramanian and N.P.Gopalan, “QOS based Robust multipath routing
protocol for mobile adhoc networks” , IACSIT International Journal of Engineering and
Technology Vol.1,No.5, December,2009
[16] Network Simulator: www.isi.edu/nsnam/ns
Authors
S.Venkatasubramanian received the B.E. degree in Electronics and
Communication from Bharathidasan University and M.E. degree in
Computer science from Regional Engineering College. He has 14 years of
teaching experience. He is currently pursuing doctoral research in mobile Ad
hoc networks. His areas of interest include mobile networks, Network
Security and software Engineering. He has published two papers in the
international journals. At present he is working as Associate Professor in
Department of CSE at Saranathan college of Engineering, Trichy, India.
Dr.N.P.Gopalan is a Professor in the Department of computer application at
National Institute of Technology, Tiruchirapalli. He received the M.E. degree
in Computer science from Regional Engineering College. and Ph.D degree in
theoretical computing from Indian Institute of Science .He has more than 30
years of teaching experience. He has published more than 20 papers in
International, National journals, conference proceedings and 3 books. His
areas of research include Data mining, Web Technology, Distributed
Computing, and Theoretical Computer Science.