語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Integrating Mobile Agents and Distri...
~
Zeng, Jiemin.
FindBook
Google Book
Amazon
博客來
Integrating Mobile Agents and Distributed Sensors in Wireless Sensor Networks.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Integrating Mobile Agents and Distributed Sensors in Wireless Sensor Networks./
作者:
Zeng, Jiemin.
出版者:
Ann Arbor : ProQuest Dissertations & Theses, : 2016,
面頁冊數:
128 p.
附註:
Source: Dissertation Abstracts International, Volume: 78-04(E), Section: B.
Contained By:
Dissertation Abstracts International78-04B(E).
標題:
Computer science. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10193121
ISBN:
9781369378566
Integrating Mobile Agents and Distributed Sensors in Wireless Sensor Networks.
Zeng, Jiemin.
Integrating Mobile Agents and Distributed Sensors in Wireless Sensor Networks.
- Ann Arbor : ProQuest Dissertations & Theses, 2016 - 128 p.
Source: Dissertation Abstracts International, Volume: 78-04(E), Section: B.
Thesis (Ph.D.)--State University of New York at Stony Brook, 2016.
As computers become more ubiquitous in the prominent phenomenon of the Internet of Things, we encounter many unique challenges in the field of wireless sensor networks. A wireless sensor network is a group of small, low powered sensors with wireless capability to communicate with each other. The goal of these sensors, also called nodes, generally is to collect some information about their environment and report it back to a base station. Depending on the nature of the nodes or the environment, they may be placed in a deterministic pattern, deployed randomly, or mobile (i.e. cars on a highway). Due to the varying nature of these types of networks, they need specialized algorithms tailored to their scenarios and optimized to make efficient use of the limited power resources of the nodes. In this report, we provide upper and lower bounds for the following six different wireless sensor network problems.
ISBN: 9781369378566Subjects--Topical Terms:
523869
Computer science.
Integrating Mobile Agents and Distributed Sensors in Wireless Sensor Networks.
LDR
:03520nmm a2200373 4500
001
2155186
005
20180426100014.5
008
190424s2016 ||||||||||||||||| ||eng d
020
$a
9781369378566
035
$a
(MiAaPQ)AAI10193121
035
$a
(MiAaPQ)grad.sunysb:13030
035
$a
AAI10193121
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Zeng, Jiemin.
$3
3342926
245
1 0
$a
Integrating Mobile Agents and Distributed Sensors in Wireless Sensor Networks.
260
1
$a
Ann Arbor :
$b
ProQuest Dissertations & Theses,
$c
2016
300
$a
128 p.
500
$a
Source: Dissertation Abstracts International, Volume: 78-04(E), Section: B.
500
$a
Adviser: Jie Gao.
502
$a
Thesis (Ph.D.)--State University of New York at Stony Brook, 2016.
520
$a
As computers become more ubiquitous in the prominent phenomenon of the Internet of Things, we encounter many unique challenges in the field of wireless sensor networks. A wireless sensor network is a group of small, low powered sensors with wireless capability to communicate with each other. The goal of these sensors, also called nodes, generally is to collect some information about their environment and report it back to a base station. Depending on the nature of the nodes or the environment, they may be placed in a deterministic pattern, deployed randomly, or mobile (i.e. cars on a highway). Due to the varying nature of these types of networks, they need specialized algorithms tailored to their scenarios and optimized to make efficient use of the limited power resources of the nodes. In this report, we provide upper and lower bounds for the following six different wireless sensor network problems.
520
$a
• Spanner on Imprecise Points: We consider the construction of a Euclidean spanner for imprecise points where we take advantage of prior, inexact knowledge of our input.
520
$a
• Distributed Mobile Sensor Coverage: We consider the problem of covering a domain by mobile sensors and the design of an efficient schedule that reduces unnecessary sensor overlap and energy consumption.
520
$a
• The Data Gathering Problem: A data mule tours around a sensor network and helps with network maintenance such as data collection and battery recharging/replacement. We assume that each sensor has a fixed data generation rate and a capacity (upper bound on storage size). If the data mule arrives after the storage capacity is met, additional data generated is lost. We aim to schedule a tour for the mule such that it optimally services the network.
520
$a
• The Shortest Separating Cycle Problem: Given a set of pairs of points in the plane, the goal of the minimum length separating cycle problem is to find a simple tour of minimum length that separates the two points of each pair on different sides.
520
$a
• r-gather Clustering: Given a set of points in Euclidean space and a value r, the aim of the r-gather problem is to cluster the points into groups of at least r points each such that the largest diameter of the clusters is minimized.
520
$a
• Geographical Routing in 3D: Given a graph on vertices embedded in R3, the objective is to add the minimum number of virtual edges such that greedy routing succeeds for any source and destination pair.
590
$a
School code: 0771.
650
4
$a
Computer science.
$3
523869
650
4
$a
Applied mathematics.
$3
2122814
690
$a
0984
690
$a
0364
710
2
$a
State University of New York at Stony Brook.
$b
Computer Science.
$3
1674709
773
0
$t
Dissertation Abstracts International
$g
78-04B(E).
790
$a
0771
791
$a
Ph.D.
792
$a
2016
793
$a
English
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10193121
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9354733
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入