By Topic

IEEE Transactions on Mobile Computing

Issue 4 • Date April 2010

Filter Results

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

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

    Publication Year: 2010, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (134 KB)
    Freely Available from IEEE
  • Extended Knowledge-Based Reasoning Approach to Spectrum Sensing for Cognitive Radio

    Publication Year: 2010, Page(s):465 - 478
    Cited by:  Papers (21)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3460 KB) | HTML iconHTML

    In this paper, a novel scheme for cognitive radio (CR) spectrum sensing in medium access control (MAC) layer, called as extended knowledge-based reasoning (EKBR), is proposed. The target of EKBR is to improve the fine sensing efficiency by jointly considering a number of network states and environmental statistics, including fast sensing results, short-term statistical information, channel quality... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Edge-Constrained Localized Delaunay Graph for Geographic Routing in Mobile Ad Hoc and Sensor Networks

    Publication Year: 2010, Page(s):479 - 490
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1778 KB) | HTML iconHTML

    In mobile ad hoc and sensor networks, since all nodes are mobile and there is no fixed infrastructure, the design of routing protocols becomes one of the most challenging issues. In recent years, geographic routing protocols have been widely used. Most of them, e.g., greedy-face-greedy routing protocols, need nodes to construct planar graphs as the underlying graphs. In this paper, we propose an e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local Barrier Coverage in Wireless Sensor Networks

    Publication Year: 2010, Page(s):491 - 504
    Cited by:  Papers (95)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2587 KB) | HTML iconHTML

    Global barrier coverage, which requires much fewer sensors than full coverage, is known to be an appropriate model of coverage for movement detection applications such as intrusion detection. However, it has been proved that given a sensor deployment, sensors can not locally determine whether the deployment provides global barrier coverage, making it impossible to develop localized algorithms, thu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Relay-Assignment Protocols for Coverage Expansion in Cooperative Wireless Networks

    Publication Year: 2010, Page(s):505 - 515
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1808 KB) | HTML iconHTML

    One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implementing cooperation protocols is how to select relay-source pairs. In this paper, we address this problem based on the knowledge of the users' spatial distribution which determines the channel statistics. We consider two sce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Localization Scheme for Mobile Sensor Networks

    Publication Year: 2010, Page(s):516 - 526
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2052 KB) | HTML iconHTML

    Localization is an essential and important research issue in wireless sensor networks (WSNs). Most localization schemes focus on static sensor networks. However, mobile sensors are required in some applications such that the sensed area can be enlarged. As such, a localization scheme designed for mobile sensor networks is necessary. In this paper, we propose a localization scheme to improve the lo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-Optimal Scheduling with Dynamic Channel Acquisition in Wireless Downlinks

    Publication Year: 2010, Page(s):527 - 539
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1305 KB) | HTML iconHTML

    We consider a wireless base station serving L users through L time-varying channels. It is well known that opportunistic scheduling algorithms with full channel state information (CSI) can stabilize the system with any data rates within the capacity region. However, such opportunistic scheduling algorithms may not be energy efficient when the cost of channel acquisition is high and traffic rates a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Multihop Distances in Wireless Sensor Networks with Random Node Locations

    Publication Year: 2010, Page(s):540 - 552
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2532 KB) | HTML iconHTML

    Location and intersensor distance estimations are important functions for the operation of wireless sensor networks, especially when protocols can benefit from the distance information prior to network deployment. The maximum multihop distance that can be covered in a given number of hops in a sensor network is one such parameter related with coverage area, delay, and minimal multihop transmission... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models

    Publication Year: 2010, Page(s):553 - 565
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (765 KB) | HTML iconHTML

    Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of source-destination pairs), optimization of throughput entails design of ??efficient?? routes between the given source-destination pairs, in conjunction with (1) assignment of channels to interfaces and communication links an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-Efficient VoIP over Wireless LANs

    Publication Year: 2010, Page(s):566 - 581
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2862 KB) | HTML iconHTML

    Emerging dual-mode phones incorporate a wireless LAN (WLAN) interface along with the traditional cellular interface. The additional benefits of the WLAN interface are, however, likely to be outweighed by its greater rate of energy consumption. This is especially of concern when real-time applications, that result in continuous traffic, are involved. WLAN radios typically conserve energy by staying... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rules of Designing Routing Metrics for Greedy, Face, and Combined Greedy-Face Routing

    Publication Year: 2010, Page(s):582 - 595
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1613 KB) | HTML iconHTML

    Different geographic routing protocols have different requirements on routing metric designs to ensure proper operation. Combining a wrong type of routing metrics with a geographic routing protocol may produce unexpected results, such as geographic routing loops and unreachable nodes. In this paper, we propose a novel routing algebra system to investigate the compatibilities between routing metric... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DCAR: Distributed Coding-Aware Routing in Wireless Networks

    Publication Year: 2010, Page(s):596 - 608
    Cited by:  Papers (79)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2344 KB) | HTML iconHTML

    Recently, there has been a growing interest of using network coding to improve the performance of wireless networks, for example, authors of proposed the practical wireless network coding system called COPE, which demonstrated the throughput gain achieved by network coding. However, COPE has two fundamental limitations: (1) the coding opportunity is crucially dependent on the established routes an... View full abstract»

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

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

    Publication Year: 2010, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (221 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