Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor

Networks
Abstract
We consider a scenario where a sophisticated jammer jams an area in a single-channel
wireless sensor network .The jammer controls the probability of jamming and
transmission range to cause maximal damage to the network in terms of corrupted
communication links. The jammer action ceases when it is detected by a monitoring node
in the network, and a notification message is transferred out of the jamming region. The
jammer is detected at a monitor node by employing an optimal detection test based on the
percentage of incurred collisions. On the other hand, the network computes channel
access probability in an effort to minimize the jamming detection plus notification time.
In order for the jammer to optimize its benefit, it needs to know the network channel
access probability and number of neighbors of the monitor node. Accordingly, the
network needs to know the jamming probability of the jammer. We study the idealized
case of perfect knowledge by both the jammer and the network about the strategy of one
another, and the case where the jammer or the network lack this knowledge. The latter is
captured by formulating and solving optimization problems, the solutions of which
constitute best responses of the attacker or the network to the worst-case strategy of each
other. We also take into account potential energy constraints of the jammer and the
network. We extend the problem to the case of multiple observers and adaptable jamming
transmission range and propose a intuitive heuristic jamming strategy for that case.

Exsisting System:

controllable jamming attacks in wireless sensor networks, which are easy to launch and
difficult to detect and confront. The derived solutions to the optimization problems
dictate optimal attack and network defense strategies. Of particular interest is the
comparison between the case of perfect knowledge and that of lack of knowledge of the

attacker and the network about the strategy of each other. In the latter, the attacker and the
network respond optimally to the worst-case strategy of the other.
Disadvantage:
1 .In previous stage we are not using jammers. so, the controllable jamming attacks in
wireless sensor networks. So there occur time delay and data lose.

Proposed System:

Our work is a first step towards understanding the structure of these jamming
problems, identifying tradeoffs and capturing the impact of different parameters on
performance. There exist several directions for future study. Interesting issues arise in
multi-channel networks.
Advantage:
Here we are using jammer to control the network traffic. so, there is no chance to time
delay and data lose.

Modules:A. Sensor network model

We consider a wireless sensor network deployed over a large area and operating
under a single-carrier slotted Aloha type access control protocol. We assume symmetric

transmission, namely a node i can receive signal from node j if and only if node j can
receive signal from i. The network is represented by an undirected graph G = (S;E) where
S is the set of sensor nodes and E is the set of edges. Time is divided into time slots and
the slot size equals the size of a packet. All nodes are assumed to be synchronized with
respect to slot boundaries.

B. Attacker model
We consider one attacker in the area, which is not authenticated
and associated with the network. The objective of the jammer is to corrupt transmissions
of legitimate nodes by causing packet collisions at receivers. Intentional collision leads to
retransmission and thus additional energy consumption for a certain amount of
throughput, or equivalently reduced throughput for a given amount of consumed energy.

C. Attack detection model

The network employs a monitoring mechanism for detecting potential malicious activity
by a jammer. The monitoring mechanism consists of the following: (i) determination of a
subset of nodes M that will act as network monitors, and (ii) employment of a detection
algorithm at each monitor node. The assignment of the role of monitor to a node can be
affected by energy limitations and detection performance specifications. In this work, we
fix M and formulate optimization problems for one or more monitor nodes.

D.Attacker Payoff
The payoff of the attacker is measured in terms of number of incurred corrupted links.
The instantaneous payoff of the attacker is the average number of additionally corrupted
links in a slot, not counting those due to legitimate contention.It depends on jamming

probability and network access probability . In order to obtain a good transaction we

first find the probability of successful transmission in the absence of jamming.

MODULE INPUT AND OUTPUT:

MODULE INPUT:
We provide the number of nodes we required. Then the source and destination
nodes are provided.
MODULE OUTPUT:
The expected output of the module is to show the shortest path between the source
and destination mobile.
Module Diagram :
UML Diagrams :
Use case diagram :

Class diagram :

login
username()
password()

Add nodes
Cells()
Nodes in cell()

Resource Allocation
Start mobility()
Refresh nodes()

Lagrangean Path
Adjacent cell()
Total Nodes
getParameter()
getRead()
Path diference()

Object diagram :
client

Add node

Provide Source and

Destination

Total cells and

nodes

Find Position

State diagram :

Apply Algorithm
Sub divide
problem

Find Path
Show path

Node position

Node position

Source 1

Source 2

Source 3

Destination1

Destination 2

Destination 3

Search path

path

path

path

Cell

Sequence diagram :

User Login

Addnodes

Providing
Resource

Lagrangian Path

Authorised User

Band Width
consumption

Unauthorised User

Stat mobility

Handling Sub problems

Showing path

Collaboration diagram:
1: Authorised User
User Login

Total cells
And nodes
2: Unauthorised User
3: Nodes get added
In the cells

Implement
Algorithm

Nodes added
Randomly
4: Resource Allocation

5: Itiration process

Path

Component diagram :
Source1

Path1
Path2

Selection

Destination1
Iteration path

Path3
Total
nodes

Source2

Destination2
Iteration path

Selection
Path4
Selection
Source3

Path5
Path6

Iteration path
Destination3

Lagrangian
Path

E-R diagram :

Data flow diagram

Start

Login

No
Add
Valid
Nodes

Yes

Mobility of nodes

No

Yes

Add Source
and
Destination

Solving Sub Problems

Retry the location

Yes
Valid Source
and
Destination

Lagrangean Path
No
Target machine refused
it
Stop

Project flow diagram :

Path2

Find total
nodes

Path1

Path3
Destin
ation

Find total
cells

Source

Path3

Lagrangean path

SYSTEM ARCHITECTURE:

Mobile Multicast Protocol:

Mobile IP supports (unicast) IP routing for mobile hosts in an IP internetwork. The c m t
version of Mobile IP proposes two approaches to support mobile multicast which are
remote subscription and bi-directional tunneling . In remote subscription, each MH
(Mobile Host) always re-subscribes to its desired multicast group when it enters a foreign
network. Therefore its multicast router (MR) must be added to the multicast distribution
tree. The updzte frequency of the multicast distribution tree will depend on how offen the
mobile handoff occurs. The main advantage of this
approach is that the multicast datagrams are always delivered on the shortest paths.
However, the overhead is the cost of reconst~uctingt he delivery tree while a handoff
occurs. In bi-duectional tunneling, the mobile host receives multicasl datagrams by way
of its home agent (HA) using the unicast Mobile IP tunnels. This approach hides host
mobility Bom all other members of the multicasi group. In addition, the multicast

distribution tree will not be updated for the sake of member location change. The main
drawback of this
approach is the routing path for multicast delivery can be far from optimal. Besides, the
HA must replicate and deliver tunneled multicast datagrams to all its away MHs,
regardless of at which foreip networks they resides. Therefore, the network resource will
be wasted. The scheme is complicated by a phenomenon called runnel convergence
problem resulting from the fact that multiple Mobile IP tunnels (from different HAS) can
terminate at a particular FA (Foreign Agent). where multiple HAS all happen to have
mobile hosts that are members of the Same multicast group at the Same foreign
network, managed by the foreign agent FA. Therefore more than one copy of every
multicast package would be forwarded to the FA by every HA .
Range-Based Mobile Mu//icas/ @?EMOM):
RBMoM [6] intends to trade off between the shortest delivery path and the frequency of
the multicast tree reconliguration. Multicast datagrams are delivered on the near-shortest
paths without paying the high cost of reconstructing the multicast tree (the main
drawback of remote ubscription). Like the home agent in Mobile IP, RBMoM has a
router, called mulficasf home agent m)t,ha t is responsible for tunneling multicast
datagrams to the foreign agent to which the mobile host (MH) is currently attached.
Therefore, each MHA must always be one of the multicast group members
(this is like bi-directional tunneling in which every home agent must join the multicast
group). Every MH can only have one MHA. The home agent (HA) of a MH is never
changed. However, the MHA of a MH is changeable according to the MH location. The
initial MHA of a mobile host is set to be its HA. RBMoM addresses a concept of range
for each MHA. The range of a MHA means the service mge to its MHs. That is, a MHA
can only serve the mobile hosts which are roaming around the foreign networks which
are within its service range, or the network to which the MHA is attached. If a
mobile host is out of its MHA service range, then the MHA handof will occur. That is,
another MHA will take over the multicast service to the mobile host. From the point of
view of the range concept, we will find both bi-directional tunneling and remote
subscription are the extremes of BMoM.

Let R be the senice range of a multicast home agent. Thus, (1) If we let R = m, then
RBMoM is the Same as bi-direct i 0 ~ 1tu nneling. In this case, the MHA is always the
home agent and is never changed.
(2) If we let R = 0, then RBMoM is the same as remote subscription. That is, when a MH
entm a foreign network (i.e., handom, its MHA must be changed because of out ofthe
senice range.
(3) RBMoM is a generalization of the above cases and a unifying mobile multicast
approach. According to the value of R, a MHA can determine whether the datagams
should be tunneled to each of them. Observe that
the service range reshicts the al length of the iunne1 between a mobile host and its
MHA.
Range-Based Mobile Mul/icas/ Forwarding Mechanism
All routers in figure 4 are assumed running RBMoM. If Router RT, has been elected to
be MHA for Campus Network, then it could service RT2 and RT, with range = 1. For
simplicity, we assume mobile hosts MH, ... MH5 join the same multicast group and there
is only one source. The base stations in SubnetA and SubnetB join this multicast group
via the IGMP (Internet Group Management Protocol). Similarly, using IGMP the routers
and base stations in the Campus Network would join tlus multicast group. We assume RT,
and RT3 are served by the RT, (i.e., RT, is the MHA of RT2 and RT3). Note that RT2 and
RT, can be served by the other MHAs if they are also in these MHAs service range. But
each multicast router must elect only one MHA. That is, each mnter can have only one
MHA even though there is more than one in its neighborhood. To illustrate the delivery of
a multicast datagram, sup pose that Multicast Source (attached to the Intemet) sends a
multicast datagram to the multicast group X. This datagram will he through the Internet
get to the MHA (Router RT,) by using some multicast routing protocol (e.g., CBT,
DVMRP or PIM, etc.), and then RT, forwards the datagram to the members of multicast p
u p X located at SuhnetA and
SubnetB. This is accomplished by sending a single copy of the datagram onto Campus
Network as a data-lmk layer multicast. Upon receiving the multicast datagram from RT,,

RT2 and RT, will then multicast the datagram on their connected networks (SuhnetA and
SuhnetB, respectively). Note that, if MH2 moves from the area of BS, to the area of BS,,
it still can receive the multicast datagrams since it is within the service range of the same
MHA (RT,). There will be the similar result when it migrates to the area of BSI, because
the BS, is still still served by RT,. Thus, there is almost no datagram
lost hecause of mobile host handoff only if the mobility is within the service range of the
MHA (i.e., the host mobility is hidden within the service range of the MHA).
Mul/icas/ Home Agent Eleclion
The multicast home agent (MHA) election is performed per handoff by a mobile host
using a combination of distance tiebreakem (i.e., the closest node to the multicast source
should be the MHA) and loading tiebreakers in the case of equal distances. Random
tiebreakers will be used when both
distance and loading are equal 161. For simplicity, we can let all mobile hosts staying in a
subnet have the same MHA, and this MHA must be a multicast router. Then the tunnel
convergence problem can be solved. Given a service range R, RBMoM, thus, elects the
MHA among the group of multicast routers which have the hop distance less than or
equal to R to
the subnet. Those mobile hosts roaming at a common LAN have the same MHA. Service
range = 1 is the network topology. Every node in this figure represents a LAN (or
subnet). We assume that each LAN has a multicast router (MR). The MR in a squared
LAN (e.g., LAN 2, 5 and 9, etc.) means the qualified router to be able to act as a MHA.
Once a qualified router is elected as a MHA, it must be on the multicast Tree If the MR at
LAN 2, denoted MR,, acts as the MHA of LAN 1,3 and 7, it must be on the multicast tree
to receive the multicast datagrams from the some and then to tunnel these received
multicast datagrams to MR,, MR, and MR,. These MRs then further broadcast the
datagrams to their local mobile participants. There are
two possible candidates within the service range to be its MHA (i.e., MR,, and MR,,). We
choose one which savice less MRs to be the MHA (loading tiebreakers). If the loading is
equal, we can use the random tiebreakers to

choose one. If we increase the service range, obviously the number of MHAs is
decreased. How can we get the qualified MRs in the example mentioned above to be the
candidates of MHAs for a given service range and a network topology? We need to
develop an algorithm to elect a set of MRs such that every LAN can decide its MHA
from this set with the constraint of the service range (i.e., the MHA must be within the
service range). Here we assume there is only one MR in each LAN. The size
of the set which is obtained from the algorithm must be as small as possible to reduce the
multicast traffic delivmd on the tree. Additionally, the delivery paths must be as short as
possible. We will use a distributed greedy algorithm to solve this problem to get an
acceptable and quick answer rather
than an optimal one. We model a network topology to be a graph in which
each node represents a LAN and an edge between two nodes meam that both LANs are
adjacent. It is specially notable that the term neighbors used in OUT algorithm is the
set of nodes within the scope of the radius of the service range (called the locdlry). There
is a variable which is used to
record whether this node is a member of the set of the candidate MHAs. Its initial value is
assigned null. During the run time, the value of the status can be null, holding nonmember and member. When the algorithm ends, the
siaius must be either member or non-member. The MRs at the member nodes
(LANs) are the possible MHA candidates. Each LAN can randomly choose one to be the
MHA, but must meet the constraint of the service range. Once the MHA is decided, it
cannot be changed during the
multicast session.
1: At the start each node broadcasts its degree (i.e., the number of adjacent nodes) to the
neighbors of its locality. The TTL (Time-To-Live) field in the IP header can be used to
limit the scope of this broadcast message. For a node, excluding the non-member nodes
and holding nodes in its locality, if slatus = null and it has the highest degree in its
locality, it must becomes the member node. Thus, sfafus = member and it broadcasts the
MEMBER message to the neighbors. Lowest-ID tiebreakers are used bere. When

receiving the MEMBER message, a node whose status is not ready (i.e., neither
member nor nonmember) sets its stam to be non-member and
broadcasts a NON-MEMBER message to the neighbors. If a nodes status is not ready
and there exits a nonmember adjacent node, its sfaim is set to be holding (temporary
status) and it sends HOLDING message to
the neighbors. For a node, status = holding and all other nodes statuses
in its locality are either non-member or holding. The status can be changed to member if
it has the highest degree among all holding nodes in its locality. Lowest- W tiebreakers
are also used here. Like the above rules, status update needs to inform all nodes in its
locality. 6 When all nodes decide their statuses, the algorithm ends.
TECHNIQUES USED:

Lagrangean Algorithm
CTSP sub problems

System Specification

System Requirements:
Hardware Requirements:
Processor

Intel Duel Core.

Hard Disk

60 GB.

Floppy Drive

1.44 Mb.

Monitor

LCD Colour.

Mouse

Optical Mouse.

RAM

512 Mb.

Software Requirements:
Operating system :

Windows XP.

Coding Language :

ASP.Net with C#

Data Base

SQL Server 2005

INPUT DESIGN
The input design is the link between the information system and the user. It comprises the
developing specification and procedures for data preparation and those steps are
necessary to put transaction data in to a usable form for processing can be achieved by
inspecting the computer to read data from a written or printed document or it can occur
by having people keying the data directly into the system. The design of input focuses on
controlling the amount of input required, controlling the errors, avoiding delay, avoiding
extra steps and keeping the process simple. The input is designed in such a way so that it
provides security and ease of use with retaining the privacy. Input Design considered the
following things:
What data should be given as input?
How the data should be arranged or coded?
The dialog to guide the operating personnel in providing input.
Methods for preparing input validations and steps to follow when error occur.

OBJECTIVES
1.Input Design is the process of converting a user-oriented description of the input into a
computer-based system. This design is important to avoid errors in the data input process
and show the correct direction to the management for getting correct information from
the computerized system.
2. It is achieved by creating user-friendly screens for the data entry to handle large
volume of data. The goal of designing input is to make data entry easier and to be free

from errors. The data entry screen is designed in such a way that all the data manipulates
can be performed. It also provides record viewing facilities.
3.When the data is entered it will check for its validity. Data can be entered with the help
of screens. Appropriate messages are provided as when needed so that the user
will not be in maize of instant. Thus the objective of input design is to create an input
layout that is easy to follow
OUTPUT DESIGN
A quality output is one, which meets the requirements of the end user and presents the
information clearly. In any system results of processing are communicated to the users
and to other system through outputs. In output design it is determined how the
information is to be displaced for immediate need and also the hard copy output. It is the
most important and direct source information to the user. Efficient and intelligent output
design improves the systems relationship to help user decision-making.
1. Designing computer output should proceed in an organized, well thought out manner;
the right output must be developed while ensuring that each output element is designed so
that people will find the system can use easily and effectively. When analysis design
computer output, they should Identify the specific output that is needed to meet the
requirements.
2.Select methods for presenting information.
3.Create document, report, or other formats that contain information produced by the
system.
The output form of an information system should accomplish one or more of the
following objectives.
Convey information about past activities, current status or projections of the
Future.
Signal important events, opportunities, problems, or warnings.
Trigger an action.
Confirm an action.
Software Environment

4.1 Features OF. Net

Microsoft .NET is a set of Microsoft software technologies for rapidly
building and integrating XML Web services, Microsoft Windows-based applications, and
Web solutions. The .NET Framework is a language-neutral platform for writing programs
that can easily and securely interoperate. Theres no language barrier with .NET: there are
numerous languages available to the developer including Managed C++, C#, Visual Basic
and Java Script. The .NET framework provides the foundation for components to interact
seamlessly, whether locally or remotely on different platforms. It standardizes common
data types and communications protocols so that components created in different
languages can easily interoperate.
.NET is also the collective name given to various software components
built upon the .NET platform. These will be both products (Visual Studio.NET and
Windows.NET Server, for instance) and services (like Passport, .NET My Services, and
so on).
THE .NET FRAMEWORK
The .NET Framework has two main parts:
1. The Common Language Runtime (CLR).
2. A hierarchical set of class libraries.
The CLR is described as the execution engine of .NET. It provides the environment
within which programs run. The most important features are

Conversion

from

low-level

assembler-style

language,

called

Intermediate Language (IL), into code native to the platform being

executed on.

Memory management, notably including garbage collection.

Checking and enforcing security restrictions on the running code.

Loading and executing programs, with version control and other such
features.

The following features of the .NET framework are also worth description:

Managed Code
The code that targets .NET, and which contains certain extra
Information - metadata - to describe itself. Whilst both managed and unmanaged code
can run in the runtime, only managed code contains the information that allows the CLR
to guarantee, for instance, safe execution and interoperability.

Managed Data
With Managed Code comes Managed Data. CLR provides memory
allocation and Deal location facilities, and garbage collection. Some .NET languages use
Managed Data by default, such as C#, Visual Basic.NET and JScript.NET, whereas
others, namely C++, do not. Targeting CLR can, depending on the language youre using,
impose certain constraints on the features available. As with managed and unmanaged
code, one can have both managed and unmanaged data in .NET applications - data that
doesnt get garbage collected but instead is looked after by unmanaged code.

Common Type System

The CLR uses something called the Common Type System (CTS) to strictly
enforce type-safety. This ensures that all classes are compatible with each other, by
describing types in a common way. CTS define how types work within the runtime,
which enables types in one language to interoperate with types in another language,
including cross-language exception handling. As well as ensuring that types are only used
in appropriate ways, the runtime also ensures that code doesnt attempt to access memory
that hasnt been allocated to it.

Common Language Specification

The CLR provides built-in support for language interoperability. To ensure that
you can develop managed code that can be fully used by developers using any
programming language, a set of language features and rules for using them called the
Common Language Specification (CLS) has been defined. Components that follow these
rules and expose only CLS features are considered CLS-compliant.

THE CLASS LIBRARY

.NET provides a single-rooted hierarchy of classes, containing over 7000
types. The root of the namespace is called System; this contains basic types like Byte,
Double, Boolean, and String, as well as Object. All objects derive from System. Object.
As well as objects, there are value types. Value types can be allocated on the stack, which
can provide useful flexibility. There are also efficient means of converting value types to
object types if and when necessary.
The set of classes is pretty comprehensive, providing collections, file,
screen, and network I/O, threading, and so on, as well as XML and database connectivity.

The class library is subdivided into a number of sets (or namespaces), each
providing distinct areas of functionality, with dependencies between the namespaces kept
to a minimum.

LANGUAGES SUPPORTED BY .NET

The multi-language capability of the .NET Framework and Visual
Studio .NET enables developers to use their existing programming skills to build all types
of applications and XML Web services. The .NET framework supports new versions of
Microsofts old favorites Visual Basic and C++ (as VB.NET and Managed C++), but
there are also a number of new additions to the family.
Visual Basic .NET has been updated to include many new and improved
language features that make it a powerful object-oriented programming language. These
features include inheritance, interfaces, and overloading, among others. Visual Basic also
now supports structured exception handling, custom attributes and also supports multithreading.
Visual Basic .NET is also CLS compliant, which means that any CLScompliant language can use the classes, objects, and components you create in Visual
Basic .NET.
Managed Extensions for C++ and attributed programming are just some of
the enhancements made to the C++ language. Managed Extensions simplify the task of
migrating existing C++ applications to the new .NET Framework.

C# is Microsofts new language. Its a C-style language that is essentially

C++ for Rapid Application Development. Unlike other languages, its specification is
just the grammar of the language. It has no standard library of its own, and instead has
been designed with the intention of using the .NET libraries as its own.

Microsoft Visual J# .NET provides the easiest transition for Java-language

developers into the world of XML Web Services and dramatically improves the
interoperability of Java-language programs with existing software written in a variety of
other programming languages.
Active State has created Visual Perl and Visual Python, which enable
.NET-aware applications to be built in either Perl or Python. Both products can be
integrated into the Visual Studio .NET environment. Visual Perl includes support for
Active States Perl Dev Kit.
Other languages for which .NET compilers are available include

FORTRAN

COBOL

Eiffel

Fig1 .Net Framework

ASP.NET
XML WEB SERVICES

Windows Forms

Base Class Libraries

Common Language Runtime
Operating System

C#.NET is also compliant with CLS (Common Language Specification) and supports
structured exception handling. CLS is set of rules and constructs that are supported by
the CLR (Common Language Runtime). CLR is the runtime environment provided by
the .NET Framework; it manages the execution of the code and also makes the
development process easier by providing services.
C#.NET is a CLS-compliant language. Any objects, classes, or components that
created in C#.NET can be used in any other CLS-compliant language. In addition, we
can use objects, classes, and components created in other CLS-compliant languages
in C#.NET .The use of CLS ensures complete interoperability among applications,
regardless of the languages used to create the application.

CONSTRUCTORS AND DESTRUCTORS:

Constructors are used to initialize objects, whereas destructors are used to
destroy them. In other words, destructors are used to release the resources allocated to
the object. In C#.NET the sub finalize procedure is available. The sub finalize
procedure is used to complete the tasks that must be performed when an object is
destroyed. The sub finalize procedure is called automatically when an object is
destroyed. In addition, the sub finalize procedure can be called only from the class it
belongs to or from derived classes.
GARBAGE COLLECTION
Garbage Collection is another new feature in C#.NET. The .NET Framework
monitors allocated resources, such as objects and variables. In addition, the .NET
Framework automatically releases memory for reuse by destroying objects that are no
longer in use.

In C#.NET, the garbage collector checks for the objects that are not currently in use
by applications. When the garbage collector comes across an object that is marked for
garbage collection, it releases the memory occupied by the object.
OVERLOADING
Overloading is another feature in C#. Overloading enables us to define multiple
procedures with the same name, where each procedure has a different set of
arguments. Besides using overloading for procedures, we can use it for constructors
and properties in a class.

MULTITHREADING:
C#.NET also supports multithreading. An application that supports multithreading
can handle multiple tasks simultaneously, we can use multithreading to decrease the
time taken by an application to respond to user interaction.
STRUCTURED EXCEPTION HANDLING
C#.NET supports structured handling, which enables us to detect and
remove errors at runtime. In C#.NET, we need to use TryCatchFinally statements
to create exception handlers. Using TryCatchFinally statements, we can create
robust and effective exception handlers to improve the performance of our
application.

THE .NET FRAMEWORK

The .NET Framework is a new computing platform that simplifies application
development in the highly distributed environment of the Internet.

OBJECTIVES OF. NET FRAMEWORK

1. To provide a consistent object-oriented programming environment whether object
codes is stored and executed locally on Internet-distributed, or executed remotely.
2. To provide a code-execution environment to minimizes software deployment and
guarantees safe execution of code.
3. Eliminates the performance problems.
There are different types of application, such as Windows-based applications and
Web-based applications.

4.3 Features of SQL-SERVER

The OLAP Services feature available in SQL Server version 7.0 is now
called SQL Server 2000 Analysis Services. The term OLAP Services has been replaced
with the term Analysis Services. Analysis Services also includes a new data mining
component. The Repository component available in SQL Server version 7.0 is now called
Microsoft SQL Server 2000 Meta Data Services. References to the component now use
the term Meta Data Services. The term repository is used only in reference to the
repository engine within Meta Data Services
SQL-SERVER database consist of six type of objects,
They are,
1. TABLE
2. QUERY
3. FORM
4. REPORT
5. MACRO

TABLE:
A database is a collection of data about a specific topic.
VIEWS OF TABLE:
We can work with a table in two types,
1. Design View

2. Datasheet View

Design View
To build or modify the structure of a table we work in the table
design view. We can specify what kind of data will be hold.
Datasheet View
To add, edit or analyses the data itself we work in tables datasheet
view mode.
QUERY:
A query is a question that has to be asked the data. Access gathers data that
answers the question from one or more table. The data that make up the answer is either
dynaset (if you edit it) or a snapshot (it cannot be edited).Each time we run query, we get
latest information in the dynaset. Access either displays the dynaset or snapshot for us to
view or perform an action on it, such as deleting or updating.
2. SYSTEM STUDY

2.1 FEASIBILITY STUDY

The feasibility of the project is analyzed in this phase and business proposal is
put forth with a very general plan for the project and some cost estimates. During
system analysis the feasibility study of the proposed system is to be carried out. This
is to ensure that the proposed system is not a burden to the company. For feasibility
analysis, some understanding of the major requirements for the system is essential.

Three key considerations involved in the feasibility analysis are

ECONOMICAL FEASIBILITY

TECHNICAL FEASIBILITY

SOCIAL FEASIBILITY

ECONOMICAL FEASIBILITY
This study is carried out to check the economic impact that the system will have
on the organization. The amount of fund that the company can pour into the research and
development of the system is limited. The expenditures must be justified. Thus the
developed system as well within the budget and this was achieved because most of the
technologies used are freely available. Only the customized products had to be purchased.
TECHNICAL FEASIBILITY
This study is carried out to check the technical feasibility, that is, the
technical requirements of the system. Any system developed must not have a high
demand on the available technical resources. This will lead to high demands on the
available technical resources. This will lead to high demands being placed on the client.
The developed system must have a modest requirement, as only minimal or null changes
are required for implementing this system.
SOCIAL FEASIBILITY
The aspect of study is to check the level of acceptance of the system by the user.
This includes the process of training the user to use the system efficiently. The user must
not feel threatened by the system, instead must accept it as a necessity. The level of
acceptance by the users solely depends on the methods that are employed to educate the

user about the system and to make him familiar with it. His level of confidence must be
raised so that he is also able to make some constructive criticism, which is welcomed, as
he is the final user of the system.
6. SYSTEM TESTING

The purpose of testing is to discover errors. Testing is the process of trying to

discover every conceivable fault or weakness in a work product. It provides a way to
check the functionality of components, sub assemblies, assemblies and/or a finished
product It is the process of exercising software with the intent of ensuring that the
Software system meets its requirements and user expectations and does not fail in an
unacceptable manner. There are various types of test. Each test type addresses a specific
testing requirement.

TYPES OF TESTS
Unit testing
Unit testing involves the design of test cases that validate that the internal program
logic is functioning properly, and that program inputs produce valid outputs. All decision
branches and internal code flow should be validated. It is the testing of individual
software units of the application .it is done after the completion of an individual unit
before integration. This is a structural testing, that relies on knowledge of its construction
and is invasive. Unit tests perform basic tests at component level and test a specific
business process, application, and/or system configuration. Unit tests ensure that each
unique path of a business process performs accurately to the documented specifications
and contains clearly defined inputs and expected results.

Integration testing
Integration tests are designed to test integrated software components to determine
if they actually run as one program. Testing is event driven and is more concerned with
the basic outcome of screens or fields. Integration tests demonstrate that although the
components were individually satisfaction, as shown by successfully unit testing, the
combination of components is correct and consistent. Integration testing is specifically
aimed at exposing the problems that arise from the combination of components.

Functional test
Functional tests provide systematic demonstrations that functions tested are
available as specified by the business and technical requirements, system documentation,
and user manuals.
Functional testing is centered on the following items:
Valid Input

: identified classes of valid input must be accepted.

Invalid Input

: identified classes of invalid input must be rejected.

Functions

: identified functions must be exercised.

Output

: identified classes of application outputs must be exercised.

Systems/Procedures: interfacing systems or procedures must be invoked.

Organization and preparation of functional tests is focused on requirements, key
functions, or special test cases. In addition, systematic coverage pertaining to identify
Business process flows; data fields, predefined processes, and successive processes must
be considered for testing. Before functional testing is complete, additional tests are
identified and the effective value of current tests is determined.

System Test
System testing ensures that the entire integrated software system meets requirements.
It tests a configuration to ensure known and predictable results. An example of system
testing is the configuration oriented system integration test. System testing is based on
process descriptions and flows, emphasizing pre-driven process links and integration
points.
White Box Testing
White Box Testing is a testing in which in which the software tester has knowledge
of the inner workings, structure and language of the software, or at least its purpose. It is
purpose. It is used to test areas that cannot be reached from a black box level.
Black Box Testing
Black Box Testing is testing the software without any knowledge of the inner
workings, structure or language of the module being tested. Black box tests, as most other
kinds of tests, must be written from a definitive source document, such as specification or
requirements document, such as specification or requirements document. It is a testing in
which the software under test is treated, as a black box .you cannot see into it. The test
provides inputs and responds to outputs without considering how the software works.

6.1 Unit Testing:

Unit testing is usually conducted as part of a combined code and unit test phase of
the software lifecycle, although it is not uncommon for coding and unit testing to be
conducted as two distinct phases.
Test strategy and approach

Field testing will be performed manually and functional tests will be written in
detail.

Test objectives

All field entries must work properly.

Pages must be activated from the identified link.

The entry screen, messages and responses must not be delayed.

Features to be tested

Verify that the entries are of the correct format

No duplicate entries should be allowed

All links should take the user to the correct page.

6.2 Integration Testing

Software integration testing is the incremental integration testing of two or more
integrated software components on a single platform to produce failures caused by
interface defects.

The task of the integration test is to check that components or software

applications, e.g. components in a software system or one step up software
applications at the company level interact without error.

Test Results: All the test cases mentioned above passed successfully. No defects
encountered.

6.3 Acceptance Testing

User Acceptance Testing is a critical phase of any project and requires significant
participation by the end user. It also ensures that the system meets the functional
requirements.

Test Results: All the test cases mentioned above passed successfully. No defects
encountered.

Conclution:

In terms to investigate more schemes based on the algorithm framework by

considering different optimization objectives and to find out the most appropriate
scheme in different environments. We also plan to enhance our algorithm
framework by considering the adaptive QoS to the time-varying network
conditions and resource availability.

Address the problem of signaling overhead due to multicast.