Function Computation over Heterogeneous

advertisement

Function Computation over Heterogeneous

Wireless Sensor Networks

ABSTRACT:

The problem of function computation in large scale heterogeneous wireless sensor networks

(WSNs) is studied. Suppose n sensors are placed in a disk network area with radius n_, where

_ is a positive constant. The sensors are located heterogeneously around the sink node, i.e., the density of sensors decreases as the distance from the sink node increases. At one instant, each sensor is assigned an input bit. The target of the sink is to compute a function f of the input bits, where f is either a symmetric or the identity function. Energy-efficient algorithms based on inhomogeneous tessellation of the network are designed and the corresponding optimal energy consumption scaling laws are derived. We show that the proposed algorithms are indeed optimal (except for some polylogarithmic terms) by deriving matching lower bounds on the energy consumption required to compute f. At last, based on the results obtained in this paper as well as those obtained by previous works, some discussions and comparisons are presented. We observe that 1) the heterogeneity extent has a great impact on the computation of both symmetric function and identity function, and 2) the energy usage of computing symmetric function can be significantly smaller than that of computing identity function under certain parameter condition, i.e., performing in-network computation helps save energy.

EXISTING SYSTEM:

WIRELESS sensor networks (WSNs) usually consist of numerous small sensor nodes which are capable ofcomputing and communicating data. Mostly, the WSN has a sink node or a fusion center which is responsible for processing the sensor data and extracting the information it wants from the raw data. Often, the sink is not interested in all the raw data collected by those sensors. The sensors are located heterogeneously around the sink node, i.e., the density of sensors decreases as the distance from the sink node increases. At one

Further Details Contact: A Vinay 9030333433, 08772261612

Email: takeoffstudentprojects@gmail.com | www.takeoffprojects.com

instant, each sensor is assigned an input bit. The target of the sink is to compute a function f of the input bits, where f is either a symmetric or the identity function. Energy-efficient algorithms based on inhomogeneous tessellation of the network are designed and the corresponding optimal energy consumption scaling laws are derived.

PROPOSED SYTSEM:

Proposed algorithms are indeed optimal (except for some polylogarithmic terms) by deriving matching lower bounds on the energy consumption required to compute f. At last, based on the results obtained in this paper as well as those obtained by previous works, some discussions and comparisons are presented. We observe that 1) the heterogeneity extent has a great impact on the computation of both symmetric function and identity function, and 2) the energy usage of computing symmetric function can be significantly smaller than that of computing identity function under certain parameter condition, i.e., performing in-network computation helps save energy. In-network computation is proposed to be a promising paradigm to reduce the overhead of WSNs. We observe that performing in-network computation sometimes reduce energy usage while sometimes not. Our theoretical results offer fundamental insights into how to take the advantage of in-network computation to design more energy-efficient large scale wireless networks, e.g., WSNs and large scale mobile Internet, etc.

CONCLUSION:

The energy complexity of function computation in heterogeneous wireless networks is studied in this paper. The target function is either a symmetric function or the identity function, which are both widely accepted very useful and practical functions. We investigate the impact of heterogeneity on the energy consumption in wireless networks and find that the heterogeneity extent greatly influences the minimum total energy usage as well as the optimal scheme for computing functions. We observe that performing in-network computation sometimes reduce energy usage while sometimes not. Our theoretical results offer fundamental insights into how to take the advantage of in-network computation to design

Further Details Contact: A Vinay 9030333433, 08772261612

Email: takeoffstudentprojects@gmail.com | www.takeoffprojects.com

more energy-efficient large scale wireless networks, e.g., WSNs and large scale mobile

Internet, etc.

SYSTEM CONFIGURATION:-

HARDWARE CONFIGURATION:-

Processor

Speed

RAM

-

-

Pentium –IV

1.1 Ghz

Monitor

- 256 MB(min)

Hard Disk

Key Board

Mouse

-

-

20 GB

Standard Windows Keyboard

- Two or Three Button Mouse

- SVGA

SOFTWARE CONFIGURATION:-

Operating System

Programming Language

Java Version

: Windows XP

: JAVA

: JDK 1.6 & above.

Further Details Contact: A Vinay 9030333433, 08772261612

Email: takeoffstudentprojects@gmail.com | www.takeoffprojects.com

Download