Secure Communications Over Wireless Broadcast

Networks: Stability and Utility Maximization

Abstract

A wireless broadcast network model with secrecy constraints is investigated, in which a source
node broadcasts confidential message flows to user nodes, with each message intended to be
decoded accurately by one user and to be kept secret from all other users (who are thus
considered to be eavesdroppers with regard to all other messages but their own). The source
maintains a queue for each message flow if it is not served immediately. The channel from the
source to the users is modeled as a fading broadcast channel, and the channel state information is
assumed to be known to the source and the corresponding receivers. Two eavesdropping models
are considered. For a collaborative eavesdropping model, in which the eavesdroppers exchange
their outputs, the secrecy capacity region is obtained, within which each rate vector is achieved
by using a time-division scheme and a source power control policy over channel states. A
throughput optimal queue-length-based rate scheduling algorithm is further derived that
stabilizes all arrival rate vectors contained in the secrecy capacity region. Moreover, the network
utility function is maximized via joint design of rate control, rate scheduling, power control, and
secure coding. More precisely, a source controls the message arrival rate according to its
message queue, the rate scheduling selects a transmission rate based the queue length vector, and
the rate vector is achieved by power control and secure coding. These components work jointly
to solve the network utility maximization problem. For a non-collaborative eavesdropping
model, in which eavesdroppers do not exchange their outputs, an achievable secrecy rate region
is derived based on a time-division scheme, and the queue-length-based rate scheduling
algorithm and the corresponding power control policy are obtained that stabilize all arrival rate
vectors in this region. The network utility maximizing rate control vector is also obtained.
EXISTING System:
Although jointly considering secrecy, reliability, and stability for network utility maximization
has the potential for significant impact in improving network performance and resource
efficiency, this perspective has not been examined before.

One reason is because the physical layer approach to achieve security, which quantifies the
measure of secrecy and greatly facilitates this joint design, has attracted considerable attention
only recently.

However, broadcast communications make use of the open nature of the wireless medium, which
presents a great challenge to achieve secure communication for individual users.

Proposed System:


We have designed, developed, and implemented a compromised router detection protocol that
dynamically infers, based on measured traffic rates and buffer sizes, the number of congestive
packet losses that will occur.

Each and every packet is encrypted so that to prevent the data from eavesdropping. So the data is
very secured.

Once the ambiguity from congestion is removed, subsequent packet losses can be attributed to
malicious actions.
UML Diagrams
Data Flow Diagram







SOURCE
PACKET
DETECTOR
RED ALGORITHM
DISCARD
PACKETS
RESULT
RECEIVED
PACKETS
System Architecture





















SECURE COMMUNICATION SYSTEM
Packet
Creation
Send data

ENCRYPT
Discard
packets

RESULT
RED
Algorithm
Received
packets
QUEUE
CONTEXT ANALYSIS DIAGRAM
Use case Diagram







source
packets
send data
queue
detector
destination
result

Class Diagram















State Diagram










source packets
detector
packet
validation
dest result
Activity Diagram











source
packet
spiliting
send data
router
received
packets
discarded
packets
receiver
result
Collaboration Diagram












source packets
queue
detector received
packets
packet
validation
result
1: file load
2: seperation of packets
3: foward the packet
6: malicious packets
7: normalpackets
8: result
9: graph
discarded
packets

Sequence Diagram




result : (result) source :
(source)
packets :
(packets)
queue : (queue) detector :
(detector)
received
packets...
discarded
packets...
packet
validation...
file load
seperation of packets
foward the packet
malicious packets
normalpackets
result
graph

Component Diagram

Module Description
User Interface Design:-
In this module we design the windows for the project. These windows are used to transfer
the messages and receive the messages. We use the Swing package available in Java to design
the User Interface. Swing is a widget toolkit for Java. It is part of Sun Microsystems' Java
Foundation Classes (JFC) an API for providing a graphical user interface (GUI) for Java
programs.
Network Formation:-
This module is to create a network in between the three nodes available in our project.
We create a network which consists of three nodes. These nodes are capable of transfer messages
to other nodes directly or through other nodes.
source received
packet
detector malicious
packet
received
packet
packet
validation
result
Packet separation

In this module, browse and select the source file. And selected data is converted into fixed
size of packets. Each packet contains 48 bits and the packet is send from source to detector.
Encrption:-
In this module we transfer the message from the source node to Detector node. Then it
will transfer through the Queue. Here we will apply the RED Algorithm. It will find the length of
the packet and then it will encrypt the messages.
Hardware Requirements:

PROCESSOR : PENTIUM IV 2.6 GHz
RAM : 512 MB
MONITOR : 15
HARD DISK : 20 GB
CDDRIVE : 52X
KEYBOARD : STANDARD 102 KEYS
MOUSE : 3 BUTTONS

Software Requirements:

FRONT END : JAVA, SWING
TOOLS USED : JFRAME BUILDER
OPERATING SYSTEM: WINDOWS XP