In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
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.
In order enhance the network efficiency of Mobile ad hoc Networks (MANETs), an Power Unbiased Cooperative Media Access Control(PUC-MAC) protocol in MANETs was planned during this paper. It adopted the most effective partnership choice statement to select the cooperative node with higher channel condition, higher passing rate and additional balanced power consumption. Simulation results showed that PUC-MAC outperforms EC-MAC,Cooperative MAC (CoopMAC) and IEEE 802.11 Distributed Coordination perform (DCF) in terms of the packet release quantitative relation, network outturn and network lifespan beneath 2 distinct channel noise levels, particularly beneath the worst channel condition.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
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.
In order enhance the network efficiency of Mobile ad hoc Networks (MANETs), an Power Unbiased Cooperative Media Access Control(PUC-MAC) protocol in MANETs was planned during this paper. It adopted the most effective partnership choice statement to select the cooperative node with higher channel condition, higher passing rate and additional balanced power consumption. Simulation results showed that PUC-MAC outperforms EC-MAC,Cooperative MAC (CoopMAC) and IEEE 802.11 Distributed Coordination perform (DCF) in terms of the packet release quantitative relation, network outturn and network lifespan beneath 2 distinct channel noise levels, particularly beneath the worst channel condition.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
Modulation aware connection admission control and uplink scheduling algorithm...ijwmn
Mobile WiMAX standard defines air interface for mobile broadband wireless access (BWA) systems and aimed to provide high data rate with seamless mobility while maintaining the quality of service (QoS). However, QoS of real-time applications depends on the link quality, which necessitate the channel-aware connection admission control (CAC) and scheduling schemes. In this paper Modulation aware CAC scheme and base station (BS) uplink scheduling algorithm are proposed to improve the system capacity and QoS performance respectively. The proposed CAC scheme aims to increase the admission of higher priority real time services by degrading the bandwidth of admitted lower priority connections on the basis of their channel status without deteriorating their QoS performance much. The performances of proposed algorithms are evaluated through simulation by considering the metrics like throughput, delay and number of connections admitted.
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...inventionjournals
In this paper we propose a new modified adhoc routing algorithm for adhoc network that locally repairs a link failure and also conflicts the noise and link modification simultaneously. Due to topology changes caused by nodes’ mobility in adhoc network, the link routes get disconnected frequently. Our proposed scheme does a local repair of link failure and also takes care of malicious nodes with the help of a reliability measure while performing route discovery using link-prediction routing algorithm(LPRA). These two performance metrics are integrated by Route link-prediction algorithm. This algorithm is carried out as follows, Select the least dynamic route link with the longest lifetime for persistent data forwarding. Node Lifetime and link lifetime prediction methods. The receiver can measure the signal strength when it receives the packets from sender in same power level and then it calculates the distance between two nodes by applying the radio propagation model in LPRA using adhoc network. Simulation results show that our proposed schemeperforms better in comparison to a popular existing technique
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Journals
Abstract One of the most complicated issues is to measuring the delay performance of end to end nodes in Multi-hop Wireless Networks. The two nodes are communicating via hopping over the multiple wireless links. The fact that is each node has to concentrate not only its own generated traffic, but also relayed one. Observing unfairness particularly for transmissions among nodes that are more than one hop Most of the existing works deals with the joint congestion control and scheduling algorithm, which does not focusing the delay performance. In turn, considering the throughput metric alone although for congestion control flows, throughput is the repeated difficult performance metric Packet delay is also important because practical congestion control protocols need to establish the timeouts for the retransmissions based on the packet delay, such parameters could significantly impact the speed of recovery when loss of packets occurred. The related issues on the delay-performance First, for long flows, the end to end delay may grow in terms of square with based on the number of hops. Second, it is difficult to control the end-to-end delay of each flows. TDMA schedules the transmissions in a fair way, in terms of throughput per connection, considering the communication requirements of the active flows of the network. It does not work properly in the multi-hop scenario, because it is generated only for single hop networks, We propose The Leaky Bucket Algorithm, in addition to joint congestion control and scheduling algorithm in multi-hop wireless networks. The proposed algorithm not only achieves the provable throughput and also considering the upper bounds of the delay of each flow. It reduces the transmission time by delivering packets at a constant bit rate even it receives the packet at a busty way. Keywords- Multi-hop wireless networks, congestion control, Performance, Delay, Flow, Throughput.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
TOPOLOGY DISCOVERY IN MULTI-HOP CLUSTERING VEHICULAR NETWORKScaijjournal
In this paper, we propose a novel multi-hop cluster architecture for location service protocol in vehicular ad
hoc networks. The proposed scheme uses two parameters which are the connectivity between vehicles and the
vehicle mobility to select cluster head. The performance of the proposed scheme is the tradeoff between the
vehicle locations and the communication overheads. The proposed scheme is not only scalable but also
reliable and is able to achieve high load balancing with fast convergence. The cluster constructed by the
proposed scheme is more stable than exiting vehicular ad hoc network clustering schemes. Specifically, the
proposed scheme can increase the cluster-head lifetime up to 50%. The reason behind this achievement is
that the proposed scheme considers vehicle mobility in terms of average link expiration time while selecting
cluster-head.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
Energy balanced improved leach routing protocol for wireless sensor networkscsandit
A proper sensor node clustering is an effective topology control that can balance energy
consumption among sensor nodes and increase network scalability and life time. As the use of
wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing
and data aggregation has also risen. LEACH
(
Low Energy Adaptive Cluster Hierarchy
)
is a
hierarchical clustering protocol that provides an elegant solution for such protocols. Random
clustering is the main deficiency of LEACH. In this paper an energy balanced clustering
approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized
clustering algorithm that based on minimum energy clustering to form optimal clusters. For the
candidate nodes, the location and the residual energy are used as key parameters to select the
cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms
of energy conservation and network life time prolonging.
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.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Modulation aware connection admission control and uplink scheduling algorithm...ijwmn
Mobile WiMAX standard defines air interface for mobile broadband wireless access (BWA) systems and aimed to provide high data rate with seamless mobility while maintaining the quality of service (QoS). However, QoS of real-time applications depends on the link quality, which necessitate the channel-aware connection admission control (CAC) and scheduling schemes. In this paper Modulation aware CAC scheme and base station (BS) uplink scheduling algorithm are proposed to improve the system capacity and QoS performance respectively. The proposed CAC scheme aims to increase the admission of higher priority real time services by degrading the bandwidth of admitted lower priority connections on the basis of their channel status without deteriorating their QoS performance much. The performances of proposed algorithms are evaluated through simulation by considering the metrics like throughput, delay and number of connections admitted.
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...inventionjournals
In this paper we propose a new modified adhoc routing algorithm for adhoc network that locally repairs a link failure and also conflicts the noise and link modification simultaneously. Due to topology changes caused by nodes’ mobility in adhoc network, the link routes get disconnected frequently. Our proposed scheme does a local repair of link failure and also takes care of malicious nodes with the help of a reliability measure while performing route discovery using link-prediction routing algorithm(LPRA). These two performance metrics are integrated by Route link-prediction algorithm. This algorithm is carried out as follows, Select the least dynamic route link with the longest lifetime for persistent data forwarding. Node Lifetime and link lifetime prediction methods. The receiver can measure the signal strength when it receives the packets from sender in same power level and then it calculates the distance between two nodes by applying the radio propagation model in LPRA using adhoc network. Simulation results show that our proposed schemeperforms better in comparison to a popular existing technique
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Journals
Abstract One of the most complicated issues is to measuring the delay performance of end to end nodes in Multi-hop Wireless Networks. The two nodes are communicating via hopping over the multiple wireless links. The fact that is each node has to concentrate not only its own generated traffic, but also relayed one. Observing unfairness particularly for transmissions among nodes that are more than one hop Most of the existing works deals with the joint congestion control and scheduling algorithm, which does not focusing the delay performance. In turn, considering the throughput metric alone although for congestion control flows, throughput is the repeated difficult performance metric Packet delay is also important because practical congestion control protocols need to establish the timeouts for the retransmissions based on the packet delay, such parameters could significantly impact the speed of recovery when loss of packets occurred. The related issues on the delay-performance First, for long flows, the end to end delay may grow in terms of square with based on the number of hops. Second, it is difficult to control the end-to-end delay of each flows. TDMA schedules the transmissions in a fair way, in terms of throughput per connection, considering the communication requirements of the active flows of the network. It does not work properly in the multi-hop scenario, because it is generated only for single hop networks, We propose The Leaky Bucket Algorithm, in addition to joint congestion control and scheduling algorithm in multi-hop wireless networks. The proposed algorithm not only achieves the provable throughput and also considering the upper bounds of the delay of each flow. It reduces the transmission time by delivering packets at a constant bit rate even it receives the packet at a busty way. Keywords- Multi-hop wireless networks, congestion control, Performance, Delay, Flow, Throughput.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
TOPOLOGY DISCOVERY IN MULTI-HOP CLUSTERING VEHICULAR NETWORKScaijjournal
In this paper, we propose a novel multi-hop cluster architecture for location service protocol in vehicular ad
hoc networks. The proposed scheme uses two parameters which are the connectivity between vehicles and the
vehicle mobility to select cluster head. The performance of the proposed scheme is the tradeoff between the
vehicle locations and the communication overheads. The proposed scheme is not only scalable but also
reliable and is able to achieve high load balancing with fast convergence. The cluster constructed by the
proposed scheme is more stable than exiting vehicular ad hoc network clustering schemes. Specifically, the
proposed scheme can increase the cluster-head lifetime up to 50%. The reason behind this achievement is
that the proposed scheme considers vehicle mobility in terms of average link expiration time while selecting
cluster-head.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
Energy balanced improved leach routing protocol for wireless sensor networkscsandit
A proper sensor node clustering is an effective topology control that can balance energy
consumption among sensor nodes and increase network scalability and life time. As the use of
wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing
and data aggregation has also risen. LEACH
(
Low Energy Adaptive Cluster Hierarchy
)
is a
hierarchical clustering protocol that provides an elegant solution for such protocols. Random
clustering is the main deficiency of LEACH. In this paper an energy balanced clustering
approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized
clustering algorithm that based on minimum energy clustering to form optimal clusters. For the
candidate nodes, the location and the residual energy are used as key parameters to select the
cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms
of energy conservation and network life time prolonging.
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.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
VHFRP: Virtual Hexagonal Frame Routing Protocol for Wireless Sensor NetworkIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an indispensable technology. A mobile sink may be required for some applications in the sensor field, where incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual backbone network enables data collection from members of the frame and delivers it to the mobile sink. The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy consumption by 30% and delay by 9% as compared with static sink scenario.
VHFRP: VIRTUAL HEXAGONAL FRAME ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an
indispensable technology. A mobile sink may be required for some applications in the sensor field, where
incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and
packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend
network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a
virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual
backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual
backbone network enables data collection from members of the frame and delivers it to the mobile sink.
The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy
consumption by 30% and delay by 9% as compared with static sink scenario.
ECA MODEL BASED QOS AODV ROUTING FOR MANETSIJCNCJournal
Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by
nature. The QoS given to users will be affected by network delay, which can be mitigated by employing
QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding
technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the
entire application is essential, which understands the dynamic nature of the MANET and establishes the
required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA
model and AODV for establishing QoS route.
The simulation results shows that the ECA model gives better results, while considering the local
connectivity time, source to destination connectivity time, number of data packets successfully delivered to
the destination, local and global error correction time, compared to AODV.
Cross layer design for power control and linkIJCNCJournal
Frequent changes in network topology due to mobility and limited battery power of the mobile devices are the key challenges in the adhoc networks. The depletion of power source may cause early unavailability of nodes and thus links in the network. The mobility of nodes causes frequent routes breaks and adversely affects the required performance of the applications. We propose a cross layer design for the dynamic power control protocol and link prediction (DPCPLP) that provides a combined solution for power conservation as well as link availability. This combines the effect of optimum transmit power and received signal strength based link availability estimation with AODV routing protocol using cross layer approach.
This method proposes to use optimum transmit power for transmitting the packets to a neighboring node to
increase the battery life of adhoc nodes and received signal strength based link prediction to increase the
availability of the links. In this paper, the transmit power and received signal strength of the packets are
cross-layer interaction parameters to provide the combined solution for power conservation and reliable
route formation with increased availability of links and thus the routes amongst sources and destinations. Further, this increases network and nodes’ lifetime and capacity. It improves throughput and packet delivery ratio by spatial reuse, prior prediction of link breaks and initiating the route repair. It also reduces
end-to-end delay and power consumption by use of optimum transmit power. Through simulations, we have
shown that our proposed protocol shows better performance.
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.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
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.
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.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
Improved aodv based on energy strength and dropping ratioIJLT EMAS
Wireless Sensor Networks are the latest trends in the
market due to the demand for communication and networking
among the wireless network devices. The routing protocols are
used in the Wireless Sensor Networks for efficient
communication of data between sensor nodes. The designs of
routing protocols in Wireless Sensor Networks are very concern
because they are influenced by many challenging factors. To
design the networks, the factors needed to be considered are the
coverage area, mobility, energy power consumption,
communication capabilities etc.. Broadcasting is an inevitable
operation in the route discovery phase of AODV protocol. A
probability based AODV is proposed, it uses nodes remaining
energy and threshold random delay to generate the
rebroadcasting of route request packet. The route request packet
of AODV is modified to gather nodes remaining energy strength.
The performance of probability based AODV is compared with
AODV over packet delivery fraction, normalized routing
overhead, delay and average acquisition latency.
NS-2 based simulator is used to evaluate the performance of
routing protocol.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...IOSR Journals
The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue
domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links.
The objective of routing is to find optimum path which is used to transferring packets from source node to
destination node. Routing should generate feasible routes between nodes and send traffic along the selected path
and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path
routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest
adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to
sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and
enhance the life of the network
Similar to Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless Network (20)
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless Network
1. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.4, August 2013
DOI: 10.5121/ijci.2013.2404 27
Quadrant Based DIR in CWin Adaptation
Mechanism for Multihop Wireless Network
V.Karthikeyan1
, V.J.Vijayalakshmi2
, P.Jeyakumar3
1
Department of ECE, SVS College of Engineering, Coimbatore, India
Karthick77keyan@gmail.com
2
Department of EEE, Sri Krishna College of Engg & Tech., Coimbatore, India
Vijik810@gmail.com
3
Department of ECE Karpagam University, Coimbatore, India
Jeyak522@gmail.com
ABSTRACT
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of
contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the
nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless
channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM).
This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level.
So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as
a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and
also reduce the routing overheads, which eventually increases overall network throughput. This algorithm
limits the broadcast region to a quadrant where the source node and the destination nodes are located.
Implementation of the algorithm is done in Linux based NS-2 simulator.
Keywords
Multihop wireless network, CSMA/CA, Routing protocol, restricted flooding.
1. INTRODUCTION
Multihop wireless networks (MWN) are recently been used in a wide civilian use and military
applications. Main advantage is no need for pre-existing infrastructure. MWN consist of a number
of either stationary or mobile wireless stations, which serve as relays forwarding traffic from
other nodes and provide wide network connectivity. The main task is to maintain the network
throughput that depends on the achievable channel capacity at each link and power consumption
that depends on the type of routing metrics used in the network. In order to improve the end-to-
end throughput performance of IEEE 802.11 DCF, CWA mechanism [1] is used which adaptively
varies the size of the Contention Window (CW) depending on the traffic generated. The basic
access mechanism of the IEEE 802.11 DCF is carrier sense multiple access with collision
avoidance (CSMA/CA). The idea is to prevent collisions at the moment they are most likely to
occur, i.e. when the bus is released. All source nodes are forced to wait for a random number of
timeslots and then sense the medium again, before starting a transmission. If the medium is
sensed to be busy, the source node freezes its timer until it becomes free again. Thus, the chance
of two source node starting to send simultaneously is reduced. The main drawback of this
mechanism is that it utilizes the entire network and hence, power consumption is higher. So, to
fulfil the objective and to overcome the drawback, a cross layer between the network layer
routing protocol and the data link layer are done. That is restricted flooding algorithm called Q-
2. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.4, August 2013
28
DIR [2] is cross layered with the CWA mechanism. Various routing metrics usually used are
shortest path, link stability and minimum number of hops towards the destination. Routing
protocols can be categorized into topology-based [3] and position-based protocols [4]. In the
former, on-demand or proactive flooding of route request (RREQ) are broadcast at each node to
all neighbours to detect routes. In position-based protocol, routing is optimized by making use of
location information through beaconing available at each node.
Position-based protocols are further categorized into greedy forwarding and restricted flooding
[4]. In greedy forwarding [5], based on location information of the destination node, source node
will select the node with the best progress towards the destination. The location information of
the destination will then be inserted in their data packet and unicast to the selected node. Upon
receiving the data packet, the selected node will then select the best node among its neighbours
and the process continues until the data packet reaches the destination. As the name implies, in
restricted flooding, nodes that are located nearer to the destination or in a forwarding zone, will
broadcast the packet. Distance and forwarding zone information are computed at the respective
nodes to determine their progress towards destination. These nodes will then broadcast the packet
and the process is repeated at each intermediate node until it reaches the destination.
2. PROBLEM STATEMENT
The nodes in the MWN that are with different traffic forwarding capability contend with each
other which has the same CWmin value. The node with the largest forwarding capability may
utilize the wireless medium aggressively and eventually causes the decrease in the end-to-end
throughput of the multihop path. Thus, the algorithm needs to differentiate the channel access
probability of each node by adjusting the CW size depending on the traffic forwarding capability.
This implies that none of the relay nodes forwards excessive packets to its corresponding receiver.
In summary, by differentiating the contention window size at each node, all the other nodes
except the source are able to increase the traffic forwarding capability, which results in a
significant increase in the end-to-end throughput.
In order to improve the throughput of MWN the following issues must be considered:
(i) How to estimate the traffic forwarding capability at each node;
(ii) How to differentiate the contention window size depending on the traffic forwarding
capacity;
(iii) How to increase the end-to-end throughput by regulating the throughput of traffic relayed
at each hop in distributed and scalable manner.
As a result end-to-end throughput can be increased but CWA mechanism utilizes the entire
available network nodes to broadcast the data to the destination. CWAM uses greedy forwarding
technique, where the request is given to all the neighbouring nodes to establish the path.
Eventually this consumes more power. Since the network is a stand-alone device this operates on
batteries.
3. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.4, August 2013
29
Destination node
Source node
Fig. 1 Nodes participating in total flooding
Thus, for reducing the power consumption, the path in which the broadcast occurs must be
limited to a quadrant. Instead of utilizing all the nodes in the network, only the nodes in the
broadcast region have to involve in transmission. The mathematical computation of the
location information in the kernel environment will incur further processing delay in the
current node [6]. Hence, the delay needs to be reduced by inserting the location
information of the source node or the previous intermediate node in the data packet, and
so, periodic beaconing will be eliminated.
3. RELATED WORK
Related work falls into two broad categories: Tuning of back-off parameters and restricted
flooding.
3.1. Tuning of Back-off Parameters
In IEEE 802.11 DCF, the back-off parameters such as CWmin and CWmax are fixed. To analyse the
impact of the back-off parameters on network performance, Bianchi [8] derived a two
dimensional Markov chain model for the exponential backoff process. Using this model, it was
shown that the number of stations and the minimum CW size have significant impacts on the
overall performance of IEEE 802.11 DCF. Bianchi and Tinnirello [9] proposed how to estimate
the number of active stations using an extended Kalman filter in a WLAN. Tuning of the MAC
parameters can effectively improve the network performance when the number of active stations
is properly estimated. Cali [10] proposed a distributed algorithm called IEEE 802.11+, which
enables each node to estimate the number of contending nodes at any given time. They also
derived an analytical model which gives a theoretical maximum bound on the network capacity,
and tried to find the optimal CW value to achieve the theoretical throughput limit. Kwon [11]
proposed a Fast Collision Recovery (FCR) protocol, which is a contention-based protocol that
redistributes the back-off timer among all competing stations with an objective of reducing the
idle back-off time.
3.2. Restricted Flooding
Distance from the node to the destination is used to determine the nodes participation in the route
discovery process. Nodes that are further away from source will not participate. Relative
Neighbourhood Graph (RNG) [12], which together with local information of distance to
neighbours and distances between neighbours will minimize the total energy consumption.
4. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.4, August 2013
30
AODV protocol uses a reactive type of routing which utilizes maximum power at initial stage of
transmission. Location-based Geocasting and Forwarding (LGF) [13], calculates distances to all
nodes in the network and will compare the distance information of the source to the destination
extracted from the request packet to determine its participation. Angle Routing Protocol (ARP)
[14] uses the angle made from the straight line drawn from source to destination as the restricted
region whereby all nodes in this region will participate in the route discovery. However, DDB [15]
uses the location information of the destination node and also of the intermediate node which are
inserted in the request packet. With this additional information, an intermediate node can
calculate the estimated additional covered area that it would cover with its transmission which is
based on Dynamic Forwarding Delay (DFD). The concept of DFD is to determine when to
forward the packet and node with more area covered will be given a smaller delay to broadcast
and hence, will broadcast first. All the above protocols require computation of the distance and
angle at all intermediate nodes to determine the nodes that are located in the forwarding region.
4. CROSS LAYER FRAMEWORK
A cross layer is made between the data link layer and the network layer of the OSI model to
improve the performance of IEEE 802.11 DCF.
4.1.CWA Algorithm
In the CWA mechanism, the traffic forwarding capability αi is defined as the ratio of the rate of
incoming and outgoing traffic at a node :
Traffic forwarding capability ratio:
αi = iout
/iin (1)
)
where, iout
- outgoing traffic at a node i
iin
- incoming traffic at a node i
If a node can forward all the received packets to its neighbouring node without packet loss, then
αi is equal to one. On the other hand, if node receives a large number of packets but cannot
forward them at the same rate as it receives, and then αi is less than one. If node has the smallest
forwarding capability αi among the nodes on the multihop path, it may be a bottleneck relay node
of the path.
Contention window adaptation algorithm has the following step which is implemented across
the network.
Algorithm 1:
1: InPkts: the number of all the incoming packets at
particular time ( )
2: DstPkts: the number of outgoing packets whose
destination is itself.
3: iin
= InPkts – DstPkts
4: OutPkts: the number of all the outgoing packets for
5: SrcPkts: the number of incoming packets whose source
is itself.
5. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.4, August 2013
31
6: iout
= OutPkts - SrcPkts
7: if i out
> iin
then, iout
← iin
8: CWmin ←CWmin + . (iout
– .iin
)
9: if CWmin > maxth then, CWmin ← maxth
10: else if CWmin < minth then, CWmin ← minth
Fig. 2 Steps in CWA Algorithm
Fig. 2 gives the steps involved in the CWA mechanism. Here, ‘inpkts’ denotes the incoming data
packets, ‘dstpkts’ denotes packets at the destination, and ‘outpkts denotes the outgoing data
packets and ‘srcpkts ’denotes the packets at the source. On the line 7 in Algorithm 1, an upper
bound is placed on the rate of outgoing traffic. Even though there are no incoming packets, the
packets accumulated in the buffer can be transmitted. For a short time interval, the outgoing rate
could be higher than the incoming rate depending on the buffer size, and it may lead to a false
decision in updating CWmin in line 8. This is the reason that we limit the rate estimate of
outgoing traffic up to that of incoming traffic.
Third, if the traffic load is sufficiently low and does not incur any packet loss, CWmin has the
tendency to be large with the use of the adaptation rule. For simulations and experiment, minth
and maxth of CWmin are set to 1 and 32, respectively. We set maxth of CWmin to 32 and set minth of
CWmin to 1.
4.2. Q-DIR algorithm
Q-DIR is a restricted routing protocol that concentrates on a specified zone using location
information provided by a location service as in fig. 3. In Q-DIR operation, the location
information of the source and destination nodes is piggy-backed in the route request (RREQ)
packet and then broadcasted.
Destination node
Source node
Fig. 3 Less participating nodes in Q-DIR algorithm
6. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.4, August 2013
32
Upon receiving the RREQ, intermediate nodes will compare using a simple mathematical
comparison based on the coordinates of source, destination and the current node that directs the
packet towards the destination as in Fig.4. This mathematical processing is done in the kernel
environment to reduce the routing overhead.
Algorithm 2:
1: Divide the network area into four quadrants with
source as origin
2: Quadrant of intermediate node compared to source
node.
3: Quadrant of destination node compared to source
node.
4: If they lie in same quadrant, then forward the data
packets. Else drop the packets.
Fig. 4 Steps in Q-DIR algorithm
The decision to participate is in reactive manner. Once the decision to broadcast has been made,
the intermediate node will insert its location by replacing the source node coordinates and append
its address and sequence number at the end of the RREQ packet. It will then broadcast the packet.
The process will be repeated at each intermediate node until it reaches the destination. The
replacement of the source node location information with the intermediate node coordinates will
make the packet more directed towards the destination since the comparison now is based on the
previous node. Upon receiving the RREQ, destination node will send a route reply message
(RREP) back to source via the path taken to reach the destination that was appended in the RREQ
as it traverses across the network. There is no need for the route discovery to the source node.
4.3. Cross Layer Design
The network has the wide spread of nodes, where there may be many source nodes and
destination nodes involved in data transmission. This transmission is done via various
intermediate nodes. First step is to divide the broadcast region into four quadrants by keeping
source as the origin. Secondly, location of the destination in noted and broadcast region is limited
to that particular quadrant and is achieved using Q-DIR algorithm. Only the intermediate nodes in
that quadrant will be selected according to the algorithm 2 and remaining nodes will be rejected.
Similarly for all the source nodes same procedure is done. Third step is to apply CWA
mechanism to each of the nodes involved in broadcasting of data packets. This adaptively varies
the CW size depending on the incoming traffic. CWA mechanism is implemented in all the
forwarding nodes to avoid collision and packet drop.
The general procedure involved in the cross layer design between Q-DIR and CWA is listed in
the fig. 5.
7. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.4, August 2013
33
1: Place the nodes in a grid topology
2: Identify the source and destination node
3: With source as origin, divide the network into four
quadrant
4: Select the quadrant in which the destination node is
present
5: Apply the Algorithm 2 to the selected quadrant
6: After estimating broadcast route, apply Algorithm 1
to each forwarding node.
Fig. 5 Cross Layer Design Procedure
Fig. 6 Cross Layer Framework
Q-DIR in network layer is used for routing which reduces the delay while transmission and CWA
mechanism in data link layer is used to adaptively vary the CW size and so it achieves a
maximum throughput. As shown in Fig.6, a cross layer between CWA mechanism of Data link
layer and Q-DIR of Network layer is implemented to enhance performance of IEEE 802.11 DCF.
5. SIMULATION RESULTS
Simulation of Q-DIR with CWAM is done in Network Simulator-2 (ns-2). Comparison is done
between the total flooding protocol (AODV) and restricted flooding protocol (Q-DIR with
CWAM). A network model of 49 nodes that forms a 7 by 7 grid model where the distance from
adjacent nodes are 30m. Based on this grid model, the density is 1 node per 661m2
and the data
rate is 2 Mbps. Simulation configuration parameters are given in the table I.
NETWORK LAYER
(Q-DIR)
DATA LINK LAYER
(CWAM)
PHYSICAL LAYER
8. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.4, August 2013
34
TABLE I SIMULATION CONFIGURATION PARAMETERS
Configuration Parameters Value
Max. No. Of hops between two nodes 10
Average one hop traversal time 60 ms
Route discovery time 5000 ms
Route delete time 25000 ms
Number of RREQ tries 3
Total traversal time 1200 ms
Various performance comparisons are made between the normal operation of the network under
normal AODV and the operation using the newly proposed algorithm that is cross layer of Q-DIR
with CWA mechanism.
Fig.7 Aggregate Throughput comparison
Aggregate throughput comparison is done between AODV and QDIR-CWA. In fig. 7, the
throughput achieved by QDIR-CWA is higher compared to the AODV. This is because CWA
mechanism adaptively adjusts the CW size depending on each node’s incoming traffic.
Fig. 8 Delay comparison
In the figure 8, delay obtained using QDIR-CWA mechanism is lower than that is obtained from
normal AODV. The reason is that QDIR eliminates the periodic beaconing and hence reduces the
routing overheads while transmission. So, delay is reduced in QDIR-CWA mechanism.
9. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.4, August 2013
35
Fig. 9 Packet Delivery Ratio
In the fig. 9, CWA mechanism achieves a higher delivery ratio because this algorithm aims to
avoid collision and packet drop. Hence, the data packets from the source are properly delivered to
the destination and achieve a higher packet delivery ratio than AODV.
Fig. 10 Energy Consumption comparison
In fig. 10, energy consumed by network using AODV protocol is higher than the energy
consumed by the network using QDIR-CWA. Since, QDIR-CWA restricts the broadcast region to
a particular zone; usage of energy by the remaining area is avoided. Hence, QDIR-CWA
consumes less energy which results in less power consumption.
Fig. 11 Routing Overhead comparison
10. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.4, August 2013
36
Fig. 11 shows that AODV exhibits more routing overheads because of the reason that it is a
reactive type of routing. The request to the nodes in the network is given in prior to transmission.
QDIR-CWA has a simple route calculation and the elimination of the periodic beaconing reduces
the routing overhead. Thus, from all the above factors it is known that QDIR-CWA mechanism
achieves better performance compared to AODV.
6. CONCLUSION
The Cross layer between the Q-DIR algorithm and CWA mechanism increases the overall
network performance. Q-DIR algorithm uses the location information of the source, destination
and the intermediate node to select the broadcast region. Nodes in the particular broadcast region
only will broadcast while other nodes will ignore the RREQ packet. CWA mechanism is applied
to each of the nodes in the broadcast region. CWA mechanism reduces the packet drop due to
collision, which improves the throughput and Q-DIR reduces the mathematical computation
complexity by eliminating the periodic beaconing. This achieves reduced delay and reduced
overhead. As a result, the overall network end-to-end throughput is achieved using CWAM
whereas reduced routing overheads and reduced power consumption is achieved using Q-DIR.
Therefore, the cross layer of Q-DIR and CWAM provides an increased network performance.
REFERENCES
[1] Daewon Jung, Jaeseon Hwang, Hyuk Lim, Kyung-Joon Park, and Jennifer C.Hou, “Adaptive
Contention Control for Improving End-to-End Throughput Performance of Multihop Wireless
Networks”, IEEE Trans. on wireless comm. VOL 9, NO.2, Feb 2010.
[2] L.A.Latiff, A.Ali, N.Fisal “Power Reduction Quadrant based Directional Routing protocol (Q-DIR) in
mobile Ad-Hoc network”, IEEE International Conf. on Telecomm. and Malaysia International Conf.
on Comm., 2007.
[3] E.M Royer and C.K.Toh. “A Review of Current Routing Protocol for Ad-Hoc Mobile Wireless
Networks” IEEE Personal Comm. pp. 46-55.April 1999.
[4] Stojmenovic, I. “Position-based Routing in Ad Hoc Networks” IEEE Comm Magazine. July
2002.40(7). 128-134.
[5] Oh, H., Bahn, H. and Chae, K-J. “An EnergyEfficient Sensor Routing Scheme for Home Automation
Networks”. IEEE Trans. on Consumer Electronics, Vol.31 (3). August 2005.
[6] Chakeres, I. D. and Royer, E.M. “AODV Routing Protocol Implementation Design” Proc.of 24th
WWAN 2004. 23-24 March 2004. Tokyo. 2004. 698-703.
[7] Bianchi.G, “Performance analysis of the IEEE 802.11 distributed coordination function," IEEE J. Sel.
Areas Comm. (JSAC) 2003.
[8] G. Bianchi and I. Tinnirello, “Kalman filter estimation of the number of competing terminals in an
IEEE 802.11 network," in Proc. IEEE INFOCOM, 2003.
[9] Cali.F, Conti.M and Gregori.E, “Dynamic tuning of the IEEE the 802.11 protocol to achieve a
theoretical throughput limit," AIEEE/ACM Trans. Netw 2000.
[10] Fanf.Y, Kwon.Y and Latchman.H “A novel MAC protocol with fast collision resolution for wireless
LANs," in Proc. IEEE INFOCOM 2003.
[11] Cartigny, J., Simplot, D. and Stojemenovic, I. “Localized minimum-energy broadcasting in ad hoc
networks” INFOCOM 2003. pp. 2210 – 2217.
[12] A.Ali, L.A.Latiff, Chia-Ching Ooi, and N.Fisal, “Location-based Geocasting and Forwarding (LGF)
Strategy in MANET” ICT 2005, Cape Town, South Africa, May 2005.
[13] Kumar Banka, R. and Xue, G. “Angle routing protocol: location aided routing for mobile ad-hoc
networks using dynamic angle selection” MILCOM 2002 Proc. 7-10 Oct 2002. 1:501-506.
[14] Heissenbuttel, M., Braun, T., Walchli, M. and Bernoulli, T. “Broadcasting in Wireless Multihop
Network with Dynamic Forwarding Delay Concept” Technical Report IAM-04-010. Institute of
Computer Science and Applied Maths. University of Berne, 2004.
11. International Journal on Cybernetics & Informatics ( IJCI) Vol.2, No.4, August 2013
37
Authors
Prof.V.Karthikeyan has received his Bachelor’s Degree in Electronics and
Communication Engineering from PGP college of Engineering and Technology in 2003,
Namakkal, India, He received Masters Degree in Applied Electronics from KSR college
of Technology, Erode in 2006 He is currently working as Assistant Professor in SVS
College of Engineering and Technology, Coimbatore. She has about 8 years of Teaching
Experience
Prof.V.J.Vijayalakshmi has completed her Bachelor’s Degree in Electrical & Electronics
Engineering from Sri Ramakrishna Engineering College, Coimbatore, India. She
finished her Masters Degree in Power Systems Engineering from Anna University of
Technology, Coimbatore, She is currently working as Assistant Professor in Sri Krishna
College of Engineering and Technology, Coimbatore she has about 5 years of teaching
Experience.
Mr P.Jeyakumar Currently pursuing his Bachelor’s Degree in Electronics Engineering in
Karpagam University, Coimbatore, Tamil Nadu, India.