A Coverage and Connectivity Method to Cluster Topology

in Wireless Sensor Networks

Ying-Hong Wang Chin-Yung Yu Ping-Fang Fu
Department of Computer Science & Information Engineering, Tamkang University, ROC
[email protected],[email protected], [email protected]

Abstract routing protocol algorithm. In Section 4 we evaluate the

algorithms via simulation. We summarize the results and
That is always an important topic to extend the whole discuss future research directions in Section 5.
lifetime in wireless network environment. How to make use
of the consumption of the limited energy in the sensor 2. Related Work
nodes? How many sensor nodes can establish an optimum
cluster? This paper proposes an optimum nodes number 、LEACH
2.1、
on clustering-based routing protocol called CCC A clustering scheme called Low-Energy Adaptive
(Coverage and Connectivity method to Cluster topology), Clustering Hierarchy (LEACH) [4] is proposed in that
which utilizes a node of its’ optimum coverage and employs the technique of randomly rotating the role of a
connectivity to transmit to another node and calculate the cluster head among all the nodes in the network. The
quantity of the nodes of an optimum cluster. In this article, operation of LEACH is organized in rounds where each
the CCC, which is distributed the energy dissipation of round consists of a setup phase and a transmission phase.
sensor nodes and average energy savings. The During the setup phase, the network will be separated
performance of CCC is then compared to clustering-based some clusters and will select a cluster head node in each
schemes such as Low-Energy Adaptive Clustering cluster randomly. During the transmission phase, the
Hierarchy (LEACH). Simulation results show that CCC cluster heads collect data from nodes within their
improves network lifetime and reduces whole average of respective clusters and apply data fusion before
energy consumption. forwarding them directly to the BS. LEACH provides
sensor networks with many good features, such as
clustering-based, two roles of sensor nodes. However, it
1. Introduction expenses much energy in cluster heads when forward data
packets to the BS directly.
Sensor networks [1] consist of a large number of tiny
sensors with limited power and computational capability. 、Coverage and Connectivity
2.2、
It applies to the inhuman handling work, such as detect the
humidity and temperature and collect messages in the
Coverage:Each sensor has their induction plane to
mountain area, monitor and data aggregation [2,3] in operate. A effective node can represent the relative
dangerous area, monitor the condition in the building and information in the induction plane.
monitor the enemy direction in the battleground, etc.
Connectivity: Each sensor node has the largest and
Therefore, for saving the energy consumption in d ire ct co m m uni c ati on pla ne t o c o nfi rm th e
transmission and solving the distance problem, if the connection.
sensor is far away from the sink, the sensor nodes need to
use multiple-hop relay to create the network routing. So Therefore, the sensor nodes only monitor and collect
the data and aggregated of sensor nodes can through by the information in the providing coverage and
multiple-hop routing to sink. Then each coverage range of connectivity [5]. That is to say, the sensor nodes cannot
sensor node will effect the energy dissipation. Therefore, monitor and collect the information outside the coverage
we will find the better at coverage range for sensor nodes. and connectivity.
In addition, combining the cluster concept and routing
protocol in the wireless network. Then, these conditions
3. Coverage with Connectivity: Necessary and
can infer the optimum cluster group. Under routing Sufficient Conditions
protocol in the wireless network, it helps to solve the To design the saving energy consumption of the sensor
limited energy of the sensor nodes. is an important struggle in wireless sensor network
This paper is organized as follows. In Section 2 we because it can upgrade the lifetime in the wireless network.
review related work and in Section 3 we will presents the Therefore, the sensor nodes use the high-density network

21st International Conference on

Advanced Information Networking and Applications Workshops (AINAW'07)
0-7695-2847-3/07 $20.00 © 2007
 to solve the problem of the lifetime in wireless network.
Phase2: The measure of the arc in four nodes(Figure
So, the sensor nodes of the high-density network also 3.1.2)
cause information overlapping in wireless network and
more energy consumption of each sensor node. We divide
the sensor node into the several clusters by taking the
cluster concept. The communication within the clusters is
by operating cluster header to lower the consumption
energy of the sensor nodes. It also upgrades the lifetime of
the wireless network. For solving the management of the Figure 3.1.2 Phase2
high-density sensor nodes in wireless network and lower

Phase3: The arc area among three nodes(Figure
the overlapping plane of the sensor nodes, we propose the 3.1.3)
solution. First, we propose a method of sensor node
coverage by way of the coverage density. This method can
lower the overlapping coverage [6] and solve the
overlapping node located in nodes. Therefore, we research
in the density of the sensor node scattering and also
calculate the optimum number of sensor nodes. For
managing effectively the sensor node and the transmission
quality, the cluster header is selected from each cluster Figure 3.1.3 Phase3
group under combining the sensor node. After the sensor
node in the same cluster collects the data, it can transmit
Phase4: The arc area outside intersection with three
the data through the cluster header. Finally, we propose a nodes(Figure 3.1.4)
routing protocol of the wireless sensor network. By this
protocol, the sensor node can efficiently complete
information transmission and keep up the transmission
quality under the cluster group.
、Grid Structure
3.1、
The paper is going to use grid structure to design. Also,
the range covered with 2 nodes is best with the radius of Figure 3.1.4 Phase4
node in Figure 3.1.1 shows the nodes in the coverage of 、The Nodes of Density in Grid Area
3.3、
the grid structure area.
We discuss the above nodes coverage with grid area
(D: represent length of grid). We use the different color to
represent the node group and calculate the coverage
(minus the overlapping area). Then, we calculate the area
covering from all nodes among grid area.
、The First Part of Coverage on Grid Area
3.3.1、
1. The blue nodes in D x D area as Figure 3.1.1：
Figure 3.1.1 Grid Structure
a. The calculation in vertical side each 2r distance has a
、Coverage Region
3.2、 node so each vertical side has D nodes.
2r
There are four phases of the coverage region in the
nodes: b. The calculation in horizontal side each 2r distance
has a node so each horizontal side has D nodes.

Phase1: CADB area occurring intersection 2r
simultaneously in two nodes. (See Figure 3.2.1)
2. There are ( D )² nodes.
2r

3. Each coverage of node is πr².

1
4. The measure of area is πD². ---------- (E)
4
Figure 3.1.1 Phase1
、The Second Part of Coverage on Grid Area
3.3.2、

21st International Conference on

Advanced Information Networking and Applications Workshops (AINAW'07)
0-7695-2847-3/07 $20.00 © 2007
 1. The red nodes in D x D area as Figure 3.1.1： D nodes.
2r
a. The calculation in vertical side each 2r distance has a
node so each vertical side has ( D )–1 nodes. 2. The measure of area in orange nodes is
2r
3 Dr – 1 1
b. The calculation in horizontal side each 2r distance
3 r² – Dπr + πr² ------------ (H)
2 6 3
has a node so each horizontal side has ( D )–1 nodes.
2r Therefore, the result from the total coverage of four
parts is as follows:
2. There are (( D )–1)² nodes.
2r The total coverage (I) is : (E) + (F) + (G) + (H) =
3. Each coverage of node is πr².
D² + ( 3 – 4)Dr – 1 Dπr + (4 – 2 3 ) r² – 1 πr²
a. A minus the intersection overlapping area of the blue 3 3
node.(arc area is 4r² - πr²)
、The Density in Grid Area
3.3.5、
4. The measure of area:
Then the density of grid area d = (I) / D² =
1
D² – 4Dr – D²π + Dπr + 4 r² – πr² -------- (F) r 2
4 1+ ( 3 − 4)r + π + 4 − 2 3 r² – r π ----- (J)
D 3D D 2
3D 2
、The Third Part of Coverage on Grid Area
3.3.3、
、The Optimum Cluster of Formula
3.3.6、
1. The black nodes in D x D area as Figure 3.1.1：
2
The area of each cluster is Z = dπc
a. The calculation in vertical side each 2r distance has
a node so each horizontal side has D nodes. • Z : is cluster of area
2r
• d : coverage range of nodes density in the D x D
b. The calculation in horizontal side each 2r distance
has a node so each horizontal side has D nodes. of area
2r • c : connected range of node
2. The measure area of the black nodes： Therefore the sensor node number of the optimum
a. The arc area intersection between the upper column, nodes of cluster [7] is
blue nodes and the lower column, black nodes is 2 2 2 2
N=( D ) / (dπc ) = ( D ) / (πc ) * (J)
{ 2 * [( D – 1) * ( 3 r² – 1 π r² )]} 2r 2r
2r 2 6
So, (K) = N =
b. The most right arc area intersection excluding the
4
upper and lower nodes is D
2 2 1 1
1 (D − 2 . 268 Dr + 0 . 536 r − D π r − π r 2 )π c 2 r 2

{ (( D ) – 2) * ( 3 r² – π r² )} 3 3
2r 2 6 、Calculation the Optimum Cluster of Nodes
3.4、
c. The most right arc area intersection of the upper Number
and lower nodes is In this section, we study required and sufficient
conditions for the grid network to node covering the unit
{ 2 * ( 1 π r² + 3 r² ) } area. Before presenting details of the proposed optimum
12 2
cluster of formula (K), we will express an example for this
3. The measure of area is section. When the edge of grid network is D = 100(m),
each node of cover radius is r = 2(m). So we will obtain
3 )Dr – 1 1 the best node quantity of the cluster for the value into this
( 3 r² – D π r + π r² ---- (G)
2 6 3 formula. At the same time, we discuss the different value
of the connectivity. The following example r represents
、The Forth Part of Coverage on Grid Area
3.3.4、 covering radius of the node, c is connecting range of the
1. The orange nodes in D x D area as Figure 3.1.1 node and N is the number of the node.
a. The calculation in vertical side( the leftest side) each
When c = r , then N = 213.22 (nodes)
2r distance has a node so each horizontal side has

21st International Conference on

Advanced Information Networking and Applications Workshops (AINAW'07)
0-7695-2847-3/07 $20.00 © 2007

When c = 2r , then N = 53.31 (nodes) 、Building a Cluster Topology
3.5.1、

When c = 3r , then N = 23.69 (nodes) First, we will build up the cluster topology with the

When c = 4r , then N = 13.33 (nodes) sensor nodes on the WSN. The way to set up this cluster
topology is as follows(Figure 3.5.1.1)：

When c = 5r , then N = 8.53 (nodes) ………

To building the cluster by regard equilateral triangle,
Moreover related cluster topology uses the regard
which an edge length is 4 (namely the cluster of
equilateral triangle of characteristic to show the cluster
regard equilateral triangle there is 5 nodes and it has
group in WSN. The regard equilateral triangle have equal
15 nodes).
than edges and the distance of max is edge length. So,
when the edge length of the equilateral triangle is r, it  The first step is to set up the upper right 1st
shows that there can be the distances of length of radius 3 node of the initial value =1.
nodes. And when the edge length of the equilateral
 Accumulating serial number value to the left
triangle is 2r, it shows that there can be the distances of
down to every node value from right top in
length of radius 6 nodes. Therefore, depending on the
order.
regard equilateral triangle rule, we can receive the quantity
of the following nodes.
To divide the equal nodes to each cluster.

When the regard equilateral triangle of edge is r,  Each cluster is at most 15 nodes.
then N = 3 (nodes)

The rest nodes are fewer than 15 nodes and still

When the regard equilateral triangle of edge is 2r, become one cluster.
then N = 6 (nodes)

Reset the serial number for nodes in each one cluster

When the regard equilateral triangle of edge is 3r, again.
then N = 10 (nodes)
 From right to left

When the regard equilateral triangle of edge is 4r,
 From top to down
then N = 15 (nodes)

When the regard equilateral triangle of edge is 5r,
then N = 21 (nodes) ………..
Regarding the above results, we find each cluster that
the nodes number is 213.22 upon formula (K) condition
that the c is equal to r. But the edge length of the
equilateral triangle is r then the nodes number is 3.
However, the nodes number is not correspond both. Figure 3.5.1.1 Building a Cluster Topology
While c = r、c = 2r and c = 3r are also not correspond at 、Routing Protocol
3.5.2、
the nodes number. Until the c = 4r, it needs 13.33 nodes.
The main goal of this section is to show that a wireless
Then corresponds the equilateral triangle length of edge is
sensor network has been routing and data fusion. The
4r, the suitable for nodes quantity is 15. Because the both
messages are transmitted to each cluster head. These
regard equilateral triangle and formula of nodes number
cluster heads were elected by serial number of nodes. In
are almost equal. Therefore, we find the c = 4r can be to
the previous section, the cluster was built by the serial
accord with the nodes number. But other node is counted
number nodes. Therefore, we describe the algorithm of
and differed greatly.
routing protocol as Figure 3.5.2.1. It explains as follows
、CCC of Algorithm
3.5、 to mainly divide into 5 steps.

About the CCC of algorithm will divide into 3 parts to 1. Each sensor node of cluster set as cluster head for
prove. At first, it builds about the cluster topology. It is initial value.
utilized the formula to make optimal node number. The 2. Each cluster head is transmitted to the next cluster
cluster topology uses the characteristic of the regard head that regarded as this cluster in accordance with
equilateral triangle to institute the formation. Furthermore, the same node serial number.
we will discuss the 2nd part that the routing protocol
transmit to sink of messages from nodes of gathers or 3. The cluster head of the last cluster is transmitted the
events. Nodes dispersed in WSN environment will make messages to base station.
the topography or the limited energy cause to fault. For 4. Then the cluster of cluster head is selected by node
this fault tolerance will be discussed in the last part. serial number and accumulates 1.

21st International Conference on

Advanced Information Networking and Applications Workshops (AINAW'07)
0-7695-2847-3/07 $20.00 © 2007
 5. Jump the step (2) until node energy is dissipated. E R (k) = E Rx k (2)

Given a threshold transmission distance of ro, the

free-space model is employed when r≦ro , and the
two-ray model is applied for cases where r> ro . Using
these two models, the energy required by the transmit
E
amplifier amp (r) is given by
2
ε FS r ， r ≦ ro (3)
E amp ( r) = 4
Figure 3.5.2.1 Routing Figure 3.5.3.1 ε TR r ， r ＞r o
Fault Tolerance
、Fault Tolerance
3.5.3、 Where ε FS and ε TR denote transmit amplifier parameters
corresponding to the free-space and the two-ray models,
Therefore, we describe the algorithm of routing
respectively, and ro is the threshold distance given by
protocol as Figure 3.5.3.1. It explains as follows to mainly
divide into 3 steps. ε
ro = FS (4)
1. Elected as new cluster head by the next serial number. ε TR

2. Elected as new cluster head while transmitting to the 、Performance Evaluation

4.3、
next cluster and remain original serial number of cluster
head. To evaluate the performance of CCC, we simulated the
different nodes of number from cluster topology of edge
3. Following Step (1)(2), the messages transmitting from
length. Compared with 4 different cluster topology nodes
cluster head to base station.
number, namely each cluster have 15 nodes(Cluster5)、28
、Simulation Experiments
4、 nodes(Cluster7) 、 45 nodes(Cluster9) and 66
nodes(Cluster11). To compare simultaneously 2 parts
、Parameter
4.1、 namely have the average energy dissipation and number of
The same set of parameters used in all experiments nodes alive.
throughout the article as the Table1. The simulate result in Figure 4.3.1 and Figure 4.3.2.
From result show the average energy dissipation reality
Table1 Simulation parameters
when Cluster5 and Cluster9 have better then Cluster7 and
Cluster11. And in Cluster5, which had exhausted of
energy until 200 rounds, but in Cluster9 actually only 198
rounds and Cluster7 actually only 189 rounds and
Cluster11 actually only 187 rounds. Therefore, Cluster5
has a best from these different of cluster topology. In alive
of nodes part, also have same simulated result. The results
of cluster5 are better then other clusters. The Cluster7 and
Cluster11 will drop down while the rounds are 60. Then
Cluster5 and Cluster9 shows drop gradually. And the
Cluster5 has a best from these different of cluster topology.
So, the both simulate result have accord with our
expectancy.
Otherwise we will compare Cluster5 of CCC and
LEACH in these 2 parts. About the LEACH of
、The Radio Model
4.2、 environment will be create configure under grid. In
In our simulation experiments analysis, we use the radio average energy dissipation, which the LEACH had
model[8] to discussed. The transmit and receive energy completed consumptive energy about 161 rounds from
costs for the transfer of a k-bit data message between two cluster head transmit information to sink as Figure 4.3.3.
nodes separated by a distance of r meters is given by But the Cluster5 of CCC have 200 rounds to transmit
equations 1 and 2, respectively. information. Before the rounds are about 20, they have
same alive of number nodes. But the rounds over 20, the
ET (k, r) = ETx k + E amp ( r)k (1) LEACH will cause to drop down and CCC is slow down.

21st International Conference on

Advanced Information Networking and Applications Workshops (AINAW'07)
0-7695-2847-3/07 $20.00 © 2007
 In CCC of nodes alive has completed dissipation energy 5. Conclusions
still 200 rounds. Then LEACH is only 160 rounds. So the
nodes alive are also present the CCC better then LEACH We propose the CCC routing have saving energy in the
as Figure 4.3.4. Therefore, we propose the CCC method limited energy of nodes. For connecting the cluster
can preserve the energy, the efficiency, and the concept, we discuss the effective coverage among the
fault-tolerant aspect has the good contribution. nodes and design the average density in the grid area. We
can calculate the optimum nodes number from the
coverage range. Each cluster was selected the cluster head
by serial number of nodes. And the cluster head transmit
and collect information efficiently in the wireless network.
The cluster head transmit data to sink by through next
cluster head of same serial number. At same time, the
CCC routing protocol can balance dissipation energy of
sensor nodes in the wireless network. The simulate result
shows these novel routing protocol have performance in
saving energy.
Figure 4.3.1 A comparison of CCC’s average energy We would study the challenges and performance when
dissipation with other cluster protocol different sensors and random design the nodes in wireless
network.

References
[1]. Edgar H. Callaway, “Wireless Sensor Networks,
Architectures and Protocols”
[2]. J. Heidemann, F. Silva, C. Intanagonwiwat, R. Govindan,
D. Estrin, and D. Ganesan, “Building efficient wireless
sensor networks with low-level naming,” in Proceedings
of the Eighteenth ACM symposium on Operating
Systems Principles [21], Oct 2001, pp. 146-159.
Figure 4.3.2 A comparison of CCC’s system lifetime
[3]. W. Heinzelman,“Application-Specific Protocol
with other cluster protocol Architectures for Wireless Networks,” Ph.D. thesis,
Massachusetts Institute of Technology, 2000.
[4]. Heinzelman, W.R. and Chandrakasan, A. and
Balakrishnan, H. System Sciences, 2000. Proceedings of
the 33rd Annual Hawaii International Conference, 4-7
Jan. 2000 Pages: 10 pp. vol.2
[5]. Rajagopal Iyengar, Koushik Kar, Suman Banerjee,
“Low-coordination Topologies For Redundancy In
Sensor Networks”, May 2005 Proceedings of the 6th
ACM international symposium on Mobile ad hoc
networking and computing MobiHoc '05
[6]. Ozgur Sanli, H.; Hasan Cam;” Energy efficient
differentiable coverage service protocols for wireless
Figure 4.3.3 A comparison CCC and LEACH of
sensor networks” Pervasive Computing and
average energy dissipation Communications Workshops, 2005. PerCom 2005
Workshops. Third IEEE International Conference on
8-12 March 2005 Page(s):406 – 410
[7]. Tarun Banka, Gagan Tandon, Anura P. Jayasumana:
“Zonal Rumor Routing for Wireless Sensor Networks”
Proceedings of the International Conference on
Information Technology: Coding and
Computing(ITCC’05)
[8]. Omar Moussaoui Mohamed Naïmi. ” A Distributed
Energy Aware Routing Protocol for Wireless Sensor
Networks” October 2005 Proceedings of the 2nd ACM
international workshop on Performance evaluation of
Figure 4.3.4 A comparison CCC and LEACH of wireless ad hoc, sensor, and ubiquitous networks
PE-WASUN’05
system lifetime

21st International Conference on

Advanced Information Networking and Applications Workshops (AINAW'07)
0-7695-2847-3/07 $20.00 © 2007