2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)

20-24 June 2004

Go

Filter Results

Displaying Results 1 - 25 of 131
  • 2004 IEEE International Conference on Communications - Cover

    Publication Year: 2004, Page(s): 0_1
    Request permission for reuse | PDF file iconPDF (622 KB)
    Freely Available from IEEE
  • 2004 IEEE International Conference on Communications

    Publication Year: 2004, Page(s): i
    Request permission for reuse | PDF file iconPDF (85 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2004, Page(s): ii
    Request permission for reuse | PDF file iconPDF (225 KB)
    Freely Available from IEEE
  • Greetings from the General Chair

    Publication Year: 2004, Page(s): iii
    Request permission for reuse | PDF file iconPDF (5933 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message From the Technical Program Chair

    Publication Year: 2004, Page(s): iv
    Request permission for reuse | PDF file iconPDF (6000 KB) | HTML iconHTML
    Freely Available from IEEE
  • Executive Committee

    Publication Year: 2004, Page(s): v
    Request permission for reuse | PDF file iconPDF (259 KB)
    Freely Available from IEEE
  • Symposia chairs

    Publication Year: 2004, Page(s): vi
    Request permission for reuse | PDF file iconPDF (226 KB)
    Freely Available from IEEE
  • Technical Program Committee

    Publication Year: 2004, Page(s):vii - viii
    Request permission for reuse | PDF file iconPDF (199 KB)
    Freely Available from IEEE
  • [Blank page]

    Publication Year: 2004, Page(s): x
    Request permission for reuse | PDF file iconPDF (160 KB)
    Freely Available from IEEE
  • Contents

    Publication Year: 2004, Page(s):xi - vi
    Request permission for reuse | PDF file iconPDF (705 KB)
    Freely Available from IEEE
  • Power-efficient rendez-vous schemes for dense wireless sensor networks

    Publication Year: 2004, Page(s):3769 - 3776 Vol.7
    Cited by:  Papers (109)  |  Patents (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (2091 KB) | HTML iconHTML

    We propose two generic rendez-vous schemes for dense wireless sensor networks, including the transmitter- and receiver-initiated cycled receiver schemes. Our studies include the analyses and comparisons of their power efficiencies, especially under a fading channel as a realistic physical layer. We believe our modeling strategies as well as the results are applicable to any rendez-vous scheme of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrated data-link energy model for wireless sensor networks

    Publication Year: 2004, Page(s):3777 - 3783 Vol.7
    Cited by:  Papers (16)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (451 KB) | HTML iconHTML

    In this paper we integrate the energy models of all the components of the data link layer of a wireless sensor network into a single framework, which interacts with the abstracted models of the network layer, the physical layer, and the channel. Such a framework enables intra layer and cross layer optimization. By identifying the important design parameters, it provides the venues and guidelines f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-efficient forwarding for ad hoc and sensor networks in the presence of fading

    Publication Year: 2004, Page(s):3784 - 3789 Vol.7
    Cited by:  Papers (17)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (333 KB) | HTML iconHTML

    In this paper we study the multihop performance of two energy efficient forwarding schemes (GeRaF and GAF) in a Rayleigh fading propagation scenario. Specifically, we evaluate the number of hops which are necessary to reach a destination at distance D, as a function of the density of available relay nodes. Analytical and simulation results show that GeRaF significantly outperforms GAF from the mul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On lexicographic max-min node lifetime for wireless sensor networks

    Publication Year: 2004, Page(s):3790 - 3796 Vol.7
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    We study the network lifetime problem by considering not only the maximized time until the first node fails, but also the maximized lifetime for all the nodes in the network which we define as the lexicographic max-min (LMM) node lifetime problem. The main contributions of this paper are two-fold. First, we develop a polynomial-time algorithm to derive the LMM-optimal node lifetime vector, which e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hybrid location estimation scheme (H-LES) for partially synchronized wireless sensor networks

    Publication Year: 2004, Page(s):3797 - 3801 Vol.7
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (427 KB) | HTML iconHTML

    Heterogeneity is the key distinguishing characteristic of wireless sensor networks (WSN) as compared to wireless cellular networks (WCN). It may appear in the form of communication ranges of sensor devices, synchronization, and signal processing capabilities. In this article, we develop a hybrid location estimation scheme for heterogeneous WSN with unsynchronized short-range simple relays and mobi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Battery power optimized encryption

    Publication Year: 2004, Page(s):3802 - 3806 Vol.7
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    Computational power optimization is crucial in the battery power limited secure wireless mobile networks. Therefore, in this paper, we (a) introduce a hardware/software set-up to measure and model the battery power consumption of different encryption algorithms through real-life experimentation and (b) compute optimal power (number of rounds) allocation for encrypting packets such that the constra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic cluster structure for object detection and tracking in wireless ad-hoc sensor networks

    Publication Year: 2004, Page(s):3807 - 3811 Vol.7
    Cited by:  Papers (24)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (284 KB) | HTML iconHTML

    Wireless ad-hoc sensor networks are being developed to carry out tasks such as target detection and tracking, environment monitoring, and data collection across the area of deployment. We explore the problem of using sensor networks to detect and track continuous objects, such as wild fire and bio-chemical material. The continuous objects are different from traditional one or many individual targe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Node-disjoint path routing in wireless networks: tradeoff between path lifetime and total energy

    Publication Year: 2004, Page(s):3812 - 3816 Vol.7
    Cited by:  Papers (6)  |  Patents (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    Survivability and lifetime are two important issues related to routing in wireless ad-hoc networks. Routing using node-disjoint paths enhances both survivability and data confidentiality. An elegant polynomial time algorithm has been reported recently that can compute node-disjoint paths connecting a source node to a destination node with minimum total energy. However, the problem of computing a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An overlay algorithm to improve the support of multi-hopping in the IEEE 802.11 WLANs

    Publication Year: 2004, Page(s):3817 - 3821 Vol.7
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (341 KB) | HTML iconHTML

    Previous studies have argued that the performance of the IEEE 802.11 protocol is poor when used as a platform to implement multi-hop ad hoc networks. In this paper, we analyze the negative behavior caused by having multiple overlapping IBSSs (independent basic service sets) operating at the same frequency channel in an 802.11 ad hoc network. We propose an overlay algorithm on top of 802.11 to help... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study of performance and complexity for IEEE 802.11n MIMO-OFDM GIS solutions

    Publication Year: 2004, Page(s):3822 - 3826 Vol.7
    Cited by:  Papers (5)  |  Patents (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (380 KB) | HTML iconHTML

    This paper investigates the point-to-point PHY layer performance of two newly proposed IEEE 802.11n candidate solutions by suggesting extensions to 802.11a. The new solutions incorporate a MIMO architecture for the wireless links between the network terminals. The FEC block in the PHY layer chain is enhanced with a turbo encoder to provide interleaving gains for the larger sized PSDUs (1-4095 byte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A QoS guaranteed fast handoff algorithm for wireless LAN

    Publication Year: 2004, Page(s):3827 - 3832 Vol.7
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (549 KB) | HTML iconHTML

    CCRSVP (candidate casting RSVP) algorithm is a new fast handoff method for WLAN which shows good performance in the handoff latency and the bandwidth efficiency aspects. Because it uses an intelligent multicasting method and RSVP, it guarantees QoS. Using L2 information (BSSID) of WLAN, the proposed scheme starts resource reservation and multicasts packets before L2 handoff completes. Thus, it red... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing in overlapping wireless LAN cells

    Publication Year: 2004, Page(s):3833 - 3836 Vol.7
    Cited by:  Papers (110)  |  Patents (18)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    We propose a load-balancing scheme for overlapping wireless LAN cells. Agents running in each access point broadcast periodically the local load level via the Ethernet backbone and determines whether the access point is overloaded, balanced or under-loaded by comparing it with the received reports. The load metric is the access point throughput. Overloaded access points force the handoff of some s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth management in 802.11 wireless LANs

    Publication Year: 2004, Page(s):3837 - 3843 Vol.7
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (692 KB) | HTML iconHTML

    We developed and demonstrated a prototype 802.11b access point that is capable of providing committed bandwidth services to premium users and controls congestion in the wireless medium. We also implement a time-varying deficit round robin (DRR) scheduling algorithm that takes into account the randomly varying time intervals between RF transmissions. Premium users receive (transmit) and maintain th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Techniques to reduce the IEEE 802.11b handoff time

    Publication Year: 2004, Page(s):3844 - 3848 Vol.7
    Cited by:  Papers (85)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (347 KB) | HTML iconHTML

    We analyze the link-layer handoff process in wireless LANs based on the IEEE 802.11b standard and suggests how to reduce its duration. Firstly, we divide the process into three phases: detection, search and execution. Our performance measurements indicate that the detection and search phases are the main contributors to the handoff time. We show that the link-layer detection time can be reduced to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OBEX performance evaluation and parameter optimization for high speed IrDA links

    Publication Year: 2004, Page(s):3849 - 3853 Vol.7
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (374 KB) | HTML iconHTML

    OBEX is a session protocol designed to transmit data objects between resource-limited devices. It has been adopted as the framework for object exchange for wireless transports including IrDA and Bluetooth. A mathematical analysis for OBEX throughput-over the IrDA protocol stacks is carried out in this paper. OBEX maximum packet size and turnaround time are optimized for the system throughput. Nume... View full abstract»

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