By Topic

Local Computer Networks, 2008. LCN 2008. 33rd IEEE Conference on

Date 14-17 Oct. 2008

Filter Results

Displaying Results 1 - 25 of 180
  • 33rd annual IEEE conference on local computer networks - LCN 2008

    Page(s): i - vii
    Save to Project icon | Request Permissions | PDF file iconPDF (42 KB)  
    Freely Available from IEEE
  • 2nd IEEE LCN workshop on user mobility and vehicular networks - ON-MOVE 2008

    Page(s): viii
    Save to Project icon | Request Permissions | PDF file iconPDF (26 KB)  
    Freely Available from IEEE
  • 4th IEEE international workshop on performance and management of wireless and mobile networks - P2MNET 2008

    Page(s): ix - x
    Save to Project icon | Request Permissions | PDF file iconPDF (30 KB)  
    Freely Available from IEEE
  • 3rd international workshop on practical issues in building sensor network applications - SENSEAPP 2008

    Page(s): xi - xii
    Save to Project icon | Request Permissions | PDF file iconPDF (30 KB)  
    Freely Available from IEEE
  • 8th international workshop on wireless local networks - WLN 2008

    Page(s): xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (30 KB)  
    Freely Available from IEEE
  • 3rd IEEE LCN workshop on network measurements - WNM 2008

    Page(s): xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (27 KB)  
    Freely Available from IEEE
  • 4th IEEE LCN workshop on network security - WNS 2008

    Page(s): xv
    Save to Project icon | Request Permissions | PDF file iconPDF (29 KB)  
    Freely Available from IEEE
  • Message from the General Chair

    Page(s): 1 - 2
    Save to Project icon | Request Permissions | PDF file iconPDF (143 KB)  
    Freely Available from IEEE
  • Message from the Program Chairs

    Page(s): 3
    Save to Project icon | Request Permissions | PDF file iconPDF (158 KB)  
    Freely Available from IEEE
  • LCN Organizing Committee

    Page(s): 4
    Save to Project icon | Request Permissions | PDF file iconPDF (149 KB)  
    Freely Available from IEEE
  • LCN Program Committee

    Page(s): 5 - 7
    Save to Project icon | Request Permissions | PDF file iconPDF (135 KB)  
    Freely Available from IEEE
  • GENI - global environment for network innovations

    Page(s): 8
    Save to Project icon | Request Permissions | PDF file iconPDF (108 KB)  
    Freely Available from IEEE
  • Distributed search revisited: Resolving the conflict of flexibility and efficiency

    Page(s): 9 - 10
    Save to Project icon | Request Permissions | PDF file iconPDF (107 KB)  
    Freely Available from IEEE
  • LCN 2008 sponsors

    Page(s): 11
    Save to Project icon | Request Permissions | PDF file iconPDF (145 KB)  
    Freely Available from IEEE
  • Cooperative caching: The case for P2P traffic

    Page(s): 12 - 19
    Save to Project icon | Request Permissions | PDF file iconPDF (199 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Experimental comparison of peer-to-peer streaming overlays: An application perspective

    Page(s): 20 - 27
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (219 KB) |  | HTML iconHTML  

    We compare two representative streaming systems using mesh-based and multiple tree-based overlay routing through deployments on the PlanetLab wide-area experimentation platform. To the best of our knowledge, this is the first study to compare streaming overlay architectures in real Internet settings, considering not only intuitive aspects such as scalability and performance under churn, but also less studied factors such as bandwidth and latency heterogeneity of overlay participants. Overall, our study indicates that mesh-based systems are superior for nodes with high bandwidth capabilities and low round trip times, while multi-tree based systems currently cope better with stringent real time deadlines under heterogeneous conditions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Range queries and load balancing in a hierarchically structured P2P system

    Page(s): 28 - 35
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (997 KB) |  | HTML iconHTML  

    Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, are used more and more for file-sharing and content distribution applications. However, a major weakness of traditional DHTs is the search for stored content, as data is assigned to nodes based on hash functions, and the very nature of hash tables allows only exact pattern matches. We present Cerco, a solution for the problem of range queries by using the principles of order-preserving DHTs and a hierarchically structured P2P approach. To guarantee an efficient routing and load balancing, Cerco uses a dynamic hierarchy of DHTs by creating subrings on demand and two explicit load balancing strategies. Our evaluation shows that Cerco is able to achieve the goals of supporting range queries, logarithmic-hop routing, and efficient load balancing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing low-latency overlay networks: Tree vs. mesh algorithms

    Page(s): 36 - 43
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (189 KB) |  | HTML iconHTML  

    Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, and to improve the system support for such applications, we investigate graph algorithms that construct low-latency overlay networks for application-layer multicast. In particular, we focus on reducing the diameter and the pair-wise latencies in the overlay. The overlay construction time is also considered, as it is often time-dependent in our dynamic target applications. Here, we have implemented and experimentally analyzed spanning-tree heuristics and mesh construction heuristics, and compared their performance and applicability to distributed interactive applications. We found that trees are faster to construct and save considerable amounts of resources in the network. Meshes, on the other hand, yield lower pair-wise latencies and increases the fault tolerance, but at the expense of increased resource consumption. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IP address assignment in wireless mesh networks

    Page(s): 44 - 51
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (328 KB) |  | HTML iconHTML  

    The demand for wireless networks which provide high bandwidth and access to the Internet continues. In recent years, a new class of networks which fulfill these requirements evolved, wireless mesh networks (WMNs). Although WMNs satisfy the demand for high bandwidth and Internet access, there is a further, fundamental factor of success: the simple use. Except for small networks, manual configuration is infeasible. The task of auto configuration includes the assignment of unique addresses, the management of free and assigned addresses, and the autonomous reaction to failures. In this paper we introduce and evaluate a novel auto configuration protocol for WMNs: the Dynamic WMN Configuration Protocol (DWCP). DWCP deals with all mentioned issues for large WMN installations and was deployed and evaluated in a real testbed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient cooperation of on-demand and proactive modes in Hybrid Wireless Mesh Protocol

    Page(s): 52 - 57
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (246 KB) |  | HTML iconHTML  

    Hybrid Wireless Mesh Protocol (HWMP) in IEEE 802.11s provides two routing modes, on-demand and proactive, for WLAN mesh networks. Although the on-demand routing mode always provides the optimum routing paths for data transmission, the initial latency can be very high when communicating with a destination in an external network. On the other hand, the proactive routing mode shows low initial latency when communicating with a destination in an external network, but the data transmission throughput can decrease when communicating with a destination in the same mesh network. This paper proposes an efficient cooperation method of two routing modes, taking advantage of the merits of each routing mode to overcome their faults. To evaluate the performance of the proposed cooperation method, we implemented HWMP on a testbed and performed experiments. The experimental results showed that the proposed cooperation method overcomes the faults of each routing mode and searches for the optimum routing paths quickly and efficiently; it always has the lower initial latency and higher data transmission throughput compared with the on-demand and proactive routing modes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CORE: centrally optimized routing extensions for the IEEE 802.16 MeSH mode

    Page(s): 58 - 65
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (351 KB) |  | HTML iconHTML  

    The IEEE 802.16 standard specifies a MeSH mode which permits the deployment of Wireless Mesh Networks (WMNs) supporting carrier-grade QoS. The network operator for such planned WMNs is interested in maximizing the traffic admitted in the WMN and simultaneously supporting QoS. Recently network coding has emerged as a promising technique for increasing the throughput in WMNs. This paper proposes CORE, which addresses the problem of jointly optimizing the routing, scheduling, and bandwidth savings via network coding. Prior solutions are either not applicable in the 802.16 MeSH or computationally too costly to be of practical use in the WMN under realistic scenarios. COREpsilas heuristics, in contrast, are able to compute solutions for the above problem within a operator definable maximum computational cost, thereby enabling the computation and near real-time deployment of the computed solutions. We analyze the performance of COREpsilas heuristics via a thorough simulation study covering the typical usage scenarios for WMNs. The results presented demonstrate that CORE is able to increase the number of flows admitted considerably and with minimal computational costs. Further, the results provide insights into limiting factors for the gains which can be obtained in different usage scenarios. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing network cost of many-to-many communication in unidirectional WDM rings with network coding

    Page(s): 66 - 73
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (210 KB) |  | HTML iconHTML  

    In this paper we address the problem of traffic grooming in WDM rings with all-to-all and its generalization to many-to-many service by using network coding. We consider minimizing the number of Line Terminating Equipment (LTE) on two types of unidirectional rings, namely, single-hub and un-hubbed rings, as our objective. In single-hub rings, we investigate the minimum cost provisioning of uniform all-to-all traffic in two cases: where network coding is used to linearly combine data, and where it is not used and data is transmitted without coding. We generalize the service mode to many-to-many and evaluate the cost of provisioning. In un-hubbed ring, we propose a multi-hub approach to obtain the minimum cost provisioning in the case of all-to-all and many-to-many traffic. From our numerical results, we find that under many to many traffic, network coding can reduce the network cost by 10-20% in single-hub rings and 1-5% in un-hubbed rings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconstructing the Plenoptic function from wireless multimedia sensor networks

    Page(s): 74 - 81
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (623 KB) |  | HTML iconHTML  

    The development of low-cost image/video sensors has enabled wireless multimedia sensor networks (WMSN). Equipped with the ability to collect images/video streams from surrounding environments, many interesting applications will emerge through the use of WMSN. One of the key targets of a WMSN application is reconstructing the Plenoptic function by using collected images. However, due to the characteristics of wireless channels, this task is challenging. In this paper, a reliable transport protocol for WMSN is presented. This protocol utilizes JPEG stream semantics to distinguish the importance of different parts within the stream, and schedules the transmission based on the importance of the information. In order to investigate the performance of the proposed protocol, a novel image mosaicking algorithm is used as a sample WMSN application. The experimental results show that the proposed protocol and application can offer snapshots of the interested environment with larger field-of-view (FOV) and with little delay. The quality of the view can be improved gradually with the arrival of the data representing the higher frequency part of the images. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving information availability in storage-centric sensor networks

    Page(s): 82 - 90
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (288 KB) |  | HTML iconHTML  

    We address the issue of improving information availability in a class of delay-tolerant sensor network applications, where the sensor nodes are deployed in disconnected environments. In such environments, since there is no continuous access to a remote base station, there is a need to leverage the collaborative resources of the sensor network to support in-network storage. The stored data can then be retrieved opportunistically by mobile collectors in the proximity. We have developed a data-centric, in-network storage architecture that partitions the network into storage zones. In such a scheme, some of the storage nodes may be unavailable at the time of storage and retrieval, because they are either sleeping to conserve energy or because they have failed.We present two schemes based on random linear network coding for improving information availability within such a storage architecture. In the centralized scheme, the encoding is performed by the managers in each storage zone, whereas in the decentralized scheme, the encoding is done locally by the zone members. We have implemented the network coding schemes in TinyOS and we present results that show the impact of the zone size, duty cycle, and the degree of encoding on the decoding probability, based on our experiments on a testbed of Micaz motes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delay constrained placement of mobile data collectors in underwater acoustic sensor networks

    Page(s): 91 - 97
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (287 KB) |  | HTML iconHTML  

    We propose a scheme for routing and placement of mobile data collectors in Underwater Acoustic Sensor Networks (UASNs). The proposed scheme maximizes the lifetime of the network with an upper bound on the maximum delay. We assume a 3D architecture, in which on-the-surface data collectors gather data from underwater sensors and relay them to an on-shore sink. We divide the lifetime of the network into fixed length rounds and move the data collectors to new locations at the beginning of each round. This problem is formulated as an Integer Linear Program (ILP), and we use an ILP solver to find the optimal placement of data collectors together with the multi-hop routing paths to deliver data from underwater sensors to data collectors. To the best of our knowledge, this is the first attempt towards the placement of data collectors in a 3D environment with delay constraints. When compared with other schemes, our scheme has shown the capability to achieve longer lifetime and shorter delay. View full abstract»

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