Beruflich Dokumente
Kultur Dokumente
Zhanyang Zhang
Computer Science Department
College of Staten Island / City University of New York
2800 Victory Boulevard, Staten Island, NY 10314, USA
zhangz@mail.csi.cuny.edu
ABSTRACT
In this paper we present a cluster based approach to using a sensor’s sensibility and
laser signal to address both sensor node localization and K-coverage problems.
After sensors were randomly deployed, a virtual grid was mapped over the
deployment area. Location guided laser beams are projected to the centers of grid
cells to trigger sensors within one hop of communication range to form sensor
clusters in the virtual grid. Therefore, all clusters are aware of their locations
within the precision of location guided laser beams. We assume there are
redundant sensors in each cluster. Thus the cluster members can operate
alternatively (duty-cycle) in active or sleep modes under the coordination of the
cluster head to conserve energy while providing sufficient and robust coverage in
the presence of both node power depletions and unexpected failures. We
introduce two distributed algorithms to form sensor clusters and to manage cluster
members in duty cycles while maintaining the required K-coverage. Simulation
and analysis results show that our algorithms scales well with overhead cost as a
linear function of sensor population in terms of energy consumption..
After the cluster is formed according to the 3.1 The Cluster Member Component
SCLA algorithm, all cluster members are in active We use two state transition diagrams, one
mode (m=A) by default. A member listens to the represents cluster members in active mode and the
initialization message, (I, sensor_list), from the other represents cluster members in sleep mode.
cluster head. A member turns into sleep mode Figure 3 defines the behavior of an active member
(m=S) unless its SID is on the sensor_list in the node within the SCMA algorithm and how it can
initialization message. We use finite state automata change to sleep mode or become a cluster head when
to precisely describe the behavior of each component a cluster head has failed. For example, when an
in a simple canonical form. Particularly we employ a active member receives a “Hello” message from the
special type of finite state automata, called Mealey cluster head (H, HID), it replies with message
machine, which is formally defined by Hopcropt and (H, SID) and goes back to the same state. An arrow
Ullman [12] as below: indicates such a transition with a text label on top in
Figure 13: Average node lifetime vs. node density Figure 15: Percentage of SCMA message vs. node
density per cell
Figure 14 shows that as the percentage of active
duty cycle (the percentage of active time over total 6 CONSLUCSION
node lifetime) is decreased as the node density
increases with K=1 coverage. We expect this In this paper we propose a unique solution to
percentage to follow the same trend but at less address both sensor localization and K-coverage
decline rate percentage as the K value increases, problems that can conserve energy while supporting
since more nodes must stay active. robust WSN operations. Simulation results show that
both of our distributed algorithms, SCLA and SCMA,
perform and scale well with overheads in linear
proportions to the deployed sensor population in a
variety of deployment densities. SCMA can
guarantee the K-coverage requirements of WSN
applications over their network lifetimes and it can
warn network operators should coverage
requirements be compromised.
The work reported in this paper leads to several
interesting topics for future research. We plan to
investigate the possibility of using this model for
differential K-coverage problems [16] where
Figure 14: Percentage of active duty time vs. different cells may require different K-coverage
number of nodes in a cluster within the same WSN application. We are
conducting more extensive simulation studies on two
Based on the simulation results shown in Fig. 13, issues. One investigates the overhead impact and the
we expect the cluster head probing cycle (Th – the worthiness of having a head node fall back to sleep if
time interval before sending next “hello” message) of its energy level falls below a certain threshold. The
“hello” messages will impact the overhead cost of other studies the impact of having K-coverage values
the SCMA algorithm. As interval Th increases, the as a function of time and location. We expect these
overhead cost of SCMA will decrease. We studies will help us to refine our model and to
conducted simulation tests under three Th values. achieve even greater energy efficiency. We are
The simulation results shown in Figure 15 aware that we did not take into consideration the
validate our expectations. It shows the overhead cost energy consumed by sensors for providing normal
as the percentage of SCMA message transmitted operational tasks. Our analysis and simulation
over the total potential bandwidth capacity of a results only explore the overhead portion of energy
sensor cluster. For three different Th values, we consumed by SCLA and SCMA without regard to
can see the impact of Th remains significant only the application. The energy credited to WSN normal
before the node population reaches a “critical mass” operational tasks are highly application dependent,
where nodes/cell = 5 for K = 1 coverage. As the node therefore it is out of the scope of this paper.
population increases beyond the critical mass, the
total message capacity of the cluster grows at a much
faster than the overhead cost. This result tells us that
SCMA scales well as node population increases
measured by the percentage of overhead cost. This
result also suggests that it is most cost-effective to
increase the Th value for the clusters with a smaller
population (less than 5 sensor nodes per cell).
[1] L. Doherty et al., “Convex Position Estimation This research is continuing through participation
in Wireless Sensor Networks,” IEEE INFOCOM, in the International Technology Alliance (ITA)
Alaska, April 2001. sponsored by the U.S. Army Research Laboratory
[2] N. Bulusu et al., “GPS-less Low-Cost Outdoor and the U.K. Ministry of Defense under Agreement
localization for Very Small Devices,” IEEE Personal Number W911NF-06-3-0001.
Communications, October 2000. This work was also supported (in part) by a grant
[3] A. Savvides et al., “Dynamic Fine-Grained from The City University of New York PSC-CUNY
Localization in Ad-Hoc Networks of Sensors.” ACM Research Award Program (68358-0037) and a grant
SIGMOBILE, Rome, Italy. July 2001. from CUNY Research Foundation (80210-14-04).
[4] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless,
and C. Gill, “Integrated coverage and connectivity
configuration in wireless sensor networks,” in
Proceedings of the ACM SenSys, 2003.
[5] K. Charkrabarty, S. Iyengar, H. Qi, and E. Cho,
“Grid coverage for surveillance and target location in
distributed sensor networks,” IEEE Transaction on
Computers, 2002.
[6] I.F. Akyildiz et al. “A Survey on Sensor
Networks.” IEEE Communications Magazine,
August 2002, pp. 102-114.
[7] C. Jone, et al. “A Survey of Energy Efficient
Network Protocols for Wireless networks”, Journal
of Wireless Networks, Kluwer Academic Publishers,
2001, Vol. 7, pp. 343-358.
[8] “MICA Wireless Measurement System”,
http://www.xbow.com/Products/
[9] “University of Berkeley Mote”,
http://webs.cs.berkeley.edu/
[10] Northrop Grumman, “Lightweight Laser
Designator Rangefinder Data Sheet”,
http://www.dsd.es.northropgrumman.com/DSD-
Brochures/laser/LLDR.pdf
[11] J. Broch, et al. “A Performance Comparison of
Multi-Hop Wireless Ad Hoc Network Routing
Protocols.” The 4th Annual ACM/IEEE
International Conference on Mobile Computing and
Networking, October, 1998, Dallas, Texas.
[12] Hopcroft J. and Ullman J., “Introduction to
Automata Theory, Language, and Computation.”
Addison Wesley publishing company, 1979.
[13] “The Network Simulator ns-2: Documentation”,
http://www.isi.edu/nsnam/ns/ns-documentation.html.
[14] “Monarch Extensions to ns”,
http://www.monarch.cs.cmu.edu/
[15] “MICA2 AA Battery Pack Service Life Test”
http://www.xbow.com/Support/Support_pdf_files/M
ICA2_BatteryLifeTest.pdf
[16] X. Du and F. Lin, “Maintaining Differentiated
Coverage in Heterogeneous Sensor Networks.”
EURASIP Journal on Wireless Communications and
Networking, Vol. 4, 2005, pp 565-572.