Computer Science & I.T

Search by keywords:
Total Articles 82 - 90 of 2109 | |

An Outcome Evolution in Intrusion Detection System to Advance the Detection Rate in Cloud Computing Environment Utilising Multilayer Perceptron Algorithm

Author(s):Richa Sondhiya -- Mahendra Mishra -- Maneesh Shreevastav
Journal: International Journal of Computer Networking, Wireless and Mobile Communications
Publisher:TJPRC Pvt Ltd.
Abstract
| Pages: 93-102
Cloud is an environment where services are provided over internet on pay as you go basis. Cloud Computing is becoming popular because of its on demand services. It provides computing resources, software, and infrastructure to the users over internet. But cloud computing environment can be easily affected by threats and attacks. To make them secure cloud intrusion detection system is used. Intrusion Detection systems are used to find out attacks and intrusions in networks where large amount of data packets flows in every minute. The cloud computing environment is also an example of such network where large number of users uses services every minute. Because of this amount of traffic this environment can be easily affected by attacks. Its task of IDS to find out such attack and make system secure. After detection of attacks IDS generates alarm to inform the network administrator about such attacks. IDS recognize attacks in signature and behavior basis. Sometimes a normal activity is also triggered as attack that is known as false alarm, but when detected behavior is really an attack that is known as true positive. It meanse it is necessary to correctly identify the attacks. Generally cloud intrusion detection system, network intrusion detection system which are used in cloud and network environment use data mining techniques to detect various attacks. The main goal of system is to find attacks with high detection rate and low false alarm. We present Neural Network based unsupervised MLP Technique and compare with centroid-based clustering algorithms for intrusion detection. These techniques are applied to the KDD Cup98 data set .In addition; a Comparative analysis shows the advantage of Neural Network based unsupervised technique over clustering-based Methods over in identifying new or unseen attack. Experimental result show that MLP Algorithm improves the detection rate in IDS than K-Mean algorithm.

Standardization and Optimization of Cross Layer Design for Wireless Sensor Networks

Author(s):A. K. Patil -- A. J. Patil
Journal: International Journal of Computer Networking, Wireless and Mobile Communications
Publisher:TJPRC Pvt Ltd.
Abstract
| Pages: 103-110
Ever since wireless sensor networks (WSNs) have emerged, different optimizations have been proposed to overcome their constraints. Furthermore, the proposal of new applications for WSNs has also created new challenges to be addressed. Cross-layer approaches have proven to be the most efficient optimization techniques for these problems, since they are able to take the behavior of the protocols at each layer into consideration. Thus, this survey proposes to identify the key problems of WSNs and gather available cross- layer solutions for them that have been proposed so far, in order to provide insights on the identification of open issues and provide guidelines for future proposals. The goal of the study is to provide a feasible and flexible approach to solve the conflicts between the requirements of large scale, long life-time, and multi-purpose wireless sensor networks and the constraints of small bandwidth, low battery capacity, and limited node resources. We justify that the cross-layer optimization is a promising solution and sometime is critical to enable wireless sensor network applications.

Handover Prediction Technique for Network Based Network Mobility (N-NEMO)

Author(s):Ravi V Angadi -- K. C Shet
Journal: International Journal of Computer Networking, Wireless and Mobile Communications
Publisher:TJPRC Pvt Ltd.
Abstract
| Pages: 111-126
Scalability and facilitating continuous Internet access to the users are the main design goals of network mobility. However, latency and packet losses are the resultant factors in many handoff techniques of network mobility. In order to provide seamless handover, in this paper, we propose a handover prediction technique for Network Based Network Mobility (N-NEMO). The proposed technique defines a functional management unit (FMU) to manage and predict handovers in the network. When a MR moves towards the overlay region, it triggers overlay region scanning technique. After predicting the handover, it forwards the handover request to FMU. Priority for each network is assigned considering the parameters bandwidth, battery power, received signal strength and link quality of MRs. Through overlay region scanning technique significant computation cost is minimized. The technique is simulated in NS-2 and result shows the efficiency.

Continuous and Random Dropping Based Distributed Reflection Denial of Service Attack (Card-DRDOSA) Detection, Control and Prevention Technique in MANET

Author(s):Sourish Mitra -- Sayani Chandra -- Bidyutmala Saha -- Rafiqul Islam -- Nirupam Saha
Journal: International Journal of Computer Networking, Wireless and Mobile Communications
Publisher:TJPRC Pvt Ltd.
Abstract
| Pages: 127-134
In MANETs, DOS attacks not only consume the scarce system resources, such as bandwidth, battery energy, or CPU cycles, but also isolate legitimate users from a network. The DOS attacks may impact the network connectivity seriously and may further undermine the networking functions. In DDOS, many “zombies or daemons†computers performing a DOS attack on one computer, usually directed by one “masterâ€. In this paper, we propose a simple and robust method to detect Distributed Reflective Denial of Service attacks. In DRDOS attacks, the victim is bombarded by reflected response packets from legitimate communicating nodes, and thus it is difficult to distinguish attack packets from legitimate packets. We focus on a proposed defense mechanism for dropping based DDOS attack based on concept of rate limiting the attack traffic. The proposed rate limiting scheme will penalize the different attackers based on their rate limits and server load. The rate limit value for each attacker is calculated dynamically. The victim end defense system decrease the rate limit exponentially & increase it linearly based on the attack traffic rate. Therefore, the proposed techniques in MANET are used for smooth and high data rate communication. Our approach is displayed in three phases as detection, control and prevention, explained in “continuous and random dropping detection architectureâ€. In this paper, the proposed rate limiting scheme will penalize the different attackers based on their rate limits and server load. In this paper, the proposed work developed a continuous and random dropping detection mechanism which reduces deficiency of the reduction of Quality to the mobile nodes.

A Novel Stochastic Model for Grouped Weighted Multilevel Space-Time Trellis Codes for Rayleigh Fading Channels

Author(s):M. Krishnasamy -- Pradeep Kumar Verma -- Vivek Mishra -- Navin Kumar Agrawal -- Garima Mathur
Journal: International Journal of Computer Networking, Wireless and Mobile Communications
Publisher:TJPRC Pvt Ltd.
Abstract
| Pages: 135-140
The Space-time trellis codes provide the coding and diversity gains, but only transmits one data symbol per time slot. So, the new scheme, which benefits from the advantages of space-time trellis codes, combination of multilevel space-time codes and ideal beamforming, is called as Grouped Weighted Multilevel Space-Time Trellis Codes (GWMLSTTC). This scheme provides the alternative to Space-time trellis codes, by providing the system designer with the flexibility to choose any desired balance between code performance, complexity and throughput. The proposed scheme gives the better performance in high SNR using 64 number of state as compare to 4/8/16/32 using M-PSK with 6 transmit antennas. An example is shown that we achieves 6 bits/sec/Hz, 64 number of states with 4-PSK of BER, SER and FER.

Energy Optimization Clustering Algorithm for Wireless Sensor Network

Author(s):Shital Dabhade -- Pallavi Zambare
Journal: International Journal of Computer Networking, Wireless and Mobile Communications
Publisher:TJPRC Pvt Ltd.
Abstract
| Pages: 141-148
In this article, efficient energy saving scheme and related algorithm have to be developed and intended in order to provide reasonable energy consumption and to get better the network life span for wireless sensor network systems. The cluster-based method is one of the approaches to reduce energy utilization in wireless sensor networks. In this article, we propose an energy optimization clustering algorithm to offer efficient energy utilization in such networks. The main idea of this article is to reduce data transmission distance of sensor nodes in wireless sensor networks by using the identical cluster concepts. In order to make an ideal allotment for sensor node clusters, we compute the average distance among the sensor nodes and take into account the left over energy for selecting the suitable cluster head nodes. The life span of wireless sensor networks is extended by using the identical cluster position and stabilizing the network loading along with the clusters For the Simulation considering the following parameters throughput, energy consumption, residual energy, End to end packet delay.

A Distance Based Scheme for Defending against Wormhole Attack in Wireless Sensor Networks

Author(s):Bhavneet Kaur -- Sandeep Singh Kang
Journal: International Journal of Computer Networking, Wireless and Mobile Communications
Publisher:TJPRC Pvt Ltd.
Abstract
| Pages: 149-156
Wireless sensors networks (WSNs) consist of a large number of tiny, spatially distributed, and autonomous devices, called sensor nodes. The latter are equipped with sensing, computation, and wireless communications capabilities, and have very limited resources. Wireless sensor networks have been widely used in remote areas, military scenarios, sensing motion applications, agriculture solutions and natural disaster hitted areas. For specific application, it requires strong authentication and security mechanism for more security. Wireless sensor network are easy vulnerable to attack and compromise. Wormhole attack is a harmful against routing protocol which can drop data randomly or disturbing routing path which is in hidden manner or exposed. The proposed work also signifies the effect of hello packets in the simulation due to used routing protocol AODV. In this paper, we proposed a novel method to detect and prevent the wormhole attack based on statistical analysis. In the proposed method, a sensor can detect the fake neighbors which are caused by wormhole through the neighbor discovery process which is here termed as “isolatorâ€, and then a Manhattan Distance algorithm is used to detect and further prevent wormhole attack according to the neighbor information and the broadcasting nature for distinct and reliable communication and the packets will be further forwarding as per nodes. This mechanism will detect and prevent the wormhole attack in sensor. We will introduce packet counter (forward, receive, sent) and next hop address in table which is attached with packet header and time sequence (TOA). Each node will proceed with this mechanism with Manhattan Distance algorithm scheme in which each node or cluster of node broadcast the data securely and safely as per their realistic communication.

XMPP A Perfect Protocol for the New Era of Volunteer Cloud Computing

Author(s):Kamlesh Lakhwani , Ruchika Saini
Journal: International Journal of Computational Engineering Research(IJCER)
Publisher:IJCER
Abstract
| Pages: 45-52
Volunteer Cloud Computing is based on the concept where highly distributed non-dedicated resources are harnessed to build a cloud so as to offer cloud services. By volunteer cloud computing, users and contributors can experience the impact of cloud computing by allowing users to share any type of services be it physical resources, software resources or applications. As volunteer clouds entities are allowed to communicate with each other and with other commercial clouds and clients also, it’s necessary to implement an enhanced interoperable environment that can carry out effective communication between the communicating parties. This thesis contributes toward developing an enhanced interoperable environment where volunteer cloud entities are allowed to communicate with each other and also with other commercial clouds and clients via XMPP protocol (Extensible messaging and presence protocol). In this paper we propose an XMPP based messaging middleware architecture that can help in implementing such an environment

Evaluation of Performance Measures of Bulk Arrival Queue With Fuzzy Parameters Using Robust Ranking Technique

Author(s):B.Palpandi ,G.Geetharamani
Journal: International Journal of Computational Engineering Research(IJCER)
Publisher:IJCER
Abstract
| Pages: 53-57
This paper proposes a procedure to find the various performance measures in terms of crisp values for bulk arrival queuing systems with varying fuzzy batch sizes where the arrival rate, service rate and batch sizes are fuzzy numbers. Here the inter arrival time, service time and batch sizes are Trapezoidal as well as Triangular fuzzy numbers. The basic idea is to convert the fuzzy inter arrival rate, service rate and batch sizes into crisp values by applying Robust ranking technique. Then apply the crisp values in the classical queuing performance measure formulas. Ranking fuzzy numbers plays a vital role in decision making under fuzzy environment. This ranking technique is a very convenient method, simple to apply and can be used for all types of queuing problems. Illustrations are given to find the performance measures of the characteristics of bulk arrival queuing systems with varying fuzzy batch sizes
Page:12345678910Next