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.
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.
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.
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.
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.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
ย
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
ย
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR
Load aware and load balancing using aomdv routing in manetijctet
ย
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.
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.
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.
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.
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.
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.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
ย
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
ย
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR
Load aware and load balancing using aomdv routing in manetijctet
ย
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.
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.
The document proposes an enhanced version of the Destination Sequenced Distance Vector (DSDV) routing protocol called Multicost Parameter Based DSDV (MPB-DSDV) that incorporates additional cost parameters like interference, residual energy, and transmission power to improve energy efficiency and network performance for wireless ad hoc networks. The MPB-DSDV protocol is simulated and evaluated based on performance metrics like end-to-end delay, packet delivery ratio, routing overhead, and throughput, and shown to outperform the standard DSDV protocol by taking energy constraints into consideration for path selection.
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.t
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.
Energy Saving DSR and Probabilistic Rebroadcast Mechanism are used to Increas...IJTET Journal
ย
Abstract- MANETs are infrastructure less and can be set up anytime anywhere. Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data broadcasting mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem and without consider the nodes energy level of route selection it leads to reduce the network lifetime. In this paper proposed to focus is on a two mechanism ESDSR and Neighbor coverage based Probabilistic rebroadcast to overcome those problems. A Energy Saving Dynamic Source Routing in MANETs (ESDSR) which will efficiently utilize the battery power consideration in the route selection time of mobile nodes in such a way that the network will get more life time and Neighbor coverage based Probabilistic rebroadcast mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance. The simulation was carried out using the NS-2 network simulator.
IJCER (www.ijceronline.com) International Journal of computational Engineeri...ijceronline
ย
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
This document summarizes a research paper that analyzes the performance of the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks (MANETs) in terms of energy consumption. It proposes an Energy Secure DSR (ESDSR) protocol that modifies DSR to optimize energy consumption by not including nodes with low energy in route selection. Simulations using the NS-3 network simulator show that ESDSR has better performance than DSR in terms of energy consumption, delay, throughput, and packet delivery ratio.
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.
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
ย
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied protocols.
TRANSMISSION POWER AND QUALITY OF SERVICE IN MANET ROUTING PROTOCOLSijwmn
ย
The document discusses how transmission power impacts the quality of service (QoS) in mobile ad hoc network (MANET) routing protocols. It investigates four routing protocols - AODV, DSR, DSDV, and OLSR using the NS3 simulator. The analysis shows that AODV generally has the best performance in terms of packet delivery ratio, packet loss, jitter, and delay across different transmission power levels. Increasing transmission power improves the performance for all protocols, with AODV maintaining consistent high performance regardless of power level.
TRANSMISSION POWER AND QUALITY OF SERVICE IN MANET ROUTING PROTOCOLSijwmn
ย
Wireless communication is significantly influenced by the Mobile Ad Hoc Network (MANET), which consists of nodes like mobile phones, tablets, computers, or other devices that can connect with one another. MANET is a decentralized network that communicates without using any specified infrastructure. The lack of battery power in this multihop network with no infrastructure is problematic. As a result, proper transmission power utilization must be considered. Transmission power significantly impacts the data dissemination of different routing protocols used in this MANET environment. By taking this issue into account, the performance of routing protocols is examined based on different transmission power settings. The packet delivery ratio (PDR), packet loss (PL), jitter, and Dealy all play a role in determining network service quality. This study investigates how transmission power impacts MANET routing protocolsโ quality of Service (QoS). The MANET routing protocols investigated in this study include AODV, OLSR, DSDV, and DSR. NS3 is used to create the simulation env
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
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.
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.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
ย
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of nodeโs residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of nodeโs residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of nodeโs residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
ย
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
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.
The document proposes an enhanced version of the Destination Sequenced Distance Vector (DSDV) routing protocol called Multicost Parameter Based DSDV (MPB-DSDV) that incorporates additional cost parameters like interference, residual energy, and transmission power to improve energy efficiency and network performance for wireless ad hoc networks. The MPB-DSDV protocol is simulated and evaluated based on performance metrics like end-to-end delay, packet delivery ratio, routing overhead, and throughput, and shown to outperform the standard DSDV protocol by taking energy constraints into consideration for path selection.
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.t
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.
Energy Saving DSR and Probabilistic Rebroadcast Mechanism are used to Increas...IJTET Journal
ย
Abstract- MANETs are infrastructure less and can be set up anytime anywhere. Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data broadcasting mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem and without consider the nodes energy level of route selection it leads to reduce the network lifetime. In this paper proposed to focus is on a two mechanism ESDSR and Neighbor coverage based Probabilistic rebroadcast to overcome those problems. A Energy Saving Dynamic Source Routing in MANETs (ESDSR) which will efficiently utilize the battery power consideration in the route selection time of mobile nodes in such a way that the network will get more life time and Neighbor coverage based Probabilistic rebroadcast mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance. The simulation was carried out using the NS-2 network simulator.
IJCER (www.ijceronline.com) International Journal of computational Engineeri...ijceronline
ย
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
This document summarizes a research paper that analyzes the performance of the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks (MANETs) in terms of energy consumption. It proposes an Energy Secure DSR (ESDSR) protocol that modifies DSR to optimize energy consumption by not including nodes with low energy in route selection. Simulations using the NS-3 network simulator show that ESDSR has better performance than DSR in terms of energy consumption, delay, throughput, and packet delivery ratio.
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.
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
ย
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied protocols.
TRANSMISSION POWER AND QUALITY OF SERVICE IN MANET ROUTING PROTOCOLSijwmn
ย
The document discusses how transmission power impacts the quality of service (QoS) in mobile ad hoc network (MANET) routing protocols. It investigates four routing protocols - AODV, DSR, DSDV, and OLSR using the NS3 simulator. The analysis shows that AODV generally has the best performance in terms of packet delivery ratio, packet loss, jitter, and delay across different transmission power levels. Increasing transmission power improves the performance for all protocols, with AODV maintaining consistent high performance regardless of power level.
TRANSMISSION POWER AND QUALITY OF SERVICE IN MANET ROUTING PROTOCOLSijwmn
ย
Wireless communication is significantly influenced by the Mobile Ad Hoc Network (MANET), which consists of nodes like mobile phones, tablets, computers, or other devices that can connect with one another. MANET is a decentralized network that communicates without using any specified infrastructure. The lack of battery power in this multihop network with no infrastructure is problematic. As a result, proper transmission power utilization must be considered. Transmission power significantly impacts the data dissemination of different routing protocols used in this MANET environment. By taking this issue into account, the performance of routing protocols is examined based on different transmission power settings. The packet delivery ratio (PDR), packet loss (PL), jitter, and Dealy all play a role in determining network service quality. This study investigates how transmission power impacts MANET routing protocolsโ quality of Service (QoS). The MANET routing protocols investigated in this study include AODV, OLSR, DSDV, and DSR. NS3 is used to create the simulation env
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
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.
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.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
ย
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of nodeโs residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of nodeโs residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of nodeโs residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
ย
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
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.
Similar to Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energy Parameters (20)
Decolonizing Universal Design for LearningFrederic Fovet
ย
UDL has gained in popularity over the last decade both in the K-12 and the post-secondary sectors. The usefulness of UDL to create inclusive learning experiences for the full array of diverse learners has been well documented in the literature, and there is now increasing scholarship examining the process of integrating UDL strategically across organisations. One concern, however, remains under-reported and under-researched. Much of the scholarship on UDL ironically remains while and Eurocentric. Even if UDL, as a discourse, considers the decolonization of the curriculum, it is abundantly clear that the research and advocacy related to UDL originates almost exclusively from the Global North and from a Euro-Caucasian authorship. It is argued that it is high time for the way UDL has been monopolized by Global North scholars and practitioners to be challenged. Voices discussing and framing UDL, from the Global South and Indigenous communities, must be amplified and showcased in order to rectify this glaring imbalance and contradiction.
This session represents an opportunity for the author to reflect on a volume he has just finished editing entitled Decolonizing UDL and to highlight and share insights into the key innovations, promising practices, and calls for change, originating from the Global South and Indigenous Communities, that have woven the canvas of this book. The session seeks to create a space for critical dialogue, for the challenging of existing power dynamics within the UDL scholarship, and for the emergence of transformative voices from underrepresented communities. The workshop will use the UDL principles scrupulously to engage participants in diverse ways (challenging single story approaches to the narrative that surrounds UDL implementation) , as well as offer multiple means of action and expression for them to gain ownership over the key themes and concerns of the session (by encouraging a broad range of interventions, contributions, and stances).
Creativity for Innovation and SpeechmakingMattVassar1
ย
Tapping into the creative side of your brain to come up with truly innovative approaches. These strategies are based on original research from Stanford University lecturer Matt Vassar, where he discusses how you can use them to come up with truly innovative solutions, regardless of whether you're using to come up with a creative and memorable angle for a business pitch--or if you're coming up with business or technical innovations.
Post init hook in the odoo 17 ERP ModuleCeline George
ย
In Odoo, hooks are functions that are presented as a string in the __init__ file of a module. They are the functions that can execute before and after the existing code.
Information and Communication Technology in EducationMJDuyan
ย
(๐๐๐ ๐๐๐) (๐๐๐ฌ๐ฌ๐จ๐ง 2)-๐๐ซ๐๐ฅ๐ข๐ฆ๐ฌ
๐๐ฑ๐ฉ๐ฅ๐๐ข๐ง ๐ญ๐ก๐ ๐๐๐ ๐ข๐ง ๐๐๐ฎ๐๐๐ญ๐ข๐จ๐ง:
Students will be able to explain the role and impact of Information and Communication Technology (ICT) in education. They will understand how ICT tools, such as computers, the internet, and educational software, enhance learning and teaching processes. By exploring various ICT applications, students will recognize how these technologies facilitate access to information, improve communication, support collaboration, and enable personalized learning experiences.
๐๐ข๐ฌ๐๐ฎ๐ฌ๐ฌ ๐ญ๐ก๐ ๐ซ๐๐ฅ๐ข๐๐๐ฅ๐ ๐ฌ๐จ๐ฎ๐ซ๐๐๐ฌ ๐จ๐ง ๐ญ๐ก๐ ๐ข๐ง๐ญ๐๐ซ๐ง๐๐ญ:
-Students will be able to discuss what constitutes reliable sources on the internet. They will learn to identify key characteristics of trustworthy information, such as credibility, accuracy, and authority. By examining different types of online sources, students will develop skills to evaluate the reliability of websites and content, ensuring they can distinguish between reputable information and misinformation.
How to Create User Notification in Odoo 17Celine George
ย
This slide will represent how to create user notification in Odoo 17. Odoo allows us to create and send custom notifications on some events or actions. We have different types of notification such as sticky notification, rainbow man effect, alert and raise exception warning or validation.
How to Create a Stage or a Pipeline in Odoo 17 CRMCeline George
ย
Using CRM module, we can manage and keep track of all new leads and opportunities in one location. It helps to manage your sales pipeline with customizable stages. In this slide letโs discuss how to create a stage or pipeline inside the CRM module in odoo 17.
Cross-Cultural Leadership and CommunicationMattVassar1
ย
Business is done in many different ways across the world. How you connect with colleagues and communicate feedback constructively differs tremendously depending on where a person comes from. Drawing on the culture map from the cultural anthropologist, Erin Meyer, this class discusses how best to manage effectively across the invisible lines of culture.
Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energy Parameters
1. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
138
QUALITY OF SERVICE ROUTING IN
MOBILE AD HOC NETWORKS USING
LOCATION AND ENERGY PARAMETERS
Dr. Shuchita Upadhayaya and Charu Gandhi
Department of Computer Science and Applications, Kurukshetra University,
Kurukshetra, India
Shuchita_bhasin@yahoo.com, er.charu.gandhi@gmail.com
ABSTRACT
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.
KEYWORDS
QoS Rrouting, Mobile Ad hoc Networks, Energy-Aware Routing, Multipath Rrouting,
I. INTRODUCTION
A Mobile Ad hoc Network (MANET) [1,2 ] is collection of mobile/semi mobile nodes with no
existing pre-established infrastructure, forming a temporary network Each mobile node in the
network acts as a router. Such networks are characterized by: Dynamic topologies, existence of
bandwidth constrained and variable capacity links, energy constrained operations and are
highly prone to security threats. Due to all these features routing is a major issue in ad hoc
networks. The routing protocols for ad hoc networks have been classified as:
Proactive/table driven e.g. Destination Sequenced Distance Vector (DSDV) [3], Optimized
Link State Routing(OLSR)[4]. In proactive routing, each node has one or more tables that
contain the latest information of the routes to any node in the network. Each row has the next
hop for reaching to a node/subnet and the cost of this route. Various table-driven protocols
differ in the way the information about change in topology is propagated through all nodes in
the network. The two kinds of table updating in proactive protocols are the periodic update and
the triggered update. Proactive routing tends to waste bandwidth and power in the network
because of the need to broadcast the routing tables/updates. Furthermore, as the number of
nodes in the MANET increases, the size of the table will increase; this can become a problem
in and of itself.
Reactive/On-demand, e.g. Dynamic Source Routing Protocol (DSR) [5] , Ad hoc On-Demand
Distance Vector routing protocol (AODV) [6], Temporally Ordered Routing Algorithm
(TORA)[4]. They do not maintain or constantly update their route tables with the latest route
topology. Instead, when a source node wants to transmit a message, it floods a query into the
network to discover the route to the destination. The discovered route is maintained until the
2. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
139
destination node becomes inaccessible or until the route is no longer desired. The protocols in
this class differ in handling cache routes and in the way route discoveries and route replies are
handled. Reactive protocols are generally considered efficient when the route discovery is
employed rather infrequently in comparison to the data transfer. Although the network topology
changes dynamically, the network traffic caused by the route discovery step is low compared to
the total communication bandwidth.
Hybrid, e.g. Zone Routing Protocol (ZRP) [7], Hybrid Ad hoc Routing Protocol (HARP) [23]..
Both the proactive and reactive protocols work well for networks with a small number of
nodes. As the number of nodes increases, hybrid reactive/proactive protocols are used to
achieve higher performance. Hybrid protocols attempt to assimilate the advantages of purely
proactive and reactive protocols. The key idea is to use a reactive routing procedure at the
global network level while employing a proactive routing procedure in a nodeโs local
neighborhood.
Quality of Service (QoS) based routing is defined in RFC 2386 [8] as a "Routing mechanism
under which paths for flows are determined based on some knowledge of resource availability
in the network as well as the QoS requirement of flows." The main objectives of QoS based
routing are[8]:Dynamic determination of feasible paths for accommodating the QoS of the
given flow under policy constraints such as path cost, provider selection etc, optimal utilization
of resources for improving total network throughput and graceful performance degradation
during overload conditions giving better throughput. QoS routing strategies are classified as
source routing, distributed routing and hierarchical routing [9]. QoS based routing becomes
challenging in MANETs, as nodes should keep an up-to-date information about link status.
Also, due to the dynamic nature of MANETs, maintaining the precise link state information is
very difficult. Finally, the reserved resource may not be guaranteed because of the mobility-
caused path breakage or power depletion of the mobile hosts. QoS routing should rapidly find a
feasible new route to recover the service. Our motive in this paper is to design a routing
technique, which considers all three above problems together. We define a metric that attempts
to maintain a balance between mobility and energy constraints in MANETs.
2. RELATED WORKS
In the recent period lot of research has been done in QOS based, multi-path and node disjoint
routing. Lately, the upcoming concern is the energy issues in mobile ad hoc networks
(MANETs) The recent studies extensively focused on the multipath discovering extension of
the on- demand routing protocols in order to alleviate single-path problems like AODV[6 ] and
DSR[5], such as high route discovery latency, frequent route discovery attempts and possible
improvement of data transfer throughput. The AODVM (AODV Multipath) AOMDV[10] , is a
multipath extension to AODV. These provide link-disjoint and loop free paths in AODV.
Cross-layered multipath AODV (CM-AODV) [11], selects multiple routes on demand based on
the signal-to-interference plus noise ratio (SINR) measured at the physical layer. The Multipath
Source Routing (MSR) protocol [12] is a multipath extension to DSR uses weighted round
robin packet distribution to improve the delay and throughput. (Split Multipath Routing) [13] is
another DSR extensions, which selects hop count limited and maximally disjoint multiple
routes. Node-Disjoint Multipath Routing (NDMR) [14], provides with node-disjoint multiple
paths. Other energy aware multipath protocols which give disjoint paths are Grid-based Energy
Aware Node-Disjoint Multipath Routing Algorithm GEANDMRA) [15], Energy Aware Source
Routing (EASR)[I6] and Energy Aware Node Disjoint multipath Routing(ENDMR)[I7]. The
Lifetime-Aware Multipath Optimized Routing (LAMOR)[18] is based on the lifetime of a node
which is related to its residual energy and current traffic conditions. Cost- effective Lifetime
Prediction based Routing (CLPR) [19], combines cost efficient and lifetime predictions based
routing. Minimum Transmission Power Routing (MTPR)[20], Power-aware Source
Routing(PSR)[21].
3. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
140
2.1 Dynamic Source Routing Protocol (DSR)
The Dynamic Source Routing (DSR) [5] is a reactive unicast routing protocol that utilizes
source routing algorithm. In source routing algorithm, each data packet contains complete
routing information to reach its destination. In DSR each node also maintains route cache to
maintain route information that it has learnt.
There are two major phases in DSR [5], the route discovery phase and the route maintenance
phase. When a source node wants to send a packet, it firstly checks its route cache. If the
required route is available, the source node includes the routing information inside the data
packet before sending it. Otherwise, the source node initiates a route discovery operation by
broadcasting route request packets. A route request packet contains addresses of both the
source and the destination and a unique number to identify the request. Receiving a route
request packet, a node checks its route cache. If the node doesnโt have routing information for
the requested destination, it appends its own address to the route record field of the route
request packet. Then, the request packet is forwarded to its neighbors.
To limit the communication overhead of route request packets, a node processes route request
packets that both it has not seen before and its address is not presented in the route record field.
If the route request packet reaches the destination or an intermediate node has routing
information to the destination, a route reply packet is generated. When the route reply packet is
generated by the destination, it comprises addresses of nodes that have been traversed by the
route request packet. Otherwise, the route reply packet comprises the addresses of nodes the
route request packet has traversed concatenated with the route in the intermediate nodeโs route
cache.
3. PROBLEM ISSUE
Nodes in Mobile Ad hoc Networks (MANETs) [1, 2] are battery driven. Thus, they suffer from
limited energy level problems. Also the nodes in the network are moving, if a node moves out
of the radio range of the other node, the link between them is broken. .Thus, in such an
environment there are two major reasons of a link breakage:
a) Node dying of energy exhaustion
b) Node moving out of the radio range of its neighboring node
Hence, to achieve the route stability in MANETs, both link stability and node stability is
essential.
The above mentioned techniques consider either of the two issues. Techniques in [19, 10, 13,
and 20] calculate only multiple paths. Both stability issues are neglected in these. The work in
[11] measures route quality in terms of SINR, which gives reliable links, but overall networks
stability is not considered. Though [19] uses lifetime of a node as a generalized metric, it does
not considers the mobility and energy issues which are critical to network - lifetime estimation.
The protocol in [17] considers the energy issues in terms of the energy expenditure in data
transmission, but the lifetime of the node and mobility factor is not discussed [7, 15, 16, 21]
consider only energy metric to route the traffic.
Also, to send a packet from a source to destination many routes are possible. These routes can
be either link disjoint or node-disjoint. Node disjoint protocols have an advantage that they
prevent the fast energy drainage of a node which is the member of multiple link disjoint paths
[14]. Hence, a technique which finds multiple node-disjoint paths considering both link and
node stability has been proposed. The attempt is to find multiple node disjoint routes which
consider both link stability and the node stability on their way.
4. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
141
4. METRICS USED
To measure link and node stability together we are using two metrics, Link Expiration Time
(LET) [19] and Energy Drain Rate (EDR) [22] respectively. These two metrics can be used to
generate a composite metric which keeps track of the stability level of the entire path. .
Mobility Factor: The mobility factor Link Expiration Time (LET) was proposed in [19], by
using the motion parameters (velocity, direction) of the nodes. It says that if r is the
transmission distance between the two nodes, i and j, (xi, yi) and (xj, yj) be the position co-
ordinates and (vi, ฮธi) and (vj, ฮธj) be the (velocity, direction) of motion of nodes. LET is defined
as:
LET=-(ab+cd) +Q/(a2
+c2
) (1)
Where, Q= โ {(a2
+c2
) r2
- (ad- bc) 2}
and,
a= vi Cosฮธi โ vj Cosฮธj
b= xi-xj
c= vi Sinฮธi โ vj Sinฮธj
d= yi โyj
The motion parameters are exchanged among nodes at regular time intervals through GPS. .The
above parameter suggests that if the two nodes have zero relative velocity, i,e, vi =vj and ฮธj = ฮธj.
the link will remain forever, as, LET will be โ.
Energy factor: Most of the energy based routing algorithms [10, 17, and 21], send large
volume of data on the route with maximum energy levels, As a result, nodes with much higher
current energy levels will be depleted of their battery power very early. The mobile node also
loses some of it energy due to overhearing of the neighboring nodes. Thus, a node is losing its
power over a period of time even if no data is being sent through it. Viewing all these factors a
metric called Drain Rate (DR) was proposed in [22], Drain Rate of a node is defined as the rate
of dissipation of energy of a node. Every node calculates its total energy consumption every T
sec and estimates the DR, Actual Drain Rate is calculates by exponentially averaging the values
of DRold. and DRnew as follows:
DRi=ฮฑDRold+ (1-ฮฑ)DRnew (2)
Where, 0< ฮฑ <l, can be selected so as to give higher priority to updated information. Thus,
higher the Drain Rate, faster the node is depleted of its energy.
5. PROPOSED WORK: NODE DISJOINT MUL TIP A TH ROUTING
CONSIDERING LINK AND NODE STABILITY (NDMLNR)
The main aim of the proposed work is to find the multiple node disjoint routes from source to a
given destination. The routes selected are such that all the links of the routes are highly stable.
This will increase the lifetime of the route. Also it keeps track of the route bandwidth which
can be further used by the source to select the optimal routes. From the factors Link Expiration
Time (LET) [19] and Drain Rate (DR) [22] it is inferred that the Link Stability:
a) Depends directly on Mobility factor
b) Depends inversely on the energy factor
Hence, Link Stability Degree (LSD) is defined as
LSD = Mobility factor / Energy factor (3)
5. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
142
It defines the degree of the stability of the link. Higher the value of LSD, higher is the stability
of the link and greater is the duration of its existence. Thus, a route having all the links with
LSD> LSD thr is the feasible route.
We choose the Dynamic Source Routing (DSR) [5] protocol as a candidate protocol, details of
which are given in section 2. Modifications are made to the Route Request (RREQ) and Route
Reply (RREP) packets to enable the discovery of link stable node disjoint paths. The proposed
scheme has three phases:
I. Route Discovery
2. Route Selection
3. Route Maintenance
The various phases are described as follows:
5.1 Route Discovery
The source node when needs to send packet to some destination node, starts the route discovery
procedure by sending the Route Request packet to all its neighbors .In this strategy , the source
is not allowed to maintain route cache for a long time, as network conditions change very
frequently in terms of position and energy levels of the nodes. Thus, when a nodes needs route
to the destination, it initiates a Route Request packet, which is broadcasted to all the neighbors
which satisfy the broadcasting condition.
The Route Request(RREQ) packet of the DSR [5] is extended as RREQ of the NDMLNR
adding two extra fields, LSD and Bandwidth, B as shown in figure I. RREQ contains type field,
source address field, destination field, unique identification number field, hop field, LSD,
Bandwidth (cumulative bandwidth), Time -to-Live field and path field.
Type (T) field: It indicates the type of packet, SA (Source Address) field: It carries the source
address of node. ID field: unique identification number generated by source to identify the
packet. DA (Destination Address) field: It carries the destination address of node. Time To
Live (TTL) field: It is used to limit the life time of packet, initially, by default it contains zero.
Hop field: It carries the hop count; the value of hop count is incremented by one for each node
through which packet passes. Initially, by default this field contains zero value. LSD field
When packet passes through a node, its LSD value with the node from which it has received
this packet is updated in the LSD field. Initially, by default this field contains zero value.
Bandwidth field carries the cumulative bandwidth of the links through which it passes;
initially, by default this field contains zero value. Path field: It carries the path accumulations,
when packet passes through a node; its address is appended at end of this field. The fig I. shows
the RREQ packet.
Figure 1 RREQ packet
SA DA Type ID TTL Hops Bandwidth LSD Path
The Route Reply packet (RREP) of the DSR [5] is extended as RREP of the NDMLNR adding
Bandwidth field. It is sent by the destination node after selecting the node disjoint paths among
the various RREQ packets reaching it.
5.1.1 Route Discovery at Intermediate node
In DSR [5], when an intermediate node receives a RREQ packet, it checks whether its own
address is already listed in the path list of received RREQ packet. If its address is not found, it
6. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
143
appends its address to the route record of received RREQ and it is broadcasted to all its
neighbors. Otherwise, the received RREQ packet will be dropped.
In the NDMLNR when an intermediate node receives a RREQ packet, it performs the
following tasks:
I. Checks whether its own address is already listed in the route record of received RREQ
packet. If its address is not found, it appends its address to the path list.
2. When an intermediate node receives a RREQ for the first time, it introduces a Wait Period,
W. for the subsequent packets if any, with same identification number, traveling through
different paths. It updates the value of LSD corresponding to the link on which it received the
RREQ packet in the LSD field. It then checks its neighbors for QoS parameters, bandwidth
here. Only those neighbors having LSD> LSD thr and Link Bandwidth >= B are considered for
broadcasting. Once the neighbors with required LSD are selected, node forwards packet. Later
if an intermediate node receives duplicate RREQ packets with same (Source address and ID),
as received from other paths, those duplicate RREQ packets will be dropped.
3. Every node maintains a Neighbor Information Table (NIT), to keep track of multiple
RREQs. With following entries Source Address, Destination Address, Hops, LSD, ID and
bandwidth.
Figure 2. Neighbor Information Table (NIT)
SA DA ID Hops LSD Bandwidth
As a RREQ reaches a node it enters its information in the NIT. It makes all the entries for the
requests till Wait Period. At the end of the Wait Period, it accepts the request with the highest
value in LSD field. It adds the value of the link bandwidth to the Bandwidth field of the RREQ
packet. If two RREQs have same LSD values, the one with lesser value of hop count is
selected. In case, hops are also same, one with higher bandwidth is selected. In the worst case,
RREQ is selected on First-come-first -serve basis. This prevents loops and unnecessary
flooding of RREQ packets.
4. None of the intermediate nodes is allowed to send RREP if it has the current route to the
destination. As doing this may lead to those paths which do not fulfill current QoS
requirements.
5.1.2. Destination node
In the NDMLNR, when the destination receives multiple RREQs it selects the paths with
disjoint nodes. It then generates several replies and unicasts them to the source. Before that it
appends its address and adds total bandwidth to each route request. Now each route reply that
reaches the source contains a node-disjoint path from source to destination. Hence, source
knows all the paths to the destination and their respective bandwidths. In case of two paths with
one or more nodes common, the path with higher bandwidth is selected.
5.2 Route Selection
When the source node receives the RREPs from the multiple paths, it sorts the paths in the
order of the increasing bandwidth. Depending on the bandwidth the source decides to use the
single path, or all of the paths. In case of the multiple paths with same bandwidths, path with
minimum number of hops is selected. If the paths conflict
7. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
144
on the number of hops, the source node selects the path on First-come-First-Serve basis.
5.3 Route maintenance
In case, LSD of a node falls below LSDthr, it informs its predecessor node of the node failure by
sending the NODEOFF message. Once a node receives such a message, it sends the
ROUTEDISABLE message to the source node. Source can then reroute the packets to the
backup routes. If no backup route exists, the source then starts the route discovery procedure
again. We explain this technique with a suitable example in next section.
6. EXAMPLE
Let us illustrate our technique with the following example network shown in figure 3. Suppose
node 1 is the source node and node 6 is the destination. Let LSDthr equals to 15. Let B equals to
5 mbps.
Figure 3. An Example network
To send the packet, node 1 checks its neighbors (2.4.7) for their LSD value Out of these node 7
has value 9<15. So, node 1 sends the packets only to nodes 2 and 4.
Node 2 receives this packet for the first time, makes entry in its NIT for the RREQ packet as (1,
6, 1, 1, 20, 8) and starts Wait Time, 5 secs here. Node 2 now checks its neighbors, updates the
path field as,1-2 and the bandwidth field to 8 and forwards RREQ to both 4 and 3.
At node 4, it may receive two RREQ packets during Wait Time. One from node 1 directly, and,
the other via node 2. It has two entries in its NIT (1,6,1,1.20,8) and (1,6,1,2,17,13). At this
moment it selects the one from node 1 with higher LSD value, 20. It updates the path field of
the RREQ packet as 1-4 and the bandwidth field to 7. It forwards the packet to both its
neighbors, 5 and 8, with LSD values 16 and 18 respectively.
2
1
5
4
3
9
8
7
6
20
17
9
18
16
16
18
8
7
4
6
7
6
5
7
8
8
6
5
5
1
4
8
7
20
9
18
20
16
16
8
7
4
6
8
6
1
7
20
4
9
1
7
20
4
6
9
1
7
20
4
1
7
20
4
1
20
8
1
20
8. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
145
Node 3 has only one neighbor, 6 which satisfies the LSD value and hence, it updates RREQ
path field as 1-2-3 and the bandwidth field to 14 and forwards the packet to node 6. Node 6
now receives a path from source node 1. It appends its own ID to it. Thus, first path is 1-2-3-6
and bandwidth of this path is 17.
Node 5 after receiving the RREQ packet with path 1-4, checks for its neighbors and forwards
RREQ with updated path field to 1-4-5 and bandwidth field to14 to nodes 9 and 6 Node 6 now
receives another path,1-4-5.It appends its ID to it, to get the path, 1-4-5-6 with bandwidth 19.
Node 8 after receiving the RREQ packet forwards it to its neighbor, 9, after updating path field
to 1-4-8 and bandwidth field to 15 Node 9 can receive two packets in its wait time, one from
node 5 and the other from node 8. It updates its NIT as (1,6,1,3,16,22) and (1,6,1,3,18,21). To
select from the one, it chooses one from node 8 as its LSD value is higher, 18. It then forwards
the request after updating the path field as 1-4-8-9 and bandwidth field to 21. Node 6 again
receives another path 1-4-8-9.It appends its ID to this path to get 1-4-8-9-6 with bandwidth 28.
Now node 6 receives two paths 1-4-5-6 and 1-4-8-9-6 with node 4 as common node. It selects
the one with higher bandwidth i.e. Path, 1-4-8-9-6 with bandwidth 28
7. CONCLUSION
The above mentioned technique considers the stability of the network from all aspects. The
lifetime of the network can be reduced primarily by two causes. First, the node moving out of
the radio range can lead to link breakage. Second, the node can be drained of its energy leading
to network partitioning. The metric used in the proposed technique measures the stability of the
network based on these two factors. The routing decisions at each node leads to the multiple
paths, which are node disjoint. Doing this we attempt to prevent over usage of a single path
nodes of which may drain out soon. Thus, this technique is .expected to provide highly stable,
reliable, robust node disjoint paths. As the paths are node disjoint, energy drain rate of the
nodes is expected to be less and hence longer lifetime. Also the paths are selected on the
bandwidth constraints; they are the ones with higher capacity. Thus in this technique, as the
routes are selected completely satisfying stability and capacity constraints, it fully complies
with Quality of Service objectives.
8. REFERENCES
1. D. D. Perkins, H. D. Hughes & C. B. Owen, (2002) โFactors Affecting the Performance of Ad
Hoc Networks,โ Proceedings of the IEEE International Conference on Communications (ICC),
2002, pp.2048-2052.
2. Imrich Chlamtac, Marco Conti, Jennifer J.-N. Liu, (2003)"Mobile Ad hoc networking
imperatives and challenges" Ad Hoc Networks, Vol 1, pp.13-64.
3. C.E. Perkins & P. Bhagwat (1994)" Highly Dynamic Destination-Sequenced Distance Vector
Routing (DSDV) for Mobile Computers", ACM SIGCOMM Conference on Communications
Architectures, Protocols and Applications, Vol. 24, pp. 234-244.
4. M. Abolhasan, T.A. Wysocki, & E. Dutkiewicz, (2004) "A Review of Routing Protocols for
Mobile Ad hoc Networks", Ad hoc Networks, Vol. 2, pp. 1-22.
9. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
146
5. David B. Johnson, David A. Maltz, & Josh Broch, "DSR: The Dynamic Source Routing
Protocol for Multi-Hop Wireless Ad Hoc Networks", (2001), Ad Hoc Networking, Addison-
Wesley , pp. 139-172.
6. C. E. Perkins & E. M. Royer,(2003) "Ad hoc On-Demand Distance Vector Routing (AODV) ",
IETF RFC 3561
7. .Z. Hass & R. Pearlmann, "Zone routing Protocol"(1999),IETF Internet Draft
8. RFC2386.
9. Shigang Chen & Klara Nahrstedt, (1998) ".An Overview of Quality-of-Service Routing for the
next Generation High -Speed Networks: Problems and Solutions", IEEE Network Magazine,
vol12, pp. 64 -79.
10. M. K. Marina & S. R. Das, (2001) "On-Demand MultiPath Distance Vector Routing in Ad hoc
Networks",Proceedings of the Ninth International Conference on Network Protocols
(ICNP},IEEE Computer Society Press, pp. 14-23.
11. Jiwon Park, Sangman Moht & Ilyong Chung (2008),โ Multipath AODV Routing Protocol in
Mobile Ad Hoc Networks with SINR-Based Route Selectionโ, International Symposium on
Wireless Communication Systems, IEEE ,pp:682-688.
12. Lei Wang, Lianfang Zhang, Yantai Shu & Miao Dong (2000) ,โ Multipath source routing in
wireless ad hoc networksโ, Proceedings of Canadian Conference on Electrical and Computer
Engineering, Vol 1, pp. 479-483.
13. S. J. Lee and M. Gerla (2001) "Split Multipath Routing with Maximally Disjoint Paths in Ad
hoc Networksโ,Proceedings of the IEEE International Conference on Communications(ICC),
Vol 10, pp. 3201-3205.
14. X.Li,(2006), Ph.D thesis on "Multipath Routing and QoS Provisioning in Mobile Ad hoc
Networks", Queen Mary University of London.
15. Zhengyu W, Xiangjun D & Lin C,(2007), " A Grid-Based Energy Aware Node-Disjoint
Multipath Routing Algorithm for MANETs", Proceedings of International Conference on
Natural Computation, Vol. 5, pp. 244-248.
16. Do-Youn H, Eui-Hyeok K & Jae-Sung L, (2006),โ An Energy Aware Source Routing with
Disjoint Multipath Selection for Energy- Efficient Multihop Wireless Ad hoc Networksโ,
Proceedings of International Federation for Information Processing, 2006, pp. 41-50.
17. M. Bheemalingaiah, M. M. Naidu, D. Sreenivasa Rao & G. Varaprasad (2009)," Energy Aware
Node-Disjoint Routing in Mobile Ad Hoc Networks", Journal of Theoretical and Applied
Information Technology, pp 416-431.
18. Liansheng T, Ling X, King T. K, M. Lei & Zukennan,(2006), "LAMOR: Lifetime-Aware
Multipath Optimized Routing Algorithm for Video Transmission over Ad hoc Networks",
Proceedings of IEEE Vehicular Technology Conference, Vol. 2, pp. 623-627.
19. W.Su,Sung-Ju Lee & M.Gerla (2000),โ Mobility Prediction in Wireless Networksโ.,MILCOM
2000, Vol l, pp.491-495.
20. M. K. Marina & S. R. Das,(2001), "On-Demand MultiPath Distance Vector Routing in Ad hoc
Networks", In Proceedings of the Ninth International Conference on Network Protocols
(ICNP}, IEEE Computer Society Press, pp. 14-23.
21. M. Maleki, K. Dantu & M. Pedram, (2002) "Power-aware source routing protocol for mobile ad
hoc networks", Proceedings of the IEEE international symposium on low power electronics and
design, pp.72-75.
22. D.Kim, Garcia-Luna-Aceves, J.J. Obraczka, K. Cano & J.-C. Manzoni, P.(2003)"Routing
mechanisms for Mobile Ad hoc Networks Based on Energy Drain Rate", Mobile Computing,
Vo12, page(s): 161- 173.
10. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
147
23. Navid Nikaein, Christian Bonnet and Neda Nikaein,โ HARP - Hybrid Ad Hoc Routing
Protocolโ (2001), In proceeding of IST 2001: International Symposium on
Telecommunications.
Authors
Dr. Shuchita Upadhyaya is a Senior Reader in the Department of Computer
Science and Applications, Kurukshetra University, Kurukshetra, India. She has
a teaching experience of above 20 years. Her areas of interest are Computer
Networks & Data Communication and Graphics and has been teaching these
subjects to post graduate classes for the past 20 years. Her research area is
routing in Computer Networks and has published a number of papers in
international journals and conferences.
Charu Gandhi is B.Tech in Compter Science and M.Tech in Computer Science
She has 5 years of teaching experience. She has published number of papers in
national journals, conferences and seminars.Her areas of interests include
computer networks, mobile communications and data structures.
.