SlideShare ist ein Scribd-Unternehmen logo
1 von 6
Downloaden Sie, um offline zu lesen
ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2351
www.ijarcet.org
Abstract— Energy efficiency is the major problem in wireless
sensor networks. We introduced the Cooperative
communication protocol in wireless sensor networks (WSN) for
establishment of cooperative clusters during transmission of
data in a cooperative way. In the cooperation process of this
cooperative transmission protocol, recruitment policy helps the
nodes to co-operate each other. Cluster head on the one node
thick path recruit neighboring nodes to assist in
communication.
To verify effectiveness of our cooperative transmission protocol
various factors such as capacity, end-to-end robustness of the
protocol to data-packet loss, along with the trade-off between
energy consumption and error rate for cooperative network
protocol are analysed. The packet failure probability and bit
error minimization is derived for analysing end-to-end
robustness of the protocol to data-packet loss and for analysing
capacity, throughput rate is considered. Energy consumption
analysis is done with the help of transmission power and
number of selected nodes for cooperation. Cooperative
transmission protocol comparison with other cooperative and
non-cooperative schemes is done for performance analysis. The
implementation results are elaborated through graphs. We
have shown the performance of Cooperative transmission
protocol through end-to-end robustness of the protocol to
data-packet loss, capacity and energy consumption.
Considering all these parameters it can be shown that longer
lifetime of network can be achieved for cooperative
transmission protocol.
Index Terms— Wireless Cooperative Network, Wireless
Sensor Network (WSN), Cooperative transmission,
transmission cluster, receiving cluster.
I. INTRODUCTION
In a cooperative wireless network, all nodes can transmit
information cooperatively. Each node can be a source node
that transmits its information or it can be a relay node that
helps to forward information of other nodes. Sometimes the
cooperation strategy is based on the decode-and-forward
(DF) protocol which comprises two transmission phases. In
first phase, the source node sends the information to its next
node on the route. In second phase, the relay node decodes
the information it receives from the source and helps forward
the correctly decoded information. In cooperative
networking, individual network nodes can cooperate to
achieve network goals in a coordinated way, and the
cooperation can take place in a cross-layer fashion.
Successful cooperative networking can prompt the
cost-effective development of advanced wireless networks.
Cooperative communication with single relay selection is a
simple but effective communication scheme for energy
constrained networks [2]. Node within a cooperative
communication group with highest residual energy becomes
the cooperative-group-head and it is responsible for data
aggregation and the communication within the cooperative
group. The group head pays role of BS for neighbouring
clusters. Cooperative techniques utilize the broadcast nature
of wireless signals by observing that a source signal intended
for a particular destination can be “overheard” at
neighboring nodes. These nodes are called relays, partners
or helpers. Such relays process the signals they overhear and
transmit it towards the destination. The relay operations can
consist of repetition of the overheard signal (obtained, for
example, by decoding and then re-encoding the information
or by simply amplifying the received signal and then
forwarding) or can involve more sophisticated strategies
such as forwarding onlypart of the information, compressing
the overheard signal, and then forwarding it [6].
In this paper our Cooperative transmission protocol
showing the results of how the transmission ranges in the
network affects the energy of our protocol as compared to
other schemes and how failure probability of node in the
network vary with transmission power variation. Our
protocol increases the transmission reliability in comparison
to the other presented schemes. Also we suggested one
criterion for selection of appropriate cooperative nodes and
the cluster head.
II.THE COOPERATIVE TRANSMISSION PROTOCOL
In this cooperative communication model, every node on the
path from the source node to the destination node becomes a
cluster head, which performs the task of recruiting other
nodes in its neighborhood and coordinates their
transmissions. We called route from a source node to a sink
node as “having a width” path which is a multihop
cooperative path. Figure 1 shows, a sending cluster, a
receiving cluster and cooperation of each cluster in
transmission of packets.
Figure 1 Cooperative transmission Scenario
Figure 2 Cooperative transmission and reception scenario
….
Energy Efficient Protocol for Clustered
Cooperative Sensor Network
Ms. Pallavi H. Chitte, Mr. D.K. Chitre
ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
www.ijarcet.org
2352
In Figure 2, the model for Cooperative transmission and
reception for a single hop is depicted where every node in the
receiving cluster receives from every node in the sending
cluster. Sending nodes are synchronized, and the power level
of the received signal at a receiving node is the sum of all the
signal powers coming from all the sender nodes and the
mechanism for error detection is incorporated into the packet
format, so a node that does not receive a packet correctly will
not transmit on the next hop in the path. And thus it reduces
the likelihood of a packet being received in error. Here we
discuss two important phases our cooperative transmission
protocol: routing phase and “recruiting-and-transmitting”
phase.
A. Routing Phase
This phase find a “one-node-thick” route from the source
node to the sink node which undergoes a thickening process
in the “recruiting-and-transmitting” phase. Information
about the energy required for transmission to neighboring
nodes is computed. This information later used for cluster
establishment in the “recruiting-and-transmitting” phase for
selecting nodes with lowest energy cost.
B. Recruiting and retransmitting phase
In this phase, the nodes on the initial path become cluster
heads, which recruit additional adjacent nodes from their
neighborhood. The inter-clusters distance(s) (β) is
significantly larger than the distance between nodes in the
same cluster because the cluster heads recruit nodes from
their immediate neighborhood. Recruiting is done
dynamically and per packet as the packet traverses the path.
The cluster head initiates the recruiting by the next node on
the “one-node-thick” path. Once this recruiting is completed
and the receiving cluster is established, the packet is
transmitted from the sending cluster to the newly established
receiving cluster. Recruiting and transmitting is done
dynamically per hop, starting from the source node and
progressing, hop by hop, as the packet moves along the path
to the sink node. The receiving cluster of the previous hop
along the path becomes the sending cluster, when data packet
is received by it and the new receiving cluster will start
forming. The next node on the “one-node-thick” path
becomes the cluster head of the receiving cluster. The
receiving cluster is formed by the cluster head recruiting
neighbor nodes through exchange of short control packets
such as RR, REC, GR, CL, CF. Then, the sending cluster
head synchronizes its nodes, at which time the nodes
transmit the data packet to the nodes of the receiving cluster.
Medium access control is done in the
“recruiting-and-transmitting” phase through exchanges of
short control packets between the nodes on the
“one-node-thick” path and their neighbor nodes [1].
Operation of the “recruiting-and-transmitting” phase is
demonstrated in the Figure 3(a) to Figure 3(f).
Another criterion of selection of Cluster Head can be done
based on the appropriate position and energy computing of
node where Source broadcasts control packets and nodes
within the communication range of source node and located
at appropriate position correspond to source node. These
nodes will contend for cluster head according to their own
energy. The one with highest energy capacity gains the
complete scenario and will act as the direct agent of source
node. Then
The head broadcasts control packets to decide on cluster head
of next hop. Repeating above process till a complete route
containing cluster head is established and then cluster head
performs the clustering. It implements the recruitment of
cluster members according to the position and energy of
neighboring nodes [4].
D. Control packets
The control packets that are used in the two phases of
Cooperative transmission protocol are given below:
a. Request-to-recruit (RR packet)
The format of RR packet includes: the id of the sender node
(node 2 in our example), the id of the receiver node (node 5
in), the sink node id, and the NAV field that contains the
estimated transmission time of the data packet. The NAV
field serves to indicate when the channel will become
available again for other transmissions.
b. REC packet
The REC packet contains the sender node id, the receiver
node id, the id of the next node on the path (node 8 in our
example), and the maximum time-to-respond.
c. GR packet
The GR packet sent from node contains the id of the
originator of the REC packet and the sum of the link costs of
the receiving link and the sending link. A node can be
involved in a single recruiting process at any time, i.e., a
node can have only one outstanding GR packet. A node
chosen to cooperate cannot be involved in another recruiting
process until the transmission of the current data packet is
fully completed, i.e., received and sent to the next cluster by
the cooperating node.
d. CL packet
ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2353
www.ijarcet.org
A CL packet contains the id of the cooperating nodes and an
updated value of NAV. Nodes that see their ids in the CL
packet form the receiving cluster for this hop and the sending
cluster for next hop. Other neighbor nodes that sent GR
packets but do not see their ids in the CL packet will not
participate in the cluster. To avoid interference: (1) if any
node that receives an REC packet, whether it is cooperating
or not, it has to wait for the transmission of the data packet to
be fully completed before it can get involved in another
recruiting process, also (2) if any node that overhears any of
the control packets sent by any other node will not get
involved in any recruiting or any transmission operation
until the transmission of the data packet is fully completed. If
a data packet was not received at the receiving cluster head
node, or was received in error, the packet is considered to be
lost and the whole “recruit-and-transmit” phase will restart
again. A timer is associated with every exchange of control
packets so that if a crucial control packet is lost, the
“recruit-and-transmit” phase will restart again.
e. CF packet
The CF packet contains the waiting-time-to-send and the
transmission power level. The transmission power level is
the total transmission power (a protocol-selectable
parameter) divided bythe number of the nodes in the sending
cluster.
II. RELATED WORK
For performance evaluation of Cooperative transmission
protocol, its performance comparison is done with the other
three schemes such as Cooperation Along Non-cooperative
path (CAN) protocol and the other two non-cooperative
schemes that are “disjoint-paths” scheme and “one-path”
scheme.
1. CAN Protocol
Figure 4(a) CAN protocol.
Figure 4(b) CAN reception model.
In CAN protocol, sender node transmit data packets to all
the nodes along the path instead of sending once per hop.
Here a“non-cooperative path” between the source and the
sink nodes is found first and then the last m predecessor
nodes along the non-cooperative path cooperate to transmit
to the next node on the path.
2. Disjoint-paths scheme
In the disjoint-paths scheme, nodes form a number of
disjoint paths from source to sink. The same information is
routed individually along the different paths with no
coordination between the nodes on the different paths.
3. One -path scheme
In the one-path scheme, first the one-node-thick path is
discovered and established. Then, each node on the path
transmits with power equal to the sum of transmission
powers of all the cooperating nodes in a cluster. The
analytical and simulation results of our cooperative
transmission protocol are compared throughout the paper to
the results of the CAN protocol, the disjoint-path and One -
path schemes.
III. METHODOLOGY
A. Cooperative Transmission Protocol
Let the nodes in the cluster be indexed from 0 to m-1. We
denote the transmission pattern of nodes in a sending cluster
by a binary representation bm-1……….b 1b 0 according to
which node transmits if b j=1 and does not transmit if b j=0. A
node does not transmit when it receives a packet in error from
the previous hop. We denote the reception pattern of nodes in
a receiving cluster by a binary representation bm-1.........b1b0
according to which node j correctly receives the packet if b
j=1 and receives the packet in error if b j=0. For example, for
m=4, the binary representation of 1010 of the sending cluster
and the binary representation of 0101 of the receiving cluster
means that nodes 1 and 3 in the sending cluster transmit the
packet, while in the receiving cluster nodes 0 and 2 correctly
receive the packet and nodes 1 and 3 incorrectly receive the
packet. Let gI
J
be the probability that node with binary
representation I= um-1……….u1u 0 transmit a packet of
length L bits to nodes with binary representation J=
bm-1……….b1b0 across a single hop, and let SNR j be the SNR
of the received signal at node j, then












])1())1(1)(1[(
,
1
0
L
j
L
j
J
I
m
i
ij
BERbBERbg
uSNRfBER
B. Calculation of failure probability
i. Cooperative transmission protocol
Let vector v(i) be the binary representation of integer i. We
define: g v(0)
v(0)
=1; gv(0)
J
= 0,J≠ v(0). Let A JK be the probability
that a packet reaches the kth
hop to nodes with binary
representation J, given that at least one copy reaches k-1 hop,
then
Where,
)2(,1
,00
1)(
12
1
)(
2/[
{
m
m
vJfor
otherwiseJ
kIv
I
J
IvJK
A
AgA






(1)
Now, let
h
CwRB be the probability of failure of a packet to
reach any node by the k th
hop.


h
k
kv
h
CwR AB
1
)0(
(2)
In this way failure probability, that the packet does not reach
the sink due to reception error(s) along the path, is
calculated.
ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
www.ijarcet.org
2354
ii. CAN protocol
Let Xi=0 represent the event that a packet is not received at
the hth
hop along the non-cooperative path, while Xi=0 is the
complementary event. Let Bh
CAN be the probability of failure
of a packet of length L bits to reach the node at the hth
hop
).......().......0()0( 101
1
1101
h
CANB 

   nnhhr
m
I
nhhhrhr uXuXPuXuXXPXP
Where n=min (m, h). The first term in (7), the probability
that a packet is not received at the hth
hop given that the last
n nodes transmit with binary representation I=un-1 …u1, u0.
iii. One–path scheme
The analysis in this case is similar to the disjoint-paths case,
but with one path only and each node transmitting with
power of, where )(
1
jP
m
j
t
is the transmission power of the
jth node. Let Pt (j) is the probability of failure of a packet to
reach the hth
node of the one-path scheme, then
]))1)],/().([((1[1B
h
noC
Lh
nt dPPmf 
 
C. Calculation of the Cost of Links
As mentioned in the Recruiting and retransmitting phase
potential cluster member should compute the link costs. This
cost is the sum of receiving link and sending link of a node.
Receiving link from cluster head of front hop (or source) and
node itself, and sending link concerns cluster head of next
hop (or destination) and node itself. The link cost between
node i to node j : C i,j calculated by node i as:
avg
i
ji
ji
R
R
e
C

)( ,
, 
(3a)
Where, e i, j is energy cost of the link, R is residual battery
energy of node I; R AVG is average residual battery energy of
the neighbors of node. Energy cost of a link is the
transmission power required for reception at a particular bit
error rate. Nodes determine the energy costs of links by
listening (or overhearing) transmissions during the routing
phase. The protocol-selectable parameter controls the weight
of each factor in the total cost. From equation (3) of link cost,
nodes with small residual battery capacity are less likely to be
recruited in this phase [1].
Another method to calculate the link cost to achieve energy
efficiency is:
Rneighbor
R
e
C
i
ji
ji
)( ,
, 
(3b)
Where e i, j is the energy cost of the link that required for
reception at a certain bit error rate. Node can obtain it
through overhearing during the routing period. Ri is the
remaining energyof node i. Rneighbor is the average remaining
energyof the neighbors of node i. Cluster head selects among
potential cluster members. Those with large remaining
energy capacity are more likely to be recruited [4].
D. Error calculation in Cooperative transmission
Here, the Cooperative transmission model is similar to
MISO case and protocol selectable parameter m is the
number of cooperating nodes in the network. Considering, a
known SNR at the receiver, the probability of an error at the
receiver is given by
P (error) = f (SNR, m) = (1+ (SNR/2))-m
(4)
We assumed that the power attenuation due to distance is
carried out by d-γ i,j. Where, d i,j: the distance between node to
node, γ is the attenuation exponent. In particular, let Pn be the
noise power at the receiver and Pt is the transmitter
transmission power measured at nominal distance equal to 1.
When a packet is transmitted from node to node, the SNR
measured at the receiver j is computed as,
SNR= [(Pt/d i,j) /Pn ] (5)
In other words, to achieve a certain value of SNR, the
transmitter needs to transmit with the power of,
Pt = [SNR. Dγi,j *Pn]
(6)
The bit error probability is then terminated by (4). We also
assume that for a packet to be successfully received, all the
bits in the packet must be successfully received.
E. Energy consumption
We compare the energy consumption of our cooperative
transmission protocol to the CAN protocol and the one-path
scheme. For making meaningful comparison of energy
consumption of any two schemes, we kept failure probability
equal for the compared schemes. In our Cooperative
protocol, one-hop energy consumption of the transmissions
of the control and data packets between two cooperative
clusters of nodes, with m cooperating nodes in each, is
analyzed. For energy consumption of this cooperative
scheme, we assume some failure probability as Pf and the
probabilityof bit error is a function of the SNR of the received
signal. For every value of the failure probability Pf, we
calculate the needed transmission power of a single node Pt
from (2) to (5). We assume that the power consumption for
the cooperative protocol is m2.
Pt as we need m transmissions
per hop, with each transmission being of the type m-to-1. For
CAN protocol, we assume, the power consumption is m.Pt
and for the one-path scheme we assume, the power
consumption is Pt.
IV. RESULTS AND ANALYSIS
A. Simulation Results
We use simulation to evaluate the performance of our
protocol. Network simulator ns2 is used for simulating the
results and multi-hop scenario. Considering the
x-dimension of topography as 500 and y-dimension of
topography as 500, simulation time of 200 sec, total number
of nodes in the network=100 and initial energy= 100J. Nodes
are placed randomlyand the numbers of cooperative nodes m
is 7.The source and sink node are picked randomly. The
metrics that we use for evaluation are: transmission power
and energy consumption. Our protocol curves are shown as
“CwR”, the CAN protocol curves are shown by “CAN”,
disjoint paths schemes curves are shown as “noc” and
One-path schemes curves as “One”. These curves are plotted
in graph with different colours. We analyse different values
of packet failure probability (Pf ) for different values of
transmission power. Figure 5 depicts Failure probability vs.
ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2355
www.ijarcet.org
transmission power.Considering different power levels; our
cooperative transmission protocol has lowest failure
probability than the compared schemes.
Figure 5: Failure Probability vs. Power.
Figure 6 shows effect of transmission range on Energy and
Figure 7 shows transmission range vs. throughput.
Considering different power transmission level that
corresponds to different transmission ranges between 50m
and 250 m, with fixed packet loss probability = 0.2. Figure 6
shows as the transmission range increases, the noise power
increases, the contention increases which increase the
retransmission of control and data packets, and all in turn,
increases the total energy consumption. Only disjoint-paths
scheme has larger energy consumption than our protocol.
Figure 6: Transmission range vs. Energy
Figure 7: Transmission range vs. throughput
From figure 7, it can be analysed that as the transmission
range increases the average number of hops in a path from
source to sink decreases. When the h decreases, the
difference in the failure probability between our protocol and
the disjoint-paths scheme also decreases. This leads to a
smaller difference in the capacity between the two schemes.
When the network becomes a 1- or 2-hop network, there is no
difference in the capacity between the two schemes. The
capacity of the CAN protocol degrades with an increase in
the transmission range. Thus higher energy is achieved in
our Cooperative transmission protocol than disjoint paths
scheme and One–path scheme and CAN protocol.
V. CONCLUSION
By analysing different parameters such as failure
probability, transmission power, transmission range and
energy consumption for cooperative transmission protocol
and other cooperative and non-cooperative schemes, it can be
shown that the total energy consumption can be considerably
reduced by using cooperative factors of the our Cooperative
transmission protocol than the compared schemes. With
consideration of achieved results of end-to-end robustness of the
protocol to data-packet loss, capacity and energy consumption we
can saythat longer lifetime of Sensor network will be achieved
for cooperative transmission protocol.
ACKNOWLEDGMENT
I would like to express my sincere gratitude towards my
guide and co-author of this paper, Prof. D. K. Chitre, for the
whole work of this paper. This work would have not been
possible without his valuable attention and motivation.
REFERENCES
[1] Mohamed Elhawry and Zygmunt J. Haas, "Energy-Efficient
Protocol for Cooperative Networks”, IEEE/ACM
Transactions on Networking, VOL. 19, NO. 2, April 2011.
[2] Zhong Zhou, Shengli Zhou,, Jun-Hong Cui, and Shuguang
Cui, “ Energy-Efficient Cooperative Communication Based
on Power Control and Selective Single-Relay in Wireless
Sensor Networks”, IEEE Transactions on Wireless
communications, VOL. 7, NO. 8, August 2008.
[3] Ahmed Ibrahim Hassan, “Energy-efficient reliable packet
delivery in variable-power wireless sensor networks”,
Ericsson Egypt Ltd., Ain Shams Engineering Journal, 23
September 2011.
[4] Ling Tan, Shunyi Zhang, Jin Qi, “An Intelligent Cooperative
Protocol in Clustered Wireless ,Sensor Networks for
Energy-efficiency”, Journal of Computational Information
Systems , February (2012).
[5] Irfan Ahmed and Mugen Peng,” Exploiting Geometric
Advantages of Cooperative Communications for Energy
Efficient Wireless Sensor Networks”, I. J. Communications,
Network and System Sciences, 1: 1-103, February 2008.
[6] Sudharman K. Jayaweera, Member, IEEE, “Virtual
MIMO-based Cooperative Communication for
Energy-constrained Wireless Sensor Networks”, IEEE IEEE
Transactions on Wireless communications, VOL. 5, NO. 5,
May 2006.
[7] Aria Nosratinia, Todd E. Hunter, Ahmadreza Hedayat,
“Cooperative Communications in Wireless Networks”,
0163-6804/04/$20.00 © 2004 IEEE.
[8] Gupta Sunita, "Power Efficiency of Cooperative
Communication in Wireless Sensor Networks", Paper 112,
978-1-4244-4474-8/09/$25.00 ©2009 IEEE.
[9] Akyildiz, Ian F., Mehmet C. Vuran, and Ozgur B. Akan, “A
Cross-Layer Protocol for Wireless Sensor Networks,” 40th
Annual Conference on Information Sciences and Systems, pp.
1102-1107, 22-24 March 2006.
[10] Cui Shuguang and Andrea J. Goldsmith “Cross-layer design
of energy-constrained networks using cooperative MIMO
technique” Eurasip’s Signal Processing Journel, August,
2006.
[11] Khandani, Amir Ehsan, Jinane Abounadi, Eytan Modiano,
and Lizhong Zheng, “Cooperative Routing in Static Wireless
Networks,” IEEE Transactions on Communications, Vol. 55,
No. 11, pp. 2185-2192, November 2007.
[12] P. Herhold, E. Zimmermann, and G. Fettweis, “Cooperative
multi-hop transmission in wireless networks,” Comput. Netw.
vol. 49, no. 3, pp. 299–324, October 2005.
ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
www.ijarcet.org
2356
Ms. Pallavi H. Chitte, Postgraduate student, Terna college of
Engineering, nerul, Navi Mumbai, has been doing the research work in wireless
cooperative network.
. Mr.D.K.Chitre has been working as Associate Professor and Head
of Department in Computer Engineering Department, terna college of
Engineering, nerul, Navi Mumbai, has done research work in networking area.

Weitere ähnliche Inhalte

Was ist angesagt?

Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless Network
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkQuadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless Network
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
 
O dsr optimized dsr routing
O dsr optimized dsr routingO dsr optimized dsr routing
O dsr optimized dsr routingijwmn
 
Optimized Fuzzy Routing for MANET
Optimized Fuzzy Routing for MANETOptimized Fuzzy Routing for MANET
Optimized Fuzzy Routing for MANETiosrjce
 
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2RDETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
 
Caching strategies for on demand routing protocols for wireless ad hoc network
Caching strategies for on demand routing protocols for wireless ad hoc networkCaching strategies for on demand routing protocols for wireless ad hoc network
Caching strategies for on demand routing protocols for wireless ad hoc networkAcel-Omeran
 
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
 
A Review on Geographical Location Based Energy Efficient Direction Restricted...
A Review on Geographical Location Based Energy Efficient Direction Restricted...A Review on Geographical Location Based Energy Efficient Direction Restricted...
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
 
FUZZY-CONTROLLED POWER-AWARE PROACTIVE-ACKNOWLEDGEMENT BASED BROADCASTING (FP...
FUZZY-CONTROLLED POWER-AWARE PROACTIVE-ACKNOWLEDGEMENT BASED BROADCASTING (FP...FUZZY-CONTROLLED POWER-AWARE PROACTIVE-ACKNOWLEDGEMENT BASED BROADCASTING (FP...
FUZZY-CONTROLLED POWER-AWARE PROACTIVE-ACKNOWLEDGEMENT BASED BROADCASTING (FP...cscpconf
 
Hop by-hoproutinginwirelessmeshnetworkswithbandwidthguarantees-140918031049-p...
Hop by-hoproutinginwirelessmeshnetworkswithbandwidthguarantees-140918031049-p...Hop by-hoproutinginwirelessmeshnetworkswithbandwidthguarantees-140918031049-p...
Hop by-hoproutinginwirelessmeshnetworkswithbandwidthguarantees-140918031049-p...Shakas Technologies
 
iaetsd Survey on cooperative relay based data transmission
iaetsd Survey on cooperative relay based data transmissioniaetsd Survey on cooperative relay based data transmission
iaetsd Survey on cooperative relay based data transmissionIaetsd Iaetsd
 
Improving data transmission in the vanet using multi criteria decision making...
Improving data transmission in the vanet using multi criteria decision making...Improving data transmission in the vanet using multi criteria decision making...
Improving data transmission in the vanet using multi criteria decision making...ijfcstjournal
 
Achieving Optimum Value of k in a K-fold Multicast Network with Buffer using ...
Achieving Optimum Value of k in a K-fold Multicast Network with Buffer using ...Achieving Optimum Value of k in a K-fold Multicast Network with Buffer using ...
Achieving Optimum Value of k in a K-fold Multicast Network with Buffer using ...cscpconf
 
Authentication of Secure Data Transmission In Wireless Routing
Authentication of Secure Data Transmission In Wireless RoutingAuthentication of Secure Data Transmission In Wireless Routing
Authentication of Secure Data Transmission In Wireless RoutingIJERA Editor
 
Fuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc Networks
Fuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc NetworksFuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc Networks
Fuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc NetworksA. Sufian
 

Was ist angesagt? (17)

Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless Network
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkQuadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless Network
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless Network
 
O dsr optimized dsr routing
O dsr optimized dsr routingO dsr optimized dsr routing
O dsr optimized dsr routing
 
Optimized Fuzzy Routing for MANET
Optimized Fuzzy Routing for MANETOptimized Fuzzy Routing for MANET
Optimized Fuzzy Routing for MANET
 
D04622933
D04622933D04622933
D04622933
 
Ijcnc050215
Ijcnc050215Ijcnc050215
Ijcnc050215
 
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2RDETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
 
Caching strategies for on demand routing protocols for wireless ad hoc network
Caching strategies for on demand routing protocols for wireless ad hoc networkCaching strategies for on demand routing protocols for wireless ad hoc network
Caching strategies for on demand routing protocols for wireless ad hoc network
 
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
 
A Review on Geographical Location Based Energy Efficient Direction Restricted...
A Review on Geographical Location Based Energy Efficient Direction Restricted...A Review on Geographical Location Based Energy Efficient Direction Restricted...
A Review on Geographical Location Based Energy Efficient Direction Restricted...
 
FUZZY-CONTROLLED POWER-AWARE PROACTIVE-ACKNOWLEDGEMENT BASED BROADCASTING (FP...
FUZZY-CONTROLLED POWER-AWARE PROACTIVE-ACKNOWLEDGEMENT BASED BROADCASTING (FP...FUZZY-CONTROLLED POWER-AWARE PROACTIVE-ACKNOWLEDGEMENT BASED BROADCASTING (FP...
FUZZY-CONTROLLED POWER-AWARE PROACTIVE-ACKNOWLEDGEMENT BASED BROADCASTING (FP...
 
Hop by-hoproutinginwirelessmeshnetworkswithbandwidthguarantees-140918031049-p...
Hop by-hoproutinginwirelessmeshnetworkswithbandwidthguarantees-140918031049-p...Hop by-hoproutinginwirelessmeshnetworkswithbandwidthguarantees-140918031049-p...
Hop by-hoproutinginwirelessmeshnetworkswithbandwidthguarantees-140918031049-p...
 
iaetsd Survey on cooperative relay based data transmission
iaetsd Survey on cooperative relay based data transmissioniaetsd Survey on cooperative relay based data transmission
iaetsd Survey on cooperative relay based data transmission
 
Improving data transmission in the vanet using multi criteria decision making...
Improving data transmission in the vanet using multi criteria decision making...Improving data transmission in the vanet using multi criteria decision making...
Improving data transmission in the vanet using multi criteria decision making...
 
Achieving Optimum Value of k in a K-fold Multicast Network with Buffer using ...
Achieving Optimum Value of k in a K-fold Multicast Network with Buffer using ...Achieving Optimum Value of k in a K-fold Multicast Network with Buffer using ...
Achieving Optimum Value of k in a K-fold Multicast Network with Buffer using ...
 
Authentication of Secure Data Transmission In Wireless Routing
Authentication of Secure Data Transmission In Wireless RoutingAuthentication of Secure Data Transmission In Wireless Routing
Authentication of Secure Data Transmission In Wireless Routing
 
Fuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc Networks
Fuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc NetworksFuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc Networks
Fuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc Networks
 
[IJCT-V3I2P22] Authors: Shraddha Dabhade, Shilpa Verma
[IJCT-V3I2P22] Authors: Shraddha Dabhade, Shilpa Verma[IJCT-V3I2P22] Authors: Shraddha Dabhade, Shilpa Verma
[IJCT-V3I2P22] Authors: Shraddha Dabhade, Shilpa Verma
 

Andere mochten auch

International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)IJERD Editor
 
Banco de méxico.fco villaseñor
Banco de méxico.fco villaseñorBanco de méxico.fco villaseñor
Banco de méxico.fco villaseñorPakirrii VLuna
 
Evrak takibi ve dosyalanması
Evrak takibi ve dosyalanmasıEvrak takibi ve dosyalanması
Evrak takibi ve dosyalanmasıMerve
 
Como incluir videos y presentaciones en un blog
Como incluir videos y presentaciones en un blogComo incluir videos y presentaciones en un blog
Como incluir videos y presentaciones en un blogzhid123456
 
Fiscalidad en internet
Fiscalidad en internetFiscalidad en internet
Fiscalidad en internetJane Valeriano
 
Gestione su clima laboral a travs del compromiso de su gente
Gestione su clima laboral a travs del compromiso de su genteGestione su clima laboral a travs del compromiso de su gente
Gestione su clima laboral a travs del compromiso de su genteGustavo Rolando Pinto
 
Team sparxbbd copy
Team sparxbbd   copyTeam sparxbbd   copy
Team sparxbbd copyMUKUL ANAND
 

Andere mochten auch (12)

International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)
 
LearningTreePhotoshop
LearningTreePhotoshopLearningTreePhotoshop
LearningTreePhotoshop
 
Banco de méxico.fco villaseñor
Banco de méxico.fco villaseñorBanco de méxico.fco villaseñor
Banco de méxico.fco villaseñor
 
1684 1688
1684 16881684 1688
1684 1688
 
Evrak takibi ve dosyalanması
Evrak takibi ve dosyalanmasıEvrak takibi ve dosyalanması
Evrak takibi ve dosyalanması
 
Procedimiento de autoarchivo en SEDICI
Procedimiento de autoarchivo en SEDICIProcedimiento de autoarchivo en SEDICI
Procedimiento de autoarchivo en SEDICI
 
Help een redder
Help een redderHelp een redder
Help een redder
 
Historia del computador
Historia del computadorHistoria del computador
Historia del computador
 
Como incluir videos y presentaciones en un blog
Como incluir videos y presentaciones en un blogComo incluir videos y presentaciones en un blog
Como incluir videos y presentaciones en un blog
 
Fiscalidad en internet
Fiscalidad en internetFiscalidad en internet
Fiscalidad en internet
 
Gestione su clima laboral a travs del compromiso de su gente
Gestione su clima laboral a travs del compromiso de su genteGestione su clima laboral a travs del compromiso de su gente
Gestione su clima laboral a travs del compromiso de su gente
 
Team sparxbbd copy
Team sparxbbd   copyTeam sparxbbd   copy
Team sparxbbd copy
 

Ähnlich wie Ijarcet vol-2-issue-7-2351-2356

Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
 
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
 
IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...
IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...
IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...IJNSA Journal
 
Data-Centric Routing Protocols in Wireless Sensor Network: A survey
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyData-Centric Routing Protocols in Wireless Sensor Network: A survey
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
 
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...IJNSA Journal
 
V.KARTHIKEYAN PUBLISHED ARTICLE AA
V.KARTHIKEYAN PUBLISHED ARTICLE AAV.KARTHIKEYAN PUBLISHED ARTICLE AA
V.KARTHIKEYAN PUBLISHED ARTICLE AAKARTHIKEYAN V
 
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
 
The Impact of Signal Strength over Routing Protocols in Wireless Networks
The Impact of Signal Strength over Routing Protocols in Wireless NetworksThe Impact of Signal Strength over Routing Protocols in Wireless Networks
The Impact of Signal Strength over Routing Protocols in Wireless NetworksDr. Amarjeet Singh
 
Energy efficient neighbour selection for flat wireless sensor networks
Energy efficient neighbour selection for flat wireless sensor networksEnergy efficient neighbour selection for flat wireless sensor networks
Energy efficient neighbour selection for flat wireless sensor networkscsandit
 
A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Ove...
A Neighbor Coverage-Based Probabilistic Rebroadcast for  Reducing Routing Ove...A Neighbor Coverage-Based Probabilistic Rebroadcast for  Reducing Routing Ove...
A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Ove...IJMER
 
Analysis of Selfish behavior in energy consumption model based Multihop cellu...
Analysis of Selfish behavior in energy consumption model based Multihop cellu...Analysis of Selfish behavior in energy consumption model based Multihop cellu...
Analysis of Selfish behavior in energy consumption model based Multihop cellu...ijsrd.com
 
Fuzzy Optimized Metric for Adaptive Network Routing
Fuzzy Optimized Metric for Adaptive Network RoutingFuzzy Optimized Metric for Adaptive Network Routing
Fuzzy Optimized Metric for Adaptive Network RoutingCSCJournals
 
Analysis of Cluster Based Anycast Routing Protocol for Wireless Sensor Network
Analysis of Cluster Based Anycast Routing Protocol for Wireless Sensor NetworkAnalysis of Cluster Based Anycast Routing Protocol for Wireless Sensor Network
Analysis of Cluster Based Anycast Routing Protocol for Wireless Sensor NetworkIJMER
 
Clustering based Time Slot Assignment Protocol for Improving Performance in U...
Clustering based Time Slot Assignment Protocol for Improving Performance in U...Clustering based Time Slot Assignment Protocol for Improving Performance in U...
Clustering based Time Slot Assignment Protocol for Improving Performance in U...IJRTEMJOURNAL
 
Enhancement of Routing Performance for Energy Efficiency and Critical Event M...
Enhancement of Routing Performance for Energy Efficiency and Critical Event M...Enhancement of Routing Performance for Energy Efficiency and Critical Event M...
Enhancement of Routing Performance for Energy Efficiency and Critical Event M...iosrjce
 
International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)IJERD Editor
 

Ähnlich wie Ijarcet vol-2-issue-7-2351-2356 (20)

Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...
 
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...
 
IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...
IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...
IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...
 
Data-Centric Routing Protocols in Wireless Sensor Network: A survey
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyData-Centric Routing Protocols in Wireless Sensor Network: A survey
Data-Centric Routing Protocols in Wireless Sensor Network: A survey
 
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...
 
V.KARTHIKEYAN PUBLISHED ARTICLE AA
V.KARTHIKEYAN PUBLISHED ARTICLE AAV.KARTHIKEYAN PUBLISHED ARTICLE AA
V.KARTHIKEYAN PUBLISHED ARTICLE AA
 
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...
 
The Impact of Signal Strength over Routing Protocols in Wireless Networks
The Impact of Signal Strength over Routing Protocols in Wireless NetworksThe Impact of Signal Strength over Routing Protocols in Wireless Networks
The Impact of Signal Strength over Routing Protocols in Wireless Networks
 
Aa35152156
Aa35152156Aa35152156
Aa35152156
 
Aa35152156
Aa35152156Aa35152156
Aa35152156
 
Gk2411581160
Gk2411581160Gk2411581160
Gk2411581160
 
Energy efficient neighbour selection for flat wireless sensor networks
Energy efficient neighbour selection for flat wireless sensor networksEnergy efficient neighbour selection for flat wireless sensor networks
Energy efficient neighbour selection for flat wireless sensor networks
 
A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Ove...
A Neighbor Coverage-Based Probabilistic Rebroadcast for  Reducing Routing Ove...A Neighbor Coverage-Based Probabilistic Rebroadcast for  Reducing Routing Ove...
A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Ove...
 
Analysis of Selfish behavior in energy consumption model based Multihop cellu...
Analysis of Selfish behavior in energy consumption model based Multihop cellu...Analysis of Selfish behavior in energy consumption model based Multihop cellu...
Analysis of Selfish behavior in energy consumption model based Multihop cellu...
 
Fuzzy Optimized Metric for Adaptive Network Routing
Fuzzy Optimized Metric for Adaptive Network RoutingFuzzy Optimized Metric for Adaptive Network Routing
Fuzzy Optimized Metric for Adaptive Network Routing
 
Analysis of Cluster Based Anycast Routing Protocol for Wireless Sensor Network
Analysis of Cluster Based Anycast Routing Protocol for Wireless Sensor NetworkAnalysis of Cluster Based Anycast Routing Protocol for Wireless Sensor Network
Analysis of Cluster Based Anycast Routing Protocol for Wireless Sensor Network
 
Clustering based Time Slot Assignment Protocol for Improving Performance in U...
Clustering based Time Slot Assignment Protocol for Improving Performance in U...Clustering based Time Slot Assignment Protocol for Improving Performance in U...
Clustering based Time Slot Assignment Protocol for Improving Performance in U...
 
Enhancement of Routing Performance for Energy Efficiency and Critical Event M...
Enhancement of Routing Performance for Energy Efficiency and Critical Event M...Enhancement of Routing Performance for Energy Efficiency and Critical Event M...
Enhancement of Routing Performance for Energy Efficiency and Critical Event M...
 
M017358794
M017358794M017358794
M017358794
 
International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)
 

Mehr von Editor IJARCET

Electrically small antennas: The art of miniaturization
Electrically small antennas: The art of miniaturizationElectrically small antennas: The art of miniaturization
Electrically small antennas: The art of miniaturizationEditor IJARCET
 
Volume 2-issue-6-2205-2207
Volume 2-issue-6-2205-2207Volume 2-issue-6-2205-2207
Volume 2-issue-6-2205-2207Editor IJARCET
 
Volume 2-issue-6-2195-2199
Volume 2-issue-6-2195-2199Volume 2-issue-6-2195-2199
Volume 2-issue-6-2195-2199Editor IJARCET
 
Volume 2-issue-6-2200-2204
Volume 2-issue-6-2200-2204Volume 2-issue-6-2200-2204
Volume 2-issue-6-2200-2204Editor IJARCET
 
Volume 2-issue-6-2190-2194
Volume 2-issue-6-2190-2194Volume 2-issue-6-2190-2194
Volume 2-issue-6-2190-2194Editor IJARCET
 
Volume 2-issue-6-2186-2189
Volume 2-issue-6-2186-2189Volume 2-issue-6-2186-2189
Volume 2-issue-6-2186-2189Editor IJARCET
 
Volume 2-issue-6-2177-2185
Volume 2-issue-6-2177-2185Volume 2-issue-6-2177-2185
Volume 2-issue-6-2177-2185Editor IJARCET
 
Volume 2-issue-6-2173-2176
Volume 2-issue-6-2173-2176Volume 2-issue-6-2173-2176
Volume 2-issue-6-2173-2176Editor IJARCET
 
Volume 2-issue-6-2165-2172
Volume 2-issue-6-2165-2172Volume 2-issue-6-2165-2172
Volume 2-issue-6-2165-2172Editor IJARCET
 
Volume 2-issue-6-2159-2164
Volume 2-issue-6-2159-2164Volume 2-issue-6-2159-2164
Volume 2-issue-6-2159-2164Editor IJARCET
 
Volume 2-issue-6-2155-2158
Volume 2-issue-6-2155-2158Volume 2-issue-6-2155-2158
Volume 2-issue-6-2155-2158Editor IJARCET
 
Volume 2-issue-6-2148-2154
Volume 2-issue-6-2148-2154Volume 2-issue-6-2148-2154
Volume 2-issue-6-2148-2154Editor IJARCET
 
Volume 2-issue-6-2143-2147
Volume 2-issue-6-2143-2147Volume 2-issue-6-2143-2147
Volume 2-issue-6-2143-2147Editor IJARCET
 
Volume 2-issue-6-2119-2124
Volume 2-issue-6-2119-2124Volume 2-issue-6-2119-2124
Volume 2-issue-6-2119-2124Editor IJARCET
 
Volume 2-issue-6-2139-2142
Volume 2-issue-6-2139-2142Volume 2-issue-6-2139-2142
Volume 2-issue-6-2139-2142Editor IJARCET
 
Volume 2-issue-6-2130-2138
Volume 2-issue-6-2130-2138Volume 2-issue-6-2130-2138
Volume 2-issue-6-2130-2138Editor IJARCET
 
Volume 2-issue-6-2125-2129
Volume 2-issue-6-2125-2129Volume 2-issue-6-2125-2129
Volume 2-issue-6-2125-2129Editor IJARCET
 
Volume 2-issue-6-2114-2118
Volume 2-issue-6-2114-2118Volume 2-issue-6-2114-2118
Volume 2-issue-6-2114-2118Editor IJARCET
 
Volume 2-issue-6-2108-2113
Volume 2-issue-6-2108-2113Volume 2-issue-6-2108-2113
Volume 2-issue-6-2108-2113Editor IJARCET
 
Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Editor IJARCET
 

Mehr von Editor IJARCET (20)

Electrically small antennas: The art of miniaturization
Electrically small antennas: The art of miniaturizationElectrically small antennas: The art of miniaturization
Electrically small antennas: The art of miniaturization
 
Volume 2-issue-6-2205-2207
Volume 2-issue-6-2205-2207Volume 2-issue-6-2205-2207
Volume 2-issue-6-2205-2207
 
Volume 2-issue-6-2195-2199
Volume 2-issue-6-2195-2199Volume 2-issue-6-2195-2199
Volume 2-issue-6-2195-2199
 
Volume 2-issue-6-2200-2204
Volume 2-issue-6-2200-2204Volume 2-issue-6-2200-2204
Volume 2-issue-6-2200-2204
 
Volume 2-issue-6-2190-2194
Volume 2-issue-6-2190-2194Volume 2-issue-6-2190-2194
Volume 2-issue-6-2190-2194
 
Volume 2-issue-6-2186-2189
Volume 2-issue-6-2186-2189Volume 2-issue-6-2186-2189
Volume 2-issue-6-2186-2189
 
Volume 2-issue-6-2177-2185
Volume 2-issue-6-2177-2185Volume 2-issue-6-2177-2185
Volume 2-issue-6-2177-2185
 
Volume 2-issue-6-2173-2176
Volume 2-issue-6-2173-2176Volume 2-issue-6-2173-2176
Volume 2-issue-6-2173-2176
 
Volume 2-issue-6-2165-2172
Volume 2-issue-6-2165-2172Volume 2-issue-6-2165-2172
Volume 2-issue-6-2165-2172
 
Volume 2-issue-6-2159-2164
Volume 2-issue-6-2159-2164Volume 2-issue-6-2159-2164
Volume 2-issue-6-2159-2164
 
Volume 2-issue-6-2155-2158
Volume 2-issue-6-2155-2158Volume 2-issue-6-2155-2158
Volume 2-issue-6-2155-2158
 
Volume 2-issue-6-2148-2154
Volume 2-issue-6-2148-2154Volume 2-issue-6-2148-2154
Volume 2-issue-6-2148-2154
 
Volume 2-issue-6-2143-2147
Volume 2-issue-6-2143-2147Volume 2-issue-6-2143-2147
Volume 2-issue-6-2143-2147
 
Volume 2-issue-6-2119-2124
Volume 2-issue-6-2119-2124Volume 2-issue-6-2119-2124
Volume 2-issue-6-2119-2124
 
Volume 2-issue-6-2139-2142
Volume 2-issue-6-2139-2142Volume 2-issue-6-2139-2142
Volume 2-issue-6-2139-2142
 
Volume 2-issue-6-2130-2138
Volume 2-issue-6-2130-2138Volume 2-issue-6-2130-2138
Volume 2-issue-6-2130-2138
 
Volume 2-issue-6-2125-2129
Volume 2-issue-6-2125-2129Volume 2-issue-6-2125-2129
Volume 2-issue-6-2125-2129
 
Volume 2-issue-6-2114-2118
Volume 2-issue-6-2114-2118Volume 2-issue-6-2114-2118
Volume 2-issue-6-2114-2118
 
Volume 2-issue-6-2108-2113
Volume 2-issue-6-2108-2113Volume 2-issue-6-2108-2113
Volume 2-issue-6-2108-2113
 
Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107
 

Kürzlich hochgeladen

Designing A Time bound resource download URL
Designing A Time bound resource download URLDesigning A Time bound resource download URL
Designing A Time bound resource download URLRuncy Oommen
 
UiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPathCommunity
 
VoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBXVoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBXTarek Kalaji
 
OpenShift Commons Paris - Choose Your Own Observability Adventure
OpenShift Commons Paris - Choose Your Own Observability AdventureOpenShift Commons Paris - Choose Your Own Observability Adventure
OpenShift Commons Paris - Choose Your Own Observability AdventureEric D. Schabell
 
Building AI-Driven Apps Using Semantic Kernel.pptx
Building AI-Driven Apps Using Semantic Kernel.pptxBuilding AI-Driven Apps Using Semantic Kernel.pptx
Building AI-Driven Apps Using Semantic Kernel.pptxUdaiappa Ramachandran
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.YounusS2
 
Empowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintEmpowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintMahmoud Rabie
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1DianaGray10
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024SkyPlanner
 
Machine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdfMachine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdfAijun Zhang
 
Computer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and HazardsComputer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and HazardsSeth Reyes
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6DianaGray10
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdfPedro Manuel
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Websitedgelyza
 
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IES VE
 
Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Commit University
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8DianaGray10
 
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Will Schroeder
 

Kürzlich hochgeladen (20)

Designing A Time bound resource download URL
Designing A Time bound resource download URLDesigning A Time bound resource download URL
Designing A Time bound resource download URL
 
UiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation Developers
 
VoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBXVoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBX
 
OpenShift Commons Paris - Choose Your Own Observability Adventure
OpenShift Commons Paris - Choose Your Own Observability AdventureOpenShift Commons Paris - Choose Your Own Observability Adventure
OpenShift Commons Paris - Choose Your Own Observability Adventure
 
Building AI-Driven Apps Using Semantic Kernel.pptx
Building AI-Driven Apps Using Semantic Kernel.pptxBuilding AI-Driven Apps Using Semantic Kernel.pptx
Building AI-Driven Apps Using Semantic Kernel.pptx
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.
 
Empowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintEmpowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership Blueprint
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024
 
Machine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdfMachine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdf
 
Computer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and HazardsComputer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and Hazards
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdf
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Website
 
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
 
20230104 - machine vision
20230104 - machine vision20230104 - machine vision
20230104 - machine vision
 
201610817 - edge part1
201610817 - edge part1201610817 - edge part1
201610817 - edge part1
 
Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8
 
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
 

Ijarcet vol-2-issue-7-2351-2356

  • 1. ISSN: 2278 – 1323 International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 2, Issue 7, July 2013 2351 www.ijarcet.org Abstract— Energy efficiency is the major problem in wireless sensor networks. We introduced the Cooperative communication protocol in wireless sensor networks (WSN) for establishment of cooperative clusters during transmission of data in a cooperative way. In the cooperation process of this cooperative transmission protocol, recruitment policy helps the nodes to co-operate each other. Cluster head on the one node thick path recruit neighboring nodes to assist in communication. To verify effectiveness of our cooperative transmission protocol various factors such as capacity, end-to-end robustness of the protocol to data-packet loss, along with the trade-off between energy consumption and error rate for cooperative network protocol are analysed. The packet failure probability and bit error minimization is derived for analysing end-to-end robustness of the protocol to data-packet loss and for analysing capacity, throughput rate is considered. Energy consumption analysis is done with the help of transmission power and number of selected nodes for cooperation. Cooperative transmission protocol comparison with other cooperative and non-cooperative schemes is done for performance analysis. The implementation results are elaborated through graphs. We have shown the performance of Cooperative transmission protocol through end-to-end robustness of the protocol to data-packet loss, capacity and energy consumption. Considering all these parameters it can be shown that longer lifetime of network can be achieved for cooperative transmission protocol. Index Terms— Wireless Cooperative Network, Wireless Sensor Network (WSN), Cooperative transmission, transmission cluster, receiving cluster. I. INTRODUCTION In a cooperative wireless network, all nodes can transmit information cooperatively. Each node can be a source node that transmits its information or it can be a relay node that helps to forward information of other nodes. Sometimes the cooperation strategy is based on the decode-and-forward (DF) protocol which comprises two transmission phases. In first phase, the source node sends the information to its next node on the route. In second phase, the relay node decodes the information it receives from the source and helps forward the correctly decoded information. In cooperative networking, individual network nodes can cooperate to achieve network goals in a coordinated way, and the cooperation can take place in a cross-layer fashion. Successful cooperative networking can prompt the cost-effective development of advanced wireless networks. Cooperative communication with single relay selection is a simple but effective communication scheme for energy constrained networks [2]. Node within a cooperative communication group with highest residual energy becomes the cooperative-group-head and it is responsible for data aggregation and the communication within the cooperative group. The group head pays role of BS for neighbouring clusters. Cooperative techniques utilize the broadcast nature of wireless signals by observing that a source signal intended for a particular destination can be “overheard” at neighboring nodes. These nodes are called relays, partners or helpers. Such relays process the signals they overhear and transmit it towards the destination. The relay operations can consist of repetition of the overheard signal (obtained, for example, by decoding and then re-encoding the information or by simply amplifying the received signal and then forwarding) or can involve more sophisticated strategies such as forwarding onlypart of the information, compressing the overheard signal, and then forwarding it [6]. In this paper our Cooperative transmission protocol showing the results of how the transmission ranges in the network affects the energy of our protocol as compared to other schemes and how failure probability of node in the network vary with transmission power variation. Our protocol increases the transmission reliability in comparison to the other presented schemes. Also we suggested one criterion for selection of appropriate cooperative nodes and the cluster head. II.THE COOPERATIVE TRANSMISSION PROTOCOL In this cooperative communication model, every node on the path from the source node to the destination node becomes a cluster head, which performs the task of recruiting other nodes in its neighborhood and coordinates their transmissions. We called route from a source node to a sink node as “having a width” path which is a multihop cooperative path. Figure 1 shows, a sending cluster, a receiving cluster and cooperation of each cluster in transmission of packets. Figure 1 Cooperative transmission Scenario Figure 2 Cooperative transmission and reception scenario …. Energy Efficient Protocol for Clustered Cooperative Sensor Network Ms. Pallavi H. Chitte, Mr. D.K. Chitre
  • 2. ISSN: 2278 – 1323 International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 2, Issue 7, July 2013 www.ijarcet.org 2352 In Figure 2, the model for Cooperative transmission and reception for a single hop is depicted where every node in the receiving cluster receives from every node in the sending cluster. Sending nodes are synchronized, and the power level of the received signal at a receiving node is the sum of all the signal powers coming from all the sender nodes and the mechanism for error detection is incorporated into the packet format, so a node that does not receive a packet correctly will not transmit on the next hop in the path. And thus it reduces the likelihood of a packet being received in error. Here we discuss two important phases our cooperative transmission protocol: routing phase and “recruiting-and-transmitting” phase. A. Routing Phase This phase find a “one-node-thick” route from the source node to the sink node which undergoes a thickening process in the “recruiting-and-transmitting” phase. Information about the energy required for transmission to neighboring nodes is computed. This information later used for cluster establishment in the “recruiting-and-transmitting” phase for selecting nodes with lowest energy cost. B. Recruiting and retransmitting phase In this phase, the nodes on the initial path become cluster heads, which recruit additional adjacent nodes from their neighborhood. The inter-clusters distance(s) (β) is significantly larger than the distance between nodes in the same cluster because the cluster heads recruit nodes from their immediate neighborhood. Recruiting is done dynamically and per packet as the packet traverses the path. The cluster head initiates the recruiting by the next node on the “one-node-thick” path. Once this recruiting is completed and the receiving cluster is established, the packet is transmitted from the sending cluster to the newly established receiving cluster. Recruiting and transmitting is done dynamically per hop, starting from the source node and progressing, hop by hop, as the packet moves along the path to the sink node. The receiving cluster of the previous hop along the path becomes the sending cluster, when data packet is received by it and the new receiving cluster will start forming. The next node on the “one-node-thick” path becomes the cluster head of the receiving cluster. The receiving cluster is formed by the cluster head recruiting neighbor nodes through exchange of short control packets such as RR, REC, GR, CL, CF. Then, the sending cluster head synchronizes its nodes, at which time the nodes transmit the data packet to the nodes of the receiving cluster. Medium access control is done in the “recruiting-and-transmitting” phase through exchanges of short control packets between the nodes on the “one-node-thick” path and their neighbor nodes [1]. Operation of the “recruiting-and-transmitting” phase is demonstrated in the Figure 3(a) to Figure 3(f). Another criterion of selection of Cluster Head can be done based on the appropriate position and energy computing of node where Source broadcasts control packets and nodes within the communication range of source node and located at appropriate position correspond to source node. These nodes will contend for cluster head according to their own energy. The one with highest energy capacity gains the complete scenario and will act as the direct agent of source node. Then The head broadcasts control packets to decide on cluster head of next hop. Repeating above process till a complete route containing cluster head is established and then cluster head performs the clustering. It implements the recruitment of cluster members according to the position and energy of neighboring nodes [4]. D. Control packets The control packets that are used in the two phases of Cooperative transmission protocol are given below: a. Request-to-recruit (RR packet) The format of RR packet includes: the id of the sender node (node 2 in our example), the id of the receiver node (node 5 in), the sink node id, and the NAV field that contains the estimated transmission time of the data packet. The NAV field serves to indicate when the channel will become available again for other transmissions. b. REC packet The REC packet contains the sender node id, the receiver node id, the id of the next node on the path (node 8 in our example), and the maximum time-to-respond. c. GR packet The GR packet sent from node contains the id of the originator of the REC packet and the sum of the link costs of the receiving link and the sending link. A node can be involved in a single recruiting process at any time, i.e., a node can have only one outstanding GR packet. A node chosen to cooperate cannot be involved in another recruiting process until the transmission of the current data packet is fully completed, i.e., received and sent to the next cluster by the cooperating node. d. CL packet
  • 3. ISSN: 2278 – 1323 International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 2, Issue 7, July 2013 2353 www.ijarcet.org A CL packet contains the id of the cooperating nodes and an updated value of NAV. Nodes that see their ids in the CL packet form the receiving cluster for this hop and the sending cluster for next hop. Other neighbor nodes that sent GR packets but do not see their ids in the CL packet will not participate in the cluster. To avoid interference: (1) if any node that receives an REC packet, whether it is cooperating or not, it has to wait for the transmission of the data packet to be fully completed before it can get involved in another recruiting process, also (2) if any node that overhears any of the control packets sent by any other node will not get involved in any recruiting or any transmission operation until the transmission of the data packet is fully completed. If a data packet was not received at the receiving cluster head node, or was received in error, the packet is considered to be lost and the whole “recruit-and-transmit” phase will restart again. A timer is associated with every exchange of control packets so that if a crucial control packet is lost, the “recruit-and-transmit” phase will restart again. e. CF packet The CF packet contains the waiting-time-to-send and the transmission power level. The transmission power level is the total transmission power (a protocol-selectable parameter) divided bythe number of the nodes in the sending cluster. II. RELATED WORK For performance evaluation of Cooperative transmission protocol, its performance comparison is done with the other three schemes such as Cooperation Along Non-cooperative path (CAN) protocol and the other two non-cooperative schemes that are “disjoint-paths” scheme and “one-path” scheme. 1. CAN Protocol Figure 4(a) CAN protocol. Figure 4(b) CAN reception model. In CAN protocol, sender node transmit data packets to all the nodes along the path instead of sending once per hop. Here a“non-cooperative path” between the source and the sink nodes is found first and then the last m predecessor nodes along the non-cooperative path cooperate to transmit to the next node on the path. 2. Disjoint-paths scheme In the disjoint-paths scheme, nodes form a number of disjoint paths from source to sink. The same information is routed individually along the different paths with no coordination between the nodes on the different paths. 3. One -path scheme In the one-path scheme, first the one-node-thick path is discovered and established. Then, each node on the path transmits with power equal to the sum of transmission powers of all the cooperating nodes in a cluster. The analytical and simulation results of our cooperative transmission protocol are compared throughout the paper to the results of the CAN protocol, the disjoint-path and One - path schemes. III. METHODOLOGY A. Cooperative Transmission Protocol Let the nodes in the cluster be indexed from 0 to m-1. We denote the transmission pattern of nodes in a sending cluster by a binary representation bm-1……….b 1b 0 according to which node transmits if b j=1 and does not transmit if b j=0. A node does not transmit when it receives a packet in error from the previous hop. We denote the reception pattern of nodes in a receiving cluster by a binary representation bm-1.........b1b0 according to which node j correctly receives the packet if b j=1 and receives the packet in error if b j=0. For example, for m=4, the binary representation of 1010 of the sending cluster and the binary representation of 0101 of the receiving cluster means that nodes 1 and 3 in the sending cluster transmit the packet, while in the receiving cluster nodes 0 and 2 correctly receive the packet and nodes 1 and 3 incorrectly receive the packet. Let gI J be the probability that node with binary representation I= um-1……….u1u 0 transmit a packet of length L bits to nodes with binary representation J= bm-1……….b1b0 across a single hop, and let SNR j be the SNR of the received signal at node j, then             ])1())1(1)(1[( , 1 0 L j L j J I m i ij BERbBERbg uSNRfBER B. Calculation of failure probability i. Cooperative transmission protocol Let vector v(i) be the binary representation of integer i. We define: g v(0) v(0) =1; gv(0) J = 0,J≠ v(0). Let A JK be the probability that a packet reaches the kth hop to nodes with binary representation J, given that at least one copy reaches k-1 hop, then Where, )2(,1 ,00 1)( 12 1 )( 2/[ { m m vJfor otherwiseJ kIv I J IvJK A AgA       (1) Now, let h CwRB be the probability of failure of a packet to reach any node by the k th hop.   h k kv h CwR AB 1 )0( (2) In this way failure probability, that the packet does not reach the sink due to reception error(s) along the path, is calculated.
  • 4. ISSN: 2278 – 1323 International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 2, Issue 7, July 2013 www.ijarcet.org 2354 ii. CAN protocol Let Xi=0 represent the event that a packet is not received at the hth hop along the non-cooperative path, while Xi=0 is the complementary event. Let Bh CAN be the probability of failure of a packet of length L bits to reach the node at the hth hop ).......().......0()0( 101 1 1101 h CANB      nnhhr m I nhhhrhr uXuXPuXuXXPXP Where n=min (m, h). The first term in (7), the probability that a packet is not received at the hth hop given that the last n nodes transmit with binary representation I=un-1 …u1, u0. iii. One–path scheme The analysis in this case is similar to the disjoint-paths case, but with one path only and each node transmitting with power of, where )( 1 jP m j t is the transmission power of the jth node. Let Pt (j) is the probability of failure of a packet to reach the hth node of the one-path scheme, then ]))1)],/().([((1[1B h noC Lh nt dPPmf    C. Calculation of the Cost of Links As mentioned in the Recruiting and retransmitting phase potential cluster member should compute the link costs. This cost is the sum of receiving link and sending link of a node. Receiving link from cluster head of front hop (or source) and node itself, and sending link concerns cluster head of next hop (or destination) and node itself. The link cost between node i to node j : C i,j calculated by node i as: avg i ji ji R R e C  )( , ,  (3a) Where, e i, j is energy cost of the link, R is residual battery energy of node I; R AVG is average residual battery energy of the neighbors of node. Energy cost of a link is the transmission power required for reception at a particular bit error rate. Nodes determine the energy costs of links by listening (or overhearing) transmissions during the routing phase. The protocol-selectable parameter controls the weight of each factor in the total cost. From equation (3) of link cost, nodes with small residual battery capacity are less likely to be recruited in this phase [1]. Another method to calculate the link cost to achieve energy efficiency is: Rneighbor R e C i ji ji )( , ,  (3b) Where e i, j is the energy cost of the link that required for reception at a certain bit error rate. Node can obtain it through overhearing during the routing period. Ri is the remaining energyof node i. Rneighbor is the average remaining energyof the neighbors of node i. Cluster head selects among potential cluster members. Those with large remaining energy capacity are more likely to be recruited [4]. D. Error calculation in Cooperative transmission Here, the Cooperative transmission model is similar to MISO case and protocol selectable parameter m is the number of cooperating nodes in the network. Considering, a known SNR at the receiver, the probability of an error at the receiver is given by P (error) = f (SNR, m) = (1+ (SNR/2))-m (4) We assumed that the power attenuation due to distance is carried out by d-γ i,j. Where, d i,j: the distance between node to node, γ is the attenuation exponent. In particular, let Pn be the noise power at the receiver and Pt is the transmitter transmission power measured at nominal distance equal to 1. When a packet is transmitted from node to node, the SNR measured at the receiver j is computed as, SNR= [(Pt/d i,j) /Pn ] (5) In other words, to achieve a certain value of SNR, the transmitter needs to transmit with the power of, Pt = [SNR. Dγi,j *Pn] (6) The bit error probability is then terminated by (4). We also assume that for a packet to be successfully received, all the bits in the packet must be successfully received. E. Energy consumption We compare the energy consumption of our cooperative transmission protocol to the CAN protocol and the one-path scheme. For making meaningful comparison of energy consumption of any two schemes, we kept failure probability equal for the compared schemes. In our Cooperative protocol, one-hop energy consumption of the transmissions of the control and data packets between two cooperative clusters of nodes, with m cooperating nodes in each, is analyzed. For energy consumption of this cooperative scheme, we assume some failure probability as Pf and the probabilityof bit error is a function of the SNR of the received signal. For every value of the failure probability Pf, we calculate the needed transmission power of a single node Pt from (2) to (5). We assume that the power consumption for the cooperative protocol is m2. Pt as we need m transmissions per hop, with each transmission being of the type m-to-1. For CAN protocol, we assume, the power consumption is m.Pt and for the one-path scheme we assume, the power consumption is Pt. IV. RESULTS AND ANALYSIS A. Simulation Results We use simulation to evaluate the performance of our protocol. Network simulator ns2 is used for simulating the results and multi-hop scenario. Considering the x-dimension of topography as 500 and y-dimension of topography as 500, simulation time of 200 sec, total number of nodes in the network=100 and initial energy= 100J. Nodes are placed randomlyand the numbers of cooperative nodes m is 7.The source and sink node are picked randomly. The metrics that we use for evaluation are: transmission power and energy consumption. Our protocol curves are shown as “CwR”, the CAN protocol curves are shown by “CAN”, disjoint paths schemes curves are shown as “noc” and One-path schemes curves as “One”. These curves are plotted in graph with different colours. We analyse different values of packet failure probability (Pf ) for different values of transmission power. Figure 5 depicts Failure probability vs.
  • 5. ISSN: 2278 – 1323 International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 2, Issue 7, July 2013 2355 www.ijarcet.org transmission power.Considering different power levels; our cooperative transmission protocol has lowest failure probability than the compared schemes. Figure 5: Failure Probability vs. Power. Figure 6 shows effect of transmission range on Energy and Figure 7 shows transmission range vs. throughput. Considering different power transmission level that corresponds to different transmission ranges between 50m and 250 m, with fixed packet loss probability = 0.2. Figure 6 shows as the transmission range increases, the noise power increases, the contention increases which increase the retransmission of control and data packets, and all in turn, increases the total energy consumption. Only disjoint-paths scheme has larger energy consumption than our protocol. Figure 6: Transmission range vs. Energy Figure 7: Transmission range vs. throughput From figure 7, it can be analysed that as the transmission range increases the average number of hops in a path from source to sink decreases. When the h decreases, the difference in the failure probability between our protocol and the disjoint-paths scheme also decreases. This leads to a smaller difference in the capacity between the two schemes. When the network becomes a 1- or 2-hop network, there is no difference in the capacity between the two schemes. The capacity of the CAN protocol degrades with an increase in the transmission range. Thus higher energy is achieved in our Cooperative transmission protocol than disjoint paths scheme and One–path scheme and CAN protocol. V. CONCLUSION By analysing different parameters such as failure probability, transmission power, transmission range and energy consumption for cooperative transmission protocol and other cooperative and non-cooperative schemes, it can be shown that the total energy consumption can be considerably reduced by using cooperative factors of the our Cooperative transmission protocol than the compared schemes. With consideration of achieved results of end-to-end robustness of the protocol to data-packet loss, capacity and energy consumption we can saythat longer lifetime of Sensor network will be achieved for cooperative transmission protocol. ACKNOWLEDGMENT I would like to express my sincere gratitude towards my guide and co-author of this paper, Prof. D. K. Chitre, for the whole work of this paper. This work would have not been possible without his valuable attention and motivation. REFERENCES [1] Mohamed Elhawry and Zygmunt J. Haas, "Energy-Efficient Protocol for Cooperative Networks”, IEEE/ACM Transactions on Networking, VOL. 19, NO. 2, April 2011. [2] Zhong Zhou, Shengli Zhou,, Jun-Hong Cui, and Shuguang Cui, “ Energy-Efficient Cooperative Communication Based on Power Control and Selective Single-Relay in Wireless Sensor Networks”, IEEE Transactions on Wireless communications, VOL. 7, NO. 8, August 2008. [3] Ahmed Ibrahim Hassan, “Energy-efficient reliable packet delivery in variable-power wireless sensor networks”, Ericsson Egypt Ltd., Ain Shams Engineering Journal, 23 September 2011. [4] Ling Tan, Shunyi Zhang, Jin Qi, “An Intelligent Cooperative Protocol in Clustered Wireless ,Sensor Networks for Energy-efficiency”, Journal of Computational Information Systems , February (2012). [5] Irfan Ahmed and Mugen Peng,” Exploiting Geometric Advantages of Cooperative Communications for Energy Efficient Wireless Sensor Networks”, I. J. Communications, Network and System Sciences, 1: 1-103, February 2008. [6] Sudharman K. Jayaweera, Member, IEEE, “Virtual MIMO-based Cooperative Communication for Energy-constrained Wireless Sensor Networks”, IEEE IEEE Transactions on Wireless communications, VOL. 5, NO. 5, May 2006. [7] Aria Nosratinia, Todd E. Hunter, Ahmadreza Hedayat, “Cooperative Communications in Wireless Networks”, 0163-6804/04/$20.00 © 2004 IEEE. [8] Gupta Sunita, "Power Efficiency of Cooperative Communication in Wireless Sensor Networks", Paper 112, 978-1-4244-4474-8/09/$25.00 ©2009 IEEE. [9] Akyildiz, Ian F., Mehmet C. Vuran, and Ozgur B. Akan, “A Cross-Layer Protocol for Wireless Sensor Networks,” 40th Annual Conference on Information Sciences and Systems, pp. 1102-1107, 22-24 March 2006. [10] Cui Shuguang and Andrea J. Goldsmith “Cross-layer design of energy-constrained networks using cooperative MIMO technique” Eurasip’s Signal Processing Journel, August, 2006. [11] Khandani, Amir Ehsan, Jinane Abounadi, Eytan Modiano, and Lizhong Zheng, “Cooperative Routing in Static Wireless Networks,” IEEE Transactions on Communications, Vol. 55, No. 11, pp. 2185-2192, November 2007. [12] P. Herhold, E. Zimmermann, and G. Fettweis, “Cooperative multi-hop transmission in wireless networks,” Comput. Netw. vol. 49, no. 3, pp. 299–324, October 2005.
  • 6. ISSN: 2278 – 1323 International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 2, Issue 7, July 2013 www.ijarcet.org 2356 Ms. Pallavi H. Chitte, Postgraduate student, Terna college of Engineering, nerul, Navi Mumbai, has been doing the research work in wireless cooperative network. . Mr.D.K.Chitre has been working as Associate Professor and Head of Department in Computer Engineering Department, terna college of Engineering, nerul, Navi Mumbai, has done research work in networking area.