IEEE Transactions on Parallel and Distributed Systems

Issue 4 • April 2006

Filter Results

Displaying Results 1 - 14 of 14
  • [Front cover]

    Publication Year: 2006, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (96 KB)
    Freely Available from IEEE
  • Localized Communication and Topology Protocols for Ad Hoc Networks: A Preface to the Special Section

    Publication Year: 2006, Page(s):289 - 291
    Request permission for commercial reuse | PDF file iconPDF (112 KB) | HTML iconHTML
    Freely Available from IEEE
  • Localized protocols for ad hoc clustering and backbone formation: a performance comparison

    Publication Year: 2006, Page(s):292 - 306
    Cited by:  Papers (87)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2272 KB) | HTML iconHTML

    This paper concerns the comparative performance evaluation of protocols for clustering and backbone formation in ad hoc networks characterized by a large number of resource-constrained nodes. Our aim is twofold: we provide the first simulation-based detailed investigation of techniques for clustering and backbone formation that are among the most representative of this area of ad hoc research. Sec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Localized fault-tolerant topology control in wireless ad hoc networks

    Publication Year: 2006, Page(s):307 - 320
    Cited by:  Papers (78)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3240 KB) | HTML iconHTML

    Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. As a result, the derived topology is more susceptible to node failures or departures. In this paper, we resolve this... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Localized topology control for unicast and broadcast in wireless ad hoc networks

    Publication Year: 2006, Page(s):321 - 334
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1868 KB) | HTML iconHTML

    We propose a novel localized topology-control algorithm for each wireless node to locally select communication neighbors and adjust its transmission power accordingly such that all nodes together self-form a topology that is energy efficient simultaneously for both unicast and broadcast communications. We theoretically prove that the proposed topology is planar, which meets the requirement of cert... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient broadcasting in ad hoc wireless networks using directional antennas

    Publication Year: 2006, Page(s):335 - 347
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2872 KB) | HTML iconHTML

    Using directional antennas to conserve bandwidth and energy consumption in ad hoc wireless networks (or simply ad hoc networks) is becoming popular. However, applications of directional antennas for broadcasting have been limited. We propose a novel broadcast protocol called directional self-pruning (DSP) for ad hoc wireless networks using directional antennas. DSP is a nontrivial generalization o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of sensing coverage on greedy geographic routing algorithms

    Publication Year: 2006, Page(s):348 - 360
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1448 KB) | HTML iconHTML

    Greedy geographic routing is an attractive localized routing scheme for wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may fail due to routing voids on random network topologies. We study greedy geographic routing in an important class of wireless sensor networks (e.g., surveillance or object tracking systems) that provide sensing coverage over a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of a beacon enabled IEEE 802.15.4 cluster with downlink and uplink traffic

    Publication Year: 2006, Page(s):361 - 376
    Cited by:  Papers (73)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2832 KB) | HTML iconHTML

    The performance of an IEEE 802.15.4 compliant network operating in the beacon enabled mode with both downlink and uplink traffic is analyzed through discrete time Markov chains and the theory of M/G/1 queues. The model considers acknowledged transmissions and includes the impact of different network and traffic parameters such as the packet arrival rate, packet size, inactive period between the be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load-balanced short-path routing in wireless networks

    Publication Year: 2006, Page(s):377 - 388
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1288 KB) | HTML iconHTML

    We study routing algorithms on wireless networks that use only short paths, for minimizing latency, and achieve good load balance, for balancing the energy use. We consider the special case when all the nodes are located in a narrow strip with width at most √3/2 ≈ 0.86 times the communication radius. We present algorithms that achieve good performance in terms of both measures simultan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to improve safety under convergence using stable storage

    Publication Year: 2006, Page(s):389 - 398
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB) | HTML iconHTML

    We present a new method for avoiding false privileges with the aid of stable storage. The method is motivated by the commitment in database systems. The commit guarantees that a write operation to stable storage has successfully completed. Since programs are stored in stable storage in self-stabilization, we assume that the stable values are also free from any transient fault. They sometimes give ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "RAID5 performance with distributed sparing"

    Publication Year: 2006, Page(s):399 - 400
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (70 KB) | HTML iconHTML

    We provide an improved performance analysis of zoned disk drives, especially the seek distance distribution, than in a paper by Thomasian and Menon. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TPDS Information for authors

    Publication Year: 2006, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (96 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2006, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE

Aims & Scope

IEEE Transactions on Parallel and Distributed Systems (TPDS) is published monthly. It publishes a range of papers, comments on previously published papers, and survey articles that deal with the parallel and distributed systems research areas of current importance to our readers.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
David Bader
College of Computing
Georgia Institute of Technology