RELIABLE SIMULATOR FOR TRANSMISSION OF PACKETS
IN VARIOUS MODES THROUGH WIRELESS LAN
Ms.Afridha Parveen.B, Ms.Muthulakshmi.SP, Ms.Varshini.P and Mrs.Aarthi.S,
Department of Computer Science and Engineering, Meenakshi Sundararajan Engineering College,
Kodambakkam, Chennai, TamilNadu, India.
parveenafridha@gmail.com, muthulaxmi90@gmail.com, wisevarshini@gmail.com,
aarthigopinath.smile@gmail.com
Abstract- This paper aims at rapid development
of Networking, a growing domain for reliable and
secure data transmission. A Unicast transmission
is a way in which packets of data are transmitted
to a single recipient on a network. A Multicast
transmission is the way in which packets of data
are transmitted to a group of hosts on a network.
The main idea of the framework is to transmit
data using unicast and multicast transmission
based on the acknowledgement received for each
packet of data. If acknowledgement is not
received then the transmission rate, packet count
are altered for a reliable transmission. To
guarantee reliable transmissions, we have
leveraged the protocol R-UDP (Reliable- UDP) to
re-transmit packets based on the ACK and Lazy
scheduling algorithm to reduce rate of
transmission. Our results show that R-UDP and
lazy transmission perform efficiently over high
speed dedicated networks and the model is able
to provide good estimate of performance.
Keywords- Networking, Reliable transmission,
R-UDP,Lazy transmission,Wireless LAN.
1.INTRODUCTION
1.1. Networking
A device has potential to send and receive
information generated by different devices on a
network. Communication refers to the transmission
of data in between devices. Network could be a
telecommunication channel victimization that we
are able to share information with different
computers or devices connected to constant
network. It is known as Data Network.The
simplest example of Internet network is web.
Network protocols are formal standards and policies
comprised of rules, procedures and formats that
define communication between two or more devices
over a network. Network protocols govern the end-
to-end processes of timely, secure and managed data
or network communication.
1.2. Ethernet LANs: Understanding Packet
Information Transmission & Device Addressing
One of the key components to the success of local
area network is concept of packet data transmission,
where data, images, and even sound files are divided
and reformatted into small units, transmitted over
the network, and reassembled to be used by the
receiving computer.It is actually possible to
transmit a whole stream of data from start to
finish from one system to another. This sort of
transmission is usually used once a system solely
transmits in one direction, from one device to
another. On large networks like internet, the packets
that contain a transmitted file might go by
numerous routes from one system to a different.As
the packets travel, routers and switches scan the
destination address of the packet, and forward
it on to its final destination. Routers and switches
direct the packets to the quickest path accessible at
that time. If one path becomes busy then the packets
are transmitted using the next fastest route.
The situation becomes more complex when
multiple communication devices, such as
computers, are connected to a common cable or
segment, and each device needs the capability to
speak with all of the others. If files were sent from
one computer to another in one uninterrupted
stream, all of the other devices would be unable to
communicate during that time period.Because of
these issues, Ethernet divides files to be transmitted
into packets, which provide addressing, sequencing
and other information, which allows the receiving
network device to properly reassemble the file.
These packets are also referred to as frames.
FIGURE 1.
Device Addressing-To facilitate communications,
each device on an Ethernet network must be
properly and uniquely addressed. Each Ethernet
network device will have two addresses, a MAC
(physical) and an IP (logical). MAC addresses are
hard-coded into a device or product at the factory,
and typically are never changed. IP addresses are
settable and changeable, allowing networks to be
configured and changed.
In recent years, network information measure has
become an important issue for each network
service suppliers similarly as content suppliers. For
instance, the increasing quantity of transmission
content has occupied an outsized portion of
accessible network capability. However, most of the
content is transmitted with the help
of communications protocol as its real options, like
the slow begin, the information
measure searching, and also the congestion
management give dependableness throughout
communication. Meanwhile, the overhead
of communications protocol packet headers and
ACK messages remains a significant issue because
it consumes a lot of information measure and time
than UDP transmissions .
2.RELATED WORKS
2.1.Reliable UDP
Reliable UDP may be a long-investigated topic in
networks. Compared to TCP, UDP is a lightweight
transport protocol and is suitable for fast and
efficient transmission without guarantees. However,
users might encounter slight overhead for a few
extra options, like responsibility. To leverage the
strength of each protocols, several reliable UDP
works are planned. These works can be divided into
three types: (See figure 2)
1. Transport layer modification
2. Application layer modification
3. Middle layer modification.
The first type of reliable UDP modifies the transport
layer. That is, this approach changes the UDP’s
header and its behaviour. In 1999 Cisco proposed
the representative RELIABLE UDP PROTOCOL
(RUDP), which adds six additional bytes on a header
for the acknowledgment, the retransmission, and the
checksum. Although these added mechanisms are
similar to TCP, the overhead is decreased. Note that
RUDP is not currently a formal standard.
Another example is DTLS. DTLS is a
secure protocol for datagram transmission instead of
the transport layer. However, it provides a suitable
example to see how UDP could deal with the
reordering and packet loss issues.
FIGURE 2. Three types of reliable UDP schemes.
The grey blocks are used to indicate the modification
parts of different scheme types
The advantage of this approach is that the new UDP
protocol has more features and can serve many of
the existing applications. The trade-off is that users
can only communicate with those who have the
same transport layer protocol.
The second approach works for reliability
from the transport layer to the application layer. In
2002, He et al. proposed RBUDP (Reliable Blast
UDP) for QoS-enabled networks. TCP and UDP are
used simultaneously, TCP can be used for signalling
and UDP for data traffic. Here the TCP connection
exchanges the data transfer status for ensuring
reliability and QoS while the UDP channel, which
has higher bandwidth, helps to transfer data more
efficiently. SABUL, which was proposed in 2003,is
another similar approach for congestion control.
Finally, Tsunami is an approach which replaces
sliding window by inter-packet delay adjustment for
rate control. The advantage of these schemes is that
the network stack remains unchanged and that
therefore these approaches can be ported to almost
all systems. The problem is that existing applications
need to be patched and re-implemented.
The third approach builds a middle layer
between the transport layer and the application layer.
In 2007, Gu and Grossman proposed the UDT
(UDP-based data transfer)framework. This
framework creates a UDT socket layer by providing
applications with a new set of socket APIs while
internally using OSI socket APIs. The liability and
congestion control mechanisms are implemented in
this new socket layer. RUFC is another framework
that similarly creates a middle layer.What makes it
different is that its middle layer can accept different
policies for different applications. Thus, RUFC
makes it possible to customize policies for
application optimization. The obvious benefit of this
design is that it can be applied directly to existing
UDP. However, applications need to use another set
of socket APIs. Another problem is that this type of
approach adds a new layer which will cost extra
overhead for data bypass. Unfortunately, all of the
above schemes are end-to-end solutions, meaning
that in order to implement them, existing protocols
need to be modified, no matter whether the modified
part is in the transport layer, the application layer or
between these two layers. In the real world that the
TCP/IP has been well deployed, making it almost
impossible to replace the transport layer of all hosts.
Therefore, normal users cannot enjoy the benefits of
reliable UDP. To fill in this gap this work imitates
TCP behaviour in UDP with SDN support so that
users can setup a TCP connection while actually it is
a UDP transmission in the network. This work is
totally network-realized and is transparent to users.
FIGURE 3. R-UDP implementation
In order to ensure quality, it extends UDP by means
of adding the following features:
 Acknowledgment of received packets
 Windowing and flow control
 Retransmission of lost packets
 Over buffering(Faster than real-time
streaming)
2.1.Lazy Scheduling
Lazy scheduling is a runtime scheduler for task-
parallel codes that effectively coarsens parallelism
on load conditions in order to significantly reduce its
overheads compared to existing approaches, thus
enabling the efficient execution of more fine-grained
tasks. Unlike other adaptive dynamic schedulers,
lazy scheduling does not maintain any additional
state to infer system load and does not make
irrevocable serialization decisions. These two
features allow it to scale well and to provide
excellent load balancing in practice but at a much
lower overhead cost compared to work stealing, the
golden standard of dynamic schedulers. We evaluate
three variants of lazy scheduling on a set of
benchmarks on three different platforms and find it
to substantially outperform popular work stealing
implementations on fine- grained codes.
Furthermore, we show that the vast performance gap
between manually coarsened and fully parallel code
is greatly reduced by lazy scheduling, and that, with
minimal static coarsening, lazy scheduling delivers
performance very close to that of fully tuned
code.The tedious manual coarsening required by the
best existing work stealing schedulers and its
damaging effect on performance portability have
kept novice and general-purpose programmers from
parallelizing their codes. Lazy scheduling offers the
foundation for a declarative parallel programming
methodology that should attract those programmers
FIGURE 4. Lazy transmission
by minimizing the need for manual coarsening and
by greatly enhancing the performance portability of
parallel code.
In FIGURE 4, the sender and receiver transmits data.
When there is a packet loss encountered in the
sender side the transmission just aborts and stores
the updated information. After encountering a
packet loss it determines the basic time stamp
information and the number of data being
transmitted. According to the time stamp, number of
data and the rate at which the data is transmitted
analysed. Retransmitted the data based on the
analysed information either by
increasing/decreasing the rate of transmission and
reducing the number of data to be transmitted. And
then the transmission takes place if there is no
abortion of the transmission, the rate at which data
is transmitted takes place for the other transmissions
or else some corrections are made to transmit the
data properly. (I’,S1) depicts the reduced
transmission state.
3.PROPOSED SYSTEM
3.1.Motivation
In the existing system, packets are transmitted using
unicast transmission where it is basically one -to-one
transmission. In unicast transmission there are many
drawbacks, usage on network bandwidth is high,
network traffic over LAN is high. Replicas of data
are not available, packet loss cannot be detected.
Acknowledge is sent for each message and this
results to overhead. To overcome all the above
stated problems, a reliable transmission is been
implemented.

FIGURE 7. Architecture of proposed system

3.3.Modules

The main modules of this system deals with the

FIGURE 5. Unicast Transmission following:

3.2.Architecture 1.Selecting the mode of transfer-Depends on the

mode in which the data packets can be transferred
within/in between networks. Choosing the data to be
In this system, a reliable transmission is achieved by
trasnfered.
using the rate of transmission, record size and packet
size. Here, they can be selected based on their needs.
2.Unicast/Multicast Module-A Unicast transmission
Multicast transmission is been implemented, where
transmits packets of data to a single recipient on a
a particular system can communicate with a set of
network. A Multicast transmission transmits packets
networks that are been connected in the same LAN.
to a group of hosts on a network.

3.Applications based on packet transfer- Retrieving

the satellite data and using it for image analysis for
weather prediction and detecting the location at
which it is present.

Admin Server Client

Server Login

Authorize Server

Client Login

Authorize Client

Select mode of

FIGURE 6.Multicast Transmission transmission

1.Unicast
2.Multicast

Choose the mode of

transmission
Number of packets to be sent, record size of each
packet and the rate of transmission is been Select the packet size to
be transferred

mentioned to make the system more reliable. The Select the record size to
be transmitted

transferring of packets can be resumed at any time Select the rate of

transmission

of the transfer. Data can be retransmitted in any case Enter the details

of failure or packet loss. Transmit()

Stop()

Retransmit()

Retrieve the latitude

and longitude positons

Plot the co-ordinates on

the map

FIGURE 8. Sequence Diagram

4.RESULT AND DISCUSSION university, shanghai 201306, china correspondence
should be addressed to yanli
Multicast transmission is been implemented, where http://ieeexplore.ieee.org/document/5628544/
a particular system can communicate with a set of
networks that are been connected in the same LAN. [4]Improving Network Management with Software
This mode is useful if a group of clients require a Defined Networking
common set of data at the same time, or when the hyojoon kim and nick feamster, georgia institute of
clients are able to receive and store common data technology
until needed. When you access the network and the http://ieeexplore.ieee.org/document/994436/
devices in the same network is ready for
transmission then the packets will get transmitted. If [5]Reliable Blast UDP : Predictable High
packet loss occurs it self adjusts the sending number Performance Bulk Data Transfer
of packets and it gets transmitted. This kind of eric he, jason leigh, oliver yu, thomas defanti
transmission reduces extra ACK messages from the electronic visualization laboratory university of
system and it is reliable for packet transmission. illinois at chicago
http://www.secdev.org/projects/scapy/
5.CONCLUSION AND FUTURE WORK
[6]Efficient Reliable Transmission for Mixed
Multicast and Unicast Flows
This paper proposes a reliable transmission wendie wang, sanshan sun, and menghan wei
framework for packet transmission which can easily college of physic and electronic engineering sichuan
be deployed to a larger network. When compared to normal university chengdu, china e-mail:
unicast, multicast system helps in a better way of wangwendie@126.com, sunsslucky@163.com,
transmission. It can adapt to any circumstances martha82@163.com
based on the retransmission of data packets due to https://www.opennetworking.org/sdn-
packet loss.This packet transfer is said to be reliable. resources/openflow

As future enhancement the satellite image is in the [7]MULTICAST OVER SATELLITE

form of binary data format.Using the binary data the
location ie the latitude and longitude of the satellite
data can be found out and can be plotted on the world
map. This improvises the applicational use of the
transfer of data over LAN. Furthermore, a weather
forecast can also be predicted on the satellite data
which is been transmitted over LAN.
hidetaka izumiyama jsat corporation 1-26-5
toranomon minato-ku, tokyo, japan izu@jsat.net
https://www.wireshark.org/download.html
[8]https://www.broadcom.com/products/ethernetco
nnectivity/software/of-

REFERENCES

[1] SDUDP: A Reliable UDP-Based Transmission

ming-hung wang1(student member, ieee), lung-wen
chen2po-wen chi3 (member, ieee), and chin-laung
lei1 received march 17, 2017, accepted april 9, 2017,
date of publication april 12, 2017, date of current
version may 17, 2017.
https://www.hindawi.com/journals/misy/2017/8012
517/ref/

[2] ENERGY-EFFICIENT PACKET

TRANSMISSION OVER A WIRELESS LINK
ieee/acm transactions on networking, vol. 10, no. 4,
august 2002
http://ieeexplore.ieee.org/document/6235095/

[3] A DEVICE-TO-DEVICE MULTICAST

SCHEME FOR DELAY-CONSTRAINT
CONTENT DELIVERY
departmexu;xylzoe1@163.com received 9
september 2016; revised 6 january 2017; accepted
15 january 2017; published 8 February 2017nt of
information engineering, shanghai maritime