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.
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.
MMINIMUM RESOURCE CONSUMPTIONS ROUTING FOR OPTICAL NETWORKSprj_publication
The problem of determining primary and backup paths for survivable optical WDM
networks is considered. Results of various available routing techniques that try to minimize
the combined cost of primary and the backup path are analyzed for the effects on network
parameters such as mean load, variance of the load on route, number of converters required
by the route and the length of the route. The route cost is modelled such a way that it is
extensible to include any new parameter and vary their relative importance. The efficiency of
such wavelength routed networks has been proved to improve for certain parameters, such as
reduction in blocking probability and number of converters required for desired performance.
The routing is enhanced to analyse effect on network parameters for all node full range
converters, limited number full converters, reserved primary and back up wavelengths and
with no such reservation.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
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
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
Reducing Packet Transmission Delay in Vehicular Ad Hoc Networks using Edge No...CSCJournals
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a greedy position based routing approach to forward packets to the node present in the edge of the limited transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that end to end delay in packet transmission is minimized considerably compared to current routing protocols of VANET.
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.
MMINIMUM RESOURCE CONSUMPTIONS ROUTING FOR OPTICAL NETWORKSprj_publication
The problem of determining primary and backup paths for survivable optical WDM
networks is considered. Results of various available routing techniques that try to minimize
the combined cost of primary and the backup path are analyzed for the effects on network
parameters such as mean load, variance of the load on route, number of converters required
by the route and the length of the route. The route cost is modelled such a way that it is
extensible to include any new parameter and vary their relative importance. The efficiency of
such wavelength routed networks has been proved to improve for certain parameters, such as
reduction in blocking probability and number of converters required for desired performance.
The routing is enhanced to analyse effect on network parameters for all node full range
converters, limited number full converters, reserved primary and back up wavelengths and
with no such reservation.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
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
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
Reducing Packet Transmission Delay in Vehicular Ad Hoc Networks using Edge No...CSCJournals
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a greedy position based routing approach to forward packets to the node present in the edge of the limited transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that end to end delay in packet transmission is minimized considerably compared to current routing protocols of VANET.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
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.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Improved Good put using Harvest-Then-Transmit Protocol for Video TransferEswar Publications
In multiple wireless networks, large end-to-end delay and packet losses can decrease meaningfully the traffic flow goodput due to path irregularity and multiplicity. To report these problems, current methods are proposed by using management of queue and decision making process. Hence, this paper proposesa Harvest-Then-Transmit (HTT) Protocol which selects an energy efficient path based on multiple parameters i.e. energy, delay, transmission time and perform transmission of video to handle number of video packets. A multipath environment is establishing where a server performs transferring of video along the energy efficient path of wireless network. Simulation shows the proposed protocol improves the overall goodput up to 10%, increases packet delivery rate up to 12%, and reduces end-to-end delay up to 3%, compared to existing system.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
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.
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.
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
Survey: Multipath routing for Wireless Sensor NetworkEditor IJMTER
Reliability is playing very vital role in some application of Wireless Sensor Networks
and multipath routing is one of the ways to increase the probability of reliability. More over energy
consumption is constraint. In this paper, we provide a survey of the state-of-the-art of proposed
multipath routing algorithm for Wireless Sensor Networks. We study the design, analyze the tradeoff
of each design, and overview several presenting algorithms.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
In most efficient clustering technique for WSN has been proved as a congestion control and hierarchical
based cluster head selection process. The cluster head reduces the energy wastage and additionally that improves
the receiving of data and collection of data from their member sensor nodes. Also transmitting the collected data
to the base station (BS). In proposed method hybrid cluster based congestion aware (HCBCA) is mostly focused
on traffic that affects the continuous flow of data, Arrival of data from the source to destination delay time,
Avoid packet losses and energy consumption process. Mainly congestion happens in the intra cluster to do the
process of transmitting the destination of packets in many to one manner form sensor node to CH. The main
reason for occurrence of congestion is communication path, nodes energy level and nodes buffer size. When
these above it are successful done the congestion, does not exist or otherwise congestion will occur. The purpose
of WSN congestion control is to improve the packet delivery ratio and energy consumption.
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied protocols.
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSijwmn
Wireless sensor networks are useful for streaming multimedia in infrastructure-free and hazardous environments. However, these networks are quite different from their wired counterpart and are composed of nodes with constrained bandwidth and energy. Multiple-path transmission is one of the methods for ensuring QoS routing in both wired and wireless environment. Directed diffusion, a well known wireless sensor network protocol, only routes packets through a single path, which barely meets the throughput requirement of multimedia data. Instead, we propose a multipath algorithm based on directed diffusion that reinforces multiple routes with high link quality and low latency. This algorithm retains the merits of the original directed diffusion algorithms, including its energy efficiency and scalability. A hybrid metric of link quality and latency is used as the criterion for path selection. In order to select disjoint paths, we propose a scheme for reinforced nodes to respond negatively to multiple reinforcement messages. We use the NS-2 simulation tool with video trace generated by Multiple Description Coding (MDC) to evaluate the performance. The results show that our algorithm gives better throughput and delay performance, i.e higher video quality, than standard directed diffusion that transmits over a single path, with low overheads and energy consumption.
PERFORMANCES OF AD HOC NETWORKS UNDER DETERMINISTIC AND PROBABILISTIC CHANNEL...IJCNCJournal
Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the
performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the
literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energ...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
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.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Improved Good put using Harvest-Then-Transmit Protocol for Video TransferEswar Publications
In multiple wireless networks, large end-to-end delay and packet losses can decrease meaningfully the traffic flow goodput due to path irregularity and multiplicity. To report these problems, current methods are proposed by using management of queue and decision making process. Hence, this paper proposesa Harvest-Then-Transmit (HTT) Protocol which selects an energy efficient path based on multiple parameters i.e. energy, delay, transmission time and perform transmission of video to handle number of video packets. A multipath environment is establishing where a server performs transferring of video along the energy efficient path of wireless network. Simulation shows the proposed protocol improves the overall goodput up to 10%, increases packet delivery rate up to 12%, and reduces end-to-end delay up to 3%, compared to existing system.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
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.
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.
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
Survey: Multipath routing for Wireless Sensor NetworkEditor IJMTER
Reliability is playing very vital role in some application of Wireless Sensor Networks
and multipath routing is one of the ways to increase the probability of reliability. More over energy
consumption is constraint. In this paper, we provide a survey of the state-of-the-art of proposed
multipath routing algorithm for Wireless Sensor Networks. We study the design, analyze the tradeoff
of each design, and overview several presenting algorithms.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
In most efficient clustering technique for WSN has been proved as a congestion control and hierarchical
based cluster head selection process. The cluster head reduces the energy wastage and additionally that improves
the receiving of data and collection of data from their member sensor nodes. Also transmitting the collected data
to the base station (BS). In proposed method hybrid cluster based congestion aware (HCBCA) is mostly focused
on traffic that affects the continuous flow of data, Arrival of data from the source to destination delay time,
Avoid packet losses and energy consumption process. Mainly congestion happens in the intra cluster to do the
process of transmitting the destination of packets in many to one manner form sensor node to CH. The main
reason for occurrence of congestion is communication path, nodes energy level and nodes buffer size. When
these above it are successful done the congestion, does not exist or otherwise congestion will occur. The purpose
of WSN congestion control is to improve the packet delivery ratio and energy consumption.
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied protocols.
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSijwmn
Wireless sensor networks are useful for streaming multimedia in infrastructure-free and hazardous environments. However, these networks are quite different from their wired counterpart and are composed of nodes with constrained bandwidth and energy. Multiple-path transmission is one of the methods for ensuring QoS routing in both wired and wireless environment. Directed diffusion, a well known wireless sensor network protocol, only routes packets through a single path, which barely meets the throughput requirement of multimedia data. Instead, we propose a multipath algorithm based on directed diffusion that reinforces multiple routes with high link quality and low latency. This algorithm retains the merits of the original directed diffusion algorithms, including its energy efficiency and scalability. A hybrid metric of link quality and latency is used as the criterion for path selection. In order to select disjoint paths, we propose a scheme for reinforced nodes to respond negatively to multiple reinforcement messages. We use the NS-2 simulation tool with video trace generated by Multiple Description Coding (MDC) to evaluate the performance. The results show that our algorithm gives better throughput and delay performance, i.e higher video quality, than standard directed diffusion that transmits over a single path, with low overheads and energy consumption.
PERFORMANCES OF AD HOC NETWORKS UNDER DETERMINISTIC AND PROBABILISTIC CHANNEL...IJCNCJournal
Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the
performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the
literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energ...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
QUALITY OF SERVICE ROUTING IN MOBILE AD HOC NETWORKS USING LOCATION AND ENERG...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multi path protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
Abstract : As the network size increases the probability of congestion occurrence at nodes increases. This is because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses. In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing (IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput and packet delivery fraction. Keywords- DSDV, Hybrid protocol, AODV, IAODV, MANET
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
Grid Based Priority Routing Protocol for UWSNsIJCNCJournal
In this paper, we devise and evaluate a new Grid-Based Priority Routing (GBPR) protocol for Underwater Wireless Sensor Networks (UWSNs). GBPR utilizes a 3D logical grid view of the monitored area to deliver
data packets to sink nodes. Particularly, data packets are forwarded on a cell-by-cell-basis using elected sensor nodes called cell-heads. The unique feature in GBPR is the lassification of the neighboring cells in
different priority levels according to their distances to the sink node. Cells closer to the sink are given higher priority to be selected as the next hop. This mechanism helps in reducing the number of hops; thus, reducing the energy consumption and end-to-end delay, and increasing the reliability. The protocol is
evaluated and compared against EMGGR and EEF protocols available in the literature. Simulation results show that GBPR outperforms the other two protocols in terms of energy efficiency, average delay and packet delivery ratio.
GRID-BASED PRIORITY ROUTING PROTOCOL FOR UWSNSIJCNCJournal
In this paper, we devise and evaluate a new Grid-Based Priority Routing (GBPR) protocol for Underwater Wireless Sensor Networks (UWSNs). GBPR utilizes a 3D logical grid view of the monitored area to deliver data packets to sink nodes. Particularly, data packets are forwarded on a cell-by-cell-basis using elected
sensor nodes called cell-heads. The unique feature in GBPR is the classification of the neighboring cells in different priority levels according to their distances to the sink node. Cells closer to the sink are given higher priority to be selected as the next hop. This mechanism helps in reducing the number of hops; thus, reducing the energy consumption and end-to-end delay, and increasing the reliability. The protocol is evaluated and compared against EMGGR and EEF protocols available in the literature. Simulation results show that GBPR outperforms the other two protocols in terms of energy efficiency, average 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.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
Similar to ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR NETWORKS (20)
In the era of data-driven warfare, the integration of big data and machine learning (ML) techniques has
become paramount for enhancing defence capabilities. This research report delves into the applications of
big data and ML in the defence sector, exploring their potential to revolutionize intelligence gathering,
strategic decision-making, and operational efficiency. By leveraging vast amounts of data and advanced
algorithms, these technologies offer unprecedented opportunities for threat detection, predictive analysis,
and optimized resource allocation. However, their adoption also raises critical concerns regarding data
privacy, ethical implications, and the potential for misuse. This report aims to provide a comprehensive
understanding of the current state of big data and ML in defence, while examining the challenges and
ethical considerations that must be addressed to ensure responsible and effective implementation.
Cloud Computing, being one of the most recent innovative developments of the IT world, has been
instrumental not just to the success of SMEs but, through their productivity and innovative contribution to
the economy, has even made a remarkable contribution to the economic growth of the United States. To
this end, the study focuses on how cloud computing technology has impacted economic growth through
SMEs in the United States. Relevant literature connected to the variables of interest in this study was
reviewed, and secondary data was generated and utilized in the analysis section of this paper. The findings
of this paper revealed that there have been meaningful contributions that the usage of virtualization has
made in the commercial dealings of small firms in the United States, and this has also been reflected in the
economic growth of the country. This paper further revealed that as important as cloud-based software is,
some SMEs are still skeptical about how it can help improve their business and increase their bottom line
and hence have failed to adopt it. Apart from the SMEs, some notable large firms in different industries,
including information and educational services, have adopted cloud computing technology and hence
contributed to the economic growth of the United States. Lastly, findings from our inferential statistics
revealed that no discernible change has occurred in innovation between small and big businesses in the
adoption of cloud computing. Both categories of businesses adopt cloud computing in the same way, and
their contribution to the American economy has no significant difference in the usage of virtualization.
Energy-constrained Wireless Sensor Networks (WSNs) have garnered significant research interest in
recent years. Multiple-Input Multiple-Output (MIMO), or Cooperative MIMO, represents a specialized
application of MIMO technology within WSNs. This approach operates effectively, especially in
challenging and resource-constrained environments. By facilitating collaboration among sensor nodes,
Cooperative MIMO enhances reliability, coverage, and energy efficiency in WSN deployments.
Consequently, MIMO finds application in diverse WSN scenarios, spanning environmental monitoring,
industrial automation, and healthcare applications.
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication. IJCSIT publishes original research papers and review papers, as well as auxiliary material such as: research papers, case studies, technical reports etc.
With growing, Car parking increases with the number of car users. With the increased use of smartphones
and their applications, users prefer mobile phone-based solutions. This paper proposes the Smart Parking
Management System (SPMS) that depends on Arduino parts, Android applications, and based on IoT. This
gave the client the ability to check available parking spaces and reserve a parking spot. IR sensors are
utilized to know if a car park space is allowed. Its area data are transmitted using the WI-FI module to the
server and are recovered by the mobile application which offers many options attractively and with no cost
to users and lets the user check reservation details. With IoT technology, the smart parking system can be
connected wirelessly to easily track available locations.
Welcome to AIRCC's International Journal of Computer Science and Information Technology (IJCSIT), your gateway to the latest advancements in the dynamic fields of Computer Science and Information Systems.
Computer-Assisted Language Learning (CALL) are computer-based tutoring systems that deal with
linguistic skills. Adding intelligence in such systems is mainly based on using Natural Language
Processing (NLP) tools to diagnose student errors, especially in language grammar. However, most such
systems do not consider the modeling of student competence in linguistic skills, especially for the Arabic
language. In this paper, we will deal with basic grammar concepts of the Arabic language taught for the
fourth grade of the elementary school in Egypt. This is through Arabic Grammar Trainer (AGTrainer)
which is an Intelligent CALL. The implemented system (AGTrainer) trains the students through different
questions that deal with the different concepts and have different difficulty levels. Constraint-based student
modeling (CBSM) technique is used as a short-term student model. CBSM is used to define in small grain
level the different grammar skills through the defined skill structures. The main contribution of this paper
is the hierarchal representation of the system's basic grammar skills as domain knowledge. That
representation is used as a mechanism for efficiently checking constraints to model the student knowledge
and diagnose the student errors and identify their cause. In addition, satisfying constraints and the number
of trails the student takes for answering each question and fuzzy logic decision system are used to
determine the student learning level for each lesson as a long-term model. The results of the evaluation
showed the system's effectiveness in learning in addition to the satisfaction of students and teachers with its
features and abilities.
In the realm of computer security, the importance of efficient and reliable user authentication methods has
become increasingly critical. This paper examines the potential of mouse movement dynamics as a
consistent metric for continuous authentication. By analysing user mouse movement patterns in two
contrasting gaming scenarios, "Team Fortress" and "Poly Bridge," we investigate the distinctive
behavioral patterns inherent in high-intensity and low-intensity UI interactions. The study extends beyond
conventional methodologies by employing a range of machine learning models. These models are carefully
selected to assess their effectiveness in capturing and interpreting the subtleties of user behavior as
reflected in their mouse movements. This multifaceted approach allows for a more nuanced and
comprehensive understanding of user interaction patterns. Our findings reveal that mouse movement
dynamics can serve as a reliable indicator for continuous user authentication. The diverse machine
learning models employed in this study demonstrate competent performance in user verification, marking
an improvement over previous methods used in this field. This research contributes to the ongoing efforts to
enhance computer security and highlights the potential of leveraging user behavior, specifically mouse
dynamics, in developing robust authentication systems.
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication.
Image segmentation and classification tasks in computer vision have proven to be highly effective using neural networks, specifically Convolutional Neural Networks (CNNs). These tasks have numerous
practical applications, such as in medical imaging, autonomous driving, and surveillance. CNNs are capable
of learning complex features directly from images and achieving outstanding performance across several
datasets. In this work, we have utilized three different datasets to investigate the efficacy of various preprocessing and classification techniques in accurssedately segmenting and classifying different structures
within the MRI and natural images. We have utilized both sample gradient and Canny Edge Detection
methods for pre-processing, and K-means clustering have been applied to segment the images. Image
augmentation improves the size and diversity of datasets for training the models for image classification
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication.
This research aims to further understanding in the field of continuous authentication using behavioural
biometrics. We are contributing a novel dataset that encompasses the gesture data of 15 users playing
Minecraft with a Samsung Tablet, each for a duration of 15 minutes. Utilizing this dataset, we employed
machine learning (ML) binary classifiers, being Random Forest (RF), K-Nearest Neighbors (KNN), and
Support Vector Classifier (SVC), to determine the authenticity of specific user actions. Our most robust
model was SVC, which achieved an average accuracy of approximately 90%, demonstrating that touch
dynamics can effectively distinguish users. However, further studies are needed to make it viable option
for authentication systems. You can access our dataset at the following
link:https://github.com/AuthenTech2023/authentech-repo
This paper discusses the capabilities and limitations of GPT-3 (0), a state-of-the-art language model, in the
context of text understanding. We begin by describing the architecture and training process of GPT-3, and
provide an overview of its impressive performance across a wide range of natural language processing
tasks, such as language translation, question-answering, and text completion. Throughout this research
project, a summarizing tool was also created to help us retrieve content from any types of document,
specifically IELTS (0) Reading Test data in this project. We also aimed to improve the accuracy of the
summarizing, as well as question-answering capabilities of GPT-3 (0) via long text
In the realm of computer security, the importance of efficient and reliable user authentication methods has
become increasingly critical. This paper examines the potential of mouse movement dynamics as a
consistent metric for continuous authentication. By analysing user mouse movement patterns in two
contrasting gaming scenarios, "Team Fortress" and "Poly Bridge," we investigate the distinctive
behavioral patterns inherent in high-intensity and low-intensity UI interactions. The study extends beyond
conventional methodologies by employing a range of machine learning models. These models are carefully
selected to assess their effectiveness in capturing and interpreting the subtleties of user behavior as
reflected in their mouse movements. This multifaceted approach allows for a more nuanced and
comprehensive understanding of user interaction patterns. Our findings reveal that mouse movement
dynamics can serve as a reliable indicator for continuous user authentication. The diverse machine
learning models employed in this study demonstrate competent performance in user verification, marking
an improvement over previous methods used in this field. This research contributes to the ongoing efforts to
enhance computer security and highlights the potential of leveraging user behavior, specifically mouse
dynamics, in developing robust authentication systems.
Image segmentation and classification tasks in computer vision have proven to be highly effective using neural networks, specifically Convolutional Neural Networks (CNNs). These tasks have numerous
practical applications, such as in medical imaging, autonomous driving, and surveillance. CNNs are capable
of learning complex features directly from images and achieving outstanding performance across several
datasets. In this work, we have utilized three different datasets to investigate the efficacy of various preprocessing and classification techniques in accurssedately segmenting and classifying different structures
within the MRI and natural images. We have utilized both sample gradient and Canny Edge Detection
methods for pre-processing, and K-means clustering have been applied to segment the images. Image
augmentation improves the size and diversity of datasets for training the models for image classification.
This work highlights transfer learning’s effectiveness in image classification using CNNs and VGG 16 that
provides insights into the selection of pre-trained models and hyper parameters for optimal performance.
We have proposed a comprehensive approach for image segmentation and classification, incorporating preprocessing techniques, the K-means algorithm for segmentation, and employing deep learning models such
as CNN and VGG 16 for classification.
The security of Electric Vehicle (EV) charging has gained momentum after the increase in the EV adoption
in the past few years. Mobile applications have been integrated into EV charging systems that mainly use a
cloud-based platform to host their services and data. Like many complex systems, cloud systems are
susceptible to cyberattacks if proper measures are not taken by the organization to secure them. In this
paper, we explore the security of key components in the EV charging infrastructure, including the mobile
application and its cloud service. We conducted an experiment that initiated a Man in the Middle attack
between an EV app and its cloud services. Our results showed that it is possible to launch attacks against
the connected infrastructure by taking advantage of vulnerabilities that may have substantial economic and
operational ramifications on the EV charging ecosystem. We conclude by providing mitigation suggestions
and future research directions.
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication.
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication.
This paper describes the outcome of an attempt to implement the same transitive closure (TC) algorithm
for Apache MapReduce running on different Apache Hadoop distributions. Apache MapReduce is a
software framework used with Apache Hadoop, which has become the de facto standard platform for
processing and storing large amounts of data in a distributed computing environment. The research
presented here focuses on the variations observed among the results of an efficient iterative transitive
closure algorithm when run against different distributed environments. The results from these comparisons
were validated against the benchmark results from OYSTER, an open source Entity Resolution system. The
experiment results highlighted the inconsistencies that can occur when using the same codebase with
different implementations of Map Reduce.
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR NETWORKS
1. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
DOI:10.5121/ijcsit.2017.9608 77
ENERGY LOCATION AWARE ROUTING PROTOCOL
(ELARP) FOR WIRELESS MULTIMEDIA SENSOR
NETWORKS
Ablah AlAmri1
and Manal Abdullah2
1
Department of Computer & Information Technology, King Abdulaziz University KAU,
Jeddah, Saudi Arabia.
2
Department of Computer Science, King Abdulaziz University KAU, Jeddah,
Saudi Arabia.
ABSTRACT
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.
KEYWORDS
Multipath Routing Protocol, Quality of Service, Wireless Multimedia Sensor Networks, Wireless Sensor
Networks
1. INTRODUCTION
Wireless Multimedia Sensor Networks (WMSNs) are new networks type that have audio or video
sensor nodes integrated with cheap components such as CMOS cameras and microphones. These
sensor nodes have ability to sense the surrounding environment, capture and transmit multimedia
data such as video, audio and even image to the sink[1].
WMSNs have many challenges due to: transmission multimedia data which is large in volume
and required quality of service (QoS) in terms of increasing throughput, and delivery speed of
multimedia data packets to the destination. Because multimedia data packet is very sensitive to
the delay and losses, losing these packets or arriving after deadline leads to distortion in received
multimedia data. Other challenges include: transmit the data wirelessly, and limitations of sensor
nodes capability, limitation on power, memory and capability of the processor[2].
Multipath routing is to discover multipath during route discovery from source node to the sink.
Discover multipath and sending data via these different paths improve the bandwidth and
decrease the end to end delay [3]. Multipath routing also provides different advantages such as
balancing the traffic by dividing the traffic across alternative paths in case of use all paths
simultaneously, thus balance the energy between nodes, increase the lifetime of the network and
2. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
78
avoid congestion [4]. Also, multipath routing increases the reliability by protecting from route
failure when uses another path if the main path is fail[5].
This paper contributes with an Energy Location Aware Routing Protocol (ELARP) which is
reactive multipath routing protocol, establishes three paths from source to the sink with a
consideration of node’s remaining energy and distance to the sink.
In WMSNs, considering energy and location of next node during establishing the path is
important to guarantee quality of service QoS for multimedia transmission such as end to end
delay and throughput. During creating the path, next node is selected with best residual energy to
participant in the path and avoid path failure. Considering the location is made by choosing the
node that is much close to the sink.
In this research, researchers used the concept of location aware node disjoint paths. By node
disjoint paths, no node is sharing between two paths. So that every node joins only one path at a
time. This avoids consuming node energy and causes less congestion which grantee QoS. If the
node share between two paths which is link disjoint path and the node died, two paths are affected
while in node disjoint path only one path is affected.
The rest of this paper is organized as follow: literature review is section 2.The proposed ELARP
protocol is described at section 3.Performance metrics that evaluate the protocol is detailed in
section 4.Results and analysis are in section 5.Finally are the conclusion and future works in
section 6.
2.Literature Review
Wireless Sensor Networks (WSNs) are used in many applications to abstract information about
certain environment. Many applications such as monitoring and surveillance require sensing the
environment and send multimedia data not only scalar data. Multimedia data may include video,
sound or even image .A WMSN is composed of ordinary nodes of WSNs as well as nodes with
integrated cameras and microphones. WMSNs have sensor nodes that are capable to capture and
communicate streams of multimedia data.
There are many researchers produced different routing protocols for WMSNs to better use of
bandwidth, reduce the delay, and improve node’s energy consumptions. This is to show how
WMSNs can be more efficient depending on the constraints and the requirements of QoS on
specific application. WMSNs protocols may be classified based on the routing techniques into
four categories:
• Multichannel: sending the packets via different channels.
• Single path routing: at route discover stage, creating only one path from source to the
sink. Sung-Lee et al. [6] presented routing protocol for MWSNs. It is energy aware that
minimizes the control message overhead.
• Multipath routing: discover multipath from source to sink during route discovery. Poojary
and Pai [7] proposed a multipath protocol with power awareness routing.
• Multichannel and Multipath routing: creating a multipath and send the data via
multichannel[8].
Medjiah et al [9] introduced a multipath routing protocol that an enhancement of GPSR (Greedy
Perimeter Stateless Routing) protocol called GEAMS(Geographic Energy-Aware Multipath
Stream-based) which minimizes the queue size and enhances the network lifetime by adding load
3. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
79
balance. The sensor node saves information about hop neighbor such as distance, residual energy
and rate of the link.
A multipath routing used metadata to create the paths that meet QoS for multimedia data is
produced by Lan et al[10]. They used routing decision cost function and advanced Dijkstra
algorithm, excluded the neighbor nodes with insufficient delay, residual energy and bandwidth.
This protocol described the packet used by metadata. The simulation results show that the
proposed multipath protocol enhances the delay and energy consumption.
Guannan et al.[11] proposed a multipath routing and load balancing protocol for WMSNs to
increase reliability, reduce energy, and control the congestion. The proposed protocol is reactive
to reduce the overhead. The protocol creates three disjoint paths (primary, alternate, and backup
paths) from source to sink nodes. The simulation results show an enhancement of network
lifetime and throughput. The protocol shows fast deteriorate of network lifetime at higher
transmission rate. Disjoint path is not suitable for WMSN, the shared node will cause high energy
consumption.
Multipath routing protocol proposed by Li et al. [12] is path disjoint based on directed diffusion
(DD) protocol. The protocol modified DD and used cost path which is based on expected
transmission account (ETX) and delay as a metric. After the sink send interest, nodes calculate
the ETX for the last three upstream links and add the mto the packet header.
3. ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP)
All routing mechanisms that used to discover multipath in WSN and WMSN are based on
different types of discovering the paths, such as start to discover single path each time and repeat
the process until discover all possible paths or specific number of paths. Repeating the process
consumes energy and increases delay. Flooding mechanism is a mechanism to discover maximum
or fixed number of paths which have high energy cost. To avoid this cost, this research suggests
an Energy Location Aware Routing Protocol (ELARP). ELARP mechanism discovers three paths
at the same time with a consideration of node’s remaining energy and distance to the sink.
ELARP is used at network layer in layered architecture. Figure 1 shows this architecture.
From the figure, application layer MPEG4 distributed code algorithm is used, in transport
layer User Datagram Protocol (UDP) is used to guarantee lower latency because it does not use
hand-shaking mechanism nor end-to-end congestion control. Finally, IEEE 802.11 standard for
scheduling is used in MAC layer. Following subsections discuss the role of each layer in the
WMSN communication process.
Figure 1. ELARP Layered Architecture
4. International Journal of Computer Science & Information Tec
3.1 ELARP Network Model
The network is composed of N different heterogeneous sensor nodes distributed randomly in
specific flat area, as shown in
capabilities. Sink node is always switched on and it is non
audio and video sensor nodes. All these nodes are mobile nodes with random movement with
same speed in the network area. They have same
neighbour’s information such as energy and location.
3.2 Application Layer
MPEG-4 is a video structure that consists of
I. Intra – coded frame. I frame is encoded and decoded independently
other types of frames.
P. Predictive-coded frame. P frame is encoded and decoded dependent
in the sequence of the video.
B. Bi-directionally predictive coded frame. B frame is encoded and decoded dependent
types of previous and successive
According to this coding relation in MPEG
frames in encoding or decoding, losing one I frame will affect all frames
Picture (GOP).As a result this will affect the quality of
affect itself only. So, I frame is the most important type of frames then P and B frames has
importance.
Decomposing video sequence into
falling between two I frames. GOP is defined by two parameters G (N,M) where N is the distance
between I frames and M is the distance between I and P frames.
Application layer classified the frames to I,
priority, and GOP size in its header.
International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
Network Model
The network is composed of N different heterogeneous sensor nodes distributed randomly in
specific flat area, as shown in Figure 2. The network has one sink node which has special
capabilities. Sink node is always switched on and it is non-mobile node. The network also has
video sensor nodes. All these nodes are mobile nodes with random movement with
same speed in the network area. They have same transmission range and all nodes has access to
neighbour’s information such as energy and location.
Figure 2. Simulation Network
4 is a video structure that consists of three types of frames, these frames are:
coded frame. I frame is encoded and decoded independently without reference to any
coded frame. P frame is encoded and decoded dependent on previous I or P
in the sequence of the video.
directionally predictive coded frame. B frame is encoded and decoded dependent
previous and successive frames in the sequence of the multimedia data.
to this coding relation in MPEG-4 structure and the dependent relationship between
frames in encoding or decoding, losing one I frame will affect all frames in same Group of
s a result this will affect the quality of multimedia data. Losing B frame will
affect itself only. So, I frame is the most important type of frames then P and B frames has
video sequence into small units using GOP is referred to the number of frames
between two I frames. GOP is defined by two parameters G (N,M) where N is the distance
between I frames and M is the distance between I and P frames. [13, 14]
classified the frames to I, B, and P types. Then encapsulates frame type, frame
header.
hnology (IJCSIT) Vol 9, No 6, December 2017
80
The network is composed of N different heterogeneous sensor nodes distributed randomly in
. The network has one sink node which has special
network also has
video sensor nodes. All these nodes are mobile nodes with random movement with
range and all nodes has access to
without reference to any
previous I or P frames
directionally predictive coded frame. B frame is encoded and decoded dependent on other
4 structure and the dependent relationship between
in same Group of
. Losing B frame will
affect itself only. So, I frame is the most important type of frames then P and B frames has less
to the number of frames
between two I frames. GOP is defined by two parameters G (N,M) where N is the distance
B, and P types. Then encapsulates frame type, frame
5. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
81
3.3 Network Layer
ELARP is reactive routing protocol where the path is discovered only when a node has data to
send. Reactive approach is more suitable for WMSN to avoid energy consumption for creating
and maintaining the routing table and also to avoid control messages overhead.
3.3.1 Packet Format
ELARP protocol has different types of packet format. These packets are:
• Hello Packet: are broadcasted every period of time to update the neighbor list.
• Route Request (RREQ): is a packet format that is used to create the paths and has three
special fields used by ELARP. It contains the fields shown in Figure 3
Source
Addr
Source
Seq#
Broadcast
ID
Dest
Addr
Dest
Seq#
Hop_
Cnt
First_
Hop
Best
Add1
Best
Add2
Best
Add3
Figure 3. Route Request RREQ Packet Format
• Route Reply (RREP): is a packet format that is used to reply the route request.
• Route Reply Acknowledgment (RREP-ACK): is used to response to route reply.
• Route Error (RERR): is a packet format that is used in maintenance phase if failure is
detected.
3.3.2 Routing Table Structure
ELARP routing table contains five fields. These fields are: destination address, sequence number,
advertised hop count which contains the maximum hop count that available in the rout list, rout
list which is a pair of next hop and hop count and expiration time for this entry. Figure 4 shows
the header of the routing table
Destination
address
Rout list
{(nexthopi, hopcounti),
(nexthopj, hopcountj)}
Advertised
hop count
Sequence
number
Expiration
time out
Figure 4. Routing Table Structure
3.3.3 Next Node Selection Mechanism
A reactive approach is work on demand. Whenever an event is detected, it starts route discovery.
ELARP protocol has two lists:
A. Block List: A list contains all nodes that do not have any neighbors.
B. Neighbor List: a list contains all neighbor nodes excluding source node, block nodes and
nodes have already joined a path.
6. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
82
ELARP selects next node in a route based on two criteria: the remaining energy on neighbor node
to avoid hole in the path and distance to the sink. Calculate the weight of the node is based on
equation (1). For each node in the neighbor list Nx of current node x, is given by:
= +
(1)
Where ( , ) is appropriate weight with value between 0 and 1. is the remaining
energy, and is the complemented distance to the sink. is the distance between two
nodes and s(the sink node), and is calculated using equation (2). Node that has long distance
should be given less weight, equation (3)is used to calculate this parameter.
= ( − )" + (# − # )"
(2)
= 1 − (3)
Neighbor node with high weight has high probability to be a next node in route discovery process
using equation (4).
Next Node = +,#( 1, 2, … . , 01)
(4)
3.3.4 Route Discovery Mechanism
When an event occurs and some node has a data to send, the source node checks the neighbor list.
If the list is empty, then source node marks itself as block node and updates the block list.
Otherwise calculate the weight for each neighbor. Then it selects next node with high weight as
calculated by equation (4).
Source node establishes three paths by sending the request to best three neighbors then after the
paths are established, each node select the best neighbors to send the request and this process is
repeated until the paths reaches the sink and generate RREP. A route with minimum hop count is
used to send the data. The other two paths are used as back up. A new route discovery process is
repeated only if all paths are failed. The steps of ELARP mechanism techniques are shown in
Algorithm1.
4. PERFORMANCE METRICS
Different performance metrics are used to evaluate the performance of ELARP. These metrics
may be general for WSNs and WMSNs protocols or specific for only multimedia networks:
4.1 General Performance Metrics:
Packet delivery ratio: the ratio between the total numbers of packets received divided by
the total number of packets sent by the source node.
Network Lifetime: the duration of time from network deployed until the first node dies.
Drop Packet: the number of packets dropped.
End to end delay: possible delays of a packet being transmitted from source to
destination.
Jitter: the variation delay of receiving packets.
7. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
83
4.2 Multimedia Performance Metrics:
Frame loss: the number of frames loss in each type of video frame I, P and B. In this
research, we consider only loss of I frame.
Peak signal-to-noise ratio (PSNR): is a measure for video quality. PSNR measures the
signal noise by comparing maximum energy signal to corrupting noise. To see the quality
of PSNR to the video, map the PSNR to Mean Opinion Score (MOS) levels[15], where
PSNR>37 is excellent and PSNR<20 is bad. When PSNR is in the range 25-31, it is fair.
Algorithm 1: Route Discovery Algorithm
Require: Route Request Packet (RREQ)
Ensure: Minimum delay path
Output: Route Reply
Initialization: N=3, M=1
If Source Node have data to send
Check Neighbour list
IF (Neighbour list is empty)
Add the node to Block List, Else
foreach node in Neighbour list do
Calculate weight W
End
Sort Neighbour list based on W
Send RREQ to best N node
If node Receive Route Request Packets (RREQ)
If (node address is not in the packet OR RREQ already received)
drop the packet, Else
Set reverse route
If (node is intended receiver)
Send Route Reply Packets (RREP), Else
Check neighbour list
IF (Neighbour list is empty)
Add the node to block List, Else
foreach node in neighbour list do
Calculate weight W
End
Sort neighbour list based on W
Forward RREQ to best M node
5. ELARP RESULT AND ANALYSIS
ELARP is analysed under two different scenarios. It’s performance is compared with Ad hoc On-
demand Multipath Distance Vector(AOMDV)[16]. To insure correct and no deviated results,
average of ten runs is presented in each case.
5.1 Network Setup
The protocol is simulated using network simulation version-2 NS2 [17] with my Evalvid[18] to
test multimedia data transmission. The network consists of 50 heterogeneous sensor nodes and
one sink node. The number of video node is varied from 2 to 10, the number of audio node is
varied from 2 to 10. These nodes are distributed randomly in area 100 x 100 m. All sensor nodes
are mobile nodes with speed equal to 5 m/s. The sink node is centred placed, while the
heterogeneous sensor nodes are distributed randomly in the area. The two test scenarios are:
First, changing number of video and audio nodes and generating non-overlapping two events
during the simulation time. Event’s location are generated randomly. Second, events are
overlapped in three different scenarios. Table 1 summarizes the network parameters.
8. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
84
Table 1: The Network Parameters
Simulator NS-2.35
Simulation Time 500 s
Simulation Area 100 m* 100 m
Number of Sensor Nodes 50 nodes
Number of Video Nodes Vary from 2 to 10
Number of Audio Nodes Vary from 2 to 10
Queue Type Drop Tail
Propagation Models Two Ray Ground
Data Rate 1 Mbps
MAC Protocol IEEE 802.11
Routing Protocol ELARP, AOMDV
Initial energy of sensor node 5 Joule
Initial energy of video node 30 Joule
5.2 Ratio of Video Node
To study the effect of number of video nodes on network performance, researchers increase the
video and audio nodes from 2 to 16 nodes. Again, the results are taken as average of 10 runs.
Packet delivery ratio metric, shown in Figure 5, has ELARP is better than AOMDV on average.
It is noticeable that increasing network video nodes would cause decreasing the packet delivered
because of the higher probability of congestion, packet drooped and node death.
Figure 5. Packet Delivery Ratio vs. Increased Video Nodes
ELARP shows minor improvement in network lifetime over AOMDV as shown in Figure 6.
Network lifetime decreases from 390s to 350s with increasing video nodes from 2 to 10 nodes.
More than 10 video nodes causes dramatic drop in the network lifetime to 220s.
ELARP shows stable and linear drop packets over AOMDV as shown in Figure 7.The figure
shows that ELARP packet dropped is between 20 to 60 packets with linear increase with
increasing number of video nodes. While the packet dropped for AOMDV starts at 80 packets
with high fluctuations.
99.4
99.5
99.6
99.7
99.8
99.9
100
2 4 6 8 10 12 14 16
PacketDeliveryRatio(%)
No of video nodes
Packet Delivery Ratio
AOMDV
ELARP
9. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
85
Figure 6. Network Life time vs. Increase Video Nodes
Figure 7. Packet Drop vs. Increase Video Nodes
End to End delay is an important metric especially for WMSNs. Figure 8 shows the
improvement done by ELARP over AODMV. ELARP delay is more linear and stable.
Jitter is important metric denoting the stability of the network. ELARP protocol is little low jitter
over AOMDV. Figure 9 shows that more than 10 video nodes among 50 network nodes, jitter
has sharp increase.
Frame Loss of types I, P and B is special performance metric for WMSN. The average PSNR for
both ELARP and AOMDV protocols are not affected by increased the number of video nodes.
There is no loss of I frame and average PSNR = 27.87, which represents “fair” quality of the
video.
200
250
300
350
400
2 4 6 8 10 12 14 16
NetworkLifetime(Sec.)
No of video nodes
Network Lifetime
AOMDV
ELARP
0
20
40
60
80
100
120
2 4 6 8 10 12 14 16
NoofPacketsDropped
No of video nodes
Drop Packet
AOMDV
ELARP
10. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
86
Figure 8: End to End Delay vs. Increase Video Nodes
Figure 9. Jitter vs. Increase Video Nodes
5.3 Events Overlap
By event overlap, we mean how much time the events share sending data in the network. This
parameter represents increasing network load. To study the effect of time overlap of reporting
events and sending data, with also increasing he video and audio nodes from two to 16 nodes, the
research increases number of video and audio nodes that reporting events by considering three
cases:
Case A: the overlap time is 10 second
Case B: the overlap time is 20 second
Case C: the overlap time is 30 second
Packet delivery ratio of ELARP is outperforms AOMDV in all the three cases A, B, and C as
shown in Figure 10. ELARP shows also linear distribution regardless of network load.
0.1
0.11
0.12
0.13
0.14
0.15
0.16
2 4 6 8 10 12 14 16
Delay(S)
No of video nodes
End to End Delay
AOMDV
ELARP
0.0055
0.006
0.0065
0.007
0.0075
0.008
2 4 6 8 10 12 14 16
Jitter(S)
No of video nodes
Jitter
AOMDV
ELARP
11. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
87
Figure 10: Packet Delivery Ratiovs. Events Overlap
Although network lifetime is greatly affected by average energy consumption, Figure 11 shows
that both protocols are identical in the three cases. The figure also shows linear drop from 10
video nodes and up to 220 s lifetime.
Figure 11: Network Lifetimevs. Events Overlap
Figure 12 shows packet drop metric where ELARP has minimum drop packets than AOMDV
especially when WMSN is loaded by events overlap.
ELARP has achieved good results over AOMDV in end to end delay. Figure 13 shows that while
the number of video nodes increased, the end to end delay decreased for both protocols. The
improvement is better when the network is more loaded (case C).
Jitter is nearly constant when WMSN contains less than 10 video nodes and it has linear fast
increase when numbers of video nodes are more than 10 nodes. Figure 14 shows minor
improvement of ELARP over AODMV especially when the network is loaded (case C).
99.26
99.36
99.46
99.56
99.66
99.76
99.86
8 10 12 14 16
PacketDeliveryRatio(%)
No of video nodes
Packet Delivery Ratio
AOMDV Case A
ELARP Case A
AOMDV Case B
ELARP Case B
AOMDV Case C
ELARP Case C
220
270
320
370
420
8 10 12 14 16
NetworkLifetime(S)
No of video nodes
Network Lifetime
AOMDV Case A
ELARP Case A
AOMDV Case B
ELARP Case B
AOMDV Case C
ELARP Case C
12. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
88
Figure 12: Packet Dropvs. Events Overlap
Figure 13. End to End Delayvs. Events Overlap
Figure 14. Jitter vs. Events Overlap
28
78
128
178
8 10 12 14 16
NoofPacketsDropped
No of video nodes
Drop Packet
AOMDV Case A
ELARP Case A
AOMDV Case B
ELARP Case B
AOMDV Case C
ELARP Case C
0.11
0.12
0.13
0.14
0.15
0.16
0.17
8 10 12 14 16
Delay(S)
No of video nodes
End to End Delay
AOMDV Case A
ELARP Case A
AOMDV Case B
ELARP Case B
AOMDV Case C
ELARP Case C
0.0055
0.006
0.0065
0.007
0.0075
0.008
8 10 12 14 16
Jitter(S)
No of video nodes
Jitter
AOMDV Case A
ELARP Case A
AOMDV Case B
ELARP Case B
AOMDV Case C
ELARP Case C
13. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
89
Frame loss of I frame affects the quality of the video data transmitted. ELARP in case B and C
did not loss any I frame. AOMDV in same cases show highest loss of I frame as shown in Figure
15. In case A both protocols loss the same number of frames. The PSNR is affected by loss
frames, as shown by Figure 16, more frames lost causes less PSNR. In all cases AOMDV and
ELARP protocol lie in fair MOS level.
Figure 15. I Frame Lostvs. Events Overlap
Figure 16. Average PSNR vs. Events Overlap
6. CONCLUSIONS AND FUTURE WORK
QoS is an important issue for WMSNs in term of end to end delay and guarantee data delivery. In
this work, ELARP with awareness of location and energy of the node is developed. A multipath
routing which does aware of remaining energy and location of the node, reduce overhead and
save energy by selecting three paths based on their weight. Only one path is used to send the data
and othersareback up in case of failure. ELARP’s performance is compared against AOMDV
protocol. NS2 simulator is used to simulate ELARP. The results are analysed using two
parameters: increasing number of video nodes in the network and events overlap which reflects
network load. From the results, ELARP enhances the packet drop and delay over AODMV.
Increasing number of video nodes more than 10 nodes makes a big difference in protocol
0
1
2
3
4
5
6
8 10 12 14 16
NoofFrameLost
No of video nodes
I Frame Lost
AOMDV Case A
ELARP Case A
AOMDV Case B
ELARP Case B
AOMDV Case C
ELARP Case C
26.8
27
27.2
27.4
27.6
27.8
28
8 10 12 14 16
PSNR
No of video nodes
PSNR
AOMDV Case A
ELARP Case A
AOMDV Case B
ELARP Case B
AOMDV Case C
ELARP Case C
14. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
90
performance. While increasing network load represented by event overlap has also improved
packet delivery ratio and end-to-end delay as well as I frame loss and PSNR.
As a future work, ELARP is used in Cross Layer environment where different layers are
collaborated to enhance the performance of ELARP.
REFERENCES
[1] T. Melodia and I. F. Akyildiz, "Research Challenges for Wireless Multimedia Sensor Networks,"
in Distributed video sensor networks, ed: Springer Science & Business Media, 2011, pp. 233-246.
[2] Z. Hamid, F. Bashir, and J. Y. Pyun, "Cross-layer QoS routing protocol for multimedia
communications in sensor networks," in Ubiquitous and future networks (ICUFN), 2012 fourth
international conference on, Puket, Thailand, 2012, pp. 498-502.
[3] J. Ben-Othman and B. Yahya, "Energy efficient and QoS based routing protocol for wireless
sensor networks," Journal of Parallel and Distributed Computing, vol. 70, pp. 849-857, 2010.
[4] D. Ganesan, R. Govindan, S. Shenker, and D. Estrin, "Highly-resilient, energy-efficient multipath
routing in wireless sensor networks," ACM SIGMOBILE Mobile Computing and Communications
Review, vol. 5, pp. 11-25, 2001.
[5] W. Lou, W. Liu, and Y. Zhang, "Performance optimization using multipath routing in mobile ad
hoc and wireless sensor networks," in Combinatorial optimization in communication networks, ed:
Springer, 2006, pp. 117-146.
[6] S.-K. Lee, J.-G. Koh, and C.-R. Jung, "An energy-efficient QoS-aware routing algorithm for
wireless multimedia sensor networks," International Journal of Multimedia and Ubiquitous
Engineering, vol. 9, pp. 245-252, 2014.
[7] D. Kandris, M. Tsagkaropoulos, I. Politis, A. Tzes, and S. Kotsopoulos, "Energy efficient and
perceived QoS aware video routing over wireless multimedia sensor networks," Ad Hoc Networks,
vol. 9, pp. 591-607, 2011.
[8] M. A. Hamid, M. M. Alam, and C. S. Hong, "Design of a QoS-aware routing mechanism for
wireless multimedia sensor networks," in Global Telecommunications Conference, 2008. IEEE
GLOBECOM 2008. IEEE, 2008, pp. 1-6.
[9] S. Medjiah, T. Ahmed, and F. Krief, "GEAMS: a geographic energy-aware multipath stream-
based routing protocol for WMSNs," in Information Infrastructure Symposium, 2009. GIIS'09.
Global, 2009, pp. 1-8.
[10] Y. Lan, W. Wenjing, and G. Fuxiang, "A real-time and energy aware QoS routing protocol for
multimedia wireless sensor networks," in Intelligent Control and Automation, 2008. WCICA 2008.
7th World Congress on, 2008, pp. 3321-3326.
[11] G. Sun, J. Qi, Z. Zang, and Q. Xu, "A reliable multipath routing algorithm with related congestion
control scheme in wireless multimedia sensor networks," in Computer Research and Development
(ICCRD), 2011 3rd International Conference on, 2011, pp. 229-233.
[12] S. Li, R. Neelisetti, C. Liu, and A. Lim, "Delay-constrained high throughput protocol for multi-
path transmission over wireless multimedia sensor networks," in World of Wireless, Mobile and
Multimedia Networks, 2008. WoWMoM 2008. 2008 International Symposium on a, 2008, pp. 1-8.
[13] V. Group, "MPEG-4 video verification model version 18.0," Coding of moving pictures and
associated audio MPEG2001/N3908, ISO/IEC JTC1/SC29/WG11, Pisa, Italy,, Jan. 2001.
[14] International Organization for Standardization (1999), Overview of the MPEG-4 standard.
[15] J. Klaue, B. Rathke, and A. Wolisz, "Evalvid-a framework for video transmission and quality
evaluation," Computer Performance Evaluation/Tools, vol. 2794, pp. 255-272, 2003.
[16] M. K. Marina and S. R. Das, "Ad hoc on‐demand multipath distance vector routing," Wireless
communications and mobile computing, vol. 6, pp. 969-988, 2006.
[17] T. Issariyakul and E. Hossain, Introduction to network simulator NS2: Springer Science &
Business Media, 2011.
[18] C.-H. Ke, C.-K. Shieh, W.-S. Hwang, and A. Ziviani, "An evaluation framework for more realistic
simulations of MPEG video transmission," Journal of Information Science & Engineering, vol. 24,
2008.
15. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
91
Authors
Ablah AlAmri received bachelor degree in computer science in 2012 from King Abdul-Aziz University.
Currently, teaching assistant at King Abdul-Aziz University, and master student in Faculty of Computing
and Information Technology, King Abdul-Aziz University.
Manal Abdullah:received her PhD in computers and systems engineering, Faculty of Engineering, Ain-
shams University, Egypt, 2002. She has experienced in industrial computer networks with a lot of
reputational vendors of PLC, SCADA, and DCS.Currently she is associate professor in faculty of
Computing and Information Technology, King Abdulaziz University KAU, SA. Dr. Abdullah’s research
interest includes computer networks, Artificial Intelligence, Information Retrieval, Big Data
Analysis,PatternRecognition and Wireless sensor networks. She published more than 90 research papers in
various international journals and conferences.