A utility-based routing scheme in multi-hop wireless networks.Reportar como inadecuado

 A utility-based routing scheme in multi-hop wireless networks.

A utility-based routing scheme in multi-hop wireless networks. - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Type of Resource: text

Genre: Electronic Thesis or Dissertation

Issuance: multipart monograph

Date Issued: 2008

Publisher: Florida Atlantic University

Physical Form: electronic

Extent: xiv, 168 p. : ill.

Language(s): English

Summary: Multi-hop wireless networks are infrastructure-less networks consisting of mobile or stationary wireless devices, which include multi-hop wireless mesh networks and multi-hop wireless sensor networks. These networks are characterized by limited bandwidth and energy resources, unreliable communication, and a lack of central control. These characteristics lead to the research challenges of multi-hop wireless networks. Building up routing schemes with good balance among the routing QoS (such as reliability, cost, and delay) is a paramount concern to achieve high performance wireless networks. These QoS metrics are internally correlated. Most existing works did not fully utilize this correlation. We design a metric to balance the trade-off between reliability and cost, and build up a framework of utility-based routing model in multi-hop wireless networks. This dissertation focuses on the variations with applications of utility-based routing models, designing new concepts, and developing new algorithms for them. A review of existing routing algorithms and the basic utility-based routing model for multi-hop wireless networks has been provided at the beginning. An efficient algorithm, called MaxUtility, has been proposed for the basic utility-based routing model. MaxUtility is an optimal algorithm that can find the best routing path with the maximum expected utility.

Summary: Various utility-based routing models are extended to further enhance the routing reliability while reducing the routing overhead. Besides computing the optimal path for a given benefit value and a given source-destination pair, the utility-based routing can be further extended to compute all optimal paths for all possible benefit values and/or all source-destination pairs. Our utility-based routing can also adapt to different applications and various environments. In the self-organized environment, where network users are selfish, we design a truthful routing, where selfish users have to tell the truth in order to maximize their utilities. We apply our utility-based routing scheme to the data-gathering wireless sensor networks, where a routing scheme is required to transmit data sensed by multiple sensor nodes to a common sink node.

Identifier: 243827980 (oclc), 77647 (digitool), FADT77647 (IID), fau:4307 (fedora)

Note(s): by Mingming Lu.Vita.University Library's copy lacks signatures of Supervisory Committee.Thesis (Ph.D.)--Florida Atlantic University, 2008.Includes bibliography.Electronic reproduction. Boca Raton, FL : 2008 Mode of access: World Wide Web.

Subject(s): Wireless communication systems -- Security measuresComputer network protocolsComputer algorithmsComputer networks -- Security measures

Held by: FBoU FAUER

Persistent Link to This Record: http://purl.flvc.org/FAU/77647

Owner Institution: FAU

Autor: Lu, Mingming. College of Engineering and Computer Science Florida Atlantic University

Fuente: http://fau.digital.flvc.org/islandora/object/fau%3A4307


Documentos relacionados