IEEE Wireless Communications and Networking Conference, 2005

13-17 March 2005

Go

Filter Results

Displaying Results 1 - 25 of 113
  • 2005 IEEE Wireless Communications and Networking Conferences

    Publication Year: 2005, Page(s): 0_1
    Request permission for reuse | PDF file iconPDF (165 KB)
    Freely Available from IEEE
  • 2005 IEEE Wireless Communications and Networking Conferences

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

    Publication Year: 2005, Page(s): ii
    Request permission for reuse | PDF file iconPDF (1743 KB)
    Freely Available from IEEE
  • A message from the WCNC 2005 technical program chair

    Publication Year: 2005, Page(s): iii
    Request permission for reuse | PDF file iconPDF (1735 KB) | HTML iconHTML
    Freely Available from IEEE
  • WCNC 2005 organizing committee

    Publication Year: 2005, Page(s):iv - viii
    Request permission for reuse | PDF file iconPDF (1615 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2005, Page(s):ix - xxxiv
    Request permission for reuse | PDF file iconPDF (1923 KB)
    Freely Available from IEEE
  • Securing sensor networks with location-based keys

    Publication Year: 2005, Page(s):1909 - 1914 Vol. 4
    Cited by:  Papers (28)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1929 KB) | HTML iconHTML

    Wireless sensor networks are often deployed in unattended and hostile environments, leaving individual sensors vulnerable to security compromise. The paper proposes the novel notion of location-based keys for designing compromise-tolerant security mechanisms for sensor networks. Based on location-based keys, we develop a node-to-node authentication scheme, which is able not only to localize the im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A robust group-based key management scheme for wireless sensor networks

    Publication Year: 2005, Page(s):1915 - 1920 Vol. 4
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1812 KB) | HTML iconHTML

    Sensor networks pose security and privacy challenges. To maintain confidentiality of sensor communications, it is challenging to bootstrap secure communications among sensors while making sensor networks highly connected when sensors are randomly deployed. Several existing key management schemes either cannot offer strong resilience against node capture attacks or have overly large memory requirem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LLK: a link-layer key establishment scheme for wireless sensor networks

    Publication Year: 2005, Page(s):1921 - 1926 Vol. 4
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1790 KB) | HTML iconHTML

    The establishment of link-layer keys between neighboring nodes is a fundamental issue in securing sensor network communications. Most existing solutions are key pre-distribution schemes which rely on sensor nodes to broadcast hundreds of or even thousands of preloaded key IDs to find pairwise keys between neighboring nodes. The shortcomings include poor resilience against node compromise, low netw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The new intrusion prevention and detection approaches for clustering-based sensor networks [wireless sensor networks]

    Publication Year: 2005, Page(s):1927 - 1932 Vol. 4
    Cited by:  Papers (12)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1903 KB) | HTML iconHTML

    In this paper, we propose two approaches to improve the security of clustering-based sensor networks: authentication-based intrusion prevention and energy-saving intrusion detection. In the first approach, different authentication mechanisms are adopted for two common packet categories in generic sensor networks to save the energy of each node. In the second approach, different monitoring mechanis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Critical area attention in traffic aware dynamic node scheduling for low power sensor networks

    Publication Year: 2005, Page(s):1933 - 1938 Vol. 4
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1908 KB) | HTML iconHTML

    In many sensor network (SN) applications it is necessary to provide reliable, fast and full sensing coverage to a sensitive area while at the same time minimizing energy consumption. This paper proposes a new flexible medium-access control (MAC) protocol designed to address this problem. The primary objective of the SN is to achieve low-power consumption while latency is usually less important com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed source coding in wireless sensor networks using LDPC coding: the entire Slepian-Wolf rate region

    Publication Year: 2005, Page(s):1939 - 1944 Vol. 4
    Cited by:  Papers (28)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1801 KB) | HTML iconHTML

    In this paper, we propose a scheme for distributed source coding (DSC) that achieves any arbitrary rate on the Slepian-Wolf rate region using a single systematic LDPC code. This method is based on sending a fraction of the information bits along with a fraction of parity bits generated by the LDPC code. First, we study the problem of DSC of two correlated sources at the symmetric rate. We propose ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-organizing redundancy-cellular architecture for wireless sensor networks

    Publication Year: 2005, Page(s):1945 - 1951 Vol. 4
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1829 KB) | HTML iconHTML

    We propose self-organizing redundancy-cellular architecture (SoRCA) - a cell-based architecture for wireless sensor networks (WSN). SoRCA conserves energy by significantly reducing redundant data admitted to the network. It is scalable, robust and guarantees coverage. At a cost of extra energy, it can supply adjustable resolution. SoRCA also significantly simplifies the network models and may serv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study into the practical issues related to a deployed ad hoc wireless sensor network

    Publication Year: 2005, Page(s):1952 - 1957 Vol. 4
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1937 KB) | HTML iconHTML

    This paper investigates the practical issues related to the energy efficiency of a deployed wireless sensor network through the use of network simulations. The IEEE 802.11b standard is used as the communications technology and the dynamic source routing algorithm provides the mechanism for generating the communications routes from data sources to data sinks. The study looks into the optimal positi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multipath Fresnel zone routing for wireless ad hoc networks

    Publication Year: 2005, Page(s):1958 - 1963 Vol. 4
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1886 KB) | HTML iconHTML

    This paper describes a novel multipath routing algorithm, Fresnel zone routing (FZR), for wireless ad hoc networks. First, the concept of Fresnel zones in an ad hoc network is introduced to classify intermediate nodes according to their capacity and efficiency for forwarding traffic. Second, multiple paths via different Fresnel zones are constructed efficiently using a hybrid of proactive and on-d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neighbor stability routing in MANETs

    Publication Year: 2005, Page(s):1964 - 1969 Vol. 4
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1866 KB) | HTML iconHTML

    Mobile ad hoc networks (MANETs) are characterized by wireless connectivity through multi-hops, frequently changing network topology among wireless mobile devices. These characteristics require routing algorithms to be dynamic and adaptive to constantly changing environments. In this paper, we describe a new routing algorithm which is based on the cumulative relative stability among neighbor mobile... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Node caching enhancement of reactive ad hoc routing protocols [MANET]

    Publication Year: 2005, Page(s):1970 - 1975 Vol. 4
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1764 KB) | HTML iconHTML

    Enhancing route request broadcasting protocols constitutes a substantial part of recent research in mobile ad hoc network (MANET) routing. In this paper, we introduce a novel node caching approach for constraining the route request protocol in ad hoc routing. We have implemented node caching enhancement AODV-NC of AODV which improves the original AODV in all three metrics - extensive simulations i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A cross-layer approach for designing directional routing protocol in MANETs

    Publication Year: 2005, Page(s):1976 - 1981 Vol. 4
    Cited by:  Papers (14)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1956 KB) | HTML iconHTML

    In this paper, we propose a directional routing protocol (DRP) for MANETs. DRP is an on-demand directional routing protocol which assumes a cross layer interaction between routing and MAC layer. The main features of DRP include an efficient route discovery mechanism, establishment and maintenance of directional routing and directional neighbor tables (DRT and DNT, respectively), and novel directio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive load balancing in mobile ad hoc networks

    Publication Year: 2005, Page(s):1982 - 1987 Vol. 4
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (2083 KB) | HTML iconHTML

    In this paper, we propose a prediction based adaptive load balancing mechanism for mobile ad hoc networks. This mechanism can cooperate with any kind of multipath source routing protocol. It distributes traffic load among multiple disjoint paths based on the measurement and prediction of network traffic. In order to predict network traffic accurately, we first analyze the traffic data collected in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing with congestion awareness and adaptivity in mobile ad hoc networks

    Publication Year: 2005, Page(s):1988 - 1994 Vol. 4
    Cited by:  Papers (13)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1805 KB) | HTML iconHTML

    Mobility, channel error, and congestion are the main causes for packet loss in mobile ad hoc networks. Reducing packet loss typically involves congestion control operating on top of a mobility and failure adaptive routing protocol at the network layer. In current designs, routing is not congestion-adaptive. Routing may let congestion happen, which is detected by congestion control, but dealing wit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic nix-vector routing for mobile ad hoc networks

    Publication Year: 2005, Page(s):1995 - 2001 Vol. 4
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1788 KB) | HTML iconHTML

    We present a new protocol for multi-hop routing in mobile ad hoc networks called dynamic nix-vector routing (DNVR). Our scheme is based on the nix-vector concept for efficient routing originally designed for wired networks. DNVR acquires a loop-free route and maintains it on a need basis as do other on-demand protocols. However, DNVR has several new features as compared to other existing reactive ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A workload-based adaptive load-balancing technique for mobile ad hoc networks

    Publication Year: 2005, Page(s):2002 - 2007 Vol. 4
    Cited by:  Papers (34)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1787 KB) | HTML iconHTML

    A novel load-balancing technique for ad hoc on-demand routing protocols is presented. Currently, ad hoc routing protocols lack load-balancing capabilities, and thus, they often fail to provide good performance especially in the presence of a large volume of traffic. We present a simple but very effective method to achieve load balance and congestion alleviation. The new scheme is motivated by the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the efficiency and reliability of the route discovery process in on-demand routing protocols

    Publication Year: 2005, Page(s):2008 - 2013 Vol. 4
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1814 KB) | HTML iconHTML

    Three-hop horizon pruning (THP) is an algorithm for computing a two-hop connected dominating set (TCDS) of the network, and has been shown to be more efficient than all prior distributed broadcasting mechanisms when a TCDS is preferred over a connected dominating set (CDS). However, like all other algorithms that depend on local topology information, THP is not reliable when the topology changes f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path verification for robust, instantaneous loop-free routing in ad hoc networks

    Publication Year: 2005, Page(s):2014 - 2019 Vol. 4
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1786 KB) | HTML iconHTML

    We present path verification routing (PVR) to enable robust, instantaneous on-demand loop-free routing of data packets based on their destination address in mobile ad hoc networks. PVR attains instantaneous loop-freedom by using a path verification technique without the necessity for sequence numbers, source-routed data packets, or nodal synchronization. The motivation for PVR is twofold. On the o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Establishing measurement-based reliable path in mobile ad hoc networks

    Publication Year: 2005, Page(s):2020 - 2025 Vol. 4
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1877 KB) | HTML iconHTML

    Due to unpredictable topology change and frequent link failure, it is becoming evidently a major challenge to provide a stable route between source and destination in mobile ad hoc networks (MANET). Unlike previous multipath routing schemes for redundancy and unicast routing protocol utilizing longest route expiration time supported by GPS, we develop a framework to establish the most stable route... View full abstract»

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