Bandwidth aware on demand multipath routing in manetsijwmn
Mobile Ad-hoc Networks (MANETs) are self configuring, decentralized and dynamic nature wireless
networks which have no infrastructure. These offer a number of advantages, however the demand of high
traffic flows in MANETs increases rapidly. For these demands, limited bandwidth of wireless network is the
important parameter that restrains the development of real time multimedia applications. In this work, we
propose a solution to utilize available bandwidth of the channel for on demand multiple disjoint paths. The
approximate bandwidth of a node is used to find the available bandwidth of the path. The source chooses
the primary route for data forwarding on the basis of path bandwidth. The simulation results show that the
proposed solution reduces the frequency of broadcast and performs well in improving the end to end
throughput, packet delivery ratio, and the end to end delay.
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
Authentication of Secure Data Transmission In Wireless RoutingIJERA Editor
The major objective of our work is to explore a security enhanced dynamic routing algorithm based on distributed routing information widely supported in existing wired and wireless networks. The message authentication is the main area to be considered in WSN’s. Most of the wireless networks are attacked for detecting the data’s that are transmitted in between the users. We aim at the randomization of delivery paths for data transmission to provide considerably small path similarity (i.e., the number of common links between two delivery paths) of two consecutive transmitted packets. The proposed algorithm should be easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP) for wired networks and Destination-Sequenced Distance Vector (DSDV) protocol for wireless networks over existing infrastructures. These protocols shall not increase the number of control messages if the proposed algorithm is adopted. An analytic study will be presented for the proposed routing algorithm, and a series of simulation study will be conducted to verify the analytic results and to show the capability of the proposed algorithm.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
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.
Bandwidth aware on demand multipath routing in manetsijwmn
Mobile Ad-hoc Networks (MANETs) are self configuring, decentralized and dynamic nature wireless
networks which have no infrastructure. These offer a number of advantages, however the demand of high
traffic flows in MANETs increases rapidly. For these demands, limited bandwidth of wireless network is the
important parameter that restrains the development of real time multimedia applications. In this work, we
propose a solution to utilize available bandwidth of the channel for on demand multiple disjoint paths. The
approximate bandwidth of a node is used to find the available bandwidth of the path. The source chooses
the primary route for data forwarding on the basis of path bandwidth. The simulation results show that the
proposed solution reduces the frequency of broadcast and performs well in improving the end to end
throughput, packet delivery ratio, and the end to end delay.
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
Authentication of Secure Data Transmission In Wireless RoutingIJERA Editor
The major objective of our work is to explore a security enhanced dynamic routing algorithm based on distributed routing information widely supported in existing wired and wireless networks. The message authentication is the main area to be considered in WSN’s. Most of the wireless networks are attacked for detecting the data’s that are transmitted in between the users. We aim at the randomization of delivery paths for data transmission to provide considerably small path similarity (i.e., the number of common links between two delivery paths) of two consecutive transmitted packets. The proposed algorithm should be easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP) for wired networks and Destination-Sequenced Distance Vector (DSDV) protocol for wireless networks over existing infrastructures. These protocols shall not increase the number of control messages if the proposed algorithm is adopted. An analytic study will be presented for the proposed routing algorithm, and a series of simulation study will be conducted to verify the analytic results and to show the capability of the proposed algorithm.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
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.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Performance Comparison of Routing Protocols for Ad Hoc NetworksIJERA Editor
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many routing protocols have been proposed like OLSR, AODV so far to improve the routing performance and reliability. In this paper, we describe the Optimized Link State Routing Protocol (OLSR) and the Ad hoc On-Demand Distance Vector (AODV). We evaluate their performance through exhaustive simulations using the Network Simulator 2 (ns2) by varying conditions (node mobility, network density).
DISTRIBUTED TRAFFIC BY LOAD-BALANCING APPROACH FOR AOMDV IN AD-HOC NETWORKScscpconf
Mobile ad hoc network is a collection of wireless mobile nodes, which are connected over a wireless medium. There is no pre-existing communication infrastructure (no access points, no
base stations) and the nodes can freely move and self-organize into a network topology. Such a network can contain two or more nodes. Hence, balancing the load in an Ad hoc network is
important because the nodes have limited communication resources such as bandwidth, buffer space and battery power. This paper presents a new approach to load balancing based on
residual energy of nodes for distribute the traffic evenly among the network nodes. We are exploiting the multipath routing protocol AOMDV, which defines link-disjoint paths between the
source and the destination in every route discovery. We add the energy metric for load balancing (ELB-AOMDV). The performance is compared between ELB-AOMDV and LBAOMDV.
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
Simulation based comparison of routing protocols in wireless multihop ad hoc ...IJECEIAES
Routing protocols are responsible for providing reliable communication between the source and destination nodes. The performance of these protocols in the ad hoc network family is influenced by several factors such as mobility model, traffic load, transmission range, and the number of mobile nodes which represents a great issue. Several simulation studies have explored routing protocol with performance parameters, but few relate to various protocols concerning routing and quality of service (QoS) metrics. This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile adhoc networks (MANETs). Specifically, the performance of AODV, DSDV, and AOMDV protocols are evaluated and analyzed in the presence of varying the number of mobile nodes, pause time, and traffic connection numbers. Moreover, Routing and QoS performance metrics such as normalized routing load, routing packet, packet delivery ratio, packet drop, end-to-end delay, and throughput are measured to conduct a performance comparison between three routing protocols. Simulation results indicate that AODV outperforms the DSDV and AOMDV protocols in most of the metrics. AOMDV is better than DSDV in terms of end-to-end delay. DSDV provides lower throughput performance results. Network topology parameters have a slight impact on AODV performance.
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.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETsCSCJournals
In ad hoc networks, the nodes are dynamically and arbitrary located in a manner that the interconnections between nodes are changing frequently. Thus, designing an effective routing protocol is a critical issue. In this paper, we propose a fuzzy based routing method that selects the most stable route (FSRS) considering the number of intermediate nodes, packet queue occupancy, and internodes distances. Also it takes the produced cost of the selected route as an input to another fuzzy controller predicts its lifetime (FRLP), the evaluation of the proposed method is performed using OMNet++4.0 simulator in terms of packet delivery ratio, average end-to-end delay and normalized routing load.
Determining the Optimum Number of Paths for Realization of Multi-path Routing...TELKOMNIKA JOURNAL
Multi-Protocol Label Switching for Traffic Engineering (MPLS-TE) technology is an intelligent and
advanced tool for handling traffic through the core networks and implementing new services based on
virtual transport. Since MPLS-TE combines channel and network layer mechanisms, network
administrators can optimally integrate and allocate the traffic loads while maintaining the speed of
technologies such as Asynchronous Transfer Mode (ATM) technology. In this paper, the problem of the
developed algorithm of multi-path routing which allows us to determine the optimum number of
independent shortest paths is theoretically solved. In details, the article proposes a way for finding the set
of shortest paths using Dijkstra's algorithm, and then determination of the maximum flow for each of the
shortest paths based on the mathematical concepts and finally, introducing the solution of the multi-criteria
optimization problem for a set of shortest paths. According to our approach, optimizing the use of
resources in the core networks is possible with using the MPLS-TE technology.
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.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Performance Comparison of Routing Protocols for Ad Hoc NetworksIJERA Editor
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many routing protocols have been proposed like OLSR, AODV so far to improve the routing performance and reliability. In this paper, we describe the Optimized Link State Routing Protocol (OLSR) and the Ad hoc On-Demand Distance Vector (AODV). We evaluate their performance through exhaustive simulations using the Network Simulator 2 (ns2) by varying conditions (node mobility, network density).
DISTRIBUTED TRAFFIC BY LOAD-BALANCING APPROACH FOR AOMDV IN AD-HOC NETWORKScscpconf
Mobile ad hoc network is a collection of wireless mobile nodes, which are connected over a wireless medium. There is no pre-existing communication infrastructure (no access points, no
base stations) and the nodes can freely move and self-organize into a network topology. Such a network can contain two or more nodes. Hence, balancing the load in an Ad hoc network is
important because the nodes have limited communication resources such as bandwidth, buffer space and battery power. This paper presents a new approach to load balancing based on
residual energy of nodes for distribute the traffic evenly among the network nodes. We are exploiting the multipath routing protocol AOMDV, which defines link-disjoint paths between the
source and the destination in every route discovery. We add the energy metric for load balancing (ELB-AOMDV). The performance is compared between ELB-AOMDV and LBAOMDV.
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
Simulation based comparison of routing protocols in wireless multihop ad hoc ...IJECEIAES
Routing protocols are responsible for providing reliable communication between the source and destination nodes. The performance of these protocols in the ad hoc network family is influenced by several factors such as mobility model, traffic load, transmission range, and the number of mobile nodes which represents a great issue. Several simulation studies have explored routing protocol with performance parameters, but few relate to various protocols concerning routing and quality of service (QoS) metrics. This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile adhoc networks (MANETs). Specifically, the performance of AODV, DSDV, and AOMDV protocols are evaluated and analyzed in the presence of varying the number of mobile nodes, pause time, and traffic connection numbers. Moreover, Routing and QoS performance metrics such as normalized routing load, routing packet, packet delivery ratio, packet drop, end-to-end delay, and throughput are measured to conduct a performance comparison between three routing protocols. Simulation results indicate that AODV outperforms the DSDV and AOMDV protocols in most of the metrics. AOMDV is better than DSDV in terms of end-to-end delay. DSDV provides lower throughput performance results. Network topology parameters have a slight impact on AODV performance.
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.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETsCSCJournals
In ad hoc networks, the nodes are dynamically and arbitrary located in a manner that the interconnections between nodes are changing frequently. Thus, designing an effective routing protocol is a critical issue. In this paper, we propose a fuzzy based routing method that selects the most stable route (FSRS) considering the number of intermediate nodes, packet queue occupancy, and internodes distances. Also it takes the produced cost of the selected route as an input to another fuzzy controller predicts its lifetime (FRLP), the evaluation of the proposed method is performed using OMNet++4.0 simulator in terms of packet delivery ratio, average end-to-end delay and normalized routing load.
Determining the Optimum Number of Paths for Realization of Multi-path Routing...TELKOMNIKA JOURNAL
Multi-Protocol Label Switching for Traffic Engineering (MPLS-TE) technology is an intelligent and
advanced tool for handling traffic through the core networks and implementing new services based on
virtual transport. Since MPLS-TE combines channel and network layer mechanisms, network
administrators can optimally integrate and allocate the traffic loads while maintaining the speed of
technologies such as Asynchronous Transfer Mode (ATM) technology. In this paper, the problem of the
developed algorithm of multi-path routing which allows us to determine the optimum number of
independent shortest paths is theoretically solved. In details, the article proposes a way for finding the set
of shortest paths using Dijkstra's algorithm, and then determination of the maximum flow for each of the
shortest paths based on the mathematical concepts and finally, introducing the solution of the multi-criteria
optimization problem for a set of shortest paths. According to our approach, optimizing the use of
resources in the core networks is possible with using the MPLS-TE technology.
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.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (2
2n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
Abstract : As the network size increases the probability of congestion occurrence at nodes increases. This is because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses. In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing (IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput and packet delivery fraction. Keywords- DSDV, Hybrid protocol, AODV, IAODV, MANET
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
The Impact of Signal Strength over Routing Protocols in Wireless NetworksDr. Amarjeet Singh
In ad hoc routing protocols the source node
may need an intermediate nodes to transmit the packets into
the destination if the destination is not within transmission
range of the source. This paper studies the impact of signal
strength of nodes over ad hoc routing protocols and explains
an important effect of signal strength on ad hoc routing
protocols in four different directions including the routes and
the nodes. As a result the study give an important
improvement in ad hoc routing protocols when using signal
strength compared to other ad hoc routing protocols without
considering signal strength.
Token Based Packet Loss Control Mechanism for NetworksIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
Similar to A Load Aware Proposal for Maximum Available Bandwidth Routing in Wireless Mesh Network (20)
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Democratizing Fuzzing at Scale by Abhishek Aryaabh.arya
Presented at NUS: Fuzzing and Software Security Summer School 2024
This keynote talks about the democratization of fuzzing at scale, highlighting the collaboration between open source communities, academia, and industry to advance the field of fuzzing. It delves into the history of fuzzing, the development of scalable fuzzing platforms, and the empowerment of community-driven research. The talk will further discuss recent advancements leveraging AI/ML and offer insights into the future evolution of the fuzzing landscape.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Top 10 Oil and Gas Projects in Saudi Arabia 2024.pdf
A Load Aware Proposal for Maximum Available Bandwidth Routing in Wireless Mesh Network
1. IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 13, Issue 3 (Jul. - Aug. 2013), PP 80-86
www.iosrjournals.org
www.iosrjournals.org 80 | Page
A Load Aware Proposal for Maximum Available Bandwidth
Routing in Wireless Mesh Network
1
Jaseena C.A., 2
Govindaraj E.
1,2
Department of Computer Science, MES College of Engineering Kuttippuram Kerala India
Abstract: Wireless Mesh Network (WMN) consists of a large number of wireless nodes. The nodes form a
wireless overlay to cover the service area while a few nodes are wired to the internet. Seeking the path with the
maximum available bandwidth is one of the fundamental issues in the wireless mesh networks. If the traffic
rate of a new flow on a path is no greater than the available bandwidth of this path, accepting the new
traffic will not violate the bandwidth guarantees of the existing flows. The routing protocols should be
satisfying the optimality and consistency requirement. This survey analyses the different routing techniques
which provides bandwidth guarantee and high throughput and also discusses different problems faced out by
those methods and identifies a routing technique which route through the maximum available bandwidth path
from source to destination with the satisfaction of optimality and consistency requirement, plot the
throughput and delay graph and then analyses the results with other method. Finally propose a load aware
bandwidth guaranteed routing protocol.
Keywords: Isotonicity, ETX, CAB, widest path, AVAIL
I. INTRODUCTION
Mesh networking is a type of networking where each node in the network may act as an independent
router. Mesh networks different from other networks in the sense that all component parts can connect to each
other via multiple hops. Mesh networks can be seen as one type of ad hoc network. Because of several
attractions self healing, self organizing, less connectivity etc. WMNs are undergoing rapid development. Such
work has been done to realize and enhance WMN over the past few years. Routing in WMN has been a
hot research area in recent years.
Routing is the process of selecting paths in a network along which to send network traffic.
Routing metric is a key element of any routing protocol since they determine the creation of network
paths [1]. The key components that can be utilized to compose a routing metric for wireless mesh networks
are number of hops, link capacity, link quality and channel diversity. Some criteria must necessarily be met in
order for a metric to choose better routes. Some of them are intra-flow interference, interflow interference,
external interference, locality of information, load balancing, agility, isotonicity, and throughput. Seeking the
path with the maximum available bandwidth is one of the fundamental issues for supporting QOS in the
WMN. The aim of this paper is to analyze the different bandwidth guaranteed routing protocols in WMN
and find out a research scope in the same field.
ETT the Expected Transmission Time (ETT) metric [7] is designed to augment ETX by considering
the different link rates or capacities. This allows ETT to overcome the limitation of ETX that it cannot
discriminate between links with similar loss rates but have a massive disparity in terms of bandwidth. The
Weighed cumulative ETT (WCETT) metric [7] has been designed to improve the ETT metric by considering
channel diversity. IRU [8] metric captures the total channel time of the neighbours that is affected by the
transmission between i and j, which represents the level of inter-flow interference that the flow inflicts on
the network.
II. ETX-EXPECTED TRANSMISSION COUNT
ETX[2] is the first metric proposed for WMNs which finds high-throughput paths on multi-hop wireless
networks. ETX minimizes the expected total number of packet transmissions (including retransmissions)
required to successfully deliver a packet to the ultimate destination. The ETX metric incorporates the effects
of link loss ratios, asymmetry in the loss ratios between the two directions of each link, and interference among
the successive links of a path.
In contrast, the minimum hop count metric chooses arbitrarily among the different paths of the same
minimum length, regardless of the often large differences in throughput among those paths, and ignoring
the possibility that a longer path might offer higher throughput.
The metrics overall goal is to choose routes with high end-to-end throughput. The number of received
probes is calculated at the last T time interval in a sliding-window fashion. Example: the ETX of link AB
considering the delivery ratio of probes sent on the forward (df ) and reverse (dr) directions. Delivery
2. A Load Aware Proposal for Maximum Available Bandwidth Routing in Wireless Mesh Network
www.iosrjournals.org 81 | Page
ratios are, at the same T interval, The fraction of successfully received probes from A announced by B.
The fraction of successfully received probes from B. The ETX of link AB is :
ET X = 1/(df dr)
III. AVAIL-A MODEL BASED APPROACH
This work[3] construct an analytical model that accurately captures the 802.11 MAC protocol
operation and predicts both throughput and delay of multi-hop flows under changing traffic load or routing
decisions. The main goal of this model is to characterize each link by the packet loss probability and by the
fraction of busy time sensed by the link transmitter, and to capture both intra-flow and inter-flow
interference. It reveals that the busy time fraction experienced by a node, a locally measurable quantity, is
essential in finding maximum throughput paths. Based on this analytical model, create a novel routing
metric that can be used to discover high throughput path in a congested network. A two-step technique to
estimate available path bandwidth is introduced. Step 1 - By considering the busy time fraction and packet
loss probability and calculate link capacity in the path. Step 2 - The link capacities can be expressed as
clique-based method. This method represents a graph called link conflict graph to express the interference
relationship between links.
A. Analytical Model
Fig 1: Example of evolution of the channel state perceived by a node
It is the general decoupling technique to analyze the behaviour of each node in an 802.11 network
with arbitrary topology. First consider the case in which each source sends traffic to a single neighbouring
node. Since this case allows to analyze only particular traffic patterns, then analyses to the general case in
which a node transmits to multiple neighbours. The evolution of the channel state experienced by a node can
be described as a renewal process with four different states, as illustrated in the example of Fig 1. The 4
states are : (i) idle channel; (ii) channel occupied by a successful transmission of the node; (iii) channel
occupied by a collision of the node; (iv) busy channel due to activity of neighbouring nodes, detected by
means of either physical or virtual carrier sensing . The time intervals during which the station remains in
each of the four states above are denoted by , Ts, Tc, and Tb, respectively. While σ is constant, equal to
one backoff slot, the duration of the other intervals can be variable , the frame size, and the sending rate
of the transmitting station(s). Both Ts, Tc, and Tb include a deterministic idle slot .
The available bandwidth of a multi-hop flow over a path is the maximum throughput it can achieve
subject to the condition that no queue along the path gets overloaded, i.e., the traffic intensity on each link
is kept smaller than or equal to 1. Inter-flow and intra-flow interference can takes into account separately.
IV. EED –AN END TO END DELAY
This work[4] studies how to select a path with the minimum cost in terms of expected end-to-
end delay (EED) in a multi-radio wireless mesh network. Different from the previous efforts, the new EED
metric takes the queuing delay into account, since the end-to-end delay consists of not only the
transmission delay over the wireless links but also the queuing delay in the buffer. In addition to
minimizing the end-to-end delay, the EED metric implies the concept of load balancing. Then develop
EED based routing protocols for both single-channel and multi-channel wireless mesh networks. In particular
for the multi-radio multichannel case, we develop a generic iterative approach to calculate a multi-radio
achievable bandwidth (MRAB) for a path, taking the impacts of inter/intra-flow interference and
space/channel diversity into account. The MRAB is then integrated with EED to form the metric of
weighted end-to-end delay.
EEDi = E[queuing − delay + transmission − delay]
V. CAB - HOP BY HOP PACKET FORWARDING
Work[6] study the problem of identifying the maximum available bandwidth path, a fundamental
issue in supporting quality-of-service in WMNs. Due to interference among links, bandwidth, a well-known
bottle- neck metric in wired networks, is neither concave nor additive in wireless networks. Here design a
new path weight which captures the available path bandwidth information prove that our hop-by-hop routing
3. A Load Aware Proposal for Maximum Available Bandwidth Routing in Wireless Mesh Network
www.iosrjournals.org 82 | Page
protocol based on the new path weight satisfies the consistency and loop-freeness requirements. The
consistency property guarantees that each node makes a proper packet forwarding decision, so that a data
packet does traverse over the intended path. Fig 2. shows the detailed flow diagram of method[6].
Fig 2: Detailed Flow Diagram.
V.A Network Interference Model
1) Construct Link Conflict Graph
Link conflict graph (or conflict graph for short) to reflect the interference relationship between links.
A link in the wireless network becomes a node in the link conflict graph. If two links in the wireless
network interfere with each other, we put a link between the corresponding nodes in the link conflict graph.
We use an example to illustrate the link conflict graph. Fig 3 shows a five-link chain topology. The numbers
on the links are the ids of the links. The link conflict graph of the network is shown in Fig 3. Links 1 and
2 interfere with each other since node b cannot send and receive simultaneously. Links 1 and 3 interfere
with each other since the signal from c is strong enough to interfere the reception at b. Therefore, there
are links between 1 and 2 as well as 1 and 3 in the conflict graph. Assume that links 1 and 4 do not interfere
because the signal from d cannot affect b in successfully receiving the signal from a. Then, there is no link
between 1 and 4 in Fig 3.
Fig 3: Illustration for interference model (a) The original graph (b) The conflict graph .
2) Find Maximal Interference Clique
An interference clique is the set of links which interfere with each other. In the conflict graph,
the corresponding nodes of these links form a complete sub graph. In Fig 3 b, (1, 2), (1, 3), (1, 2, 3), and (3,
4, 5) are interference cliques. A maximal interference clique is a complete sub graph that is not contained in
any other complete sub graph. For instance, (1,2,3) and (3, 4, 5) are maximal cliques while (1, 2) and (1,
3) are not maximal cliques. In this method[6], we consider single-channel single rate wireless networks,
and so the original capacity of each link is the same, denoted by C. Denote Q1,Q2....QK as the maximal
interference clique set of the network. The size of a maximal clique depends on how many links interfere
with each other, which depends on the interference model adopted in the network.
3) Compute Clique Bandwidth
Given a path p =< v1, v2, ...Vh > let B(k) be the estimated available bandwidth on the link between Vk
and Vk+1. Under the TRCA interference model, the formula for estimating the available bandwidth of path
p is as
B(p) = 1 ≤ k ≤ h − 4minCk
C k = ( 1 + 1 + 1 + 1 )−1 Given path p =< v1, v2, ...vh >
B(k) B(k+1) B(k+2) B(k+3)
let p0 =< v2, ...vh > and p1 =< v1, v2, v3, v4, v5 >, as illustrated in Fig 4. It can easily verify that
B(p) = min(B(p1); B(p0 ). This formula allows the estimated path bandwidth to be computed in a hop by
hop manner. Although the works in [3], and [4] apply this mechanism to compute the path bandwidth, no
work has been found to propose an efficient path selection mechanism which satisfies the optimality
4. A Load Aware Proposal for Maximum Available Bandwidth Routing in Wireless Mesh Network
www.iosrjournals.org 83 | Page
requirement. That is, no existing protocol can provide the performance guarantee for finding the maximum
available bandwidth path by using above equation.
Figure 4: Path bandwidth computation in hop by hop manner.
V.B Path Selection
For path selection the distance vector based mechanism is using. In the traditional distance vector mechanism, a
node only has to advertise the information of its own best path to its neighbours. Each neighbour can then
identify its own best path. But in this method[6] a node only advertises the widest path from its own
perspective, its neighbours may not be able to find the widest path. In order to assure that the widest path from
each node to a destination can be identified, a trivial way is to advertise all the possible paths to a destination.
This is definitely too expensive. On the other hand, as long as we advertise every path which is a sub path of a
widest path. Thus, to reduce the overhead, we should not advertise those paths that would not be a sub
path of any widest path. So there is need a sufficient and necessary condition for a node to determine
whether a path must not be the sub path of any maximum bandwidth path.
1) Determine Widest Path
The bandwidth of the link from a to b is B(a, b) and a path p =< v1, v2, ..vh >, let W B(p) = B(p), F
B(p) = B(v1, v2), T B(p) = W B(< v1, v2, v3 >), and H B(p) = W B(< v1, v2, v3, v4 >). In other words,
WB(p) is the bandwidth of the whole path, FB(p) is the bandwidth on the first link, TB(p) is the bandwidth of
the sub path composed of the first two links, and HB(p) is the bandwidth of the sub path composed of the
first three links. Concatenation of paths p1 and p2 as p1 ⊕ p2. According to Fig 5 let P 1 =< v, u1, ..., un,
d > , p2 =<v, g1, g2, ..gm, d >, P =< s, v1, ..vh, v >, P 1, 1 =< vh−2, vh−1, vh, v, u1 >, P 1, 2 =< vh − 1, vh,
v, u1, u2 >, P 1, 3 =< vh, v, u1, u2, u3 >, Also find P2,1 and p2,2 and p2,3. Bandwidth of a path is the
bandwidth of the bottleneck clique, and each clique consists of four links.
W B(p⊕p1) = min{W B(p), WB(p1, 1), W B(p1, 2), WB(p1, 3), W B(p1)}
W B(p⊕p2) = min{W B(p), WB(p2, 1), W B(p2, 2), WB(p2, 3), W B(p2)}
Pruning condition is a sufficient condition for V to determine p2 is not worthwhile to be advertised because p1
must be better than p2 for every p, which implies p2 can never be a sub path of a widest path. That is p1
prunes p2 if W B(p1) ≥ W B(p2) for every p.
2) Find Non dominated Path
Given two paths p1 and p2, If (w1(p1) ≥ w2(p2), w2(p1) ≥ w2(p2), w3(p1) ≥w3(p2), and w4(p1)
≥ w4(p2)) then P1 dominates p2. If given two paths p1 and p2, we call p1 dominates p2. If we cannot find a
path dominating p1, call p1 a non dominated path.
3) Compute Path Weight(CAB)
Composite Available Bandwidth(CAB) of path p is w(p) = (W 1(p1), W 2(p2) ,W 3(p3), w4(p4)) W
1(p) = W B(p) is bandwidth of whole path W2(p)=HB(p)is bandwidth of sub path composed of first three
link. W3(p)=TB(p) is bandwidth of sub path composed of first two link and W4(p)=FB(p) is bandwidth
of first link. (w1(p1) w2(p2)), iff W 1(p1) ≥ W 1(p2), W 2(p1) ≥ w2(p2), W 3(p1) ≥ w3(p2), W 4(p1) ≥
w4(p2)).
V.C Packet Forwarding
1) Route Packet Construction
The isotonicity property of the proposed path weight allows us to develop a routing protocol
that can identify the maximum bandwidth path from each node to each destination. In particular, whether
5. A Load Aware Proposal for Maximum Available Bandwidth Routing in Wireless Mesh Network
www.iosrjournals.org 84 | Page
a path is worthwhile to be advertised, meaning whether a path is a potential sub path of a widest path. In
the routing protocol, if a node finds a new non dominated path, it will advertise this path information to
its neighbours. We call the packet carrying the path information the route packet. For each non dominated
path p from s to d, s advertises the tuple (s; d; N F (p); N S(p); N T (p); w(p)) to its neighbours in a route
packet. NF(p),NS(p), and NT(p) are the next hop, the second next hop, and the third next hop on p from s ,
respectively. Based on the information contained in a route packet, each node knows the information about
the first four hops of a path identified. This information is necessary for consistent routing.
2) Table Construction
Each node keeps two tables: distance table and routing table. Node s puts all the non dominated
paths advertised by its neighbours in its distance table. It keeps all the non dominated paths found by s
itself in its routing table. When s receives an advertisement (s; d; N F (p); N S(p); N T (p); w(p)) from u which
represents a non dominated path p from u to d, s removes all the locally recorded paths from u to d which are
dominated by p. Denote p’ as the path from s to d which is one-hop extended from p.
3) Node Update
After the network accepts a new flow or releases an existing connection, the local available bandwidth
of each node will change, and thus the widest path from a source to a destination may be different. When the
change of the local available bandwidth of a node is larger than a threshold, the node will advertise the new
information to its neighbours. After receiving the new bandwidth information, the available bandwidth of a
path to a destination may be changed. Although the node is static, the network state information changes
very often. Therefore, our routing protocol applies the route update mechanism in DSDV . Based on DSDV,
each routing entry is tagged with a sequence number which is originated by the destination, so that nodes
can quickly distinguish stale routes from the new ones. Each node periodically transmits updates and
transmits updates immediately when significant new route information is available. Given two route entries
from a source to a destination, the source always selects the one the larger sequence number, which is
newer, to be kept in the routing table. Only if two entries have the same sequence number, the path
comparison is used to determine which path should be kept.
VI. PROBLEM DEFINITION
The hop by hop packet forwarding mechanism in CAB is the method that provides bandwidth
guarantee. Only the CAB routes through the maximum available bandwidth path from source to destination
with the satisfaction of optimality and consistency requirements of routing protocols. But this method does
not consider traffic load on each link. An efficient load aware bandwidth guaranteed routing method, which
provide maximum available bandwidth guarantee from source to destination is yet to be formulated.
VII. PROPOSED SYSTEM
Different channels can be used for packet transmission. First, transmit packets through the low
bandwidth channel. Here the packets send through the maximum available bandwidth path from source to
destination. If the load increases and the transmission overhead occurs in that channel change the channel
and transmit through high bandwidth path.
Figure 5: Flow diagram of proposed system .
6. A Load Aware Proposal for Maximum Available Bandwidth Routing in Wireless Mesh Network
www.iosrjournals.org 85 | Page
VIII. OBSERVATION AND ANALYSIS
Table I describes different routing metrics and their path characteristics, Table 2 describes the different
components of metrics.
TABLE I
METRIC COMPONENTS
Metrics Metric Components
Number
of hops
Link
Capacity
Link
quality
Channel
diversity
Number
of hops
ETX Yes No Yes No Yes
AVAIL Yes Yes Yes No Yes
EED Yes Yes Yes Yes Yes
CAB Yes Yes Yes Yes Yes
Proposed
CAB
Yes Yes Yes Yes Yes
ETX does not perform well in multi rate and multi radio networks due to its lack of knowledge of cochannel
interference and its insensitivity to different link rates or capacities. As a consequence, ETX tends to select
links with lower rate. Links with lower transmission rates take up more medium time to transmit data and
forces neighbouring nodes to back off from their own transmissions and ETX does not consider the load of a
link and will therefore route through heavily loaded nodes without due consideration, leading to balanced
resource usage. ETX does not discriminate between node types and makes no attempt to minimize intra
flow interference by choosing channel-diverse paths. However, ETX does deal with inter-flow interference
indirectly, through the measurements of link-layer losses. Links with a high level of interference will have a
higher packet loss rate and therefore a higher ETX value. ETX is isotonic, and therefore allows efficient
calculation of minimum weight and loop-free paths metric is able to find routes with considerably higher
throughput than the routes chosen by ETX or IRU.
AVAIL typically selects longer routes than those chosen by IRU or ETX. This is because AVAIL
does a better job at finding longer routes with higher available bandwidth than shorter routes. The throughput
gain of AVAIL increases when the offered load in the network is increased. More importantly, under
loss-based metrics almost half the flows receive close to zero throughput while AVAIL is able to identify non-
starving paths.
EED metric can result in much better end-to-end delay performance than ETX and ETT. Regarding
the network throughout, ETT and EED has the similar performance, while outperforming the ETX. The reason
that ETT and EED have similar throughput performance is that both of them exploit the transmission
failure probability for computing the link metric, while the transmission failure probability is directly related
to the MAC throughput. In most of the cases, ETT has slightly higher throughput, which is due to the larger
computation overhead with EED and implementation overhead due to path change incurred by the random
queue length behaviour. An inappropriate large update interval will not timely respond to a congested link and
result in unnecessary packet loss due to a full buffer. If the buffer size is small, in most of the cases all the
buffers are full, where the EED could not exploit more benefit com- pared to the ETT. The extra computation
overhead and route updating overhead, however, will lead to a smaller network throughput. When the buffer is
large, EED can select a path with more buffer space, which will lead to less tail-dropping of the packets and
thus a higher throughput.
The path ETX or IRU is simply computed by summing the ETXs or IRUs of all the links on a
path. Such calculation method causes ETX and IRU prefer the short path to the long path, such that
ETX or IRU may select a low available bandwidth path. Although the practical throughput of the existing
metric is higher than that of CAB metric for some particular flows, the difference is small. Therefore,
CAB metric is relatively more efficient for finding the high throughput path. CAB provides high
bandwidth guarantee and satisfies optimality and consistency requirement.
IX. EXPERIMENTAL RESULTS
Completed the hop by hop routing protocol[6] implementation in NS 2.31 and the method is
simulated. Plotted the graph for different parameters such as through put, packet delivery ratio and delay.
Graphs shows the improvement of throughput, and reduction of delay than the method ETX[2].
7. A Load Aware Proposal for Maximum Available Bandwidth Routing in Wireless Mesh Network
www.iosrjournals.org 86 | Page
Figure 6 Graph of throughput and delay
X. CONCLUSION AND FUTURE SCOPE
Bandwidth guaranteed routing is one of the most emerging areas of research in wireless mesh
networks. This paper analyses different routing techniques which provides bandwidth guarantee and high
throughput. The maximum available bandwidth path problem, is the fundamental issue to support quality of-
service in wireless mesh networks. The hop by hop packet forwarding mechanism in CAB is the only
bandwidth guaranteed routing method that can route through the maximum available bandwidth path from
source to destination. Load balanced bandwidth guaranteed routing protocol that can route through the
maximum available bandwidth path from source to destination which is suitable for highly dynamic situation
may be designed and developed.
REFERENCES
[1] M.E.M. Campista, P.M. Esposito, I.M. Moraes, LHM Costa, OCM Duarte, D.G. Passos, C.V.N. de Albuquerque, D.C.M. Saade,
and M.G. Rubin- stein. Routing metrics and protocols for wireless mesh networks. Network, IEEE, 22(1):6–12, 2008
[2] D.S.J.D. Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless
routing. Wireless Networks, 11(4):419–434, 2005.
[3] T. Salonidis, M. Garetto, A. Saha, and E. Knightly. Identifying high throughput paths in 802.11 mesh networks: a
model-based approach. In Network Protocols, 2007. ICNP 2007. IEEE International Conference on, pages 21–30. IEEE,2007.
[4] T. Salonidis, M. Garetto, A. Saha, and E. Knightly. Identifying high throughput paths in 802.11 mesh networks:
a model-based approach. In Network Protocols, 2007. ICNP 2007. IEEE International Conference on, pages 21–30. IEEE,
2007.
[5] H. Li, Y. Cheng, C. Zhou, and W. Zhuang. Min- imizing end-to-end delay: a novel routing metric for multi-radio
wireless mesh networks. In INFO- COM 2010, IEEE, pages 46–54. IEEE, 2010.
[6] F. Li, Y. Fang, F. Hu, and X. Liu. Load-aware multicast routing metrics in multi-radio multi- channel wireless mesh
networks. Computer Net- works, 55(9):2150–2167, 2011.
[7] R. Hou, K.S. Lui, F. Baker, and J. Li. Hop-by-hop routing in wireless mesh networks with bandwidth guarantees. Mobile
Computing, IEEE Transac- tions on, 11(2):264–277, 2012.