Network-Coding-Based Signal Recovery for

Efficient Scheduling in Wireless Networks

Introduction

One of the severe problems in wireless interaction is the interference. Interference

is caused due to collision. In wireless network, the signal sent by a node will reach all its
neighboring nodes. The signal will collide, if a neighbor apart from the target node is
receiving data from more than one node at the same moment then the required signal will
get cracked, which result in communication crash. In conventional wireless networks, this
crash of signals may cause communication failure if no division procedure is accepted.
This will corrupt the system performance, which include packet loss rate and energy
effectiveness. In traditional transmission when a terminal is receiving messages, its
neighbors cannot transmit until receiving is finished, such a mechanism is not efficient
and a lot of bandwidth is wasted. The inefficiency of traditional wireless transmission is
mainly due to regulating the signal collision. In dispersed network such as ad hoc and
some sensor networks, the organize hub will not present in the network. This will
increase the clash and interference. In wireless networks, when signal crash,
electromagnetic waves will overlap on each other. This strategy is much more practical
and easier to realize. Neither strict synchronization nor power control is needed among
the different terminals.

Scope of the project

To develop the system to recover the useful signal from the collided signals and to
protect useful signal from unauthorized access. It eliminates the interface with high
efficiency. Thus the throughput and network efficiency can greatly be increased.
 Literature Survey

Hidden Nodes Avoidance

The hidden nodes problem in wireless multi-hop sensor networks was mainly addressed
with two techniques: RTS/CTS and Carrier Sense Tuning .RTS/CTS was basically
designed to reduce the number of collisions due to hidden nodes by reserving the channel
around both the sender and the receiver to protect frame transmission from being
corrupted by hidden nodes. However, this method presents several problems when used
in wireless multi-hop sensor networks:
• The energy consumption related to a RTS/CTS exchange is significant, data frames are
usually small, the collision probability is the same for data frames as for RTS/CTS, so it
does not make any difference if the technique is used or not
• It does not avoid collisions in multi-hop networks
• It may lower the network capacity due to the exposed node problem,
• It cannot be used for broadcast frames.
Several MAC protocols have proposed to use Carrier Sense Tuning to cope with the
hidden node problem .The key idea comes from the observation that hidden nodes cause
Collisions, because their radio carrier sense range is not large enough to sense on going
transmissions they may collide with. Hence, a node should tune its radio carrier sense
range to make sure that when it transmits, there is no another transmission. Although this
method allows a node to detect ongoing transmissions, it is not suitable for all situations.
For example, it assumes a homogeneous radio channel for all nodes, which is not always
possible because of obstacles, different antenna height, etc. Even if the channel is
homogeneous, it is not possible to increase the carrier sense range of radio transceivers
indefinitely due to physical limitations.
Network coding and routing
The capacity benefit of network coding relative to multicast routing, i.e. forwarding
and replication over one or more multicast trees. Network coding has been shown to be
necessary for achieving multicast capacity in some wired networks; examples of such
networks are extensions or generalizations. Static wireless network with fixed link rates
and a half-duplex constraint, i.e. each node can either send or receive a single
transmission at any one time. In this example, the optimal network coding solution, times
the multicast throughput of the optimal routing solution, As we consider more realistic
wireless network models, we move progressively further from the static wireless model
that is closest to the original wired model. For instance, if we consider the effect of
interference on link capacities, it is not clear to what extent the network coding and
routing solutions are affected, since their transmit scenarios involve different sets of
interfering links. Also, channel conditions often vary and traffic is usually busty because
either the sources generate traffic in bursts or the network nodes employ queuing and
scheduling across multiple sessions. In such scenarios, optimal scheduling, routing and
coding should vary dynamically depending on the current state of the network – channel
conditions and buffer occupancy. The back-pressure approach has mostly been applied in
the context of unicast transmissions; it has also been extended to the case of multicast
transmissions. However, in the multicast case without network coding the algorithms are
significantly more complex, even for wired networks.
Network coding in ad hoc networks
Network coding refers to the basic notion of performing coding operations on the
contents of packets throughout a network linear structure were sufficient to achieve the
capacity of multicast connections in lossless, wire line networks. The utility of such
random linear codes for reliable communication over lossy packet networks— such as
wireless ad hoc networks. the efficient operation of adhoc networks is given, which
proposes using the random linear coding scheme coupled with optimization methods for
selecting the times and locations for injecting coded packets into the network. The
problem of identifying the maximum end-to-end throughput that a multicast connection
can achieve with network coding given an unreliable ad hoc network. We give two
mathematical optimization formulations for maximum throughput multicast: one with
network coding and one without; then, we compare the maximum throughput that
network coding achieves to the maximum throughput that conventional multicast
achieves in an example network topology. We develop formulations based on the convex
programming formulation of the minimum cost multicast problem for network coding. In
contrast to the minimum cost multicast problems, modeling the wireless medium
contention constraints is crucial in the maximum throughput problem.
Analog Network Coding
Wireless interference is typically considered harmful. Wireless networks strive to prevent
senders from interfering. They may reserve the medium to a specific node using TDMA
or probe for idleness as in 802.11. This fear of interference is inherited from single
channel design and may not be the best approach for a wireless network. With bandwidth
being scarce in the frequencies allocated to wireless networks, it is desirable to enable
concurrent receptions despite interference. When two senders transmit simultaneously,
the packets collide. The signal resulting from a collision, however, is nothing but the sum
of the two colliding signals after incurring attenuation and phase and time shifts. Thus, if
the receiver knows the content of the packet that interfered with the packet it wants, it can
cancel the signal corresponding to that known packet after correcting for channel
distortion. The receiver is left with the signal of the packet it wants, which it decodes
using standard methods. In a wireless network, when two packets collide, nodes often
know one of the colliding packets by virtue of having forwarded it earlier or having
overheard it. Thus, this approach encourages two senders to transmit simultaneously if
their receivers can leverage network-layer information to reconstruct the interfering
signal. It provides an algorithm for analog network coding that makes no synchronization
assumptions. Indeed, our approach exploits the lack of synchronization between
interfering signals and enforces it by inserting random delays before a transmission. Lack
of synchronization means that the two signals do not perfectly align; one signal starts first
with a few bits that do not interfere with the other signal, while the second signal ends
last with a few bits that do not interfere with the first signal. The receivers use these
interference-free bits on both sides of the interfered signal to estimate the wireless
channels from the two senders. We present a novel algorithm for analog network coding
that does not make any synchronization assumptions. This algorithm codes packets
within a single flow, and across different flows that intersect at a router
 Module
• Login
• Split file
• Intermediate server
• File merge
• Server

Module Description
Login
In Login Form module presents users a form with username and password fields.
If the user enters a valid username/password combination they will be granted to access
data. If the user enter invalid username and password that user will be considered as
unauthorized user and denied access to that user.
Split file
In this module user select a file to transfer from source to destination. The
selected file is splitted to any number of segments based on the user need. The number of
segments which is splitted has been transferred from source to destination one by one.
Intermediate server
This server receives splitted segment of file from source without any content or
data loss .In this module Collision recovery algorithm is implemented to recover the
useful information that is the file from collision. This server receives all segment of file
from source without collision, protect and forward it to destination.
File Merge
File has been splitted to several segments. All those segments have been transfer
from source to destination without any collision through intermediate server. This module
is responsible for merging all those segments at the destination to get and view the Entire
file without any collision.
Server
 This module is destination in our project. In this module merged file is received at
the specified location and user can view the file without any loss in the content of the file.
It save the merged file in that specified location for later use.

Module Diagram

Login

Split the file

Send the file segment

Intermediate server
receive file segment

Collision
recovery
 Transferred to
destination

Technique or algorithm used

In our project we propose Network Coding technique and signal recovery

algorithm. This algorithm is used to recover the useful file from collision. Interference
will be eliminated by this collision recovery algorithm.

Input and output Design

Login
Given Input- Giving user name and password as input.
Expected Output- Permit authorized user to transfer a file.
Split file
Given Input- user selected file is given as input.
Expected Output- Split the file into several segments.
Intermediate server
Given Input- Received file segment from source is given as input.
Expected Output- protect that segment of file from collision.
File merge
Given Input-Splited file segment as given as input.
Expected Output- merge those segment and give entire file.
Server
Given Input-merged file is given as input.
Expected Output- store the merged file at the user specified location.

System Design

Use case Diagram

 login
Intermediat
e server
choose file

user
Split file

Transfer file segment

server

Receive and send file

segment

Merge file segment

View file without

collision

Class Diagram
 Intermediate
path
recovery

receive segment()
collision recover()
send segment()

Destination
new user receive path
username path to merge
password save
select file() receive segment()
split file() merge segment()
transfer segment() display file()

Object Diagram

User
Display file
Choose without Send Merge
Segment
Intermediate
file collision segment segment
file Server
 State Diagram

State Diagram
 login

choose
file

file split

collision
rec over

merge
file

Activity Diagram
 Login

choose
file to split

send splitted segment to

intermediate server

collision
Recover

merge splitted
segment

Display Entire file

without collision
 Sequence Diagram

use r lo g in s p lit f ileIn te r m e d ia te c o llis io n s e rv e r

s e rv e r re c o v e ry
c h e c k A u th o r iza tio n
p ro c e e d

c h o o s e file to s p lit
R e c e iv e & s e n d s e g m e n t
s e n d t h e s p litt e d s e m e n t
R e c o v e r c o llis io n

m e rg e s e g m e n t

D is p la y E n tir e file w ith o u t c o llis io n

 Collaboration Diagram

lo gin
1 : c h e c k a u th o riza tio n

us e r 2 : pro c e e d 3 : c h o o s e file to s plit

s p lit
file
8 : D is pla y file w itho ut c o llis io n
4 : s e nd th e s p litte d s e m e n t

7 : m e rg e s e gm e nt
Inte rm e dia te
s e rv e r
5 R: e c e iv e a nd s e n d s e gm e nt
s e rv
er
c o llis io n
re c o v e ry 6 : R e c o v e r a n d s e nd

Component Diagram
 login

select
user
file

split server
file

Receive
Intermediat segment
e server
merge
segment

display without
collision
 Data Flow Diagram

Login

User

Split file

Intermediate

Merge File

Server

Display file
 ER Diagram

Choose file
User

Authorized Split
Login Chec user
k

Intermediate Send
segment

Server

Display Merge
file segment
 System Architecture

Choose
Login User file

File
Intermediate split

Server Merge file

Display without
collision
 Project flow Diagram

User Login Split file

Intermediate

Merge
Server
file

Future Enhancement
 We develop this project in wired network as a future work we can develop this
project in wireless network for broadcast multiple signals simultaneously without any
interference.

Advantages

• Throughput and efficiency will be increased.

• System resources will not be wasted.
• System has high probability of eliminating interference.

Applications

• It is used in peer to peer networks.

• This system can also be implemented in wireless channel.
• This system is implemented in wireless Broadcast.

Conclusion

The proposed a signal-recovery algorithm based on the physical-layer network coding

Technique, which can eliminate the interference signal and recover the useful information
from the mixed signal and protect that useful information from unauthorized access.
Network coding strategy is that neither synchronization nor power control is needed
among the different transmitters. Thus, the throughput in network can greatly be
increased.

References
[1] A. Bachir, D. Barthel, M. Heusse, and A. Duda, “Hidden nodes avoidance in wireless
sensor networks,” in Proc. Int. Conf. Wireless Netw., Commun.Mobile Comput., Jun. 13–
16, 2005, pp. 612–617.
[2] Y. Zhou and S. M. Nettles, “Balancing the hidden and exposed node problems with
power control in CSMA/CA-based wireless networks,” in Proc. IEEE Wireless Commun.
Netw. Conf., Mar. 13–17, 2005,pp. 683–688.
[3] T. C. Keong presented at the Ad hoc mobile wireless networks: Protocols Syst. Conf.,
2002.
[4] R. Ahlswede, N.Cal, S. Y. R. Li, and R. W. Yeung, “Network information
Flow,” IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204–1216, Jul. 2000.
[5] S. Y. R. Li, R. W. Yeung, and N.Cai, “Linear network coding,” IEEE Trans. Inf.
Theory, vol. 49, no. 2, pp. 371–381, Feb. 2003.
[6] T. Ho, J. Jin, and H. Viswanathan, “On network coding and routing in dynamic
wireless multicast networks,” in Proc. Workshop Inf. Theory Applicat., Univ. Calif., San
Diego,CA, 2006.
[7] H.Wang, P. Fan, and K. B. Letaief, “Maximum flow and network capacity of network
coding for ad-hoc networks,” IEEE Trans. Wireless Commun., vol. 6, no. 12, pp. 4193–
4198, Dec. 2007.
[8] J. Zhang, P. Fan, and K. B. Letaief, “Network coding for efficient multicast routing in
wireless ad-hoc networks,” IEEE Trans. Commun., vol. 56, no. 4, pp. 598–607, Apr.
2008.
[9] S. Boppana and J. M. Shea, “Overlapped transmission in wireless ad hoc networks,”
in Proc. ICCCAS, Guilin,China, 2006, pp. 1309–1314.
[10] S. Katti and D. Katabi, “Embracing wireless interference: Analog network coding,”
in Proc. Conf. Appl., Technol., Archit., Protocols Comput. Commun, Kyoto, Japan, 2007,
pp. 397–408.