Design considerations in wireless sensor networks
| dc.contributor.advisor | Ephremides, Anthony | en_US |
| dc.contributor.author | Borbash, Steven A. | en_US |
| dc.contributor.department | Electrical Engineering | en_US |
| dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
| dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
| dc.date.accessioned | 2004-08-27T05:27:23Z | |
| dc.date.available | 2004-08-27T05:27:23Z | |
| dc.date.issued | 2004-08-02 | en_US |
| dc.description.abstract | We consider three problems in the design of wireless sensor networks: cross-layer optimization, neighbor discovery, and scheduling as a method of medium access control (MAC). Cross-layer optimization will be important for sensor networks, which typically have only one or two objectives to meet. We consider a sensor network which performs decentralized detection. We devise a method in which local observations by sensors are condensed into a single bit message and forwarded to a sink node which makes a final decision. The method involves unusual interactions between the application, the routing function, and the physical layer. Neighbor discovery is useful in sensor networks whose nodes are immobile, since routing and scheduling algorithms can make good use of neighbor information. We propose an asynchronous neighbor discovery algorithm. The algorithm is probabilistic: each node obtains a list of its neighbors which is possibly incomplete. Performance is analyzed and optimal parameter settings are obtained. Scheduling deserves consideration as a MAC in sensor networks, because MACs based on contention methods waste energy in retransmissions. We state a natural centralized scheduling problem, in which link demands are to be satisfied under signal-to-interference-and-noise-ratio (SINR) constraints, and transmit powers may be varied. We show that solving this minimum length scheduling problem is at least as hard as another problem we define, MAX-SINR-MATCHING, in the sense that if there is no polynomial-time algorithm to solve the latter then there is no polynomial-time algorithm to solve the former. We give evidence that MAX-SINR-MATCHING is a difficult problem. We add several theorems on the SINR model which exploit algebraic structure. The theorems predict what sets of links could be simultaneously activated in a wireless network and depend only on the SINR requirements of the nodes and the worst propagation loss in a network. These theorems apply to all wireless networks which can be described by SINR requirements, not only to sensor networks. | en_US |
| dc.format.extent | 529623 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/1764 | |
| dc.language.iso | en_US | |
| dc.subject.pqcontrolled | Engineering, Electronics and Electrical | en_US |
| dc.subject.pquncontrolled | wireless | en_US |
| dc.subject.pquncontrolled | sensor network | en_US |
| dc.subject.pquncontrolled | power control | en_US |
| dc.subject.pquncontrolled | neighbor discovery | en_US |
| dc.subject.pquncontrolled | cross-layer | en_US |
| dc.title | Design considerations in wireless sensor networks | en_US |
| dc.type | Dissertation | en_US |
Files
Original bundle
1 - 1 of 1