PAWAR INFOTECH
Joint Cooperative Routing and Power Allocation for
Collision Minimization in Wireless Sensor Networks With
Multiple Flows
ABSTRACT:
In this letter, a cross-layer cooperative routing algorithm is proposed for
minimizing the collision probability subject to an end-to-end outage probability
constraint. We develop a collision minimization algorithm by combining
cooperative transmission, optimal power allocation, and route selection. The
proposed cooperative routing algorithm, called minimum collision cooperative
routing (MCCR), selects the route that causes minimum collision probability to
other nodes in the network. Results show that MCCR can significantly reduce the
collision probability compared with existing cooperative routing schemes.
EXISTING SYSTEM:
Existing cooperative routing algorithms in the literature can be divided into two
categories: (1) routing algorithms which are implemented by first selecting the
optimal route based on direct transmission in each link and then using cooperative
transmission over the links of the selected route and (2) routing algorithms which
take into account the availability of the cooperative transmission on each link
during route selection. Routing schemes in the second category are more complex
but more efficient. One of the heuristic cooperative routing algorithms is called the
Cooperative Along Non-cooperative (CAN-L) shortest path algorithm with the
objective of minimizing total transmitted power. The Minimum Power Cooperative
Routing (MPCR) algorithm makes routing decisions by assuming the cooperative
S B College Road Jajee Complex Gulbarga Cell+91 9916033035
PAWAR INFOTECH
transmission is also available for each link. MPCR finds the route that minimizes
the total transmission power.
DISADVANTAGES OF EXISTING SYSTEM:
 Existing algorithms are more complex
 MPCR algorithm considered on only transmission power
PROPOSED SYSTEM:
In this project, we propose cooperative routing algorithm, called minimum
collision cooperative routing (MCCR). In this project, we aim to design a crosslayer cooperative routing scheme for minimizing the collision probability subject
to an end-to-end outage probability constraint. The cross-layer scheme is designed
by combining cooperative transmission, power allocation, and route selection when
there are multiple flows in the network.
ADVANTAGES OF PROPOSED SYSTEM:
 Reduce the transmission power
 It provides minimum collision probability
SYSTEM ARCHITECTURE:
S B College Road Jajee Complex Gulbarga Cell+91 9916033035
PAWAR INFOTECH
S B College Road Jajee Complex Gulbarga Cell+91 9916033035
PAWAR INFOTECH
BLOCK
DIAGRAM:
S B College Road Jajee Complex Gulbarga Cell+91 9916033035
PAWAR INFOTECH
Design a cross-layer
cooperative routing
scheme
Use MCCR
Algorithm
Minimize the
collision probability
Bellman-Ford
Algorithm
To find the route
has the minimum
cost function
Optimal Power
Allocation
Cooperative Along
Minimum Collision
Direct Path
Use direct
link
During route
selection
Minimum Collision
Non-Cooperative
Use Direct
Link
Both route selection and
signal transmission
SYSTEM REQUIREMENTS:
S B College Road Jajee Complex Gulbarga Cell+91 9916033035
PAWAR INFOTECH
HARDWARE REQUIREMENTS:
 System
:
Pentium IV 2.4 GHz.
 Hard Disk
:
40 GB.
 Floppy Drive
:
1.44 Mb.
 Monitor
:
15 VGA Colour.
 Mouse
:
Logitech.
 Ram
:
512 Mb.
SOFTWARE REQUIREMENTS:
 Operating system :
Windows XP/7/LINUX.
 Implementation
:
NS2
 NS2 Version
:
NS2.2.28
 Front End
:
OTCL
(Object
Oriented
Tool
Command
Language)
 Tool
:
Cygwin (To simulate in Windows OS)
REFERENCE:
Fatemeh Mansourkiaie, Student Member, IEEE, and Mohammed Hossam Ahmed,
Senior Member, IEEE, “Joint Cooperative Routing and Power Allocation for
Collision Minimization in Wireless Sensor Networks With Multiple Flows”, IEEE
S B College Road Jajee Complex Gulbarga Cell+91 9916033035
PAWAR INFOTECH
WIRELESS COMMUNICATIONS LETTERS, VOL. 4, NO. 1, FEBRUARY
2015.
S B College Road Jajee Complex Gulbarga Cell+91 9916033035