1. The document discusses load aware and load balancing techniques using multipath routing in mobile ad hoc networks (MANETs).
2. It notes that effective load balancing is challenging in MANETs due to their dynamic nature and topology changes. Nodes can differ significantly in communication and processing capabilities.
3. The paper proposes identifying multiple routing backbones from source to destination using intermediate nodes with better capabilities, to improve load balancing, quality of service, and congestion control based on network traffic levels and node loads.
This document summarizes research on load balancing techniques for congestion control in mobile ad hoc networks (MANETs). It first provides background on MANETs and issues like limited bandwidth. It then reviews literature on multipath routing and load balancing, categorizing approaches based on metrics like available bandwidth. The document proposes using acknowledgement times to estimate available bandwidth and distribute traffic to avoid congestion across multiple paths. By adapting sending rates based on estimated available bandwidth, this could minimize congestion in the network.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such
Networks are frequently limited by the network split due to either energy depletion or node mobility of the
mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths
becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path
breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric
system of measurement used to select the paths takes into account the stability of the nodes and the
equivalent links.
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes a study that evaluates the performance of four routing protocols - FSR, STAR-LORA, DYMO, and DSR - in a mobile ad hoc network (MANET) simulation using QualNet. Two scenarios were tested: one with constant bit rate (CBR) client traffic and one with CBR server traffic. Performance metrics like throughput, average end-to-end delay, and average jitter were measured for 2, 4, 6, 8, and 12 nodes. The results showed that reactive protocols DYMO and DSR generally had lower delay but higher jitter than proactive protocols FSR and STAR-LORA. This study aims to help identify the most efficient routing
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.
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.
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.
The document summarizes an Efficient Position-Based Opportunistic Routing (EPOR) protocol proposed for mobile ad hoc networks. EPOR takes advantage of geographic routing and the broadcast nature of wireless transmissions. When a packet is transmitted, overhearing nodes can act as forwarding candidates. The best forwarder is chosen, but if it fails to forward in time, a suboptimal candidate will forward instead to avoid transmission interruptions. Simulation results show EPOR achieves higher packet delivery ratios and lower end-to-end delays than GPSR and AOMDV routing protocols, even under high node mobility.
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.
This document summarizes research on load balancing techniques for congestion control in mobile ad hoc networks (MANETs). It first provides background on MANETs and issues like limited bandwidth. It then reviews literature on multipath routing and load balancing, categorizing approaches based on metrics like available bandwidth. The document proposes using acknowledgement times to estimate available bandwidth and distribute traffic to avoid congestion across multiple paths. By adapting sending rates based on estimated available bandwidth, this could minimize congestion in the network.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such
Networks are frequently limited by the network split due to either energy depletion or node mobility of the
mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths
becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path
breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric
system of measurement used to select the paths takes into account the stability of the nodes and the
equivalent links.
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes a study that evaluates the performance of four routing protocols - FSR, STAR-LORA, DYMO, and DSR - in a mobile ad hoc network (MANET) simulation using QualNet. Two scenarios were tested: one with constant bit rate (CBR) client traffic and one with CBR server traffic. Performance metrics like throughput, average end-to-end delay, and average jitter were measured for 2, 4, 6, 8, and 12 nodes. The results showed that reactive protocols DYMO and DSR generally had lower delay but higher jitter than proactive protocols FSR and STAR-LORA. This study aims to help identify the most efficient routing
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.
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.
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.
The document summarizes an Efficient Position-Based Opportunistic Routing (EPOR) protocol proposed for mobile ad hoc networks. EPOR takes advantage of geographic routing and the broadcast nature of wireless transmissions. When a packet is transmitted, overhearing nodes can act as forwarding candidates. The best forwarder is chosen, but if it fails to forward in time, a suboptimal candidate will forward instead to avoid transmission interruptions. Simulation results show EPOR achieves higher packet delivery ratios and lower end-to-end delays than GPSR and AOMDV routing protocols, even under high node mobility.
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.
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.
This document analyzes the effect of node density on different routing protocols under FTP and HTTP applications. It simulates scenarios with varying node densities (20-130 nodes) using routing protocols AODV, DSR, GRP and OLSR. Key quality of service (QoS) metrics - throughput, delay, network load and packet delivery ratio - are evaluated and compared. The results show that OLSR generally performs best in terms of throughput and delay for both FTP and HTTP applications. GRP performs best for network load, while AODV has the highest packet delivery ratio for FTP. In conclusion, OLSR is the best overall routing protocol for supporting FTP and HTTP applications in mobile ad-hoc networks according to
A survey on routing algorithms and routing metrics for wireless mesh networksMohammad Siraj
This document summarizes a survey on routing algorithms and metrics for wireless mesh networks. It discusses the requirements of efficient mesh routing protocols including being distributed, adaptable to topology changes, loop-free, secure, scalable, and supporting quality of service. It reviews several important proactive routing protocols including destination-sequenced distance-vector routing, optimized link state routing, and mesh networking routing protocol. It also discusses reactive routing protocols and examples like dynamic source routing and ad hoc on-demand distance vector routing. Finally, it examines routing metrics and their impact on the performance of wireless mesh networks.
A comparative study in wireless sensor networksijwmn
This document summarizes and compares several routing algorithms proposed for wireless sensor networks. It discusses algorithms that aim to improve reliability, power efficiency, lifetime, and fault tolerance. The evaluation section compares how each algorithm addresses challenges like reliability, energy conservation, and adapting to topology changes. While various algorithms achieve improvements in areas like power efficiency and lifetime, most still have limitations and do not fully address all the key challenges for wireless sensor networks.
This document summarizes a research paper that examines the performance of three mobile ad hoc network (MANET) routing protocols: AODV, DSR, and DSDV. Through network simulations varying the number of nodes and connections, the paper evaluates the routing protocols based on average end-to-end delay, normalized routing load, packet delivery fraction, and throughput. The simulation results show that AODV generally has better performance than DSR and DSDV in terms of lower delay, higher packet delivery, and better throughput, especially as the network size increases. However, DSDV maintains more consistent performance than the reactive protocols as network conditions change.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
Performance comparison of routing protocols in mobile ad hoc networksijujournal
Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have elaborated several routing protocols that possess different performance levels. In this paper we give a performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc
Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to End Delay, Normalised Routing Load and Average Throughput.
P ERFORMANCE C OMPARISON OF R OUTING P ROTOCOLS IN M OBILE A D H OC N E...ijujournal
Routing protocols have
an important
role in any
Mobile Ad Hoc Network
(MANET).
Researchers
have
elaborated several routing protocols that possess different performance levels
. In this
p
aper
we
give a
performance evaluation of
AODV,
DSR,
DSDV
, OLSR and DYMO
routing protocol
s
in
Mobile Ad Hoc
Networks
(MANETS)
to
determine
the best
in different scenarios
. We
analyse
these
MANET
routing
protocols by
using
NS
-
2 simulator
. We specify how
the
Number of No
d
es
parameter influences
their
performance. In this study
,
performance is
calculated
in terms
of Packet Delivery Ratio,
Average
End to
End Delay, Normalised Routing Load and Average Throughput
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.
A Performance Comparison of Routing Protocols for Ad Hoc NetworksIJERA Editor
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many routing protocols have been proposed like OLSR, AODV so far to improve the routing performance and reliability. In this paper, we describe the Optimized Link State Routing Protocol (OLSR) and the Ad hoc On-Demand Distance Vector (AODV). We evaluate their performance through exhaustive simulations using the Network Simulator 2 (ns2) by varying conditions (node mobility, network density).
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
IRJET- Survey on Enhancement of Manet Routing ProtocolIRJET Journal
This document discusses routing protocols for mobile ad hoc networks (MANETs). It provides an overview of several popular routing protocols, including AODV, DSDV, DSR, AOMDV and discusses their advantages and disadvantages. The document aims to analyze how the AOMDV protocol could be improved, for example by considering nodes' remaining battery power. It proposes developing a new routing algorithm based on this to achieve better performance than existing protocols.
This document summarizes a research paper on load balancing protocols in mobile ad hoc networks (MANETs). It begins with an abstract of the paper and introduces MANETs and the importance of load balancing in them given nodes' limited resources. It then discusses various load metrics and load balancing routing protocols. Specific protocols covered include Ad Hoc On-Demand Distance Vector (AODV), Ad hoc On-Demand Multipath Distance Vector (AOMDV), and Scalable Multipath On-Demand Routing (SMORT). AOMDV and SMORT aim to compute multiple loop-free paths during route discovery to help balance traffic load across multiple paths. The document concludes that load balanced routing protocols use different metrics to select routes
International Journal of Pharmaceutical Science Invention (IJPSI)inventionjournals
International Journal of Pharmaceutical Science Invention (IJPSI) is an international journal intended for professionals and researchers in all fields of Pahrmaceutical Science. IJPSI publishes research articles and reviews within the whole field Pharmacy and Pharmaceutical Science, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
Performance Comparison and Analysis of Table-Driven and On-Demand Routing Pro...Narendra Singh Yadav
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an ad hoc network routing protocol is correct and 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. This paper examines two routing protocols for mobile ad hoc networks– the Destination Sequenced Distance Vector (DSDV), the table- driven protocol and the Ad hoc On- Demand Distance Vector routing (AODV), an On –Demand protocol and evaluates both protocols based on packet delivery fraction, normalized routing load, average delay and throughput while varying number of nodes, speed and pause time.
You are awoken by the sound of your 6:00am alarm with butterflies in your stomach. Thinking about some of the rules in a surfing competition, the first thing you do is to call the organizers hotline to find out where you will be competing today. After a light breakfast, you jump in your car and drive down the beach to meet with your friends and fellow competitors
The document summarizes the origins and history of ancient Rome from its founding in 753 BC to the fall of the Western Roman Empire in 476 AD. It describes how Rome was founded by Romulus on the banks of the Tiber River and later conquered by the Etruscans. It then outlines the major periods of Roman history including the Monarchy, Roman Republic, and Roman Empire. Key events like the rule of Julius Caesar and the division of the empire are also summarized.
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.
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.
This document analyzes the effect of node density on different routing protocols under FTP and HTTP applications. It simulates scenarios with varying node densities (20-130 nodes) using routing protocols AODV, DSR, GRP and OLSR. Key quality of service (QoS) metrics - throughput, delay, network load and packet delivery ratio - are evaluated and compared. The results show that OLSR generally performs best in terms of throughput and delay for both FTP and HTTP applications. GRP performs best for network load, while AODV has the highest packet delivery ratio for FTP. In conclusion, OLSR is the best overall routing protocol for supporting FTP and HTTP applications in mobile ad-hoc networks according to
A survey on routing algorithms and routing metrics for wireless mesh networksMohammad Siraj
This document summarizes a survey on routing algorithms and metrics for wireless mesh networks. It discusses the requirements of efficient mesh routing protocols including being distributed, adaptable to topology changes, loop-free, secure, scalable, and supporting quality of service. It reviews several important proactive routing protocols including destination-sequenced distance-vector routing, optimized link state routing, and mesh networking routing protocol. It also discusses reactive routing protocols and examples like dynamic source routing and ad hoc on-demand distance vector routing. Finally, it examines routing metrics and their impact on the performance of wireless mesh networks.
A comparative study in wireless sensor networksijwmn
This document summarizes and compares several routing algorithms proposed for wireless sensor networks. It discusses algorithms that aim to improve reliability, power efficiency, lifetime, and fault tolerance. The evaluation section compares how each algorithm addresses challenges like reliability, energy conservation, and adapting to topology changes. While various algorithms achieve improvements in areas like power efficiency and lifetime, most still have limitations and do not fully address all the key challenges for wireless sensor networks.
This document summarizes a research paper that examines the performance of three mobile ad hoc network (MANET) routing protocols: AODV, DSR, and DSDV. Through network simulations varying the number of nodes and connections, the paper evaluates the routing protocols based on average end-to-end delay, normalized routing load, packet delivery fraction, and throughput. The simulation results show that AODV generally has better performance than DSR and DSDV in terms of lower delay, higher packet delivery, and better throughput, especially as the network size increases. However, DSDV maintains more consistent performance than the reactive protocols as network conditions change.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
Performance comparison of routing protocols in mobile ad hoc networksijujournal
Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have elaborated several routing protocols that possess different performance levels. In this paper we give a performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc
Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to End Delay, Normalised Routing Load and Average Throughput.
P ERFORMANCE C OMPARISON OF R OUTING P ROTOCOLS IN M OBILE A D H OC N E...ijujournal
Routing protocols have
an important
role in any
Mobile Ad Hoc Network
(MANET).
Researchers
have
elaborated several routing protocols that possess different performance levels
. In this
p
aper
we
give a
performance evaluation of
AODV,
DSR,
DSDV
, OLSR and DYMO
routing protocol
s
in
Mobile Ad Hoc
Networks
(MANETS)
to
determine
the best
in different scenarios
. We
analyse
these
MANET
routing
protocols by
using
NS
-
2 simulator
. We specify how
the
Number of No
d
es
parameter influences
their
performance. In this study
,
performance is
calculated
in terms
of Packet Delivery Ratio,
Average
End to
End Delay, Normalised Routing Load and Average Throughput
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.
A Performance Comparison of Routing Protocols for Ad Hoc NetworksIJERA Editor
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many routing protocols have been proposed like OLSR, AODV so far to improve the routing performance and reliability. In this paper, we describe the Optimized Link State Routing Protocol (OLSR) and the Ad hoc On-Demand Distance Vector (AODV). We evaluate their performance through exhaustive simulations using the Network Simulator 2 (ns2) by varying conditions (node mobility, network density).
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
IRJET- Survey on Enhancement of Manet Routing ProtocolIRJET Journal
This document discusses routing protocols for mobile ad hoc networks (MANETs). It provides an overview of several popular routing protocols, including AODV, DSDV, DSR, AOMDV and discusses their advantages and disadvantages. The document aims to analyze how the AOMDV protocol could be improved, for example by considering nodes' remaining battery power. It proposes developing a new routing algorithm based on this to achieve better performance than existing protocols.
This document summarizes a research paper on load balancing protocols in mobile ad hoc networks (MANETs). It begins with an abstract of the paper and introduces MANETs and the importance of load balancing in them given nodes' limited resources. It then discusses various load metrics and load balancing routing protocols. Specific protocols covered include Ad Hoc On-Demand Distance Vector (AODV), Ad hoc On-Demand Multipath Distance Vector (AOMDV), and Scalable Multipath On-Demand Routing (SMORT). AOMDV and SMORT aim to compute multiple loop-free paths during route discovery to help balance traffic load across multiple paths. The document concludes that load balanced routing protocols use different metrics to select routes
International Journal of Pharmaceutical Science Invention (IJPSI)inventionjournals
International Journal of Pharmaceutical Science Invention (IJPSI) is an international journal intended for professionals and researchers in all fields of Pahrmaceutical Science. IJPSI publishes research articles and reviews within the whole field Pharmacy and Pharmaceutical Science, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
Performance Comparison and Analysis of Table-Driven and On-Demand Routing Pro...Narendra Singh Yadav
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an ad hoc network routing protocol is correct and 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. This paper examines two routing protocols for mobile ad hoc networks– the Destination Sequenced Distance Vector (DSDV), the table- driven protocol and the Ad hoc On- Demand Distance Vector routing (AODV), an On –Demand protocol and evaluates both protocols based on packet delivery fraction, normalized routing load, average delay and throughput while varying number of nodes, speed and pause time.
You are awoken by the sound of your 6:00am alarm with butterflies in your stomach. Thinking about some of the rules in a surfing competition, the first thing you do is to call the organizers hotline to find out where you will be competing today. After a light breakfast, you jump in your car and drive down the beach to meet with your friends and fellow competitors
The document summarizes the origins and history of ancient Rome from its founding in 753 BC to the fall of the Western Roman Empire in 476 AD. It describes how Rome was founded by Romulus on the banks of the Tiber River and later conquered by the Etruscans. It then outlines the major periods of Roman history including the Monarchy, Roman Republic, and Roman Empire. Key events like the rule of Julius Caesar and the division of the empire are also summarized.
we find out various power aware and data packet rate control with-collision-avoidance (CSMA/CA)-based ad hoc wireless network communication. And identifies that CSMA
Entidades financieras sometidas a la supervisión de laColegioEfeso
Este documento describe las diferentes empresas de servicios de inversión en España, incluyendo sociedades y agencias de valores, sociedades gestoras de carteras, empresas de asesoramiento financiero y el Fondo de Garantía de Inversiones. También describe las instituciones de inversión colectiva como las sociedades de inversión mobiliaria, los fondos de inversión mobiliaria y los fondos de inversión fondtesoros. Finalmente, explica los requisitos para las gestoras y depositarias de instituciones de inversión mobiliaria colectiva
Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energ...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
This document summarizes and surveys several enhanced routing protocols that have been developed for mobile ad hoc networks (MANETs). It begins by providing background on routing challenges in MANETs and classifications of routing protocols. It then describes several traditional and widely used routing protocols, including DSDV, OLSR, TORA, DSR, and AODV. The document focuses on summarizing several new routing protocols that have been proposed to improve upon existing protocols. It discusses protocols such as BAWB-DSR, CCSR, RAMP, AODV-SBA, CBRP-R, and CBTRP - noting techniques, advantages, and disadvantages of each. The overall purpose is to review
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR etc.
A New Theoretical Approach to Location Based Power Aware RoutingIOSR Journals
This document proposes a new theoretical approach to location based power aware routing in mobile ad hoc networks (MANETs). It aims to extend the network lifetime by improving power utilization during routing. The approach uses nodes' location information, remaining battery power, and bandwidth status to assign link stability and select routes with lower "uptime values" and minimum bandwidth over time. This is hypothesized to better utilize nodes' power sources and bandwidth. The document outlines calculating a root up time factor for each node based on its power backup and required power, and only using nodes with maximum backup. It concludes future work will design and validate a new protocol based on this approach.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such Networks are frequently limited by the network split due to either energy depletion or node mobility of the mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric system of measurement used to select the paths takes into account the stability of the nodes and the equivalent links.
Multipath Fault Tolerant Routing Protocol in MANET pijans
Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically
exchange data among themselves without the reliance on a fixed base station or a wired backbone network
and it the makes the routing a crucial issue to the design of the MANET. Multiple path routing protocols
are shown to be performance-effective alternatives over single-path routing for ad hoc networks and it
represents a promising routing method for wireless mobile ad hoc networks. Multi-path routing achieves
load balancing and is more resilient to route failures..In this paper we propose an energy efficient
multipath fault tolerant routing protocol to improve the reliability of data routing in Mobile ad hoc
networks. The proposed RFTA is a multi objective routing protocol that meets diverse application
requirements by considering the changing conditions of the network. The efficiency of the proposed
protocol has been evaluated on different scenarios and there has been a noticeable improvement in the
packet delivery ratio and also in the reduction of end-to-end delay comparing to SMR,SMS and MDSR.
A survey on energy aware routing issues and cross layering in mane tsIAEME Publication
This document summarizes a survey on energy aware routing and cross-layering in mobile ad hoc networks (MANETs). It discusses how energy conservation is critical in MANETs since nodes are battery powered. It reviews existing energy efficient routing protocols and notes they do not consider quality of service parameters. Cross-layer design allows interaction between layers to improve network performance without degrading quality of service. The document surveys energy aware routing using cross-layer approaches to improve energy efficiency while maintaining quality of service in MANETs.
Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANETijsrd.com
It is a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. The existing work presented two self-adaptive on-demand geographic routing schemes to build efficient paths based on the needs of user applications and adapt to various scenarios for provide efficient and reliable routing. To overcome the impact due to inaccurate local topology knowledge, the topology information is updated at a node in the specific time periods. The on-demand routing mechanism reduces to control overhead made on geographic routing. The route optimization scheme adapts routing path according to the topology changes and actual data traffic requirements. Adaptive parameter setting scheme is introduced to allow each node to determine and adjust the protocol parameter values independently. However, existing work did not address resource parameters such as energy, bandwidth and data loss. The proposal presents and Integrated Resource Adaptive on Demand Geographic Routing (IRA-ODGR) for MANET. The node energy resource is optimized with path energy consumption rate and bandwidth utilization of the path is analysed. Loss rate is reduced in geographic routing with dynamic routes. The simulation conducted to demonstrate IRA-ODGR routing protocols.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
Load Balancing and Congestion Control in MANETijsrd.com
The document summarizes a proposed load balancing and congestion control algorithm for mobile ad hoc networks (MANETs). The algorithm uses a coordinated multi-path routing approach where multiple paths between source and destination nodes are established. When congestion is detected at an intermediate node, a congestion notification message is sent to the source node. The source node then distributes data packets across the multiple paths randomly to balance load and avoid congested areas of the network. The algorithm aims to reduce end-to-end delay, packet loss, and imbalance in energy consumption among nodes through coordinated load balancing across multiple routes. Simulation results show the approach is effective at alleviating network congestion compared to single-path routing.
Issues in designing a routing and Transport Layer protocol for Ad hoc networks- proactive
routing, reactive routing (on-demand), hybrid routing- Classification of Transport Layer
solutions-TCP over Ad hoc wireless Networks
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
DISTRIBUTED TRAFFIC BY LOAD-BALANCING APPROACH FOR AOMDV IN AD-HOC NETWORKScscpconf
Mobile ad hoc network is a collection of wireless mobile nodes, which are connected over a wireless medium. There is no pre-existing communication infrastructure (no access points, no
base stations) and the nodes can freely move and self-organize into a network topology. Such a network can contain two or more nodes. Hence, balancing the load in an Ad hoc network is
important because the nodes have limited communication resources such as bandwidth, buffer space and battery power. This paper presents a new approach to load balancing based on
residual energy of nodes for distribute the traffic evenly among the network nodes. We are exploiting the multipath routing protocol AOMDV, which defines link-disjoint paths between the
source and the destination in every route discovery. We add the energy metric for load balancing (ELB-AOMDV). The performance is compared between ELB-AOMDV and LBAOMDV.
Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...IOSR Journals
This document discusses using a genetic algorithm to improve routing in mobile ad hoc networks. It begins with background on mobile ad hoc networks and common routing protocols. It then introduces genetic algorithms and how they work by simulating natural evolution. The document proposes using a genetic algorithm with the AODV routing protocol to find optimal paths between source and destination nodes. It describes implementing this approach and comparing its performance to traditional AODV routing. The results showed the genetic algorithm approach performed better in terms of quality of service and throughput.
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.
This document analyzes and compares the scalability of three mobile ad hoc network (MANET) routing protocols - AODV, TORA, and OLSR - by simulating them using varying numbers of nodes. The key findings are:
1) In terms of end-to-end delay, OLSR consistently performs better than AODV and TORA as the number of nodes increases from 25 to 75.
2) For throughput, OLSR outperforms AODV and TORA across all network sizes tested.
3) The study concludes that OLSR demonstrates better scalability than AODV and TORA based on its performance with increasing numbers of nodes in terms of
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
1. The document proposes a hybrid routing protocol that combines DSDV and IAODV to reduce packet loss due to congestion in MANETs.
2. Under the proposed scheme, DSDV is used initially for path selection. If congestion occurs, nodes switch to using IAODV to find an alternate path to avoid congested areas.
3. Simulation results show that the hybrid protocol improves end-to-end delay, packet delivery fraction, and throughput compared to using only DSDV or IAODV. The hybrid approach balances the advantages of proactive and reactive routing to better handle congestion in mobile ad hoc networks.
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
Similar to Load aware and load balancing using aomdv routing in manet (20)
Survey on video object detection & trackingijctet
This document summarizes previous work on video object detection and tracking techniques. It discusses research papers that used techniques like active contour modeling, gradient-based attraction fields, neural fuzzy networks, and region-based contour extraction for object tracking. Background subtraction, frame differencing, optical flow, spatio-temporal features, Kalman filtering, and contour tracking are described as common video object detection techniques. The challenges of multi-object data association and state estimation for tracking multiple objects are also mentioned.
Structural and morphological studies on fly ash reinforced polystyrene compos...ijctet
This document discusses structural and morphological studies of fly ash reinforced polystyrene composites. Fly ash reinforced polystyrene composites were prepared using a solution casting method. Various characterization techniques were used to analyze the composites. FTIR analysis showed shifting of peaks, indicating bonding between polystyrene and fly ash. XRD showed increased crystallinity and crystallite size with higher fly ash content. AFM images confirmed the presence of fly ash particles within the polystyrene matrix and showed well-organized fly ash domains dispersed within the matrix. The addition of fly ash was found to enhance the structural properties and crystallinity of the polystyrene composites.
The apt identification and blocking through ids in manetijctet
This document summarizes research on detecting and blocking advanced persistent threats (APTs) in mobile ad hoc networks (MANETs) through an intrusion detection system (IDS). The research proposes applying an IDS to identify and prevent APT attacks from malware like viruses, worms, and trojan horses that could spread in the dynamic MANET topology and degrade network performance. The IDS would monitor nodes, identify suspicious activity based on differences from normal behavior patterns, and block identified attackers to secure the MANET from unauthorized access and data theft or modification by APTs.
Survey of apt and other attacks with reliable security schemes in manetijctet
This document summarizes security threats and challenges in mobile ad hoc networks (MANETs). It discusses advanced persistent threats (APTs) which aim to stealthily infiltrate networks to steal data. APTs use techniques like spear phishing and malware to infect systems. Malware types discussed include viruses, worms, trojans, and bots. The document also outlines requirements for securing MANETs against APTs, such as protecting devices and browsers from exploitation. Finally, it analyzes security issues in routing for MANETs and categorizes common routing protocols.
Social data analysis using apache flume, hdfs, hiveijctet
This document discusses analyzing social media data from Twitter using Apache Flume, HDFS, and Hive. It describes collecting tweets from Twitter using Flume, storing the raw JSON data in HDFS. It then discusses structuring the unstructured Twitter data by creating tables in Hive using custom SerDes and querying the data using Hive Query Language to perform sentiment analysis. The results of the analysis are stored back in Hive tables.
Load aware and load balancing using aomdv routing in manetijctet
This document discusses load aware and load balancing techniques using multipath routing in mobile ad hoc networks (MANETs). It proposes using a location aided routing (LAR) protocol with the Ad-hoc On-demand Multipath Distance Vector (AOMDV) routing protocol to identify multiple routing backbones from the source to destination nodes based on the intermediate nodes' communication and processing capabilities. This helps distribute traffic loads evenly across multiple paths to improve load balancing, reduce congestion, and enhance quality of service in the MANET.
Investigation of detection & prevention sinkhole attack in manetijctet
This document discusses sinkhole attacks in mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). It provides background on sinkhole attacks, where a compromised node advertises a high quality route to attract network traffic. This can disrupt data transmission to the base station. The document reviews several existing detection techniques for sinkhole attacks, including algorithms using hop counting and mobile agents. It then proposes a new lightweight algorithm to detect sinkhole attacks in MANETs using network flow information collected by the base station and analysis of routing patterns to identify the intruder. The algorithm aims to provide secure and efficient sinkhole detection with low overhead.
Implementation of different tutoring system to enhance student learningijctet
This document discusses different tutoring systems that can be used to enhance student learning. It describes three types of tutoring: no tutoring (without feedback), computer tutoring using intelligent tutoring systems, and human tutoring using scaffolding techniques. Intelligent tutoring systems use domain models, teaching models, student models, and interfaces to provide individualized instruction. They track student performance and recommend additional work. Human tutoring employs scaffolding where teachers support students until they can solve complex problems independently. Scaffolding includes hard, static supports and soft, dynamic supports tailored for each student.
Enhanced method for intrusion detection over kdd cup 99 datasetijctet
This document discusses an enhanced method for intrusion detection using the KDD Cup 99 dataset. It aims to improve the accuracy of the dataset by analyzing the contribution of different attack classes to metrics like true positive rate and precision. The study examines these evaluation metrics for an intrusion detection system to identify which attack classes most impact recall and precision. The goal is to help improve the quality of the KDD Cup 99 dataset to achieve higher accuracy with lower false positives.
Comparison of routing protocols with performance parameters for different num...ijctet
This document compares the performance of three reactive routing protocols (Bellman-Ford, DSR, and WRP) in mobile ad hoc networks under different numbers of nodes. It analyzes the protocols based on four performance metrics: end-to-end delay, packet delivery ratio, drop ratio, and normalized routing load. The document finds that Bellman-Ford and WRP have lower delay than DSR, DSR has a higher delivery ratio and lower drop ratio than the other protocols, and DSR and Bellman-Ford have lower routing overhead than WRP. Increasing the number of nodes generally causes delay and routing overhead to increase, and the packet delivery ratio to decrease.
Commutative approach for securing digital mediaijctet
This document summarizes a paper on digital image watermarking techniques. It discusses how digital watermarking can be used to embed hidden information in multimedia data like images, audio, and video to identify ownership and protect against illegal copying. It describes different watermarking techniques including the discrete cosine transform (DCT) and discrete wavelet transform (DWT). The paper analyzes the DCT and DWT techniques, evaluating them using peak signal-to-noise ratio at different threshold values. It finds that the DWT technique provides better image quality than DCT. The document also discusses applications of digital watermarking like ownership assertion, fingerprinting, copy prevention and control, fraud detection, and ID card security.
Cecimg an ste cryptographic approach for data security in imageijctet
The document presents a new algorithm called CECIMG (Canny edge encryption image steganography) for securing data in images. It combines Blowfish encryption with embedding encrypted data in the edge pixels of an image detected using Canny edge detection. The algorithm is implemented in Java and experiments show it provides better security and higher PSNR values than existing LSB steganography techniques. It securely stores encrypted data in images in a series of steps and allows retrieval of the original data. The algorithm aims to maximize security compared to traditional approaches.
Analysis of recoverable exhaust energy from a light duty gasoline engine by u...ijctet
This document reviews methods of recovering exhaust energy from internal combustion engines using heat pipes. It discusses how heat pipes effectively transfer heat from exhaust gases to a condenser region, enhancing engine thermal performance. The document examines several studies on recovering exhaust waste heat using Rankine cycle systems and heat pipes. These studies found that waste heat recovery can increase engine fuel efficiency by 3-34% and power output by up to 20%, depending on the system and engine operating conditions. Recovering just 6% of exhaust heat energy could result in a 10% reduction in fuel consumption. The document concludes that heat pipe waste heat recovery systems show promising potential but require further research.
An intrusion detection system for detecting malicious nodes in manet using tr...ijctet
This document summarizes an intrusion detection system called EAACK that detects malicious nodes in mobile ad hoc networks (MANETs). It begins by providing background on MANETs and challenges related to their decentralized structure and dynamic topology. It then discusses common attacks on MANETs like packet dropping, and the need for intrusion detection systems to increase network security. Existing IDS methods are outlined along with their limitations. The document proposes a new IDS called EAACK that aims to more accurately detect malicious behaviors without impacting network performance. Key concepts of trust values and monitoring nodes are incorporated into EAACK to reduce false detections.
A robust combination of dwt and chaotic function for image watermarkingijctet
This document summarizes a research paper on a robust image watermarking technique that combines discrete wavelet transform (DWT) and a chaotic function. The proposed method embeds a watermark into selected blocks of the low-frequency DWT subband of an image. It calculates the Euclidean distance between blocks of the watermark and image to select the most similar block for embedding. Experimental results on standard test images show the proposed method achieves better performance than previous methods in terms of PSNR and structural similarity under compression attacks. The extraction accuracy remains high even with noise attacks, though it degrades more under filtering attacks.
A review on preheating of bio diesel for the improvement of the performance c...ijctet
This document summarizes research on preheating bio-diesel fuel to improve engine performance. Bio-diesel has higher viscosity and surface tension than conventional diesel, which can cause issues when used in diesel engines. Preheating bio-diesel reduces these properties and improves atomization and combustion. The literature review found that preheating bio-diesel to 70-90°C can solve filter clogging issues, while a temperature of 140°C is needed to achieve viscosity similar to diesel. Heat exchangers are used to preheat the bio-diesel through heat from engine exhaust gases. Preheating bio-diesel blends up to B80 is shown to improve ignition and decrease emissions.
Optimal design & analysis of load frequency control for two interconnecte...ijctet
This document summarizes a research paper that proposes using Particle Swarm Optimization (PSO) to tune the parameters of PID controllers for Automatic Load Frequency Control (ALFC) in a system of two interconnected power generation areas. It describes modeling the two-area system and the objectives of ALFC to maintain frequency and distribute load. PSO is introduced as a technique to explore the search space to maximize objective functions by updating particle velocities and positions. The paper presents simulation results comparing the tuned PID controller performance to untuned controllers.
Improving reliability & performance of wsn via routing errorsijctet
The document proposes a scheme called Link Scanner (LS) for detecting faulty links in wireless sensor networks. LS operates passively by collecting hop count data from probe flooding processes. It analyzes mismatches between expected and received hop counts to infer which links may be faulty. Having a blacklist of potential faulty links allows further analysis and recovery, including adjusting routing strategies, identifying root causes of observed network issues, and providing spare link options. The scheme aims to not only detect currently faulty links but also evaluate unused links, to help guide rerouting for better performance. It was tested on a 60-node sensor network and in simulation and found to accurately detect faulty links with low overhead.
Enhancing msf for mobile ad hoc network security though active handshaking &a...ijctet
This document summarizes a research paper that proposes a new security framework called Multipath Security Framework (MSF) to enhance security in mobile ad hoc networks. MSF divides messages into encrypted shares that are transmitted across multiple network paths to increase confidentiality and robustness. Even if an attacker obtains some shares, it is difficult for them to reconstruct the original message. The framework includes multipath routing, node authentication through handshaking, and encryption of message shares. The goal is to improve security against eavesdropping, active and passive attacks, and jamming in mobile ad hoc networks.
A literature review of modern association rule mining techniquesijctet
This document discusses association rule mining techniques for extracting useful patterns from large datasets. It provides background on association rule mining and defines key concepts like support, confidence and frequent itemsets. The document then reviews several classic association rule mining algorithms like AIS, Apriori and FP-Growth. It explains that these algorithms aim to improve quality and efficiency by reducing database scans, generating fewer candidate itemsets and using pruning techniques.
Particle Swarm Optimization–Long Short-Term Memory based Channel Estimation w...IJCNCJournal
Paper Title
Particle Swarm Optimization–Long Short-Term Memory based Channel Estimation with Hybrid Beam Forming Power Transfer in WSN-IoT Applications
Authors
Reginald Jude Sixtus J and Tamilarasi Muthu, Puducherry Technological University, India
Abstract
Non-Orthogonal Multiple Access (NOMA) helps to overcome various difficulties in future technology wireless communications. NOMA, when utilized with millimeter wave multiple-input multiple-output (MIMO) systems, channel estimation becomes extremely difficult. For reaping the benefits of the NOMA and mm-Wave combination, effective channel estimation is required. In this paper, we propose an enhanced particle swarm optimization based long short-term memory estimator network (PSOLSTMEstNet), which is a neural network model that can be employed to forecast the bandwidth required in the mm-Wave MIMO network. The prime advantage of the LSTM is that it has the capability of dynamically adapting to the functioning pattern of fluctuating channel state. The LSTM stage with adaptive coding and modulation enhances the BER.PSO algorithm is employed to optimize input weights of LSTM network. The modified algorithm splits the power by channel condition of every single user. Participants will be first sorted into distinct groups depending upon respective channel conditions, using a hybrid beamforming approach. The network characteristics are fine-estimated using PSO-LSTMEstNet after a rough approximation of channels parameters derived from the received data.
Keywords
Signal to Noise Ratio (SNR), Bit Error Rate (BER), mm-Wave, MIMO, NOMA, deep learning, optimization.
Volume URL: https://airccse.org/journal/ijc2022.html
Abstract URL:https://aircconline.com/abstract/ijcnc/v14n5/14522cnc05.html
Pdf URL: https://aircconline.com/ijcnc/V14N5/14522cnc05.pdf
#scopuspublication #scopusindexed #callforpapers #researchpapers #cfp #researchers #phdstudent #researchScholar #journalpaper #submission #journalsubmission #WBAN #requirements #tailoredtreatment #MACstrategy #enhancedefficiency #protrcal #computing #analysis #wirelessbodyareanetworks #wirelessnetworks
#adhocnetwork #VANETs #OLSRrouting #routing #MPR #nderesidualenergy #korea #cognitiveradionetworks #radionetworks #rendezvoussequence
Here's where you can reach us : ijcnc@airccse.org or ijcnc@aircconline.com
We have designed & manufacture the Lubi Valves LBF series type of Butterfly Valves for General Utility Water applications as well as for HVAC applications.
Sachpazis_Consolidation Settlement Calculation Program-The Python Code and th...Dr.Costas Sachpazis
Consolidation Settlement Calculation Program-The Python Code
By Professor Dr. Costas Sachpazis, Civil Engineer & Geologist
This program calculates the consolidation settlement for a foundation based on soil layer properties and foundation data. It allows users to input multiple soil layers and foundation characteristics to determine the total settlement.
Sri Guru Hargobind Ji - Bandi Chor Guru.pdfBalvir Singh
Sri Guru Hargobind Ji (19 June 1595 - 3 March 1644) is revered as the Sixth Nanak.
• On 25 May 1606 Guru Arjan nominated his son Sri Hargobind Ji as his successor. Shortly
afterwards, Guru Arjan was arrested, tortured and killed by order of the Mogul Emperor
Jahangir.
• Guru Hargobind's succession ceremony took place on 24 June 1606. He was barely
eleven years old when he became 6th Guru.
• As ordered by Guru Arjan Dev Ji, he put on two swords, one indicated his spiritual
authority (PIRI) and the other, his temporal authority (MIRI). He thus for the first time
initiated military tradition in the Sikh faith to resist religious persecution, protect
people’s freedom and independence to practice religion by choice. He transformed
Sikhs to be Saints and Soldier.
• He had a long tenure as Guru, lasting 37 years, 9 months and 3 days
Online train ticket booking system project.pdfKamal Acharya
Rail transport is one of the important modes of transport in India. Now a days we
see that there are railways that are present for the long as well as short distance
travelling which makes the life of the people easier. When compared to other
means of transport, a railway is the cheapest means of transport. The maintenance
of the railway database also plays a major role in the smooth running of this
system. The Online Train Ticket Management System will help in reserving the
tickets of the railways to travel from a particular source to the destination.
East Carolina University diploma. ECU diplomaCollege diploma
WhatsApp: +852 56142185
ECU diploma for sale. Buy a fake East Carolina University diploma. I need a fake East Carolina University diploma. Fake ECU diploma for sale.
Skype: adolph.863
QQ/WeChat: 648998850
Email: buydocument1@gmail.com
https://www.buydocument.net
https://www.buyfastdegree.com
https://www.getadiploma9.com
https://www.diploma999.com
Load aware and load balancing using aomdv routing in manet
1. 205
Load Aware and Load Balancing using AOMDV Routing in MANET
Rakhi Sharma1
, Dr. Sitesh Kumar Sinha2
, Prof. Mukesh Kumar3
Computer Science, AISECT University, Bhopal, India
1
rakhisharma@gmail.com, 2
siteshkumarsinha@gmail.com, 3
goutam.mukesh@gmail.com
Abstract--Effective load balancing has been a demanding
task in MANET due to their dynamic and un-predictable
nature and topology change. Nodes in MANETs greatly differ
with each other in terms of communication and processing
power. For effective working of MANET multiple routing
backbones are identified from source to destination using
intermediate nodes that have better communication and
processing capabilities to take part in the mobile routing
backbones and efficiently participate in the routing process.
In addition to improved load balancing, the new method also
provides enhanced Quality of Service (QoS) support and
congestion control as per existing network traffic levels and
nodes' processing loads. In this paper we are going to propose
a Load aware and load balancing techniques using multipath
routing.
Keywords: - AODV, DREAM, QoS, Routing Load, Packet
Delivery Ratio.
1. INTRODUCTION
Mobile ad hoc network (MANET) is a group of mobile
nodes where each node is free to move about arbitrarily.
Each node logically contains a router that may have
multiple hosts and that also may have multiple wireless
communication devices. A MANET is self organizing,
adaptive and infrastructure less; AODV currently does not
support Quality of Service (QoS) and also has no load
balancing mechanism. The QoS routing feature is
important in a stand-alone multi hop mobile network for
real-time applications and also for a mobile network to
interconnect wired networks with QoS support. The first
extension (named QoS field) specifies the service
requirements (maximum delay is chosen), which must be
met by nodes rebroadcasting a Route Request or returning
a Route Reply for a destination. A comprehensive packet-
layer simulation model through media access control
(MAC) and physical layer models is used to study the
performance of both the AODV and the QoS-AODV
protocols. We extend the ns-2 (network simulator version 2)
to include the proposed QoS-AODV protocol, delay
constraints, topological rate of change and mobility speeds.
A multicast packet is delivered to all the receivers belong
to a group along a network structure such as tree or mesh
that is constructed once a multicast group is created.
However because of node mobility the network structure is
brittle and thus, the multicast packet may not be delivered
to some members. To recompense this problem and to get
better packet delivery ratio, multicast protocols for ad-hoc
networks usually employ control packets to periodically
refresh the network structure.
1.1 Routing in MANETs
Routing protocols for MANETs are dynamic in nature
and require each node to store routing information about
destinations that are needed to be reached and also update
that information as the network topology changes. A
significant number of routing protocols have been
suggested for these networks.
1.1.1 Position-based routing protocols
These protocols make the routing decisions based on
nodes‟ geographical coordinates. Each node maintains an
updated location table that contains the geographical
position of all its neighbours. The routing decisions are
made based on the neighbours‟ coordinates and trajectory
information towards the destination location. Two of the
position based protocols are Simple Forwarding over
Trajectory (SIFT) and Distance Routing Effect Algorithm
for Mobility (DREAM).
1.1.2 Topology-based routing protocols
Classical routing approaches for MANETs are
topology-based in which the routing decisions are based on
links among network nodes. In other words, these protocols
are link-driven. A routing table is maintained which
contains the route to destinations and an existing link
pointing towards it. If a node moves resulting in a link
break then the route needs to be recomputed. These
protocols can further be classified as Table-driven or
Proactive, Source-initiated (On demand) or Reactive and
Hybrid routing protocols.
1.1.3 Table-driven routing protocols
Proactive routing protocols monitor the topology of the
network at all times and pre-compute paths between any
source and destination. Routes are maintained for all nodes,
even for nodes to which no data has been sent. This is done
by periodically exchanging routing tables throughout the
network, similar to traditional wired networks. These
protocols maintain tables at each node which stores
updated routing information for every node to every other
node within the network. An advantage of these routing
protocols is that obtaining the required route information
and establishing a session will not be time-consuming. A
disadvantage of these routing protocols is that it will react
to topology changes even when no traffic is affected by
2. 206
that change, which is extremely resource-consuming and
will result in the unnecessary usage of bandwidth even
when no data is transferred. Another drawback is more
power consumption due to periodic exchange of
information. Examples of such protocols are Destination-
Sequenced Distance-Vector Routing protocol (DSDV),
Optimized Link State Routing (OLSR), Cluster head
Gateway Switch Routing (CGSR) protocol, The Wireless
Routing Protocol (WRP).
1.1.4 On-demand routing protocols
Reactive routing protocols find a route only when there
is a demand for data transmission, i.e., at the beginning of a
connection. In other words, the route discovery process
begins whenever a source node needs a route to a
destination in on-demand routing. A route between two
hosts is determined only when there is an explicit need to
forward packets. This is done by initiating a route
discovery within the network by flooding the entire
network with route request (RREQ) packets. Also, once a
route is established, it is maintained in the routing table
until the destination is out overhead is significantly reduced,
since the routing information does not have to be updated
periodically, and no maintenance is done on routes that are
not being used. One disadvantage of these protocols is the
latency that occurs when a route is required. However, for
highly mobile networks, these protocols show better
performance for MANETs. Few examples of such
protocols are Ad Hoc On-Demand Distance Vector
(AODV) routing protocol, Dynamic Source Routing (DSR)
protocol, Temporally Ordered Routing Algorithm (TORA)
and Associativity-Based Routing (ABR).
1.1.5 Hybrid routing protocols
On-demand routing has relatively less routing overhead,
since it eliminates periodic flooding of the network with
update messages. But it suffers high routing delay when
compared to table-driven routing. Table driven routing
ensures high quality in static topologies but cannot be
extended to mobile networks. Combining the advantages of
both, a few hybrid routing protocols have been designed,
whereby the routing is first initiated with some proactive
routes and then serves the demand from other nodes
through reactive flooding. Zone Routing protocol (ZRP) is
one of the protocols that falls under this category. Since
both bandwidth and power are limited in mobile networks,
on-demand routing protocols are more widely used then
table-driven routing protocols. Among all proposed on-
demand routing protocols, AODV and DSR are most
commonly used protocols. The author uses AODV in this
thesis for experimentation purposes.
1.2 Load Balancing in MANETs
In traditional wired networks, load balancing can be
defined as a methodology to distribute or divide the traffic
load evenly across two or more network nodes in order to
mediate the communication and also achieve redundancy
in case one of the links fails. The other advantages of load
balancing can be optimal resource utilization, increased
throughput, and lesser overload. The load can also be
unequally distributed over multiple links by manipulating
the path cost involved. On the other hand, the objective of
load-balancing in MANETs is different from that of wired
networks due to mobility and limited resources like
bandwidth, transmission range and power. In mobile ad
hoc networks, balancing the load can evenly distribute the
traffic over the network and prevent early expiration of
overloaded nodes due to excessive power consumption in
forwarding packets. It can also allow an appropriate usage
of the available network resources. The existing ad-hoc
routing protocols do not have a mechanism to convey the
load information to the neighbours and cannot evenly
distribute the load in the network. It remains a major
drawback in MANETs that the nodes cannot support load
balancing among different routes over the network.
1.3 Need of Load Balancing in MANETS
On-demand routing protocols such as AODV initiate
the route discovery only if the current topology changes
and the current routes are not available. In high mobility
situations where the topology is highly dynamic, existing
links may break quickly. It may be safe to assume that in
such scenarios the on-demand routing protocols like
AODV and DSR can achieve load balancing effect
automatically by searching for new routes and using
different intermediate nodes to forward traffic. Whereas, in
the scenarios where the same intermediate nodes are used
for longer period of time, the on-demand behaviour may
create bottlenecks and cause network degradation due to
congestion and lead to long delays. In addition, the caching
mechanism in most on-demand routing protocols for
intermediate nodes to reply from cache, can cause
concentration of load on certain nodes. It had been shown
in [1] that the increase in traffic load degrades the network
performance in MANETs. In other words, if the topology
changes are minimal then this behaviour results in same
routes being used for a longer period of time which in turn
increases the traffic concentration on specific intermediate
nodes. It had been proved in [2] that the congestion and the
delay in delivering packets are increased with the
decreased mobility in on-demand routing. In addition, it
also increases the energy consumption at intermediate
nodes and has them expire early. This early expiration of
nodes can cause an increase in the control packets and the
transmission power of other nodes to compensate the loss.
Furthermore, it can result in network degradation and even
an early expiration of the entire ad-hoc network. Besides,
using a same node for routing traffic for a longer duration
may result in an uneven usage of the available network
resources, like bandwidth. A network is less reliable if the
load among network nodes is not well balanced.
3. 207
2. RELATED WORK
Several protocols have been developed for supporting
ad hoc multicast routing, i.e. MAODV [3] [4], ODMRP [5],
and CAMP [6]. However, these protocols did not address
the QoS aspects of ad hoc wireless communication. Only a
few protocols support QoS in multicast routing in mobile
ad hoc networks. Examples are QAMNet [7], QMR [8], E-
QMR [9] and Lantern-trees [10]. The QAMNet [7]
approach extends the mesh-based ODMRP multicast
routing protocol by introducing traffic prioritization,
distributed resource probing and admission control
mechanisms to provide QoS. For available bandwidth
estimation, it compared the threshold rate of real-time
traffic and current rate of real-time traffic. This is the same
as method of SWAN [11]. Similarly, it has many
difficulties to estimate the threshold rate accurately
because of its dependence to the traffic pattern. A lantern-
tree topology is used to provide QoS multicast routing in
[10]. This protocol shares time slots at the Mac layer and
uses a CDMA over TDMA channel model. In this model,
available bandwidth is measured in terms of the amount of
free slots. At start up, it shares time slots between all
neighbour nodes and finds a suitable scheduling of the free
slots. Its main disadvantage is the need for a centralized
MAC scheme in ad-hoc mobile networks with dynamic
wireless environments. M. Ali et al. [12] have proposed a
QoS aware routing protocol employing multi path routing
backbones using intermediate nodes which are rich in
resources like bandwidth, processing power, residual
energy etc. The protocol ensures that the available
bandwidth in the network is utilised efficiently by
distributing traffic evenly across multiple routing
backbones. Reddy and Raghavan [13] have proposed a
scalable multipath on-demand routing protocol (SMORT),
which reduces the routing overhead incurred in recovering
from route breaks, by using secondary paths. Though it
provides fail-safe multiple paths, it does not consider the
individual QoS characteristics of the nodes like bandwidth,
energy, load etc. A. Tsirigos, Z. J Hass [14] have found
that, under certain constraints on the path failure
probabilities, the probability of successful communication
of packets between source and destination increases with
number of paths used and can, in the limit, approach 100
percent. They have proposed a multipath scheme which
finds the optimal way to fragment and then distribute the
packets to the paths so that the probability of
reconstructing the original information at the destination is
maximised. Marina and Das [15] have proposed the
multipath version of the AODV protocol called AOMDV.
It is designed primarily for highly dynamic ad hoc
networks where frequent link failures and route breaks
occur. With multiple redundant paths, new route discovery
is needed only when all paths to the destination fail, unlike
AODV where a new route discovery is needed in response
to every route break. The AOMDV algorithm finds
multiple loop free link disjoint routes from source to
destination in the MANET. AOMDV performs better in
terms of delay, routing load and route discovery time
compared to the single path AODV. However these
multiple paths need not satisfy the QoS requirements of the
flow as the intermediate nodes taking part in the multiple
paths are not selected based on their ability to support the
QoS requirements. Ivascu et al. [16] have presented an
approach based on mobile routing backbone (MRB) for
supporting QoS in MANETs. Their QMRB-AODV
protocol identifies the nodes which have capabilities and
characteristics that will enable them to take part in the
MRB and efficiently participate in the routing process.
Their approach improves network throughput and packet
delivery ratio by directing traffic through lowly congested
regions of the network that are rich in resources. To build
routing backbones, they classify the nodes in the network
based on their characteristics as either QoS routing nodes,
simple routing nodes that route packets without any QoS
guarantee or transceiver nodes. However since only a
single MRB is identified between a source and destination,
frequent route breaks may happen in highly dynamics
networks leading to more frequent route re-discovery
processes and hence increased overheads.
3. PROPOSED METHOD
3.1 Problem Definition
In the field of mobile ad hoc networks routing protocols,
there are lot of problems to be tackled such as Quality of
service, routing optimization and security issues. My main
interest is in the security issues related to routing protocols
in MANETs. The work is done through Network
simulator-2 and measures network performance. Our aim
to minimize congestion using multipath routing with load
aware technique that provide low overhead and increases
performance of the network like throughput, packet
delivery ratio and also minimize average end-to-end delay.
3.2Proposed Work
3.2.1 Proposed methodology
According to problem statement , very first we create
mobile node and very first routing protocol as AOMDV
(Ad-hoc on demand multipath distance vector routing)
after next time we apply LAR routing for destination
expected zone finding and set channel type as wireless
channel , prorogation type two ray ground wave because
mobile node contain routing table and also node radio
range is limited so our data transmitted from node to node
after that we apply MAC ( media access control technique)
as 802.11 WLAN that provides radio range as our
dissertation work proposed in Enhance AOMDV with
location aided routing and control the congestion as well as
balance the load of the network here we describe LAR
working scheme and the define proposed algorithm.
4. 208
3.2.2 Working of LAR with respect to Location Tracking
System
Our first scheme uses a request zone that is rectangular
in shape (refer to figure 4). Assume that node S knows that
node D was at location (Xd, Yd) at time t0. At time t1,
node S initiates a new route discovery for destination D.
We assume that node S also knows the average speed v
with which D can move. Using this, node S defines the
expected zone at time t1 to be the circle of radius R = v (t1
� t0) cantered at location (Xd, Yd). (As stated before,
instead of the average speed, v may be chosen to be the
maximum speed or some other function of the speed
distribution.) In position-based routing, a Location-Aided
Routing, LAR [75] protocol is a position-based routing
protocol that discovers routes to destinations reactively. It
uses location information to reduce the routing overhead
caused by the route discovery process. Its main concept is
to confine the propagation area of the route request (RREQ)
messages to the geographical zone that leads to the
destination node. For this reason, LAR defines two zones:
expected zone and request zone. The expected zone,
illustrated in Figure 2, is the circle where the destination
node is expected to be located.
Fig: 1 LAR request and expected zones
The source node, only, broadcasts the discovery
request within the request zone, which is the smallest
rectangle formed by the expected zone and the source
node’s position. Furthermore, LAR defines two schemes:
scheme-1 and scheme-2. The difference resides in the way
the request zone is specified within the request message. In
the scheme-1, the source node explicitly specifies the
request zone by including the coordinates of the zone’s
four corners in the RREQ. The receivers located outside
the specified rectangle discards the RREQ. On the other
hand, in scheme-2, the source node includes in the RREQ
the destination’s coordinates as well as its distance, Dists,
to the destination. The receiving nodes will then calculate
their distance to the destination node, and only the nodes
whose distance is greater than Dists will forward the
RREQ.
3.3 Proposed Algorithm
Here we design algorithm for Enhance AOMDV with
location aware routing under MANET, in algorithm very
first we create sender and receiver node’s and configure
routing protocol to each node as AOMDV, that routing
protocol uses alternative path means each communication
uses two path name as incoming and outgoing path that
balance the load of all existing path and uses equal priority
base resource after that in internal module we add location
aware routing that provide estimated location of destination
to the source that LAR protocol minimize routing overhead
because every communication failure case routing packet
broadcasted by the sender node but the our LAR module
minimize routing broadcasting to all direction into only
specific estimated location direction. in external TCL (tool
command language) very first we set initial network
parameter like physical parameter, MAC protocol channel
type, antenna type and routing protocol after that we create
mobile node with sender and receiver node and routing as
AOMDV after that compute route function call and
discover route from source to destination on the bases of
shortest path for transmissions and alternative path for
acknowledge incoming into the sender node, if route break
in certain time so route function repetitive call and
broadcast route packet that increases route overhead so we
use LAR (location aware routing) that module is very use
full for route overhead minimization, that case receiver
node send location information to the sender node time to
time manner and useful for route discovery process and
route packet flood only expected zone on the bases of
previous location table, here we deploy algorithm step by
step in below.
Mobile node = N; // Number of mobile nodes
Sender node = S; // sub set of N
Receiver Node = R; //sub Set of N
Receiver Routing = LAR; // Location aware routing
Start simulation time = t0
Set routing protocol = AOMDV;
Set MAC = 802.11
Set radio range = rr; //initialize radio range
RREQ_B(S, R, rr)
{
If ((rr<=550) && (next hop >0))
{
Compute route ()
{
rtable->insert (rtable-
>rt_nexthop); // nexthop to
RREQ source
rtable1->insert (rtable1-
>rt_nexthop); // nexthop to
RREQ destination
if (dest==true)
5. 209
{send ack to source
node with rtable1;
Data_packet_send
(s_no, nexthop, type,
rtable)
Receiver R uses LAR routing;
Receiver send expected location and speed information to
sender;
If (node updates location)
{
Use location info and sender send routing packet to
expected zone;
If (dest == true)
{
Data_packet_send (s_no, nexthop, type)
}
}}
else {
destination not found;
}
}
else {destination un-reachable;
} }
3.3 Proposed Working Architecture
Fig: 2 Proposed working architecture
In above structure present working architecture of our
proposed model, basically our module divides into three
part internal structure, intermediate and output result
format, very firs we explain about internal structure of NS-
2, initially we deploy node and apply routing protocol as
AOMDV, after that in internal module we inbuilt MAC as
802.11 scheme for that purpose we updated internal file
Make. in, ns-lib.tcl, packet.h and cmutrace.cc after that
we add third and important part of routing minimization
that is LAR module and same above procedure follow if all
the module successfully compile and cerate object file than
we work in intermediate structure, in that case we create
mobile node through the TCL (tool command language)
and set mobile ad-hoc network basic parameter here we
also apply initial energy of each node, LAR (location
aware routing) for destination location aware and routing
protocol as DSR and MAC as 802.11 that create the radio
range of the node’s. in this module sender node initiate
routing discovery process so sender use as AOMDV
routing and broadcast routing protocol and same time we
also search alternative path for acknowledgment sending
that minimize congestion in one existing path but node
change self-position and break the communication link
than LAR module are work important role for re-
establishing of route from source to destination that uses
expected zone base route broadcast technique and
minimize routing overhead after that we analyse our result
through generated trace file and apply third or output
module that case we pass output generated trace file into
awk (abstract window tool kit) and analyse the result of our
proposed work and conclude.
Fig: 3 Proposed working architecture
4. RESULT ANALYSIS
4.1 Simulation Environment
The detailed simulation model is based on
network simulator-2 (ver-2.31), is used in the evaluation.
The NS instructions can be used to define the topology
structure of the network and the motion mode of the nodes,
to configure the service source and the receiver etc.
4.2 Data Collection and Implementation Strategy
For data collection and implementation we will use
Network Simulator-2 (NS-2). The description about
simulation environment is as follows: Network simulator 2
(NS2) is the result of an on-going effort of research and
development that is administrated by researchers at
Berkeley [17]. It is a discrete event simulator targeted at
6. 210
networking research. It provides extensive support for
simulation of TCP, routing, and multipath protocol. The
simulator is written in C++ and a script language called
OTcl2. Ns use an OTcl interpreter towards the user. This
means that user writes an OTcl script that defines the
network (number of nodes, links), the traffic in the network
(sources, destinations, type of traffic) and which protocols
it will use. This script is used by ns during the simulations.
The result obtained from the simulations is an output file
known as trace file that can be used to doing data
processing (throughput, calculate delay etc) and to
visualize the simulation with a program called Network
Animator.
4.3 Basic Simulator Architecture
Fig: Basic simulator architecture
4.4 Simulation Parameter
We get Simulator Parameter like Number of nodes,
Dimension, Routing protocol, traffic etc. According to
below table 1 we simulate our network.
Table 1: Simulation Parameter
4.5 Performance Evaluation
There are following different performance metrics
have showed the results on the basis of following: Routing
overhead: This metric describes how many routing packets
for route discovery and route maintenance need to be sent
so as to propagate the data packets. Average Delay: This
metric represents average end-to-end delay and indicates
how long it took for a packet to travel from the source to
the application layer of the destination. It is measured in
seconds. Throughput: This metric represents the total
number of bits forwarded to higher layers per second. It is
measured in bps. It can also be defined as the total amount
of data a receiver actually receives from sender divided by
the time taken by the receiver to obtain the last packet.
Packet Delivery Ratio: The ratio between the amount of
incoming data packets and actually received data packets.
4.6 Results
This section represents the results that are calculated on the
basis of simulation parameters
4.6.1 TCP Analysis
In this simulation Two TCP connection with TCP normal
AOMDV case and TCP at Enhanced AOMDV (with load
balancing) were created and analyze the comparative result
between them. In given graph result shows x-coordinate as
simulation time in seconds and y-coordinate represents
window size, according to result output it is observed that
maximum window size which TCP normal AOMDV case
reached 33 units and TCP E-AOMDV reached maximum
60 units in data transfer. According to simulation result it is
observed that the performance of TCP E-AOMDV is much
higher.
Fig: 4 TCP Analyses
4.6.2 Packet Delivery Ratio Analysis
Packet delivery fraction (ratio) is a ratio of no of
receives packets from no of packets transmitted per time
unit. According to graph shown below, PDF of normal
AOMDV case shown by red line and PDF of Enhanced
AOMDV (E-AOMDV) case shown with green line As per
result obtained higher PDF value of Normal AOMDV case
is nearly 96 % and higher PDF value of E-AOMDV case is
nearly 99 %. As per graph E-AOMDV approach shows
better result than normal AOMDV.
4.6.3 Routing Load Analysis
Routing load is calculated as the total number routing
packets are transmitted over the successful data
transmission. The increase in the routing load reduces the
performance of the ad-hoc network as it consumes portions
from the bandwidth available to transfer data between the
nodes. As per graph shown, it is observed that routing load
of normal AOMDV time (shown in Red line) was higher
than enhanced E-AOMDV time (shown in Green line).
Hence according to routing load analysis it is clear that E-
AOMDV is better than normal AOMDV.
7. 211
Fig: 5 Packet Delivery Ration Analyses
4.6.4 Throughput Analysis
In wireless communication networks, such as packet radio,
throughput or network throughput is the average rate of
successful message delivery over a communication
channel.
Fig: 6 Routing Load Analysis
Fig: 7 Throughput Analyses.
This data may be delivered over a logical or physical link,
or pass through a certain wireless network node. The
throughput is regularly measured in bits per second (bit/s
or bps), and occasionally in data packets per second or data
packets per time slot. In this graph it is observe that in
normal AOMDV and E-AOMDV time, throughput value
of normal AOMDV is nearly 900. And throughput of E-
AOMDV is 1300 maximum. E-AOMDV gives better result
than normal AOMDV time.
5. CONCLUSION AND FUTURE WORK
In this paper we proposed Load aware and load balancing
using AOMDV routing in MANET. In this work we are
going to design an efficient system for load aware routing
protocol with load balancing mechanism using AOMDV
routing in mobile ad-hoc network, so that we can minimize
routing overhead of the network and also increase the life
time of the network. As per simulation result enhanced or
load balanced E-AOMDV is better than normal AOMDV.
Here we analyze AOMDV and E-AODMV in future we
also work in the field of secruity constrant under MANET.
REFERENCES
[1]. M. Ali, B. G Stewart, A Shahrabi, A Vallavaraj
“Multipath Routing Backbones For Load Balancing In
Mobile Ad Hoc Networks”, 16th IEEE Mediterranean
Electro technical Conference on (MELECON), pp. 749
- 752, 2012.
[2]. P. Johanson, T. Larsson, N. Hedman, B. Mielczarek,
and M. Degermark, Scenario-based Performance
Analysis of Routing Protocols for Mobile Ad-hoc
Networks,” Proceedings of ACM/IEEE MOBICOM'99,
Seattle, WA, August 1999, pp. 195-206.
[3]. Das, S.R., Perkins, C. E., Royer, E.M.: Performance
Comparison of Two On demand Routing Protocols for
Ad hoc Networks. Proc. IEEE INFOCOM (2000) 3–12
45
[4]. E. Royer and C. Perkins, (2000, Jul.). Multicast ad hoc
on-demand distance vector (MAODV) routing. IETF
Intemet Draft.
[5]. E.M. Royer, and C. E. Perkins, “Multicast operation of
the ad hoc on-demand distance vector routing
protocol,” in Proc. 5th Annual ACM/IEEE Int. Conf.
Mobile Computing and Networking, Seattle, WA, 1999,
pp. 207-217.
[6]. S. J. Lee, M. Gerla, and C. C. Chiang, “On-demand
multicast routing protocol,” in Proc. IEEE Wireless
Communications and Networking Conf. New Orleans,
LA, 1999, pp. 1298-1302.
[7]. J. Garcia-Luna-Aceves and E. Madruga, “The Core
Assisted Mesh Protocol,” IEEE J. Selected Areas in
Communications, vol. 17, no. 8, 1999, pp. 1380-1394.
[8]. H. Tebbe and A. Kassler, “QAMNet: Providing Quality
of Service to Ad-hoc Multicast Enabled Networks,” 1st
International Symposium on Wireless Pervasive
Computing (ISWPC), Thailand, 2006, pp. 1-5.
[9]. M. Saghir, T. C. Wan and R. Budiarto, “Load
Balancing QoS Multicast Routing Protocol in Mobile
Ad Hoc Networks,” AINTEC, Bangkok, Thailand, vol.
3837, 2005, pp. 83-97.
8. 212
[10]. M. Saghir, T. C. Wan and R. Budiarto, “QoS Multicast
Routing Based on Bandwidth Estimation in Mobile Ad
Hoc Networks,” in Proc. 1st Conf. Computer and
Communication Engineering (ICCCE), vol. 1, May.
2006, Kuala Lumpur, Malaysia, pp. 9-11. Proceedings
of the World Congress on Engineering 2007 Vol II
WCE 2007, July 2 - 4, 2007, London, U.K.
[11]. Y. Chen and Y. KO, “A Lantern-Tree Based QoS on
Demand Multicast Protocol for A wireless Ad hoc
Networks,” IEICE Trans. Communications, vol. E87-B,
2004, pp. 717-726.
[12]. G. S. Ahn, A. T. Campbell, A. Veres and L. H. Sun,
“SWAN: Service Differentiation in Stateless Wireless
Ad hoc Networks,” In Proc. IEEE INFOCOM, vol. 2,
2002, pp. 457-466.
[13]. M. Ali, B. G Stewart, A. Shahrabi, A. Vallavaraj,
"Enhanced QoS Support In Mobile Ad hoc Networks
Using Multipath Routing Backbones", in proceedings of
6th IEEE GCC Conference & exhibition, Dubai, UAE,
Feb 2011, pp: 315 – 318.
[14]. L. Reddeppa Reddy and S.V. Raghavan, "SMORT:
Scalable multipath on-demand routing for mobile ad
hoc networks", in proceedings of Journal on Ad Hoc
Networks, vol. 5, no. 2, pp: 162- 188, March 2007.
[15]. A. Tsirigos, Z. J Hass, "Multipath routing in presence
of frequent topological changes", IEEE communication
magazine, Nov 2001, pp: 132-138.
[16]. M. K Marina, S. R Das, "On demand Multipath
Distance Vector Routing in Ad hoc Networks", in
Proceedings of the Ninth International Conference on
Network Protocols, pp: 14-23, 2001
[17]. G. I. Ivascu, S. Pierre, A. Quintero, "QoS routing with
traffic distribution in mobile ad hoc networks", in proc.
of Journal on Computer Communications, vol. 32, no.2,
pp: 305- 316, February 2009.
[18]. http://www.isi.edu/nsnam/ns/