Hemraj Saini

Class Level Test Case Generation in Object Oriented Software Testing

Object-oriented programming consists of several different levels of abstraction, namely, the algorithmic level, class level, cluster level, and system level. In this article, we discuss a testing technique to generate test cases at class level for object-oriented programs. The formal object oriented class specification is used to develop a test model. This test model is based on finite state machine specification. The class specification and the test model is analyzed to select a set of test data for each method of the class, and finally the test cases can be generated using other testing techniques like finite-state testing or data-flow testing.

Mitigation Techniques for Gray Hole and Black Hole Attacks in Wireless Mesh Network

Wireless mesh network (WMN) is considered as a key technology in today’s networking era. In this, security is determined as a vital constraint. Several approaches have been proposed to provide secure communication in WMN but communication security possibilities always exist and are very hard to maintain. Black hole and gray hole are the two major attacks at the network layer in WMN. RAODV, IDSAODV, and RIDAODV are some security approaches against these attacks. These approaches can immune the communication at a certain rate. We have proposed a cache-based secure AODV routing protocol, i.e., SDAODV in which instead of using the RREQ messages, security is provided by using the last sequence number of each packet. Using this approach, we have improved the network throughput at a certain rate. The performance of the proposed approach is evaluated by showing the throughput graph.

Secured Authentication and Signature Routing Protocol for WMN (SASR)

Security provisions are a significant influence in the conception of security system for wireless mesh networks (WMNs). It is therefore necessary to guard the identities of individual clients to avoid personal privacy concerns. Numerous susceptibilities exist in different protocols for WMNs (i.e. Overhead, storage, availability of resources). These ambiguities can be discussed by probable attackers to bring down the network performance. In this manuscript, we offer a secure authentication and signature routing protocol (SASR) based on diffie-helman model and threshold signature for reducing response time and improve the security at mesh node. The proposed approach validates the certification of the mesh nodes effectively and paves the path for secure communication. Since the protocol uses Diffie-Helman key mode and threshold signature, very little key is enough for obtaining the needed protection. This thins out the bandwidth allocation for key, so the security constraints will not move the bandwidth by any means, which is an additional advantage over other systems.

Various Code Clone Detection Techniques and Tools: A Comprehensive Survey

In this paper, we have discussed several code replication detection methods and tools in different dimensions. This review has provided an extensive survey codec clone detection techniques and tools. Starting from clone perceptions, classification of clones and an overall assortment of selected techniques and tools is discussed. This paper covers the whole paradigm in clone detection and presents open research avenues in code clone detection.

Extended Cell Planning for Capacity Expansion and Power Optimization by Using MEMETIC Algorithm

In the current era of cellular world, cell planning plays an important role to achieve better performance of the cellular network. Capacity expansion and cost optimization of a newly activated base station by placing it at an optimized location is one of the primary objectives of the current manuscript. The locations of the new as well as the existing base stations are directly correlated to the required capacity demand and the power of the received signal at the base station which becomes the sensitive parameter for the cell planning. Therefore, cell planning is to be modeled to optimize the location of the base stations in the form of a linear programming problem. Further, the MEMETIC algorithm has to be used for the optimization of the multi-objectives of the scenario. The simulated results show that there is a significant enhancement in the capacity of the base stations (1% to 5%) as compared with the orientation of base stations achieved by random deployment.

Authentication Through Elliptic Curve Cryptography (ECC) Technique in WMN

Recently, Wireless Mesh Network is deliberated as a significant technology due to its self-healing and self-organizing characteristics. In WMN, data is forwarded through multiple hops to the destination node. One of the factors that impact the network performance is the secure communication delay. An authentication technique having significant delay may enhance the possibility of several security threats. A number of authentication protocols have been proposed in the literature but if existing practices are deliberated then to optimize one of the constraint other parameters are affected radically. In this manuscript, a Diffie-Hellman elliptic curve technique is used over WMN which reduces latency and computational overhead issues. Further to prove the integrity of proposed work, the performance is measured theoretically and analyzed experimentally over ns2 simulator.

Novel Noncommutative Cryptography Scheme Using Extra Special Group

Noncommutative cryptography (NCC) is truly a fascinating area with great hope of advancing performance and security for high end applications. It provides a high level of safety measures. The basis of this group is established on the hidden subgroup or subfield problem (HSP). The major focus in this manuscript is to establish the cryptographic schemes on the extra special group (ESG). ESG is showing one of the most appropriate noncommutative platforms for the solution of an open problem. The working principle is based on the random polynomials chosen by the communicating parties to secure key exchange, encryption-decryption, and authentication schemes. This group supports Heisenberg, dihedral order, and quaternion group. Further, this is enhanced from the general group elements to equivalent ring elements, known by the monomials generations for the cryptographic schemes. In this regard, special or peculiar matrices show the potential advantages. The projected approach is exclusively based on the typical sparse matrices, and an analysis report is presented fulfilling the central cryptographic requirements. The order of this group is more challenging to assail like length based, automorphism, and brute-force attacks.

Non-Trivial Software Clone Detection Using Program Dependency Graph

Codeclonesarecopiedfragmentsthatoccuratdifferentlevelsofabstractionandmayhavedifferent originsinasoftwaresystem.Thisarticlepresentsanapproachwhichshowsthesignificantpartsof sourcecode.Further,byusingsignificantpartsofasourcecode,acontrolflowgraphcanbegenerated. Thiscontrolflowgraphrepresents thestatementsofacode/programintheformofbasicblocks ornodesandtheedgesrepresentthecontrolflowbetweenthosebasicblocks.Ahybridapproach, namedtheProgramDependenceGraph(PDG)isalsopresentedinthisarticleforthedetectionof non-trivialcodeclones.Theprogramdependencygraphapproachconsistsoftwoapproachesasa controldependencygraphandadatadependencygraph.Thecontroldependencygraphisgeneratedby usingacontrolflowgraph.Thisarticleproposesanapproachwhichcaneasilygeneratecontrolflow graphsandbyusingcontrolflowgraphandreducedflowgraphapproach,thetrivialsoftwareclone,a similartextualstructure,canbedetected.Theproposedapproachisbasedonatokenizationconcept. KeywORDS Control Flow, Cyclomatic Complexity, Graph Software Clones, Program Dependency Graph

Secure Modified Ad Hoc On-Demand Distance Vector MAODV Routing Protocol

In the context of wireless technology, a secure communication is requisite for stopping the unauthorized access to the network services. This manuscripts aim is to detect and eliminate the malicious nodes involved during routing path formation in mesh environments by doing some amendments in basic AODV routing phenomenon. The proposed mechanism is further merged with previously proposed secure authentication and signature routing SASR protocol to address the security threats such as grey hole, black hole attacks and to recover the network metrics in terms of packet loss ratio, packet delivery ratio, computational time and network throughput. Further, the approach is simulated by computing the network throughput in both the scenarios i.e. with the involvement of malicious nodes and without involvement of malicious nodes. Moreover, we have validated the network metrics of proposed mechanism against conventional approaches.

Weight Trusted Routing Mechanism for Hierarchical Mesh Environments

In this paper, we have proposed a technique to detect and eliminate the malicious/misbehaving nodesinvolvedduringroutingpathformationinhierarchicalmeshenvironments.Inthis,dijkstra’s shortestpathroutingalgorithmisusedwhoseweightsaredeliberatedusingcertainparameters(i.e. nodedistance,node’spreviousinteractions,packetlosspercentageandtrustvaluesofeachnode)for providingthesecurityagainstroutingattacks.Themaliciousnodesinvolvedduringroutediscovery processareeliminatedbycalculatingthetrustofeachnodeusingSocialImpactTheoryOptimizer (SITO).Here,wehavediscussedthenetworkperformancetrade-offcausedbysecurepathformation inconventionalmethodsandproposedaWeightTrustedRouting(WTR)mechanismforeliminating theseissues(packet-lossratio,end-to-enddelayandroutediscoverydelay).Wehavenumerically simulated and compared the network metrics for both conventional and proposed approaches. Moreover,theproposedtechniqueisvalidatedbydiscussinganempiricalstudyoverroutingattacks. KEyWoRDS Black Hole Attack, Routing Protocol, Security, SITO, Trusted Routing, Wireless Mesh Network, Worm Hole Attack, WTR