By Topic

IEEE Transactions on Mobile Computing

Issue 4 • Date April 2009

Filter Results

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

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

    Publication Year: 2009, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (112 KB)
    Freely Available from IEEE
  • Papers 
  • A Tabu Search Algorithm for Cluster Building in Wireless Sensor Networks

    Publication Year: 2009, Page(s):433 - 444
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2306 KB) | HTML iconHTML

    The main challenge in wireless sensor network deployment pertains to optimizing energy consumption when collecting data from sensor nodes. This paper proposes a new centralized clustering method for a data collection mechanism in wireless sensor networks, which is based on network energy maps and quality-of-service (QoS) requirements. The clustering problem is modeled as a hypergraph partitioning ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BSMR: Byzantine-Resilient Secure Multicast Routing in Multihop Wireless Networks

    Publication Year: 2009, Page(s):445 - 459
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4425 KB) | HTML iconHTML

    Multihop wireless networks rely on node cooperation to provide multicast services. The multihop communication offers increased coverage for such services but also makes them more vulnerable to insider (or Byzantine) attacks coming from compromised nodes that behave arbitrarily to disrupt the network. In this work, we identify vulnerabilities of on-demand multicast routing protocols for multihop wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks

    Publication Year: 2009, Page(s):460 - 474
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1674 KB) | HTML iconHTML

    We present a local distributed algorithm that, given a wireless ad hoc network modeled as a unit disk graph U in the plane, constructs a planar power spanner of U whose degree is bounded by k and whose stretch factor is bounded by 1 + (2sin pi/k)p, where k ges 10 is an integer parameter and p isin [2, 5] is the power exponent constant. For the same degree bound k, the stretch factor of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximizing Unavailability Interval for Energy Saving in IEEE 802.16e Wireless MANs

    Publication Year: 2009, Page(s):475 - 487
    Cited by:  Papers (31)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2565 KB) | HTML iconHTML

    This paper presents an energy conservation scheme, Maximum Unavailability Interval (MUI), to improve the energy efficiency for the Power Saving Class of Type II in IEEE 802.16e. By applying the Chinese Remainder Theorem, the proposed MUI is guaranteed to find the maximum Unavailability Interval, during which the transceiver can be powered down. We also propose new mathematical techniques to reduce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks

    Publication Year: 2009, Page(s):488 - 499
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (899 KB) | HTML iconHTML

    Wireless ad hoc and sensor networks (WSNs) often require a connected dominating set (CDS) as the underlying virtual backbone for efficient routing. Nodes in a CDS have extra computation and communication load for their role as dominator, subjecting them to an early exhaustion of their battery. A simple mechanism to address this problem is to switch from one CDS to another fresh CDS, rotating the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Biased Random Walks in Uniform Wireless Networks

    Publication Year: 2009, Page(s):500 - 513
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2916 KB) | HTML iconHTML

    A recurrent problem when designing distributed applications is to search for a node with known property. File searching in peer-to-peer (P2P) applications, resource discovery in service-oriented architectures (SOAs), and path discovery in routing can all be cast as a search problem. Random walk-based search algorithms are often suggested for tackling the search problem, especially in very dynamic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Many-to-One Throughput Capacity of IEEE 802.11 Multihop Wireless Networks

    Publication Year: 2009, Page(s):514 - 527
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2606 KB) | HTML iconHTML

    This paper investigates the many-to-one throughput capacity (and by symmetry, one-to-many throughput capacity) of IEEE 802.11 multihop networks, in which many sources send data to a sink. An example of a practical scenario is that of a multihop mesh network connecting source and relay nodes to an Internet gateway. In the trivial case where all source nodes are just one hop from the sink, the syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-Based Techniques for Data Reliability in Wireless Sensor Networks

    Publication Year: 2009, Page(s):528 - 543
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3102 KB) | HTML iconHTML

    Wireless sensor networks are a fast-growing class of systems. They offer many new design challenges, due to stringent requirements like tight energy budgets, low-cost components, limited processing resources, and small footprint devices. Such strict design goals call for technologies like nanometer-scale semiconductor design and low-power wireless communication to be used. But using them would als... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic Discovery of Semantically Diverse Content in MANETs

    Publication Year: 2009, Page(s):544 - 557
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1053 KB) | HTML iconHTML

    Mobile ad hoc networks rely on the opportunistic interaction of autonomous nodes to form networks without the use of infrastructure. Given the radically decentralized nature of such networks, their potential for autonomous communication is significantly improved when the need for a priori consensus among the nodes is kept to a minimum. This paper addresses an issue within the domain of semantic co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Intra-Network and Cross-Layer Handover (FINCH) for WiMAX and Mobile Internet

    Publication Year: 2009, Page(s):558 - 574
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2982 KB) | HTML iconHTML

    To support fast and efficient handovers in mobile WiMAX, we propose fast intra-network and cross-layer handover (FINCH) for intradomain (intra-CSN) mobility management. FINCH is a complementary protocol to mobile IP (MIP), which deals with interdomain (inter-CSN) mobility management in mobile WiMAX. FINCH can reduce not only the handover latency but also the end-to-end latency for MIP. Paging exte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Raise Your Profile with the CSDP Credential

    Publication Year: 2009, Page(s): 575
    Request permission for commercial reuse | PDF file iconPDF (60 KB)
    Freely Available from IEEE
  • Join the IEEE Computer Society [advertisement]

    Publication Year: 2009, Page(s): 576
    Request permission for commercial reuse | PDF file iconPDF (45 KB)
    Freely Available from IEEE
  • TMC Information for authors

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

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

Aims & Scope

Mobile Computing, as proposed in this Transactions, focuses on the key technical issues related to (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Prasant Mohapatra
Interim Vice-Provost and CIO
Professor, Dept. Computer Science
University of California, Davis, USA
pmohapatra@ucdavis.edu