Current Search:  Electronic digital computers--Power supply (x)

View All Items

  • CSV Spreadsheet
(1 - 3 of 3)
Energy-efficient routing in ad hoc wireless networks
Title
Energy-efficient routing in ad hoc wireless networks.
Creator
Dai, Qing., Florida Atlantic University, Wu, Jie
Abstract/Description
The ad hoc wireless network is an infrastructureless network, where mobile stations are typically powered by batteries. Energy conservation has therefore becomes a very important issue. In this thesis, we discuss our work on several problems in energy-efficient routing. Chapter 3 focuses on how to compute the minimum uniform broadcast transmission power in an ad hoc wireless network. Several algorithms are proposed and their running time compared through simulation. It is shown that Prim's...
Show moreThe ad hoc wireless network is an infrastructureless network, where mobile stations are typically powered by batteries. Energy conservation has therefore becomes a very important issue. In this thesis, we discuss our work on several problems in energy-efficient routing. Chapter 3 focuses on how to compute the minimum uniform broadcast transmission power in an ad hoc wireless network. Several algorithms are proposed and their running time compared through simulation. It is shown that Prim's Minimum Spanning Tree (MST) has better performance than Kruskal's MST and the two binary search algorithms. In the following two chapters, routing algorithms are studied for specific situations, when directional antenna is used (Chapter 4) or when partial signal could be collected, stored and integrated (Chapter 5). Different algorithms are discussed and their energy performance illustrated by simulation study. Their application and limitation are also discussed in the thesis.
Show less
Date Issued
2003
PURL
http://purl.flvc.org/fcla/dt/13077
Subject Headings
Wireless communication systems, Routers (Computer networks), Electronic digital computers--Power supply, Mobile computing
Format
Document (PDF)
Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets
Title
Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets.
Creator
Wu, Bing., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description
In mobile ad hoc wireless networks (MANET), due to host mobility, broadcasting is expected to be frequently used to find a route to a particular host, to page a host, and to alarm all hosts. A straightforward broadcasting by flooding is usually very costly and results in substantial redundancy and more energy consumption. Power consumption is an important issue since most mobile hosts operate on battery. Broadcasting based on a connected dominating set (CDS) is a promising approach, where...
Show moreIn mobile ad hoc wireless networks (MANET), due to host mobility, broadcasting is expected to be frequently used to find a route to a particular host, to page a host, and to alarm all hosts. A straightforward broadcasting by flooding is usually very costly and results in substantial redundancy and more energy consumption. Power consumption is an important issue since most mobile hosts operate on battery. Broadcasting based on a connected dominating set (CDS) is a promising approach, where only nodes inside CDS need to relay the broadcast packet. Wu and Li proposed a simple distributed algorithm for calculating CDS in MANET. In general, nodes inside CDS consume more energy to handle various bypass traffics than nodes outside the set. To prolong the life span of each node and, hence, the network by balancing the energy consumption in the system, nodes should be alternated in being chosen to form a CDS. Activity scheduling deals with the way to rotate the role of each node among a set of given operation modes. In thesis I propose to apply power-aware CDS notions to broadcasting and activity scheduling. I also introduce distance rule and extended rules to further reduce broadcasting energy consumption. The effectiveness of the proposed method are confirmed through my simulation experiment.
Show less
Date Issued
2002
PURL
http://purl.flvc.org/fcla/dt/12958
Subject Headings
Mobile computing, Wireless communication systems, Electronic digital computers--Power supply
Format
Document (PDF)
Local construction of connected dominating sets in wireless ad hoc networks
Title
Local construction of connected dominating sets in wireless ad hoc networks.
Creator
Dai, Fei., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description
Wireless ad hoc networks are infrastructure-less multi-hop networks consisting of mobile (such as in mobile ad hoc networks) or stationary (such as in wireless sensor networks) wireless devices. These networks involve several challenges, including limited bandwidth and energy resources, frequent topology changes, and a lack of central control. Local acting, self-organizing, and self-healing algorithms (also called localized algorithms) are essential to the design of wireless ad hoc networks....
Show moreWireless ad hoc networks are infrastructure-less multi-hop networks consisting of mobile (such as in mobile ad hoc networks) or stationary (such as in wireless sensor networks) wireless devices. These networks involve several challenges, including limited bandwidth and energy resources, frequent topology changes, and a lack of central control. Local acting, self-organizing, and self-healing algorithms (also called localized algorithms) are essential to the design of wireless ad hoc networks. A connected dominating set (CDS) is frequently used in wireless ad hoc networks as a virtual backbone to support efficient routing, service discovery, and area monitoring. In addition, efficient broadcasting (i.e., finding a small set of forward nodes to ensure full delivery) can be viewed as forming a CDS on-the-fly. The periodically maintained virtual backbone is called a static CDS, and the temporarily formed forward node set is called a dynamic CDS. For efficiency and robustness, the ideal CDS construction algorithm is lightweight, has fast convergence, and minimizes the CDS size. This dissertation focuses on providing a generic framework to unify localized CDS construction schemes, including both static and dynamic CDS constructions, for wireless ad hoc networks. The goal is to provide insights on how to form a small CDS (forward node set) in dynamic networks with affordable overhead and high robustness. A classification of CDS construction algorithms for wireless ad hoc networks has been provided at the beginning. An efficient scheme, called Rule K, has been proposed for static CDS construction. Rule K achieves a probabilistic constant upper bound on the expected CDS size, which is currently the best known performance guarantee for localized CDS algorithms. Rule K has been extended to a unified framework, called the coverage condition, which contains most existing localized virtual backbone construction and efficient broadcast algorithms as its special cases. The coverage condition has been further extended to construct a k-connected k-dominating set for higher robustness, and integrated in an iterative process that further reduces the CDS size while maintaining the same level of robustness.
Show less
Date Issued
2005
PURL
http://purl.flvc.org/fcla/dt/12144
Subject Headings
Wireless communication systems, Electronic digital computers--Power supply, Mobile computing, Sensor networks
Format
Document (PDF)