東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Topology independent transmission sc...

Youn, Jong-Hoon.

Linked to FindBook

Google Book

Amazon

博客來

Topology independent transmission scheduling algorithms in mobile ad hoc networks.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Topology independent transmission scheduling algorithms in mobile ad hoc networks./
Author:	Youn, Jong-Hoon.
Description:	76 p.
Notes:	Adviser: Bella Bose.
Contained By:	Dissertation Abstracts International63-08B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3061927
ISBN:	0493777644

Topology independent transmission scheduling algorithms in mobile ad hoc networks.
Youn, Jong-Hoon.

Topology independent transmission scheduling algorithms in mobile ad hoc networks. - 76 p.

Adviser: Bella Bose.

Thesis (Ph.D.)--Oregon State University, 2003.

Due to the rapid growth of wireless technology, there has been a growing interest in the capabilities of ad hoc networks connecting mobile phones, PDAs and laptop computers. The distributed and self-configurable capabilities of ad hoc networks make them very attractive for some applications such as tactical communication for military, search and rescue mission, disaster recovery, conferences, lectures, etc.

ISBN: 0493777644Subjects--Topical Terms:

626642
Computer Science.

Topology independent transmission scheduling algorithms in mobile ad hoc networks.
LDR:03402nam 2200301 a 45 001 933232
005 20110505
008 110505s2003 eng d
020 $a 0493777644
035 $a (UnM)AAI3061927
035 $a AAI3061927
040 $a UnM $c UnM
100 1 $a Youn, Jong-Hoon. $3 1256970
245 1 0 $a Topology independent transmission scheduling algorithms in mobile ad hoc networks.
300 $a 76 p.
500 $a Adviser: Bella Bose.
500 $a Source: Dissertation Abstracts International, Volume: 63-08, Section: B, page: 3799.
502 $a Thesis (Ph.D.)--Oregon State University, 2003.
520 $a Due to the rapid growth of wireless technology, there has been a growing interest in the capabilities of ad hoc networks connecting mobile phones, PDAs and laptop computers. The distributed and self-configurable capabilities of ad hoc networks make them very attractive for some applications such as tactical communication for military, search and rescue mission, disaster recovery, conferences, lectures, etc.
520 $a In this thesis, we describe several new time scheduling algorithms for multihop packet radio networks; <italic>MaxThrou, MinDelay, ECTS</italic> (Energy Conserving Transmission Scheduling) and <italic>LA-TSMA</italic> (Location-Aided Time-Spread Multiple Access). The <italic>MaxThrou</italic> and <italic>MinDelay </italic> algorithms focus on maximizing the system throughput and minimizing the delay bound by using constant weight codes. In these algorithms, each mobile host is assigned a word from an appropriate constant weight code of length <italic>n</italic>, distance <italic>d</italic> and weight <italic> w</italic>. The host can send a message at the <italic>j<super>th</super></italic> slot provided the assigned code has a 1 in this <italic>j<super>th</super></italic> bit. The <italic>MaxThrou</italic> and <italic>MinDelay</italic> scheduling algorithms are better than the previously known algorithms in terms of the minimum throughput per node and/or the delay bound.
520 $a Since most of mobile hosts are operated using the scarce battery, and the battery life is not expected to increase significantly in the near future, energy efficiency is a critical issue in ad hoc networks. The ECTS algorithm conserves the power using strategies that allow the network interface to use the low power sleep mode instead of the idle mode, and also eliminates data collisions by introducing Request-To-Send (RTS) and Clear-To-Send (CTS) control slots. Simulation study shows that the ECTS algorithm outperforms previously known protocols.
520 $a Due to the increasing popularity of mobile networking systems, the scalability becomes a significant new challenge for ad hoc network protocols. To provide a scalable solution for mobile ad hoc networks, we introduce the LA-TSMA algorithm. Instead of assigning a globally unique TSV to each host as done in previous topology-transparent scheduling algorithms, the proposed algorithm assigns a locally unique TSV to each host. In LA-TSMA, a territory is divided into zones, and the mobile hosts located in different zones can be assigned the same TSV.
590 $a School code: 0172.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a Oregon State University. $3 625720
773 0 $t Dissertation Abstracts International $g 63-08B.
790 $a 0172
790 1 0 $a Bose, Bella, $e advisor
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3061927