Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Abstract — This study proposes a scheme for Self- II. PROPOSED MANAGEMENT ROTOCOLLS
Organization Management Protocols of higher-level nodes to This study implements the proposed management protocols
contest member nodes with multi-hop form hierarchical including Cover Clustering Mechanism for constructing
clusters, introduce the “20/80 Rule” for determining the ratio cluster headers to solve the problems of clustering and
of headers to member nodes, and develop a new cluster-based broadcast storm by cover contest, the Inter-cluster Routing
routing protocol that integrates the inter-cluster on-demand Algorithm and Intra-cluster Routing Algorithm to provide low
routing and the intra-cluster table-driven routing applied in
cost communications between clusters.
the Sensor Networks for further consumer applications. 1
The proposed mechanism reduces the number of
Index Terms — Wireless Sensor Networks, Cluster, Self-Organization, management nodes in a large-scale sensor network. One of the
Routing. Protocols best methods is to develop hierarchical architecture and apply
the 20/80 rule. Figure 1 illustrates the architecture of clustering
I. INTRODUCTION networks.
Wireless Sensor Network is one promising application on
wireless ad hoc networks. Sensor Network can monitor
ambient condition such as temperature, sound, light and others.
Information is collected from many sensor devices for further
consumer application in the Sensor Network [1]. The
hierarchical management architecture can be applied to handle
numerous sensor nodes [2]-[3]. The lower-level nodes are
managed and organized by the higher-level nodes by using
20/80 rules. Controlling the top-level nodes can decrease the
costs of managing nodes and the communication among them.
The 20/80 rule is a well-known “leadership shorthand term”,
Fig.1: The Architecture of Clustering Networks.
originates from Vilfredo Pareto, who discovered a common
phenomenon: about 80% of the wealth in most countries was Figure 2 introduces the architecture of self-organization
controlled by a consistent minority around 20% of the people management network by Minimum Hop Count (MHC) cover
in most countries. Various routing protocols have been algorithm. After constructing the clustering network, this paper
proposed in ad hoc networks [4]-[7], but are not exactly proposes cluster-based routing algorithm into two aspects:
suitable for Sensor Network because of the scalability. Those intra-cluster routing and inter-cluster routing.
routing protocols for ad hoc networks can be divided into two
categories: table-driven and on-demand routing protocols. The
table-driven routing mechanisms discover and maintain
routing tables even when no usage of network; in on-demand
routing mechanisms, the routes are discovered only when it is
need by the source node. These two routing categories have
their own merits and demerits [8]. This paper proposes a new
cluster-based routing protocol that combines the on-demand
routing in inter-cluster and the table-driven routing in intra-
cluster to be suited for the environment of Sensor Networks.
Fig. 2: The Architecture of Self-organization Network for Wireless
Sensor Networks
1
Yao-Chung Chang is with the National Taitung University, Taitung, This management protocol construct the intra-cluster
Taiwan, R.O.C (e-mail: ycc@nttu.edu.tw) routing with table-driven routing mechanisms similar to
Zhi-Sheng Lin is with the National Dong Hwa University, Hualien,
Taiwan, R.O.C. (e-mail: zlsin@mail.ndhu.edu.tw)
destination sequence distance vector (DSDV). The source
Jiann-Liang Chen is the Chair of Computer Science and Information node broadcasts a route query packet to nodes until the border
Engineering Department, National Dong Hwa University, Hualien, Taiwan, nodes in adjacent clusters around the local cluster receive it.
R.O.C. (e-mail: lchen@mail.ndhu.edu.tw)
Authorized licensed use limited to: Thinagaran Perumal. Downloaded on March 19,2020 at 12:17:54 UTC from IEEE Xplore. Restrictions apply.
76 IEEE Transactions on Consumer Electronics, Vol. 52, No. 1, FEBRUARY 2006
Authorized licensed use limited to: Thinagaran Perumal. Downloaded on March 19,2020 at 12:17:54 UTC from IEEE Xplore. Restrictions apply.
Y.-C. Chang et al.: Cluster Based Self-Organization Management Protocols for Wireless Sensor Networks 77
Authorized licensed use limited to: Thinagaran Perumal. Downloaded on March 19,2020 at 12:17:54 UTC from IEEE Xplore. Restrictions apply.
78 IEEE Transactions on Consumer Electronics, Vol. 52, No. 1, FEBRUARY 2006
B. INTER-CLUSTER ROUTING
The relation between clusters can be extracted from local
routing table while the next hop nodes in adjacent clusters
from the cluster edge are including in it. It is the foundation of
constructing inter-cluster routing. In Fig. 4, the relation
between C3 (cluster 3) and its adjacent clusters is the lines in
red and the C6 is a dotted line in blue. Fig. 9 Inter-cluster routing algorithm
This method acquires the inter-cluster routing by For example (as shown in Fig. 10), the node N32 in C3 want
exchanging the relationship between clusters. To perform the to communicate with the node N52 in C5, but the route to N52
inter-cluster route discovery when the route is demanded can or C5 can’t be found in intra-cluster routing table of N32. The
reduce the overhead of building and maintaining Inter-cluster inter-cluster RREQ packet will be sent to the border nodes,
routing. The on-demand routing protocols in ad hoc network like N66, N64, N41, N13 and N20, for obtaining the adjacent
like AODV and DSR used to utilize flooding as route cluster’s intra-cluster routing. The inter-cluster RREQ will be
discovery method, since there are no previous routes to guide cached in the node which received it and not be removed until
the packets to destination. Nevertheless, it will increase not the expired time is due. When node receives the inter-cluster
only route discovery latency but also the overhead depending RREQ with the same source and sequence number, the RREQ
on the range of flooding. This work proposes a new routing packet will be dropped. If the route can’t be found in the
mechanism to solve this problem. When the demand for inter- border node’s intra-cluster routing table, the border node will
cluster route occurs, the source node sends the inter-cluster send the inter-cluster RREQ again to other border nodes. This
route request packet (RREQ) in unicast mode to the border procedure is repeated as required till it reaches the edge of
nodes to acquire the adjacent cluster’s intra-cluster routing sensor network. In this case, the path to C5 can be found from
information. With these, the inter-cluster route can be created. the intra-cluster routing table of border nodes in C6 and the
The algorithm is depicted in Fig. 9. border node will transmit inter-cluster route reply (RREP)
packet back to the source node; the route to C5 will be added
into the intra-cluster routing table of the nodes located on the
reverse path of inter-cluster RREP traveled. That is, C3 got the
path to C5 by passing C6; and further, if the link between C3
and C6 is broken caused by nodes failure or other irresistible
reasons, the route from C3 to C5 will be reconstructed along
the path through C4, C6.
Authorized licensed use limited to: Thinagaran Perumal. Downloaded on March 19,2020 at 12:17:54 UTC from IEEE Xplore. Restrictions apply.
Y.-C. Chang et al.: Cluster Based Self-Organization Management Protocols for Wireless Sensor Networks 79
3DFNHW'HOLYHU\5DWLR
To evaluate the performance of the Cluster-Based Border
Gateway routing Protocol (CB-BGP), the comparison with two
existing well-known protocols, AODV and DSDV, is archived '65
by using these metrics of throughput, average latency, control
$2'9
overhead and the packet delivery ratio for performance
&%%*3
comparison. The packet delivery ratio is the rate between
numbers of data packets received by the destination and the
number sent by the source. The average latency is the average
delay time of a packet between transmitting from the source
1XPEHURI1RGH
and receiving at the destination. Routing overhead is the total
number of packets generated during discovering routing paths. Fig. 11 Packet delivery ratio with different network size
Throughput, expressed in data units per period of time, is the
number of bits passing through a data communication system.
&RQWUR2YHUKHDGSNW
Authorized licensed use limited to: Thinagaran Perumal. Downloaded on March 19,2020 at 12:17:54 UTC from IEEE Xplore. Restrictions apply.
80 IEEE Transactions on Consumer Electronics, Vol. 52, No. 1, FEBRUARY 2006
Authorized licensed use limited to: Thinagaran Perumal. Downloaded on March 19,2020 at 12:17:54 UTC from IEEE Xplore. Restrictions apply.