國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Wireless sensor network metrics for ...

Chen, Phoebus Wei-Chih.

Wireless sensor network metrics for real-time systems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Wireless sensor network metrics for real-time systems.
作者:	Chen, Phoebus Wei-Chih.
面頁冊數:	201 p.
附註:	Source: Dissertation Abstracts International, Volume: 70-10, Section: B, page: .
附註:	Adviser: S. Shankar Sastry.
Contained By:	Dissertation Abstracts International70-10B.
標題:	Engineering, Electronics and Electrical.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3382862
ISBN:	9781109449617

Wireless sensor network metrics for real-time systems.
Chen, Phoebus Wei-Chih.

Wireless sensor network metrics for real-time systems. - 201 p.

Source: Dissertation Abstracts International, Volume: 70-10, Section: B, page: .

Thesis (Ph.D.)--University of California, Berkeley, 2009.

Research in wireless sensor networks (WSNs) is moving from studies of WSNs in isolation toward studies where the WSN is treated as a component of a larger system. One hot area of research is the study of how to integrate wireless sensor networks with existing real-time measurement and control systems, forming what we call a wireless networked system. To apply the theories for studying real-time systems operating over wireless networks, for instance the theory of Networked Control Systems, we need to develop models of the lossy wireless communication medium. The models are used to compute network metrics, measures of network performance such as latency and reliability, that serve as an abstraction of the network which are used as input to the theoretical tools for analyzing the entire wireless networked system.

ISBN: 9781109449617Subjects--Topical Terms:

226981
Engineering, Electronics and Electrical.

Wireless sensor network metrics for real-time systems.
LDR:03029nmm 2200301 4500 001 240311
005 20100310090845.5
008 100410s2009 ||||||||||||||||| ||eng d
020 $a 9781109449617
035 $a (UMI)AAI3382862
035 $a AAI3382862
040 $a UMI $c UMI
100 1 $a Chen, Phoebus Wei-Chih. $3 384346
245 1 0 $a Wireless sensor network metrics for real-time systems.
300 $a 201 p.
500 $a Source: Dissertation Abstracts International, Volume: 70-10, Section: B, page: .
500 $a Adviser: S. Shankar Sastry.
502 $a Thesis (Ph.D.)--University of California, Berkeley, 2009.
520 $a Research in wireless sensor networks (WSNs) is moving from studies of WSNs in isolation toward studies where the WSN is treated as a component of a larger system. One hot area of research is the study of how to integrate wireless sensor networks with existing real-time measurement and control systems, forming what we call a wireless networked system. To apply the theories for studying real-time systems operating over wireless networks, for instance the theory of Networked Control Systems, we need to develop models of the lossy wireless communication medium. The models are used to compute network metrics, measures of network performance such as latency and reliability, that serve as an abstraction of the network which are used as input to the theoretical tools for analyzing the entire wireless networked system.
520 $a This dissertation focuses on modeling WSNs which use mesh networking with a TDMA data link layer. Specifically, it focuses on two classes of TDMA mesh networking schemes, Unicast Path Diversity (UPD) and Directed Staged Flooding (DSF). UPD uses retransmissions to get reliable packet delivery while DSF uses constrained flooding/multicast to get reliable packet delivery. We derive Markov chain models of UPD and DSF to compute the probability of end-to-end packet delivery as a function of latency, the expected radio energy consumption on the nodes from relaying packets, and the traffic distribution on the network. We also derive metrics based on clearly defined link failure models and routing models that allow a network designer to compare mesh routing topologies to determine which is better for reliable packet delivery. One of these network metrics leads to a greedy algorithm for constructing a mesh routing topology. Finally, we study the implications of using distributed scheduling schemes to generate schedules for WSNs. Particularly, we focus on the impact scheduling has on path diversity, using short repeating schedules and Greedy Maximal Matching scheduling as examples. A cluster-based scheduling scheme is proposed which works well on a subclass of network topologies.
590 $a School code: 0028.
650 4 $a Engineering, Electronics and Electrical. $3 226981
650 4 $a Engineering, System Science. $3 227118
650 4 $a Computer Science. $3 212513
690 $a 0544
690 $a 0790
690 $a 0984
710 2 $a University of California, Berkeley. $3 212474
773 0 $t Dissertation Abstracts International $g 70-10B.
790 1 0 $a Sastry, S. Shankar, $e advisor
790 $a 0028
791 $a Ph.D.
792 $a 2009
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3382862