Code injection attacks which are used by most of the intruders and hackers to break into a websit... more Code injection attacks which are used by most of the intruders and hackers to break into a website. To block the attack memory split method is used which separates the code and data into different memory spaces. Code injection attacks may result in the injection of attack code into the data space. However, the injected code in the data space cannot be fetched for execution as instructions are only retrieved from the code space. Address space layout randomization is also followed to prevent a code injection attack which deals with storing the contents in the memory randomly instead of storing the entire content in a single memory location. So the attacker is blocked from obtaining the entire information and the data are stored as patches in different parts of memory.
Two main techniques, static and dynamic, to broadcast algorithms in wireless ad hoc networks. In ... more Two main techniques, static and dynamic, to broadcast algorithms in wireless ad hoc networks. In the static technique, local algorithms determine the status of each node proactively based on local topology information. we show that a constant approximation factor is achievable if position information is available. In the dynamic technique, local algorithms determine the status of each node " on-the-fly " based on local topology information. Constant approximation factor compute minimum spanning tree of H and add the disks corresponding to its edges to D. Then by varying the number of nodes, speed and traffics patterns the performance comparison is done.
In this Distributed Fault-Tolerant Quality of Wireless Networks approach they proposed EFDCB that... more In this Distributed Fault-Tolerant Quality of Wireless Networks approach they proposed EFDCB that unifies modified GDMAC and FDCB protocols and uses CFSR for QoS routing. Here in the proposed system, proposing the weighted clustering algorithm, leads to a high degree of stability in the network and improves the load balancing in [1][2]GDMAC. The load balancing is accomplished by determining a pre-defined threshold on the number of nodes that a clusterhead can cover ideally. This ensures that none of the clusterheads are overloaded at any instance of time. Moreover the stability can be accomplished by reducing the number of nodes detachmentfrom its current cluster and connect to another existing cluster. In this approach, each node is assigned weights (a real number above zero) based on its suitability of being a clusterhead. A node is chosen to be a clusterhead if its weight is higher than any of its neighbor's weight; otherwise, it joins a neighboring clusterhead. The smaller ID node id is chosen in case of a tie. The DCA makes an assumption that the network topology does not change during the execution of the algorithm. To verify the performance of the system, the nodes were assigned weights which varied linearly with their speeds but with negative slope. Results proved that the number of updates required is smaller than the [3][4]Highest-Degree and Lowest-ID heuristics. Since node weights were varied in each simulation cycle, computing the clusterheads becomes very expensive and there are no optimizations on the system parameters such as throughput and power control. The Weighted Clustering Algorithm (WCA) takes the factors into consideration and makes the selection of clusterhead and maintenance of cluster more reasonable. The factors are node degree, distance summation to all its neighboring nodes, mobility and remaining battery power respectively. And their corresponding weights are wl to w4. Besides, it converts the clustering problem into an optimization p-oblem since an objective function is formed. Authors References Cited By Keywords Metrics Similar Abstract The page cannot be found The page you are looking for might have been removed, had its
A mobile ad hoc network (MANET) consists of a group of communicating hosts that form an arbitrary... more A mobile ad hoc network (MANET) consists of a group of communicating hosts that form an arbitrary network topology. This paper introduces a new type of algorithm called Enhancement on Weighted Clustering Algorithm [EWCA] to improve the load balancing and the stability in the MANET. The cluster head that is selected efficiently based on these factors like, high transmission power, transmission range, distance mobility, battery power and energy. Since the cluster head will not be changed dynamically, average number of cluster formation will be reduced. By applying the load balancing factor, the over head in the cluster is reduced. In this simulation study, a comparison was conducted to measure the performance of our algorithm with original weighted clustering algorithm [WCA] in terms of numbers of clusters formed with satisfying load balancing, topology stability, and number of cluster head change is reduced.
A mobile ad hoc network (MANET) consists of a group of communicating hosts that form an arbitrary... more A mobile ad hoc network (MANET) consists of a group of communicating hosts that form an arbitrary network topology. This paper introduces a new type of algorithm called Enhancement on Weighted Clustering Algorithm [EWCA] to improve the load balancing and the stability in the MANET. The cluster head that is selected efficiently based on these factors like, high transmission power, transmission range, distance mobility, battery power and energy. Since the cluster head will not be changed dynamically, average number of cluster formation will be reduced. By applying the load balancing factor, the over head in the cluster is reduced. In this simulation study, a comparison was conducted to measure the performance of our algorithm with original weighted clustering algorithm [WCA] in terms of numbers of clusters formed with satisfying load balancing, topology stability, and number of cluster head change is reduced.
Using EFDCB (Extended fully distributed cluster based algorithm) protocols improve the quality of... more Using EFDCB (Extended fully distributed cluster based algorithm) protocols improve the quality of service. Here in the proposed system, proposing the weighted clustering algorithm, leads to a high degree of stability in the network and improves the load balancing in GDMAC. The load balancing is accomplished by determining a pre-defined threshold on the number of nodes that a clusterhead can cover ideally. This ensures that none of the clusterheads are overloaded at any instance of time. Moreover the stability can be accomplished by reducing the number of nodes detachment from its current cluster and connect to another existing cluster. In this approach, each node is assigned weights (a real number above zero) based on its suitability of being a clusterhead. A node is chosen to be a clusterhead if its weight is higher than any of its neighbor's weight; otherwise, it joins a neighboring clusterhead. The smaller ID node id is chosen in case of a tie. The DCA makes an assumption that the network topology does not change during the execution of the algorithm. To verify the performance of the system, the nodes were assigned weights which varied linearly with their speeds but with negative slope. Results proved that the number of updates required is smaller than the Highest-Degree and Lowest-ID heuristics. Since node weights were varied in each simulation cycle, computing the clusterheads becomes very expensive and there are no optimizations on the system parameters such as throughput and power control. The Weighted Clustering Algorithm (WCA) takes the factors into consideration and makes the selection of clusterhead and maintenance of cluster more reasonable. The factors are node degree, distance summation to all its neighboring nodes, mobility and remaining battery power respectively. And their corresponding weights are w1 to w4. Besides, it converts the clustering problem into an optimization problem since an objective function is formed. In the proposed system considering the following metrics for taking outputs namely: Average number of cluster formation, Stability, Load Balancing.
Ad-hoc network is a typical wireless network that the communication of the entire network does no... more Ad-hoc network is a typical wireless network that the communication of the entire network does not depend on the pre-existing infrastructure. They are often created on the fly and for one time use. There are no access points behind the network of participating nodes, so the communication is done faster and secure than the existing wired network. Central Authority (CA) based authentication uses secret information asymmetry to trust the data and the keys are provided to each node by one-way hash function and Message Authentication Code (MAC) to achieve data integrity and to prevent attack by an intruder during transmission. Central authority uses network clustering to ensure scalability among the nodes with message authentication to reduce overhead with RSA algorithm for intra cluster, and Blowfish algorithm for inter cluster authentication. Advantage of CA is that it performs double encryption and double decryption before transmission used for security of ad-hoc networks.
A Mobile Ad Hoc Networks (MANET) is a collection of two or more mobile devices (e.g. PDAs, laptop... more A Mobile Ad Hoc Networks (MANET) is a collection of two or more mobile devices (e.g. PDAs, laptop, cell phones, etc.), with multi-hop wireless communication. This paper introduces a new type of algorithm called Enhancement on Weighted Clustering Algorithm [EWCA] to improve the load balancing and the stability in the MANET. And then it reduces the cluster over head. The cluster head that is selected efficiently based on these factors like, high transmission power, transmission range, distance mobility, battery power and energy. Since the cluster head will not be changed dynamically it takes more times to change the cluster head, average number of cluster formation will be reduced. By applying the load balancing factor, the over head in the cluster is reduced. In this simulation study, a comparison was conducted to measure the performance of our algorithm with original weighted clustering algorithm [WCA] in terms of numbers of clusters formed with satisfying load balancing, topology stability, and number of cluster head change is reduced.
In this Distributed Fault-Tolerant Quality of Wireless Networks approach they proposed EFDCB that... more In this Distributed Fault-Tolerant Quality of Wireless Networks approach they proposed EFDCB that unifies modified GDMAC and FDCB protocols and uses CFSR for QoS routing. Here in the proposed system, proposing the weighted clustering algorithm, leads to a high degree of stability in the network and improves the load balancing in GDMAC. The load balancing is accomplished by determining a pre-defined threshold on the number of nodes that a clusterhead can cover ideally. This ensures that none of the clusterheads are overloaded at any instance of time. Moreover the stability can be accomplished by reducing the number of nodes detachment from its current cluster and connect to another existing cluster. In this approach, each node is assigned weights (a real number above zero) based on its suitability of being a clusterhead. A node is chosen to be a clusterhead if its weight is higher than any of its neighbor's weight; otherwise, it joins a neighboring clusterhead. The smaller ID node id is chosen in case of a tie. Since node weights were varied in each simulation cycle, computing the clusterheads becomes very expensive and there are no optimizations on the system parameters such as throughput and power control. The Weighted Clustering Algorithm (WCA) takes the factors into consideration and makes the selection of clusterhead and maintenance of cluster more reasonable. The factors are node degree, distance summation to all its neighboring nodes, mobility and remaining battery power respectively. And their corresponding weights are w1 to w4. Besides, it converts the clustering problem into an optimization problem since an objective function is formed. Keywords: mobile ad-hoc network, quality of service, load balancing
Code injection attacks which are used by most of the intruders and hackers to break into a websit... more Code injection attacks which are used by most of the intruders and hackers to break into a website. To block the attack memory split method is used which separates the code and data into different memory spaces. Code injection attacks may result in the injection of attack code into the data space. However, the injected code in the data space cannot be fetched for execution as instructions are only retrieved from the code space. Address space layout randomization is also followed to prevent a code injection attack which deals with storing the contents in the memory randomly instead of storing the entire content in a single memory location. So the attacker is blocked from obtaining the entire information and the data are stored as patches in different parts of memory.
Two main techniques, static and dynamic, to broadcast algorithms in wireless ad hoc networks. In ... more Two main techniques, static and dynamic, to broadcast algorithms in wireless ad hoc networks. In the static technique, local algorithms determine the status of each node proactively based on local topology information. we show that a constant approximation factor is achievable if position information is available. In the dynamic technique, local algorithms determine the status of each node " on-the-fly " based on local topology information. Constant approximation factor compute minimum spanning tree of H and add the disks corresponding to its edges to D. Then by varying the number of nodes, speed and traffics patterns the performance comparison is done.
In this Distributed Fault-Tolerant Quality of Wireless Networks approach they proposed EFDCB that... more In this Distributed Fault-Tolerant Quality of Wireless Networks approach they proposed EFDCB that unifies modified GDMAC and FDCB protocols and uses CFSR for QoS routing. Here in the proposed system, proposing the weighted clustering algorithm, leads to a high degree of stability in the network and improves the load balancing in [1][2]GDMAC. The load balancing is accomplished by determining a pre-defined threshold on the number of nodes that a clusterhead can cover ideally. This ensures that none of the clusterheads are overloaded at any instance of time. Moreover the stability can be accomplished by reducing the number of nodes detachmentfrom its current cluster and connect to another existing cluster. In this approach, each node is assigned weights (a real number above zero) based on its suitability of being a clusterhead. A node is chosen to be a clusterhead if its weight is higher than any of its neighbor's weight; otherwise, it joins a neighboring clusterhead. The smaller ID node id is chosen in case of a tie. The DCA makes an assumption that the network topology does not change during the execution of the algorithm. To verify the performance of the system, the nodes were assigned weights which varied linearly with their speeds but with negative slope. Results proved that the number of updates required is smaller than the [3][4]Highest-Degree and Lowest-ID heuristics. Since node weights were varied in each simulation cycle, computing the clusterheads becomes very expensive and there are no optimizations on the system parameters such as throughput and power control. The Weighted Clustering Algorithm (WCA) takes the factors into consideration and makes the selection of clusterhead and maintenance of cluster more reasonable. The factors are node degree, distance summation to all its neighboring nodes, mobility and remaining battery power respectively. And their corresponding weights are wl to w4. Besides, it converts the clustering problem into an optimization p-oblem since an objective function is formed. Authors References Cited By Keywords Metrics Similar Abstract The page cannot be found The page you are looking for might have been removed, had its
A mobile ad hoc network (MANET) consists of a group of communicating hosts that form an arbitrary... more A mobile ad hoc network (MANET) consists of a group of communicating hosts that form an arbitrary network topology. This paper introduces a new type of algorithm called Enhancement on Weighted Clustering Algorithm [EWCA] to improve the load balancing and the stability in the MANET. The cluster head that is selected efficiently based on these factors like, high transmission power, transmission range, distance mobility, battery power and energy. Since the cluster head will not be changed dynamically, average number of cluster formation will be reduced. By applying the load balancing factor, the over head in the cluster is reduced. In this simulation study, a comparison was conducted to measure the performance of our algorithm with original weighted clustering algorithm [WCA] in terms of numbers of clusters formed with satisfying load balancing, topology stability, and number of cluster head change is reduced.
A mobile ad hoc network (MANET) consists of a group of communicating hosts that form an arbitrary... more A mobile ad hoc network (MANET) consists of a group of communicating hosts that form an arbitrary network topology. This paper introduces a new type of algorithm called Enhancement on Weighted Clustering Algorithm [EWCA] to improve the load balancing and the stability in the MANET. The cluster head that is selected efficiently based on these factors like, high transmission power, transmission range, distance mobility, battery power and energy. Since the cluster head will not be changed dynamically, average number of cluster formation will be reduced. By applying the load balancing factor, the over head in the cluster is reduced. In this simulation study, a comparison was conducted to measure the performance of our algorithm with original weighted clustering algorithm [WCA] in terms of numbers of clusters formed with satisfying load balancing, topology stability, and number of cluster head change is reduced.
Using EFDCB (Extended fully distributed cluster based algorithm) protocols improve the quality of... more Using EFDCB (Extended fully distributed cluster based algorithm) protocols improve the quality of service. Here in the proposed system, proposing the weighted clustering algorithm, leads to a high degree of stability in the network and improves the load balancing in GDMAC. The load balancing is accomplished by determining a pre-defined threshold on the number of nodes that a clusterhead can cover ideally. This ensures that none of the clusterheads are overloaded at any instance of time. Moreover the stability can be accomplished by reducing the number of nodes detachment from its current cluster and connect to another existing cluster. In this approach, each node is assigned weights (a real number above zero) based on its suitability of being a clusterhead. A node is chosen to be a clusterhead if its weight is higher than any of its neighbor's weight; otherwise, it joins a neighboring clusterhead. The smaller ID node id is chosen in case of a tie. The DCA makes an assumption that the network topology does not change during the execution of the algorithm. To verify the performance of the system, the nodes were assigned weights which varied linearly with their speeds but with negative slope. Results proved that the number of updates required is smaller than the Highest-Degree and Lowest-ID heuristics. Since node weights were varied in each simulation cycle, computing the clusterheads becomes very expensive and there are no optimizations on the system parameters such as throughput and power control. The Weighted Clustering Algorithm (WCA) takes the factors into consideration and makes the selection of clusterhead and maintenance of cluster more reasonable. The factors are node degree, distance summation to all its neighboring nodes, mobility and remaining battery power respectively. And their corresponding weights are w1 to w4. Besides, it converts the clustering problem into an optimization problem since an objective function is formed. In the proposed system considering the following metrics for taking outputs namely: Average number of cluster formation, Stability, Load Balancing.
Ad-hoc network is a typical wireless network that the communication of the entire network does no... more Ad-hoc network is a typical wireless network that the communication of the entire network does not depend on the pre-existing infrastructure. They are often created on the fly and for one time use. There are no access points behind the network of participating nodes, so the communication is done faster and secure than the existing wired network. Central Authority (CA) based authentication uses secret information asymmetry to trust the data and the keys are provided to each node by one-way hash function and Message Authentication Code (MAC) to achieve data integrity and to prevent attack by an intruder during transmission. Central authority uses network clustering to ensure scalability among the nodes with message authentication to reduce overhead with RSA algorithm for intra cluster, and Blowfish algorithm for inter cluster authentication. Advantage of CA is that it performs double encryption and double decryption before transmission used for security of ad-hoc networks.
A Mobile Ad Hoc Networks (MANET) is a collection of two or more mobile devices (e.g. PDAs, laptop... more A Mobile Ad Hoc Networks (MANET) is a collection of two or more mobile devices (e.g. PDAs, laptop, cell phones, etc.), with multi-hop wireless communication. This paper introduces a new type of algorithm called Enhancement on Weighted Clustering Algorithm [EWCA] to improve the load balancing and the stability in the MANET. And then it reduces the cluster over head. The cluster head that is selected efficiently based on these factors like, high transmission power, transmission range, distance mobility, battery power and energy. Since the cluster head will not be changed dynamically it takes more times to change the cluster head, average number of cluster formation will be reduced. By applying the load balancing factor, the over head in the cluster is reduced. In this simulation study, a comparison was conducted to measure the performance of our algorithm with original weighted clustering algorithm [WCA] in terms of numbers of clusters formed with satisfying load balancing, topology stability, and number of cluster head change is reduced.
In this Distributed Fault-Tolerant Quality of Wireless Networks approach they proposed EFDCB that... more In this Distributed Fault-Tolerant Quality of Wireless Networks approach they proposed EFDCB that unifies modified GDMAC and FDCB protocols and uses CFSR for QoS routing. Here in the proposed system, proposing the weighted clustering algorithm, leads to a high degree of stability in the network and improves the load balancing in GDMAC. The load balancing is accomplished by determining a pre-defined threshold on the number of nodes that a clusterhead can cover ideally. This ensures that none of the clusterheads are overloaded at any instance of time. Moreover the stability can be accomplished by reducing the number of nodes detachment from its current cluster and connect to another existing cluster. In this approach, each node is assigned weights (a real number above zero) based on its suitability of being a clusterhead. A node is chosen to be a clusterhead if its weight is higher than any of its neighbor's weight; otherwise, it joins a neighboring clusterhead. The smaller ID node id is chosen in case of a tie. Since node weights were varied in each simulation cycle, computing the clusterheads becomes very expensive and there are no optimizations on the system parameters such as throughput and power control. The Weighted Clustering Algorithm (WCA) takes the factors into consideration and makes the selection of clusterhead and maintenance of cluster more reasonable. The factors are node degree, distance summation to all its neighboring nodes, mobility and remaining battery power respectively. And their corresponding weights are w1 to w4. Besides, it converts the clustering problem into an optimization problem since an objective function is formed. Keywords: mobile ad-hoc network, quality of service, load balancing
Uploads
Papers by rathika skb