Optimized Task Allocation in Sensor Networks

International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.
3,August 2013
OPTIMIZED TASK ALLOCATION IN SENSOR NETWORKS

Ali Bagherinia
1
Department of Computer Engineering, Islamic Azad University-Dehdasht Branch, Dehdasht, Iran

ali.bagherinia@gmail.com
ABSTRACT
In this paper we propose an approach for optimization of energy consumption in sensor networks. Compared to existing approaches the proposed approach takes into account the energy for data communication between nodes in task allocation. In the proposed approach firstly the tasks are allocated to sensor nodes by DPSO Algorithm, while the cost function including network constraint is optimum. Performed simulation result that the proposed approach causes reduction in energy consumption, as well as increasing sensor network lifetime.
KEYWORDS
Cost function, Energy consumption, Sensor networks, task allocation.
1. INTRODUCTION
Although wireless sensor nodes have existed for decades and used for applications as diverse as earthquake measurements to warfare, the modern development of small sensor nodes dates back to the 1998 Smartdust project [1] and the NASA Sensor Webs Project [2] One of the objectives of the Smartdust project was to create autonomous sensing and communication within a cubic millimeter of space. Though this project ended early on, it led to many more research projects. They include major research centres in Berkeley NEST [3] and CENS. [4] Sensor networks are new type of data collection systems that consist of a lot of small sensor [5]. Each sensor node really is Microprocessor and small network that supplied by a battery. In general, each node combines three components: sensing unit, data processor and communication unit. This is an integrated system with low power consumption. The main idea of sensor networks is collecting high quality information in specified areas such as inaccessible areas, dangerous areas for human such as place of dangerous residual materials, military areas and generally where information collecting is impossible with existing technologies. Each sensor node measures necessary parameters from around area and communicate its with radio sender through electrical signal. Processing of this signal extracts specification such as object placement or around events. Sensor networks application commonly stereotyping into military and unmilitary. Military such as enemy taking, etc and unmilitary such as critical management, traffic control, etc.
DOI : 10.5121/ijitmc.2013.1305
43
International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013
Important problem in sensor networks is low capacity of its battery that reduces with computations and communications. A method for reducing power consumption is optimized task allocation. This paper consists of: structure of sensor node (section 2.1), related work (section 2.2), proposed approach (section 3), simulation (section 4), results and conclusion.
1.1.
Structure of sensor node
Figure 1 shows modular structure of each multi sensing sensor node. Each sensor node consists of: multi sensing interface and A/D (for sensing corresponding analog area such as pressure, temperature ), memory, CPU, RF and controller.
Figure 1. Sensor node structure with multiple sensing units
Each component of sensor node can work in different states. If each node consists of N components with Mi states it can has in (Mi) states but in practice all of these states not used. Eight states of these states are used in scheduling algorithm that they are shown in table I [6]. These states are arranged as decreasing by power consumption.
Table 1. Eight valid states of a sensor node arranged in the decreasing order of power consumption
2. Related work
In [7] Tasks are allocated to gateways a way that maximizes the life of these cluster-heads and eventually the whole network. This work didnt consider all nodes except gateway of clusters. In [8] energy-balanced allocation of a real-time application onto a single-hop cluster of homogeneous sensor nodes connected with multiple wireless channels was proposed.
44
3. Proposed approach
3.1. Task allocation
There are many tasks, should be assign to sensor nodes in network, that executing of these tasks consume energy of networks as follow minimum network lifetime. Consumption energy is specified by a cost function. Cost function is defined as user application tends.
3.2. Sensor networks presentation
Each sensor networks is presented as a weighted graph, for example Figure 2 In this graph each node is a sensor node an each edge is a path between to sensor nodes.
2o 25 15 10 10 18
15 10 15
10
20
Figure 2. Sensor network Graph
3.3 Cost Function

Ecomp(i): consumption energy for executing task i. n: sensor node n. Ecom(u,v): consumption energy for transfer data from node u to node v. that is depends on distance between u and v, and this depends to network, MAC protocols and hardware constraints. Penalty: if violation (i.e. assigned many tasks to a node) is occurred its valued to to protects from violation.
3.4. Task allocation algorithm

Task allocation algorithm centrally runs and should minimum above cost function. Propose an algorithm that assigns the task to nodes in a sensor network (represented as a graph) while satisfy above cost function has very large search space; on the other hands the task allocation is a NPComplete problem. We have used a particle swarm optimization for task allocation in sensor networks. The goal of allocation is to minimize the cost function as result increasing network lifetime. Task allocation model is an integer program with an equation that includes cost function with integer coefficients (Equation 1).
45
Min Cost function = (Equation 1) (Equation 2) (Equation 3)

Equation 2 states that each task should be allocated to exactly one sensor node. Equation 3 states is binary variable. that Now, we want to design particle to present a sequence of tasks in sensor networks that is represented by a weighted graph. In my approach solutions are encoded as n m matrixes, called position matrix, in which m is the number of available sensor nodes at the time of allocation and n is the number of tasks. The position matrix of each particle has the two following properties: 1) All the elements of the matrices have either the value of 0 or 1. In other words, if is the position matrix of i-th particles in a d-dimensional space, then: 2) In each row of these matrices only one element is 1 and others are 0. In position matrix each row represents a task allocation and each column represents allocated tasks in a processor. Velocity of each particle is considered as a nm matrix whose elements are in range[ , ] . Also Pbest and nbest are nm matrices and their elements represents the best position that i-th particle has visited since are 0 or 1 as position matrices. the first time step and represents the best position that i-th particle and its neighbors have visited from the beginning of the algorithm. In this paper we used star neighborhood topology for . In each time step and should be updated:
(Equation 4)
(Equation 5)
In (4) is the element in n-th row and m-th column of the i-th velocity matrix in the updated time step of the algorithm and denotes the element in n-th row and mth column of the i-th position matrix in the updated time step. and are positive acceleration constants which control the influence of and on the search process. Also and are random values in range [0, 1] sampled from a uniform distribution. weight which is called inertia weight was introduced by Shi and Eberhart [9] as a mechanism to control the exploration and exploitation abilities of the swarm. Usually w starts with large values
46
(e.g. 0.9) which decreases over time to smaller values so that in the last iteration it ends to a small value (e.g. 0.1). Equation (5) means that in each row of position matrix value 1 is assigned to the element whose corresponding element in velocity matrix has the max value in its corresponding row. If in a row of velocity matrix there is more than one element with max value, then one of these elements is selected randomly and 1 assigned to its corresponding element in the position matrix. The pseudo code of the proposed DPSO algorithm is stated as follows: Create and initialize a nm -dimensional swarm with P particles
do{ for (each particle i=1 to P) do { )> ) )> )
} for (each particle i=1 to P) do { update the velocity matrix using Equation (4) update the position matrix using Equation (5) } } While (stopping condition is false)
In commutative and associative tasks such as Min(), Max(), Sum() and Avg() at each task allocation to a node states of its neighbor nodes is given to it. Thus tis nod after finishing executing its task wait to receive data from its neighbors. Then send total result as a message. For example in Figure 3 node P3 sends its data and P1,P3 data as a message to P4 instead of sending three message. This action cause less communication in sensor networks that implies less energy consumption.
P1
P2
P3
P4
Figure 3. Data collecting from neighbour
47
4.Simulation
Simulation is done for a sensor network with 128 nodes in SWANS [10]. Remaining average of energy in various loads of tasks computed. This simulation consists of running: 1) Optimization of task allocation in cluster based sensor networks, 2) Proposed approach. Results curves shown in Figure 4.
.
Figure 4. Remaining average of energy in various loads
5.Conclusion
With regard to Figure 4 clearly that in low loads approach 1 has lowest consumption energy but in height load proposed approach has lowest consumption energy because in proposed approach at high load a lot of nodes send one message for its data and their neighbour data instead of sending multiple message. By this technique we avoiding communication and preserve network energy.
References
http://robotics.eecs.berkeley.edu/~pister/SmartDust http://www.techbriefs.com/content/view/2227/32 http://smote.cs.berkeley.edu:8000/tracenv/wiki http://research.cens.ucla.edu www.cn.ece.cornel.edu/publications/papers/allerton2002/slides.pdf. D. Li, P. H. Chou, and N. Bagherzadeh, Mode Selection and Mode Dependency Modeling for Power Aware Embedded Systems, in Proc. IEEE Military Communication Conference (MILCOM), Montery, CA, Oct. 31 Nov. 3, 2004. [7] M.Younis, Kemal Akkaya and Anugeetha Kunjithapatham,Optimization of Task Allocation in a Cluster-Based Sensor Network Proceedings of the 8th IEEE International Symposium on Computer and Communication (ISCC03), 2003. [8] Y. Yu and V. K. Prasanna, Energy-balanced task allocation for collaborative processing in wireless sensor networks, ACM/Kluwer Jouranl of Mobile Networks and Applications, vol. 10, no. 1-2, pp.115131, Feb. 2005. [9] Zs. Nmeth, V. Sunderam, Characterizing grids: Attributes, definitions, and formalisms, Journal of Grid Computing,Vol. 1 . No.1,2003,pp. 9 -23. [10] SWANS Simulator: http:\\jist.ece.cornell.edu. [1] [2] [3] [4] [5] [6]
48
AUTHOR Ali Bagherinia is a research fellow in Islamic Azad University-Dehdasht Branch, Dehdasht, Iran. His research area is parallel computing & Distributed systems. He has a teaching experience of more than 10 years. Currently he is instructor of Islamic Azad University-Dehdasht Branch, computer group & PhD student.
49

Optimized Task Allocation in Sensor Networks

Uploaded by

Copyright:

Available Formats

Optimized Task Allocation in Sensor Networks

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Optimized Task Allocation in Sensor Networks

Uploaded by

Copyright:

Available Formats

International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.

OPTIMIZED TASK ALLOCATION IN SENSOR NETWORKS

Department of Computer Engineering, Islamic Azad University-Dehdasht Branch, Dehdasht, Iran

Structure of sensor node

Figure 1. Sensor node structure with multiple sensing units

3.2. Sensor networks presentation

Figure 2. Sensor network Graph

3.3 Cost Function

3.4. Task allocation algorithm

Min Cost function = (Equation 1) (Equation 2) (Equation 3)

do{ for (each particle i=1 to P) do { )> ) )> )

You might also like