東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Resource efficiency in ad hoc wirele...

Cheng, Maggie Xiaoyan.

FindBook

Google Book

Amazon

博客來

Resource efficiency in ad hoc wireless networks: Problems and solutions.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Resource efficiency in ad hoc wireless networks: Problems and solutions./
作者:	Cheng, Maggie Xiaoyan.
面頁冊數:	116 p.
附註:	Source: Dissertation Abstracts International, Volume: 64-07, Section: B, page: 3360.
Contained By:	Dissertation Abstracts International64-07B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3098578

Resource efficiency in ad hoc wireless networks: Problems and solutions.
Cheng, Maggie Xiaoyan.

Resource efficiency in ad hoc wireless networks: Problems and solutions. - 116 p.

Source: Dissertation Abstracts International, Volume: 64-07, Section: B, page: 3360.

Thesis (Ph.D.)--University of Minnesota, 2003.

Ad hoc network is promising due to its versatility and convenience. Resource scarcity is one of the characteristics in ad hoc networks. This thesis studied the problems of making efficient use of energy resource and radio spectrum.Subjects--Topical Terms:

626642
Computer Science.

Resource efficiency in ad hoc wireless networks: Problems and solutions.
LDR:03441nmm 2200313 4500 001 1856056
005 20040616162818.5
008 130614s2003 eng d
035 $a (UnM)AAI3098578
035 $a AAI3098578
040 $a UnM $c UnM
100 1 $a Cheng, Maggie Xiaoyan. $3 928093
245 1 0 $a Resource efficiency in ad hoc wireless networks: Problems and solutions.
300 $a 116 p.
500 $a Source: Dissertation Abstracts International, Volume: 64-07, Section: B, page: 3360.
500 $a Adviser: Ding-Zhu Du.
502 $a Thesis (Ph.D.)--University of Minnesota, 2003.
520 $a Ad hoc network is promising due to its versatility and convenience. Resource scarcity is one of the characteristics in ad hoc networks. This thesis studied the problems of making efficient use of energy resource and radio spectrum.
520 $a A broadcast session traffic uses a broadcast tree to disseminate information. To be energy efficient, the broadcast tree construction needs to consider the transmission power needed by each transmitting node. We study the problem of finding the tree that minimizes the maximum transmission power, and in case that each node has different energy reserve, we find a tree that balances the energy consumption.
520 $a Ad hoc networks are infrastructureless. However, network topology is an important virtual structure above which the upper level routing protocols are implemented. The underlying topology will affect the performance of upper level applications. To improve energy efficiency, we can control the link topology by adjusting the node transmission power. This thesis studied the topology control problem to achieve the basic network connectivity. We studied the problem for different objective functions, such as minimum total energy, or balanced energy distribution.
520 $a Media access control is another important issue in wireless networks. This thesis investigated channel assignment problem in ad hoc wireless networks such that interference between users are eliminated and the total number of channels is minimum. Interference can be caused by either direct collision from users that can hear each other or indirect collision from stations that are not in the range of each other but simultaneously transmit to the same destination. We modeled the wireless networks using a new class of disk graphs, and we used graph coloring approach to handle collision avoidance.
520 $a Sensor network is an application of ad hoc technology in large scale networks. Sensors in a network can cooperatively gather information from a specified region of observation and relay this information to a base station. For stochastically deployed sensor networks, some area is redundantly covered. We divide sensors into mutual exclusive subsets and put them alternatively in active mode and powered-down mode, such that there is only one set of sensors active at any time and the set of active nodes can fully cover the area. We studied the complexity of the maximum disjoint cover problem and provided heuristics to maximize the number of disjoint covers, and this effort significantly extended the sensor network lifetime.
590 $a School code: 0130.
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0984
690 $a 0544
710 2 0 $a University of Minnesota. $3 676231
773 0 $t Dissertation Abstracts International $g 64-07B.
790 1 0 $a Du, Ding-Zhu, $e advisor
790 $a 0130
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3098578