Research
A New Approach for Reducing the Testing Effort
In-Process testing metrics has been used from some years and its usage is frequently increasing. There are different metrics for software testing i.e. to measure testing progress, Mean time between arrival of error, density of errors, fixation of errors, failure rate, test execution Productivity, cost of defects, Test efficiency and efficiency checking and so on. But all these metrics are independent and have no relation with each other. There are some attributes of testing metrics which are very much homogenous and interrelated with interdisciplinary measurement. It is quit natural to inter-relate all these metrics into a single metric which should provide overall functionality of some of existing selected metrics and also depicts some new approach of testing measurement. So the derived frame work modeled a new metric. This new metric covers the measurement of major quality attributes such as Correctness, Reliability, Efficiency, Flexibility, Inter-operability, Usability and Maintainability. The derived new metric possess higher level of reliability, early predication of testing progress, less cost of correctness in maintenance phase, effectiveness in error exploration, efficient approach of measuring testing process, Compatibility of different existing metrics, reduce the corrective maintenance effort, less cost of corrective maintenance, a new stander for measuring corrective maintenance effort, high degree of flexibility and interoperability of different Tools.
Reducing Testing Effort in the Test Driven Development
Test-driven development (TDD) is a software development process that relies on the repetition of a very short development cycle: first the developer writes a failing automated test case that defines a desired improvement or new function, and then produces code to pass that test and finally refractors the new code to acceptable standards. TDD is a good approach for the development of the new software but it is more time consuming process model when test the existing software system. In this research we are introducing a new technique which reduces the effort of the TDD approach.
Controlling the Coverage of Wireless Sensors Network Using Coverage in Block Algorithm
This research investigate the modeling of Blocks, Present in the sensing field and its impact in the computation of coverage path in wireless sensor networks (WSNs). The solutions of these problems are proposed using techniques from Approximation algorithm. In order to accomplish the designated task successfully, sensors need to actuate, compute and disseminate the acquired information amongst them. Intuitively, coverage denotes the quality of sensing of a sensor node. While a sensor senses. It needs to communicate with its neighboring sensor nodes in order to disseminate the acquired data. That is where connectivity comes in to place. In fact, coverage and connectivity together measure the quality of service (QoS) of a sensor network. Coverage and connectivity in wireless sensor networks are not unrelated problems. Therefore, the goal of an optimal sensor deployment strategy is to have a globally connected network, while optimizing coverage at the same time. By optimizing coverage, the deployment strategy would guarantee that optimum area in the sensing field is covered by sensor, as required by the underlying application, whereas by ensuring that the network is connected, it is ensured that the sensed information is transmitted to other nodes and possibly to a centralized base station (called sink) which makes valuable decision for the application. Many recent and ongoing research in sensor networks focus on optimizing coverage and connectivity by optimizing node placement strategy, minimizing number of nodes to guarantee required degree of coverage, maximizing network lifetime by minimizing energy usage, computing the most and least sensed path in the given region and so on. To solve these optimizing problems related to coverage, exiting research uses mostly probabilistic technique based on random graph theory, randomized algorithm, computational geometry, and so on. Of particular interest to us is the problem of computing the coverage in block (CIB), where given
Transformation of Flat File into Data Warehouse
A Flat file (Semi Structured) Data comes from different sources or operational systems for storage in the data warehouse. Extraction, transformation and loading of the data could be necessary. Moreover, input flat file data must be transformed into a uniform format which could be more suitable for analytical purposes. Aim of this research is to analysis the delimiters of the flat file, to transform flat file into uniform format and suggest a suitable algorithm for implementation such type of algorithm could be solve the problem of transformation of the flat file data and such algorithm could be useful for extraction, transformation and loading of huge amount of flat file data into data warehouse.
MEASURING THE EFFECT OF CBR AND TCP TRAFFIC MODELS OVER DYMO ROUTING PROTOCOL
A Mobile Ad hoc Network (MANET) are classified as single or multihop wireless network in which nodes can freely move and dynamically self-organize, also the network is highly dynamic in terms of topological changes. Mobile nodes can communicate with themselves without any need of predefined infrastructure. But due to the dynamic nature of MANETs in terms of mobility and no infrastructure, they are provided with limited bandwidth and limited battery power. Due to these characteristics, the MANETs are best suited for military operations, in battlefield grounds, Disaster relief and rescue operations. Choosing the mobility model is very much crucial for specific application area that represents the moving behaviour of a mobile node that should be realistic. Changing the mobility scenario, allows changes in routing performance of a routing protocol in terms of routing metrics such as Delays, Throughput, and Routing Overhead etc within the current application area. Main aim of this research paper focus to study the effects of Transmission Control Protocol TCP and Constant Bit Rate CBR from different angles over Dynamic MANET on demand routing protocol known as DYMO in order to find out the performance degradation on the basis of Data packets and Control packets. Using the Network Simulator 2, experimental results show that functions of the routing protocol vary across different parameters like sending and receiving ratio of data packets and numbers of Control packets send during the simulation period.
