東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Self-organization and resource alloc...

Zhao, Liang.

Linked to FindBook

Google Book

Amazon

博客來

Self-organization and resource allocation in wireless sensor networks.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Self-organization and resource allocation in wireless sensor networks./
Author:	Zhao, Liang.
Description:	91 p.
Notes:	Source: Dissertation Abstracts International, Volume: 67-03, Section: B, page: 1626.
Contained By:	Dissertation Abstracts International67-03B.
Subject:	Engineering, Electronics and Electrical. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3212090
ISBN:	9780542604829

Self-organization and resource allocation in wireless sensor networks.
Zhao, Liang.

Self-organization and resource allocation in wireless sensor networks. - 91 p.

Source: Dissertation Abstracts International, Volume: 67-03, Section: B, page: 1626.

Thesis (Ph.D.)--The University of Texas at Arlington, 2006.

In this dissertation, we utilize clustering to organize wireless sensors into an energy-efficient hierarchy. We propose a Medium-Contention Based Cluster Headship Auction (MCCHA) scheme, through which sensors self-organize themselves into energy-efficient clusters by bidding for cluster headship. This scheme is based on a new criterion that can be used by each sensor node to make a distributed decision on whether electing to be a cluster head or a non-head member, which is a fully distributed approach. Although MCCHA uses only local information, it achieves better performance in terms of effective lifetime and Data/Energy Ratio compared with native LEACH, which relies on other routing algorithms to access global information. A complementary exponential data correlation model is also introduced to simulate different data aggregation effect.

ISBN: 9780542604829Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Self-organization and resource allocation in wireless sensor networks.
LDR:03253nmm 2200289 4500 001 1834763
005 20071127121415.5
008 130610s2006 eng d
020 $a 9780542604829
035 $a (UMI)AAI3212090
035 $a AAI3212090
040 $a UMI $c UMI
100 1 $a Zhao, Liang. $3 1057459
245 1 0 $a Self-organization and resource allocation in wireless sensor networks.
300 $a 91 p.
500 $a Source: Dissertation Abstracts International, Volume: 67-03, Section: B, page: 1626.
500 $a Adviser: Qilian Liang.
502 $a Thesis (Ph.D.)--The University of Texas at Arlington, 2006.
520 $a In this dissertation, we utilize clustering to organize wireless sensors into an energy-efficient hierarchy. We propose a Medium-Contention Based Cluster Headship Auction (MCCHA) scheme, through which sensors self-organize themselves into energy-efficient clusters by bidding for cluster headship. This scheme is based on a new criterion that can be used by each sensor node to make a distributed decision on whether electing to be a cluster head or a non-head member, which is a fully distributed approach. Although MCCHA uses only local information, it achieves better performance in terms of effective lifetime and Data/Energy Ratio compared with native LEACH, which relies on other routing algorithms to access global information. A complementary exponential data correlation model is also introduced to simulate different data aggregation effect.
520 $a To better understand the clustering issue in wireless sensor networks, we model the end-to-end distance for a given number of hops in dense planar Wireless Sensor Networks in this dissertation. We derive that the single-hop distance and postulate Beta distribution for 2-hop distance shows Beta distribution for two hops. The multi-hop distance approaches Gaussian when the number of hops is three or greater. Our error analysis also shows the distance error can be minimized by exploiting the distribution knowledge. Based on this model, we propose a Maximum Likelihood decision to decide to the number of hops given the distance between two nodes. Due to the computational complexity of conditional pdf of the number of hops given the distance, we also propose an attenuated Gaussian approximation for the conditional pdf. We show that the approximation visibly simplifies the decision process and the error analysis. The latency and energy consumption estimation are also included as application examples. Simulations show that our approximation model can predict the latency and energy consumption with less than half RMSE, compared to the linear models.
520 $a In this dissertation, we also study the optimal cluster size in Underwater Acoustic networks. Due to the sparse deployment and channel property, the clustering characteristics of UA is different from that of aerial sensor networks. We show that the optimal cluster size is also relevant to the working frequency of the acoustic transmission.
590 $a School code: 2502.
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0544
710 2 0 $a The University of Texas at Arlington. $3 1025869
773 0 $t Dissertation Abstracts International $g 67-03B.
790 1 0 $a Liang, Qilian, $e advisor
790 $a 2502
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3212090