-
C2 Torus New Interconnection Network Topology Based on 2D Torus
Issue:
Volume 4, Issue 3-1, May 2015
Pages:
1-4
Received:
22 December 2014
Accepted:
25 December 2014
Published:
28 January 2015
Abstract: Mesh and Torus are most popular interconnection topologies based on 2D-mesh. Comparison between Mesh and Torus will be considered and new interconnection topology will be proposed to provide better performance. The C2Mesh is an enhanced mesh interconnected network. This paper enhances the Performance of torus network based on the theme of C2Mesh. Topological Properties of new network will be analyzed and implemented by simulation. The new routing Algorithm will be designed for new proposed network (C2Torus).
Abstract: Mesh and Torus are most popular interconnection topologies based on 2D-mesh. Comparison between Mesh and Torus will be considered and new interconnection topology will be proposed to provide better performance. The C2Mesh is an enhanced mesh interconnected network. This paper enhances the Performance of torus network based on the theme of C2Mesh. T...
Show More
-
Selection of Efficient Relay for Energy-Efficient Cooperative Ad Hoc Networks
Issue:
Volume 4, Issue 3-1, May 2015
Pages:
5-11
Received:
22 December 2014
Accepted:
25 December 2014
Published:
18 January 2015
Abstract: The Cooperative Communication (CC) is a technology that allows multiple nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. However, prior research work on topology control considers CC only in the aspect of energy saving, not that of coverage extension. This paper identify the challenges in the development of a centralized topology control scheme, named Cooperative Bridges, which reduces transmission power of nodes as well as increases network connectivity. Previous research on topology control with CC only focuses on maintaining the network connectivity, minimizing the transmission power of each node, whereas ignores the energy efficiency of paths in constructed topologies. This may cause inefficient routes and hurt the overall network performance in cooperative ad hoc networks. With the help of studied topology control problem for energy-efficient topology with cooperative communication. This paper proposed optimum relay nodes selection for CC network to reduce overall power consumption of network.
Abstract: The Cooperative Communication (CC) is a technology that allows multiple nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. However, prior research work on topology control considers CC only in the aspect of energy saving, not that of coverage extension. This paper identify the challenges in the devel...
Show More
-
An Adaptive Algorithm to Prevent SQL Injection
Ashish John,
Ajay Agarwal,
Manish Bhardwaj
Issue:
Volume 4, Issue 3-1, May 2015
Pages:
12-15
Received:
22 December 2014
Accepted:
25 December 2014
Published:
28 January 2015
Abstract: SQL Injection attacks are one of the top most threats for application written for the web. SQL Injection is a type of attack in which the attacker uses SQL commands to gain access or make changes to data. It allows attacker to obtain unauthorized access to the database to change the intended queries. In the web environment, end user privacy is one of the most controversial legal issues. Using SQL Injection, an attacker can leak confidential information such as credit card no. ATM Pin, User Credentials etc from the web applications or even corrupts the database. An unauthorized access to this much of confidential data by an attacker can threat to user confidentiality. In this paper, we had surveyed existing techniques against SQL Injection and analyzed their advantages and disadvantages and proposed a novel and effective solution to avoid attacks on login phase.
Abstract: SQL Injection attacks are one of the top most threats for application written for the web. SQL Injection is a type of attack in which the attacker uses SQL commands to gain access or make changes to data. It allows attacker to obtain unauthorized access to the database to change the intended queries. In the web environment, end user privacy is one ...
Show More
-
Ontology Based Fuzzy Query Execution
Geetanjali tyagi,
kumar kaushik,
Arnika Jain,
Manish Bhardwaj
Issue:
Volume 4, Issue 3-1, May 2015
Pages:
16-21
Received:
22 December 2014
Accepted:
25 December 2014
Published:
28 January 2015
Abstract: Database engineering has been progressed up to the Relational database stage. Fuzzy information administration in databases is a complex process in view of adaptable information nature and heterogeneous database frameworks. Relational Database Management System (RDBMS) can just handle fresh information but cannot handle precise data information. Structured Query Language (SQL) is a very powerful tool but can handle data which is crisp and precise in nature. It is not able to fulfill the requirements for information which is indeterminate, uncertain, inapplicable and imprecise and vague in nature. The goal of this work is to use Fuzzy technique in RDBMS. But, Fuzzy Relational Database Management System (FRDB) requires complex data structures, in most cases, are dependent on the platform in which they are implemented. A solution that involves representing an FRDB using an Ontology as an interface has been defined to overcome this problem. A new Fuzzy Query Ontology is proposed in this dissertation with implementation. The implementation layer, which is responsible for parsing and translating user requests into the corresponding DB implementations in transparent, is required to establish communication between the Ontology and the relational databases management system (RDBMS). This ontology defines a framework for storing fuzzy data by defining those using classes, slots, and instances. An Ontology is an explicit and formal specification of a conceptualization. Ontologies provides a shared understanding of a domain which allows interoperability between semantics.
Abstract: Database engineering has been progressed up to the Relational database stage. Fuzzy information administration in databases is a complex process in view of adaptable information nature and heterogeneous database frameworks. Relational Database Management System (RDBMS) can just handle fresh information but cannot handle precise data information. St...
Show More
-
Efficient Routing with Reduced Routing Overhead and Retransmission of Manet
Megha Sharma,
Shivani Rohilla,
Manish Bhardwaj
Issue:
Volume 4, Issue 3-1, May 2015
Pages:
22-26
Received:
22 December 2014
Accepted:
25 December 2014
Published:
28 January 2015
Abstract: Adhoc network is a collection of mobile nodes that dynamically form a temporary network and are capable of communicating with each other without the use of a network infrastructure. In manet nodes can change location and configure itself, the mobility of nodes causes continuous link breakage due to which frequent path failure occur and route discovery is required. The fundamental construction for a route discoveries is broadcasting in which the receiver node blindly rebroadcast the first received route request packet unless it has route to the destination. The routing overhead associated with route discovery is very high which leads to poor packet delivery ratio and a high delay to be victorious this type of routing overhead we are proposing the new technique using NCPR. To intended NCPR method is used to determine the rebroadcast order and obtain the more precise additional coverage ratio by sensing neighbor coverage knowledge. We can also define connectivity factor to provide node density adaptation. By combining the additional coverage ratio and connectivity factor, rebroadcast probability is determined. The approach can signify improvement in routing performance and decrease the routing overhead by decreasing the number of retransmission.
Abstract: Adhoc network is a collection of mobile nodes that dynamically form a temporary network and are capable of communicating with each other without the use of a network infrastructure. In manet nodes can change location and configure itself, the mobility of nodes causes continuous link breakage due to which frequent path failure occur and route discov...
Show More
-
Security in Ad Hoc Networks
Sanjana Lakkadi,
Amit Mishra,
Manish Bhardwaj
Issue:
Volume 4, Issue 3-1, May 2015
Pages:
27-34
Received:
22 December 2014
Accepted:
25 December 2014
Published:
28 January 2015
Abstract: Ad hoc networks are a wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, these networks are self-configurable and autonomous systems which are able to support movability and organize themselves arbitrarily. These unique characteristics of ad hoc networks pose a number of challenges for the implementation of security infrastructure in the wireless network system design. In this paper, we study the ad-hoc architecture thus understanding the vulnerabilities and security goals. Further, we discuss the various security attacks and explore approaches to secure the communication.
Abstract: Ad hoc networks are a wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, these networks are self-configurable and autonomous systems which are able to support movability and organize themselves arbitrarily. These unique characteristics of ad h...
Show More
-
Design of Secure Ad Hoc Network Using Three Dimensional Discrete Wavelet Transformation Based on Performance Enhancement
Laith Ali Abdul-Rahaim,
Ammar Abdulrasool Muneer
Issue:
Volume 4, Issue 3-1, May 2015
Pages:
35-44
Received:
16 December 2014
Accepted:
10 January 2015
Published:
22 January 2015
Abstract: This work shows new and efficient algorithm of cryptographic purpose based symmetric and conventional techniques that considers the representation of the cipher text by using the three dimensional Discrete Wavelet Transform to find the wavelet decomposition vector containing the approximation and the detail coefficients then build the three dimensional data structure approach. The decryption is done by extracting the encrypted data from the wavelet decomposition vector using the algorithm of inverse Discrete Wavelet Transformation. The encrypted message consists the wavelet decomposition vector. The key is used for authorization purpose to access the network. Results shows great data security and BER over wireless channels based Ad Hoc network.
Abstract: This work shows new and efficient algorithm of cryptographic purpose based symmetric and conventional techniques that considers the representation of the cipher text by using the three dimensional Discrete Wavelet Transform to find the wavelet decomposition vector containing the approximation and the detail coefficients then build the three dimensi...
Show More
-
Privacy Preserving Data Publishing through Slicing
Shivani Rohilla,
Megha Sharma,
A. Kulothungan,
Manish Bhardwaj
Issue:
Volume 4, Issue 3-1, May 2015
Pages:
45-53
Received:
22 December 2014
Accepted:
27 December 2014
Published:
12 February 2015
Abstract: Microdata publishing should be privacy preserved as it may contain some sensitive information about an individual. Various anonymization techniques, generalization and bucketization, have been designed for privacy preserving microdata publishing. Generalization does not work better for high dimensional data. Bucketization failed to prevent membership disclosure and does not show a clear separation between quasi-identifiers and sensitive attributes. There are number of attributes in each record which can be categorized as 1) Identifiers such as Name or Social Security Number are the attributes that can be uniquely identify the individuals. 2)Some attributes may be Sensitive Attributes(SAs) such as disease and salary and 3) Some may be Quasi Identifiers (QI) such as zipcode, age, and sex whose values, when taken together, can potentially identify an individual. Data anonymization enables the transfer of information across a boundary, such as between two departments within an agency or between two agencies, while reducing the risk of unintended disclosure, and in certain environments in a manner that enables evaluation and analytics post-anonymization. Here, we present a novel technique called slicing which partitions the data both horizontally and vertically. It preserves better data utility than generalization and is more effective than bucketization in terms of sensitive attribute.
Abstract: Microdata publishing should be privacy preserved as it may contain some sensitive information about an individual. Various anonymization techniques, generalization and bucketization, have been designed for privacy preserving microdata publishing. Generalization does not work better for high dimensional data. Bucketization failed to prevent membersh...
Show More
-
Secure Route Selection in Manet Using Ant Colony Optimization
Somesh Maheshwari,
Manish Bhardwaj
Issue:
Volume 4, Issue 3-1, May 2015
Pages:
54-56
Received:
22 December 2014
Accepted:
27 December 2014
Published:
12 February 2015
Abstract: A Mobile Adhoc network is a collection of nodes that are dynamically and arbitrarily located in such a manner that the inter connections between nodes are capable of changing on a continual basis. Ad hoc wireless networks are increasing in popularity, because of the spread of laptops, sensor devices, personal digital assistants, and other mobile electronic devices, these devices will eventually need to communicate with each other. For the implementation of MANET, the important factor which is concern is the routing of data from source to destination via various nodes as a mediator due to mobility of mobile nodes. Since the nodes are mobile, the network topology may change rapidly and unpredictably over time. The network topology is u structured and nodes may enter or leave at their will. For mobile ad hoc networks, the complexity of routing increases because of its characteristics such as dynamic topology, absence of centralized authority, time varying quality of service (QoS) requirements, etc. Ant Colony Optimization (ACO) algorithm uses mobile agents as ants to discover feasible and best path in a network. ACO helps in finding the paths between two nodes in a network and selection of path can be changed dynamically according to co dition of the wireless network in case of network congestion.
Abstract: A Mobile Adhoc network is a collection of nodes that are dynamically and arbitrarily located in such a manner that the inter connections between nodes are capable of changing on a continual basis. Ad hoc wireless networks are increasing in popularity, because of the spread of laptops, sensor devices, personal digital assistants, and other mobile el...
Show More
