This document summarizes a research paper that proposes a new permission-based clustering mutual exclusion algorithm for mobile ad-hoc networks. The algorithm uses a cluster-based hierarchical approach where only cluster leaders are responsible for granting or denying permission to enter the critical section, thereby reducing message complexity. Nodes are partitioned into clusters, with the heaviest weighted node selected as the cluster leader. When a node wants to enter the critical section, it sends a request to its cluster leader. If the cluster leader has obtained over 50% of the total votes, it can grant permission. Otherwise, it requests votes from other cluster leaders until it reaches the majority. This clustering approach helps solve the mutual exclusion problem in mobile ad-hoc networks in an efficient
Optimizing On Demand Weight -Based Clustering Using Trust Model for Mobile Ad...ijasuc
Mobile ad hoc networks are growing in popularity due to the explosive growth of modern
devices with wireless capability such as laptop, mobile phones, PDA, etc., makes the application more
challenging. The mobile nodes are vulnerable to security attacks. To protect the ad hoc network it is
essential to evaluate the trust worthiness. The proposed TWCA is similar to WCA in terms of cluster
formation and cluster head election. However, in WCA security features are not included. The proposed
TWCA is a cluster based trust evaluation, in which the mobile nodes are grouped into clusters with one
cluster head. It establishes trust relationship for the cluster based on the previous transaction result. The
simulation result confirms the efficiency of our scheme than the WCA and SEMC.
A New Function-based Framework for Classification and Evaluation of Mutual Ex...CSCJournals
This paper presents a new function-based framework for mutual exclusion algorithms in distributed systems. In the traditional classification mutual exclusion algorithms were divided in to two groups: Token-based and Permission-based. Recently, some new algorithms are proposed in order to increase fault tolerance, minimize message complexity and decrease synchronization delay. Although the studies in this field up to now can compare and evaluate the algorithms, this paper takes a step further and proposes a new function-based framework as a brief introduction to the algorithms in the four groups as follows: Token-based, Permission-based, Hybrid and K-mutual exclusion. In addition, because of being dispersal and obscure performance criteria, introduces four parameters which can be used to compare various distributed mutual exclusion algorithms such as message complexity, synchronization delay, decision theory and nodes configuration. Hope the proposed framework provides a suitable context for technical and clear evaluation of existing and future methods.
On the Tree Construction of Multi hop Wireless Mesh Networks with Evolutionar...CSCJournals
Abstract — in this paper, we study the structure of WiMAX mesh networks and the influence of tree’s structure on the performance of the network. From a given network’s graph, we search for trees, which fulfill some network, QoS requirements. Since the searching space is very huge, we use genetic algorithm in order to find solution in acceptable time. We use NetKey representation which is an unbiased representation with high locality, and due to high locality we expect standard genetic operators like n-point cross over and mutation work properly and there is no need for problem specific operators. This encoding belongs to class of weighted encoding family. In contrast to other representation such as characteristics vector encoding which can only indicate whether a link is established or not, weighted encodings use weights for genotype and can thus encode the importance of links. Moreover, by using proper fitness function we can search for any desired QOS constraint in the network.
Network clustering is an important technique used in many large-scale distributed systems. Given good design and implementation, network clustering can significantly enhance the system\'s scalability and efficiency. However, it is very challenging to design a good clustering protocol for networks that scale fast and change continuously. In this paper, we propose a distributed network clustering protocol SDC targeting large-scale decentralized systems. In SDC, clusters are dynamically formed and adjusted based on SCM, a practical clustering accuracy measure. Based on SCM, each node can join or leave a cluster such that the clustering accuracy of the whole network can be improved. A big advantage of SDC is it can recover accurate clusters from node dynamics with very small message overhead. Through extensive simulations, we conclude that SDC is able to discover good quality clusters very efficiently.
In recent machine learning community, there is a trend of constructing a linear logarithm version of
nonlinear version through the ‘kernel method’ for example kernel principal component analysis, kernel
fisher discriminant analysis, support Vector Machines (SVMs), and the current kernel clustering
algorithms. Typically, in unsupervised methods of clustering algorithms utilizing kernel method, a
nonlinear mapping is operated initially in order to map the data into a much higher space feature, and then
clustering is executed. A hitch of these kernel clustering algorithms is that the clustering prototype resides
in increased features specs of dimensions and therefore lack intuitive and clear descriptions without
utilizing added approximation of projection from the specs to the data as executed in the literature
presented. This paper aims to utilize the ‘kernel method’, a novel clustering algorithm, founded on the
conventional fuzzy clustering algorithm (FCM) is anticipated and known as kernel fuzzy c-means algorithm
(KFCM). This method embraces a novel kernel-induced metric in the space of data in order to interchange
the novel Euclidean matric norm in cluster prototype and fuzzy clustering algorithm still reside in the space
of data so that the results of clustering could be interpreted and reformulated in the spaces which are
original. This property is used for clustering incomplete data. Execution on supposed data illustrate that
KFCM has improved performance of clustering and stout as compare to other transformations of FCM for
clustering incomplete data.
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
The Border Gateway Protocol (BGP) provides crucial routing information for the Internet infrastructure. A problem with abnormal routing behavior affects the stability and connectivity of the global Internet. The biggest hurdles in detecting BGP attacks are extremely unbalanced data set category distribution and the dynamic nature of the network. This unbalanced class distribution and dynamic nature of the network results in the classifier's inferior performance. In this paper we proposed an efficient approach to properly managing these problems, the proposed approach tackles the unbalanced classification of datasets by turning the problem of binary classification into a problem of multiclass classification. This is achieved by splitting the majority-class samples evenly into multiple segments using Affinity Propagation, where the number of segments is chosen so that the number of samples in any segment closely matches the minority-class samples. Such sections of the dataset together with the minor class are then viewed as different classes and used to train the Extreme Learning Machine (ELM). The RIPE and BCNET datasets are used to evaluate the performance of the proposed technique. When no feature selection is used, the proposed technique improves the F1 score by 1.9% compared to state-of-the-art techniques. With the Fischer feature selection algorithm, the proposed algorithm achieved the highest F1 score of 76.3%, which was a 1.7% improvement over the compared ones. Additionally, the MIQ feature selection technique improves the accuracy by 3.5%. For the BCNET dataset, the proposed technique improves the F1 score by 1.8% for the Fisher feature selection technique. The experimental findings support the substantial improvement in performance from previous approaches by the new technique.
Optimizing On Demand Weight -Based Clustering Using Trust Model for Mobile Ad...ijasuc
Mobile ad hoc networks are growing in popularity due to the explosive growth of modern
devices with wireless capability such as laptop, mobile phones, PDA, etc., makes the application more
challenging. The mobile nodes are vulnerable to security attacks. To protect the ad hoc network it is
essential to evaluate the trust worthiness. The proposed TWCA is similar to WCA in terms of cluster
formation and cluster head election. However, in WCA security features are not included. The proposed
TWCA is a cluster based trust evaluation, in which the mobile nodes are grouped into clusters with one
cluster head. It establishes trust relationship for the cluster based on the previous transaction result. The
simulation result confirms the efficiency of our scheme than the WCA and SEMC.
A New Function-based Framework for Classification and Evaluation of Mutual Ex...CSCJournals
This paper presents a new function-based framework for mutual exclusion algorithms in distributed systems. In the traditional classification mutual exclusion algorithms were divided in to two groups: Token-based and Permission-based. Recently, some new algorithms are proposed in order to increase fault tolerance, minimize message complexity and decrease synchronization delay. Although the studies in this field up to now can compare and evaluate the algorithms, this paper takes a step further and proposes a new function-based framework as a brief introduction to the algorithms in the four groups as follows: Token-based, Permission-based, Hybrid and K-mutual exclusion. In addition, because of being dispersal and obscure performance criteria, introduces four parameters which can be used to compare various distributed mutual exclusion algorithms such as message complexity, synchronization delay, decision theory and nodes configuration. Hope the proposed framework provides a suitable context for technical and clear evaluation of existing and future methods.
On the Tree Construction of Multi hop Wireless Mesh Networks with Evolutionar...CSCJournals
Abstract — in this paper, we study the structure of WiMAX mesh networks and the influence of tree’s structure on the performance of the network. From a given network’s graph, we search for trees, which fulfill some network, QoS requirements. Since the searching space is very huge, we use genetic algorithm in order to find solution in acceptable time. We use NetKey representation which is an unbiased representation with high locality, and due to high locality we expect standard genetic operators like n-point cross over and mutation work properly and there is no need for problem specific operators. This encoding belongs to class of weighted encoding family. In contrast to other representation such as characteristics vector encoding which can only indicate whether a link is established or not, weighted encodings use weights for genotype and can thus encode the importance of links. Moreover, by using proper fitness function we can search for any desired QOS constraint in the network.
Network clustering is an important technique used in many large-scale distributed systems. Given good design and implementation, network clustering can significantly enhance the system\'s scalability and efficiency. However, it is very challenging to design a good clustering protocol for networks that scale fast and change continuously. In this paper, we propose a distributed network clustering protocol SDC targeting large-scale decentralized systems. In SDC, clusters are dynamically formed and adjusted based on SCM, a practical clustering accuracy measure. Based on SCM, each node can join or leave a cluster such that the clustering accuracy of the whole network can be improved. A big advantage of SDC is it can recover accurate clusters from node dynamics with very small message overhead. Through extensive simulations, we conclude that SDC is able to discover good quality clusters very efficiently.
In recent machine learning community, there is a trend of constructing a linear logarithm version of
nonlinear version through the ‘kernel method’ for example kernel principal component analysis, kernel
fisher discriminant analysis, support Vector Machines (SVMs), and the current kernel clustering
algorithms. Typically, in unsupervised methods of clustering algorithms utilizing kernel method, a
nonlinear mapping is operated initially in order to map the data into a much higher space feature, and then
clustering is executed. A hitch of these kernel clustering algorithms is that the clustering prototype resides
in increased features specs of dimensions and therefore lack intuitive and clear descriptions without
utilizing added approximation of projection from the specs to the data as executed in the literature
presented. This paper aims to utilize the ‘kernel method’, a novel clustering algorithm, founded on the
conventional fuzzy clustering algorithm (FCM) is anticipated and known as kernel fuzzy c-means algorithm
(KFCM). This method embraces a novel kernel-induced metric in the space of data in order to interchange
the novel Euclidean matric norm in cluster prototype and fuzzy clustering algorithm still reside in the space
of data so that the results of clustering could be interpreted and reformulated in the spaces which are
original. This property is used for clustering incomplete data. Execution on supposed data illustrate that
KFCM has improved performance of clustering and stout as compare to other transformations of FCM for
clustering incomplete data.
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
The Border Gateway Protocol (BGP) provides crucial routing information for the Internet infrastructure. A problem with abnormal routing behavior affects the stability and connectivity of the global Internet. The biggest hurdles in detecting BGP attacks are extremely unbalanced data set category distribution and the dynamic nature of the network. This unbalanced class distribution and dynamic nature of the network results in the classifier's inferior performance. In this paper we proposed an efficient approach to properly managing these problems, the proposed approach tackles the unbalanced classification of datasets by turning the problem of binary classification into a problem of multiclass classification. This is achieved by splitting the majority-class samples evenly into multiple segments using Affinity Propagation, where the number of segments is chosen so that the number of samples in any segment closely matches the minority-class samples. Such sections of the dataset together with the minor class are then viewed as different classes and used to train the Extreme Learning Machine (ELM). The RIPE and BCNET datasets are used to evaluate the performance of the proposed technique. When no feature selection is used, the proposed technique improves the F1 score by 1.9% compared to state-of-the-art techniques. With the Fischer feature selection algorithm, the proposed algorithm achieved the highest F1 score of 76.3%, which was a 1.7% improvement over the compared ones. Additionally, the MIQ feature selection technique improves the accuracy by 3.5%. For the BCNET dataset, the proposed technique improves the F1 score by 1.8% for the Fisher feature selection technique. The experimental findings support the substantial improvement in performance from previous approaches by the new technique.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
Recently, sensor networks have been used in a wide range of applications, and interest in sensor node
performance has increased. A sensor network is composed of tiny nodes with limited resources. The sensor
network communicates between nodes in a configured network through self-organization. An energyefficient security protocol with a hierarchy structure with various advantages has been proposed to
prolong the network lifetime of sensor networks. But due to structural problems in traditional protocols,
nodes located upstream tend to consume relatively high energy compared to other nodes. A network
protocol should be considered to provide minimal security and efficient allocation of energy consumption
by nodes to increase the network lifetime. In this paper, we introduce a solution to solve the bottleneck
problem through an efficient message route selection method. The proposed method selects an efficient
messaging path using GA and fuzzy logic composed of multiple rules. Message route selection plays an
important role in controlling the load balancing of nodes. A principal benefit of the proposed scheme is the
potential portability of the clustering-based protocol. In addition, the proposed method is updated to find
the optimal path through the genetic algorithm to respond to various environments. We demonstrated the
effectiveness of the proposed method through an experiment in which the proposed method is applied to a
probabilistic voting-based filtering scheme that is one of the cluster-based security schemes.
An Efficient Frame Embedding Using Haar Wavelet Coefficients And Orthogonal C...IJERA Editor
Digital media, applications, copyright defense, and multimedia security have become a vital aspect of our daily life. Digital watermarking is a technology used for the copyright security of digital applications. In this work we have dealt with a process able to mark digital pictures with a visible and semi invisible hided information, called watermark. This process may be the basis of a complete copyright protection system. Watermarking is implemented here using Haar Wavelet Coefficients and Principal Component analysis. Experimental results show high imperceptibility where there is no noticeable difference between the watermarked video frames and the original frame in case of invisible watermarking, vice-versa for semi visible implementation. The watermark is embedded in lower frequency band of Wavelet Transformed cover image. The combination of the two transform algorithm has been found to improve performance of the watermark algorithm. The robustness of the watermarking scheme is analyzed by means of two distinct performance measures viz. Peak Signal to Noise Ratio (PSNR) and Normalized Coefficient (NC).
A Novel Approach for Detection of Routes with Misbehaving Nodes in MANETsIDES Editor
Network nodes in MANET’s are free to move randomly.
Therefore, the network topology may change rapidly.
Routing protocol for MANET’s are used for delivery of data
packets from source to the desired destination, Routing protocols
are also designed based on the assumption that all the
participating nodes are fully cooperative. However, due to the
scarcely available battery based energy, node behaviours may
exist. One such routing misbehaviours is that some nodes may
be selfish by participating in route discovery and maintenance
process, but refuse to forward the packet in order to save its
energy. To solve this problem we propose a reputation based
scheme where the watch dog uses a passive overhearing of
nodes and assign a value to it as an appreciation or add nuggets
to them. In this proposal, nodes with highest value are
highly recommended for data forwarding and allow nodes to
avoid the use of misbehaving nodes in future route selection.
AdHoc On Demand Distance vector routing protocol may be
used to get the recommendation details of the node intended
to forward the packet from the neighbouring nodes. This paper
proposes a novel method to mitigate the route with misbehaving
nodes and also suggests a way to find if any intruder is
present in the cluster of participating nodes using security
aware AODV protocol.
COMPARATIVE STUDY OF CAN, PASTRY, KADEMLIA AND CHORD DHTS ijp2p
Peer-to-Peer (P2P) systems allow decentralization, sharing of all the resources of a network with direct
communication and collaboration between nodes. There are three main families of P2P networks: the
centralized architecture, the decentralized architecture that can be structured or unstructured and the
hybrid architecture. Today, there are several implementations for structured decentralized architectures.
This implies that the insertion and search algorithms are different. Among them we have; Chord, Pastry,
Kademlia, CAN(Content Addressable Network) . The choice of these DHTs (Distributed Hash Table) for an
application is made on the basis of their performances. Studies of each of these DHTs mentioned have been
done, proving their performance. But a comparative study of the four DHTs Chord, Pastry, CAN, Kademlia
has not been clearly addressed by previous works. In this paper, we have conducted a comparative
theoretical study of the DHTs Chord, Pastry, CAN, Kademlia. Then, by simulation, we have evaluated the
performances in terms of latency, number of hops and number of transmitted messages. Our study clearly
shows the differences between mathematically established performance and actual performance in an
environment with less restriction. This analysis was made from the data obtained by using the simple
network layer of the PeerfactSim simulator. This simulator abstracts the different network layers, which
gives the advantage of testing the performances with reasonable accuracy. The use of the single network
layer can be considered an ideal case because the node searches are done locally
UTILIZING XAI TECHNIQUE TO IMPROVE AUTOENCODER BASED MODEL FOR COMPUTER NETWO...IJCNCJournal
Machine learning (ML) and Deep Learning (DL) methods are being adopted rapidly, especially in computer network security, such as fraud detection, network anomaly detection, intrusion detection, and much more. However, the lack of transparency of ML and DL based models is a major obstacle to their implementation and criticized due to its black-box nature, even with such tremendous results. Explainable Artificial Intelligence (XAI) is a promising area that can improve the trustworthiness of these models by giving explanations and interpreting its output. If the internal working of the ML and DL based models is understandable, then it can further help to improve its performance. The objective of this paper is to show that how XAI can be used to interpret the results of the DL model, the autoencoder in this case. And, based on the interpretation, we improved its performance for computer network anomaly detection. The kernel SHAP method, which is based on the shapley values, is used as a novel feature selection technique. This method is used to identify only those features that are actually causing the anomalous behaviour of the set of attack/anomaly instances. Later, these feature sets are used to train and validate the autoencoderbut on benign data only. Finally, the built SHAP_Model outperformed the other two models proposed based on the feature selection method. This whole experiment is conducted on the subset of the latest CICIDS2017 network dataset. The overall accuracy and AUC of SHAP_Model is 94% and 0.969, respectively.
A Secure Data Transmission Scheme using Asymmetric Semi-Homomorphic Encryptio...IJAAS Team
The compressive detecting based information accumulation accomplishes with high exactness in information recuperation from less inspection which is available in sensor nodes. In this manner, the existing methods available in the literature diminish the information gathering cost and delays the existence cycle of WSNs. In this paper, a strong achievable security model for sensor network applications was initially proposed. At that point, a secure data collection conspire was displayed based on compressive detecting, which improves the information protection by the asymmetric semi-homomorphic encryption scheme, and decreases the calculation cost by inadequate compressive grid. In this case, particularly the asymmetric mechanism decreases the trouble of mystery key circulation and administration. The proposed homomorphic encryption permits the in-arrange accumulation in cipher domain, and in this manner improves the security and accomplishes the adjustment in system stack. Further, this paper focuses on estimating various network performances such as the calculation cost and correspondence cost, which remunerates the expanding cost caused by the homomorphic encryption. A real time validation on the proposed encryption scheme using AVISPA was additionally performed and the results are satisfactory.
A COOPERATIVE LOCALIZATION METHOD BASED ON V2I COMMUNICATION AND DISTANCE INF...IJCNCJournal
Relative positions are recent solutions to overcome the limited accuracy of GPS in urban environment.
Vehicle positions obtained using V2I communication are more accurate because the known roadside unit
(RSU) locations help predict errors in measurements over time. The accuracy of vehicle positions depends
more on the number of RSUs; however, the high installation cost limits the use of this approach. It also
depends on nonlinear localization nature. They were neglected in several research papers. In these studies,
the accumulated errors increased with time due to the linearity localization problem. In the present study,
a cooperative localization method based on V2I communication and distance information in vehicular
networks is proposed for improving the estimates of vehicles’ initial positions. This method assumes that
the virtual RSUs based on mobility measurements help reduce installation costs and facilitate in handling
fault environments. The extended Kalman filter algorithm is a well-known estimator in nonlinear problem,
but it requires well initial vehicle position vector and adaptive noise in measurements. Using the proposed
method, vehicles’ initial positions can be estimated accurately. The experimental results confirm that the
proposed method has superior accuracy than existing methods, giving a root mean square error of
approximately 1 m. In addition, it is shown that virtual RSUs can assist in estimating initial positions in
fault environments.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Asymmetric image encryption scheme based on Massey Omura scheme IJECEIAES
Asymmetric image encryption schemes have shown high resistance against modern cryptanalysis. Massey Omura scheme is one of the popular asymmetric key cryptosystems based on the hard mathematical problem which is discrete logarithm problem. This system is more secure and efficient since there is no exchange of keys during the protocols of encryption and decryption. Thus, this work tried to use this fact to propose a secure asymmetric image encryption scheme. In this scheme the sender and receiver agree on public parameters, then the scheme begin deal with image using Massey Omura scheme to encrypt it by the sender and then decrypted it by the receiver. The proposed scheme tested using peak signal to noise ratio, and unified average changing intensity to prove that it is fast and has high security.
Energy and Load Aware Routing Protocol for Internet of ThingsIJAAS Team
Maximizing the network lifetime is one of the major challenges in Low Power and Lossy Networks (LLN). Routing plays a vital role in it by minimizing the energy consumption across the networks through the efficient route selection for data transfer. IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) is a IETF standardized IPv6 routing protocol for LLN. In this paper, we propose Energy and Load aware RPL (EL-RPL) protocol, which is an enhancement of RPL protocol. It uses a composite metric, calculated based on expected transmission count (ETX), Load and battery depletion index (BDI), for the route, selection. The COOJA simulator is used for performance evaluation. EL-RPL is compared with other similar protocols RER(BDI) RPL and fuzzy logic based RPL (OF-FL RPL). The simulation result shows that the EL-RPL improves the network lifetime by 8- 12% and packet delivery ratio 2-4%.
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DE...ijcsit
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important
research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing
scheme based on social networks owing to the fact that nodes in computer networks and social networks
have high behavioural similarity. To further improve efficiency this paper also suggests a mechanism,which is the improved version of an existing betweenness centrality based routing algorithm [1]. The experiments showed that the proposed scheme has better performance than the existing friendship routing algorithms.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
Recently, sensor networks have been used in a wide range of applications, and interest in sensor node
performance has increased. A sensor network is composed of tiny nodes with limited resources. The sensor
network communicates between nodes in a configured network through self-organization. An energyefficient security protocol with a hierarchy structure with various advantages has been proposed to
prolong the network lifetime of sensor networks. But due to structural problems in traditional protocols,
nodes located upstream tend to consume relatively high energy compared to other nodes. A network
protocol should be considered to provide minimal security and efficient allocation of energy consumption
by nodes to increase the network lifetime. In this paper, we introduce a solution to solve the bottleneck
problem through an efficient message route selection method. The proposed method selects an efficient
messaging path using GA and fuzzy logic composed of multiple rules. Message route selection plays an
important role in controlling the load balancing of nodes. A principal benefit of the proposed scheme is the
potential portability of the clustering-based protocol. In addition, the proposed method is updated to find
the optimal path through the genetic algorithm to respond to various environments. We demonstrated the
effectiveness of the proposed method through an experiment in which the proposed method is applied to a
probabilistic voting-based filtering scheme that is one of the cluster-based security schemes.
An Efficient Frame Embedding Using Haar Wavelet Coefficients And Orthogonal C...IJERA Editor
Digital media, applications, copyright defense, and multimedia security have become a vital aspect of our daily life. Digital watermarking is a technology used for the copyright security of digital applications. In this work we have dealt with a process able to mark digital pictures with a visible and semi invisible hided information, called watermark. This process may be the basis of a complete copyright protection system. Watermarking is implemented here using Haar Wavelet Coefficients and Principal Component analysis. Experimental results show high imperceptibility where there is no noticeable difference between the watermarked video frames and the original frame in case of invisible watermarking, vice-versa for semi visible implementation. The watermark is embedded in lower frequency band of Wavelet Transformed cover image. The combination of the two transform algorithm has been found to improve performance of the watermark algorithm. The robustness of the watermarking scheme is analyzed by means of two distinct performance measures viz. Peak Signal to Noise Ratio (PSNR) and Normalized Coefficient (NC).
A Novel Approach for Detection of Routes with Misbehaving Nodes in MANETsIDES Editor
Network nodes in MANET’s are free to move randomly.
Therefore, the network topology may change rapidly.
Routing protocol for MANET’s are used for delivery of data
packets from source to the desired destination, Routing protocols
are also designed based on the assumption that all the
participating nodes are fully cooperative. However, due to the
scarcely available battery based energy, node behaviours may
exist. One such routing misbehaviours is that some nodes may
be selfish by participating in route discovery and maintenance
process, but refuse to forward the packet in order to save its
energy. To solve this problem we propose a reputation based
scheme where the watch dog uses a passive overhearing of
nodes and assign a value to it as an appreciation or add nuggets
to them. In this proposal, nodes with highest value are
highly recommended for data forwarding and allow nodes to
avoid the use of misbehaving nodes in future route selection.
AdHoc On Demand Distance vector routing protocol may be
used to get the recommendation details of the node intended
to forward the packet from the neighbouring nodes. This paper
proposes a novel method to mitigate the route with misbehaving
nodes and also suggests a way to find if any intruder is
present in the cluster of participating nodes using security
aware AODV protocol.
COMPARATIVE STUDY OF CAN, PASTRY, KADEMLIA AND CHORD DHTS ijp2p
Peer-to-Peer (P2P) systems allow decentralization, sharing of all the resources of a network with direct
communication and collaboration between nodes. There are three main families of P2P networks: the
centralized architecture, the decentralized architecture that can be structured or unstructured and the
hybrid architecture. Today, there are several implementations for structured decentralized architectures.
This implies that the insertion and search algorithms are different. Among them we have; Chord, Pastry,
Kademlia, CAN(Content Addressable Network) . The choice of these DHTs (Distributed Hash Table) for an
application is made on the basis of their performances. Studies of each of these DHTs mentioned have been
done, proving their performance. But a comparative study of the four DHTs Chord, Pastry, CAN, Kademlia
has not been clearly addressed by previous works. In this paper, we have conducted a comparative
theoretical study of the DHTs Chord, Pastry, CAN, Kademlia. Then, by simulation, we have evaluated the
performances in terms of latency, number of hops and number of transmitted messages. Our study clearly
shows the differences between mathematically established performance and actual performance in an
environment with less restriction. This analysis was made from the data obtained by using the simple
network layer of the PeerfactSim simulator. This simulator abstracts the different network layers, which
gives the advantage of testing the performances with reasonable accuracy. The use of the single network
layer can be considered an ideal case because the node searches are done locally
UTILIZING XAI TECHNIQUE TO IMPROVE AUTOENCODER BASED MODEL FOR COMPUTER NETWO...IJCNCJournal
Machine learning (ML) and Deep Learning (DL) methods are being adopted rapidly, especially in computer network security, such as fraud detection, network anomaly detection, intrusion detection, and much more. However, the lack of transparency of ML and DL based models is a major obstacle to their implementation and criticized due to its black-box nature, even with such tremendous results. Explainable Artificial Intelligence (XAI) is a promising area that can improve the trustworthiness of these models by giving explanations and interpreting its output. If the internal working of the ML and DL based models is understandable, then it can further help to improve its performance. The objective of this paper is to show that how XAI can be used to interpret the results of the DL model, the autoencoder in this case. And, based on the interpretation, we improved its performance for computer network anomaly detection. The kernel SHAP method, which is based on the shapley values, is used as a novel feature selection technique. This method is used to identify only those features that are actually causing the anomalous behaviour of the set of attack/anomaly instances. Later, these feature sets are used to train and validate the autoencoderbut on benign data only. Finally, the built SHAP_Model outperformed the other two models proposed based on the feature selection method. This whole experiment is conducted on the subset of the latest CICIDS2017 network dataset. The overall accuracy and AUC of SHAP_Model is 94% and 0.969, respectively.
A Secure Data Transmission Scheme using Asymmetric Semi-Homomorphic Encryptio...IJAAS Team
The compressive detecting based information accumulation accomplishes with high exactness in information recuperation from less inspection which is available in sensor nodes. In this manner, the existing methods available in the literature diminish the information gathering cost and delays the existence cycle of WSNs. In this paper, a strong achievable security model for sensor network applications was initially proposed. At that point, a secure data collection conspire was displayed based on compressive detecting, which improves the information protection by the asymmetric semi-homomorphic encryption scheme, and decreases the calculation cost by inadequate compressive grid. In this case, particularly the asymmetric mechanism decreases the trouble of mystery key circulation and administration. The proposed homomorphic encryption permits the in-arrange accumulation in cipher domain, and in this manner improves the security and accomplishes the adjustment in system stack. Further, this paper focuses on estimating various network performances such as the calculation cost and correspondence cost, which remunerates the expanding cost caused by the homomorphic encryption. A real time validation on the proposed encryption scheme using AVISPA was additionally performed and the results are satisfactory.
A COOPERATIVE LOCALIZATION METHOD BASED ON V2I COMMUNICATION AND DISTANCE INF...IJCNCJournal
Relative positions are recent solutions to overcome the limited accuracy of GPS in urban environment.
Vehicle positions obtained using V2I communication are more accurate because the known roadside unit
(RSU) locations help predict errors in measurements over time. The accuracy of vehicle positions depends
more on the number of RSUs; however, the high installation cost limits the use of this approach. It also
depends on nonlinear localization nature. They were neglected in several research papers. In these studies,
the accumulated errors increased with time due to the linearity localization problem. In the present study,
a cooperative localization method based on V2I communication and distance information in vehicular
networks is proposed for improving the estimates of vehicles’ initial positions. This method assumes that
the virtual RSUs based on mobility measurements help reduce installation costs and facilitate in handling
fault environments. The extended Kalman filter algorithm is a well-known estimator in nonlinear problem,
but it requires well initial vehicle position vector and adaptive noise in measurements. Using the proposed
method, vehicles’ initial positions can be estimated accurately. The experimental results confirm that the
proposed method has superior accuracy than existing methods, giving a root mean square error of
approximately 1 m. In addition, it is shown that virtual RSUs can assist in estimating initial positions in
fault environments.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Asymmetric image encryption scheme based on Massey Omura scheme IJECEIAES
Asymmetric image encryption schemes have shown high resistance against modern cryptanalysis. Massey Omura scheme is one of the popular asymmetric key cryptosystems based on the hard mathematical problem which is discrete logarithm problem. This system is more secure and efficient since there is no exchange of keys during the protocols of encryption and decryption. Thus, this work tried to use this fact to propose a secure asymmetric image encryption scheme. In this scheme the sender and receiver agree on public parameters, then the scheme begin deal with image using Massey Omura scheme to encrypt it by the sender and then decrypted it by the receiver. The proposed scheme tested using peak signal to noise ratio, and unified average changing intensity to prove that it is fast and has high security.
Energy and Load Aware Routing Protocol for Internet of ThingsIJAAS Team
Maximizing the network lifetime is one of the major challenges in Low Power and Lossy Networks (LLN). Routing plays a vital role in it by minimizing the energy consumption across the networks through the efficient route selection for data transfer. IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) is a IETF standardized IPv6 routing protocol for LLN. In this paper, we propose Energy and Load aware RPL (EL-RPL) protocol, which is an enhancement of RPL protocol. It uses a composite metric, calculated based on expected transmission count (ETX), Load and battery depletion index (BDI), for the route, selection. The COOJA simulator is used for performance evaluation. EL-RPL is compared with other similar protocols RER(BDI) RPL and fuzzy logic based RPL (OF-FL RPL). The simulation result shows that the EL-RPL improves the network lifetime by 8- 12% and packet delivery ratio 2-4%.
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DE...ijcsit
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important
research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing
scheme based on social networks owing to the fact that nodes in computer networks and social networks
have high behavioural similarity. To further improve efficiency this paper also suggests a mechanism,which is the improved version of an existing betweenness centrality based routing algorithm [1]. The experiments showed that the proposed scheme has better performance than the existing friendship routing algorithms.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Apresentação de lançamento da obra Vida Profissional: Lições para uma Jornada de Excelência, em Natal - RN. Livraria Saraiva Mega Store - Shopping Midway Mall.
Impact of Mobility for Qos Based Secure Manet graphhoc
Secure multicast communication in Mobile Adhoc Networks (MANETs) is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, limited resources such as bandwidth, energy and power. Several group oriented applications over MANETs create new challenges to routing protocols in terms of QOS requirements. In many multicast interactions, due to its frequent node mobility, new member can join and current members can leave at a time. It is necessary to choose a routing protocol which establishes true connectivity between the mobile nodes. The pattern of movement of members is classified into different mobility models and each one has its own distinct features. It is a crucial part in the performance of MANET. Hence key management is the fundamental challenge in achieving secure communication using multicast key distribution for mobile adhoc networks. This paper describes the impact of mobility models for the performance of a new cluster-based multicast tree algorithm with destination sequenced distance vector routing protocol in terms of QOS requirements such as end to end delay, energy consumption and key delivery ratio. For simulation purposes, three mobility models are considered. Simulation results illustrate the performance of routing protocol with different mobility models and different mobility speed under varying network conditions.
Minimum Process Coordinated Checkpointing Scheme For Ad Hoc Networks pijans
The wireless mobile ad hoc network (MANET) architecture is one consisting of a set of mobile hosts
capable of communicating with each other without the assistance of base stations. This has made possible
creating a mobile distributed computing environment and has also brought several new challenges in
distributed protocol design. In this paper, we study a very fundamental problem, the fault tolerance
problem, in a MANET environment and propose a minimum process coordinated checkpointing scheme.
Since potential problems of this new environment are insufficient power and limited storage capacity, the
proposed scheme tries to reduce the amount of information saved for recovery. The MANET structure used
in our algorithm is hierarchical based. The scheme is based for Cluster Based Routing Protocol (CBRP)
which belongs to a class of Hierarchical Reactive routing protocols. The protocol proposed by us is nonblocking coordinated checkpointing algorithm suitable for ad hoc environments. It produces a consistent
set of checkpoints; the algorithm makes sure that only minimum number of nodes in the cluster are
required to take checkpoints; it uses very few control messages. Performance analysis shows that our
algorithm outperforms the existing related works and is a novel idea in the field. Firstly, we describe an
organization of the cluster. Then we propose a minimum process coordinated checkpointing scheme for
cluster based ad hoc routing protocols.
Target Detection System (TDS) for Enhancing Security in Ad hoc Networkijdpsjournal
The idea of an ad hoc network is a new pattern that allows mobile hosts (nodes) to converse without relying
on a predefined communications to keep the network connected. Most nodes are implicit to be mobile and
communication is implicit to be wireless. Ad-hoc networks are collaborative in the sense that each node is
assumed to relay packets for other nodes that will in return relay their packets. Thus all nodes in an ad-hoc
network form part of the network’s routing infrastructure. The mobility of nodes in an ad-hoc network
denotes that both the public and the topology of the network are extremely active. It is very difficult to
design a once-for-all target detection system. Instead, an incremental enrichment strategy may be more
feasible. A safe and sound protocol should at least include mechanisms against known assault types. In
addition, it should provide a system to easily add new security features in the future. Due to the
significance of MANET routing protocols, we focus on the recognition of attacks targeted at MANET
routing protocols.
Intrusion detection techniques for cooperation of node in MANET have been chosen as the security
parameter. This includes Watchdog and Path rater approach. It also nearby Reputation Based Schemes in
which Reputation concerning every node is measured and will be move to every node in network.
Reputation is defined as Someone’s donation to network operation. CONFIDANT [23], CORE [25],
OCEAN [24] schemes are analyzed and will be here also compared based on various parameters.
Cluster Based Misbehaviour Detection and Authentication Using Threshold Crypt...CSCJournals
In mobile ad hoc networks, the misbehaving nodes can cause dysfunction in the network resulting in damage of other nodes. In order to establish secure communication with the group members of a network, use of a shared group key for confidentiality and authentication is required. Distributing the shares of secret group key to the group members securely is another challenging task in MANET. In this paper, we propose a Cluster Based Misbehavior Detection and Authentication scheme using threshold cryptography in MANET. For secure data transmission, when any node requests a certificate from a cluster head (CH), it utilizes a threshold cryptographic technique to issue the certificate to the requested node for authentication. The certificate of a node is renewed or rejected by CH, based on its trust counter value. An acknowledgement scheme is also included to detect and isolate the misbehaving nodes. By simulation results, we show that the proposed approach reduces the overhead.
A Survey on the Mobile Sink Hierarchical Routing Protocols in the Wireless Se...Eswar Publications
The wireless sensor/actor network (WSAN) is a network of many small nodes in which there are a number of sensor/actor. The sensor/actor has intense interaction with the physics environment. It receives the information of the environment through the sensors and then reacts through the actors. The relation between the nodes is wireless. Each node works independently and without the interference of human and is usually small with limitations in the processing power, memory capacity, power supply, etc. The main task of a wireless sensor
network is gathering information from the under covered area. These information are gathered by the sensors and are transferred based on the routine algorithms to the sink. The sensors in the sensor wireless networks have limitations such as energy and computational power. We explain a general review of the mobile sink hierarchial routing protocols in the wireless sensor networks and then compare each of these methods.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
CONTENT BASED DATA TRANSFER MECHANISM FOR EFFICIENT BULK DATA TRANSFER IN GRI...ijgca
A new class of Data Grid infrastructure is needed to support management, transport, distributed access, and analysis of terabyte and peta byte of data collections by thousands of users. Even though some of the existing data management systems (DMS) of Grid computing infrastructures provides methodologies to handle bulk data transfer. These technologies are not usable in addressing some kind of simultaneous data
access requirements. Often, in most of the scientific computing environments, a common data will be needed to access from different locations. Further, most of such computing entities will wait for a common scientific data (such as a data belonging to an astronomical phenomenon) which will be published only
when it is available. These kinds of data access needs were not yet addressed in the design of data component Grid Access to Secondary Storage (GASS) or GridFTP. In this paper, we address an application layer content based data transfer scheme for grid computing environments. By using the
proposed scheme in a grid computing environment, we can simultaneously move bulk data in an efficient way using simple subscribe and publish mechanism.
APPLICATION OF GENETIC ALGORITHM IN DESIGNING A SECURITY MODEL FOR MOBILE ADH...cscpconf
In recent years, the static shortest path (SP) problem has been well addressed using intelligent
optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle
swarm optimization, etc. However, with the advancement in wireless communications, more and
more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks
(MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile
wireless networks is the topology dynamics, i.e., the network topology changes over time due to
energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to
be a dynamic optimization problem. GA's are able to find, if not the shortest, at least an optimal
path between source and destination in mobile ad-hoc network nodes. And we obtain the alternative path or backup path to avoid reroute discovery in the case of link failure or nodeex
DIVISION AND REPLICATION OF DATA IN GRID FOR OPTIMAL PERFORMANCE AND SECURITYijgca
Using Grid Storage, users can remotely store their data and enjoy the on-demand high quality applications and services from a shared networks of configurable computing resources, without the burden of local data storage and maintenance. In this project based on the dynamic secrets proposed design an encryption scheme for SG wireless communication, named as dynamic secret-based encryption (DSE). Dynamic encryption key (DEK) is updated by XOR the previous DEK with current DS. In this project based on the dynamic secrets proposed design an encryption scheme for SG wireless communication, named as dynamic secret-based encryption (DSE). The basic idea of dynamic secrets is to generate a series of secrets from unavoidable transmission errors and other random factors in wireless communications In DSE, the previous packets are coded as binary values 0 and 1 according to whether they are retransmitted due to channel error. This 0/1 sequence is called as retransmission sequence (RS) which is applied to generate dynamic secret (DS). Dynamic encryption key (DEK) is updated by XOR the previous DEK with current DS.
DIVISION AND REPLICATION OF DATA IN GRID FOR OPTIMAL PERFORMANCE AND SECURITY
D24019026
1. Abhilasha Gupta, B.V.R. Reddy, Udayan Ghosh, Ashish Khanna / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.019-026
A Permission-based Clustering Mutual Exclusion Algorithm for
Mobile Ad-Hoc Networks
Abhilasha Gupta*, B.V.R. Reddy **, Udayan Ghosh***, Ashish Khanna****
*, **, *** (University School of Information Technology, Guru Gobind Singh Inderprastha University, New Delhi)
**** (M.A.I.T, Guru Gobind Singh Inderprastha University, New Delhi)
ABSTRACT
In the last ten years a lot of research has algorithms proposed for static distributed systems
been done on resource allocation in Ad-hoc needs to be modified before these can be applied in
networks. The Classical approaches of mutual mobile computing environment. For that purpose,
exclusion and its variants need to be modified to they proposed two-tier principle to restructure the
suit the dynamic topology, low bandwidth and low distributed algorithms to make them suitable for
processing capabilities of mobile ad-hoc network mobile environment. Moreover, MANETs are an
(MANET).The distributed mutual exclusion in important class of mobile computing systems and
MANETs is comparatively less explored area of because of its infrastructure less nature two-tier
research. In this paper, we propose a new principal cannot be applied directly to MANETs.
approach for mutual exclusion in MANETs which Hence, the algorithms required to solve a resource
is based on clustering and the concept of weight allocation problem in MANETs, has to be designed
throwing. The algorithm uses cluster based considering the special characteristics of MANETs.
hierarchal approach which also helps in reducing Mutual exclusion (MUTEX) is a fundamental
the message complexity of the algorithm. problem in distributed systems, where collections of
nodes intermittently need entering the Critical Section
Keywords - Ad-hoc network, Clustering, Critical (CS) in order to exclusively process few critical
Section, Mutual Exclusion (MUTEX), Voting operations, e.g. accessing the shared resource. A
solution to the MUTEX problem must satisfy the
1. Introduction following three correctness properties:
(i) Mutual Exclusion (safety): No two processes can
A mobile ad- hoc networks is a network be inside their CS simultaneously.
which has no fixed infrastructure and is combination (ii) Deadlock Free (liveness): At any point of time, at
of mobile nodes and some immobile infrastructure. least one node able to take an action and enter CS.
Ad-hoc network has dynamic topology. Nodes in ad- (iii) Starvation Free (Fairness): Every node wanting
hoc system can communicate directly only with the to enter CS must eventually be able to enter CS.
nodes that are immediately within their transmission
The performance of a mutual exclusion (ME)
range. To communicate with the other nodes, an
algorithm can be judged based upon various
intermediate node is required to forward the packet
performance parameters like Waiting time,
from the source to the destination. Therefore, in ad
Synchronization delay, Message complexity,
hoc system, nodes are required to cooperate in order
Message size [2].
to maintain connectivity and each node may act as a
router in routing data through the network. Permission-based algorithms [3] need cycles of
Commonly suggested applications for MANETs message exchange among the nodes to get the
include disaster management, Battlefields, and permission to enter CS. The main concept on which
environmental data collection. Although lots of permission-based algorithms are based is as follows:
hardware challenges have been solved, programming When a process wants to execute its CS, it sends
application for MANETs remains a tedious task. request to other nodes for their permission. A process
on getting a request, it grants permission if it is not
The resource allocation problem is one of the most interested in CS. If it is interested in CS, the priority
important problems in MANETs. However, according of the incoming request is located against its own
to Badrinath-Acharya-Imelinski [1], due to the special request. Commonly, priority decisions totally depend
characteristics of mobile computing environment, the upon the timestamps. Total ordering of events is done
with the help of Lamport’s [4] logical clocks for
having clear time difference between the request time
19 | P a g e
2. Abhilasha Gupta, B.V.R. Reddy, Udayan Ghosh, Ashish Khanna / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.019-026
stamps. Permission-based algorithms can be further one performance metric or the other. Based on the
classified into coterie-based algorithms and voting- technique used, DME algorithms can be classified as
based algorithms. In voting-based algorithms, each token based algorithms and permission-based
node in the current system is allocated a vote (a algorithms as suggested by Raynal [13], or as token-
nonnegative integer). A node wanting access to CS based algorithms and non-token-based algorithms as
must get permission from a suitable number of nodes, suggested by Singhal [14].In token-based algorithms,
i.e., a number of nodes whose total votes comprises a a token is passed among all the nodes. A node is
majority of the total number of votes allocated to the allowed to enter the CS only if it possesses the token.
system. In coterie-based algorithms, a group of sets In a permission-based algorithm, the node requesting
(of the nodes of the system), called a coterie, is pin to for the CS must first obtain the permissions from
the system. A node wanting access to CS must get other nodes by exchanging messages. Some examples
permission from each and every node of a set from of token-based algorithms are Helary et al.’s [15] and
the coterie. Each of these two categories may further Suzuki and Kasami’s [16] algorithms (broadcast
be classified into static and dynamic algorithms .The based, static), Singhal’s [17] and Yan et al.’s [18]
paper [5] is proposed for solving the Group mutual algorithms (broadcast-based, dynamic), Raymond’s
exclusion (GME) by using clustering concept. In [6] [19] and Neilson and Mizuno’s [20] algorithms
[7], R.Mellier et J-F. Myoupo and Stefano Basagni (logical structure-based, static) and Chang et al.’s
have presented a MUTEX protocol for MANETs [21], Helary et al.’s [22] and Naimi et al.’s [23]
which takes advantages of the cluster structure algorithms (logical structure-based, dynamic).
offered by the partitioning techniques. During the past several years, algorithms for solving
This paper is organized as follow: the section 2 the mutual exclusion problem in MANETs have been
discusses related work and the basic idea of proposed. The entire algorithm makes use of a token
clustering concept. Section 3 presents our proposed circulated along a logical ring or passed in a logical
algorithm & its pseudo code. We prove the algorithm tree consisting of all the nodes.
correctness in section 4. Section 5 gives the A token-based mutual exclusion algorithm, named
performance analysis of proposed algorithm. RL (Reverse link) [24], for ad-hoc network is
Conclusion and future work are offered in section 6. proposed. In the RL algorithm, when a node wishes
to access the shared resource, it sends a request
.2. Related work message along one of the communication link. The
The origin of the mutual exclusion problem RL algorithm totally orders nodes so that the lowest
can be traced back to 1965 when Dijkstra [8] ordered node is always the token holder. The
described and solved the mutual exclusion problem. algorithm guarantees the safety and liveness property.
Dijkstra stated that any solution to the mutual But it did not guarantee the network partitioning.
exclusion problem must satisfy 4 constraints. Malpani et al [25] proposed a parametric token based
Dijkstra’s algorithm guaranteed mutual exclusion and algorithm with many variations. In the algorithm, a
was deadlock- free, but it did not guarantee fairness. dynamic logical ring is imposed on the nodes the
That is, it was possible that a process seeking access successor of a node in the ring is computed on- the-
to its critical section waited indefinitely while others fly.
entered and exited their critical sections frequently. Weigang Wu et al [26] proposed the first permission-
Knuth [9] proposed the first fair solution to the based MUTEX algorithm for MANETs. In order to
mutual exclusion problem. Thereafter, a number of reduce the message cost, the algorithm uses the so
algorithms were proposed which guaranteed mutual called”look-ahead” technique, which enforces
exclusion and were deadlock- free and fair. Each of MUTEX only among the hosts currently competing
these algorithms aimed at improving performance in for the critical section (C.S). The algorithm is based
terms of synchronization delay, the period of time on the well-known Ricart-Agrawala algorithm [27] in
between the instant a site invokes mutual exclusion which, when a nodes wants to enter CS, it sends a
and the instant when it enters CS. Some of these request to all the other nodes to collect permissions.
algorithms are De Bruijns’s algorithm [10], Several MUTEX algorithms for MANETs have been
Eisenberg and McGuire’s algorithm [11] and proposed and nearly all of them use the token- based
Peterson’s algorithm [12]. All these algorithms were approach [28] [29] [25] [30]. Compared with the
designed for the centralized systems, the systems permission-based approach [26], the token-based
possessing a central memory that all processes can approach has many desirable features, e.g. nodes only
access simultaneously for reading and writing. need to keep the information about their neighbors
A number of DME algorithms have been developed, and few messages are needed to pass the privilege of
all aiming at enhanced performance with respect to entering CS. Both token-circulating (ring-based) and
token-asking (tree-based or graph-based) approaches
20 | P a g e
3. Abhilasha Gupta, B.V.R. Reddy, Udayan Ghosh, Ashish Khanna / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.019-026
have been used in MUTEX algorithm for MANETS. the weight of a node, the better that node for the role
The fatal problem of token loss makes these of clusterleader [5].The main benefit of this approach
algorithms not robust. In MANETs, the mobility and is that, by representing with the weights mobility-
disconnections of nodes make token loss a more related parameters of the nodes, we can pick for the
serious problem and the maintenance of a tree or ring role of clusterleader those nodes that are better suited
topology more difficult. for that role. For instance, when the weight of a node
Compared with the token-based approach, permission is inversely proportional to its speed, the less mobile
based algorithm have the following advantages:- nodes are confirmed to be clusterleader. Since these
There is no need to maintain the logical nodes either do not moves or move lesser than the
topology to pass the token. other nodes, their cluster is guaranteed to have a
There is no need to propagate any message durable life, and consequently the overhead attached
if no node request to enter CS. with the cluster maintenance in the mobile
These advantages make the permission-based environment is reduced.
approach will suitable for MANETs where all the
resources, e.g. the network bandwidth and the battery 2.2 Initialization of clusters
power of the nodes are limited. Initially out of all nodes heaviest weight node is
A problem of the permission-based approach is the chosen, after which nodes in direct range of that node
large number of message to be exchanged between forms a cluster and this process is repeated till all
the nodes. Therefore to design a efficient permission- nodes are part of any cluster.
based algorithm , we use the “clustering concept”, in
which only clusterleader of the respective cluster is 3. ALGORITHM
responsible for taking & giving the permission to The algorithm is assumed to execute in a
enter the CS, which reduce the number of message system consisting of n nodes and m clusters, each
exchanged among the clusterleaders. cluster contains one clusterleader. Nodes are labeled
as 0, 1…….n-1, and clusterleaders are labeled as 0,
1……m-1. We assume there is a unique time-stamp
2.1Clustering Concept generated with every “Req_CS” message by node i.
Partitioning the nodes in to cluster is called 3.1 Assumptions
clustering. In addition, clustering is crucial for This algorithm takes the following assumptions on
managing the spatial reuse of the shared channel, for the mobile nodes and clusters.
reducing the amount of data to be exchanged in order All nodes have unique ids.
to maintain routing and control information in a No new cluster will be formed after
mobile environment, as well as for constructing and initialization.
maintaining cluster-based virtual network A link level protocol ensures that each node
architecture. In existing solutions for clustering of ad- is aware of the set of nodes with which it
hoc networks [5], the clustering is performed in two can currently communicate by providing
phases: clustering initialization and clustering indications of link formation and failures.
maintenance. Each cluster comprises clusterleader Global synchronize clock is maintained on
and in-range nodes (direct communicates with its each node.
own clusterleader).A clustering algorithm is required Each node has inbuilt singleton vote.
to partition the nodes of the network so that the Node can move in their respective cluster
following ad-hoc clustering properties are satisfied: only.
I. Every in-range node has at least a No node can move while the cluster
clusterleader as neighbor (dominance formation is in progress.
property). Each node has a different weight.
II. Every in-range node affiliates with the No two clusters overlap with each other.
neighboring clusterleader that has the bigger
weight.
III. No two clusterleader can be neighbors 3.2 Requirements
(independence property) As all nodes have singleton vote allocated to them, so
a node can enter C.S only when its respective
Election of clusterleader depends either on the basis clusterleader acquire more than 50% of singleton
of lower id or on the basis of weight. Weight based vote of whole system. Equation (1) should be met
criteria is better way of deciding clusterleader rather accordingly if value of weight is even or odd.
than deciding it on the basis of lower id. The heavier
21 | P a g e
4. Abhilasha Gupta, B.V.R. Reddy, Udayan Ghosh, Ashish Khanna / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.019-026
Req_CS(): when a node i whishes to enter
the CS. It send out Req_CS() to the its own
clusterleader.
Cluster_Vote: a message used for
clusterleaders to transfer their singleton vote
Where Majζ: number of majority weighted votes in for giving the permission to enter the CS to
the system. requesting clusterleader.
Gives the total number of Allow_CS (): a message for node to enter the
singleton CS. This message is received by requesting
votes in the system. node from its own clusterleader.
Vi = singleton vote of node i. Release (): a message for node i to release
the CS, it sends Release () to the own
3.3 Data structures clusterleader.
3.3.1Data structures of clusterleader Release_Cluster_Vote: when a requested
1. Status: - indicate whether node is in the clusterleader’s request queue = φ, then it
Remainder, Waiting or C.S. Initially status will return their vote to the respective
= Remainder clusterleader which has given permission.
2. Clust_idi:- id of a particular clusterleader.
3. Clust_Vi:- Each clusterleader has singleton 3.5 Principle of the algorithm
vote. Singleton vote associated to In this paper, a mutual exclusion algorithm is
Clusterleader is used it to give permission. proposed which is permission based. This algorithm
4. Clust_Rqi:- Request list stores the request of works on the concept of clustering and uses a voting
all nodes of cluster’s and requests Received based hierarchal approach. Here initialization is done
by other clusterleaders of their respective on the basis of weight throwing scheme [5]. Where
nodes with their unique time stamp. one by one cluster are made till the last node is part
5. Clusteri: - The set of all nodes id in direct of any cluster and each cluster has one clusterleader.
wireless contact with clusteri. Total number of nodes in the cluster decides the
6. Allower_infoi:- The set of all clusterleaders number of votes acquired by any clusterleader. Each
with their respective singleton vote which node in the system can send its request only to its
have allowed the requesting cluster to enter respective clusterleader which further forwards that
C.S. to the other clusterleader for getting more than half
7. Clust_Tot_Vote:- total singleton vote of in- number of votes to allow its requesting node to enter
range nodes of clusteri. to enter C.S. Each clusterleader maintains request list
SYS_Tot_Vote:- total singleton vote of the of whole system. Request generated has unique time
system. stamp dependency upon lamport’s logical clock [4].
8. Allow:- Boolean array indicating whether The proposed algorithm is event-driven. An event at
the cluesterleader has given permission to node i consists of receiving a message from
requesting node or not. clusterleader. Each event triggers a procedure, which
Initially Allow ≠ TRUE (has not given is assumed to be executed atomically. Below, we
permission) present the overview of the event-driven procedure.
Allow = TRUE (has given Node i wants to enter CS:
permission) When node i want to enter the CS, it first sets T_Sreq
3.3.2 Data structures of nodei to the current time and sends the “Req_CS” message
1. N_idi :- Each node has unique identifier. to the clusterleader and sets status to waiting.
2. N_Vi :- The singleton vote allocated to node Cluster leader i receives request from node
i. j:
3. T_Sreq :- Unique time stamp at which the When a Req_CS (j, T_Sreq) message sent by a node j
request is generated that is also used to set is received at clusterleader i.
the priority of request with which they will Request stored in request-queue of clusterleader i
be served. with its time-stamp and node id. if the singleton vote
4. Status:- indicate whether node is in the of cluster i is greater than half of the total system
Remainder, Waiting or C.S. Initially status = singleton vote and Allow ≠ TRUE then clusterleader i
Remainder sends “Allow_CS” message to requesting node j and
5. Clusterleader_infoi:-Clusterleader_infoi list sets Allow = TRUE otherwise it sends
maintain the information about clusteri Req_CS(nid,T_Sreq) to all clusterleader.
3.4 Message used in the algorithm
22 | P a g e
5. Abhilasha Gupta, B.V.R. Reddy, Udayan Ghosh, Ashish Khanna / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.019-026
Cluster leader i receives request from
clusterleader j T_Sreqi = t1 (current value of clock)
When a Req_CS (nid, T_Sreq) message sent by a State: = Waiting
clusterleader j is received at clusterleader i, if the
request list of clusterleader i is empty and Allow ≠ Node i send Req_CS (nid, T_Sreq) to clusterleader j.
TRUE then its sends the Cluster_Vote (Clust_id,
Clust_Tot_Vote) to requesting clusterleader j and sets 2. Clusterleader i receives request from
Clust_Tot_Votei = 0, sets Allow = TRUE otherwise node j
insert the request in the request list at its appropriate
position after sorting the list. Request stored in request_list of clusterleader with its
Clusterleader i receives singleton vote timestamp and node id.
message from Clusterleader j.
When Cluster_Vote (Clust_id, Clust_Tot_Vote) If (Clust_Tot_Vote > ½ SYS_Tot_Vote) && Allow
message sent by a clusterleader j is received by ≠ TRUE
clusterleader i. clusterleader i increments the value of {
its own singleton vote by adding the singleton vote of Send Allow_CS() to node j
cluster j. if the singleton vote of clusterleader i is Allow: = TRUE
greater than the half of the total singleton vote of the }
system and Allow ≠ TRUE then it sends the Else
Allow_CS message to lowest T_Sreq node and set {
Allow = TRUE otherwise wait for the new request. Send Req_CS (nid, T_Sreqi) to all clusterleader.
Node i receives Allow_CS message from }
clusterleader j:
When node i received Allow_CS message from 3. Clusterleader i receives request from
clusterleader j. node i sets status = C.S. and enter clusterleader j
C.S.. After processing it come out from C.S.
Node i exits from the C.S: If (Cluster_reqi = φ && Allow ≠ TRUE)
When node i comes out from the C.S. it sends {
“Release” message to clusterleader j and sets status = Send Cluster_ Vote (Clust_Tot_Vote) to clusterleader
Remainder. j
Clusterleader i receives release message Set Clust_Tot_Vote = 0
from node j: Set Allow = TRUE
When “Release” message sent by a node j is received
by clusterleader i. firstly clusterleader sets Allow ≠ // comparison made between the time-stamp of
TRUE after that it checks request list and send arrived request and request which is positioned at the
“Release_Cluster_Vote” message to the other top on the list //
clusterleader or to its any other node whichever is Else if ( T_Sreqi < T_Sreqi)
having lowest time stamp. {
“Release_Cluster_Vote” message is Send Cluster_Vote (Clust_Tot_Vote) to clusterleader
received by clusterleader i. j
When “Release_Cluster_Vote” message is received Else
by clusterleader i. clusterleader i restore the value if {
its own singletons vote. If the request list of Insert the request in the request list at its appropriate
clusterleader i is not empty and the singleton vote of position after sorting the list.
clusterleader i is greater than the total singleton vote }
of the system and Allow ≠ TRUE then it sends }
“Allow_CS” message to that node having lowest }
T_Sreq.
Pseudo code: Clustering Permission based MUTEX 4. Cluster leader i receives vote message
algorithm, code for ni. from clusterleader j.
1. Node i wants to enter C.S:
// clusterleader i updates the value of its own
Initially when node i wants to enter C.S then singleton vote//
timestamp at which request is generated is also stored
and forwarded to respective clusterleader. Clust_Tot_Votei=Clust_Tot_Votei+ Clust_Tot_Vote j
23 | P a g e
6. Abhilasha Gupta, B.V.R. Reddy, Udayan Ghosh, Ashish Khanna / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.019-026
(Current) (Received In this section we prove the correctness of the
vote) proposed algorithm that the three correctness
requirements for distributed MUTEX algorithm are
If(Clust_Tot_Votei > ½ SYS_Tot_Vote && Allow satisfied.
≠ TRUE) Lemma 5.1 Once the node i want to enter the C.S. it
{ eventually gets the access of C.S. [4].
Send Allow_CS () to lowest T_Sreq node. Node i enter the CS when the following three
Set Allow = TRUE conditions are satisfied:
Else
{ L1: Clusterleader of ni has received a message with
Wait for additional singleton vote timestamp larger than (T_Sreqi, i) from all other
} clusterleader.
}
5. Node i receives allow message from L2: Node ni has lowest timestamp.
clusterleader j
L3: Respective Cluster leader should have majority
State = C.S votes
Enter C.S (Equation 1)
Exit C.S
Theorem 1: At most one node can be in the CS at any
6. Node i exits from the C.S time (safety).
Argument: we prove the theorem by contradiction.
Node i send_ Release () to clusterleader j Assuming two nodes ni and nj are executing the CS
State: = Remainder simultaneously. From equation (1), every requesting
node must have more than 50% of singleton votes of
7. Clusterleader i receives release message the total system vote. If both ni and nj are in CS
from node j simultaneously, means both have 51% of majority
singleton votes which sums up to102%. However,
Set Allow ≠ TRUE total singleton votes of the system can never be
exceeds by 100%.This is a contradiction.
Checks request queue and send
Release_Cluster_Vote () to the other clusterleader or Theorem 2: The algorithm is deadlock- free
to its any other node whichever is having lowest time (liveness).
stamp. Argument: A deadlock occurs when there is a circular
wait and there is no “RELEASE” in transit. This
8. When Release_Cluster_Vote () message is means that each node in the cycle is waiting for a
received by clusterleader i. “RELEASE” from its successor node in the
respective request queue. According to our
Clust_Tot_Votei = Clust_Tot_Votei (received vote) assumption each node has unique timestamp. Our
(Current vote) algorithm says eventually each request with unique
timestamp will be added to every request list.
Therefore we can say that request list is maintained
If (Clust_Tot_Votei > ½ SYS_Tot_Vote && Allow ≠ globally. Above discussion proves that to allow a
TRUE) node to enter CS will be a global decision without
{ any deadlock.
Send Allow_CS () to that node having lowest
T_Sreq. Theorem 3: The algorithm is starvation-free
} (fairness).
Proof A proposed mutual exclusion algorithm for
Else MANETs is fair if the requests for CS are executed in
{ the order of their timestamps [4]. Whenever a node
Wait for the new request request for CS its request is forwarded to all the
} cluster leaders eventually with the respective unique
4. Correctness of the proposed algorithm timestamp, therefore clusterleaders are able to come
to the global decision that which requests time stamp
is lowest. In response to this decision eventually
24 | P a g e
7. Abhilasha Gupta, B.V.R. Reddy, Udayan Ghosh, Ashish Khanna / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.019-026
every request gets fair chance to enter CS in order. Synchronizatio 2T 2T(m+1
The proof is by contradiction. Suppose a node ni’s n delay )
request has a smaller timestamp than the request of
another node nj and nj is able to execute the CS Table (2)
before ni. For nj to execute the CS, it has to satisfy the
conditions L1 L2 and L3 (by lemma 5.1). This Where, T is the maximum message propagation
implies that at some instant in time nj has its own delay.
request at the top of its queue and it has also received
a message with timestamp larger than the timestamp m is the number of clusterleader.
of its request from all other nodes. But request_list at
a node is ordered by timestamp, and according to our n is the number of nodes.
assumption ni has lower timestamp. So ni’s request
must be placed ahead of the nj’s request in the 6. Conclusion and Future Work
request_listj. This is a contradiction. Hence this In this paper, we described a permission-
algorithm is starvation-free mutual exclusion based clustering mutual exclusion algorithm in
algorithm. mobile ad-hoc networks. To reduce the number of
messages exchanged, the “Clustering concept” is
5. Performance Analysis of Algorithm used. This algorithm is independent from logical
In this section, the performance of proposed topology so as to reduce the cost of maintaining
algorithm has been analyzed with respect to the logical topology. Simulation is left as a future
following performance metrics, namely, message work.
complexity, message size, waiting time,
synchronization delay.
Message size: The size of message used in proposed REFERENCES
algorithm has been given in the table (1). [1] B. R. Badrinath, A. Achaya, and T. Imielinski,
Desinging Distributed Algorithm for Mobile
Message type Size Computing Networks. Computer
Communication, Vol. 19, No. 4, April 1996.
Req_CS O(1) [2] A.Swaroop, Efficient group mutual exclusion
protocols for message passing distributed
Allow_CS O(1) computing system, doctoral diss, National
institute of technology, Kurukshetra, India,
Cluster_Vote O(m) 2009.
[3] Saxena, P.C., Rai, J., A survey of permission-
Release_CS O(1) based distributed mutual exclusion algorithms.
Computer standards & interfaces, vol. 25, no.
Release_Cluster_Vote O(m) 2, pp. 159-181, 2003.
Table (1) [4] Lamport, L., Time, clocks, and the ordering of
events in a distributed systems.
Performance parameter: the performance
Communications of the ACM, vol. 21, no. 7,
parameter used in proposed algorithm has been given
pp. 558-565, 1978.
in the table (2)
[5] Ousmane thiare and Mohamed Naimi. “A
Performance Best case Averag Worst Weight- throwing Clustering Group Mutual
parameter e case case Exclusion Algorithm for Mobile Ad Hoc
Networks” International Journal of Digital
Waiting time 2T 2T(m+1
Content Technology and its Applications.
)
Volume 5, Number 4, April 2011.
Message 0 if O(n) [6] Romain Mellier and Jean-Frederic Myoupo,
complexity clusterleade “A clustering mutual exclusion protocol for
r itself. multi-hop mobile ad hoc networks”, Networks,
2005. Jointly held with the 2005 IEEE 7th
O(2) if any Malaysia International Conference on
node Communication., 13th IEEE International
Conference, 6 pages, 2005.
25 | P a g e
8. Abhilasha Gupta, B.V.R. Reddy, Udayan Ghosh, Ashish Khanna / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.019-026
[7] Stefano Basagni, “Distributed clustering for ad [21] Y.I. Chang, M. Singhal, M.T. Liu, An
hoc networks”, Proceedings of I-SPAN, improved o(log(n))mutual exclusion algorithm
Australia 1999. for distributed systems, International
[8] E.W. Dijkstra, Co-operating sequential Conference on Parallel Processing,pp.295–
processes, in: F. Genuys (Ed.), Programming 302,1990.
Languages, Academic Press, New York, pp. [22] M. Helary, A. Mostefaoui, M. Raynal, A
43–112, 1965. general scheme for token and tree based
distributed mutual exclusion algorithms, IEEE
[9] D.E. Knuth, Additional comments on a Transactions on Parallel and Distributed
problem in concurrent programming control, Systems 5 (11),pp. 1185– 1196,1994.
Communications of the ACM 9 (5), pp.321– [23] M. Naimi, M. Trehel, A. Arnold, A log(n)
322, 1966. distributed mutual exclusion algorithm based
on path reversal, Journal of Parallel and
[10] J.G. De Bruijn, Additional comments on a Distributed Computing 34,pp.1 – 13,1996.
problem in concurrent programming control, [24] Jennifer Walter, Jennifer Welch and Nitin
Communications of the ACM 10 (3), pp.137– Vaidya, “A mutual exclusion algorithm for ad
138, 1967. hoc mobile network”, In Journal of Wireless
Networks, vol. 7, pp. 585-600, 2001.
[11] M.A. Eisenberg, M.R. McGuire, Further [25] N.Malpani, N. H. Vaidya and J. L. Welch,
comments on Dijkstra’s concurrent Distributed Token Circulation on Mobile Ad
programming control problem, Hoc Networks, Technical report, Intel
Communications of the ACM 15 (11) (1972) Corporation 505 E. Huntland Dr. Suite 550,
999. Austin TX 78752.
[12] G.L. Peterson, Myths about the mutual [26] Wu, W., Cao, J., Yang, J.: A Scalable Mutual
exclusion problem, Information Processing Exclusion Algorithm for Mobile Ad Hoc
Letters 12 (3), pp.115– 116, 1981. Networks. In: Proc. of ICCCN (2005).
[13] M. Raynal, A simple taxonomy for distributed [27] G. Ricart and A. Agrawala, An optimal
mutual exclusion algorithms, ACM Operating algorithm for mutual exclusion in computer
Systems Review 23 (2), pp. 47–51, 1991. networks, Communications of the ACM, vol.
[14] M. Singhal, taxonomy of distributed mutual 24, no. 1,pp. 9-17,1981.
exclusion, Journal of Parallel and Distributed [28] Baldoni, R., Virgillito, A., Petrassi, R.: A
Computing 18, pp. 94–101, 1993. Distributed Mutual Exclusion Algorithm for
[15] M. Helary, N. Plouzeau, M. Raynal, A Mobile Ad-Hoc Networks. In: Proc. of ISCC
distributed algorithm for mutual exclusion in (2002).
an arbitrary network, The Computer Journal [29] Benchaïba, M., Bouabdallah, A., Badache, N.,
31 (4), pp. 289– 295, 1988. Ahmed-Nacer, M.: Distributed Mutual
[16] I. Suzuki, T. Kasami, A distributed mutual Exclusion Algorithms in Mobile Ad Hoc
exclusion algorithm, ACM Transactions on Networks: an Overview. ACM SIGOPS
Computer Systems 3 (4), pp. 344–349, 1985. Operating Systems Review 38(1) (2004).
[17] M. Singhal, A heuristically aided algorithm for [30] Walter, J., Kini, S.: Mutual Exclusion on
mutual exclusion in distributed systems, IEEE Multihop, Mobile Wireless Networks, Texas
Transactions on Computers 38 (8), pp.651– A&M Univ., College Station, TX 77843-3112,
661, 1989. TR97-014 (December 9, 1997).
[18] Y. Yan, X. Zhang, H. Yang, A fast token
chasing mutual exclusion algorithm in
arbitrary network topologies, Journal of
Parallel and Distributed Computing
35,pp.156–172,1996.
[19] K. Raymond, A tree based algorithm for
distributed mutual exclusion algorithms, ACM
Transactions on Computer Systems 7 (1), pp.
61– 77, 1989.
[20] L.N. Neilson, M. Mizuno, A DAG based
algorithm for distributed mutual exclusion,
International Conference on Distributed
Computer Systems, pp. 354– 360, 1991.
26 | P a g e