Security has become one of the major issues for data communication over wired an

d wireless networks. Different from the past work on the designs of cryptography
algorithms and system infrastructures, we aim at the proposing of a dynamic rou
ting algorithm that could randomize delivery paths for data transmission. The al
gorithm is easy to implement and compatible with popular routing protocols, such
as routing information protocol in wired networks and destination-sequenced dis
tance vector protocol in wireless networks, without introducing extra control me
ssages. An analytic study on the proposed algorithm is presented, and a series o
f simulation experiments are conducted to verify the analytic results and to sho
w the capability of the proposed algorithm.

Dynamic Routing with Security Considerations

Modules:
1. Network Module
2. Dynamic Routing
3. Randomization Process
4. Routing Table Maintenance
5. Load on Throughput
Module Description:
1. Network Module
Client-server computing or networking is a distributed application architecture
that partitions tasks or workloads between service providers (servers) and servi
ce requesters, called clients. Often clients and servers operate over a computer
network on separate hardware. A server machine is a high-performance host that
is running one or more server programs which share its resources with clients. A
client also shares any of its resources; Clients therefore initiate communicati
on sessions with servers which await (listen to) incoming requests.
2. Dynamic Routing
To propose a distance-vector based algorithm for dynamic routing to improve the
security of data transmission. We propose to rely on existing distance informati
on exchanged among neighboring nodes (referred to as routers as well in this pap
er) for the seeking of routing paths. In many distance-vector-based implementati
ons, e.g., those based on RIP, each node maintains a routing table in which each
entry is associated with a tuple, and Next hop denote some unique destination n
ode, an estimated minimal cost to send a packet to t, and the next node along th
e minimal-cost path to the destination node, respectively.

3. Randomization Process
The delivery of a packet with the destination at a node. In order to minimize th
e probability that packets are eavesdropped over a specific link, a randomizatio
n process for packet deliveries, in this process, the previous next-hop for the
source node s is identified in the first step of the process. Then, the process
randomly picks up a neighboring node as the next hop for the current packet tran
smission. The exclusion for the next hop selection avoids transmitting two conse
cutive packets in the same link, and the randomized pickup prevents attackers fr
om easily predicting routing paths for the coming transmitted packets.
4. Routing Table Maintenance
In the network be given a routing table and a link table. We assume that the lin
k table of each node is constructed by an existing link discovery protocol, such
as the Hello protocol in. On the other hand, the construction and maintenance o
f routing tables are revised based on the well-known Bellman-Ford algorithm.
5. Load on Throughput
Investigate the effect of traffic load on throughput for our proposed DDRA; the
traffic is also generated based on variable-bit-rate applications such as file t
ransfers over Transmission Control Protocol (TCP). The average packet size is 1,
000 bytes, and source-destination pairs are chosen randomly with uniform probabi
lities.

Dynamic Routing with Security Considerations

Dynamic Routing with Security Considerations
Abstract:
Security has become one of the major issues for data communication over wired an
d wireless networks. Different from the past work on the designs of cryptography
algorithms and system infrastructures, An analytic study on the proposed algori
thm is presented, and experiments are conducted to verify the analytic results a
nd to show the capability of the proposed algorithm.
Algorithm / Technique used:
Distance-vector-based algorithm for dynamic routing.
Algorithm Description:
A distance-vector-based algorithm for dynamic routing to improve the security of
data transmission. We propose to rely on existing distance information exchange
d among neighboring nodes (referred to as routers as well in this paper) for the
seeking of routing paths. In many distance-vector-based implementations, e.g.,
those based on RIP, each node Ni maintains a routing table in which each entry i
s associated with a tuple and Next hop denote some unique destination node, an e
stimated minimal cost to send a packet to t, and the next node along the minimal
-cost path to the destination node, respectively.
Existing System:
Existing work on security-enhanced data transmission includes the designs of cry
ptography algorithms and system infrastructures and security-enhanced routing me
thods. Their common objectives are often to defeat various threats over the Inte
rnet, including eavesdropping, spoofing, session hijacking, etc. Among many well
-known designs for cryptography based systems, the IP Security (IPSec) and the S
ecure Socket Layer (SSL) are popularly supported and implemented in many systems
and platforms. Although IPSec and SSL do greatly improve the security level for
data transmission, they unavoidably introduce substantial overheads, especially
on gateway/host performance and effective network bandwidth. For example, the d
ata transmission overhead is 5 cycles/byte over an Intel
Pentium II with the Linux IP stack alone, and the overhead increases to 58 cycle
s/byte when Advanced Encryption Standard (AES) is adopted for encryption/decrypt
ion for IPSec.

Proposed System:
We will propose a dynamic routing algorithm that could randomize delivery paths
for data transmission. The algorithm is easy to implement and compatible with po
pular routing protocols, such as the Routing Information Protocol in wired netwo
rks and Destination-Sequenced Distance Vector protocol in wireless networks, wit
hout introducing extra control messages.
Hardware Requirements
SYSTEM : Pentium IV 2.4 GHz
HARD DISK : 40 GB
FLOPPY DRIVE : 1.44 MB
MONITOR : 15 VGA colour
MOUSE : Logitech.
RAM : 256 MB
KEYBOARD : 110 keys enhanced.
Software Requirements
Operating system :- Windows XP Professi

Reference: http://www.seminarprojects.com/Thread-dynamic-routing-with-security-c
onsiderations--11744#ixzz0smxrMMm3

This paper delivers some basic information about the security of Web forms from
Web bots (robots). Possible threats are described and the article gives a list o
f some methods which can be used to protect Web forms. The emphasis is on the CA
PTCHA (completely automated public turing test to tell computers and humans Apar
t) method that is most often used method. At the end of paper you can find one i
mplementation of security methods using PHP and MySQL technologies.