Energy Efficient Packet Data Service in Wireless Sensor Network in Presence of Rayleigh Fading

Energy Efficient Packet Data Service in Wireless Sensor Network in Presence of Rayleigh Fading

Arnab Nandi (National Institute of Technology Durgapur, India) and Sumit Kundu (National Institute of Technology Durgapur, India)
Copyright: © 2011 |Pages: 14
DOI: 10.4018/jghpc.2011070103
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Energy level performances of three packet delivery schemes in Wireless Sensor Networks (WSN) are evaluated in presence of Rayleigh fading. Three different information delivery mechanisms are investigated using regenerative relays with or without error correction capability. Energy consumption for successful delivery of a data packet for each mechanism is evaluated and compared under several conditions of node density, bit rate, transmit power, and channel fading. Energy efficiencies of different retransmission schemes are also evaluated. Further, an optimal packet length based on energy efficiency is derived. Impact of optimal packet size on average number of retransmission and total energy expenditure is analyzed for each delivery scheme.
Article Preview

System Model

A square grid network architecture is considered as in (Panichpapiboon et al., 2006). Figure 1 shows a two tier sensor network using square grid topology (Hong & Hua, 2006; Panichpapiboon et al., 2006). Distance between two nearest neighbor is dlink. It is assumed that N numbers of nodes are distributed over a region of area A obeying square grid topology. The node spatial density is defined as number of nodes per unit area i.e., . The minimum distance between two consecutive neighbors is given by (Panichpapiboon et al., 2006)

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing