BioMed Research International

Volume 2013 (2013), Article ID 965318, 6 pages

http://dx.doi.org/10.1155/2013/965318

## The Quantitative Overhead Analysis for Effective Task Migration in Biosensor Networks

^{1}Department of Electrical and Computer Engineering, Sungkyunkwan University, 300 Cheoncheon-dong, Jangan-gu, Suwon-si, Gyeonggi-do 440-746, Republic of Korea^{2}Department of Liberal Art, Seoul Theological University, Sosabon-dong, Sosa-gu, Bucheon-si, Gyeonggi-do 422-742, Republic of Korea^{3}Department of Military Studies, Daejeon University, 62 Daehakro, Dong-Gu, Daejeon-si 300-716, Republic of Korea

Received 30 June 2013; Revised 22 August 2013; Accepted 22 August 2013

Academic Editor: Tai-hoon Kim

Copyright © 2013 Sung-Min Jung et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

We present a quantitative overhead analysis for effective task migration in biosensor networks. A biosensor network is the key technology which can automatically provide accurate and specific parameters of a human in real time. Biosensor nodes are typically very small devices, so the use of computing resources is restricted. Due to the limitation of nodes, the biosensor network is vulnerable to an external attack against a system for exhausting system availability. Since biosensor nodes generally deal with sensitive and privacy data, their malfunction can bring unexpected damage to system. Therefore, we have to use a task migration process to avoid the malfunction of particular biosensor nodes. Also, it is essential to accurately analyze overhead to apply a proper migration process. In this paper, we calculated task processing time of nodes to analyze system overhead and compared the task processing time applied to a migration process and a general method. We focused on a cluster ratio and different processing time between biosensor nodes in our simulation environment. The results of performance evaluation show that task execution time is greatly influenced by a cluster ratio and different processing time of biosensor nodes. In the results, the proposed algorithm reduces total task execution time in a migration process.

#### 1. Introduction

A biosensor network is generally composed of many biosensor nodes and one base station. Biosensor nodes are distributed on a human body or wearable devices, and the base station is located at outside of biosensor networks. Biosensor nodes monitor various biological parameters such as body temperature, blood pressure, and blood glucose level. They transmit these gathered data to the base station, and the base station derives meaningful results from the processed data. Finally, the base station sends these results to user’s device or to a hospital through the internet as shown in Figure 1 [1].

In general, main components of a biosensor node are a sensing unit, a processing unit, a transceiver, and a power unit [2, 3]. Biosensor nodes can monitor specific parameters by using sensing units, and gathered information is delivered to the processing unit. The processing unit is composed of a processor, storage, and memory. These subunits manage a procedure to analyze collected information and relay it to other biosensor nodes. The collected information by biosensor nodes is typically medical data, so it is sensitive and privacy information. This information should not be exposed to a malicious user, and biosensor nodes should process it in real time [4, 5]. Because of their small size, biosensor nodes have little computational power, limited capacity of memory, and restricted battery. Thus, an attack can easily decrease availability of biosensor nodes, so it makes it impossible that they relay the important information to user in real time [6, 7]. In this case, a suitable migration process has to be used to solve that problem. The migration means the process of transferring tasks from nodes with heavy overhead to other nodes with enough capabilities.

In this paper, we propose a useful algorithm to quantitatively analyze system overhead. Simulation results show that network performance is greatly influenced by a cluster ratio and different performance of biosensor nodes. Also, using the proposed algorithms, the total task execution time is reduced compared with a general process. The remainder of this paper is organized as follows. In Section 2, we discuss restricted resources of biosensor nodes and the reason to use a clustering scheme in our system model. In Section 3, we present mathematical analysis to calculate total task execution time and system overhead. In Section 4, we evaluate the proposed algorithm with several parameters. Finally, Section 5 concludes this paper.

#### 2. The Clustering Scheme in System Model

Biosensor nodes are generally very small, so the use of computing resources is limited. In particular, it is impossible to replace or recharge the power unit, so it is important to reduce energy consumption in the biosensor network. Since it is necessary to make uniform energy consumption to all biosensor nodes, we need to use a hierarchical routing protocol [8, 9]. This protocol uses a cluster which indicates a logical group of biosensor nodes, and the cluster is managed by the leader node called a cluster head. Before biosensor nodes gather data, cluster heads are selected, and clusters are formed around these cluster heads in the hierarchical routing protocol. The cluster heads are responsible for gathering information from all biosensor nodes in their cluster. After gathering information, cluster heads perform data aggregation to reduce data size and transmit results to the base station. The role of the cluster head is periodically rotated to prevent energy depletion of particular biosensor nodes. Therefore, our system model uses the hierarchical routing protocol to reduce energy consumption. Figure 2 shows the clustering scheme.

Biosensor nodes are generally distributed in wearable equipment or on a human body. It is assumed that the base station knows the network topology. Also, the base station has sufficient battery and processing capability. There are two kinds of sensors such as cluster heads and normal biosensor nodes. Biosensor nodes have formed the cluster by using the cluster head selection algorithm [10, 11]. When overhead is occurs in some nodes, a suitable migration process could be used to reduce overhead. In other words, tasks are moved from biosensor nodes with large overhead to the other nodes with sufficient resources. The task execution time can represent system overhead, so we calculate and compare it to analyze system overhead in our system model.

First, we set that task execution time is the sum of processing time and communication time as shown in (1). Processing time indicates the time required to process the tasks in each biosensor node. Thus, total processing time of all tasks depends on the number of active biosensor nodes. Communication time means the time required to transmit from each biosensor nodes to the base station. There are two types of communication time in the hierarchical routing protocol. One is the transmission time from biosensor nodes to cluster heads, and the other is transmission time from cluster heads to the base station:

The biosensor nodes check processing time in regular period and record the fastest and slowest value. Let denote the fastest processing time and let denote the slowest processing time which is required to process a unit task. It is assumed that the processing time follows uniform distribution from to . Figure 3 shows its probability density function. Let denote the initial number of biosensor nodes to process all the tasks in this function.

In this function, the expected value is as shown in (2) by a uniform distribution rule. If there is no consideration of a migration process to calculate the task execution time, then (2) is used to calculate the task execution time of biosensor nodes:

#### 3. The Proposed Algorithm to Analyze System Overhead

We focus on the number of biosensor nodes and assume that the system performance is linearly improved by the number of nodes [12]. Thus, the number of active biosensor nodes is different by system overhead. When some biosensor nodes have heavy overhead, we can solve this problem to use a migration process. Let denote the initial number of biosensor nodes. After we move tasks from of nodes to the other nodes, the number of active biosensor nodes becomes .

As a result, the processing time becomes a new uniform distribution as shown in Figure 4. It is distributed from to . Equation (3) shows the expected value of its probability density function:

We should consider the number of tasks to calculate system overhead. Let denote the number of tasks. Since the number of active biosensor node is , each biosensor node has to process tasks. Equation (4) indicates the expected value of processing time in each biosensor node:

As mentioned in the previous section, our system model uses a clustering scheme, and the number of biosensor nodes is similar in each cluster. Let denote cluster ratio; then, the number of clusters will be , and the number of biosensor nodes in one cluster will be .

For example, the number of biosensor nodes is 30, and the cluster ratio is 0.1; then, the number of clusters is 3 (30 × 0.1), and the number of biosensor nodes is 10 (1/0.1) in each cluster as shown in Figure 5.

We calculate the communication time in the biosensor network. Let denote transmission time of unit packet. There are two types of communication as shown in Figure 6. First, the communication time from a biosensor node to a cluster head in each cluster is represented as the product of the data transmission time and the number of biosensor nodes in each cluster. Biosensor nodes sequentially transmit results according to the order, and the communication time from biosensor nodes to a cluster head can be presented as . Second, the communication time from a cluster head to the base station is expressed as the product of data transmission time and the number of cluster heads. Because cluster heads also sequentially send results to the base station, communication time in second case is expressed as . Equation (5) indicates the total communication time:

Finally, the sum of (4) and (5) represented the time required to process all tasks and transmit to the base station when the number of active biosensor nodes is changed from to :

#### 4. Performance Evaluation

We evaluate the total task execution time by (6) in a biosensor network. We use the parameter values listed in Table 1 for our analysis of task execution time. We set the number of tasks () to 100 and the initial number of biosensor nodes () to 30. The number of active biosensor nodes () is from 1 to 30. The fastest processing time of a biosensor node () is 0.001 seconds. We set the unit message length to 128 byte and transmission speed to 250 kbps. Therefore, it takes about 0.0041 seconds to process the unit message length so we set the transmission time () to 0.0041 seconds. Since the communication range of a biosensor network is very small and there is very little impact on the performance by distance between biosensor nodes, the distance is ignored in our performance evaluation.

Based on these simulation parameters, we evaluate total task execution time according to change of a cluster ratio and the slowest processing time of a biosensor node in a migration process.

In Figures 7 and 8, we set to 0.002 and 0.005 seconds, respectively. Also, we calculate task execution time according to the change of a cluster ratio (). is 0.1 and 0.2 in each figure. Figure 7 shows the result between the total task execution time and . In this evaluation, is set as 0.001, and is set as 0.002 seconds. At first, the total task execution time decreases as the number of active biosensor nodes decreases. However, the task execution time increases after a certain number of biosensor nodes. It is 15 in case is 0.1 and 10 in case is 0.2 in Figure 7.

Figure 8 shows the result when is 0.001 and is 0.005. We can recognize that total task execution time is influenced by as compared with the result of Figure 7. Overall, the task execution time also increases as the different processing time increases. After the number of biosensor nodes becomes about 30% of the initial number of them, the task execution time increases rapidly. Thus, we can know that system overhead is tolerable until this point. As the cluster ratio increases, the change of the total task execution time decreases. As shown in the graph in Figures 7 and 8, total task execution time is affected by a cluster ratio and difference of processing time among biosensor nodes. Thus, we have to control these parameters to manage biosensor networks efficiently.

When biosensor nodes have heavy overhead, we can solve this problem by moving tasks from these nodes to other nodes with enough resources. The number of active biosensor nodes is changed, and it is needed to accurately calculate overhead in biosensor network. Also, we evaluate the total task execution time by (6) as the change of the slowest processing time of biosensor nodes.

Figure 9 shows the change of the slowest processing time in our simulation. There are different values from 0.001 to 0.010 seconds. We set to 0.001 seconds. At each round we compared the task execution time applied to migration scheme and the task execution time applied to general method.

Figure 10 shows that the total execution time as is changed when is 0.1. The number of active nodes is 30. If is greater than or equal to nine times of , then tasks in 30% of all biosensor nodes move to the other biosensor nodes in our proposed algorithm. In the same way, is greater than or equal to seven times and five times of , and we move the tasks in 20% and 10% of all biosensor nodes, respectively. In Figure 10, the sum of execution time applied to normal process at each round is 3.1795 seconds, and the sum of execution time applied to a migration process is 3.1372 seconds. We can reduce the total task execution time by using our proposed algorithm, and the system performance has been improved by 1.35% in this case.

Figure 11 shows the result between the total execution time and at each round when is 0.3. If we do not consider a migration process, the total execution time is 3.0440 seconds. Conversely, if we use our proposed algorithm, the total execution time is 2.8677 seconds. Also, we can decrease the total execution time, and the system performance has been improved by 6.15% in this case.

When some biosensor nodes have large overhead, proper migration process is needed to manage the biosensor network efficiently. We suggest the algorithm to quantitatively analyze the total task execution time for effective task migration. The proposed algorithm is useful to apply a proper migration process, and the simulation result shows that it efficiently reduces the total task execution time.

#### 5. Conclusion

A biosensor network is composed of many biosensor nodes with sensing, computation, and wireless communication capabilities to collect biological parameters of a human body. Biosensor nodes collect these parameters and relay them to other biosensor nodes or to the base station. Biosensor nodes have restricted resources due to their small size. Thus, the biosensor network is vulnerable to an external attack. When the malicious user attacks the system, some nodes have heavy overhead and the overall system performance will be degraded. We can solve this problem to apply a proper migration process.

In this paper, we propose the quantitative solution to figure out task execution time. Also, we compare the total task execution time applied to a migration process and a general method. The results of performance evaluation show that total execution time is affected by a cluster ratio and processing time between biosensor nodes. Therefore, it is needed to manage a cluster ratio and difference of processing time against an attack. Our proposed algorithm reduces the total task execution time by using a proper migration process. In this scheme, the method to calculate the processing time of biosensor nodes is not considered. Therefore, we are going to research to accurately calculate the processing time for more accurate simulation.

#### Acknowledgments

This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2010-0020210).

#### References

- Y. Zhu, S. L. Keoh, M. Sloman, and E. C. Lupu, “A lightweight policy system for body sensor networks,”
*IEEE Transactions on Network and Service Management*, vol. 6, no. 3, pp. 137–148, 2009. View at Publisher · View at Google Scholar · View at Scopus - I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A survey on sensor networks,”
*IEEE Communications Magazine*, vol. 40, no. 8, pp. 102–105, 2002. View at Publisher · View at Google Scholar · View at Scopus - Z. Hussain, M. P. Singh, and R. K. Singh, “Analysis of lifetime of wireless sensor network,”
*International Journal of Advanced Science and Technology*, vol. 53, pp. 117–126, 2013. View at Google Scholar - S. K. Dhurandher, S. Misra, A. Dhawan, and A. Tiwari, “Efficient solutions to various routing issues involved in mobile ad hoc bio-sensor networks: applying appropriate motion trajectories,”
*IET Communications*, vol. 3, no. 5, pp. 830–845, 2009. View at Publisher · View at Google Scholar · View at Scopus - S. Saleem, S. Ullah, and K. S. Kwak, “Towards security issues and solutions in Wireless Body Area Networks,” in
*Proceedings of the 6th International Conference on Networked Computing (INC '10)*, pp. 349–352, May 2010. View at Scopus - J. Xu, J. Wang, S. Xie, W. Chen, and J.-U. Kim, “Study on intrusion detection policy for wireless sensor networks,” in
*Proceedings of the International Journal of Security and Its Applications (IJSIA '13)*, vol. 7, pp. 1–6, 2013. - V. B. Balasubramanyn, G. Thamilarasu, and R. Sridhar, “Security solution for data integrity in wireless BioSensor networks,” in
*Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (ICDCSW '07)*, pp. 79–82, June 2007. View at Publisher · View at Google Scholar · View at Scopus - J. N. Al-Karaki and A. E. Kamal, “Routing techniques in wireless sensor networks: a survey,”
*IEEE Wireless Communications*, vol. 11, no. 6, pp. 6–27, 2004. View at Publisher · View at Google Scholar · View at Scopus - S. Lindsey, C. Raghavendra, and K. M. Sivalingam, “Data gathering algorithms in sensor networks using energy metrics,”
*IEEE Transactions on Parallel and Distributed Systems*, vol. 13, no. 9, pp. 924–935, 2002. View at Publisher · View at Google Scholar · View at Scopus - W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, “An application-specific protocol architecture for wireless microsensor networks,”
*IEEE Transactions on Wireless Communications*, vol. 1, no. 4, pp. 660–670, 2002. View at Publisher · View at Google Scholar · View at Scopus - R. Sheikhpour and S. Jabbehdari, “A two-level cluster based routing protocol for wireless sensor networks,” in
*International Journal of Security and Its Applications (IJSIA '12)*, vol. 45, pp. 19–30, 2012. - S. Yeo and H.-H. S. Lee, “Using mathematical modeling in provisioning a heterogeneous cloud computing environment,”
*Computer*, vol. 44, no. 8, Article ID 5740825, pp. 55–62, 2011. View at Publisher · View at Google Scholar · View at Scopus