NOVEL DEFENSE MECHANISM AGAINST DATA FLOODING ATTACKS IN WIRELESS AD HOC NETWORKS

I. INTRODUCTION Consumer electronic devices have evolved depending on user needs. Users want to use compact and portable devices such as cellular phones, laptop computers, Personal Digital Assistants (PDAs), etc. anywhere and at anytime . They like to use those devices to download multimedia data or to access real-time traffic. Those devices are used as mobile nodes in wireless ad hoc networks; hence, wireless ad hoc networks on the basis of consumer electronics are expected to be widely used in the near future. In wireless ad hoc networks, the communications take place between mobile nodes, operating under limited energy of battery power rather than through base stations . Hence, it becomes extremely hazardous to wireless ad hoc networks when mobile nodes are clogged. Meanwhile, wireless ad hoc networks are vulnerable to security threats since all signals go through bandwidthconstrained wireless links and the routing decision are taken in a decentralized manner . Therefore, it is important to provide a path with secure robustness in wireless ad hoc networks. Wireless ad hoc networks can be victimized to various kinds of attacks . Among them, the ad hoc flooding attack can easily cause Denial-of-Service (DoS) attacks by flooding many RouteRequest (RREQ) or data packets . Since a mobile node has limited resource capacities such as memory space, computational ability, battery power, bandwidth capacity, and so on, it cannot provide services when it receives a lot of packets. Hence, the whole network as well as the victim node can get easily paralyzed. Even though attackers are able to conduct ad hoc flooding attacks by flooding either RREQ packets or data packets, most researches in this field have focused their study on RREQ flooding attacks much more than data flooding attacks . Contrary to other networks, the path construction from the

source node to the destination node is important in wireless ad hoc networks because the communication is performed via multiple hops without any infrastructure. Besides, the data flooding attack can be performed only after constructing a path. Therefore, an attacker sets up a path to the victim node so as to conduct data flooding attacks and then forwards tremendous useless data packets to the victim node along the path. However, the size of data packets is usually much larger than that of RREQ packets; i.e., 24 bytes for RREQ packets and 1 Kbytes or 512 bytes for data packets . Hence, resource consumption and bandwidth congestion of a node or the entire network can be easily occurred by data flooding attacks. The flooding attack prevention (FAP) suggested a defense system against either RREQ or data flooding attacks. The path cut off mechanism is used as defense against data flooding attacks . When the victim node realizes that it has been subjected to the data flooding attack, it may cut off the path. However, the procedure of the path cut off mechanism is not explained in detail, and FAP cuts off the path when many data

packets are transmitted to the victim node. Current users like to download or access multimedia data using the consumer electronic devices so that the packets may be transferred as burst traffic . However, FAP cannot distinguish burst traffic from attack traffic since FAP distinguishes an attack by comparing the incoming packets with a threshold. Hence, the throughput of burst traffic may degrade if a simple threshold-based defense system is used in FAP. Therefore, this paper proposes a novel period-based defense mechanism (PDM) against data flooding attacks taking enhancing the throughput of burst traffic into account. The proposed PDM scheme is based on periods and uses a blacklist to efficiently prevent the data flooding attack, as a result of which many data packets are forwarded at a high rate for the whole duration.

ABSTRACT
Mobile users like to use their own consumer electronic devices anywhere and at anytime to access multimedia data. Hence, we expect that wireless ad

hoc networks will be widely used in the near future since these networks form the topology with low cost on the fly. However, consumer electronic devices generally operate on limited battery power and therefore are vulnerable to security threats like data flooding attacks. The data flooding attack causes Denial of Service (DoS) attacks by flooding many data packets. However, there are a few existing defense systems against data flooding attacks. Moreover, the existing schemes may not guarantee the Quality of Service (QoS) of burst traffic since multimedia data are usually burst. Therefore, we propose a novel defense mechanism against data flooding attacks with the aim of enhancing the throughput.

OBJECTIVE In Wireless Ad Hoc Networks, the data flooding attack causes Denial of Service (DoS) attacks by flooding many data packets. Our objective is to proposes a novel period-based defense mechanism (PDM) against data flooding attacks.

PROBLEM DEFINITION
Our paper proposes a novel period-based defense mechanism (PDM) against data flooding attacks. Our proposed system PDM scheme is based on periods and uses a blacklist to efficiently prevent the data flooding attack, as a result of which many data packets are forwarded at a high rate for the whole duration.

LITERATURE SURVEY
Consumer electronic devices have evolved depending on user needs. Users want to use compact and portable devices such as cellular phones, laptop computers, Personal Digital Assistants (PDAs), etc. anywhere and at anytime. They like to use those devices to download multimedia data or to access real-time traffic. Those devices are used as mobile nodes in wireless ad hoc networks; hence, wireless ad hoc networks on the basis of consumer electronics are expected to be widely used in the near future. In wireless ad hoc networks, the communications take place between mobile nodes, operating under limited energy of battery power rather than through base stations. Hence, it becomes extremely hazardous to wireless ad hoc networks when mobile nodes are clogged. Meanwhile, wireless ad hoc networks are vulnerable to security threats since all signals go through bandwidth constrained wireless links and the routing decision are taken in a decentralized manner. Therefore, it is important to provide a path with secure robustness in wireless ad hoc networks. Wireless ad hoc networks can be victimized to various kinds of attacks. Among them, the ad hoc flooding attack can easily cause Denial-of-Service (DoS) attacks by flooding many Route Request (RREQ) or data packets. Since a mobile node has limited resource capacities such as memory space, computational ability, battery power, bandwidth capacity, and so on, it cannot provide services when it receives a lot of packets. Hence, the whole network as well as the victim node can get easily paralyzed.

Even though attackers are able to conduct ad hoc flooding attacks by flooding either RREQ packets or data packets, most researches in this field have focused their study on RREQ flooding attacks much more than data flooding attack. Contrary to other networks, the path construction from the source node to the destination node is important in wireless ad hoc networks because the communication is performed via multiple hops without any infrastructure. Besides, the data flooding attack can be performed only after constructing a path. Therefore, an attacker sets up a path to the victim node so as to conduct data flooding attacks and then forwards tremendous useless data packets to the victim node along the path. However, the size of data packets is usually much larger than that of RREQ packets; i.e., 24 bytes for RREQ packets and 1 Kbytes or 512 bytes for data packets. Hence, resource consumption and bandwidth congestion of a node or the entire network can be easily occurred by data flooding attacks. The flooding attack prevention (FAP) suggested a defense system against either RREQ or data flooding attacks. The path cut off mechanism is used as defense against data flooding attacks. When the victim node realizes that it has been subjected to the data flooding attack, it may cut off the path. However, the procedure of the path cut off mechanism is not explained in detail, and FAP cuts off the path when many data packets are transmitted to the victim node. Current users like to download or access multimedia data using the consumer electronic devices so that the packets may be transferred as burst traffic. However, FAP cannot distinguish burst traffic from attack traffic since FAP distinguishes an attack by comparing the incoming packets with a threshold. Hence, the throughput of burst traffic may degrade if a simple threshold-based defense system is used in FAP.

3. SYSTEM ANALYSIS
EXISTING SYSTEM
Ranging and positioning techniques are highly vulnerable to attacks from dishonest nodes and external attackers; dishonest nodes can report false position and distance information in order to cheat on their locations; external attackers can spoof measured positions of honest nodes. An attacker can generally influence all these measurements by jamming and delaying signals, and by modifying their signal strengths.

PROPOSED SYSTEM
We propose a different approach to secure datas while transferring, that relies on a set of covert base stations used for secure positioning to find the attack particularly. a novel period-based defense mechanism (PDM) against data flooding attacks taking enhancing the throughput of burst traffic into account

SYSTEM REQUIREMENTS

HARDWARE REQUIREMENTS: Processor Type Speed Ram Hard disk : : Pentium -IV : 2.4 GHZ : 128 MB RAM 20 GB HD

SOFTWARE REQUIREMENTS: Operating System Programming Package Tools SDK : : : : Windows 2000 JAVA Eclipse JDK1.5.0

SYSTEM DESIGN

Data Flow Diagram / Use Case Diagram / Flow Diagram

The DFD is also called as bubble chart. It is a simple graphical formalism that can be used to represent a system in terms of the input data to the system, various processing carried out on these data, and the output data is generated by the system.

DATA FLOW DIAGRAM

User

Base Station

External Attacks

Security Based on TDOA

Verify Attackers

Protocol Verification

Distance Measurement by CBS

Secure Positioning

Flooding attack prevention

Mutual Authentication

Secure Transmission

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.

Software Environment Java Technology

Java technology is both a programming language and a platform.

The Java Programming Language

The Java programming language is a high-level language that can be characterized by all of the following buzzwords: Simple Architecture neutral Object oriented Portable Distributed High performance Interpreted Multithreaded Robust Dynamic Secure With most programming languages, you either compile or interpret a program so that you can run it on your computer. The Java programming language is unusual in that a program is both compiled and interpreted. With the compiler, first you translate a program into an intermediate language called Java byte codes the platform-independent codes interpreted by the interpreter on the Java platform. The interpreter parses and runs each Java byte code instruction on the computer. Compilation happens just once; interpretation occurs each time the program is executed. The following figure illustrates how this works.

You can think of Java byte codes as the machine code instructions for the Java Virtual Machine (Java VM). Every Java interpreter, whether its a development tool or a Web browser that can run applets, is an implementation of the Java VM. Java byte codes help make write once, run anywhere possible. You can compile your program into byte codes on any platform that has a Java compiler. The byte codes can then be run on any implementation of the Java VM. That means that as long as a computer has a Java VM, the same program written in the Java programming language can run on Windows 2000, a Solaris workstation, or on an iMac.

The Java Platform

A platform is the hardware or software environment in which a program runs. Weve already mentioned some of the most popular platforms like Windows 2000, Linux, Solaris, and MacOS. Most

platforms can be described as a combination of the operating system and hardware. The Java platform differs from most other platforms in that its a software-only platform that runs on top of other hardwarebased platforms. The Java platform has two components:

The Java Virtual Machine (Java VM) The Java Application Programming Interface (Java API)

Youve already been introduced to the Java VM. Its the base for the Java platform and is ported onto various hardware-based platforms. The Java API is a large collection of ready-made software components that provide many useful capabilities, such as graphical user interface (GUI) widgets. The Java API is grouped into libraries of related classes and interfaces; these libraries are known as packages. The next section, What Can Java Technology Do? Highlights what functionality some of the packages in the Java API provide. The following figure depicts a program thats running on the Java platform. As the figure shows, the Java API and the virtual machine insulate the program from the hardware.

Native code is code that after you compile it, the compiled code runs on a specific hardware platform. As a platform-independent environment, the Java platform can be a bit slower than native code.

However, smart compilers, well-tuned interpreters, and just-in-time byte code compilers can bring performance close to that of native code without threatening portability.

What Can Java Technology Do?

The most common types of programs written in the Java programming language are applets and applications. If youve surfed the Web, youre probably already familiar with applets. An applet is a program that adheres to certain conventions that allow it to run within a Javaenabled browser. However, the Java programming language is not just for writing cute, entertaining applets for the Web. The general-purpose, high-level Java programming language is also a powerful software platform. Using the generous API, you can write many types of programs. An application is a standalone program that runs directly on the Java platform. A special kind of application known as a server serves and supports clients on a network. Examples of servers are Web servers, proxy servers, mail servers, and print servers. Another specialized program is a servlet. A servlet can almost be thought of as an applet that runs on the server side. Java Servlets are a popular choice for building interactive web applications, replacing the use of CGI scripts. Servlets are similar to applets in that they are runtime extensions of applications. Instead of working in browsers, though, Servlets run within Java Web servers, configuring or tailoring the server.

How does the API support all these kinds of programs? It does so with packages of software components that provides a wide range of functionality. Every full implementation of the Java platform gives you the following features:

The essentials: Objects, strings, threads, numbers, input

and output, data structures, system properties, date and time, and so on.

Applets: The set of conventions used by applets. Networking: URLs, TCP (Transmission Control

Protocol), UDP (User Data gram Protocol) sockets, and IP (Internet Protocol) addresses.

Internationalization: Help for writing programs that can

be localized for users worldwide. Programs can automatically adapt to specific locales and be displayed in the appropriate language.

Security: Both low level and high level, including

electronic signatures, public and private key management, access control, and certificates.

Software components: Known as JavaBeansTM, can plug Object serialization: Allows lightweight persistence and Java Database Connectivity (JDBCTM): Provides

into existing component architectures.

communication via Remote Method Invocation (RMI).

uniform access to a wide range of relational databases. The Java platform also has APIs for 2D and 3D graphics, accessibility, servers, collaboration, telephony, speech, animation, and

more. The following figure depicts what is included in the Java 2 SDK.

How Will Java Technology Change My Life? We cant promise you fame, fortune, or even a job if you learn the Java programming language. Still, it is likely to make your programs better and requires less effort than other languages. We believe that Java technology will help you do the following:

Get started quickly: Although the Java programming

language is a powerful object-oriented language, its easy to learn, especially for programmers already familiar with C or C+ +.

Write less code: Comparisons of program metrics (class

counts, method counts, and so on) suggest that a program written in the Java programming language can be four times smaller than the same program in C++.

Write better code: The Java programming language

encourages good coding practices, and its garbage collection

helps you avoid memory leaks. Its object orientation, its JavaBeans component architecture, and its wide-ranging, easily extendible API let you reuse other peoples tested code and introduce fewer bugs.

Develop programs more quickly: Your development

time may be as much as twice as fast versus writing the same program in C++. Why? You write fewer lines of code and it is a simpler programming language than C++.

Avoid platform dependencies with 100% Pure Java:

You can keep your program portable by avoiding the use of libraries written in other languages. The 100% Pure JavaTM Product Certification Program has a repository of historical process manuals, white papers, brochures, and similar materials online.

Write once, run anywhere: Because 100% Pure Java

programs are compiled into machine-independent byte codes, they run consistently on any Java platform.

Distribute software more easily: You can upgrade

applets easily from a central server. Applets take advantage of the feature of allowing new classes to be loaded on the fly, without recompiling the entire program. ODBC Microsoft Open Database Connectivity (ODBC) is a standard programming interface for application developers and database systems providers. Before ODBC became a de facto standard for Windows programs to interface with database systems, programmers had to use proprietary languages for each database they wanted to connect to. Now, ODBC has

made the choice of the database system almost irrelevant from a coding perspective, which is as it should be. Application developers have much more important things to worry about than the syntax that is needed to port their program from one database to another when business needs suddenly change. Through the ODBC Administrator in Control Panel, you can specify the particular database that is associated with a data source that an ODBC application program is written to use. Think of an ODBC data source as a door with a name on it. Each door will lead you to a particular database. For example, the data source named Sales Figures might be a SQL Server database, whereas the Accounts Payable data source could refer to an Access database. The physical database referred to by a data source can reside anywhere on the LAN. The ODBC system files are not installed on your system by Windows 95. Rather, they are installed when you setup a separate database application, such as SQL Server Client or Visual Basic 4.0. When the ODBC icon is installed in Control Panel, it uses a file called ODBCINST.DLL. It is also possible to administer your ODBC data sources through a stand-alone program called ODBCADM.EXE. There is a 16-bit and a 32-bit version of this program and each maintains a separate list of ODBC data sources. From a programming perspective, the beauty of ODBC is that the application can be written to use the same set of function calls to interface with any data source, regardless of the database vendor. The source code of the application doesnt change whether it talks to Oracle or SQL Server. We only mention these two as an example. There are ODBC drivers available for several dozen popular database systems. Even Excel spreadsheets and

plain text files can be turned into data sources. The operating system uses the Registry information written by ODBC Administrator to determine which low-level ODBC drivers are needed to talk to the data source (such as the interface to Oracle or SQL Server). The loading of the ODBC drivers is transparent to the ODBC application program. In a client/server environment, the ODBC API even handles many of the network issues for the application programmer. The advantages of this scheme are so numerous that you are probably thinking there must be some catch. The only disadvantage of ODBC is that it isnt as efficient as talking directly to the native database interface. ODBC has had many detractors make the charge that it is too slow. Microsoft has always claimed that the critical factor in performance is the quality of the driver software that is used. In our humble opinion, this is true. The availability of good ODBC drivers has improved a great deal recently. And anyway, the criticism about performance is somewhat analogous to those who said that compilers would never match the speed of pure assembly language. Maybe not, but the compiler (or ODBC) gives you the opportunity to write cleaner programs, which means you finish sooner. Meanwhile, computers get faster every year. JDBC In an effort to set an independent database standard API for Java; Sun Microsystems developed Java Database Connectivity, or JDBC. JDBC offers a generic SQL database access mechanism that provides a consistent interface to a variety of RDBMSs. This consistent interface is achieved through the use of plug-in database connectivity modules, or drivers. If a

database vendor wishes to have JDBC support, he or she must provide the driver for each platform that the database and Java run on. To gain a wider acceptance of JDBC, Sun based JDBCs framework on ODBC. As you discovered earlier in this chapter, ODBC has widespread support on a variety of platforms. Basing JDBC on ODBC will allow vendors to bring JDBC drivers to market much faster than developing a completely new connectivity solution. JDBC was announced in March of 1996. It was released for a 90 day public review that ended June 8, 1996. Because of user input, the final JDBC v1.0 specification was released soon after. The remainder of this section will cover enough information about JDBC for you to know what it is about and how to use it effectively. This is by no means a complete overview of JDBC. That would fill an entire book.

JDBC Goals
Few software packages are designed without goals in mind. JDBC is one that, because of its many goals, drove the development of the API. These goals, in conjunction with early reviewer feedback, have finalized the JDBC class library into a solid framework for building database applications in Java. The goals that were set for JDBC are important. They will give you some insight as to why certain classes and functionalities behave the way they do. The eight design goals for JDBC are as follows: 1. SQL Level API The designers felt that their main goal was to define a SQL interface for Java. Although not the lowest database interface level possible, it is at

a low enough level for higher-level tools and APIs to be created. Conversely, it is at a high enough level for application programmers to use it confidently. Attaining this goal allows for future tool vendors to generate JDBC code and to hide many of JDBCs complexities from the end user.

2. SQL Conformance SQL syntax varies as you move from database vendor to database vendor. In an effort to support a wide variety of vendors, JDBC will allow any query statement to be passed through it to the underlying database driver. This allows the connectivity module to handle nonstandard functionality in a manner that is suitable for its users.
3. JDBC must be implemental on top of common database interfaces

The JDBC SQL API must sit on top of other common SQL level APIs. This goal allows JDBC to use existing ODBC level drivers by the use of a software interface. This interface would translate JDBC calls to ODBC and vice versa. 4. Provide a Java interface that is consistent with the rest of the Java system Because of Javas acceptance in the user community thus far, the designers feel that they should not stray from the current design of the core Java system. 5. Keep it simple This goal probably appears in all software design goal listings. JDBC is no exception. Sun felt that the design of JDBC should be very simple, allowing for only one method of completing a task per mechanism.

Allowing duplicate functionality only serves to confuse the users of the API. 6. Use strong, static typing wherever possible Strong typing allows for more error checking to be done at compile time; also, less error appear at runtime. 7. Keep the common cases simple Because more often than not, the usual SQL calls used by the programmer are simple SELECTs, INSERTs, DELETEs and UPDATEs, these queries should be simple to perform with JDBC. However, more complex SQL statements should also be possible.

Finally we decided to proceed the implementation using Java Networking. And for dynamically updating the cache table we go for MS Access database. Java ha two things: a programming language and a platform. Java is a high-level programming language that is all of the following Simple Object-oriented Distributed Interpreted Robust Secure Architecture-neutral Portable High-performance multithreaded Dynamic

Java is also unusual in that each Java program is both compiled and interpreted. With a compile you translate a Java program into an intermediate language called Java byte codes the platformindependent code instruction is passed and run on the computer.

Compilation happens just once; interpretation occurs each time the program is executed. The figure illustrates how this works.

Java Program

Interpreter

Compilers

My Program

You can think of Java byte codes as the machine code instructions for the Java Virtual Machine (Java VM). Every Java interpreter, whether its a Java development tool or a Web browser that can run Java applets, is an implementation of the Java VM. The Java VM can also be implemented in hardware.

Java byte codes help make write once, run anywhere possible. You can compile your Java program into byte codes on my platform that has a Java compiler. The byte codes can then be run any implementation of the Java VM. For example, the same Java program can run Windows NT, Solaris, and Macintosh.

Networking
TCP/IP stack The TCP/IP stack is shorter than the OSI one:

TCP is a connection-oriented protocol; UDP (User Datagram Protocol) is a connectionless protocol.

IP datagrams
The IP layer provides a connectionless and unreliable delivery system. It considers each datagram independently of the others. Any association between datagram must be supplied by the higher layers. The IP layer supplies a checksum that includes its own header. The header includes the source and destination addresses. The IP layer handles routing through an Internet. It is also responsible for breaking up large datagram into smaller ones for transmission and reassembling them at the other end.

UDP
UDP is also connectionless and unreliable. What it adds to IP is a checksum for the contents of the datagram and port numbers. These are used to give a client/server model - see later.

TCP
TCP supplies logic to give a reliable connection-oriented protocol above IP. It provides a virtual circuit that two processes can use to communicate.

Internet addresses
In order to use a service, you must be able to find it. The Internet uses an address scheme for machines so that they can be located. The address is a 32 bit integer which gives the IP address. This encodes a network ID and more addressing. The network ID falls into various classes according to the size of the network address.

Network address
Class A uses 8 bits for the network address with 24 bits left over for other addressing. Class B uses 16 bit network addressing. Class C uses 24 bit network addressing and class D uses all 32.

Subnet address
Internally, the UNIX network is divided into sub networks. Building 11 is currently on one sub network and uses 10-bit addressing, allowing 1024 different hosts.

Host address 8 bits are finally used for host addresses within our subnet. This places a limit of 256 machines that can be on the subnet.

Total address

The 32 bit address is usually written as 4 integers separated by dots.

Port addresses
A service exists on a host, and is identified by its port. This is a 16 bit number. To send a message to a server, you send it to the port

for that service of the host that it is running on. This is not location transparency! Certain of these ports are "well known".

Sockets
A socket is a data structure maintained by the system to handle network connections. A socket is created using the call socket. It returns an integer that is like a file descriptor. In fact, under Windows, this handle can be used with Read File and Write File functions. #include <sys/types.h> #include <sys/socket.h> int socket(int family, int type, int protocol); Here "family" will be AF_INET for IP communications, protocol will be zero, and type will depend on whether TCP or UDP is used. Two processes wishing to communicate over a network create a socket each. These are similar to two ends of a pipe - but the actual pipe does not yet exist.

JFree Chart
JFreeChart is a free 100% Java chart library that makes it easy for developers to display professional quality charts in their applications. JFreeChart's extensive feature set includes: A consistent and well-documented API, supporting a wide range of chart types; A flexible design that is easy to extend, and targets both server-side and client-side applications;

Support for many output types, including Swing components, image files (including PNG and JPEG), and vector graphics file formats (including PDF, EPS and SVG); JFreeChart is "open source" or, more specifically, free software. It is distributed under the terms of the GNU Lesser General Public Licence (LGPL), which permits use in proprietary applications. 1. Map Visualizations Charts showing values that relate to geographical areas. Some examples include: (a) population density in each state of the United States, (b) income per capita for each country in Europe, (c) life expectancy in each country of the world. The tasks in this project include: Sourcing freely redistributable vector outlines for the countries of the world, states/provinces in particular countries (USA in particular, but also other areas); Creating an appropriate dataset interface (plus default implementation), a rendered, and integrating this with the existing XYPlot class in JFreeChart; Testing, documenting, testing some more, documenting some more. 2. Time Series Chart Interactivity

Implement a new (to JFreeChart) feature for interactive time series charts --- to display a separate control that shows a small version of ALL the time series data, with a sliding "view" rectangle that allows you to select the subset of the time series data to display in the main chart.

3. Dashboards There is currently a lot of interest in dashboard displays. Create a flexible dashboard mechanism that supports a subset of JFreeChart chart types (dials, pies, thermometers, bars, and lines/time series) that can be delivered easily via both Java Web Start and an applet.

4. Property Editors The property editor mechanism in JFreeChart only handles a small subset of the properties that can be set for charts. Extend (or reimplement) this mechanism to provide greater end-user control over the appearance of the charts.

Sample Code &SCREEN SHOTS

Myform.java package UI; import UI.myobjects.NodeButton; import UI.myobjects.NodeButton1; import UI.myobjects.draganddrop.DropTargetImp; import UI.myobjects.GraphicalNode; import UI.myobjects.PowerShower; import UI.actions.*;

import javax.swing.*; import java.awt.*; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.awt.event.MouseEvent; import java.awt.event.MouseListener; import java.awt.event.MouseMotionListener; import java.awt.image.ImageConsumer; import java.awt.image.ImageProducer; import java.util.ArrayList; import java.util.List; import java.util.Observer; import simulator.Node; import logger.StatusManager;

public

class

Myform

extends

JFrame

implements

ActionListener,MouseListener { public final NumberKeyListener nkl = new NumberKeyListener(); JPanel content; public MyMap myMap; public static MapForm mapForm; int P = 20, Q = 20,p=0,q=0, dp = 3, dq = 3;

private Image cup; // private Panel keyPad; public int top = 10; public int left = 10;

private Node_Properties nodePanel; public int xScale = 10; public int yScale = 10; public final int mapWidth = 550; public final int mapHeight = 550;

public NodeButton newNodeBtn = new NodeButton(new ImageIcon("images/SendingNode0.png")); // public NodeButton1 newNodeBttn = new NodeButton1(new ImageIcon("images/virus.gif"));

private final List<GraphicalNode> graphicalNodes = new ArrayList<GraphicalNode>(); private final JTextField minNumber = new JTextField("3",3); private final JCheckBox doubleDirection = new JCheckBox("DoubleDirection",true);

private final JTextField searchText = new JTextField(8); JButton generateBtn ; JButton delGnodeBtn = new JButton(new ImageIcon("images/delete.png")); PowerShower powerShower; JToolBar toolBar; public JButton start =new JButton("Attacker"); // JButton stop =new JButton("Stop"); private GraphicalNode selectedGNode; // JButton atkBtn=new JButton("Gen. Attacker"); public List<GraphicalNode> getGraphicalNodes() { return graphicalNodes; } /** * returns the {@link GraphicalNode} that currently selecteed */ public GraphicalNode getSelectedGNode() { return selectedGNode; } public MyMap getMyMap() {

return myMap; } public void refreshPowerShower(){ this.powerShower.setVisible(false); this.powerShower.setXYrXrY(selectedGNode.getLocation().x,sel ectedGNode.getLocation().y, selectedGNode.getNode().getPower()/this.xScale,selected GNode.getNode().getPower()/this.yScale); this.powerShower.setVisible(true); this.powerShower.invalidate(); } public void setSelectedGNode(GraphicalNode selectedGNode) { this.selectedGNode = selectedGNode; if (selectedGNode!=null){ this.getNodePanel().nameText.setEnabled(selectedGNode.ge tName().trim().length()==0); selectedGNode.fillNodePanel(); this.refreshPowerShower(); }else{ this.powerShower.setVisible(false); } } public Myform(String title) { super(title); content = new JPanel(new BorderLayout());

content.setOpaque(true); myMap = new MyMap(); myMap.setPreferredSize(new Dimension(this.mapWidth,this.mapHeight)); myMap.setBorder(BorderFactory.createEtchedBorder());

// newNodeBttn.setToolTipText("Attacker"); newNodeBtn.setToolTipText("Base Station"); cup = Toolkit.getDefaultToolkit().getImage("images/virus.gif"); this.getContentPane().add(content); toolBar = new JToolBar(); // toolBar.add(newNodeBttn); // toolBar.add(atkBtn); toolBar.add(newNodeBtn); toolBar.add(delGnodeBtn); start.setIcon(new ImageIcon("images/virus.gif")); toolBar.add(start); // toolBar.add(stop); toolBar.add(Box.createHorizontalStrut(5)); toolBar.add(new JSeparator(SwingConstants.VERTICAL)); toolBar.add(Box.createHorizontalStrut(5)); toolBar.add(new JLabel("Min Neighbor: "));

toolBar.add(minNumber); toolBar.add(doubleDirection); generateBtn = new JButton("Fill Parameter"); toolBar.add(generateBtn); minNumber.addKeyListener(new NumberKeyListener()); toolBar.add(Box.createHorizontalStrut(5)); toolBar.add(new JSeparator(SwingConstants.VERTICAL)); toolBar.add(Box.createHorizontalStrut(5)); toolBar.add(new JLabel("Search: ")); toolBar.add(searchText); content.add(toolBar,BorderLayout.PAGE_START); // atkBtn.addActionListener(this); start.addActionListener(this); // stop.addActionListener(this); // newNodeBttn.addMouseListener(this); myMap.setDropTarget(new DropTargetImp(myMap)); myMap.setLayout(null);

} public boolean isDoubleDirection(){ return this.doubleDirection.isSelected(); }

public int getMinNumberForFillParameter(){ if (this.minNumber.getText().trim().length()>0){ return Integer.parseInt(this.minNumber.getText()); }else{ return 0; } } /** * finds GraphicalNode in graphicalNode list * @param name * @return null: if it didn't find the gnode with name<br/> * */ public GraphicalNode getGNode(String name){ for (GraphicalNode graphicalNode : graphicalNodes) { if (graphicalNode.getName().equals(name)){ return graphicalNode; } } return null; } public void putGNode (GraphicalNode gNode){ graphicalNodes.add(gNode); } public Node_Properties getNodePanel() { reference to that node if it found

return nodePanel; } public void setNodePanel(Node_Properties nodePanel) { this.nodePanel = nodePanel; } public GraphicalNode getGnodebyNode(Node node){ for (GraphicalNode graphicalNode : graphicalNodes) { if (graphicalNode.getNode().equals(node)){ return graphicalNode; } } return null; } public JTextField getSearchText() { return searchText; } public static void main(String[] args) { Myform frame = new Myform("Mitigating Selective Forwarding Attacks with a Channel-Aware Approach in WMNs"); frame.newNodeBtn.myForm = frame; // frame.newNodeBttn.myForm = frame;

frame.setNodePanel(new Node_Properties(frame)); JSplitPane NodePanel()); splitPane.setOneTouchExpandable(true); splitPane.setDividerLocation(550); frame.content.add(splitPane,BorderLayout.CENTER); frame.myMap.addMouseListener(new PanelAction(frame)); //frame.atkBtn.addActionListener(this); frame.generateBtn.addActionListener(new InitParameters(frame)); frame.powerShower = new PowerShower(frame); frame.delGnodeBtn.addActionListener(new DeleteBtnAction(frame)); frame.searchText.addActionListener(new SearchGNodeAction(frame)); frame.setGlassPane(frame.powerShower); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); frame.pack(); mapForm = new MapForm(frame,"Initializing Map",true,frame); mapForm.pack(); mapForm.setVisible(true); StatusManager.init(frame); splitPane = new JSplitPane(JSplitPane.HORIZONTAL_SPLIT,frame.myMap,frame.get

} public attacker atk; public void actionPerformed(ActionEvent e) { // GraphicalNode my=getSelectedGNode(); if(e.getSource()==start) { atk = new attacker(myMap); //atk.start(); atk.start(); start.setEnabled(false); } /*else if(e.getSource()==stop) { String s=ball.getState().toString(); System.out.println("State :"+s); if(!s.equalsIgnoreCase("TERMINATED")) { // JOptionPane.showMessageDialog(null," stop pressed at ("+ball.p * (mapForm.mapWidth/550)+","+ball.q* (mapForm.mapHeight/550)+")"); start.setEnabled(true); ball.b=3; ball.setState(2); System.out.println("stop pressed"); Graphics g = ball.box.getGraphics();

Dimension d = ball.box.getSize(); g.setColor(Color.white); g.fillRect(ball.p-3,ball.q-3,ball.P+3,ball.Q+3); } }*/ }

/*public void moved() { GraphicalNode my=getSelectedGNode(); p=my.getX(); q=my.getY(); my.setScaledCoordinates(p, q); p += dp; q += dq; Dimension d = myMap.getSize(); if (p < 0) { p = 0; dp = -dp; } if (p + P >= d.width) {

p = d.width - P; dp = -dp; } if (q < 0) { q = 0; dq = -dq; } if (q + Q >= d.height) { q = d.height - Q; dq = -dq; } my.setScaledCoordinates(p, q); } public void running() { for (int i = 1; i <= 800; i++) { moved();

try { Thread.sleep(100); } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace(); }

} } */ public void mouseClicked(MouseEvent e) { System.out.println("hai"); GraphicalNode my=getSelectedGNode(); int xaa=my.getLocation().x; int yaa=my.getLocation().y; System.out.println(" Axis :"+xaa+","+yaa); int xAxis=my.getLocation().x; int yAxis=my.getLocation().y; my.setScaledCoordinates(xAxis, yAxis); for(int i=xAxis;i<xAxis+1000;i+=100) { for(int j=yAxis;j<yAxis+1000;j+=100) { my.setScaledCoordinates(xAxis+i, yAxis+j); Point p=my.getLocation(); System.out.println("xy"+i+":"+p); try { Thread.sleep(100);

} catch (InterruptedException e1) { e1.printStackTrace(); } //my.fillNodePanel(); } }

} //newNodeBttn.move();

public void mouseEntered(MouseEvent e) { // TODO Auto-generated method stub } public void mouseExited(MouseEvent e) { // TODO Auto-generated method stub } public void mousePressed(MouseEvent e) {

// TODO Auto-generated method stub } public void mouseReleased(MouseEvent e) { // TODO Auto-generated method stub }

/* public Myform() { cup = Toolkit.getDefaultToolkit().getImage("images/virus.gif"); }

public void paint(Graphics g) { g.drawImage(cup, left, top,this); }

public void actionPerformed(ActionEvent e) { System.out.println("hello");

if ( e.getSource()==atkBtn) { // left=left-10; left=left+10; top=top-10; top=top+20; repaint(); }

} */

Node_Properties.java &Attacker.java: package UI; import UI.actions.NodePropOKBtnAction; import UI.actions.NodePropResetBtnAction; import UI.actions.NodePropSendtoBtnAction; import javax.swing.*; import java.awt.*; import java.awt.event.ActionListener; import java.awt.event.ActionEvent;

public

class

Node_Properties

extends

JPanel

implements

ActionListener { JButton resetBtn,OkBtn,SendBtn; public IPText,nameText,xText,yText,powerText,sendToText; public JTextArea dataText,recievedDataText,statusText; public JButton colorBtn; private Myform myForm; public Node_Properties(Myform myForm) { this.myForm = myForm; JLabel IPLbl,nameLbl,xLbl,yLbl,powerLbl,colorLbl,sendToLbl,dataLbl,recieve dDataLbl,statusLbl; //create main layout Box v1 = Box.createVerticalBox(); this.add(v1); //create first box labels IPLbl = new JLabel("IP: "); nameLbl = new JLabel("Name: "); xLbl = new JLabel("X :"); yLbl = new JLabel("Y :"); powerLbl = new JLabel("Power: "); colorLbl = new JLabel("Color: "); //create first box textfield ActionListener NodePropOKBtnAction(this.myForm); okAction = new JTextField

IPText = new JTextField(8); IPText.addActionListener(okAction); nameText = new JTextField(8); nameText.addActionListener(okAction); xText = new JTextField(1); xText.addKeyListener(myForm.nkl); yText = new JTextField(1); yText.addKeyListener(myForm.nkl); powerText = new JTextField(3); powerText.addKeyListener(myForm.nkl); powerText.addActionListener(okAction); colorBtn = new JButton(); colorBtn.setMaximumSize(new Dimension(50,50)); colorBtn.addActionListener(this); //create first box buttons OkBtn = new JButton("OK"); OkBtn.addActionListener(okAction ); resetBtn = new JButton("Reset"); resetBtn.addActionListener(new NodePropResetBtnAction(this.myForm)); //create layout for first box JPanel firstBox = new JPanel(); v1.add(firstBox); firstBox.setBorder( BorderFactory.createCompoundBorder( BorderFactory.createTitledBorder("Node Properties"), BorderFactory.createEmptyBorder(5,5,5,5)));

Box v11 = Box.createVerticalBox(); firstBox.add(v11); Box h11 = Box.createHorizontalBox(); h11.add(IPLbl); h11.add(Box.createHorizontalGlue()); h11.add(IPText); v11.add(h11); Box h12 = Box.createHorizontalBox(); h12.add(nameLbl); h12.add(Box.createHorizontalGlue()); h12.add(nameText); v11.add(h12); Box h13 = Box.createHorizontalBox(); h13.add(xLbl); h13.add(Box.createHorizontalStrut(7)); h13.add(xText); h13.add(Box.createHorizontalGlue()); h13.add(yLbl); h13.add(Box.createHorizontalStrut(7)); h13.add(yText); v11.add(h13); Box h14 = Box.createHorizontalBox(); h14.add(powerLbl); h14.add(Box.createHorizontalStrut(7)); h14.add(powerText); h14.add(Box.createHorizontalGlue());

h14.add(colorLbl); h14.add(Box.createHorizontalStrut(7)); h14.add(colorBtn); v11.add(h14); v11.add(Box.createVerticalStrut(10)); Box h15 = Box.createHorizontalBox(); h15.add(Box.createHorizontalGlue()); h15.add(resetBtn); h15.add(Box.createHorizontalStrut(7)); h15.add(OkBtn); v11.add(h15); //create second box labels dataLbl = new JLabel("Data: "); sendToLbl = new JLabel("Send To:"); //create second box text field dataText = new JTextArea(4,12); JScrollPane dataSP= new JScrollPane(dataText); sendToText = new JTextField(10); //create second box buttons

SendBtn = new JButton("Send"); SendBtn.addActionListener(new NodePropSendtoBtnAction(this.myForm)); //create second box layouts

JPanel secondBox = new JPanel(); v1.add(secondBox); secondBox.setBorder( BorderFactory.createCompoundBorder( BorderFactory.createTitledBorder("Data to send"), BorderFactory.createEmptyBorder(5,5,5,5))); Box v21 = Box.createVerticalBox(); secondBox.add(v21); Box h21 = Box.createHorizontalBox(); h21.add(sendToLbl); h21.add(sendToText); v21.add(h21); v21.add(Box.createVerticalStrut(3)); Box h22 = Box.createHorizontalBox(); Box v221 = Box.createVerticalBox(); v221.add(dataLbl); v221.add(Box.createVerticalGlue()); h22.add(v221); h22.add(dataSP); v21.add(h22); v21.add(Box.createVerticalStrut(10)); Box h23 = Box.createHorizontalBox(); h23.add(Box.createHorizontalGlue()); h23.add(SendBtn); v21.add(h23); //create third box labels

recievedDataLbl = new JLabel("RData: "); statusLbl = new JLabel("Status: "); //create third box text fields recievedDataText = new JTextArea(5,20); recievedDataText.setEditable(false); JScrollPane rdataSP= new JScrollPane(recievedDataText); statusText = new JTextArea(5,20); statusText.setEditable(false); JScrollPane statusSP = new JScrollPane(statusText); //create third box layouts JPanel thirdBox = new JPanel(); v1.add(thirdBox); thirdBox.setBorder( BorderFactory.createCompoundBorder( BorderFactory.createTitledBorder("Status"), BorderFactory.createEmptyBorder(5,5,5,5))); Box v31 = Box.createVerticalBox(); thirdBox.add(v31); Box h31 = Box.createHorizontalBox(); Box v311 = Box.createVerticalBox(); v311.add(recievedDataLbl); v311.add(Box.createVerticalGlue()); h31.add(v311); h31.add(rdataSP); v31.add(h31); v31.add(Box.createVerticalStrut(3)); Box h32 = Box.createHorizontalBox();

Box v321 = Box.createVerticalBox(); v321.add(statusLbl); v321.add(Box.createVerticalGlue()); h32.add(v321); h32.add(statusSP); v31.add(h32); } public void actionPerformed(ActionEvent e) { Color newColor = JColorChooser.showDialog( Node_Properties.this, "Choose Background Color", colorBtn.getBackground()); if (newColor != null) { colorBtn.setBackground(newColor); } } public void resetNodePropertiest() { this.nameText.setText(""); this.IPText.setText(""); this.xText.setText(""); this.yText.setText(""); this.powerText.setText(""); this.colorBtn.setBackground(this.getBackground());

this.nameText.setEnabled(true); } public void resetNodePanel() { resetNodePropertiest(); this.sendToText.setText(""); this.dataText.setText(""); this.recievedDataText.setText(""); this.statusText.setText(""); } }

Map_Manager.java: package simulator; import simulator.Packets.Packet; import simulator.mapmanagerrelated.TaskSpeedSimulator; import static java.lang.Math.*; import java.util.List; import java.util.ArrayList; import java.util.Timer;

import java.util.TimerTask; import logger.MyLogger;

public class Map_Manager { private List node_list = new ArrayList(); private static Map_Manager map_manager = new Map_Manager(); private static long speedPercent = 200; private Map_Manager() { } public static Map_Manager get_instance(){ return map_manager; } public List getNode_list() { return node_list; } public void setNode_list(List node_list) { this.node_list = node_list; } public void addNode(Node new_node) { node_list.add(new_node);

} public void delNode(Node garbage_node) { node_list.remove(garbage_node); } public double getDistance(Node a, Node b) { int x_distance = a.getNode_coordinates().getX_coordinate() b.getNode_coordinates().getX_coordinate(); int y_distance = a.getNode_coordinates().getY_coordinate() b.getNode_coordinates().getY_coordinate(); double distance = Math.sqrt((x_distance * x_distance) + (y_distance * y_distance)); MyLogger.logger.debug(a.getNode_coordinates() + ", " + b.getNode_coordinates() + ", " + distance+","+a.getPower()); return distance; } public void sendPacket(Packet packet_to_send, Node src_node) { for (Object aNode_list : node_list) { Node tempNode = (Node) aNode_list; if (getDistance(src_node, tempNode) <= src_node.getPower() && !tempNode.equals(src_node)) { new Timer("Mapmanager: Sending packet from "+src_node+" to "+tempNode,true) .schedule(new TaskSpeedSimulator(packet_to_send,src_node,tempNode),

Math.round(getDistance(src_node,tempNode))/1 00*speedPercent); } } } public boolean sendPacket(Packet packet_to_send, Node src_node, Node dest_node) { if (getDistance(src_node, dest_node) <= src_node.getPower()) { new Timer("Mapmanager: Sending packet from "+src_node+" to "+dest_node,true) .schedule(new TaskSpeedSimulator(packet_to_send,src_node,dest_node), Math.round(getDistance(src_node,dest_node))/100* speedPercent); return true; } return false; } }

Graph.java: package graph;

import java.awt.BasicStroke; import java.awt.Color; import java.awt.Polygon; import java.awt.Shape; import java.awt.geom.Rectangle2D; import java.sql.Connection; import java.sql.DriverManager; import java.sql.ResultSet; import java.sql.Statement; import java.util.StringTokenizer; import java.util.Vector; import org.jfree.chart.ChartFactory; import org.jfree.chart.ChartPanel; import org.jfree.chart.JFreeChart; import org.jfree.chart.axis.NumberAxis; import org.jfree.chart.plot.CategoryPlot; import org.jfree.chart.plot.DefaultDrawingSupplier; import org.jfree.chart.plot.DrawingSupplier; import org.jfree.chart.plot.PlotOrientation; import org.jfree.chart.renderer.category.LineAndShapeRenderer;

import org.jfree.data.category.CategoryDataset; import org.jfree.data.category.DefaultCategoryDataset; import org.jfree.ui.ApplicationFrame; import org.jfree.ui.RefineryUtilities;

public class graph extends ApplicationFrame {

public graph(final String title) { super(title); final CategoryDataset dataset = createDataset(); final JFreeChart chart = createChart(dataset); final ChartPanel chartPanel = new ChartPanel(chart); chartPanel.setPreferredSize(new java.awt.Dimension(500, 270)); setContentPane(chartPanel); }

private CategoryDataset createDataset() { // row keys... final String series1 = "Position"; final String series2 = "Distance"; //final String series3 = "Failure Recovery Time";

Vector vec1=new Vector(); Vector vec2=new Vector(); // Vector vec3=new Vector();

// create the dataset... final DefaultCategoryDataset dataset = new DefaultCategoryDataset(); try { Class.forName("com.mysql.jdbc.Driver"); String url="jdbc:mysql://localhost:3306/secure"; Connection con=DriverManager.getConnection(url,"root","root"); Statement st=con.createStatement(); //DBConnection connection2=new DBConnection(); //Util util=new Util(); ResultSet rs=null; String sql=null; sql="SELECT * FROM local"; rs=st.executeQuery(sql); Vector v1=new Vector(); Vector v2=new Vector(); // Vector v3=new Vector();

while(rs.next()) { v1.addElement(rs.getString(1)); v2.addElement(rs.getString(2)); // } System.out.println("v1============"+v1); System.out.println("v2============"+v2); //System.out.println("v3============"+v3); for (int i = 0; i < v1.size(); i++) { StringTokenizer StringTokenizer(v1.elementAt(i).toString(),"T[pos ] ="); vec1.addElement(tokenizer.nextToken()); } for (int i = 0; i < v2.size(); i++) { StringTokenizer StringTokenizer(v2.elementAt(i).toString(),"T[ Td ] ="); vec2.addElement(tokenizer.nextToken()); } /*for (int i = 0; i < v3.size(); i++) tokenizer=new tokenizer=new v3.addElement(rs.getString(3));

{ StringTokenizer StringTokenizer(v3.elementAt(i).toString(),"T[ r ] ="); vec3.addElement(tokenizer.nextToken()); }*/ System.out.println("vecc==="+vec1); System.out.println("vecc==="+vec2); //System.out.println("vecc==="+vec3); for (int i = 0; i < vec1.size(); i++) { tokenizer=new

dataset.addValue(Float.parseFloat(vec1.elementAt(i).toString()), series1, String.valueOf(i)); } for (int i = 0; i < vec2.size(); i++) {

dataset.addValue(Float.parseFloat(vec2.elementAt(i).toString()), series2, String.valueOf(i)); } /*for (int i = 0; i < vec3.size(); i++) {

dataset.addValue(Float.parseFloat(vec3.elementAt(i).toString()), series3, String.valueOf(i)); } */ }catch(Exception e){e.printStackTrace();}

return dataset; } private JFreeChart createChart(final CategoryDataset dataset) { final JFreeChart chart = ChartFactory.createLineChart( "Novel defense mechanism against data flooding attacks in wireless ad hoc networks", "Distance", "Execution Time", dataset, true, true, false ); // final StandardLegend legend = (StandardLegend) // data // include legend // tooltips // urls // chart title // domain axis label // range axis label

PlotOrientation.VERTICAL, // orientation

chart.getLegend();

//

legend.setDisplaySeriesShapes(true); final Shape[] shapes = new Shape[3]; int[] xpoints; int[] ypoints; // right-pointing triangle xpoints = new int[] {-3, 3, -3}; ypoints = new int[] {-3, 0, 3}; shapes[0] = new Polygon(xpoints, ypoints, 3); // vertical rectangle shapes[1] = new Rectangle2D.Double(-2, -3, 3, 6); // left-pointing triangle xpoints = new int[] {-3, 3, 3}; ypoints = new int[] {0, -3, 3}; shapes[2] = new Polygon(xpoints, ypoints, 3); final DrawingSupplier supplier = new DefaultDrawingSupplier( DefaultDrawingSupplier.DEFAULT_PAINT_SEQUENCE, DefaultDrawingSupplier.DEFAULT_OUTLINE_PAINT_SEQU

ENCE, DefaultDrawingSupplier.DEFAULT_STROKE_SEQUENCE, DefaultDrawingSupplier.DEFAULT_OUTLINE_STROKE_SE QUENCE, shapes

); final CategoryPlot plot = chart.getCategoryPlot(); plot.setDrawingSupplier(supplier); chart.setBackgroundPaint(Color.CYAN); // set the stroke for each series... plot.getRenderer().setSeriesStroke( 0, new BasicStroke( 2.0f, BasicStroke.JOIN_ROUND, 1.0f, new float[] {10.0f, 6.0f}, 0.0f ) ); plot.getRenderer().setSeriesStroke( 1, new BasicStroke( 2.0f, BasicStroke.JOIN_ROUND, 1.0f, new float[] {6.0f, 6.0f}, 0.0f ) ); plot.getRenderer().setSeriesStroke( 2, new BasicStroke( BasicStroke.CAP_ROUND, BasicStroke.CAP_ROUND,

2.0f, BasicStroke.JOIN_ROUND, 1.0f, new float[] {2.0f, 6.0f}, 0.0f ) ); // customise the renderer... final //

BasicStroke.CAP_ROUND,

LineAndShapeRenderer

renderer

(LineAndShapeRenderer) plot.getRenderer(); renderer.setDrawShapes(true); renderer.setItemLabelsVisible(true); // customise the range axis... final plot.getRangeAxis(); rangeAxis.setStandardTickUnits(NumberAxis.createIntegerTick Units()); rangeAxis.setAutoRangeIncludesZero(false); rangeAxis.setUpperMargin(0.12); return chart; } public static void main(final String[] args) { NumberAxis rangeAxis = (NumberAxis)

final graph local = new graph("Novel defense mechanism against data flooding attacks in wireless ad hoc networks"); local.pack(); RefineryUtilities.centerFrameOnScreen(local); local.setVisible(true); } }

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 components. exposing the problems that arise from the combination of

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 Invalid Input Functions Output 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 : identified classes of valid input must be accepted. : identified classes of invalid input must be rejected. : identified functions must be exercised. : identified classes of application outputs must be

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.

7. CONCLUSION We have proposed the period-based defense mechanism against data flooding attacks. The data flooding attack paralyzes a victim node by consuming its resources. Hence, the throughput of the victim node is significantly reduced. However, the current defense systems focus on RREQ flooding attacks rather than the data flooding attack. They easily reduce the throughput of burst traffic by comparing with the simple threshold. Hence, we aim to enhance the throughput of burst traffic under the data flooding attack. The proposed scheme uses a blacklist, considers the data type, and processes packets according to the priority so as to defend against data flooding attacks; since the attacker forwards many data packets at a high rate for the whole session. Recently, many users like to download and share multimedia data, so we expect that the proposed scheme is useful to networks where burst traffic are transferred.

REFERENCES
[1] A. Jamalipour, "Self-organizing networks [message from the editor-inchief]," IEEE Wireless Communications, vol. 15, no. 6, pp.2-3, Dec. 2008. [2] S.-J. Lee and M. Gerla, "Split multipath routing with maximally disjoint paths in ad hoc networks," IEEE International Conference on Communications (ICC 2001), vol. 10, pp. 3201-3205, Jun. 2001.

[3] L. Xia and J. Slay, "Securing wireless ad hoc networks: towards a mobile agent security architecture," the 2nd Australian Information Security Management Conference 2004 (InfoSec 2004), Nov. 2004. [4] M. Al-Shurman, S.-M. Yoo, and S. Park, "Black hole attack in mobile ad hoc networks," the 42nd annual Southeast regional conference ACM Southeast Regional Conference (ACMSE 2004), pp. 96-97, Apr. 2004. [5] Y.-C. Hu, A. Perrig, D. B. Johnson, "Wormhole attacks in wireless networks," IEEE Journal on Selected Areas in Communications, vol. 24, no. 2, pp. 370- 380, Feb. 2006. [6] Y.-C. Hu, A. Perrig, and D. B. Johnson, "Rushing attacks and defense in wireless ad hoc network routing protocols," the 2nd ACM Workshop on Wireless Security, pp. 30-40, Sept. 2003. [7] P. Yi, Z. Dai, Y. Zhong, and S. Zhang, "Resisting flooding attacks in ad hoc networks," International Conference on Information Technology: Coding and Computing 2005 (ITCC 2005), vol. 2, pp. 657-662, Apr. 2005. [8] S. Desilva and R. V. Boppana, "Mitigating malicious control packet floods in ad hoc networks," IEEE Wireless Communications and Networking Conference 2005 (WCNC 2005), vol. 4, pp. 2112-536, Mar. 2005.

[9] S. Li, Q. Liu, H. Chen, and M. Tan, "A new method to resist flooding attacks in ad hoc networks," IEEE Wireless Communications, Networking and Mobile Computing 2006 (WiCOM 2006), pp. 1-4, Sep. 2006. [10] A. Khan, T. Suzuki, M. Kobayashi, W. Takita, and K. Yamazaki, "Packet size based routing for stable data delivery in mobile ad-hoc networks," IEICE Transactions on Communications, vol. E91-B, no. 7, pp. 2244-2254, July 2008. [11] X. Yang, Y. Shi, M. Zeng, and R. Zhao, "A novel method of network burst traffic real-time prediction based on decomposition," International Conference on Networking (ICN), Lecture Notes in Computer Science, vol. 3420, pp. 784- 793, Apr. 2005. [12] H. Kim, S. Han, and J. Song, "Maximum lifetime paths for the high packet delivery ratio using fast recover in a mobile ad hoc network," International Conference on Computational Science (ICCS 2006), Lecture Notes in Computer Science, vol. 3992, pp.1101-1104, May. 2006