東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Resource allocation and routing in m...

Ding, Yong.

FindBook

Google Book

Amazon

博客來

Resource allocation and routing in multi-hop wireless networks.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Resource allocation and routing in multi-hop wireless networks./
作者:	Ding, Yong.
面頁冊數:	182 p.
附註:	Source: Dissertation Abstracts International, Volume: 71-08, Section: B, page: 4918.
Contained By:	Dissertation Abstracts International71-08B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3417659
ISBN:	9781124137209

Resource allocation and routing in multi-hop wireless networks.
Ding, Yong.

Resource allocation and routing in multi-hop wireless networks. - 182 p.

Source: Dissertation Abstracts International, Volume: 71-08, Section: B, page: 4918.

Thesis (Ph.D.)--Michigan State University, 2010.

Multi-hop wireless networks have been widely deployed in different application areas. These include wireless sensor networks, wireless mesh networks, and wireless vehicular ad-hoc networks. Resource allocation and routing are two critical issues for multi-hop wireless networks. The appropriate allocation of the limited resources, such as energy or channel, can usually improve the network performance dramatically. On the other hand, routing is usually coupled with resource allocation, which affects the network topology. The problem itself can even be regarded as a high level resource allocation, because it is equivalent to allocating the set of wireless links and bandwidth for each particular application. Due to the difference in hardware characteristics and application background, different networks should be given special design considerations. In this dissertation, we discuss several research topics related with resource allocation and routing in multi-hop wireless networks.

ISBN: 9781124137209Subjects--Topical Terms:

626642
Computer Science.

Resource allocation and routing in multi-hop wireless networks.
LDR:04528nam 2200325 4500 001 1405122
005 20111206130409.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124137209
035 $a (UMI)AAI3417659
035 $a AAI3417659
040 $a UMI $c UMI
100 1 $a Ding, Yong. $3 620355
245 1 0 $a Resource allocation and routing in multi-hop wireless networks.
300 $a 182 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-08, Section: B, page: 4918.
500 $a Adviser: Li Xiao.
502 $a Thesis (Ph.D.)--Michigan State University, 2010.
520 $a Multi-hop wireless networks have been widely deployed in different application areas. These include wireless sensor networks, wireless mesh networks, and wireless vehicular ad-hoc networks. Resource allocation and routing are two critical issues for multi-hop wireless networks. The appropriate allocation of the limited resources, such as energy or channel, can usually improve the network performance dramatically. On the other hand, routing is usually coupled with resource allocation, which affects the network topology. The problem itself can even be regarded as a high level resource allocation, because it is equivalent to allocating the set of wireless links and bandwidth for each particular application. Due to the difference in hardware characteristics and application background, different networks should be given special design considerations. In this dissertation, we discuss several research topics related with resource allocation and routing in multi-hop wireless networks.
520 $a First, we investigate the problem of sleep scheduling of sensors in dense wireless sensor networks with the goal of reducing energy consumption. The basic idea is to partition sensors into groups such that a connected backbone network can be maintained by keeping only one arbitrary node from each group in active status. Unlike previous approaches that use geographic partitions, we propose to partition nodes based on their measured connectivity. The proposed scheme not only ensures K-vertex connectivity of the backbone network, but also outperforms other approaches in irregular radio environments.
520 $a Second, we study the channel assignment with partially overlapping channels in wireless mesh networks. Unlike previous studies that focus on the channel assignment with non-overlapping channels only, we propose efficient channel assignment algorithms that use both non-overlapping and overlapping channels. We show that the network capacity can be dramatically increased by using partially overlapping channels, and the proposed algorithms find better solutions than existing algorithms.
520 $a Third, as both static channel assignment and dynamic channel assignment have their own strengths and drawbacks, we propose a hybrid wireless mesh networking architecture, which combines the advantages of both channel assignment approaches. We discuss both the channel assignment algorithms and routing protocols used in this hybrid architecture. We demonstrate that our proposed approach achieves better adaptivity to the changing traffic and lower data delivery delay.
520 $a Fourth, we study the application of multi-source video on-demand streaming in wireless mesh networks. We focus on the problem of finding the maximum number of high-quality and independent paths from the user to the multiple video sources by considering the effect of wireless interference. We propose efficient routing algorithms that aim at minimizing the network congestion caused by each new video session. We show that it not only improves the average video streaming performance, but also increase the network's capacity of satisfying video requests.
520 $a Finally, we present a routing algorithm for vehicular ad-hoc networks with the goal of efficient data delivery under low and median vehicle densities. We consider the deployment of static nodes at road intersections to help relay data. We propose an algorithm that determines whether a vehicle forwards a packet to the static node and when the static node forwards the packet to vehicles. We show that our proposed routing algorithm achieves lower data delivery delay than the previous algorithms.
590 $a School code: 0128.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a Michigan State University. $3 676168
773 0 $t Dissertation Abstracts International $g 71-08B.
790 1 0 $a Xiao, Li, $e advisor
790 $a 0128
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3417659