Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


ucin1092939502.pdf (1.29 MB)

ETD Abstract Container

Abstract Header

SELF-ORGANIZED SCHEDULING OF NODE ACTIVITY IN LARGE-SCALE SENSOR NETWORKS

SEETHARAMAN, SUMATHI
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1092939502

Abstract Details

2004, MS, University of Cincinnati, Engineering : Electrical Engineering.
Advances in MEMS (Micro-Electro-Mechanical Systems) technology have enabled the development of extremely small multi-functional sensing devices. Due to their miniature size, these micro-sensors can blend effortlessly with the environment and sense intricate information. Some key advantages of such pervasive sensor networks are: a) Ubiquitous, non-intrusive nature; b) Random deployment with limited or no pre-established infrastructure; c) Minimal supervision since nodes can self-organize into a functional network through local communication, d) Cost effectiveness; e) Flexibility; f) Scalability; g) Simple expandability; and h) Robustness. Large-scale sensor networks are being envisioned and applied in a wide range of scenarios like sensors embedded in a bridge to monitor for cracks, deployed in a field to track enemy movements or scattered in a forest to detect a fire breakout at an early stage. Field coverage is a critical issue for such event monitoring wireless networks. Given the spatiotemporal nature of the phenomena being observed, the sensor network must be able to detect and report its occurrence as quickly and accurately as possible. This leads to the problem of coverage: Ensuring that no part of the field remains un-sensed for more than a specified duration. In this thesis, we compare several decentralized, self-organized methods for scheduling nodes to obtain effective coverage. The focus is on assessing how well individual nodes in the network can locally estimate and optimize their schedules in order to achieve complete global coverage and a longer network lifetime at a lower energy cost. The primary constraints are energy spent on information exchange for setup, the communicating radius which limits the extent of local information available to the node, and the latency in determining the optimal schedule. The performance of the schemes are evaluated against other successful scheduling and density control schemes.
Dr. Ali Minai (Advisor)
118 p.
Wireless Sensor Networks; Distributed Algorithms; Self-organization

Recommended Citations

Citations

  • SEETHARAMAN, S. (2004). SELF-ORGANIZED SCHEDULING OF NODE ACTIVITY IN LARGE-SCALE SENSOR NETWORKS [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1092939502

    APA Style (7th edition)

  • SEETHARAMAN, SUMATHI. SELF-ORGANIZED SCHEDULING OF NODE ACTIVITY IN LARGE-SCALE SENSOR NETWORKS. 2004. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1092939502.

    MLA Style (8th edition)

  • SEETHARAMAN, SUMATHI. "SELF-ORGANIZED SCHEDULING OF NODE ACTIVITY IN LARGE-SCALE SENSOR NETWORKS." Master's thesis, University of Cincinnati, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1092939502

    Chicago Manual of Style (17th edition)

ucin1092939502
729
© 2004, all rights reserved.
This open access ETD is published by University of Cincinnati and OhioLINK.