By Topic

Networking, IEEE/ACM Transactions on

Issue 6 • Date Dec. 2010

Filter Results

Displaying Results 1 - 25 of 29
  • [Front cover]

    Publication Year: 2010 , Page(s): C1 - C4
    Save to Project icon | Request Permissions | PDF file iconPDF (409 KB)  
    Freely Available from IEEE
  • IEEE/ACM Transactions on Networking publication information

    Publication Year: 2010 , Page(s): C2
    Save to Project icon | Request Permissions | PDF file iconPDF (37 KB)  
    Freely Available from IEEE
  • Design and Analysis of Mobility-Aware Clustering Algorithms for Wireless Mesh Networks

    Publication Year: 2010 , Page(s): 1677 - 1690
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1318 KB) |  | HTML iconHTML  

    One of the major concerns in wireless mesh networks (WMNs) is the radio resource utilization efficiency, which can be enhanced by efficiently managing the mobility of users. To achieve this, we propose in this paper the use of mobility-aware clustering. The main idea behind WMN clustering is to restrict a major part of the exchanged signaling messages due to the mobility of users to a local area (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Multicast Capacity of Large Multihop Wireless Networks

    Publication Year: 2010 , Page(s): 1691 - 1700
    Cited by:  Papers (19)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (708 KB) |  | HTML iconHTML  

    We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicast sessions may coexist. We first calculate an upper bound on the achievable transmission rate per multicast flow as a function of the number of multicast sources in such a network. We then propose a simple comb-based arch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference

    Publication Year: 2010 , Page(s): 1701 - 1712
    Cited by:  Papers (23)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (538 KB) |  | HTML iconHTML  

    In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node depends on the signa-to-interference-plus-noise ratio (SINR). While most previous work on wireless networks has addressed the scheduling problem using simplistic graph-based or distance-based interference models, a few r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Optimal SINR-Based Scheduling in Multihop Wireless Networks

    Publication Year: 2010 , Page(s): 1713 - 1724
    Cited by:  Papers (18)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (815 KB) |  | HTML iconHTML  

    In this paper, we revisit the problem of determining the minimum-length schedule that satisfies certain traffic demands in a wireless network. Traditional approaches for the determination of minimum-length schedules are based on a collision channel model, in which neighboring transmissions cause destructive interference if and only if they are within the “interference region” of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Internet QoS and Regulations

    Publication Year: 2010 , Page(s): 1725 - 1737
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (668 KB) |  | HTML iconHTML  

    This paper investigates Internet service provider (ISP) incentives with a single-service class and with two-service classes in the Internet. We consider multiple competing ISPs who offer network access to a fixed user base, consisting of end-users who differ in their quality requirements and willingness to pay for the access. We model user-ISP interactions as a game in which each ISP makes capacit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Epidemic-Based Information Dissemination in Wireless Mobile Sensor Networks

    Publication Year: 2010 , Page(s): 1738 - 1751
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (458 KB) |  | HTML iconHTML  

    In this paper, we consider wireless mobile sensor networks under extreme environments where nodes: 1) have local knowledge; 2) have limited computational power; 3) make distributed decisions; and 4) move rapidly over time. Information dissemination in these networks (or gossip) can be modeled via epidemic models that analyze behavior of the system mimicking the way diseases spread (or even gossip ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Power of One Move: Hashing Schemes for Hardware

    Publication Year: 2010 , Page(s): 1752 - 1765
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1119 KB) |  | HTML iconHTML  

    In a standard multiple-choice hashing scheme, each item is stored in one of hash table buckets. The availability of choice in where items are stored improves space utilization. These schemes are often very amenable to a hardware implementation, such as in a router. Recently, researchers have discovered powerful variants where items already in the hash table may be moved during the insertion of a n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiuser Diversity Gain in Cognitive Networks

    Publication Year: 2010 , Page(s): 1766 - 1779
    Cited by:  Papers (22)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (466 KB) |  | HTML iconHTML  

    Dynamic allocation of resources to the best link in large multiuser networks offers considerable improvement in spectral efficiency. This gain, often referred to as multiuser diversity gain, can be cast as double-logarithmic growth of the network throughput with the number of users. In this paper, we consider large cognitive networks granted concurrent spectrum access with license-holding users. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling Prioritized Services in Multihop OFDMA Networks

    Publication Year: 2010 , Page(s): 1780 - 1792
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (713 KB) |  | HTML iconHTML  

    Growing popularity of high-speed wireless broadband access for real-time applications makes it increasingly relevant to study the admission control and scheduling of flows in a service differentiated manner. Next-generation wireless broadband networks employ orthogonal frequency division multiple access (OFDMA) technology that enables multiple users to communicate at the same time using a time-fre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling the Dynamics of Network Technology Adoption and the Role of Converters

    Publication Year: 2010 , Page(s): 1793 - 1805
    Cited by:  Papers (18)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1058 KB) |  | HTML iconHTML  

    New network technologies constantly seek to displace incumbents. Their success depends on technological superiority, the size of the incumbent's installed base, users' adoption behaviors, and various other factors. The goal of this paper is to develop an understanding of competition between network technologies and identify the extent to which different factors, in particular converters (a.k.a. ga... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks

    Publication Year: 2010 , Page(s): 1806 - 1814
    Cited by:  Papers (21)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1022 KB) |  | HTML iconHTML  

    The proliferation of wireless and mobile devices has fostered the demand of context-aware applications, in which location is often viewed as one of the most significant contexts. Classically, trilateration is widely employed for testing network localizability; even in many cases, it wrongly recognizes a localizable graph as nonlocalizable. In this study, we analyze the limitation of trilateration-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • iSPY: Detecting IP Prefix Hijacking on My Own

    Publication Year: 2010 , Page(s): 1815 - 1828
    Cited by:  Papers (15)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (794 KB) |  | HTML iconHTML  

    IP prefix hijacking remains a major threat to the security of the Internet routing system due to a lack of authoritative prefix ownership information. Despite many efforts in designing IP prefix hijack detection schemes, no existing design can satisfy all the critical requirements of a truly effective system: real-time, accurate, lightweight, easily and incrementally deployable, as well as robust ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Safe Interdomain Routing Under Diverse Commercial Agreements

    Publication Year: 2010 , Page(s): 1829 - 1840
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (849 KB) |  | HTML iconHTML  

    Commercial agreements drive the routing policies used in today's Internet. The two most extensively studied commercial agreements are transit and peering; however, they are only two of many diverse and continuously evolving commercial agreements that ISPs enter into. So far, the only known practical safe and robust routing policy is Gao and Rexford's policy guideline, which is applicable to transi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectrum Auction Framework for Access Allocation in Cognitive Radio Networks

    Publication Year: 2010 , Page(s): 1841 - 1854
    Cited by:  Papers (17)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (435 KB) |  | HTML iconHTML  

    In cognitive radio networks, there are two categories of networks on different channels: primary networks, which have high-priority access, and secondary networks, which have low-priority access. We develop an auction-based framework that allows networks to bid for primary and secondary access based on their utilities and traffic demands. The bids are used to solve the access allocation problem, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The ForwardDiffSig Scheme for Multicast Authentication

    Publication Year: 2010 , Page(s): 1855 - 1868
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (816 KB) |  | HTML iconHTML  

    This paper describes ForwardDiffSig, an efficient scheme for multicast authentication with forward security. This scheme provides source authentication, data integrity, and non-repudiation since it is based on the use of asymmetric cryptography. At the same time, it offers also protection against key exposure as it exploits OptiSum, our optimized implementation of the ISum forward-secure signature... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Provisioning of WDM Networks With Many-to-Many Traffic Grooming

    Publication Year: 2010 , Page(s): 1869 - 1882
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (568 KB) |  | HTML iconHTML  

    A large number of network applications today allow several users to interact together using the many-to-many service mode. In many-to-many communication, also referred to as group communication, a session consists of a group of users (we refer to them as members), where each member transmits its traffic to all other members in the same group. In this paper, we address the problem of designing and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms and Models for Backup Reprovisioning in WDM Networks

    Publication Year: 2010 , Page(s): 1883 - 1894
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1103 KB) |  | HTML iconHTML  

    Protection techniques for optical networks mainly rely on preallocated backup bandwidth, which may not be able to provide full protection guarantee when multiple failures occur in a network. To protect against multiple concurrent potential failures and to utilize the available resources more efficiently, strategies such as backup reprovisioning (BR) rearrange backups of protected connections after... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diverse Routing in Networks With Probabilistic Failures

    Publication Year: 2010 , Page(s): 1895 - 1907
    Cited by:  Papers (29)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (828 KB) |  | HTML iconHTML  

    We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failures, recovering from multiple failures is not guaranteed. In particular, events such as natural disasters or intentional attacks can lead to multiple correlated failures, for which recovery mechanisms are not well understood... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cross-Layer Hybrid FEC/ARQ Reliable Multicast With Adaptive Modulation and Coding in Broadband Wireless Networks

    Publication Year: 2010 , Page(s): 1908 - 1920
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (544 KB) |  | HTML iconHTML  

    In this paper, we define and address a new problem that arises when a base station in a broadband wireless network wishes to multicast information to a large group of nodes and to guarantee some level of reliability using Application-layer forward error correction (FEC) codes. Every data block to be multicast is translated into a sequence of packets, from which every receiver must receive at least... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Medium Access Control Protocols With Memory

    Publication Year: 2010 , Page(s): 1921 - 1934
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (742 KB) |  | HTML iconHTML  

    Many existing medium access control (MAC) protocols utilize past information (e.g., the results of transmission attempts) to adjust the transmission parameters of users. This paper provides a general framework to express and evaluate distributed MAC protocols utilizing a finite length of memory for a given form of feedback information. We define protocols with memory in the context of a slotted ra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Validity of IEEE 802.11 MAC Modeling Hypotheses

    Publication Year: 2010 , Page(s): 1935 - 1948
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (642 KB) |  | HTML iconHTML  

    We identify common hypotheses on which a large number of distinct mathematical models of WLANs employing IEEE 802.11 are founded. Using data from an experimental test bed and packet-level ns-2 simulations, we investigate the veracity of these hypotheses. We demonstrate that several of these assumptions are inaccurate and/or inappropriate. We consider hypotheses used in the modeling of saturated an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modulation Rate Adaptation in Urban and Vehicular Environments: Cross-Layer Implementation and Experimental Evaluation

    Publication Year: 2010 , Page(s): 1949 - 1962
    Cited by:  Papers (46)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1263 KB) |  | HTML iconHTML  

    Accurately selecting modulation rates for time-varying channel conditions is critical for avoiding performance degradations due to rate overselection when channel conditions degrade or underselection when channel conditions improve. In this paper, we design a custom cross-layer framework that enables: 1) implementation of multiple and previously unimplemented rate adaptation mechanisms; 2) experim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Near-Optimal Multicriteria Spanner Constructions in Wireless Ad Hoc Networks

    Publication Year: 2010 , Page(s): 1963 - 1976
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (543 KB) |  | HTML iconHTML  

    In this paper, we study asymmetric power assignments that induce a low-energy k-strongly connected communication graph with spanner properties. We address two spanner models: energy and distance. The former serves as an indicator for the energy consumed in a message propagation between two nodes, while the latter reflects the geographic properties of routing in the induced communication graph. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

The IEEE/ACM Transactions on Networking’s high-level objective is to publish high-quality, original research results derived from theoretical or experimental exploration of the area of communication/computer networking.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
R. Srikant
Dept. of Electrical & Computer Engineering
Univ. of Illinois at Urbana-Champaign