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 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.
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.
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.
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.
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.
MAR SECURITY: IMPROVED SECURITY MECHANISM FOR EMERGENCY MESSAGES OF VANET USI...IJCNCJournal
Vehicular Ad-hoc network (VANET) is one of the emerging technologies for research community to get various research challenges to construct secured framework for autonomous vehicular communication. The prime concern of this technology is to provide efficient data communication among registered vehicle nodes. The several research ideas are implemented practically to improve overall communication in VANETs by considering security and privacy as major aspects of VANETs. Several mechanisms have been implemented using cryptography algorithms and methodologies. However, these mechanisms provide a solution only for some restricted environments and to limited security threats. Hence, the proposed novel mechanism has been introduced, implemented and tested using key management technique. It provides secured network environment for VANET and its components. Later, this mechanism provides security for data packets of emergency messages using cryptography mechanism. Hence, the proposed novel mechanism is named Group Key Management & Cryptography Schemes (GKMC). The experimental analysis shows significant improvements in the network performance to provide security and privacy for emergency messages. This GKMC mechanism will help the VANET user’s to perform secured emergency message communication in network environment.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
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.
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.
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.
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.
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.
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.
MAR SECURITY: IMPROVED SECURITY MECHANISM FOR EMERGENCY MESSAGES OF VANET USI...IJCNCJournal
Vehicular Ad-hoc network (VANET) is one of the emerging technologies for research community to get various research challenges to construct secured framework for autonomous vehicular communication. The prime concern of this technology is to provide efficient data communication among registered vehicle nodes. The several research ideas are implemented practically to improve overall communication in VANETs by considering security and privacy as major aspects of VANETs. Several mechanisms have been implemented using cryptography algorithms and methodologies. However, these mechanisms provide a solution only for some restricted environments and to limited security threats. Hence, the proposed novel mechanism has been introduced, implemented and tested using key management technique. It provides secured network environment for VANET and its components. Later, this mechanism provides security for data packets of emergency messages using cryptography mechanism. Hence, the proposed novel mechanism is named Group Key Management & Cryptography Schemes (GKMC). The experimental analysis shows significant improvements in the network performance to provide security and privacy for emergency messages. This GKMC mechanism will help the VANET user’s to perform secured emergency message communication in network environment.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
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.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
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.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
Performance improvement of vehicular delay tolerant networks using public tra...ijmnct
In some networks, communications are sometimes interrupted and packet sending encounters many delays
due to lack of permanent connection between the nodes. Inter-vehicular and inter-satellite networks, which
are the so-called delay-tolerant networks, are an example to this type. This paper proposed a new routing
algorithm, which could increase efficiency of this kind of networks using predictability feature of bus
movement in a vehicular network. In this paper, bus routes were considered the backbone for vehicular
network and, knowing route of bus and destination of packets, the proposed algorithm, which was able to
use this information, was introduced. In addition, the proposed algorithm was simulated to prove its
efficiency and then it was compared with other algorithms in different conditions. The obtained results
indicated acceptable efficiency of the proposed algorithm.
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 OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
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.
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.
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
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.
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.
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.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.t
Optimized reduction approach of congestion in mobile ad hoc network based on...IJECEIAES
Over the past decades, computer networks have experienced an outbreak and with that came severe congestion problems. Congestion is a crucial determinant in the delivery of delay-sensitive applications (voice and video) and the quality of the network. in this paper, the Lagrangian optimization rate, delay, packet loss, and congestion approach (LORDPC) are presented. A congestion avoidance routing method for device-to-device (D2D) nodes in an ad hoc network that addresses the traffic intensity problem. The method of Lagrange multipliers is utilized for active route election to dodge heavy traffic links. To demonstrate the effectiveness of our proposed method, we applied extensive simulation that presents path discovery and selection. Results show that LORDPC decreases delay and traffic intensity while maintaining a high bitrate and low packet loss rate and it outperformed the ad hoc on-demand distance vector (AODV) protocol and the Lagrangian optimization rate, delay, and packet loss, approach (LORDP).
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
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.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
Performance improvement of vehicular delay tolerant networks using public tra...ijmnct
In some networks, communications are sometimes interrupted and packet sending encounters many delays
due to lack of permanent connection between the nodes. Inter-vehicular and inter-satellite networks, which
are the so-called delay-tolerant networks, are an example to this type. This paper proposed a new routing
algorithm, which could increase efficiency of this kind of networks using predictability feature of bus
movement in a vehicular network. In this paper, bus routes were considered the backbone for vehicular
network and, knowing route of bus and destination of packets, the proposed algorithm, which was able to
use this information, was introduced. In addition, the proposed algorithm was simulated to prove its
efficiency and then it was compared with other algorithms in different conditions. The obtained results
indicated acceptable efficiency of the proposed algorithm.
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 OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
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.
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.
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
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.
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.
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.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.t
Optimized reduction approach of congestion in mobile ad hoc network based on...IJECEIAES
Over the past decades, computer networks have experienced an outbreak and with that came severe congestion problems. Congestion is a crucial determinant in the delivery of delay-sensitive applications (voice and video) and the quality of the network. in this paper, the Lagrangian optimization rate, delay, packet loss, and congestion approach (LORDPC) are presented. A congestion avoidance routing method for device-to-device (D2D) nodes in an ad hoc network that addresses the traffic intensity problem. The method of Lagrange multipliers is utilized for active route election to dodge heavy traffic links. To demonstrate the effectiveness of our proposed method, we applied extensive simulation that presents path discovery and selection. Results show that LORDPC decreases delay and traffic intensity while maintaining a high bitrate and low packet loss rate and it outperformed the ad hoc on-demand distance vector (AODV) protocol and the Lagrangian optimization rate, delay, and packet loss, approach (LORDP).
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR
Rsaodv a route stability based ad hoc on demand distance vector routing prot...ijwmn
High mobility of mobile nodes is one of the major reasons for link failures in mobile ad hoc network (MANET). The present paper aims at proposing modification of well known Ad hoc On demand Distance Vector (AODV) routing protocol for MANET seeking stable route for data transmission and incorporating link break avoidance scheme for such networks. The performance of the proposed routing protocol, named as Route Stability based Ad hoc On demand Distance Vector (RSAODV), is evaluated considering some major performance metrics which include average route life time, throughput, packet delivery fraction, normalized routing load and end–to-end delay. The study is based on simulation runs adopting CBR traffic pattern taking care of node failure scenarios. The performance of RAODV is compared with AODV routing protocol. The simulation runs exhibit significant increase in average route life time, packet delivery fraction and throughput for RSAODV, on the other hand, the normalized routing load and end–to-end delay are reduced for this routing protocol as compared to AODV routing 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.
A MIN-MAX SCHEDULING LOAD BALANCED APPROACH TO ENHANCE ENERGY EFFICIENCY AND ...IJCNCJournal
Energy efficiency and traffic management in Mobile Ad hoc Networks (MANETs) is a complex process due
to the self-organizing nature of the nodes. Quality of service (QoS) of the network is achieved by
addressing the issues concerned with load handling and energy conservation. This manuscript proposes a
min-max scheduling (M2S) algorithm for energy efficiency and load balancing (LB) in MANETs. The
algorithm operates in two phases: neighbor selection and load balancing. In state selection, the
transmission of the node is altered based on its energy and packet delivery factor. In the load balancing
phase, the selected nodes are induced by queuing and scheduling the process to improve the rate of load
dissemination. The different processes are intended to improve the packet delivery factor (PDF) by
selecting appropriate node transmission states. The transmission states of the nodes are classified through
periodic remaining energy update; the queuing and scheduling process is dynamically adjusted with energy
consideration. A weight-based normalized function eases neighbor selection by determining the most
precise neighbor that satisfies transmission and energy constraints. The results of the proposed M2SLB
(Min-Max Scheduling Load Balancing) proves the consistency of the proposed algorithm by improving the
network throughput, packet delivery ratio and minimizing delay and packet loss by retaining higher
remaining energy.
Energy Aware Routing Protocol for Energy Constrained Mobile Ad-hoc Networks IJECEIAES
Dynamic topology change and decentralized makes routing a challenging task in mobile ad hoc network. Energy efficient routing is the most challenging task in MANET due to limited energy of mobile nodes. Limited power of batteries typically use in MANET, and this is not easy to change or replace while running communication. Network disorder can occur for many factors but in middle of these factors deficiency of energy is the most significant one for causing broken links and early partition of the network. Evenly distribution of power between nodes could enhance the lifetime of the network, which leads to improving overall network transmission and minimizes the connection request. To discourse this issue, we propose an Energy Aware Routing Protocol (EARP) which considers node energy in route searching process and chooses nodes with higher energy levels. The EARP aim is to establish t he shortest route from source to destination that contains energy efficient nodes. The performance of EARP is evaluated in terms of packet delivery ratio, network lifetime, end-to-end delay and throughput. Results of simulation done by using NS2 network simulator shows that EARP can achieve both high throughput and delivery ratio, whereas increase network lifetime and decreases end-to-end delay.
GPS Enabled Energy Efficient Routing for ManetCSCJournals
In this paper, we propose an energy aware reactive approach by introducing energy and distance based threshold criteria. Cross Layer interaction is exploited the performance of physical layer which leads to significant improvement in the energy efficiency of a network.
A RELIABLE AND ENERGY EFFICIENCT ROUTING PROTOCOL FOR MANETs cscpconf
A mobile ad-hoc network (MANETs) is an infrastructure less network in which the mobile nodes
communicate with each other. Due to its various characteristics like highly dynamic topology
and limited battery power of the nodes, routing is one of the key issue. Also, it is not possible to
give a significant amount of power to the mobile nodes of ad-hoc networks. Because of all this
the energy consumption is also an important issue. Due to limited battery power, some other
issues like if some node gets fail, which results in loss of data packets and no reliable data
transfer has been raised. In this paper, an algorithm is proposed for data transmission which
detects the node failure (due to energy) before it actually happens. Because of this network
lifetime gets improved. The proposed routing algorithm is energy efficient as compared to
AODV routing algorithm. The performance is analyzed on the basis of various performance
metrics like Energy Consumption, Packet Delivery Ratio, Network Life Time, Network Routing
Overhead and number of Exhausted nodes in the network by using the NS2 Simulator.
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.
Q-LEARNING BASED ROUTING PROTOCOL TO ENHANCE NETWORK LIFETIME IN WSNSIJCNCJournal
In resource constraint Wireless Sensor Networks (WSNs), enhancement of network lifetime has been one of the significantly challenging issues for the researchers. Researchers have been exploiting machine learning techniques, in particular reinforcement learning, to achieve efficient solutions in the domain of WSN. The objective of this paper is to apply Q-learning, a reinforcement learning technique, to enhance the lifetime of the network, by developing distributed routing protocols. Q-learning is an attractive choice for routing due to its low computational requirements and additional memory demands. To facilitate an agent running at each node to take an optimal action, the approach considers node’s residual energy, hop length to sink and transmission power. The parameters, residual energy and hop length, are used to calculate the Q-value, which in turn is used to decide the optimal next-hop for routing. The proposed protocols’ performance is evaluated through NS3 simulations, and compared with AODV protocol in terms of network lifetime, throughput and end-to-end delay.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Similar to AN EFFICIENT AND STABLE ROUTING ALGORITHM IN MOBILE AD HOC NETWORK (20)
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
TECHNICAL TRAINING MANUAL GENERAL FAMILIARIZATION COURSEDuvanRamosGarzon1
AIRCRAFT GENERAL
The Single Aisle is the most advanced family aircraft in service today, with fly-by-wire flight controls.
The A318, A319, A320 and A321 are twin-engine subsonic medium range aircraft.
The family offers a choice of engines
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Democratizing Fuzzing at Scale by Abhishek Aryaabh.arya
Presented at NUS: Fuzzing and Software Security Summer School 2024
This keynote talks about the democratization of fuzzing at scale, highlighting the collaboration between open source communities, academia, and industry to advance the field of fuzzing. It delves into the history of fuzzing, the development of scalable fuzzing platforms, and the empowerment of community-driven research. The talk will further discuss recent advancements leveraging AI/ML and offer insights into the future evolution of the fuzzing landscape.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Top 10 Oil and Gas Projects in Saudi Arabia 2024.pdf
AN EFFICIENT AND STABLE ROUTING ALGORITHM IN MOBILE AD HOC NETWORK
1. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
DOI: 10.5121/ijcnc.2021.13402 21
AN EFFICIENT AND STABLE ROUTING
ALGORITHM IN MOBILE AD HOC NETWORK
Priyanka Pandey and Raghuraj Singh
Department of Computer Science and Engineering,
Harcourt Butler Technical University, Kanpur, India.
ABSTRACT
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.
KEYWORDS
Mobile Ad hoc Network, Energy, AODV, Routing, Random Waypoint Model.
1. INTRODUCTION
In the field of wireless communication technology, Mobile Ad hoc Networks (MANET) [1, 2]
became one of the most prevalent topics among the research community. In MANET, mobile
nodes move arbitrarily and communicate among themselves in wireless mode. MANET has many
issues such as real-time communication, limited bandwidth, resource constraints and control
message overhead. Owing to these issues, routing in this kind of networks is very challenging
task. Over the past few years, many routing protocols [3] has been designed and broadly
classified as reactive and proactive. These routing protocols specify the strategy through which
two devices communicate with each other.
In the proactive routing approach, every node has routing information about the available routes
and routing table is updated periodically. DSDV [4] and OLSR [5] are some examples of
proactive routing protocols. However, these protocols are not efficient for the large and dynamic
network.
On the other hand, reactive to routing protocols such as AODV [6] and DSR [7] use local
information for the route establishment. Nodes do not maintain routing information periodically.
The route discovery process is initiated only when a source needs to transfer data packets to a
2. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
22
goal node. AODV is one the most widely used routing scheme in the reactive category as it
performs routing operation more efficiently in dynamic environment where network topology
changes frequently. If a path is not used till the expiration time, the information from the routing
table automatically gets deleted.
Stable routing helps in selection of long lasting route which reduces chances of occurrences of
route failure. An efficient routing protocol focuses on improving the routing performance.
Consideration of stability along with efficiency gives improved results in terms of packet delivery
ratio, normalized routing load, message overhead, throughput and delay. Parameters such as
residual energy of a node, distance and node mobility have great impact on link stability [8]. For
example, if the distance between adjacent nodes is longer then it may result in packet loss.
Furthermore, weak signal strength may also cause packet drop. Nodes are dependent on battery
power and consume energy during processing, receiving and transmitting packets [9]. Thus, the
residual energy of a node should also be considered during route establishment process. The
stability- based routing protocol should be designed in such a way that it selects the route with a
longer lifetime and be more adaptive to the dynamic topology of MANET.
Therefore, in this paper, we have modified the existing AODV scheme in order to provide more
stable and efficient route to the network for smooth data transmission process. Parameters such as
received signal power, distance, delay and residual energy are used for the computation of route
stability.
The paper is organized as follows: Section 2 explains related work done pertaining to the
enhancement of AODV routing performance. In Section 3 detailed description of EFST-AODV
has been presented. Section 4 presents the result and analysis along with description of simulation
parameters and network scenarios that are used to validate the proposed approach. Finally, in
Section 5 conclusion is drawn.
2. RELATED WORK
Enhancement of routing performance has been comprehensively researched in past few years and
paradigms that are said to possess the ability to provide efficient and stable communication
between sender and receiver have been designed. In this section we discuss about some related
works done in the direction towards improving routing performance in MANET.
Received signal power is considered as one of the important factors in route selection criteria. It
depicts the link quality between two nodes. Considering this parameter [10] proposed a technique
in which node determines received signal power in order to estimate signal quality. If the
estimated value of received power is below threshold, the node increases link failure factor (LFF)
metric by one. After getting route reply message from all paths, the source node selects the final
path with minimum LFF. Furthermore, during data transmission process energy level of the hops
are continuously monitored. Another proposed Advanced AODV Link Break Prediction
(AODVLBP) [11] utilizes the signal strength parameter to examine the route stability consisting
of multiple links. The scheme predicts the time of link failure using Newton Divided difference
method which is applied on latest three received signal strength values. In order to transmit data
smoothly and efficiently authors proposed Intelligent Routing AODV (IRAODV) [12] that
focuses on the improvement of battery power. In this scheme distance between two nodes is
determined on the basis of received signal power. However, performance in terms of throughput
and delay has not shown much improvement. Authors [13] suggested a technique by considering
difference between values of last and current hop received signal power. If the difference is found
below a threshold, the scheme applies local the route repairing technique.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
23
During route construction process quality of link should also be examined. For example [14]
Malwe et. al. proposed two link availability prediction scheme i.e. zone based and segment-
based. In zone- based technique transmission range is divided into three zones i.e. inner, middle
and outer. Nodes in the middle zone are only allowed to transmit control packets. Another
proposed approach is an enhancement over zone based technique in which nodes lying in the
external zone are also allowed for control packets transmission. Next hop is selected on the basis
of current available position of the neighbour. In order to improve routing performance, tracking
concept [15] is applied to predict node mobility. The scheme initially selects the route as per
conventional AODV. During data transmission process the tracking mechanism is applied to
approximate node’s coordinate and correlation is established to find the node’s next position.
However, as the network load increases, energy consumption also increases.
Energy consumption is one of the important problems in MANET as nodes have limited battery
power. In order to reduce energy consumption [16] Senthil R. et. al. proposed a technique for
enhancement of AODV based on energy level of a node. The approach selects the path by
investigating energy level of a node with more throughputs and less delay. In another notable
work, Dhandapani et. al. proposed [17] an Energy Efficient Node Rank Based Routing (EENRR)
in order to improve networks lifetime and packet delivery performance. The technique is an
improvement over DSR which has almost similar working as AODV. Before forwarding route
request packet, rank of the intermediate node is computed. Afterward, the energy level is
compared with threshold. The node forwards the route request packet further only if the residual
energy is higher than a threshold.
In order to take good routing decisions fuzzy approach is applied by considering energy
parameters along with other criteria factors such as node mobility, hop count and distance to
improve routing efficiency. For example in [18] used a fuzzy approach by considering residual
energy, distance and node mobility in route selection criteria. However, the technique has a
higher delay. In [19] Fuzzy AODV technique computes the trust level of a node to select an
optimal route by considering parameters such as node energy, mobility and hop count. These
parameters are fed into the fuzzy inference system and nodes with the highest trust values are
chosen to establish final route towards the destination.
From the analysis, it can be concluded that most of the aforementioned techniques consider
received signal power and energy parameters during the route discovery process but do not
achieve better performance in every aspect. For example, the mechanisms applied in [10] [16]
and [18] have a higher delays. While in [14] control message overhead is more. In [13]
simulation has not been performed to analyze the results. In [19] and [11] performance in terms
of throughput and packet delivery ratio has not shown significant improvement. Considering
these drawbacks, in this paper, our technique provides more stable and efficient route by
incorporating some major parameters in order to investigate the quality of nodes and links during
the route discovery cycle. The performance of the work has shown significant improvement in
terms of delay, packet delivery, normalized routing load, control overhead and throughput.
3. PROPOSED WORK
The main aim of the proposed EFST-AODV is to enhance the routing performance by providing
a stable and efficient route. Link failure, node mobility and limited energy are major issues in
MANET routing. Therefore, in this work, we have considered delay, distance and received signal
power parameters in order to estimate link quality and residual energy for investigating node
status so that the final chosen path can perform data transmission process more efficiently.
4. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
24
3.1. Parameters Considered
In EFST-AODV, following parameters are taken into account during route establishment
process.
3.1.1. Residual Energy
Each node acts differently as per the amount of remaining energy. The proposed technique
considers the energy level of a node during route selection process. Every mobile node consumes
energy mainly in transmitting, receiving and idle mode [20]. Therefore, the total energy
consumption of a particular node 𝑁𝑖 till the current time can be calculated using the following
equation 1.
𝐸𝑐𝑜𝑛 𝑖 = 𝐸𝑟𝑖 + 𝐸𝑖𝑑𝑖 + 𝐸𝑡𝑟 𝑖 (1)
Where 𝐸𝑟𝑖 is total energy consumed in sending mode.
𝐸𝑖𝑑𝑖 is total energy consume in idle mode
𝐸𝑡𝑟𝑖 is total energy consumed in receiving mode.
Further the consumed energy 𝐸𝑐𝑜𝑛 is subtracted from initial energy 𝐸𝑖𝑛 to get node’s residual
energy 𝐸𝑟𝑒 as in equation 2
𝐸𝑟𝑒 = 𝐸𝑖𝑛 − 𝐸𝑐𝑜𝑛 (2)
3.1.2. Distance
Distance parameter is used in order to determine link connectivity status between adjacent nodes.
In this paper, distance between two nodes, let’s 𝑁𝑖 and 𝑁𝑗 at time t is determined using Euclidian
distance formula as in equation 3.
𝐷𝑖𝑗 = √(𝑥𝑗 − 𝑥𝑖)2 + (𝑦𝑗 − 𝑦𝑖)2 (3)
Where (𝑥𝑖, 𝑦𝑖) and (𝑥𝑗, 𝑦𝑗) are the current position of node 𝑁𝑖 and 𝑁𝑗 respectively.
If the distance is less than threshold 𝜃, the nodes are said to be neighbours. Threshold θ is
determined using equation 4.
𝜃 = 𝐶𝑟 ∗ 𝑎 (4)
Where value of 𝑎 is .96 and Cr is the communication range= 250 m.
3.1.3. Delay (Del)
Delay is the difference between receiving time and sending time. It also shows congestion level
between adjacent nodes. If the delay between nodes is higher, it leads to the delay in overall
routing process.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
25
3.1.4. Received Signal Power
Received signal strength measures signal quality. The value comes from the physical layer to
choose stable and efficient links by monitoring link quality [21]. The two ray propagation model
[22] is used to estimate received signal power. In the proposed approach, this parameter is one of
the main factors in modifying the routing strategy.
Following equation 5 is used to estimate received signal power.
𝑃𝑟 =
𝐺𝑡𝑟𝑎𝑛𝑠𝑚∗𝐺𝑟𝑒𝑐𝑒𝑖𝑣∗𝑃𝑡𝑟𝑎𝑛𝑠𝑚∗𝐻𝑡𝑟𝑎𝑛𝑠𝑚
2∗𝐻𝑟𝑒𝑐𝑒𝑖𝑣
2
𝑑4 𝐿
(5)
Where 𝑃𝑟 is received signal power, 𝐺𝑡𝑟𝑎𝑛𝑠𝑚 𝑎𝑛𝑑 𝐺𝑟𝑒𝑐𝑒𝑖𝑣 are transmitted and received antenna
gain respectively, 𝐻𝑡𝑟𝑎𝑛𝑠𝑚 𝑎𝑛𝑑 𝐻𝑟𝑒𝑐𝑒𝑖𝑣 are heights of antennas, d is distance and L is path loss.
3.2. Route Establishment Process
The proposed scheme establishes the route by considering more criteria factors. The route
establishment procedure is mainly performed in two phases i.e route request and route reply. In
the route request stage, the originator node initiates route-finding operation by broadcasting route
request (RREQ) packets. In route reply phase the destination node sends a route reply (RREP)
packet to the originator that has complete routing information.
3.2.1. Route Request Phase
Whenever the source node has to transmit the packet to a goal node and it has no information
about the path. The node broadcasts the RREQ packet towards its neighbor. However, the
conventional AODV algorithm does not consider neighbor connectivity and energy status that
may lead to route failure. In order to enhance route lifetime, the RREQ packet is modified
slightly by adding fields such as packet sending time, node’s position and one more field i.e. cost
metric field which represents the stability level of a path from source to destination. The modified
packet format is shown in Figure 1.
Figure 1: RREQ Packet Format (SA-Address of Source, DA - Destination Address, SSN : Source Sequence
Number, DSN - Destination Sequence Number, X pos - position of X, Y pos -position of Y , CMFR- Cost
Metric of Forward Route, HC - Hop Count)
Value of Cost Metric is initialized to 0. Nodes receiving packet calculates distance and received
signal power as per equation 3 and 5 respectively. In order to examine link quality these
parameters are compared with respect to their thresholds as shown in equation 6.
{
(𝐷𝑖𝑗 > 𝐷𝑡ℎ𝑟) 𝑎𝑛𝑑 (𝑆𝑆 > 𝑆𝑆𝑡ℎ𝑟) 𝐸𝑠𝑡𝑖𝑚𝑎𝑡𝑒 𝐶𝑀𝐹𝑅
𝑂𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 𝐷𝑖𝑠𝑐𝑎𝑟𝑑 𝑃𝑎𝑐𝑘𝑒𝑡
(6)
Where 𝐷𝑖𝑗 is the distance between two nodes, 𝐷𝑡ℎ𝑟 = 𝜃, 𝑆𝑆 = 𝑃𝑟 and 𝑆𝑆𝑡ℎ𝑟 is signal threshold.
SA DA SSN DSN X pos Y pos CMFR HC
6. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
26
If a receiving node satisfies the packet acceptance criteria, it further calculates CMFR
(Cost Metric of Forward Route) using equation 7 and the value is appended in RREQ’s
CMFR field which is further broadcasted and processed until it reaches the goal node.
𝐶𝑀𝐹𝑅 = (𝑘1 ∗
1
𝐷𝑒𝑙
) + (𝑘2 ∗
1
𝑫𝒊𝒋
) + (𝑘3 ∗ 𝐸𝑟𝑒) (7)
Once the destination node receives first RREQ packet, it immediately replies to the
source node through route reply packet. Later, when another RREQ packet with better
cost metric arrives, that packet is sent towards the originator for further processing.
The whole Route Request Phase is represented through following pseudo code.
Let P be the RREQ packet
CMFR be the cost metric of forward route whose value representing the route stability.
𝑪𝑴𝑭𝑹𝒑𝒓𝒆𝒗 be the 𝑪𝑴𝑭𝑹 value of previous packet
𝑫𝒊𝒋 𝐚𝐧𝐝 𝑫𝒕𝒉𝒓 be the distance and distance threshold respectively.
𝑺𝑺 𝐚𝐧𝐝 𝑺𝑺𝒕𝒉𝒓 be the received signal power and its threshold respectively.
Route Reply Phase
Step1: Estimate 𝑫𝒊𝒋 and 𝑺𝑺 using equation and respectively.
Step 2: If (𝑫𝒊𝒋 > 𝑫𝒕𝒉𝒓) 𝒂𝒏𝒅 (𝑺𝑺 > 𝑺𝑺𝒕𝒉𝒓)
Evaluate 𝑪𝑴𝑭𝑹
Else
Discard P
Step 3: Evaluate 𝑪𝑴𝑭𝑹 using equation
Step 4: If first packet is received
Store 𝑪𝑴𝑭𝑹 in a table and send reply to S
Else
If (𝑪𝑴𝑭𝑹 > 𝑪𝑴𝑭𝑹𝒑𝒓𝒆𝒗)
Send RREP to S
Else
Discard P
Figure 2: Pseudo code for Route Request phase
3.2.2. Route Reply Phase
During route reply phase each intermediate node receiving RREP estimates residual
energy and current delay between sender and receiver and adds this information into the
RREP field before forwarding the packet to the next hop towards source node. The RREP
packet format is modified as shown below in Figure 3:
Figure 3: RREP Packet Format (SA- Address of source, DA - Destination Address, SSN : Source Sequence
Number, DSN - Destination Sequence Number, , HC - Hop Count, AVG_DEL - Average Delay,
AVG_ENG- Average Residual Energy)
SA DA SSN DSN HC AVG_DEL AVG_ENG
7. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
27
Once the source node receives the packet, it first estimates Cost Metric of Backward Route
(CMBR) using equation 8 as follows
𝐶𝑀𝐵𝑅 = 𝐴𝑉𝐺_𝐸𝑁𝐺 ∗ 𝛼 + 𝐴𝑉𝐺_𝐷𝐸𝐿 ∗ (1 − 𝛼) (8)
Where AVG_ENG is average energy and 𝐴𝑉𝐺_𝐷𝐸𝐿 is average delay and 𝛼 is weighting factor.
At a later stage, if before the expiration time, the second packet RREP arrives at the source node,
CMBR is estimated by the receiving node. If the value is higher than the previous received
packet, rest data packets are transmitted through new route. Otherwise, the received packet is
simply discarded and the flow continues with the previous route. The working flow of the route
reply packet is shown in Figure 4.
Figure 4: Working Flow Route Reply Phase
Start
Node estimates Average delay and
average residual energy and add in
RREP
Forward RREP Packet
If Source
Node
If First
Packet
Estimate Cost
of the Route If packet
with better
cost arrives
Send the data
through new route
End
Send data through
first route
Yes
No
Yes
No
No
Yes
8. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
28
4. SIMULATION, RESULTS AND ANALYSIS:
4.1. Simulation Environment
Network Simulator 2.35 [23] is used to evaluate performance of proposed EFST-AODV scheme
under Ubuntu operating system. It is a discrete event object -oriented simulator. The simulation
script is written using OTCL programming language. In the scheme, Random Waypoint [24]
mobility model is used for node movement in which the node waits for a certain pause time
before it moves to a new location and constant bit rate (CBR) is used as a traffic source. Total
60 nodes are arbitrarily deployed in the simulation region of 900 m x 900 m. The simulation
parameters used in this approach are shown in Table 1.
Table 1 : Main Simulation Parameters
4.2. Performance Metrics
In order to evaluate the performance of a proposed approach, the following performance metrics
have been considered.
Packet delivery ratio: It is the proportion of total data packets received by the goal node to the
total packets generated at the source.
Throughput (in kbps): It is the number of bytes received by target node per unit of time.
Normalized routing load: It depicts the number of control packets required in sending a single
data packet from source to goal node.
Control Overheads (packets): It is the total amount of control messages generated by the
routing algorithm during entire simulation.
End-to-end delay (seconds): The average time taken by routing algorithm to transfer data
packets from source to destination is known as end-to-end delay.
A Total number of received packets: It indicates total amount of data packets received by the
destination during the entire simulation.
Simulator NS 2.35
Simulation Area 900x900
Traffic CBR
Mobility Model Random Way Point
Antenna Omni Directional
Propagation Model Two Ray Ground
Pause Time 2, 4, 6, 8, and 10 seconds
Simulation Time 100, 200, 300, 400 and 500
seconds
Number of Nodes 60
Packet Rate 5 packet/sec
Node Speed 30 m/s
Routing Protocol EFST-AODV and AODV
9. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
29
4.3. Results and Analysis
In this section, obtained results are represented in the graph and analysis of the results has been
discussed in depth. Figure 5 and 6 shows the snapshots of network animator used for
visualization purpose. Figure 5 represents the initial deployment of nodes. Figure 6 is the
snapshot taken during communication. The Encircled node represents communication range and
along with it packet dropping can also be seen in the figure.
Figure 5: Snapshot of Network Animator during node deployment
Figure 6: Snapshot of Network Animator showing communication
10. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
30
4.3.1. Impact of Varying Pause Time:
Simulation has been conducted by varying pause time to 2, 4, 6, 8 and 10 seconds in each case
with maintaining node speed to 30m/s.
Figure 7: Packet Delivery Ratio Vs Pause Time
Figure 7 illustrates the packet delivery ratio (PDR) performance of proposed and conventional
routing. Based on results the PDR of the proposed approach is 5.41% higher than conventional.
This is due to the capability of EFST-AODV in coping with the link quality by examining
distance and received signal power at receiving RREQ packets.
Figure 8: Throughput (in kbps) Vs Pause Time
11. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
31
Figure 9: Number of Received Packets Vs Pause Time
Figure 8 shows aggregated throughput performance. It can be seen that EFST-AODV
outperforms AODV. The proposed approach has 5.86 % higher throughput. Similarly, a number
of received packets is 5.67 % more than the standard AODV as shown in Figure 9. This is
because, the scheme estimates the cost in terms of distance, delay and residual energy during
route request and route reply phase which leads to an increase in rote stability and thus more
packets are delivered to the destination.
Figure 10: End to End Delay Vs Pause Time
Figure 10 depicts delay performance by varying pause time. The proposed EFST-AODV
approach has 28.57% less delay in comparison with AODV. This is because, during the route
establishment process, delay parameter is taken into account by the proposed scheme. Moreover,
the scheme provides a stable route resulting in a reduction of re-route discovery process.
12. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
32
Figure 11: Control Message Overhead Vs. Pause Time
Figure 12: Normalized Routing Load Vs Pause Time
Figure 11 and Figure 12 show control overhead and normalized routing load performance
respectively by varying pause time. In EFST-AODV the control overhead is reduced by 8.24%
when compared with standard AODV. Similarly, normalized routing load is also reduced to
11.58% as compared with conventional ones. This is because during the route request phase
inefficient nodes are filtered and thus control message load on each node in finding data packets
is reduced.
13. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
33
4.3.2. Impact of Varying Simulation Time
In the second experiment, the time of simulation was varied to 100, 200, 300, 400 and 500
seconds.
Figure 13: Packet Delivery Ratio Vs Simulation Time
Figure 13 shows the packet delivery ratio (PDR) performance of EFST-AODV and AODV. From
the graph, it can be concluded that PDR of the suggested technique is 5.36% higher than the
standard AODV. This is because; the proposed work focuses on making the route stable and
efficient which leads to less packet drop.
Figure 14: Throughput Vs Simulation Time
Figure 14 depicts throughput performance by varying simulation time. From the figure, it can be
concluded that the proposed approach achieves 7.16 % better throughput. This is due to the
reason that the proposed approach constructs a stable route by focusing on signal power, delay
and distance parameters. Consideration of these help in examining link quality more accurately
14. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
34
during route establishment thus the packets are forwarded through a more efficient link leading to
increase in throughput performance.
Figure 15: Number of Received Packets Vs Simulation Time
Figure 15 depicts performance of the proposed approach in terms of total received packets. From
the graph, it can be concluded that the number of received packets are increasing with an increase
in simulation time. The proposed approach has 4.90% higher performance in terms of received
packets as compared to AODV. This shows that the approach constructs a more stable and long-
lasting route.
Figure 16: End to End Delay Vs. Simulation Time
Figure 16 illustrates the delay performance of the EFST-AODV and AODV. There is a drastic
reduction in delay using EFST-AODV algorithm. The proposed scheme has 43.75% less delay as
compared to the standard algorithm. This is due to the reduction in occurrence of route failure as
the breakage causes initiation of a new route discovery process which ultimately increases overall
routing delay in delivering data packets.
15. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
35
Figure 17: Normalized Routing Load Vs. Simulation Time
Figure 18: Control Overhead Vs Simulation Time
The graph in Figure 17 shows the performance of routing protocols in terms of routing load. The
load in the case of the suggested EFST-AODV is 9.66% less as compared to AODV. Similarly,
the control message overhead is also reduced by 8.46 % as compared to AODV as shown in
Figure 18. This is because; the proposed approach discards those control packets that are coming
from either an efficient node or a link.
5. CONCLUSION
In this paper, an efficient and stable routing algorithm has been proposed to enhance the
performance of the AODV routing protocol. The scheme is divided into two phases route request
and route reply. During the route request phase, link quality is monitored before broadcasting the
RREQ packet. Furthermore, the cost metric for a forward route is estimated and added in RREQ
field. Similarly, during route reply phase, delay and residual energy parameters are taken into
account. By simulation study, it can be concluded that the proposed approach performs efficiently
in different network scenarios i.e. by varying pause and simulation time. The technique achieves
16. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
36
higher throughput, has better packet delivery ratio, less control message overhead, normalized
load and delay as compared to AODV. In the future, an energy conservation technique can be
incorporated which may further increase network lifetime. Moreover, security features can also
be added to improve routing performance.
CONFLICT OF INTEREST
The authors declare no conflict of interest.
REFERENCES
[1] Loo, J., Mauri, J. L., & Ortiz, J. H. (Eds.). (2016). Mobile ad hoc networks: current status and future
trends. CRC Press.
[2] Basagni, S., Conti, M., Giordano, S., & Stojmenovic, I. (Eds.). (2004). Mobile ad hoc networking.
John Wiley & Sons.
[3] Gulati, M. K., & Kumar, K. (2014). Performance comparison of mobile Ad Hoc network routing
protocols. International Journal of Computer Networks & Communications, 6(2), 127.
[4] He, G. (2002). Destination-sequenced distance vector (DSDV) protocol. Networking Laboratory,
Helsinki University of Technology, 135.
[5] Clausen, T., Jacquet, P., Adjih, C., Laouiti, A., Minet, P., Muhlethaler, P., ... & Viennot, L. (2003).
Optimized link state routing protocol (OLSR).
[6] Perkins, C., Belding-Royer, E., & Das, S. (2003). Ad hoc on-demand distance vector (AODV)
routing.
[7] Johnson, D. B., Maltz, D. A., & Broch, J. (2001). DSR: The dynamic source routing protocol for
multi-hop wireless ad hoc networks. Ad hoc networking, 5(1), 139-172.
[8] Er-rouidi, M., Moudni, H., Faouzi, H., Mouncif, H., & Merbouha, A. (2017, May). A fuzzy-based
routing strategy to improve route stability in manet based on aodv. In International Conference on
Networked Systems (pp. 40-48). Springer, Cham.
[9] Ray, N. K., & Turuk, A. K. (2009). A survey on energy-aware mac for wireless network.
[10] Dhakad, C., & Bisen, A. S. (2016, March). Efficient route selection by using link failure factor in
MANET. In 2016 International Conference on Electrical, Electronics, and Optimization Techniques
(ICEEOT) (pp. 3740-3743). IEEE.
[11] Mohammed, Y., Abdelhaq, M., & Alsaqour, R. PREDICTION ALGORITHM FOR MOBILE AD
HOC NETWORK CONNECTION BREAKS. International Journal of Computer Networks &
Communications (IJCNC) Vol.12, No.6, November 2020.
[12] Anand, M., & Sasikala, T. (2019). Efficient energy optimization in mobile ad hoc network
(MANET) using better-quality AODV protocol. Cluster Computing, 22(5), 12681-12687.
[13 ] Charu Gupta & Pankaj Sharma (2014). An Approach to Link Failure in MANET. International
Journal of Computer Science and Network Security, VOL.14 No.11.
[14] Malwe, S. R., Taneja, N., & Biswas, G. P. (2017). Enhancement of DSR and AODV protocols using
link availability prediction. Wireless Personal Communications, 97(3), 4451-4466.
[15] Pandit, K., & Singh, M. (2017). A Route Stability Routing Protocol for Improving the Performance of
AODV Routing. International Journal of Research and Scientific Innovation (IJRSI) | Volume IV,
Issue VIIS, July 2017.
[16] Kumar, R. S., & Manikandan, P. (2018). Enhancement of AODV protocol based on energy level in
MANETs. International journal of pure and applied mathematics, 118(7), 425-430.
[17] Dhandapani, Kothandaraman & C, Chellappan. (2019). Energy Efficient Node Rank-Based Routing
Algorithm in Mobile Ad-Hoc Networks. International journal of Computer Networks &
Communications. 11. 45-61. 10.5121/ijcnc.2019.11103.
[18] Er-rouidi, M., Moudni, H., Faouzi, H., Mouncif, H., & Merbouha, A. (2017, May). A fuzzy-based
routing strategy to improve route stability in manet based on aodv. In International Conference on
Networked Systems (pp. 40-48). Springer, Cham.
[19 ] Abbas, N., Ilkan, M., & Ozen, E. (2016). Fuzzy approach to improving route stability of the AODV
routing protocol. EURASIP J. Wireless Comm. and Networking, 2016, 94.
[20] Gu, C., & Zhu, Q. (2014). An energy-aware routing protocol for mobile ad hoc networks based on
route energy comprehensive index. Wireless personal communications, 79(2), 1557-1570.
17. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
37
[21] Amel, B., & Zoulikha, M. M. (2014). The effects of physical layer on the routing wireless
protocol. Wireless personal communications, 77(1), 749-765.
[22] Stepanov, I., Herrscher, D., & Rothermel, K. (2005, September). On the impact of radio propagation
models on MANET simulation results. In Proceedings of 7th International Conference on Mobile and
Wireless Communications Networks (MWCN 2005), Marrakech, Morocco.
[23] Issariyakul, Teerawat & Hossain, Ekram. (2012). Introduction to Network Simulator 2 (NS2).
10.1007/978-1-4614-1406-3_2.
[24] Bettstetter, C., Resta, G., & Santi, P. (2003). The node distribution of the random waypoint mobility
model for wireless ad hoc networks. IEEE Transactions on mobile computing, 2(3), 257-269.
AUTHORS
Priyanka Pandey received her B. Tech. and M. Tech. degree in Computer Science and
Engineering from Dr. A.P.J. Abdul Kalam Technical University, Lucknow. She is
currently pursuing her Ph.D. in the Computer Science and Engineering Department of
Harcourt Butler Technical University, Kanpur, India. Her research area is Mobile Ad hoc
Networks.
Raghuraj Singh, received his Ph.D. degree from U. P. Technical University, Lucknow,
India in 2006 and M. S. from BITS, Pilani, India in 1997. He has received B. Tech. in
Computer Science and Engineering from Harcourt Butler Technological Institute, Kanpur,
India in 1990. He is currently working as Professor at Computer Science and Engineering,
Harcourt Butler Technical University, Kanpur, India. His research interest includes
Software Engineering, Human-Computer Interaction and Mobile Ad hoc Networks. Dr.
Singh has published about 140 research papers in International Journals and Conferences including IEEE,
Springer etc.