ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS

AMNA SANA HIRA RASAB YUSRA FAROOQ KINZA FAROOQ BTE-SP08-009 BTE-SP08-022 BTE-SP08-060 BTE-SP08-070

November 2011

Department of Electrical Engineering

COMSATS INSTITUTE OF INFORMATION TECHNOLOGY

LAHORE PAKISTAN

Contents
1. INTRODUCTION ........................................................................................................................................ 2 2. K-MEANS................................................................................................................................................... 3 3. GOALS OF THE PROJECT ........................................................................................................................... 4 4. STRATEGY EMPLOYED FOR THE PROJECT ................................................................................................ 4 5. OBJECTIVES COMPLETED.......................................................................................................................... 5 6. NETWORK DEVELOPMENT MODEL .......................................................................................................... 5 7. METHODOLOGY........................................................................................................................................ 6 8. CODES ....................................................................................................................................................... 8 9. 10. 11. 12. Cluster configuration using K-means algorithm: ............................................................................. 8 Intra cluster energy consumption: .................................................................................................. 8 Cluster head aggregation energy consumption and Average node energy consumption: .......... 9 SIMULATION RESULTS ........................................................................................................................ 10 OBJECTIVES TO COMPLETE............................................................................................................. 11 DIFFICULTIES IN WORK ................................................................................................................... 11 REFERENCES .................................................................................................................................... 12

ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS

Page 1

1. INTRODUCTION:

Wireless Sensor Networks are widely used in remote monitoring that may be utilized in several real-life scenarios to assess, ensure and improve health of patients in hospitals, performance and stamina of players on fields and soldiers on battle fields etc. Wireless sensor networks (WSNs) are organized by wireless nodes for monitoring the existing conditions in a specific area. Sensor nodes consists of three basic devices: a sensor that observes changes in the surroundings, a processor that handles the sensing data, and a wireless transmitter/receiver set that sends processed data to a base station (BS) that collects, analyzes and sends the sensing data to an external network . Generally, the energy efficiency of sensor nodes is one of the most critical issues for sensor networks due to their restricted energy resources and communication range. Additionally, it is difficult to replace or recharge their batteries. Therefore, in order to reduce the energy consumption of sensor nodes, sensor networks must use energy efficiently, as well as use some scalable clustering technique as a method for organizing the networks. A clustering method is a way to divide networks into local clusters which must consider load balancing and energy distribution of sensor nodes in order to prolong network lifetime. Sensor nodes should, using clustering methods, use many-to-one communication for transmitting the sensing data to the cluster-heads or base station and adopt multi-hop communication for packet relay contrary to existing work [2], since nodes with a restricted communication radius cannot directly communicate with nodes outside this radius [3]. The cluster-head is in charge of transmitting sensing data from its own local cluster, as well as collecting and compressing multiple data before sending them to a sink node. They consume more energy than other sensor nodes as a result of these additional tasks. Therefore, it is desirable that all sensor nodes should take on the role of a cluster-head, equally and randomly. Based on the number of cluster-heads, the size of a local cluster may change. It is important to construct adaptive clusters because the number of cluster-heads has an effect on the energy consumption of the cluster-head and the sending of member nodes data. As more cluster-heads become available and the smaller the size of a local cluster, the smaller the amount of packets required to be sent will be. With additional cluster-heads, however, there is an increase in the number of packets needed for cluster-heads to communicate to a sink or base station, therefore increasing the energy consumption as a result of clustering. In this paper, we determine the energy variation rate of whole sensor networks based on the energy consumption of a local cluster (intra-cluster) and between local clusters (inter-cluster) using equations. Further, based on this result, we propose an optimal number of cluster-heads in wireless sensor networks based on multihop routing. Since individual nodes data in a sensor network are often correlated, the end user does not require all the redundant data, but rather some high-level fraction of the data that accurately describes the events occurring in the environment. To achieve this, LEACH [4] allows all data from nodes within the cluster to be processed locally, reducing the data set that needs to be transmitted to the end user. For the development of LEACH, there are some assumptions about the sensor nodes and the underlying network model. For sensor nodes, all nodes can transmit with enough power to reach the BS if needed, that the nodes can use power control to vary the amount of transmission power, and that each node ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS Page 2

has the computational power to support different MAC protocols and perform signal processing functions. For the network, nodes can always have data to send to the end user and nodes located close to each other have correlated data. In the LEACH algorithm, the sensor nodes belong to each local cluster. All member nodes send sensing data to their own cluster head (CH), and the CHs send the aggregated data to the sink node after collecting sensing data from their own member nodes and processing them. In LEACH, the transmission method of nodes is based on single-hop communication. That means that the transmission method between the CH and member nodes of the intra-cluster and between the CHs and a sink node is single-hop communication. This communication method has been used in many clustering algorithms for WSNs. In LCA [5,6] and adaptive clustering [7], the CH can directly connect to all nodes in its cluster like LEACH. CLUBS [8] forms the clusters with a maximum of two hops, regardless of network size. Besides, the other clustering methods which are revised and extended versions of LEACH such as LEACH-C [4], HEED [9], EAP [10] focus on cluster head selection for energy efficiency. The communication range of sensor nodes is based on IEEE 802.15.4 (LR-WPAN) which is one of the transmission standards for WSNs. IEEE 802.15.4 typically extends up to 10 m in all directions [11]. However, the above clustering algorithms did not adopt realistic communication radius and multi-hop communication method in intra- and inter-clusters [12]. After constructing clusters, the CHs in local clusters have the authority to operate data transmission during a communication between member nodes. As a local cluster size and the distance between a CH and a sink might be bigger than the restricted radius, any communication should be based on a multi-hop method and is thus affected by the number of cluster heads. That means that if the CHs are increased, the distance between a CH and member nodes is decreased in intra-clusters and the distance between a CH and a sink is increased in inter-clusters. To increase the distance is the same as increasing the number of required relay packets, so we need to know the optimal number of clusters for energy-efficient communication.

2. K-MEANS: K-means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. It is a method of grouping items into k groups (where k is the number of pre-chosen groups). It is similar to the expectation-maximization algorithm for mixtures of Gaussians in that they both attempt to find the centers of natural clusters in the data as well as in the iterative refinement approach employed by both algorithms. The grouping is done by minimizing the sum of squared distances (Euclidean distances) between items and the corresponding centroid. A centroid is "the center of mass of a geometric object of uniform density", though here, we'll consider mean vectors as centroids. K-Means is a rather simple but well known algorithm for grouping objects, clustering. All objects need to be represented as a set of numerical features. In addition the user has to specify the number of groups (referred to as k) he wishes to identify. Each object can be thought of as being represented by some feature vector in an n dimensional space, n being the number of all features used to describe the objects to cluster. The algorithm then randomly chooses k points in that vector space, these points serve as the initial centers of the clusters. Afterwards all objects are each assigned to center they are closest to.

ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS

Page 3

Usually the distance measure is chosen by the user and determined by the learning task. After that, for each cluster a new center is computed by averaging the feature vectors of all objects assigned to it. The process of assigning objects and re-computing centers is repeated until the process converges. The algorithm can be proven to converge after a finite number of iterations.

3. GOALS OF THE PROJECT:

Explore the effect of the number of cluster heads on the energy efficiency of wireless sensor networks. Explore the effect of multi-hop routing on the energy efficiency in wireless sensor networks. Presenting a detailed comparison with static clustering. Analyzing the wireless sensor network with mobile nodes by varying the residual energy, network density, and transmitter/receiver characteristics.

4. STRATEGY EMPLOYED FOR THE PROJECT:

Clustering scheme (K-means)

Round base simulation

Actual implementation

Network Development Model

Simulation framework

ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS

Page 4

5. OBJECTIVES COMPLETED: Literature review. We have explored the effect of number of cluster heads and resulting multi-hop routing on energy efficiency in wireless sensor networks. We have found the effect of increasing the number of clusters on the number of relay packets, cluster head energy consumption and node energy consumption in both intra and inter clusters. We have acquired an optimal number of cluster heads based on changing the number of cluster heads and the associated consumed energy.

6. NETWORK DEVELOPMENT MODEL:

Parameter Network size Sensor nodes Radius of sensor nodes Data packet

Value 100 100 (100 400 5m 525 bytes 50 nJ/bit 10 pJ/bit/ 0.021 mJ

Initial Energy

1J

Table.1: System parameter for network configuration.

ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS

Page 5

7. METHODOLOGY:

For sending a

(bit) message to a node with a distance of (

(meters) : (1.a)

, is the receiving energy of a radio beam. We set up a distance d to R for multi-hop based clustering: ( ( (2) (1)

Radius of a local cluster, a:

(3)

, the average number of nodes with

[ ( ]

hop counts is: (4)

The average number of nodes with (

hop counts,(

is:

{ (

[(

] }

(5)

The number of relay packets can be determined by dividing Equation (4) by Equation (5). With hop counts in a local cluster, the average number of relay packets, is:
(

(6)

The average energy consumption of nodes with

hop counts,

, is to add packet , of packet relay energy.

transmission energy, to own packet transmission energy, This equation can be represented as:

ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS

Page 6

[ (

( )
(

( (

] )

( (7)

The average energy consumption of a cluster head,

, can be represented as:

(8)

The average distance between a cluster-head and a sink, , is:

( )

(9)

As the number of relay packets is also increased in proportion to , in inter-clusters, the average number of relay packets, , is: (10)

The average energy consumption between a cluster-head and a sink,

, is as follows:

(11)

Based on the clustering energy equations, we can find the average energy consumption of member nodes, , by using the following added equations:

(12)

ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS

Page 7

8. CODES:

Cluster configuration using K-means algorithm:

X = [randn(200,2)+ones(200,2); randn(200,2)-ones(200,2)]; opts = statset('Display','final'); [cidx, ctrs] = kmeans(X, 10, 'Distance','city','Replicates',5, 'Options',opts); plot(X(cidx==1,1),X(cidx==1,2),'.',X(cidx==2,1),X(cidx==2,2),'.',X(cidx==3,1),X(cidx==3,2),'.',... X(cidx==4,1),X(cidx==4,2),'.',X(cidx==5,1),X(cidx==5,2),'.',X(cidx==6,1),X(cidx==6,2),'.',... X(cidx==7,1),X(cidx==7,2),'.',X(cidx==8,1),X(cidx==8,2),'.',X(cidx==9,1),X(cidx==9,2),'.',... X(cidx==10,1),X(cidx==10,2),'.',ctrs(:,1),ctrs(:,2),'kx','markersize',6,'linewidth',2) hold on plot(ctrs(:,1),ctrs(:,2),'ko','markersize',6,'linewidth',2)

Intra cluster energy consumption:

%N=number of sensor nodes %m=number of cluster heads %n=number of hops %l=the energy consumption of a transmitterreciever %k=bits transferred %R=possible communication radius %E_relay=packet relay energy %E_elec= transmission/receiving energy %E_amp= energy consumption of transmitter amplifier %E_tx=transmitting energy %E_rx=receiving energy %E_mem_intra=intra cluster energy %E_mem_inter=inter cluster energy %k_n_inter=average number of relay packets (inter-cluster) %k_n_intra=average number of relay packets (intra-cluster) %s=average distance between cluster head and sink %A=network size (one dimension) %E_member=average energy consumption of member nodes %E_ch=average energy consumption of a cluster head n=6; A=100; N=100;

R=5; k=4200; E_amp=10e-12; E_agg=0.021e-3; E_elec=50e-9; for m=1:2:120; E_rx=k*E_elec; E_tx=k*E_elec + k*E_amp*R^2; l=E_rx; u=k*E_amp; a=(A)/(sqrt(m*pi)); %radius of a local cluster E_ch=E_agg*(N/m)+(l+u*R^2); nth_avg_node=N*((pi*a^2)pi*(n*R)^2)/(pi*a^2*m); nminus1_avg_node=N*((pi*(n*R)^2)-pi*((n1)*R)^2)/(pi*a^2*m); k_n_intra=nth_avg_node/nminus1_avg_node; E_relay=((l+u*R^2)+l); E_mem_intra=E_relay*k_n_intra + E_tx; s=(sqrt(2)*A+2*R)/2; k_n_inter=s/R; E_mem_inter=E_relay*k_n_inter; E_member=E_mem_inter+E_mem_intra; hold on plot(m,E_mem_intra,'.') xlabel('The number of cluster heads') ylabel('intra cluster energy') end

ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS

Page 8

Cluster head aggregation energy consumption and Average node energy consumption:

%N=number of sensor nodes %m=number of cluster heads %n=number of hops %l=the energy consumption of a transmitterreciever %k=bits transferred %R=possible communication radius %E_relay=packet relay energy %E_amp= energy consumption of transmitter amplifier %E_tx=transmitting energy %E_rx=receiving energy %E_mem_intra=intra cluster energy %E_mem_inter=inter cluster energy %k_n_inter=average number of relay packets (inter-cluster) %k_n_intra=average number of relay packets (intra-cluster) %s=average distance between cluster head and sink %A=network size (one dimension) %E_member=average energy consumption of member nodes %E_ch=average energy consumption of a cluster head n=6; A=100; N=400; R=5; k=4200; E_elec=50e-9; E_amp=10e-12;

E_agg=0.021e-3; for m=1:4:120 E_rx=k*E_elec; E_tx=k*E_elec + k*E_amp*R^2; l=E_rx; u=k*E_amp; a=(A)/(sqrt(m*pi)); %radius of a local cluster E_ch=E_agg*(N/m)+(l+u*R^2); nth_avg_node=N*((pi*a^2)pi*(n*R)^2)/(pi*a^2*m); nminus1_avg_node=N*((pi*(n*R)^2)-pi*((n1)*R)^2)/(pi*a^2*m); k_n_intra=nth_avg_node/nminus1_avg_node; E_relay=((l+u*R^2)+l); E_mem_intra=E_relay*k_n_intra + E_tx; s=(sqrt(2)*A+2*R)/2; k_n_inter=s/R; E_mem_inter=E_relay*k_n_inter; E_member=E_mem_inter+E_mem_intra; subplot(1,2,1) hold on plot(m,E_agg,'.') xlabel('The number of cluster heads') ylabel('Cluster head aggregation energy consumption') subplot(1,2,2) hold on bar(m,E_member) xlabel('The number of cluster heads') ylabel('Energy consumption') end

ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS

Page 9

9. SIMULATION RESULTS:

Fig.1: Cluster configuration using K-means algorithm

Fig.2: Intra Cluster Energy Consumption

ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS

Page 10

Fig.3: Cluster Head Aggregation Energy Consumption

Fig.4: Average Node Energy Consumption

10. OBJECTIVES TO COMPLETE: We are trying to collect more statistics on efficient multi-hop strategies to increase the network time to live. A detailed comparison with static clustering and wireless sensor network with mobile nodes by varying residual energy, network density, and transmitter/receiver characteristics. Application based development of the project.

11. DIFFICULTIES IN WORK: In so many clustering schemes proposed for wireless communication, it was very difficult to come to a conclusion that which clustering scheme is best. Finally, we reached the conclusion that each clustering scheme uses different constraints, so we cannot really say which one is better than the other. Another problem which we are facing is that the real time simulations of energy models never give proposed results. They always differ, but give a slight idea of the effect they produce.

ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS

Page 11

12. REFERENCES: Multi-Hop Routing-Based Optimization of the Number of Cluster-Heads in Wireless Sensor Networks by Choon Sung Nam, Young Shin Han and Dong Ryeol Shin. Sensors 2011, 11, 28752884; doi:10.3390/s110302875. Mhatre, V.; Rosenberg, C. Homogeneous vs. Heterogeneous Clustered Sensor Networks: A Comparative Study. In Proceedings of IEEE International Conference on Communications, Paris France, 2024 June 2004; Volume 6, pp. 3646-3651. Toumpis, S.; Goldsmith, A.J. Capacity Regions for Wireless Ad Hoc Networks: Wireless Communications. IEEE Trans. Wire. Commun. 2003, 2, 736-748. Heinzelman, W.B.; Chandrakasan, A.P.; Balakrishnan, H. An Application-Specific Protocol Architecture for Wireless Microsensor Networks. IEEE Trans. Wire. Commun. 2002, 1, 660-670. Baker, D.J.; Ephremides, A. The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm. IEEE Trans. Commun. 1981, 29, 1694-1701. Baker, D.J.; Ephremides, A.; Flynn, J.A. The Design and Simulation of a Mobile Radio Network with Distributed Control. IEEE J. Select. Area. Commun. 1984, 2, 226-237. Basagni, S. Distributed Clustering Algorithm for Ad-Hoc Networks. In Proceedings of the International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), Fremantle, Australia, 2325 June 1999. Nagpal, R.; Coore, D. An Algorithm for Group Formation in an Amorphous Computer. In Proceedings of the 10th International Conference on Parallel and Distributed Systems (PDCS98) Las Vegas, NV, USA, 2831 October 1998. Younis, O.; Fahmy, S. HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks. IEEE Trans. Mobile Comput. 2004, 3, 366-379. Liu, M.; Cao, J.; Chen, G.; Wang, X. An Energy-Aware Routing Protocol in Wireless Sensor Networks. Sensors 2009, 9, 445-462. Gutierrez, J.A.; Naeve, M.; Callaway, E.; Bourgeois, M.; Mitter, V.; Heile, B. IEEE 802.15.4: A Developing Standard for Low-Power Low-Cost Wireless Personal Area Networks. IEEE Network 2001, 15, 12-19. Iwanicki, K.; van Steen, M. Multi-Hop Cluster Hierarchy Maintenance in Wireless Sensor Networks: A Case for Gossip-Based Protocol. Lect. Note. Comput. Sci. 2009, 5432, 102-117. K-Means Like Minimum Mean Distance Algorithm for wireless sensor networks by Wei Peng; Edwards, D.J.; Dept. of Eng. Sci., Univ. of Oxford, Oxford, UK. Computer Engineering and Technology (ICCET), 2010 2nd International Conference. Physical Layer Driven Protocol and Algorithm Design for Energy Efficient Wireless Sensor Networks by Eugene Shih, Seong Hwan Cho, Nathan Ickes, Rex Min, Amit Sinha, Alice Wang, Anantha Chandrakasan Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge, MA, USA 021394307.

ENERGY EFFICIENT MULTIHOP COMMUNICATION IN WIRELESS BODY AREA NETWORKS

Page 12