Mobile Ad-hoc Networks (MANETs) are highly decentralized, independent and self-organizing network... more Mobile Ad-hoc Networks (MANETs) are highly decentralized, independent and self-organizing networks. It is significant to study the cost of the network, to optimize the routing method by means of cross layer interaction across the layers of the network. In this paper, first we generate a minimum cost spanning tree for a given network of N- nodes using an efficient algorithm, and then we study the problem of constructing a K-node Multicast Minimum Spanning Tree (KMMST) for any given multicasting group with K nodes, where K is less than n. Comparing the cost associated with the minimum spanning tree of the entire network with n nodes and the cost of KMMST, it is found that the cost of KMMST is significantly less compared to cost of the n nodes spanning tree. Key words: K-nodes multicasting, cost, spanning tree, routing. 1.
Interpreting available data is a focal issue in data mining. Gathering of primary data is a diffi... more Interpreting available data is a focal issue in data mining. Gathering of primary data is a difficult and expensive affair for assessing the trends for any business decision especially when multiple players are present. There is no uniform formula-type work procedure to deduce information from a vast data set especially if the data formats in the secondary sources are not uniform and need enormous cleansing to mend the data for statistical analysis. In this paper, an incremental approach to cleanse data using a simple yet extended procedure is presented and it is shown how to deduce conclusions to facilitate business decisions. Freely available Indian Telecom Industry’s data over a year is used to illustrate this process. It is shown how to conclude the superiority of one telecom service provider over the others comparing different parameters like network availability, customer service quality etc. using a relative parameter quantification technique. It is found that this method is computationally less costly than the other known methods.
The chief limiting factor for current mobile devices is the amount of battery power. To improve t... more The chief limiting factor for current mobile devices is the amount of battery power. To improve this crucial factor, researchers have tried to optimize power consumption of every aspect of the mobile device. Power consumption can be optimized by disks, memory chips, CPU scheduling and efficient routing techniques.
Dynamic Source Routing (DSR) is a popular protocol for mobile adhoc routing and data forwarding over wireless networks. In this research an innovative mechanism is suggested for DSR that improves both the routing and data forwarding performance, with lesser power consumption.This mechanism involves intelligent use of the route discovery and route maintenance process thereby providing faster routing and reduced traffic as compared to the basic DSR. This mechanism enables faster data forwarding and reduced collisions with lesser power consumption. The basic DSR and modified DSR were studied and compared in GloMoSim simulation environment. Since one of our major goals was to reduce the routing overhead, the existing algorithm was modified to achieve this objective. To get a better idea of the generated overhead we considered the number of routing packets, which carry the overhead. The analysis shows that the performance of modified DSR is better than the performance of the basic DSR for the considered simulations scenarios. The modified algorithm was found to reduce the power consumption of the network by routing lesser routing load.
S. Hiremath,MOBILE AD HOC NETWORKS: ISSUES, …, Jan 1, 2008
ABSTRACT In Mobile Ad hoc Networks (MANETs), the issues of connectivity, bandwidth, link stabilit... more ABSTRACT In Mobile Ad hoc Networks (MANETs), the issues of connectivity, bandwidth, link stability and route failure tolerance significantly affect multicasting. This research work investigates these key issues using graph theory concepts. Further, route failure-tolerant and stable multicast paths are computed based on the graph theory metric called Connectivity Index (CI). This investigation has resulted in Cross-Layer Design (CLD) of QoS multicast protocol based on MPEG-21 multimedia framework. The research work is carried out in MATLAB environment.
The Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in te... more The Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are Ad hoc On-demand Distance Vector (AODV), Destination-Sequenced Distance-Vector Routing protocol (DSDV), Dynamic Source Routing Protocol (DSR), and Optimum Link State Routing (OLSR). Despite the popularity of those protocols, research efforts have not focused much in evaluating their performance when applied to variable bit rate (VBR). In this paper we present our observations regarding the performance comparison of the above protocols for VBR in mobile ad hoc networks (MANETs). We perform extensive simulations, using NS-2 simulator. Our studies have shown that reactive protocols perform better than proactive protocols. Further DSR has performed well for the performance parameters namely delivery ratio and routing overload while AODV performed better in terms of average delay.
Multicasting can efficiently support a variety of applications that are characterized by a close ... more Multicasting can efficiently support a variety of applications that are characterized by a close degree of collaboration, typical for many ad-hoc applications currently envisioned. Within the wired network, well established routing protocols exist to offer an efficient multicasting service. As nodes become increasingly mobile, these protocols need to evolve to similarly provide an efficient service in the new environment. Future multimedia communication systems have to support the user’s needs, the terminal capabilities, the content specification and the underlying networking technologies. The related protocols and applications must be designed from this integration perspective in a cross-layer centric manner. This paper presents the survey of existing related work on QoS Multicasting, Cross-Layer design for QoS Multicasting in ad hoc wireless networks, and MPEG-21 enabled cross-layer Multicast Routing with Quality of Service in Mobile Ad hoc Networks (MCMR- QoS ).
A novel infrastructureless mobile networks (MANETs) is a collection of wireless nodes that can dy... more A novel infrastructureless mobile networks (MANETs) is a collection of wireless nodes that can dynamically form a network to exchange information. The special features of MANET bring this technology great opportunity together with severe challenges. This paper describes the fundamental problems of ad hoc networking by giving its related background including the concept, features, applications, issues of MANETs, investigates and presents recent research trends and identifies Simulators for MANETs[5]. Based on recent research interests of scholars we found that some issues such as routing and power management attracted much attention and issues such as IP addressing and fault tolerance will have wide scope in the future. In the qualitative analysis [5], we found that some factors such as scalability, stability, and reliability attracted much. The essential simulation metrics for various MANET issues are identified and Simulators are listed for experiment. The analysis results demonstrate the utilization trends for various MANET simulators.
In this paper, we study the problem of constructing minimum cost multicast trees and computing mu... more In this paper, we study the problem of constructing minimum cost multicast trees and computing multiple multicast paths. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree based Multicasting in ad-hoc networks for route failure tolerance.
The survivability of the network is closely related to the connectivity of the network. For many ... more The survivability of the network is closely related to the connectivity of the network. For many network applications such as a sensor network/ad hoc network for battlefield monitoring or wild fire tracking etc., survivability is one of most important requirements, and therefore a number of related problems are proposed. In this paper we study the survivability with respect to multicast route failure tolerance in K-connected MANET. We analyze the key issues namely connectivity, route failure tolerance and energy of the network. These issues can optimize the design of the routing protocol by means of cross layer interaction across the layers of the network. This paper analyzes the K-connected MANET for various parameters namely connectivity, no. of links, no. of spanning trees, no. of EDMSTs using graph theory metric, connectivity index.
Mobile Ad-hoc Networks (MANETs) are highly decentralized, independent and self-organizing network... more Mobile Ad-hoc Networks (MANETs) are highly decentralized, independent and self-organizing networks. It is significant to study the cost of the network, to optimize the routing method by means of cross layer interaction across the layers of the network. In this paper, first we generate a minimum cost spanning tree for a given network of N- nodes using an efficient algorithm, Then we study the problem of constructing a K-node Multi cast Minimum Spanning Tree (KMMST) for any given multicasting group with K nodes, where K is less than n. Comparing the cost associated with the minimum spanning tree of the entire network with n nodes and the cost of KMMST, it is found that the cost of KMMST is significantly less compared to cost of the n nodes spanning tree.
Due to random mobility of nodes in MANETs, the connectivity of the nodes in very sensitive enviro... more Due to random mobility of nodes in MANETs, the connectivity of the nodes in very sensitive environments become a serious issue and is subject to increased risk of damage. Sometimes a MANET suffers from the simultaneous failure of multiple multicast paths and gets partitioned into disjoint segments. In order to avoid poor performance of a multicast/ unicast routing protocol and to curb the adverse affect on an application performance, it is essential to restore the network connectivity. In this research work, we proposed a novel strategy, designed and implemented to restore the connectivity in MANET as well as to compute Steiner minimum spanning tree.
In this paper, we study the fundamental property of the ad hoc network using connectivity index. ... more In this paper, we study the fundamental property of the ad hoc network using connectivity index. We investigate the construction of minimum cost multicast trees by selecting a link having minimum connectivity Index and comparing application required bandwidth with (available bandwidth – allocated bandwidth) of the link. We have shown that Increase in total connectivity Index of the entire network increases no. of spanning trees. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree Multicasting based on connectivity index with bandwidth constraint.
In this paper an effort has been made to study various Congestion control techniques used for red... more In this paper an effort has been made to study various Congestion control techniques used for reducing/easing the level of congestion and subsequently avoiding the congestion of the wired communication networks in general and High Speed Networks in particular. Many authors have suggested several congestion control techniques [2], [3], [4], [8], [12], [14], [15], [23], [29], [32] & [33] and studied their behavior under various network conditions, for a range of parameters also under heterogeneous networking environments. A special effort has been made to study the problems associated with the TCP congestion control mechanisms and the several solutions that have been proposed to improve its performance. This analysis tries to study the limitations of the suggested solutions, based on various parameters and propose algorithms to overcome these limitations for the High Speed Networks.
Conventional TCP suffers from poor performance on high bandwidth delay product links meant for su... more Conventional TCP suffers from poor performance on high bandwidth delay product links meant for supporting transmission rates of multi Gigabits per seconds (Gbps). This is largely due to TCP’s congestion control algorithm, which can be slow in taking advantage of large amounts of available bandwidth. A number of high-speed variants have been proposed recently, the major ones being BIC TCP, CUBIC, FAST, High-Speed TCP, Layered TCP, Scalable TCP and XCP. In this paper an effort has been made to comparatively analyze the aforementioned protocols based on various parameters viz., Throughput, Fairness, Stability, Performance, Bandwidth Utilization and Responsiveness and study the limitations of these protocols meant for the High Speed Networks.
The conventional TCP suffers from poor performance on high bandwidth delay product links meant fo... more The conventional TCP suffers from poor performance on high bandwidth delay product links meant for supporting data transmission rates of multi Gigabits per seconds (Gbps). This is mainly due to the fact that during congestion, the TCP's congestion control algorithm reduces the congestion window cwnd to ½ and enters additive increase mode, which can be slow in taking advantage of large amounts of available bandwidth. In this paper we have presented a new model and to overcome the drawbacks of the TCP protocol and propose to carry out a study of the same based on various parameters viz., Throughput, Fairness, Stability, Performance and Bandwidth Utilization for supporting data transmission across the High Speed Networks
Mobile Ad-hoc Networks (MANETs) are highly decentralized, independent and self-organizing network... more Mobile Ad-hoc Networks (MANETs) are highly decentralized, independent and self-organizing networks. It is significant to study the cost of the network, to optimize the routing method by means of cross layer interaction across the layers of the network. In this paper, first we generate a minimum cost spanning tree for a given network of N- nodes using an efficient algorithm, and then we study the problem of constructing a K-node Multicast Minimum Spanning Tree (KMMST) for any given multicasting group with K nodes, where K is less than n. Comparing the cost associated with the minimum spanning tree of the entire network with n nodes and the cost of KMMST, it is found that the cost of KMMST is significantly less compared to cost of the n nodes spanning tree. Key words: K-nodes multicasting, cost, spanning tree, routing. 1.
Interpreting available data is a focal issue in data mining. Gathering of primary data is a diffi... more Interpreting available data is a focal issue in data mining. Gathering of primary data is a difficult and expensive affair for assessing the trends for any business decision especially when multiple players are present. There is no uniform formula-type work procedure to deduce information from a vast data set especially if the data formats in the secondary sources are not uniform and need enormous cleansing to mend the data for statistical analysis. In this paper, an incremental approach to cleanse data using a simple yet extended procedure is presented and it is shown how to deduce conclusions to facilitate business decisions. Freely available Indian Telecom Industry’s data over a year is used to illustrate this process. It is shown how to conclude the superiority of one telecom service provider over the others comparing different parameters like network availability, customer service quality etc. using a relative parameter quantification technique. It is found that this method is computationally less costly than the other known methods.
The chief limiting factor for current mobile devices is the amount of battery power. To improve t... more The chief limiting factor for current mobile devices is the amount of battery power. To improve this crucial factor, researchers have tried to optimize power consumption of every aspect of the mobile device. Power consumption can be optimized by disks, memory chips, CPU scheduling and efficient routing techniques.
Dynamic Source Routing (DSR) is a popular protocol for mobile adhoc routing and data forwarding over wireless networks. In this research an innovative mechanism is suggested for DSR that improves both the routing and data forwarding performance, with lesser power consumption.This mechanism involves intelligent use of the route discovery and route maintenance process thereby providing faster routing and reduced traffic as compared to the basic DSR. This mechanism enables faster data forwarding and reduced collisions with lesser power consumption. The basic DSR and modified DSR were studied and compared in GloMoSim simulation environment. Since one of our major goals was to reduce the routing overhead, the existing algorithm was modified to achieve this objective. To get a better idea of the generated overhead we considered the number of routing packets, which carry the overhead. The analysis shows that the performance of modified DSR is better than the performance of the basic DSR for the considered simulations scenarios. The modified algorithm was found to reduce the power consumption of the network by routing lesser routing load.
S. Hiremath,MOBILE AD HOC NETWORKS: ISSUES, …, Jan 1, 2008
ABSTRACT In Mobile Ad hoc Networks (MANETs), the issues of connectivity, bandwidth, link stabilit... more ABSTRACT In Mobile Ad hoc Networks (MANETs), the issues of connectivity, bandwidth, link stability and route failure tolerance significantly affect multicasting. This research work investigates these key issues using graph theory concepts. Further, route failure-tolerant and stable multicast paths are computed based on the graph theory metric called Connectivity Index (CI). This investigation has resulted in Cross-Layer Design (CLD) of QoS multicast protocol based on MPEG-21 multimedia framework. The research work is carried out in MATLAB environment.
The Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in te... more The Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are Ad hoc On-demand Distance Vector (AODV), Destination-Sequenced Distance-Vector Routing protocol (DSDV), Dynamic Source Routing Protocol (DSR), and Optimum Link State Routing (OLSR). Despite the popularity of those protocols, research efforts have not focused much in evaluating their performance when applied to variable bit rate (VBR). In this paper we present our observations regarding the performance comparison of the above protocols for VBR in mobile ad hoc networks (MANETs). We perform extensive simulations, using NS-2 simulator. Our studies have shown that reactive protocols perform better than proactive protocols. Further DSR has performed well for the performance parameters namely delivery ratio and routing overload while AODV performed better in terms of average delay.
Multicasting can efficiently support a variety of applications that are characterized by a close ... more Multicasting can efficiently support a variety of applications that are characterized by a close degree of collaboration, typical for many ad-hoc applications currently envisioned. Within the wired network, well established routing protocols exist to offer an efficient multicasting service. As nodes become increasingly mobile, these protocols need to evolve to similarly provide an efficient service in the new environment. Future multimedia communication systems have to support the user’s needs, the terminal capabilities, the content specification and the underlying networking technologies. The related protocols and applications must be designed from this integration perspective in a cross-layer centric manner. This paper presents the survey of existing related work on QoS Multicasting, Cross-Layer design for QoS Multicasting in ad hoc wireless networks, and MPEG-21 enabled cross-layer Multicast Routing with Quality of Service in Mobile Ad hoc Networks (MCMR- QoS ).
A novel infrastructureless mobile networks (MANETs) is a collection of wireless nodes that can dy... more A novel infrastructureless mobile networks (MANETs) is a collection of wireless nodes that can dynamically form a network to exchange information. The special features of MANET bring this technology great opportunity together with severe challenges. This paper describes the fundamental problems of ad hoc networking by giving its related background including the concept, features, applications, issues of MANETs, investigates and presents recent research trends and identifies Simulators for MANETs[5]. Based on recent research interests of scholars we found that some issues such as routing and power management attracted much attention and issues such as IP addressing and fault tolerance will have wide scope in the future. In the qualitative analysis [5], we found that some factors such as scalability, stability, and reliability attracted much. The essential simulation metrics for various MANET issues are identified and Simulators are listed for experiment. The analysis results demonstrate the utilization trends for various MANET simulators.
In this paper, we study the problem of constructing minimum cost multicast trees and computing mu... more In this paper, we study the problem of constructing minimum cost multicast trees and computing multiple multicast paths. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree based Multicasting in ad-hoc networks for route failure tolerance.
The survivability of the network is closely related to the connectivity of the network. For many ... more The survivability of the network is closely related to the connectivity of the network. For many network applications such as a sensor network/ad hoc network for battlefield monitoring or wild fire tracking etc., survivability is one of most important requirements, and therefore a number of related problems are proposed. In this paper we study the survivability with respect to multicast route failure tolerance in K-connected MANET. We analyze the key issues namely connectivity, route failure tolerance and energy of the network. These issues can optimize the design of the routing protocol by means of cross layer interaction across the layers of the network. This paper analyzes the K-connected MANET for various parameters namely connectivity, no. of links, no. of spanning trees, no. of EDMSTs using graph theory metric, connectivity index.
Mobile Ad-hoc Networks (MANETs) are highly decentralized, independent and self-organizing network... more Mobile Ad-hoc Networks (MANETs) are highly decentralized, independent and self-organizing networks. It is significant to study the cost of the network, to optimize the routing method by means of cross layer interaction across the layers of the network. In this paper, first we generate a minimum cost spanning tree for a given network of N- nodes using an efficient algorithm, Then we study the problem of constructing a K-node Multi cast Minimum Spanning Tree (KMMST) for any given multicasting group with K nodes, where K is less than n. Comparing the cost associated with the minimum spanning tree of the entire network with n nodes and the cost of KMMST, it is found that the cost of KMMST is significantly less compared to cost of the n nodes spanning tree.
Due to random mobility of nodes in MANETs, the connectivity of the nodes in very sensitive enviro... more Due to random mobility of nodes in MANETs, the connectivity of the nodes in very sensitive environments become a serious issue and is subject to increased risk of damage. Sometimes a MANET suffers from the simultaneous failure of multiple multicast paths and gets partitioned into disjoint segments. In order to avoid poor performance of a multicast/ unicast routing protocol and to curb the adverse affect on an application performance, it is essential to restore the network connectivity. In this research work, we proposed a novel strategy, designed and implemented to restore the connectivity in MANET as well as to compute Steiner minimum spanning tree.
In this paper, we study the fundamental property of the ad hoc network using connectivity index. ... more In this paper, we study the fundamental property of the ad hoc network using connectivity index. We investigate the construction of minimum cost multicast trees by selecting a link having minimum connectivity Index and comparing application required bandwidth with (available bandwidth – allocated bandwidth) of the link. We have shown that Increase in total connectivity Index of the entire network increases no. of spanning trees. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree Multicasting based on connectivity index with bandwidth constraint.
In this paper an effort has been made to study various Congestion control techniques used for red... more In this paper an effort has been made to study various Congestion control techniques used for reducing/easing the level of congestion and subsequently avoiding the congestion of the wired communication networks in general and High Speed Networks in particular. Many authors have suggested several congestion control techniques [2], [3], [4], [8], [12], [14], [15], [23], [29], [32] & [33] and studied their behavior under various network conditions, for a range of parameters also under heterogeneous networking environments. A special effort has been made to study the problems associated with the TCP congestion control mechanisms and the several solutions that have been proposed to improve its performance. This analysis tries to study the limitations of the suggested solutions, based on various parameters and propose algorithms to overcome these limitations for the High Speed Networks.
Conventional TCP suffers from poor performance on high bandwidth delay product links meant for su... more Conventional TCP suffers from poor performance on high bandwidth delay product links meant for supporting transmission rates of multi Gigabits per seconds (Gbps). This is largely due to TCP’s congestion control algorithm, which can be slow in taking advantage of large amounts of available bandwidth. A number of high-speed variants have been proposed recently, the major ones being BIC TCP, CUBIC, FAST, High-Speed TCP, Layered TCP, Scalable TCP and XCP. In this paper an effort has been made to comparatively analyze the aforementioned protocols based on various parameters viz., Throughput, Fairness, Stability, Performance, Bandwidth Utilization and Responsiveness and study the limitations of these protocols meant for the High Speed Networks.
The conventional TCP suffers from poor performance on high bandwidth delay product links meant fo... more The conventional TCP suffers from poor performance on high bandwidth delay product links meant for supporting data transmission rates of multi Gigabits per seconds (Gbps). This is mainly due to the fact that during congestion, the TCP's congestion control algorithm reduces the congestion window cwnd to ½ and enters additive increase mode, which can be slow in taking advantage of large amounts of available bandwidth. In this paper we have presented a new model and to overcome the drawbacks of the TCP protocol and propose to carry out a study of the same based on various parameters viz., Throughput, Fairness, Stability, Performance and Bandwidth Utilization for supporting data transmission across the High Speed Networks
Uploads
Papers
expensive affair for assessing the trends for any business decision especially when multiple players are
present. There is no uniform formula-type work procedure to deduce information from a vast data set
especially if the data formats in the secondary sources are not uniform and need enormous cleansing to
mend the data for statistical analysis. In this paper, an incremental approach to cleanse data using a
simple yet extended procedure is presented and it is shown how to deduce conclusions to facilitate business
decisions. Freely available Indian Telecom Industry’s data over a year is used to illustrate this process. It
is shown how to conclude the superiority of one telecom service provider over the others comparing
different parameters like network availability, customer service quality etc. using a relative parameter
quantification technique. It is found that this method is computationally less costly than the other known
methods.
Dynamic Source Routing (DSR) is a popular protocol for mobile adhoc routing and data forwarding over wireless networks. In this research an innovative mechanism is suggested for DSR that improves both the routing and data forwarding performance, with lesser power consumption.This mechanism involves intelligent use of the route discovery and route maintenance process thereby providing faster routing and reduced traffic as compared to the basic DSR. This mechanism enables faster data forwarding and reduced collisions with lesser power consumption. The basic DSR and modified DSR were studied and compared in GloMoSim simulation environment. Since one of our major goals was to reduce the routing overhead, the existing algorithm was modified to achieve this objective. To get a better idea of the generated overhead we considered the number of routing packets, which carry the overhead. The analysis shows that the performance of modified DSR is better than the performance of the basic DSR for the considered simulations scenarios. The modified algorithm was found to reduce the power consumption of the network by routing lesser routing load.
expensive affair for assessing the trends for any business decision especially when multiple players are
present. There is no uniform formula-type work procedure to deduce information from a vast data set
especially if the data formats in the secondary sources are not uniform and need enormous cleansing to
mend the data for statistical analysis. In this paper, an incremental approach to cleanse data using a
simple yet extended procedure is presented and it is shown how to deduce conclusions to facilitate business
decisions. Freely available Indian Telecom Industry’s data over a year is used to illustrate this process. It
is shown how to conclude the superiority of one telecom service provider over the others comparing
different parameters like network availability, customer service quality etc. using a relative parameter
quantification technique. It is found that this method is computationally less costly than the other known
methods.
Dynamic Source Routing (DSR) is a popular protocol for mobile adhoc routing and data forwarding over wireless networks. In this research an innovative mechanism is suggested for DSR that improves both the routing and data forwarding performance, with lesser power consumption.This mechanism involves intelligent use of the route discovery and route maintenance process thereby providing faster routing and reduced traffic as compared to the basic DSR. This mechanism enables faster data forwarding and reduced collisions with lesser power consumption. The basic DSR and modified DSR were studied and compared in GloMoSim simulation environment. Since one of our major goals was to reduce the routing overhead, the existing algorithm was modified to achieve this objective. To get a better idea of the generated overhead we considered the number of routing packets, which carry the overhead. The analysis shows that the performance of modified DSR is better than the performance of the basic DSR for the considered simulations scenarios. The modified algorithm was found to reduce the power consumption of the network by routing lesser routing load.