Master of Science (MS)
First Committee Member
Ajoy K. Datta
Second Committee Member
Number of Pages
Wireless ad-hoc sensor networks are composed of a large number of tiny sensors with embedded microprocessors, that have very limited resources and yet must coordinate amongst themselves to form a connected network. Every sensor has a certain sensing radius, Rs, within which it is capable of "covering" a particular region by detecting or gathering certain data. Every sensor also has a communication radius, R c, within which it is capable of sending or receiving data; Given a query over a sensor network, the minimum connected sensor cover problem is to select a minimum, or nearly minimum, set of sensors, called a minimum connected sensor cover, such that the selected sensors cover the query region, and form a connected network amongst themselves. In this thesis, we use present three fully distributed, strictly localized, scalable, self-* solutions to the minimum connected sensor cover problem.
Algorithms; Connected; Cover; Distributed; Minimum; Self; Sensor; Star
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 firstname.lastname@example.org and include clear identification of the work, preferably with URL.
Patel, Rajesh, "Distributed self-(star) minimum connected sensor cover algorithms" (2005). UNLV Retrospective Theses & Dissertations. 1899.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/