Wireless Intrusion detection and new attack model
Hello,
Engineers...Here follows an a new IEEE based java-networking project which i'm gng to discuss----->
any one can copy the things......
TOPIC title:Wireless Intrusion detection and new attack model
ABSTRACT and BASE Paperđ˛f this project..........
Denial-of-Service attacks, and jamming in particular,
are a threat to wireless networks because they are at the
same time easy to mount and difficult to detect and stop. We
propose a distributed intrusion detection system in which
each node monitors the traffic flow on the network and collects
relevant statistics about it. By combining each nodeâs
view we are able to tell if (and which type of) an attack
happened or if the channel is just saturated. However, this
system opens the possibility for misuse. We discuss the impact
of the misuse on the system and the best strategies for
each actor..
1 Introduction
Denial-of-Service attacks are a threat to informative systems
which aim at blocking the service to legitimate users,
which is often the first step in a series of attacks. In a shared
medium environment an attacker could block another user
to get more bandwidth, or a service provider could be attacked
by a competitor to lower its reputation in front of the
customers.
In wireless networks, DoS attacks can be categorized according
to the features they exploit. We can distinguish between
attacks to the authentication mechanisms (Deauthentication
flooding, EAP-Logoff ), to the power saving capabilities
(Sleep deprivation) and to the radio layer (jamming,
that is the the emission of power over a frequency to disturb
communications [7]). A number of them can be easily
implemented with commodity hardware [4]. The problem
with wireless networks is that it is very hard, if not impossible,
to distinguish betweenânormalâ malfunctioning (for
example, random interferences on the channel or temporary
saturation of the Access Point) and attacks.
Intrusion detection systems (IDS) on wireless networks
are an open research topic. In the wireless world, anomaly
detection seems to fit better as many attacks happen at MAC
level, which means that itâs very difficult to isolate fixed sequences
of packets to use in a signature-based IDS. Also, as
wireless networks are a relatively new technology, itâs likely
that new attack methods will be found [3, 8]. What also
emerged, is that detection should be distributed, as some attacks
(and jamming in particular) cannot be detected by a
single node [7].
In this paper we propose an attack detection mechanism
based on shared monitoring of the network by all nodes.
which should be able to tell whether the network is experiencing
a real malfunctioning or is under attack. Such a
system in the hands of service provider can give it a good
way to prevent attacks, and it can be used in a public service
context as well, by allowing clients to monitor the Quality
of Service (QoS) and report when itâs not achieved. On the
other side, the operator can advertise a better service as it
gives its clients a way to control it. Actually, it lets us de-
fine incentives mechanism which force the operator to guarantee
high QoS. This system can however be misused by
sending false attack reports, so we model the impact of liars
and discuss the stability of the whole system. The use of
âeconomic modelsâ and incentives is of increasing interest
in networking research [6], while the impact of a cheating
and bandwidth-greedy user is discussed in [5].
In the discussion we reach different goals: we present a
model of a publicWiFi system which includes attack detection
mechanisms, we analyze its evolution under the presence
of cheaters and we present benefits from the distributed detection mechanism.
Engineers...Here follows an a new IEEE based java-networking project which i'm gng to discuss----->
any one can copy the things......
TOPIC title:Wireless Intrusion detection and new attack model
ABSTRACT and BASE Paperđ˛f this project..........
Denial-of-Service attacks, and jamming in particular,
are a threat to wireless networks because they are at the
same time easy to mount and difficult to detect and stop. We
propose a distributed intrusion detection system in which
each node monitors the traffic flow on the network and collects
relevant statistics about it. By combining each nodeâs
view we are able to tell if (and which type of) an attack
happened or if the channel is just saturated. However, this
system opens the possibility for misuse. We discuss the impact
of the misuse on the system and the best strategies for
each actor..
1 Introduction
Denial-of-Service attacks are a threat to informative systems
which aim at blocking the service to legitimate users,
which is often the first step in a series of attacks. In a shared
medium environment an attacker could block another user
to get more bandwidth, or a service provider could be attacked
by a competitor to lower its reputation in front of the
customers.
In wireless networks, DoS attacks can be categorized according
to the features they exploit. We can distinguish between
attacks to the authentication mechanisms (Deauthentication
flooding, EAP-Logoff ), to the power saving capabilities
(Sleep deprivation) and to the radio layer (jamming,
that is the the emission of power over a frequency to disturb
communications [7]). A number of them can be easily
implemented with commodity hardware [4]. The problem
with wireless networks is that it is very hard, if not impossible,
to distinguish betweenânormalâ malfunctioning (for
example, random interferences on the channel or temporary
saturation of the Access Point) and attacks.
Intrusion detection systems (IDS) on wireless networks
are an open research topic. In the wireless world, anomaly
detection seems to fit better as many attacks happen at MAC
level, which means that itâs very difficult to isolate fixed sequences
of packets to use in a signature-based IDS. Also, as
wireless networks are a relatively new technology, itâs likely
that new attack methods will be found [3, 8]. What also
emerged, is that detection should be distributed, as some attacks
(and jamming in particular) cannot be detected by a
single node [7].
In this paper we propose an attack detection mechanism
based on shared monitoring of the network by all nodes.
which should be able to tell whether the network is experiencing
a real malfunctioning or is under attack. Such a
system in the hands of service provider can give it a good
way to prevent attacks, and it can be used in a public service
context as well, by allowing clients to monitor the Quality
of Service (QoS) and report when itâs not achieved. On the
other side, the operator can advertise a better service as it
gives its clients a way to control it. Actually, it lets us de-
fine incentives mechanism which force the operator to guarantee
high QoS. This system can however be misused by
sending false attack reports, so we model the impact of liars
and discuss the stability of the whole system. The use of
âeconomic modelsâ and incentives is of increasing interest
in networking research [6], while the impact of a cheating
and bandwidth-greedy user is discussed in [5].
In the discussion we reach different goals: we present a
model of a publicWiFi system which includes attack detection
mechanisms, we analyze its evolution under the presence
of cheaters and we present benefits from the distributed detection mechanism.
Replies
-
Kaustubh KatdareSuper! We need more such threads. Great job, madhumurundi đ .
-
madhumurundi2. IDS for public WiFi system:
In our scenario, WiFi for public service is offered by an
operator to some users. Users pay a subscription cost and
are offered a service with a given quality. The actors of the
system are as follows.
Operator The WiFi operator, or service provider, runs the
network infrastructure. It sets the QoS level and its goal is to maximize its income. This can be achieved
through different mechanisms: for example, by undersizing
the network to save on maintenance costs, or by
keeping service to a good level as happier users are
better customers than unhappy ones. Its best strategy
in different scenarios will be outlined in the following
of the paper.
Cooperative users This category includes users interested
in the service only: these users will take the service âas
isâ.
Unhappy/uncooperative users Users under this category
are unhappy about the current service and they will
complain about it. They will perform all possible actions
to get a better service or to get a refund. Given
the required expertise and power to âmake complaintsâ
about the service, a cooperative user can become unhappy
depending on the quality of service provided,
and vice versa. The relation between the service level
and the percentage of unhappy users in the system will
be presented later in the paper.
Cheaters Cheaters are users who, regardless of the QoS,
will try every action to increase their revenue. They
will still benefit from the service itself, but will also
try to âhackâ it.
2.1 Distributed detection:
We describe now the mechanism for the distributed detection
system. The basic idea is to set up a monitor at each
node in the network, as already described in [5], to produce
evidences, and then share them among all nodes. An evidence
a set of relevant information about the network state.
The monitor can be thought as an instance of the Ethereal
[1] network packet sniffer: it captures traffic and displays
detailed information on it. For each captured packet,
Ethereal displays a complete view of the packet headers
(from Ethernet to application level) and payload, and adds
some general statistics as a timestamp, frame number and
length in bytes. For our purposes weâll look at the Ethernet
level header, and as weâre focusing on 802.11 frames weâll
consider source, destination and BSSId addresses, sequence
number, frame type and subtype and the Retry flag. Together
with the captured packets, we add relevant statistics
collected by the device driver, like counters for transmission
retries and for frames received with wrong FCS (other papers
[7] use different statistics as signal strength and carrier
sensing time), and packet transmission time. We build in
this way a list of events at each node. Events are the single
transmitted packets or the times in which the channel is idle,
which can be inferred from the timestamp of the packets and the packet transmission times.
The combination of different lists of events leads to better
understanding of what happened in the network, in particular
in distinguishing jamming attacks and channel failures,
where packets are sent by one peer and never received
by the other peer (a more detailed analysis of jamming effects
and their detection can be found in [2]). Both a channel
failure and a jamming attack make the FCS check of
a packet fail, thus the packet in transit will be incorrectly
received and dropped, incrementing the âdropped framesâ
counter in the device driver at the receiver. The difference
between the 2 cases is the amount of incorrectly received
frames at the receiver.
To exemplify this, letâs suppose to have the receiving station
under a jamming attack. The jamming area can be
thought as a border line where all packets crossing it become
scrambled. The monitor placed at the source will see
the frames sent on the channel, while the monitor placed at
the receiving station wonât see anything received correctly
and will see the counters for incorrectly received frames increase.
The sender will retry the transmission a number of
times, and this will be seen by the monitor placed there. All
these retransmissions will be dropped as well, incrementing
the counter again.
We are able to detect the attack by combining what both
monitors saw, as a single one is not able to do the same:
the receiverâs evidences (no packets received and counter
updated) are in fact not enough to distinguish the attack.
For the receiver, receiving incorrect frames can happen for
various reasons: frames from stations at the limit of the radio
range, frames from neighbor networks or noisy channel
are all examples of this. If the counter is not updated, then
staying idle without having transmissions aimed at itself or
experiencing a device failure is undistinguished from being
under attack. On the other side, the transmitter cannot tell if
the other peer is out of range given the retransmissions only.
2.1.1 Matching the lists of events
The basic algorithm to match two lists of events is as follows:
we start from the first list and for every event (packet
or channel idle) we try to find a matching event on the second
list that is, given a packet we look for it on the second
list. As we donât have cheaters into play for now, what we
find is that for every packet on the first list we find it on the
second one if the network worked fine, else we find a channel
idle event if some problem (jamming or malfunctioning)
happened. Continuing the example above, weâd have
transmitted packets on the first event list and channel idle
(together with a high number of dropped packets) on the
second one. We can find unmatched events on the second
list at the end (for example if the first node was jammed), so
we swap the 2 lists and run the matching algorithm again.
The final output is a single list of events which combines
the two. To tell the case we fall in, we can imagine to run a
signature-based detection engine on the aggregated list.
Jamming and channel failure have the same basic signature
(which is packets transmitted and never received), but
differentiate on their position in the event list. A few packets
disappearing here and there are index of channel failures,
while a sequence of disappearing packets is considered as
jamming. A large number of non-consecutive channel failures
is index of bad QoS.
Since all nodes participate in the detection process, we
extend it in order to match multiple lists. The idea is to
merge one list at a time with the result of the previous
merge. In other words, we merge lists #1 and #2, then we
match the result with list #3, until we processed every list.
We obtain in this way an aggregated list of all events which
happened in the network in a given time frame.
We have to notice here that a node might not overhear
the traffic of every other node because of range. We supposed
that each node has relevant information to offer, but
this is not always true. In the follow up of the paper we
will consider all nodes to report relevant information to the
aggregated list.
The key feature here is that the monitoring system is distributed.
A single station alone cannot tell if it is experiencing
an attack or just a temporary network failure, and
cooperation among all nodes is required for the nodes to
understand what is going on.
The event lists are shared among all nodes in the network.
All nodes send their evidences to every other node in
the network. For the scope of this paper we wonât deal with
details on the protocol used to share the lists, nor with their
protection during transmission. If we experience a jamming
attack we assume weâll be able to share evidences at a
later time. We also suppose to have a secure authentication
mechanism in place, to allow only authorized users to take
part in the protocol.
Every node executes the matching algorithm to generate
the aggregated event list to have a clear view of what happened
in the network in the given time frame.
2.1.2 Commercial use
Another possible use of this mechanism is of commercial
nature: the operator can use it to advertise a more secure and
robust service (hardware failure is fixed more quickly as itâs
detected immediately, security breaches can be investigated
sooner for the same reason), attracting more potential users.
To model and investigate this, we introduce the use of
incentives. If the users monitor the channel and report that
QoS is not respected the operator will pay back a fee to each
affected user. The fee is a percentage of the subscription
cost and is paid once a threshold of QoS violations have been reached.
2.2 System misuse
The system presented so far works as soon as cheaters
stay out of the game. Why should a user cheat? The main
reason is to get an advantage over other users. As stated
in [5], nodes can alter their netwrok card random backoff
times and get an advantage over unmodified ones. In detail,
a modified node will win the contetion for the channel more
often, getting a higher bandwidth share. Other techniques
to do so are to launch DoS attacks against another nodes,
like jamming or Deauthentication. Another possible reason
would be to get the fee from the operator when the QoS is
good in the commercial scenario we outlined above.
For the following of this paper, weâll consider this later
case. Cheaters modify their lists of events to pretend to have
bad QoS while the it is good to get the fee from the operator.
Weâll explain how to treat the other case later in the paper.
Cheaters will make the matching of the event list fail. In
fact, a cheater will provide a list which is (at least in part)
incompatible with the correct ones provided by the other
honest nodes. For example, letâs imagine that a node receives
a packet X and claims not to have received it. The
sender will of course report that it sent the packet. The receiver
will alter his event list by marking packet X+1 from
the sender as X, packet X+2 as X+1 and so on. When the
matching will take place, it will show this difference.
We modify then our algorithm, and for every event we
keep track of which node reported it and of clashing and
incompatible events. In the example above, assuming A as
the sender and B as the receiver, the list will report âchannel
free (reported by node B) AND packet X from A to B (reported
by node A)â âpacket X from A to B (B) AND packet
X+1 from A to B (A)â, âpacket X+1 from A to B (B) AND
packet X+2 from A to B (A)â.
Under the hypotheses that all nodes are in range of each
other, and that each node is either honest or cheater, when
we try to build an aggregated list of events weâll end up with
all honest users agreeing on a list, and cheaters disagreeing
from it (eventually agreeing among themselves). What
we are doing is building clusters from the different lists of
events. Under an optimistic assumption that most nodes are
honest weâll end up with a big cluster of honest nodes and
a small number of outliers, representing the cheaters. However,
if we donât assume the general goodwill of the users,
cheaters can coordinate their attack and become the bigger
cluster. In this case, since there are no trust mechanisms we
cannot decide which cluster represents the honest users and
which one the cheaters.
As we note that each node can trust only itself, we modify
the matching algorithm: each node runs the basic 2-list
matching algorithm between its own event list and each of
the other nodesâ lists. For each event, we mark if itâs shared among the two nodes or not. At the end, the number of matched events will be a measure of similarity between the
two lists. When all the matchings will be done, each node
will know how many other nodes share the same opinion
as itself and thus how many other nodes are honest users or
cheaters.
This system will just tell how many nodes agree or disagree
with a given node. To make every node know the
opinion of all the other nodes, each node repeats the matching
algorithm using the list of events of another node (instead
of its own) as starting point, and iterates on all nodes.
This modified algorithm will require n â 1 iterations to
match a list of events with all the other ones. To match
every list with all the other ones, if we do not repeat the already
made matchings (for example, when matching node
#1 with every other one we match #1 with #2, #3 etc. When
we use node #2 as starting point we donât need to repeat #2-
#1), then n
2 matchings are needed, where n is the number
of nodes.
The fact that nodes discover the opinion of other nodes
is equivalent to running the algorithm in a centralized place.
We assume that cheaters can cheat only on the event lists
and not on the result of the algorithm.
2.2.1 Higher level modelling
At a higher level, we can think each node raising a vote
about what happened in the network: ok when everything
works, bad QoS when the network is saturated, attack when
an attack is detected. Cooperative users will present their
evidences which will support a certain conclusion, for example
that the network is correctly operating, while cheaters
will report that the network is not working by presenting
forged evidences. Weâll have two clashing and disagreeing
views of what happened in the network - one group typically
reporting good and another reporting bad QoS. To decide
who is the âwinnerâ, we use the majority rule. This
forces cheaters to cooperate to impose their view: a single
cheater will never win.
This leads us to the question: how easy is to cheat?
The easiest way is to have a peer generating an attack âondemandâ
from outside the network: in this case we will
have the cheaters supporting the view bad QoS while the
cooperative users will support attack. This specific clash
reveals this situation, so the operator can refuse to pay in
this specific case. In case of an attack, the users will report
attack and in this case the fee wonât be paid, as the bad QoS
level is not due to the will of the operator.
The other cheating case we presented, cheaters modifying
their backoff times, can be reconducted to the former
one. In fact, when cheaters manipulate their event lists they
must cooperate, so there will be a number of fake bad QoS
reports, while in the other case honest users will correctly
report bad QoS as an effect of the cheating. The fee in this
STA\AP OK Prob./Attack Cheat
OK or C C C+S
Attack QoS QoS-ÎQ QoS-ÎQ
bad QoS C-F C-F C+S-F
QoS+F QoS-ÎQ+F QoS-ÎQ+F
Table 1. Table for the operator-users game
case represents the damage done to the operator, and the
honest users will turn unhappy because of the cheating from
malicious users.
3 Game theory modelling
To analyze the best strategies available to each actor we
model the system as a game. Players are the operator and
the users - seen as a global entity.
In this game, the operator has three choices: behave
properly, network problems/attack (modelled as a separate
strategy but not a free choice - the operator âchoosesâ this
strategy in case of random network failures or in case of an
external attack) and cheating (willingly undersizing the network).
Cheating gives the operator the advantage to have
more users than the network capacity, so to get more subscriptions.
The users can report good, attack or bad QoS.
The game in tabular form is reported in Table 1. Its key
is as follows:
QoS: Quality of Service: the quality of the service given
by the operator
C: Subscription Cost: what operator get from each user
ÎQ: Quality of Service loss: quantification of how the
service is of lower quality than standard
S: Operator saving: what the operator saves by cheating
F: User fee: what the users gain through cheating.
The costs in table 1 are computed as follows: if both
operator and users behave correctly, the operator gets the
subscription cost, while the user gets the QoS. If there are
problems, or cheating from the operator, the user will always
experience a service penalty. If the operator cheats
and this is not reported (users choosing attack or good), the
operator gets a reward, S, which represents its savings due
to the inadequate infrastructure it deploys. If the users report
bad QoS, they will always get the fee F, which in turn
will be paid by the operator. Reporting attack or good leads
to the same payoffs so they have been collapsed into a single
row.We can note that both players have a dominant strategy:
the operator with cheat and the users with bad QoS.
This seems a doomed situation, however this model
doesnât take into account the evolution of the population in the system. Most of the users cheat only if the QoS is
too low, and cheating from the operator leads to lower QoS
and to more cheating from the users. Weâll examine this in
closer detail in next section.
4 System evolution
The operator sets the QoS. The users decide if to cheat
or not. Since the users subscribe to the service we consider
the QoS to be the independent variable, and we model
the relation between QoS and percentage of unhappy users
as linear. In the following example weâll use the function
Pu = 1â x. Pu is the probability of an user to be unhappy
with the service, and x the QoS. Pu, x â [0,1].
Given this relation, the operator can lower the QoS down
to ÂŻx, where Pu(ÂŻx)=0.5. This because when the unhappy
users are the majority they cheat and get the fee. Note that
without any monitoring system the operator can select any
QoS at will without paying any penalty. The users either
leave or take the service âas isâ. This way, the distributed
detection system limits the possibility of cheating by the
operator.
If we consider to have a fixed number of cheaters in
the system in addition to the unhappy users, the relation
changes to:
Pc+u = 1+(Pc â 1)x (1)
where Pc is the (fixed) percentage of cheaters in the system
and Pc+u the probability for an user to be cheating,
either as cheater or as unhappy user. For Pc = 0 we have
the relation as above. Note that x,Pc+u,Pc â [0,1].
4.1 Modelling usersâ cheating effects
We consider now a coordinated attack, meaning that
users will actively cooperate to subvert the system. The system
is composed by multiple cells, and the cheaters decide
which ones to subvert. We also consider the unhappy users
as cheaters: in fact, even if for different reasons, they are the
same from the point of view of the operator for the purpose
of the single attack.
4.1.1 Knapsack problem analysis
We suppose a system made of many cells, with a given population,
and with variable distribution of population into
cells, ranging from uniform to very narrow Gaussian. We
suppose a percentage of cheaters varying from 10 to 40%.
Cheaters coordinate their efforts: a single cell is assigned
a value equal to its size (for example, a cell containing 60
users has a value of 60) and a weight equal to half of its size
+1 (in the previous case, 31), to reflect that cheaters must be the absolute majority in a cell to subvert it. This is an instance
of the 0-1 knapsack problem, and results for its simulation
are reported in Appendix A. The number reported
as âscoreâ is the sum of the values of all objects taken, in
this case itâs the total number of affected users to whom the
operator will have to pay the fee.
What we can observe at first is that the results are independent
from both the size of the cells and the number of
population. From the results we obtain the following experimental
relationship:
y = 2(Pc+u) (2)
where y is the amount of cheating, expressed as percentage
of the users who get the fee. Pc+u â [0,0.4], as this is the
input range we used in the simulations. -
madhumurundi4.1.2 Evolution of user population
Under a cheating attack honest users are not immediately
affected, as the operator might reduce its QoS as a consequence
of the fees it has to pay. This way its network will be
even more undersized, with more problems and more honest
users becoming cheaters. However, this trend cannot go
forever as the operator will at some point shut the network
down, giving no more service nor more fees back.
We model the idea in this way: in our system we have a
fixed percentage of cheaters, Pc, and a percentage of cheating
users, Pc+u which depends on the QoS, x, as in equation
1. Equation 2 outlines the relation between the amount
of cheating and the percentage of cheating users. Table 2
includes some useful equations that model the operatorâs
revenue, costs and fees. t is the number of users, k1, k2, k3,
k4 and k5 are all constants of proportionality. Costs are proportional
to the number of users and the QoS, plus a fixed
value1.
We can now calculate the the operatorâs profit (gain)
function, G, as G = income â costs â fees. Substituting
the formulae, replacing t and y with their respective functions
and using Equations 1 and 2 we obtain:
G = âk2k5x2 +[k1k5 +2k4(1âPc)]xâ(k3 +2k4) (3)
which is a quadratic relation between the gain and the
QoS, aimed towards bottom. x â [0,1]. Since the y axis
represents the operatorâs gain, we can assume that the functionâs
vertex represents a positive value of G and thus there
are 2 intersections with the axis x. The functionâs maximum
is
x = k1k5 + 2k4(1 â Pc)
2k2k5
which is positive as all constants are positive. We can
assume to have a profit when x=1. Also, when x=0 we have
a profit of G = âk3 â 2k4, thus a negative value. Given
these characteristics of our function, we can say that the
maximum is located either in our domain or at xmax = 1.
From here we can see that the operator tends to keep the
QoS at maximum as it maximizes G.
The cheatersâ impact will make the QoS decrease, thus
making the number of unhappy users rise and operatorâs
gain decrease. If the gain approaches zero or goes below
it, the operator can either shut the service down or operate
in loss for some time to lower the number of unhappy users.
The first choice is against cheatersâ interests as well, as we
said theyâre interested in the service as well and not only
on the fees. The second choice can be kept for a little time
only, as the cheating level should lower after a while as it
usually comes from a small number of real cheaters and a higher number of unhappy users.
5 Conclusions and future work
In this paper we proposed an intrusion detection system
for wireless network based on distributed collection of relevant
information, and showed that it can also detect jamming
attacks. We also suggested a commercial use of the
system, in order to provide a better service to customers:
however, this use allows cheaters to come into play. Anyway,
their impact is limited: we showed that the operator
cannot lower the quality of service under a certain threshold
(as without such a system), otherwise unhappy users
will take over and get a pay back. We also showed that
cheating users cannot push too much, otherwise the system
will go towards the total shutdown. We achieve two goals:
we detect more attacks and force the operator to give a decent
service. We allow cheaters to come into play, but their
impact is self-limiting as a working network is needed for
them to play.
One interesting scenario to analyze would be with
cheaters who donât care about the service, thus donât stop
cheating when QoS gets too low. This might be a sabotage
attack from a rival provider to get more market shares. It
would also be interesting to add trust and user reputation
mechanisms to the system, to improve the matching algorithm........ -
madhumurundiSource code of this project--->
1. Graphical user Interface-->
package com.gts.src.GUI; import com.gts.src.Logic.HelloReceiver; import com.gts.src.Logic.Multicst; import com.gts.src.Logic.Operations; import com.gts.src.Logic.Receiver; import com.gts.src.Logic.Request; import com.gts.src.Logic.Sender; import com.gts.src.Logic.Timer; import java.io.*; import java.util.Vector; import javax.swing.*; import javax.swing.table.AbstractTableModel; import javax.swing.table.DefaultTableModel; import javax.swing.table.TableColumn; import javax.swing.table.TableModel; import java.awt.*; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; public class Design extends JFrame implements ActionListener { Receiver receiver; Timer timer; public static JTextField destination; public static TextArea data,recievedata,msg; public static JLabel msgl,destination_l,senddata_l,recievedata_l,intrud_l,path_l; public static JButton send,browse,close,clears,cleard; public static JTable table; public static DefaultTableModel dataModel; public static String receivetext=""; public static String se="SendData",re="ReceivedData"; JScrollPane scrollpane; public static List path; public static String destnode=""; /*********************** constructor ************/ Design() { try { String inf = "com.sun.java.swing.plaf.windows.WindowsLookAndFeel"; // UIManager.setLookAndFeel(inf); } catch (Exception e) { e.printStackTrace(); } Container c=getContentPane(); c.setLayout(new GridLayout(1,2)); c.add(createLeft()); c.add(createRight()); setSize(800,580); setTitle("IDS-MONITOR"); setVisible(true); receiver=new Receiver(); timer=new Timer(); } /*********************** Used to create left part ***********/ public JPanel createLeft() { JPanel panel = new JPanel(); panel.setLayout(null); panel.setBorder(BorderFactory.createTitledBorder("")); destination_l= new JLabel("Destination"); destination_l.setBounds(30,40,100,25); panel.add(destination_l); destination = new JTextField(15); destination.setBounds(110,40,100,25); panel.add(destination); cleard=new JButton("Clear"); cleard.setBounds(300,42,65,23); panel.add(cleard); cleard.addActionListener(this); senddata_l = new JLabel("Data"); senddata_l.setBounds(30,90,100,15); panel.add(senddata_l); data= new TextArea(5,30); data.setBounds(30,120,330,170); panel.add(data); recievedata_l = new JLabel("Coherent Nodes"); recievedata_l.setBounds(30,315,160,15); panel.add(recievedata_l); recievedata= new TextArea(5,30); recievedata.setBounds(30,335,210,140); panel.add(recievedata); send=new JButton("Resort"); send.setBounds(15,500,80,27); panel.add(send); send.addActionListener(this); browse=new JButton("Browse"); browse.setBounds(109,500,80,27); panel.add(browse); browse.addActionListener(this); close=new JButton("Close"); close.setBounds(202,500,80,27); panel.add(close); close.addActionListener(this); clears=new JButton("Clear"); clears.setBounds(297,500,80,27); panel.add(clears); clears.addActionListener(this); return panel; } /*********************** Used to create right part *************/ public JPanel createRight() { JPanel com = new JPanel(); JPanel down = new JPanel(); JPanel panel = new JPanel(); JPanel inter=new JPanel(); msg=new TextArea(5,50); com.setLayout(new GridLayout(3,1)); panel.setBorder(BorderFactory.createTitledBorder("")); dataModel = new DefaultTableModel(); table = new JTable(dataModel); dataModel.addColumn("Source"); dataModel.addColumn("Destination"); dataModel.addColumn("IP"); dataModel.addColumn("OP"); dataModel.addColumn("Role"); dataModel.setColumnCount(5); //dataModel.setRowCount(10); scrollpane = new JScrollPane(table); panel.add(scrollpane); down.setLayout(null); inter.setLayout(null); msg.setBounds(10,17,380,90); msgl = new JLabel("Message"); msgl.setBounds(10,0,100,15); inter.add(msgl); inter.add(msg); intrud_l = new JLabel("Intruder"); intrud_l.setBounds(30,0,350,15); intrud_l.setForeground(new Color(222,38,12)); down.add(intrud_l); path_l = new JLabel("Path"); path_l.setBounds(30,35,100,15); down.add( path_l); path= new List(); path.setBounds(30,55,330,90); down.add(path); com.add(panel); com.add(inter); com.add(down); return com; } public static void setIntruder(String text) { System.out.println("ntruder setting -------------------- in source" + text + "\t"); intrud_l.setText("Intruder : "+text); } /*********************** Used when browse button pressed *************/ public static void browseFile() { data.setText(""); JFileChooser chooser = new JFileChooser(); int returnVal = chooser.showOpenDialog(null); if(returnVal == JFileChooser.APPROVE_OPTION) { try { String op=""; int d=0; FileInputStream cont=new FileInputStream(new File(chooser.getSelectedFile().getAbsolutePath())); while((d=cont.read())!=-1) op=op+(char)d; data.setText(data.getText()+op); cont.close(); } catch(Exception e1) { e1.printStackTrace(); } } data.setEditable(false); } /*********************** used when Training process **************/ public static void sendAction() { boolean k=false; k=Operations.validation(destination.getText()); if(k) { destnode=destination.getText(); Sender.sendSourceRequest(destination.getText()); } else JOptionPane.showMessageDialog(null,"Please Enter the Hostname","Information!",JOptionPane.INFORMATION_MESSAGE); } /*********************** used when packet sending process *************/ public static void sendData() { System.out.println("send data"); if(!data.getText().equals("")) { Sender.sendSourceData(data.getText(),path.getSelectedItem().substring(0,path.getSelectedItem().indexOf("=")),destination.getText()); } else JOptionPane.showMessageDialog(null,"Please Enter the Sending text","Information!",JOptionPane.INFORMATION_MESSAGE); } /*********************** used when set the destination receive text **************/ public static void setString(String receive) { receivetext=receivetext+receive; data.setText(receivetext); } /*********************** used when announcing message **********/ public static void message(String mesg) { msg.setText(msg.getText()+"\n"+mesg); //JOptionPane.showMessageDialog(null,mesg,"Information!",JOptionPane.INFORMATION_MESSAGE); } public static void setJta11(String s,String f) { if(f.equals("empty")) { recievedata.setText(s); } else { recievedata.append(s); } } /*********************** used when assigning path in list **************/ public static void setPath(Object[] msg) { int alert=path.getItemCount(); path.removeAll(); Operations.paths.clear(); for(int i=0;i
0) { send.setText("Send"); } else { if(alert>0) { message("There is no safe path"); send.setText("Resort"); if(Operations.newPathAvail()) { message("Training Process Starts for fresh node"); sendAction(); } else { message("There is no safe covering node"); } } } } /*********************** used when event occurr *************/ public void actionPerformed(ActionEvent e) { if(e.getSource()==browse) { if(senddata_l.getText().equals(se)) browseFile(); } if(e.getSource()==send) { senddata_l.setText(se); if(send.getText().equals("Resort")) { sendAction(); destination.setEditable(false); } else { sendData(); } } if(e.getSource()==close) { System.exit(0); } if(e.getSource()==clears) { data.setEditable(true); data.setText(""); if(senddata_l.equals(re)) receivetext=""; } if(e.getSource()==cleard) { System.out.println("dest clear"); destination.setEditable(true); destination.setText(""); path.removeAll(); send.setText("Resort"); } } /*********************** program starting area ***********/ public static void main(String arg[]) { new Design(); new Operations(); Operations.clean(); new HelloReceiver(); new Multicst(); } }
-
dheerajkushwahamadhumurundiSource code of this project--->
1. Graphical user Interface-->
package com.gts.src.GUI; import com.gts.src.Logic.HelloReceiver; import com.gts.src.Logic.Multicst; import com.gts.src.Logic.Operations; import com.gts.src.Logic.Receiver; import com.gts.src.Logic.Request; import com.gts.src.Logic.Sender; import com.gts.src.Logic.Timer; import java.io.*; import java.util.Vector; import javax.swing.*; import javax.swing.table.AbstractTableModel; import javax.swing.table.DefaultTableModel; import javax.swing.table.TableColumn; import javax.swing.table.TableModel; import java.awt.*; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; public class Design extends JFrame implements ActionListener { Receiver receiver; Timer timer; public static JTextField destination; public static TextArea data,recievedata,msg; public static JLabel msgl,destination_l,senddata_l,recievedata_l,intrud_l,path_l; public static JButton send,browse,close,clears,cleard; public static JTable table; public static DefaultTableModel dataModel; public static String receivetext=""; public static String se="SendData",re="ReceivedData"; JScrollPane scrollpane; public static List path; public static String destnode=""; /*********************** constructor ************/ Design() { try { String inf = "com.sun.java.swing.plaf.windows.WindowsLookAndFeel"; // UIManager.setLookAndFeel(inf); } catch (Exception e) { e.printStackTrace(); } Container c=getContentPane(); c.setLayout(new GridLayout(1,2)); c.add(createLeft()); c.add(createRight()); setSize(800,580); setTitle("IDS-MONITOR"); setVisible(true); receiver=new Receiver(); timer=new Timer(); } /*********************** Used to create left part ***********/ public JPanel createLeft() { JPanel panel = new JPanel(); panel.setLayout(null); panel.setBorder(BorderFactory.createTitledBorder("")); destination_l= new JLabel("Destination"); destination_l.setBounds(30,40,100,25); panel.add(destination_l); destination = new JTextField(15); destination.setBounds(110,40,100,25); panel.add(destination); cleard=new JButton("Clear"); cleard.setBounds(300,42,65,23); panel.add(cleard); cleard.addActionListener(this); senddata_l = new JLabel("Data"); senddata_l.setBounds(30,90,100,15); panel.add(senddata_l); data= new TextArea(5,30); data.setBounds(30,120,330,170); panel.add(data); recievedata_l = new JLabel("Coherent Nodes"); recievedata_l.setBounds(30,315,160,15); panel.add(recievedata_l); recievedata= new TextArea(5,30); recievedata.setBounds(30,335,210,140); panel.add(recievedata); send=new JButton("Resort"); send.setBounds(15,500,80,27); panel.add(send); send.addActionListener(this); browse=new JButton("Browse"); browse.setBounds(109,500,80,27); panel.add(browse); browse.addActionListener(this); close=new JButton("Close"); close.setBounds(202,500,80,27); panel.add(close); close.addActionListener(this); clears=new JButton("Clear"); clears.setBounds(297,500,80,27); panel.add(clears); clears.addActionListener(this); return panel; } /*********************** Used to create right part *************/ public JPanel createRight() { JPanel com = new JPanel(); JPanel down = new JPanel(); JPanel panel = new JPanel(); JPanel inter=new JPanel(); msg=new TextArea(5,50); com.setLayout(new GridLayout(3,1)); panel.setBorder(BorderFactory.createTitledBorder("")); dataModel = new DefaultTableModel(); table = new JTable(dataModel); dataModel.addColumn("Source"); dataModel.addColumn("Destination"); dataModel.addColumn("IP"); dataModel.addColumn("OP"); dataModel.addColumn("Role"); dataModel.setColumnCount(5); //dataModel.setRowCount(10); scrollpane = new JScrollPane(table); panel.add(scrollpane); down.setLayout(null); inter.setLayout(null); msg.setBounds(10,17,380,90); msgl = new JLabel("Message"); msgl.setBounds(10,0,100,15); inter.add(msgl); inter.add(msg); intrud_l = new JLabel("Intruder"); intrud_l.setBounds(30,0,350,15); intrud_l.setForeground(new Color(222,38,12)); down.add(intrud_l); path_l = new JLabel("Path"); path_l.setBounds(30,35,100,15); down.add( path_l); path= new List(); path.setBounds(30,55,330,90); down.add(path); com.add(panel); com.add(inter); com.add(down); return com; } public static void setIntruder(String text) { System.out.println("ntruder setting -------------------- in source" + text + "\t"); intrud_l.setText("Intruder : "+text); } /*********************** Used when browse button pressed *************/ public static void browseFile() { data.setText(""); JFileChooser chooser = new JFileChooser(); int returnVal = chooser.showOpenDialog(null); if(returnVal == JFileChooser.APPROVE_OPTION) { try { String op=""; int d=0; FileInputStream cont=new FileInputStream(new File(chooser.getSelectedFile().getAbsolutePath())); while((d=cont.read())!=-1) op=op+(char)d; data.setText(data.getText()+op); cont.close(); } catch(Exception e1) { e1.printStackTrace(); } } data.setEditable(false); } /*********************** used when Training process **************/ public static void sendAction() { boolean k=false; k=Operations.validation(destination.getText()); if(k) { destnode=destination.getText(); Sender.sendSourceRequest(destination.getText()); } else JOptionPane.showMessageDialog(null,"Please Enter the Hostname","Information!",JOptionPane.INFORMATION_MESSAGE); } /*********************** used when packet sending process *************/ public static void sendData() { System.out.println("send data"); if(!data.getText().equals("")) { Sender.sendSourceData(data.getText(),path.getSelectedItem().substring(0,path.getSelectedItem().indexOf("=")),destination.getText()); } else JOptionPane.showMessageDialog(null,"Please Enter the Sending text","Information!",JOptionPane.INFORMATION_MESSAGE); } /*********************** used when set the destination receive text **************/ public static void setString(String receive) { receivetext=receivetext+receive; data.setText(receivetext); } /*********************** used when announcing message **********/ public static void message(String mesg) { msg.setText(msg.getText()+"\n"+mesg); //JOptionPane.showMessageDialog(null,mesg,"Information!",JOptionPane.INFORMATION_MESSAGE); } public static void setJta11(String s,String f) { if(f.equals("empty")) { recievedata.setText(s); } else { recievedata.append(s); } } /*********************** used when assigning path in list **************/ public static void setPath(Object[] msg) { int alert=path.getItemCount(); path.removeAll(); Operations.paths.clear(); for(int i=0;i
0) { send.setText("Send"); } else { if(alert>0) { message("There is no safe path"); send.setText("Resort"); if(Operations.newPathAvail()) { message("Training Process Starts for fresh node"); sendAction(); } else { message("There is no safe covering node"); } } } } /*********************** used when event occurr *************/ public void actionPerformed(ActionEvent e) { if(e.getSource()==browse) { if(senddata_l.getText().equals(se)) browseFile(); } if(e.getSource()==send) { senddata_l.setText(se); if(send.getText().equals("Resort")) { sendAction(); destination.setEditable(false); } else { sendData(); } } if(e.getSource()==close) { System.exit(0); } if(e.getSource()==clears) { data.setEditable(true); data.setText(""); if(senddata_l.equals(re)) receivetext=""; } if(e.getSource()==cleard) { System.out.println("dest clear"); destination.setEditable(true); destination.setText(""); path.removeAll(); send.setText("Resort"); } } /*********************** program starting area ***********/ public static void main(String arg[]) { new Design(); new Operations(); Operations.clean(); new HelloReceiver(); new Multicst(); } }
yar how we run this program in netbean 5.5 . it can not find the gui package then plz tell me in which browzer it run. plz my email id is dheeraj #-Link-Snipped-#. and my no is 9616853184.
olz replay me yaar.
thanks -
Mr.DonYou are outstanding #-Link-Snipped-#madhumurundi.Do you know anything about wireless transmission of electrical power.
#-Link-Snipped-# -
madhumurundi
Thanks Dilleep.... i'm purely from Computer Science... so i don't have much idea in Electronics... đdileep kYou are outstanding #-Link-Snipped-#madhumurundi.Do you know anything about wireless transmission of electrical power.
#-Link-Snipped-# -
arunchauhanHey guys i am new to this forum but fount your stuff interesting.... Great job.
-
vishnu priyaGreat information!!!
-
cooltwinsnice thread madhu...
looking forward to more such threads....đ -
bharratJAVA Projects
hiii madhumurundi,
can you help me in deciding my Final Year's project. I'm thinking of making a project on JAVA. do you have any projects that seem to be as an application.
Help me in finalizing my project by providing some information regarding this......
Looking forward for yours response...thank you -
R.Hemalathahi madhu , i am doing final year(b.tech-IT) ..can u say me whether " Real time port scan detection for internet backbone " is good title to continue ... nd if u provide me details of this project i will b thank full.
-
saravanakuma_rHello sir, This is saravanakumar currently doing final year BE(CSE) in Mahendra Engineering College, Namakkal. I amazed so much about your free project. I must be lucky to visit your post. I finally decided to follow your instructions as a crazy Engineer. Can you give an assistance or some kind of guiding towards the success of the project. Its all your decision.. Anyway I thank you sir..
-
Manish Goyalgood job dude....really appreciating work
-
amtihey madhu nice threads......
it will help many peoples....
i am new to crazyengineers.....Can you plzz help me for the last topic...
i.e. 7.Route reservation in Internetworking........
I am thinking for my project something related to Routing.......đ -
vimalghHEYYYY madhu can u please tell me in which gui can i run the source code..........
-
madhumurundi
@amti .. ya i'will help you for this topic.. soon we will start a New thread and Start Discuss đamtihey madhu nice threads......
it will help many peoples....
i am new to crazyengineers.....Can you plzz help me for the last topic...
i.e. 7.Route reservation in Internetworking........
I am thinking for my project something related to Routing.......đ -
madhumurundi
@Vimalgh Hae it will works on Java Swings đvimalghHEYYYY madhu can u please tell me in which gui can i run the source code.......... -
vimalghhey madhu is that much code sufficient or will i need to do any modifications in it.......
-
amtimadhumurundi@amti .. ya i'will help you for this topic.. soon we will start a New thread and Start Discuss đ
Madhu....thanks a lot for reply...
when you will going to start thread on "Route reservation in Internetworking"........
Actually i need to submit my Synopsis for my project.....and i do't know any thing about this project leaving just its topic.....
please at least provide some of its information..... -
rishipathakHi
i wanted to ask how does the wireless distributed intrusion detection system tell about real malfunctioning of the network?
I have understood the attack detection mechanism...but please tell me how real malfunction can be detected ...... -
vbrijeshNice work madhumurundi. Can you please share the libraries you are using, so that I can run your application (#-Link-Snipped-#).
Thanks in advance.
Brijesh -
dheerajkushwahahey madhu its a great info
but the packages in d code couldnt be executed so plz help us in executing the code
it would be very helpful for us
also plz tell us d guide of how to execute the whole project......... -
Vikas_RCan anyone please tell me, how to execute the wireless intrusion detection system project....Is there any configuration ??
-
VegaThere are no free lunches budy
-
abhijsjmadhumurundiSource code of this project--->
1. Graphical user Interface-->
package com.gts.src.GUI; import com.gts.src.Logic.HelloReceiver; import com.gts.src.Logic.Multicst; import com.gts.src.Logic.Operations; import com.gts.src.Logic.Receiver; import com.gts.src.Logic.Request; import com.gts.src.Logic.Sender; import com.gts.src.Logic.Timer; import java.io.*; import java.util.Vector; import javax.swing.*; import javax.swing.table.AbstractTableModel; import javax.swing.table.DefaultTableModel; import javax.swing.table.TableColumn; import javax.swing.table.TableModel; import java.awt.*; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; public class Design extends JFrame implements ActionListener { Receiver receiver; Timer timer; public static JTextField destination; public static TextArea data,recievedata,msg; public static JLabel msgl,destination_l,senddata_l,recievedata_l,intrud_l,path_l; public static JButton send,browse,close,clears,cleard; public static JTable table; public static DefaultTableModel dataModel; public static String receivetext=""; public static String se="SendData",re="ReceivedData"; JScrollPane scrollpane; public static List path; public static String destnode=""; /*********************** constructor ************/ Design() { try { String inf = "com.sun.java.swing.plaf.windows.WindowsLookAndFeel"; // UIManager.setLookAndFeel(inf); } catch (Exception e) { e.printStackTrace(); } Container c=getContentPane(); c.setLayout(new GridLayout(1,2)); c.add(createLeft()); c.add(createRight()); setSize(800,580); setTitle("IDS-MONITOR"); setVisible(true); receiver=new Receiver(); timer=new Timer(); } /*********************** Used to create left part ***********/ public JPanel createLeft() { JPanel panel = new JPanel(); panel.setLayout(null); panel.setBorder(BorderFactory.createTitledBorder("")); destination_l= new JLabel("Destination"); destination_l.setBounds(30,40,100,25); panel.add(destination_l); destination = new JTextField(15); destination.setBounds(110,40,100,25); panel.add(destination); cleard=new JButton("Clear"); cleard.setBounds(300,42,65,23); panel.add(cleard); cleard.addActionListener(this); senddata_l = new JLabel("Data"); senddata_l.setBounds(30,90,100,15); panel.add(senddata_l); data= new TextArea(5,30); data.setBounds(30,120,330,170); panel.add(data); recievedata_l = new JLabel("Coherent Nodes"); recievedata_l.setBounds(30,315,160,15); panel.add(recievedata_l); recievedata= new TextArea(5,30); recievedata.setBounds(30,335,210,140); panel.add(recievedata); send=new JButton("Resort"); send.setBounds(15,500,80,27); panel.add(send); send.addActionListener(this); browse=new JButton("Browse"); browse.setBounds(109,500,80,27); panel.add(browse); browse.addActionListener(this); close=new JButton("Close"); close.setBounds(202,500,80,27); panel.add(close); close.addActionListener(this); clears=new JButton("Clear"); clears.setBounds(297,500,80,27); panel.add(clears); clears.addActionListener(this); return panel; } /*********************** Used to create right part *************/ public JPanel createRight() { JPanel com = new JPanel(); JPanel down = new JPanel(); JPanel panel = new JPanel(); JPanel inter=new JPanel(); msg=new TextArea(5,50); com.setLayout(new GridLayout(3,1)); panel.setBorder(BorderFactory.createTitledBorder("")); dataModel = new DefaultTableModel(); table = new JTable(dataModel); dataModel.addColumn("Source"); dataModel.addColumn("Destination"); dataModel.addColumn("IP"); dataModel.addColumn("OP"); dataModel.addColumn("Role"); dataModel.setColumnCount(5); //dataModel.setRowCount(10); scrollpane = new JScrollPane(table); panel.add(scrollpane); down.setLayout(null); inter.setLayout(null); msg.setBounds(10,17,380,90); msgl = new JLabel("Message"); msgl.setBounds(10,0,100,15); inter.add(msgl); inter.add(msg); intrud_l = new JLabel("Intruder"); intrud_l.setBounds(30,0,350,15); intrud_l.setForeground(new Color(222,38,12)); down.add(intrud_l); path_l = new JLabel("Path"); path_l.setBounds(30,35,100,15); down.add( path_l); path= new List(); path.setBounds(30,55,330,90); down.add(path); com.add(panel); com.add(inter); com.add(down); return com; } public static void setIntruder(String text) { System.out.println("ntruder setting -------------------- in source" + text + "\t"); intrud_l.setText("Intruder : "+text); } /*********************** Used when browse button pressed *************/ public static void browseFile() { data.setText(""); JFileChooser chooser = new JFileChooser(); int returnVal = chooser.showOpenDialog(null); if(returnVal == JFileChooser.APPROVE_OPTION) { try { String op=""; int d=0; FileInputStream cont=new FileInputStream(new File(chooser.getSelectedFile().getAbsolutePath())); while((d=cont.read())!=-1) op=op+(char)d; data.setText(data.getText()+op); cont.close(); } catch(Exception e1) { e1.printStackTrace(); } } data.setEditable(false); } /*********************** used when Training process **************/ public static void sendAction() { boolean k=false; k=Operations.validation(destination.getText()); if(k) { destnode=destination.getText(); Sender.sendSourceRequest(destination.getText()); } else JOptionPane.showMessageDialog(null,"Please Enter the Hostname","Information!",JOptionPane.INFORMATION_MESSAGE); } /*********************** used when packet sending process *************/ public static void sendData() { System.out.println("send data"); if(!data.getText().equals("")) { Sender.sendSourceData(data.getText(),path.getSelectedItem().substring(0,path.getSelectedItem().indexOf("=")),destination.getText()); } else JOptionPane.showMessageDialog(null,"Please Enter the Sending text","Information!",JOptionPane.INFORMATION_MESSAGE); } /*********************** used when set the destination receive text **************/ public static void setString(String receive) { receivetext=receivetext+receive; data.setText(receivetext); } /*********************** used when announcing message **********/ public static void message(String mesg) { msg.setText(msg.getText()+"\n"+mesg); //JOptionPane.showMessageDialog(null,mesg,"Information!",JOptionPane.INFORMATION_MESSAGE); } public static void setJta11(String s,String f) { if(f.equals("empty")) { recievedata.setText(s); } else { recievedata.append(s); } } /*********************** used when assigning path in list **************/ public static void setPath(Object[] msg) { int alert=path.getItemCount(); path.removeAll(); Operations.paths.clear(); for(int i=0;i
0) { send.setText("Send"); } else { if(alert>0) { message("There is no safe path"); send.setText("Resort"); if(Operations.newPathAvail()) { message("Training Process Starts for fresh node"); sendAction(); } else { message("There is no safe covering node"); } } } } /*********************** used when event occurr *************/ public void actionPerformed(ActionEvent e) { if(e.getSource()==browse) { if(senddata_l.getText().equals(se)) browseFile(); } if(e.getSource()==send) { senddata_l.setText(se); if(send.getText().equals("Resort")) { sendAction(); destination.setEditable(false); } else { sendData(); } } if(e.getSource()==close) { System.exit(0); } if(e.getSource()==clears) { data.setEditable(true); data.setText(""); if(senddata_l.equals(re)) receivetext=""; } if(e.getSource()==cleard) { System.out.println("dest clear"); destination.setEditable(true); destination.setText(""); path.removeAll(); send.setText("Resort"); } } /*********************** program starting area ***********/ public static void main(String arg[]) { new Design(); new Operations(); Operations.clean(); new HelloReceiver(); new Multicst(); } }
Sir The package GUI could not be executed...........
Please tell me how and where to execute this code.I have to submit the project in 15 days.
please Madhu help me
I would be grateful to you -
abhijsjthe package com.gts.src.GUI; used in the code in wireless intrusion detection system.
m tryin to execute it in netbeans 5.5 but its is giving error as an unidentified message. plz tell me where this code can be executed.
Some one plz help me plz help me -
rishipathaki wanted to know how this project code works...i have connected 3 laptops but how the intruder is detected..plz tell me....
-
abhijsj
hiiii Rishirishipathaki wanted to know how this project code works...i have connected 3 laptops but how the intruder is detected..plz tell me....
i m also working on the same project but i m not able to execute the project,
will please help me in executing the project.
lease tell me on which environment u executed the project.
please respond quickly..... -
madhumurundi
where do u finding difficulty in execution of project ?abhijsjhiiii Rishi
i m also working on the same project but i m not able to execute the project,
will please help me in executing the project.
lease tell me on which environment u executed the project.
please respond quickly..... -
madhumurundi
ya .. sure i wil pus the steps how to execute the codedheerajkushwahahey madhu its a great info
but the packages in d code couldnt be executed so plz help us in executing the code
it would be very helpful for us
also plz tell us d guide of how to execute the whole project......... -
madhumurundi
use Ecllipse that will be the better for this projectabhijsjthe package com.gts.src.GUI; used in the code in wireless intrusion detection system.
m tryin to execute it in netbeans 5.5 but its is giving error as an unidentified message. plz tell me where this code can be executed.
Some one plz help me plz help me -
abhijsj
Firstly thanks for replying madhu.......madhumurundiwhere do u finding difficulty in execution of project ?
the problem is im trying to execute the project on netbeans,
when the project runs the error comes that the package
package com.gts.src.GUI;
is not identified and where ever the related packages are used there also it give the error.
Madhu tell me on which platform i can run the project so that i couls efficiently run the project. So bro respond quickly and tell me where to run this project i would be really helpful to you. -
madhumurundii think .. this error comes only when .. path is incorrect.. 1st correct path .. in the run.bat file .. and copy and paste the full folder inside of /jdk1..5/bin then double click on run.bat file ... it will works .. i hope i'm clear with your doubts
-
Vikas_Rthanks for replying madhu.......Do v need setup an adhoc network using laptops & then run or only 1 system is sufficient?
-
madhumurundino need of Adhoc network.. u required a wireless network environment .. and.. atleast 3 laptops are required
-
ank_kooli am trying to execute the program in linux(fedora),...............................its giving error --package com.gts.src.Logic does not exists and similarly for other .logic import packages...................................what should i do????????????
-
madhumurundi
Make sure folder COM is existing in your system.... iank_kooli am trying to execute the program in linux(fedora),...............................its giving error --package com.gts.src.Logic does not exists and similarly for other .logic import packages...................................what should i do???????????? -
rzalaniHello Madhu I need your help urgently i was trying to run your porject and i was not able to its giving me errors i am trying to run it on Netbeans 6.8 and also do i need 3 laptops or can i use wireless adapters on my system and also after running the project on netbeans it will detect the nodes automaticaly or i have to do it.........ie. i am getting intial errors like
when i debug the program
Not able to submit breakpoint LineBreakpoint NumberFormatException.java : 24, reason: No executable location available at line 24 in class java.lang.NumberFormatException
I am running the program on windows 7 64 bit version.Please help me at the earliest........ -
abhijit1206Firstly thanks for the post !!!
I have a wireless network and 3 laptops
Now what's the next step to execute the project???đđ
Please reply or mailto:
Thanks in adavance -
vishnu priyaHello CEan,
Welcome to CE first of all,
See that you don't put your personal id's here for help.Any help will be done only by posting directly to your thread on the forum! -
ramana_slvThank you madhumurundi.
-
ramana_slvplease tell me how to run this madhumurundi...............please tell me this is my email Id: removed ..
-
sumith123use Wireless Intrusion detection - Google Search for understand how to execute Wireless Intrusion detection because its a big story
-
abhijit1206đCan anybody tell me the steps to execute the Intrusion detection project.I am able to execute it on single computer. But how to execute it in wireless network environment.Please tell me the steps. I have 3 laptops,an wireless network.
Please help. -
abhijit1206can u tell me how to run the project??? i have 3 laptops and a wifi network!!!
-
Reyahey awesome!!u rock madhu!
-
abhijit1206hi praveena can u tell me how to run the project.I have 3 laptops and a wi-fi network.
-
rishabh_jainhi
i m rishabh jain from jabalpur eng. collage and my project topic in wireless intrusion detection system and a new attack model so plz help me
thanku in advance -
abhijit1206come guys it's high time now ,there isn't a single crazy engg. who can can tell me what are the network settings required to execute the project..........
-
abhijit1206Hi vimalgh can u please tell me how to execute the project.
Thanks in advance... -
maninellaihi, can you please send me how to run this coding ? my email id is
-
maninellaicould u help me to run this program, how can i run this program
-
G S R KISHOREsir,
i am currently doing the ieee project "Wireless Intrusion detection and new attack model"
please send project code execution process or full specifications about the project.
i'm waiting for your response.........
mail: -
Kaustubh Katdare
Wow! You want every thing ready-made! Don't you think you should work on it on your own?G S R KISHOREsir,
i am currently doing the ieee project "Wireless Intrusion detection and new attack model"
please send project code execution process or full specifications about the project.
i'm waiting for your response.........
mail: -
rankyaroraplz can you tell me how to execute this project... i am working on this project but finding it difficult to execute it....so plz help us...thanx
-
rankyarorai executed the project.............can u plz tell m how to make DOS attack in network so intruder can be detected...
-
rishabh_jainCan anybody tell me the steps to execute the Intrusion detection project.I am able to execute it on single computer. But how to execute it in wireless network environment.Please tell me the steps. I have 3 laptops,an wireless network.
-
rishabh_jainmy email ID is #-Link-Snipped-#
-
abhijit1206hi ramana can u please explian the fiels in settings.txt
-
rankyarora
first,run the project on all 3 laptops then u will see coherent nodes ..then go to MyComputer properties then check ur computer name in computer name tab...enter the destination computer name in destination field....click resort ....a row will be added in table on right side....then in destination computer enter the name of sender and then click resort...then resort will change to send.....and then send data.....hope it helps....đrishabh_jainCan anybody tell me the steps to execute the Intrusion detection project.I am able to execute it on single computer. But how to execute it in wireless network environment.Please tell me the steps. I have 3 laptops,an wireless network. -
abhijit1206thanks a lot rankyarora will try this and tell u ........thanks a lot for replying đ đ đ
-
abhijit1206Do we have to make any changes in settings.txt???
-
abhijit1206where r the packages u have included in GUI code???
-
abhijit1206Do we have to make any changes in settings.txt???to find the intruder
-
rishabh_jain
thanks a lot rankyarora will try this and tell u ........thanks a lot for replyingrankyarorafirst,run the project on all 3 laptops then u will see coherent nodes ..then go to MyComputer properties then check ur computer name in computer name tab...enter the destination computer name in destination field....click resort ....a row will be added in table on right side....then in destination computer enter the name of sender and then click resort...then resort will change to send.....and then send data.....hope it helps....đ -
abhijit1206When r u going to push the steps how to execute the code???đ
-
abhijit1206when i enter destination computer name n click resort the routing table is updated n it shows sender and reciver but the intermediate nodes r not shown n also the routing table of intermediate nodes is not seen in the intermediate node.
-
abhijit1206when i enter destination computer name n click resort the routing table is updated n it shows sender and reciver but the intermediate nodes r not shown n also the routing table of intermediate nodes is not seen in the intermediate node.do we have 2 make any modifications in settings.txt????
-
abhijit1206can u please tell the steps 2 execute the project!!!
-
harishsankarhi madhu !!!!!!!!!!!
can i get the full source code i could not fing the other package com.gts.src.Logic code can u help me with this !!!!! -
Forgetguys can anyone help me with the details on how to execute the project wireless intrusion detection system and new attack model,i am stuck
-
prateekloadwhere are com.gts packages you imported in ur source code
-
steviecan anyone provide the steps to implement this project
-
ashok21iam doing my mini project on this,but it dont have any database,i implement it in java by using jframebuilder tool plz plz plz help me how to implement this project by addind,backend or ant javascript
-
stevie@ashok
do not waste your time in this project,as i have already done
the guy who has started this thread,has done this just to brag about himself
i contacted this guy,and he was very reluctant to help me(as he has just blindly copied these project synopsis from some where)
he has no idea about the implementation of these
so please dont waste your time,and work on some other project -
Manish GoyalFor those who are really interested in Intrusion Detection then this might be a helpful link
#-Link-Snipped-# -
mandar ghatedats too good madhumurundi. i am planning to do this topic as my be project. so, can u give me the project report of this topic??? it must have coding, screenshots nd everything and must be of minimum 70 pages. if u can do this please send me a mail on #-Link-Snipped-#. i am also ready to paya suitable amount for it. thanx a lot!!!!
-
rahulpatil8080from where i can get library refereed in this project.
You are reading an archived discussion.
Related Posts
â
Alright, relax folks, its just a proposed idea đ
I was planning to work on a "Home Solar Project", In which I try using grid connected solar systems at...
Hi friends, I'm currently working in an instrumentation company. Its a startup company. We completed one project, but now because of recession we have wait for the next project. With...
[FONT="] [/FONT]I have been working as Software Quality Analyst for the last two years and was hoping to go abroad for studies in a year or two. With the recession...
Hi CEans,
Its great to be a part of this wonderful community. The inspiration and knowledge that i gain by going through the forum is enormous.
Gathering such inspiration from...
Hi all!
I wonder how feasible it would be to run a container terminal without paving the ground. Also, I wonder how a badly constructed unpaved road could be temporarily...