Master of Science (MS)
First Committee Member
Ajoy K. Datta
Second Committee Member
Number of Pages
The connected sensor cover problem: Given a query over a sensor network, select a minimum or nearly minimum set of sensors, called connected sensor cover, such that the selected sensors cover the query region, and form a connected network among themselves. In its general form, this problem is known to be NP-hard; In this thesis research, we design the first, fully distributed, strictly localized, scalable, and self-* solution to the connected sensor cover problem. The Self-* concept has been used to include many fault-tolerant properties like self-configuring , self-reconfiguring/self-healing, etc. We will present a self-stabilizing solution and show that this solution is both self-configuring and self-healing. In a self-stabilizing system, every computation, starting from an arbitrary state, eventually reaches a state which satisfies the specification. Nodes achieve the global objective by using only local computations. Local algorithm based sensor networks are more robust, and scale better. (Abstract shortened by UMI.).
Covering; Distributed; Networks; Query; Region; Self; Sensor; Wireless
Computer science; Electrical engineering
University of Nevada, Las Vegas
If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to email@example.com and include clear identification of the work, preferably with URL.
Linga, Preethi, "Self-* distributed query region covering in wireless sensor networks" (2002). UNLV Retrospective Theses & Dissertations. 1630.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/