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.
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 QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
A 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.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
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).
Mobile ad hoc network become nowadays more and more used in different
domains, due to its flexibility and low cost of deployment. However, this
kind of network still suffering from several problems as the lack of resources.
Many solutions are proposed to face these problems, among these solutions
there is the clustering approach. This approach tries to partition the network
into a virtual group. It is considered as a primordial solution that aims to
enhance the performance of the total network, and makes it possible to
guarantee basic levels of system performance. In this paper, we study some
schemes of clustering such as Dominating-Set-based clustering, Energyefficient
clustering, Low-maintenance clustering, Load-balancing clustering,
and Combined-metrics based clustering.
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 QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
A 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.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
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).
Mobile ad hoc network become nowadays more and more used in different
domains, due to its flexibility and low cost of deployment. However, this
kind of network still suffering from several problems as the lack of resources.
Many solutions are proposed to face these problems, among these solutions
there is the clustering approach. This approach tries to partition the network
into a virtual group. It is considered as a primordial solution that aims to
enhance the performance of the total network, and makes it possible to
guarantee basic levels of system performance. In this paper, we study some
schemes of clustering such as Dominating-Set-based clustering, Energyefficient
clustering, Low-maintenance clustering, Load-balancing clustering,
and Combined-metrics based clustering.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
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.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
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
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
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
Fuzzy Based Node Disjoint QoS Routing in MANETs by Using Agentsidescitation
Support for real time multimedia applications such
as, video telephony, financial stock quote services, and
multiplayer interactive games etc., is very essential in Mobile
Ad hoc Networks (MANETs). Such applications require
multiple Quality of Service (QoS) parameters to be satisfied,
like bandwidth, end-to- end delay, packet loss rate, jitter, etc.
This paper considers the problem of finding node disjoint and
multi-constrained QoS multipaths from source to destination
by using agent based fuzzy inference system. The proposed
scheme, Fuzzy based Node Disjoint Multipath QoS Routing
(FNDMQR) operates in the following steps by integrating
static and mobile agents. (1) Determination of multiple paths
and picking up of resource information (available bandwidth,
link delay, and packet loss rate) of the intermediate nodes
from source to destination. (2) Recognition of node disjoint,
and multi-constrained QoS fit paths by using Takagi-Sugeno
Fuzzy Inference System (TSFIS). TSFIS extracts a fuzzy QoS
weight from available resource information of the
intermediate nodes. (3) Selection of the best path depending
on the fuzzy QoS weight. (4) Maintenance of QoS path when
path breaks due to mobility of node or link failure. To test the
performance effectiveness of the approach, we have analyzed
the performance parameters like packet delivery ratio, average
end-to-end delay and overall control overhead. The scheme
performs better as compared to a node-disjoint multipath
routing in MANETs.
Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint
Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with
respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on
improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone
structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved
Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to
adapt the virtual backbone to topology changes. This assumes significance especially in networks that
experience very high mobility. Changes in the network topology caused by node additions, node deletions
and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR
protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying
mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR
protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions.
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.
QUALITY OF SERVICE ROUTING IN MOBILE AD HOC NETWORKS USING LOCATION AND ENERG...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multi path protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETScseij
Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The
Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To
Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We
Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The
Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential
Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each
Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The
Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast
Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route
Maintenance.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Adaptive 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.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
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.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
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
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
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
Fuzzy Based Node Disjoint QoS Routing in MANETs by Using Agentsidescitation
Support for real time multimedia applications such
as, video telephony, financial stock quote services, and
multiplayer interactive games etc., is very essential in Mobile
Ad hoc Networks (MANETs). Such applications require
multiple Quality of Service (QoS) parameters to be satisfied,
like bandwidth, end-to- end delay, packet loss rate, jitter, etc.
This paper considers the problem of finding node disjoint and
multi-constrained QoS multipaths from source to destination
by using agent based fuzzy inference system. The proposed
scheme, Fuzzy based Node Disjoint Multipath QoS Routing
(FNDMQR) operates in the following steps by integrating
static and mobile agents. (1) Determination of multiple paths
and picking up of resource information (available bandwidth,
link delay, and packet loss rate) of the intermediate nodes
from source to destination. (2) Recognition of node disjoint,
and multi-constrained QoS fit paths by using Takagi-Sugeno
Fuzzy Inference System (TSFIS). TSFIS extracts a fuzzy QoS
weight from available resource information of the
intermediate nodes. (3) Selection of the best path depending
on the fuzzy QoS weight. (4) Maintenance of QoS path when
path breaks due to mobility of node or link failure. To test the
performance effectiveness of the approach, we have analyzed
the performance parameters like packet delivery ratio, average
end-to-end delay and overall control overhead. The scheme
performs better as compared to a node-disjoint multipath
routing in MANETs.
Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint
Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with
respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on
improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone
structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved
Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to
adapt the virtual backbone to topology changes. This assumes significance especially in networks that
experience very high mobility. Changes in the network topology caused by node additions, node deletions
and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR
protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying
mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR
protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions.
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.
QUALITY OF SERVICE ROUTING IN MOBILE AD HOC NETWORKS USING LOCATION AND ENERG...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multi path protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETScseij
Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The
Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To
Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We
Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The
Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential
Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each
Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The
Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast
Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route
Maintenance.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Adaptive 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.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
A Review of the Energy Efficient and Secure Multicast Routing Protocols for ...graphhoc
This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanisms.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster 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. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. 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. 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-to-end. 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. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
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.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
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
ECA MODEL BASED QOS AODV ROUTING FOR MANETSIJCNCJournal
Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by
nature. The QoS given to users will be affected by network delay, which can be mitigated by employing
QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding
technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the
entire application is essential, which understands the dynamic nature of the MANET and establishes the
required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA
model and AODV for establishing QoS route.
The simulation results shows that the ECA model gives better results, while considering the local
connectivity time, source to destination connectivity time, number of data packets successfully delivered to
the destination, local and global error correction time, compared to AODV.
Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energ...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
Modern design is crucial in today's digital environment, and this is especially true for SharePoint intranets. The design of these digital hubs is critical to user engagement and productivity enhancement. They are the cornerstone of internal collaboration and interaction within enterprises.
In 2015, I used to write extensions for Joomla, WordPress, phpBB3, etc and I ...Juraj Vysvader
In 2015, I used to write extensions for Joomla, WordPress, phpBB3, etc and I didn't get rich from it but it did have 63K downloads (powered possible tens of thousands of websites).
SOCRadar Research Team: Latest Activities of IntelBrokerSOCRadar
The European Union Agency for Law Enforcement Cooperation (Europol) has suffered an alleged data breach after a notorious threat actor claimed to have exfiltrated data from its systems. Infamous data leaker IntelBroker posted on the even more infamous BreachForums hacking forum, saying that Europol suffered a data breach this month.
The alleged breach affected Europol agencies CCSE, EC3, Europol Platform for Experts, Law Enforcement Forum, and SIRIUS. Infiltration of these entities can disrupt ongoing investigations and compromise sensitive intelligence shared among international law enforcement agencies.
However, this is neither the first nor the last activity of IntekBroker. We have compiled for you what happened in the last few days. To track such hacker activities on dark web sources like hacker forums, private Telegram channels, and other hidden platforms where cyber threats often originate, you can check SOCRadar’s Dark Web News.
Stay Informed on Threat Actors’ Activity on the Dark Web with SOCRadar!
Innovating Inference - Remote Triggering of Large Language Models on HPC Clus...Globus
Large Language Models (LLMs) are currently the center of attention in the tech world, particularly for their potential to advance research. In this presentation, we'll explore a straightforward and effective method for quickly initiating inference runs on supercomputers using the vLLM tool with Globus Compute, specifically on the Polaris system at ALCF. We'll begin by briefly discussing the popularity and applications of LLMs in various fields. Following this, we will introduce the vLLM tool, and explain how it integrates with Globus Compute to efficiently manage LLM operations on Polaris. Attendees will learn the practical aspects of setting up and remotely triggering LLMs from local machines, focusing on ease of use and efficiency. This talk is ideal for researchers and practitioners looking to leverage the power of LLMs in their work, offering a clear guide to harnessing supercomputing resources for quick and effective LLM inference.
Into the Box Keynote Day 2: Unveiling amazing updates and announcements for modern CFML developers! Get ready for exciting releases and updates on Ortus tools and products. Stay tuned for cutting-edge innovations designed to boost your productivity.
In software engineering, the right architecture is essential for robust, scalable platforms. Wix has undergone a pivotal shift from event sourcing to a CRUD-based model for its microservices. This talk will chart the course of this pivotal journey.
Event sourcing, which records state changes as immutable events, provided robust auditing and "time travel" debugging for Wix Stores' microservices. Despite its benefits, the complexity it introduced in state management slowed development. Wix responded by adopting a simpler, unified CRUD model. This talk will explore the challenges of event sourcing and the advantages of Wix's new "CRUD on steroids" approach, which streamlines API integration and domain event management while preserving data integrity and system resilience.
Participants will gain valuable insights into Wix's strategies for ensuring atomicity in database updates and event production, as well as caching, materialization, and performance optimization techniques within a distributed system.
Join us to discover how Wix has mastered the art of balancing simplicity and extensibility, and learn how the re-adoption of the modest CRUD has turbocharged their development velocity, resilience, and scalability in a high-growth environment.
top nidhi software solution freedownloadvrstrong314
This presentation emphasizes the importance of data security and legal compliance for Nidhi companies in India. It highlights how online Nidhi software solutions, like Vector Nidhi Software, offer advanced features tailored to these needs. Key aspects include encryption, access controls, and audit trails to ensure data security. The software complies with regulatory guidelines from the MCA and RBI and adheres to Nidhi Rules, 2014. With customizable, user-friendly interfaces and real-time features, these Nidhi software solutions enhance efficiency, support growth, and provide exceptional member services. The presentation concludes with contact information for further inquiries.
First Steps with Globus Compute Multi-User EndpointsGlobus
In this presentation we will share our experiences around getting started with the Globus Compute multi-user endpoint. Working with the Pharmacology group at the University of Auckland, we have previously written an application using Globus Compute that can offload computationally expensive steps in the researcher's workflows, which they wish to manage from their familiar Windows environments, onto the NeSI (New Zealand eScience Infrastructure) cluster. Some of the challenges we have encountered were that each researcher had to set up and manage their own single-user globus compute endpoint and that the workloads had varying resource requirements (CPUs, memory and wall time) between different runs. We hope that the multi-user endpoint will help to address these challenges and share an update on our progress here.
Check out the webinar slides to learn more about how XfilesPro transforms Salesforce document management by leveraging its world-class applications. For more details, please connect with sales@xfilespro.com
If you want to watch the on-demand webinar, please click here: https://www.xfilespro.com/webinars/salesforce-document-management-2-0-smarter-faster-better/
Prosigns: Transforming Business with Tailored Technology SolutionsProsigns
Unlocking Business Potential: Tailored Technology Solutions by Prosigns
Discover how Prosigns, a leading technology solutions provider, partners with businesses to drive innovation and success. Our presentation showcases our comprehensive range of services, including custom software development, web and mobile app development, AI & ML solutions, blockchain integration, DevOps services, and Microsoft Dynamics 365 support.
Custom Software Development: Prosigns specializes in creating bespoke software solutions that cater to your unique business needs. Our team of experts works closely with you to understand your requirements and deliver tailor-made software that enhances efficiency and drives growth.
Web and Mobile App Development: From responsive websites to intuitive mobile applications, Prosigns develops cutting-edge solutions that engage users and deliver seamless experiences across devices.
AI & ML Solutions: Harnessing the power of Artificial Intelligence and Machine Learning, Prosigns provides smart solutions that automate processes, provide valuable insights, and drive informed decision-making.
Blockchain Integration: Prosigns offers comprehensive blockchain solutions, including development, integration, and consulting services, enabling businesses to leverage blockchain technology for enhanced security, transparency, and efficiency.
DevOps Services: Prosigns' DevOps services streamline development and operations processes, ensuring faster and more reliable software delivery through automation and continuous integration.
Microsoft Dynamics 365 Support: Prosigns provides comprehensive support and maintenance services for Microsoft Dynamics 365, ensuring your system is always up-to-date, secure, and running smoothly.
Learn how our collaborative approach and dedication to excellence help businesses achieve their goals and stay ahead in today's digital landscape. From concept to deployment, Prosigns is your trusted partner for transforming ideas into reality and unlocking the full potential of your business.
Join us on a journey of innovation and growth. Let's partner for success with Prosigns.
We describe the deployment and use of Globus Compute for remote computation. This content is aimed at researchers who wish to compute on remote resources using a unified programming interface, as well as system administrators who will deploy and operate Globus Compute services on their research computing infrastructure.
Designing for Privacy in Amazon Web ServicesKrzysztofKkol1
Data privacy is one of the most critical issues that businesses face. This presentation shares insights on the principles and best practices for ensuring the resilience and security of your workload.
Drawing on a real-life project from the HR industry, the various challenges will be demonstrated: data protection, self-healing, business continuity, security, and transparency of data processing. This systematized approach allowed to create a secure AWS cloud infrastructure that not only met strict compliance rules but also exceeded the client's expectations.
Accelerate Enterprise Software Engineering with PlatformlessWSO2
Key takeaways:
Challenges of building platforms and the benefits of platformless.
Key principles of platformless, including API-first, cloud-native middleware, platform engineering, and developer experience.
How Choreo enables the platformless experience.
How key concepts like application architecture, domain-driven design, zero trust, and cell-based architecture are inherently a part of Choreo.
Demo of an end-to-end app built and deployed on Choreo.
How to Position Your Globus Data Portal for Success Ten Good PracticesGlobus
Science gateways allow science and engineering communities to access shared data, software, computing services, and instruments. Science gateways have gained a lot of traction in the last twenty years, as evidenced by projects such as the Science Gateways Community Institute (SGCI) and the Center of Excellence on Science Gateways (SGX3) in the US, The Australian Research Data Commons (ARDC) and its platforms in Australia, and the projects around Virtual Research Environments in Europe. A few mature frameworks have evolved with their different strengths and foci and have been taken up by a larger community such as the Globus Data Portal, Hubzero, Tapis, and Galaxy. However, even when gateways are built on successful frameworks, they continue to face the challenges of ongoing maintenance costs and how to meet the ever-expanding needs of the community they serve with enhanced features. It is not uncommon that gateways with compelling use cases are nonetheless unable to get past the prototype phase and become a full production service, or if they do, they don't survive more than a couple of years. While there is no guaranteed pathway to success, it seems likely that for any gateway there is a need for a strong community and/or solid funding streams to create and sustain its success. With over twenty years of examples to draw from, this presentation goes into detail for ten factors common to successful and enduring gateways that effectively serve as best practices for any new or developing gateway.
Understanding Globus Data Transfers with NetSageGlobus
NetSage is an open privacy-aware network measurement, analysis, and visualization service designed to help end-users visualize and reason about large data transfers. NetSage traditionally has used a combination of passive measurements, including SNMP and flow data, as well as active measurements, mainly perfSONAR, to provide longitudinal network performance data visualization. It has been deployed by dozens of networks world wide, and is supported domestically by the Engagement and Performance Operations Center (EPOC), NSF #2328479. We have recently expanded the NetSage data sources to include logs for Globus data transfers, following the same privacy-preserving approach as for Flow data. Using the logs for the Texas Advanced Computing Center (TACC) as an example, this talk will walk through several different example use cases that NetSage can answer, including: Who is using Globus to share data with my institution, and what kind of performance are they able to achieve? How many transfers has Globus supported for us? Which sites are we sharing the most data with, and how is that changing over time? How is my site using Globus to move data internally, and what kind of performance do we see for those transfers? What percentage of data transfers at my institution used Globus, and how did the overall data transfer performance compare to the Globus users?
A Comprehensive Look at Generative AI in Retail App Testing.pdfkalichargn70th171
Traditional software testing methods are being challenged in retail, where customer expectations and technological advancements continually shape the landscape. Enter generative AI—a transformative subset of artificial intelligence technologies poised to revolutionize software testing.
Unleash Unlimited Potential with One-Time Purchase
BoxLang is more than just a language; it's a community. By choosing a Visionary License, you're not just investing in your success, you're actively contributing to the ongoing development and support of BoxLang.
Providing Globus Services to Users of JASMIN for Environmental Data AnalysisGlobus
JASMIN is the UK’s high-performance data analysis platform for environmental science, operated by STFC on behalf of the UK Natural Environment Research Council (NERC). In addition to its role in hosting the CEDA Archive (NERC’s long-term repository for climate, atmospheric science & Earth observation data in the UK), JASMIN provides a collaborative platform to a community of around 2,000 scientists in the UK and beyond, providing nearly 400 environmental science projects with working space, compute resources and tools to facilitate their work. High-performance data transfer into and out of JASMIN has always been a key feature, with many scientists bringing model outputs from supercomputers elsewhere in the UK, to analyse against observational or other model data in the CEDA Archive. A growing number of JASMIN users are now realising the benefits of using the Globus service to provide reliable and efficient data movement and other tasks in this and other contexts. Further use cases involve long-distance (intercontinental) transfers to and from JASMIN, and collecting results from a mobile atmospheric radar system, pushing data to JASMIN via a lightweight Globus deployment. We provide details of how Globus fits into our current infrastructure, our experience of the recent migration to GCSv5.4, and of our interest in developing use of the wider ecosystem of Globus services for the benefit of our user community.
Providing Globus Services to Users of JASMIN for Environmental Data Analysis
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs
1. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
DOI : 10.5121/ijasuc.2010.1305 59
Adaptive QoS Multicast Routing with Mobility
Prediction in MANETs
G. Santhi1
and Dr.Alamelu Nachiappan2
1
Assistant Professor, Department of IT, Pondicherry Engineering College.
2
Associate Professor, Department of EEE, Pondicherry Engineering College.
shanthikarthikeyan@yahoo.co.in nalam63@yahoo.com
ABSTRACT
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.
KEYWORDS: MANETs, Multi-constrained routing multicasting, clusters, end-to-end delay, packet loss
ratio.
1. INTRODUCTION
A MANET is a dynamically re-configurable wireless network with no fixed infrastructure. In such
a network, each mobile node operates not only as a host but also as a router and it can move in
any direction. Such networks have recently drawn significant research attention since they offer
unique benefits and versatility with respect to bandwidth spatial reuse, intrinsic fault tolerance and
low-cost rapid deployment. In order to facilitate communication within the network, a routing
protocol is used to discover routes between nodes [1]. The primary goal of such an ad hoc
network routing protocol is to provide an efficient route establishment between a pair of nodes so
that messages may be delivered in a timely manner. Route construction should be done with a
minimum of overhead and bandwidth consumption.
The increasing popularity of collaborative multimedia applications is enabling the support for
multicast communication. Multicasting plays an important role in ad hoc networks when
applications must send the same data to more than one destination. Multicasting facilitates
bandwidth saving, reduced delays and high scalability. Most of conventional multicast protocols
were designed for best-effort data traffic [15]. They construct multicast trees primarily based on
connectivity. Such trees may be unsatisfactory when Quality of Service is considered due to the
lack of resources. QoS is more difficult to guarantee in ad hoc networks than in other type of
networks, because the wireless bandwidth is shared among adjacent nodes and the network
2. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
60
topology changes as the nodes move. With the extensive applications of MANETs in many
domains, the appropriate QoS metrics should be used, such as bandwidth, delay, packet loss rate
and cost for multicast routing [16]. Mobility prediction has also been applied to determine the
duration of life time between two connected mobile nodes using GPS [11]. Using mobile
prediction mechanism the proposed scheme chooses the most stable links which satisfy the
multiple QoS constraints in MANETs .
This paper presents a QoS multicast routing protocol with mobility prediction to meet the
requirement of a single call under multiple QoS constraints. The rest of the paper is organized as
follows. Related work is presented in the next section. Section 3 explains the network model,
mobility prediction mechanism and agent model. In Section 4, the proposed QoS aware multicast
routing is explained in detail. Some simulation results are presented in section 5. The paper
concludes with section 6.
2. RELATED WORKS
Multicast routing protocols in ad hoc networks must deal with typical limitations of these
networks, which include high power consumption, low bandwidth, and high error rates. Most of
the conventional multicast protocols are designed for maximizing the throughput or for
minimizing the end-to-end delay. When QoS is considered some protocols may be unsatisfactory
or impractical due to the lack of the resource and the excessive computation overhead [1]. Some
algorithms [2] provide heuristic solutions to the NP-complete constrained Steiner tree problem,
which is to find the delay-constrained least-cost multicast trees. These algorithms however are not
practical in the Internet environment because they have excessive computation overhead, require
knowledge about the global network state, and do not handle dynamic group membership.
Jia’s distributed algorithm [3] does not compute any path or assume the unicast routing table can
provide it. However, this algorithm requires excessive message processing overhead. The
spanning join protocol [4] handles dynamic membership and does not require any global network
state. However, it has excessive communication and message processing overhead because it
relies on full flooding to find a feasible tree branch to connect a new member. QoS MIC, proposed
by Faloutsos et al. [5] alleviates but does not eliminate the flooding behavior. In addition, an extra
control element, Manager router, is introduced to handle the join requests of new members.
QMRPCAH proposed by Layuan et al.[6] provides multiple guarantees for satisfying multiple
constraints but it does not maintain any global network state. The Source Routing-based
Multicast Protocol (SRMP) is an on-demand multicast routing protocol proposed in [7]. Route
selection takes place through establishing a multicast mesh, started at the multicast receivers, for
each multicast session. In SRMP, two important issues in solving the routing problems are
addressed: a) path availability concept and higher battery life concept. The former allows the
protocol to distinguish between available and unavailable paths.
A new scalable QoS multicast routing protocol (SoMR) that has very small communication
overhead and requires no state outside the multicast tree is proposed in [8]. A QoS Multicast
Routing protocol (QMR) with a flexible hybrid scheme for QoS multicast routing is proposed in
[9]. QMR is a mesh-based protocol which is established on-demand to connect group members
and provides QoS paths for multicast groups. The QMR protocol integrates bandwidth
reservation function into a multicast routing protocol with the assumption that available
3. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
61
bandwidth is constant and equal to the raw channel bandwidth. Admission control mechanism is
used to prevent intermediate node from being overloaded and reject requests of new sources if
there is no available bandwidth. An agent based multicast routing scheme (ABMRS) in MANETs,
which uses a set of static and mobile agents for route discovery and maintenance is proposed in
[10]. But it doesn’t consider the multiple QoS constraints.
In MANETs, all the nodes are free to move around randomly and network topoly changes
dynamically. Due to these characteristic, the routing path is often invalidation. So, it is important
that a stable routing is to be found [11]. Thus, predicting the mobility of nodes is an effective and
feasible method. At present, the mobility prediction methods are path availability models [12],
prediction-based link availability estimation[13], link expiration time model [14] and prediction
strategy. Link expiration time model predicts link stability between two nodes according to the
node’s information such as location, velocity, and direction etc with the aid of Global Position
System (GPS).
It is observed from the literature that still multicast routing with QoS needs much more attention
so that the routing scheme must be robust, maximize packet delivery ratio and adapt dynamically
to changes un MANET topology and environment. This paper proposes a QoS aware multicast
routing scheme with mobility prediction that ensures QoS guarantees such as bandwidth
reservation, delay constraint, delay-jitter and minimum cost to multicast sessions
3. PROPOSED WORK
This section describes the functioning of the proposed multicast routing scheme. It includes the
following steps.
3.1. QoS multicast model
As far as routing is concerned, a network is usually represented as a weighted digraph G = (V, E),
where V denotes the set of nodes and E denotes the set of communication links connecting the
nodes. Let Φ denotes the set of multicast nodes, Φ V. |V| and |E| denote the number of nodes and
links in the MANET, respectively. Let s Є Φ be source node of a multicast tree, and M {Φ –
{s}} be a set of end nodes of the multicast tree. Let R be the positive weight and R+
be the
nonnegative weight.
• For any Link, e Є E, we can define some QoS. metrics: delay function delay (e): E →R,
packet loss ratio plr(e): E→R, bandwidth function bandwidth(e): E→R and delay jitter
function delay jitter(e): E→R.
• Similarly, for any node n Є V, one can also define some metrics: delay function
delay(n): V → R, packet-loss function packet-loss(n): V→ R+,
delay jitter function delay
jitter(n): V→ R+
We also use T (s, M) to denote a multicast tree in which the following relationships hold:
Delay (p(s,t)) = ∑ eЄP(s,t) delay(e) + ∑ nЄ P(s,t) delay(n)
Bandwidth (p(s,t)) = min{bandwidth(e), e Є P(s,t)}
Packet-loss (p(s,t)) = 1 – ΠnЄP(s,t) (1-packet-loss(n))
Delay-jitter (p(s,t) = ∑eЄP(s,t) delay – jitter(e) + ∑nЄP(s,t) delay – jitter(n)
4. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
62
Cost(T(s,M)) = ∑ eЄT(s,M) cost(e) + ∑ nЄ T(s,M) cost(n).
where p(s, t) denotes the path from source s to end node t of T(s,M).
Delay Constraint : delay(p(s,t))≤ Dt
Bandwidth Constraint : bandwidth(p(s, t))≥B
Packet loss Constraint : packet-loss(p(s,t)) ≤ L
Delay jitter Constraint : delay-jitter(p(s,t)) ≤ J
Meanwhile, the Cost(T(s,M)) should be minimum. Where, D is delay constraint, B is bandwidth
constraint , L is packet loss constraint and J is the delay Jitter constraint.
3.2. Mobile Prediction mechanism
In mobile ad hoc network, the reliability of a path depends on the stability or availability of each
link of this path because of the dynamic topology changes frequently. It supposes a free space
propagation model [9], where the received signal strength solely depends on its distance to the
transmitter. Therefore, using the motion parameters (such as speed, direction, and the
communication distance) of two neighbors, the duration of time can be determined in order to
estimate that two nodes remain connected or not. Suppose two nodes i and j are within the
transmission distance ra between them. Let (xi, yi) and (xj, yj) be the coordinate of mobile host i
and mobile host j. Also let (vi, θi) be the speed and the moving direction of node i, let (vj, θj) be
the speed and the moving direction of node j. The LET (Link Expiration Time) is predicted by [9]:
- (ab+cd) + (a2
+c2
) r2
– (ad – bc)2
LET(i,j) =
a2
+c2
------------------- (1)
Note that a = v1cosθ1 − v2cosθ 2 , b= x1 −x2 , c = v1sinθ1 − v2Sinθ2 , and d = y1−y2 . Note also
that the equation cannot be applied when v1 = v2 and θ 1= θ 2 , and when LET is ∞. In order to
get and utilize the information from GPS, the packets must include extra fields. When a source
node sends a request packet, the packet appends its location, direction, and speed. The next hop
neighbor of the source node receives the request packet to predict the duration of time between
itself and the source node. If node B is the next hop of the packet for node A, node A will insert its
location information in the packet so node B will be able to compute the duration of time between
node A and node B.
Assume that l is a routing path and (l1, l2, … lk) is the set of all the links along each hop l. The
route expiration time of RET(l) is the minimum of the LETs along path l and can be written as the
following equation:
RET(l) = min (LET(li)) --------------------- (2)
iє(1,2,...k)
5. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
63
3.3. Agent model
The proposed scheme employs a set of static and mobile agents. Agents use their own
knowledgebase to achieve the specified goals without disturbing the activities of the host. The
primary goal of an agent is to deliver information of one node to others in the network. Here, the
agents are used to find the multicast routes and to create the backbone for reliable multicasting. It
comprises a set of following agents and maintains a knowledgebase for inter agent
communication.
• Knowledge Base: The knowledgebase maintains a set of network state variables such as
status of the node (cluster head, child, others) available power, bandwidth, number of
movements made in recent interval, group id, neighbor ids and their status.
• Route Discovery Agent (RDA): It is a static agent that runs on nodes, creates agents and
knowledge base, controls and coordinates the activities of the multicast routing agency.
• Node Manager Agent (NMA): It maintains the multicast tree and provides group ID to all
the members of the packet-forwarding nodes in the multicast tree.
• Link Management Agent (LMA): When a node moves out of the communication range or
dies, LMA initiate route error (RERR) message to the upstream node and again initiates
the route request.
•
Figure 1. Routing agent model
To initiate multicasting, the mobile agent which resides in the source node provides group ID and
distributes multicast key to all the group members. The source node examines all the QoS metric
values of next intermediate node using the knowledgebase of agents. If it satisfies all constraints
data transmission takes place among all multicast members. When an intermediate node either
moves out of the range or fails, the static agent resides at the node that monitored such a situation
will find out the new alternate path with minimum cost between the nodes. The alternate path and
its connectivity to the network are broadcast, so that the new forwarding table is generated at
every node. The agents update their knowledgebase with more recent values.
6. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
64
3. QoS aware Multicast Routing Protocol with Mobility Prediction
(MPQMRP)
In this section we propose a QoS aware multicast routing protocol with mobility prediction. In
MPQMRP we create a multicast tree for transmitting data packets. The proposed protocol
includes the route discovery process and route maintenance process.
4.1. Route Discovery Process
In MPQRMP, the route discovery process is initiated whenever a source node needs to
communicate with another node for which it has no routing information in its table. Here the RDA
takes care of the routing process. It provides the one hop information to the source node. By using
this information, the source node initiates the route discovery by broadcasting a route request
(RREQ) packet to its neighbors. The route request packet includes (sequence_id, Xi,Yi, θi, Vi,
Source ID, Destination ID, D,J,B,C ) fields. When a node receives a new RREQ, it looks in its
route table for the destination. If it doesn’t match, then
it checks the available bandwidth between them. If the available bandwidth is above the
constrained bandwidth then it will utilize the location information to get the LET between the
nodes. Now, the intermediate node forwards the RREQ to its own neighbors after updating its
own information. In the
Figure 3. Route discovery process
above Fig. 3, node ‘s’ is the multicast source. D1 and D2 are the destinations. The network’s edge
are described by four tuples (B,D,J,C) where B is the Bandwidth constraint, D is the delay
constraint, J is the delay-jitter constraint and C is Cost. In this example, B, D, J, C constraints are
specified as 45, 15, 30 and 60 respectively. The source node ‘s’ broadcast the RREQ packet to all
of its one hop neighbors and it is received by n1, n5 and n6 respectively. All the receiving nodes
check the destination id , but it doesn’t match with them. In this example the bandwidth
constraint 45 is satisfied by the links between the nodes n5 n7 and n1 n2 are satisfied and
hence they forward the RREQ packets to its neighbors. At the same time the link n5 n6 does not
satisfy the bandwidth constraint and it discards the route request. This process is continued until
the RREQ packet reaches the destination. After receiving RREQ packet, each receiving node
calculates the LET between the nodes.
n1
s
n6
n5
n2
n3
n7
n8
d1
d2
50,5,4,10
45,2,7,12
50,2,1,4
502,5,1
2
45,2,6,12
50,4,4,10
(45,3,8,20
24,3,8,20
45,2,6,12
25,2,6,12
45,2,6,10
7. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
65
Figure 3. Route relay process
Each destination node sends it Route Reply (RREP) packet back to the source node. Source node
receives all the destination nodes reply packets and selects the path with highest RET. The
Network Management Agent (NMA) takes care of the multicast data transmission. In the above
example, from source ‘s’ to destination node ‘d1’ there are fours paths exist.
S n1 n2 n3 d1, S n1 n2 n8 d1, S n5 n7 n8 d1, and S n6 n7 n8 d1.
Among these four paths S n1 n2 n8 d1, S n6 n7 n8 d1 do not satisfy the delay
constraints. The paths S n2 n3 d1 and S n5 n7 n8 d1 satisfy delay, delay-jitter, and
bandwidth constraints.
Route path R(S,n1,n2,n3,d1) R(S,n5,n7,n8,d1)
RET 8 6
Table 1. Paths and their RET values
The RET in these paths are calculated and the route with maximum RET and least cost is selected
for data transmission. The RET of the above example is depicted in Table 1.
Figure 4. Reliable multicast tree
In the above figure 5, the route R(S,n1,n2,n3,d1) which has the maximum RET and selected for
data transmission
45,2,7,12
n1
s
n6
n5
n2
n3
n7
n8
d1
d2
50,5,4,1050,2,1,14
502,5,12
45,2,6,12
50,4,4,10
(45,3,8,20)
45,3,8,20)
45,2,6,12
50,2,6,12
45,2,6,10
45,2,7,12
45,2,6,12
n1
s
n6
n5
n2
n3
n7
n8
d1
d2
50,5,4,1050,2,1,4
502,5,1
2
45,2,6,12
50,4,4,10
(45,3,8,20
24,3,8,20
25,2,6,12
45,2,6,10
8. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
66
4.2. MPQMRP routing Algorithm
The routing algorithm used in MPQMRP protocol is as follows.
Input: a network G = (V,E) and a QoS reuest R = (Source ID, Destiation IDs, B,J,D,C)
Output : a routing path P that satisfies the QoS request R.
For each destination Do
Step 1. Source node broadcasts the RREQ packet to all of its one-hop neighbors.
Step 2: If the packet is new, and node is destination and the link of the node pair can
satisfy the QoS requirements such as Bij ≥ B, Dij ≤ D and Jij ≤ J then directly send the
message.
Step 3: Else, if the packet is new and the node is not destination and Bij ≥ B then
forward the packet to all one-hop neighbors. Calculate LET between them using
the equation (1).
Step 4: Repeat step 3 until the RREQ packet reaches the destination.
Step 5: Find the collection of routing path from the source to destination.
Let them be R1, R2, …Rn.
Step 6: For each routing path Ri Do
Calculate ∑ Dij , ∑Jij and ∑ Cij
{if ∑ Dij ≤ D and ∑Jij ≤ J then calculate RET using formula ( )
Else
Delete the routing path from the collection.
Step 7: Select the routing path with maximum RET. If more than path exists with equal
RET select the path with minimum cost ∑ Cij.
Step 8: End routing.
4.3. Route Maintenance Process
Due to the dynamic nature of the network topology and restricted resources, the established route
often gets invalid. When the link is disconnected, the LMA informs it to the upstream node. This
node removes the corresponding entry from its multicast routing table and sends route reconstruct
packet to the source. The source starts to discovery the route again. Similarly, when a node wants
to join a multicast tree, it broadcast a join request across the networks. Only a node that is a
member of a multicast tree may respond. It creates a reverse route entry to the new node and
broadcasts the join request packet to its neighbors. Each member node of the multicast tree
receives join request and make its entry in the routing table and send back the join reply packet to
the new node.
9. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
67
5. Simulation
The proposed scheme has been simulated in various network scenarios using NS-2 simulator. A
discrete event simulation is done to test operation effectiveness of the scheme. In this section we
describe the simulation model and the simulation procedure.
5.1. Simulation model
A mobile ad hoc network consisting of ‘n’ nodes is generated by using a random placement of the
nodes and allowed for the free movement within the area of ‘l x b’m2
. Each node starts from a
random location and moves in all directions. A maximum number of movements allowed per node
every period ‘per’ is ‘move_max’. The communication range for each node is selected as ‘C_ran’.
All nodes are considered to be non-malicious and are included in the clustering scheme. All nodes
must support an agent server, interpreter and transport mechanism. Every node has enough
memory to support the agent’s knowledge database. Every mobile agent is only allowed three
hops from the parent node to avoid network congestion.
Table 2. Simulation parameters
Parameters Value
MAC Layer IEEE 802.11
Simulation area(m) 1000*1000
Simulation Time 60 secs
Number of nodes 25
Node mobility speed 0-60m/s
Mobility pattern Random way point
Traffic flow CBR
Packet size 512 bytes
Transmission range 250m
5.2. Simulation Procedure
To illustrate some results of the simulation, we have taken n = 50, l = 1000 m and b = 1000 m, per
= 100 s, move_max = 2, C_ran = 225 m. D=15, J=30, B=45, C=60 are given as user input for
various scenarios. The proposed routing scheme is evaluated in terms of packet delivery ratio,
end-to-end delay and control overhead.
• Packet delivery ratio: The ratio of the average number of data packets received by the
destination node to the number of data packets transmitted by the multicast source.
• End-to-end delay: The time when a data packet is sent by the source to the time the data
packet is received at the destination node.
• Control overhead: The total number of control received by the destination node.
10. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
68
5.3. Analysis of results
5.3.1. Packet Loss ratio: Figure 5. shows the performance of the average packet loss ratio under
various mobility speeds. The packet loss ratio is increased with increasing mobility due to more
link breaks.
Figure 5. Packet loss ratio vs. mobility speed
When the mobility is low, the multicast tree structure was mostly static and therefore the
packet loss ratio is low. In MPQMRP, the required resources are reserved in advance and the
most stable path is also identified with maximum RET. Hence the packet loss ratio of
MPQMRP is higher than that of MAODV. Packet loss ratio of the proposed system is less
than MAODV for all group size values. This is because of finding more reliable path and
managing node breakage thereby avoiding the recomputation of route. As the group size
increases packet loss ratio also increases since the entire nodes share the common wireless
medium for transmission of packets.
5.3.2. End-to-End delay: Figure 6.a. shows the performance of the end-to-end delay under
various mobility speeds. As the mobility speed increases average end to end delay also
increases.
Figure 6 a) End-to-End delay Vs group size Figure 6 b) End-to-End delay Vs mobility speed
11. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
69
Packet delivery latency is significantly less than that for MPQMRP compared to MAODV
(Figure 6.b) even at higher node mobility for constant group size. This is due to the fact,
forwarding nodes chosen are reliable nodes and are less prone to scarcity of resource. Also once
the transmission path breaks, the intermediate node chooses another backup path immediately for
transmitting the data packets.
5.3.3. Control overhead: Figure 7. shows the performance of the control overhead under
various mobility speeds. As was expected the control overhead increased as the number of nodes
increases. The reason is that the inclusion of extra fields in RREQ packer header. Also, the
number of route broadcasts increased when the group size increases.
Figure 7. Control overhead vs. Group size
6. Conclusions
This paper proposes a QoS aware multicast routing algorithm with mobility prediction based on
mobile agents. It effectively routes data packets to group members even in case of high mobility
and frequent link failures. A set of static and mobile agents are used to carry out route discovery
and route maintenance process. This routing path satisfies multiple QoS constraints according to
the QoS demand. It has higher packet delivery ratio as compared to MAODV and reduces end-
to-end delay. This work can further be extended to include the mobile prediction scheme for
multiple multicast trees.
7. References
[1] Luo Junhai and Ye Danxia et al., “A survey of multicast routing protocols for Mobile ad-hoc networks”
IEEE Communication surveys & Tutorials, vol.11, no.1, pp.78-90, First Quarter 2009.
[2] Luo Junhai, Xue Liu, Ye Danxia, Research on multicast routing protocols for mobile ad-hoc networks.
Computer Networks 52(5): 988-997, 2008.
[3] X.Jia A distributed algorithm of delay-bounded multicast routing protocol for multimedia applications
in wide area networks, IEEE/ACM Transactions on Networking 6(6), 1998, 828-837.
[4] L.Layuan et al., “A QoS guaranteed multicast routing protocol”, Computer communication, vol.27/1,
2004, 56-69.
[5] M. Faloutsos et al., QoSMIC: Quality of service sensitive multicast internet protocol. SIGCOMM’ in:
Proceedings of 98, September 1998, 56-63.
[6] Li Layuan et al., “A QoS multicast routing protocol for clustering mobilie ad hoc network” Computer
Communication 30(2007), 1641-1654.
12. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010
70
[7] M. Shree, J.J. Garcia-Luna-Aceves, An efficient routing protocol for wireless networks, ACM Mobile
Networks and Applilcation Journal 1 (1996) 183-197.
[8] J. H. Cui and L.Lao et al. AQoSM: Scalable QoS multicast provisioning in Diff-Serv networks,
Computer Networks 50 (2005) 80-105.
[9] Huayi Wu and Xiaohua Jia QoS multicast routing by using multiple paths/tress in wireless ad hoc
networks, Ad Hoc Networks 5 (2007), 600-612.
[10] S. S. Manvi, M. S. Kakkasageri, Multicast routing in mobile ad hoc networks by using a multiagent
system. Inf. Sci. 178(6): 1611-1628, 2008.
[11] Xiaoyan ZHU and Jin LIAN A QoS multicast routing protocol with mobile prediction based on
MAODV in MANETs, International Conference on Computer Science and Software Engineering, 355-357,
2008.
[12] McDonald et al., “Path availability model for wireless ad hoc networks” Proceeding of IEEE wireless
communications, 1999, (WCNC ’99).
[13] Jiang Shengming et al., “A prediction based link availability estimation for mobile ad-hoc networks”
IEEE Infocom, 2001.
[14] Su W.Lee Sung-Ju et al., “ Mobility predictin and routing in ad-hoc wireless networks”» International
Journal of Network Management, 2001.
[15] E.M. Royer and C.E.Perkins, “Multicast operation of the ad-hoc on-demand distance vector routing
protocol”, in Proc. ACM MOBICOM, Aug. 1999, pp. 207-218.
[16] M. Saghir. T.C Wan, R. Budiarto, A new cross-layer framework for QoS multicast applications in
mobile ad hoc networks, International Journal of Computer Science and Network Security 6 (2006) 142-
151.