• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

The zone routing protocol (ZRP) for ad hoc networks (Internet-draft), in: Mobile Ad-hoc Network (MANET) Working Group, (1998)

by Z J Haas, M R Pearlman
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 504
Next 10 →

The broadcast storm problem in a mobile ad hoc network

by Sze-yao Ni, Yu-chee Tseng, Yuh-shyan Chen, Jang-ping Sheu - ACM Wireless Networks , 2002
"... Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in par-ticular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm s ..."
Abstract - Cited by 1237 (15 self) - Add to MetaCart
Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in par-ticular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broad-casting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we refer as the broadcast storm problem. In this paper, we iden-tify this problem by showing how serious it is through anal-yses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroad-casts to alleviate this problem. Simulation results are pre-sented, which show different levels of improvement over the basic flooding approach.
(Show Context)

Citation Context

...major disaster areas where networks need to be deployed immediately but base stations or fixed network infrastructures are not available. Unicast routing in MANET has been studied in several articles =-=[6, 7, 14, 15, 23]-=-. A working group called “manet” has been formed by the Internet Engineering Task Force (IETF) to study the related issues and stimulate research in MANET [21]. This paper studies the problem of sendi...

SPINS: Security Protocols for Sensor Networks

by Adrian Perrig, Robert Szewczyk, Victor Wen, David Culler, J. D. Tygar , 2001
"... As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis was placed on security. We design a suite of security building blocks that are optimized ..."
Abstract - Cited by 1094 (30 self) - Add to MetaCart
As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis was placed on security. We design a suite of security building blocks that are optimized for resource-constrained environments and wireless communication. SPINS has two secure building blocks: SNEP and TESLA. SNEP provides the following important baseline security primitives: Data con£dentiality, two-party data authentication, and data freshness. A particularly hard problem is to provide efficient broad-cast authentication, which is an important mechanism for sensor networks. TESLA is a new protocol which provides authenticated broadcast for severely resource-constrained environments. We implemented the above protocols, and show that they are practical even on minimalistic hardware: The performance of the protocol suite easily matches the data rate of our network. Additionally, we demonstrate that the suite can be used for building higher level protocols.

Location-aided routing (LAR) in mobile ad hoc networks, in:

by Young-Bae Ko , Nitin H Vaidya - Proc. of MOBICOM , 1998
"... A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location ..."
Abstract - Cited by 901 (10 self) - Add to MetaCart
A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks. By using location information, the proposed Location-Aided Routing (LAR) protocols limit the search for a new route to a smaller "request zone" of the ad hoc network. This results in a significant reduction in the number of routing messages. We present two algorithms to determine the request zone, and also suggest potential optimizations to our algorithms.
(Show Context)

Citation Context

...logy changes. Therefore, the task of finding and maintaining routes in MANET is non-trivial. Many protocols have been proposed for mobile ad hoc networks, with the goal of achieving efficient routing =-=[3, 6, 8, 9, 11, 12, 13, 15, 18]-=-. These algorithms differ in the approach used for searching a new route and/or modifying a known route, when hosts move. In this report, we suggest an approach to decrease overhead of route discovery...

HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks

by Ossama Younis, Sonia Fahmy - IEEE TRANS. MOBILE COMPUTING , 2004
"... Topology control in a sensor network balances load on sensor nodes and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. In this paper, we propose a novel distributed clustering approach for long-lived ad hoc sensor networks. Our proposed ..."
Abstract - Cited by 590 (1 self) - Add to MetaCart
Topology control in a sensor network balances load on sensor nodes and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. In this paper, we propose a novel distributed clustering approach for long-lived ad hoc sensor networks. Our proposed approach does not make any assumptions about the presence of infrastructure or about node capabilities, other than the availability of multiple power levels in sensor nodes. We present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according to a hybrid of the node residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED terminates in Oð1Þ iterations, incurs low message overhead, and achieves fairly uniform cluster head distribution across the network. We prove that, with appropriate bounds on node density and intracluster and intercluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks. Simulation results demonstrate that our proposed approach is effective in prolonging the network lifetime and supporting scalable data aggregation.

Analysis of TCP Performance over Mobile Ad Hoc Networks Part I: Problem Discussion and Analysis of Results

by Gavin Holland, Nitin Vaidya , 1999
"... Mobile ad hoc networks have gained a lot of attention lately as a means of providing continuous network connectivity to mobile computing devices regardless of physical location. Recently, a large amount of research has focused on the routing protocols needed in such an environment. In this two-part ..."
Abstract - Cited by 521 (5 self) - Add to MetaCart
Mobile ad hoc networks have gained a lot of attention lately as a means of providing continuous network connectivity to mobile computing devices regardless of physical location. Recently, a large amount of research has focused on the routing protocols needed in such an environment. In this two-part report, we investigate the effects that link breakage due to mobility has on TCP performance. Through simulation, we show that TCP throughput drops significantly when nodes move because of TCP's inability to recognize the difference between link failure and congestion. We also analyze specific examples, such as a situation where throughput is zero for a particular connection. We introduce a new metric, expected throughput, for the comparison of throughput in multi-hop networks, and then use this metric to show how the use of explicit link failure notification (ELFN) techniques can significantly improve TCP performance. In this paper (Part I of the report), we present the problem and an analysis of our simulation results. In Part II of this report, we present the simulation and results in detail.

Mobile ad hoc networking: imperatives and challenges

by Imrich Chlamtac , Marco Conti , Jennifer J.-N. Liu , 2003
"... Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, "ad-hoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no pre-exi ..."
Abstract - Cited by 317 (8 self) - Add to MetaCart
Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, "ad-hoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking concept is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad hoc paradigm. Recently, the introduction of new technologies such as the Bluetooth, IEEE 802.11 and Hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent evolutions have been generating a renewed and growing interest in the research and development of MANET. This paper attempts to provide a comprehensive overview of this dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas, including a summary of MANET's characteristics, capabilities, applications, and design constraints. The paper concludes by presenting a set of challenges and problems requiring further research in the future.

Distributed Clustering in Ad-hoc Sensor Networks: A Hybrid, Energy-Efficient Approach

by Ossama Younis, Sonia Fahmy , 2004
"... Prolonged network lifetime, scalability, and load balancing are important requirements for many ad-hoc sensor network applications. Clustering sensor nodes is an effective technique for achieving these goals. In this work, we propose a new energy-efficient approach for clustering nodes in adhoc sens ..."
Abstract - Cited by 307 (12 self) - Add to MetaCart
Prolonged network lifetime, scalability, and load balancing are important requirements for many ad-hoc sensor network applications. Clustering sensor nodes is an effective technique for achieving these goals. In this work, we propose a new energy-efficient approach for clustering nodes in adhoc sensor networks. Based on this approach, we present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according to a hybrid of their residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED does not make any assumptions about the distribution or density of nodes, or about node capabilities, e.g., location-awareness. The clustering process terminates in O(1) iterations, and does not depend on the network topology or size. The protocol incurs low overhead in terms of processing cycles and messages exchanged. It also achieves fairly uniform cluster head distribution across the network. A careful selection of the secondary clustering parameter can balance load among cluster heads. Our simulation results demonstrate that HEED outperforms weight-based clustering protocols in terms of several cluster characteristics. We also apply our approach to a simple application to demonstrate its effectiveness in prolonging the network lifetime and supporting data aggregation.

A mobility-based framework for adaptive clustering in wireless ad hoc networks

by A. Bruce Mcdonald, Student Member, Taieb F. Znati, Associate Member - IEEE Journal Selected Areas in Communications , 1999
"... Abstract—This paper presents a novel framework for dynamically organizing mobile nodes in wireless ad hoc networks into clusters in which the probability of path availability can be bounded. The purpose of the ( ; t) cluster is to help minimize the far-reaching effects of topological changes while b ..."
Abstract - Cited by 217 (0 self) - Add to MetaCart
Abstract—This paper presents a novel framework for dynamically organizing mobile nodes in wireless ad hoc networks into clusters in which the probability of path availability can be bounded. The purpose of the ( ; t) cluster is to help minimize the far-reaching effects of topological changes while balancing the need to support more optimal routing. A mobility model for ad hoc networks is developed and is used to derive expressions for the probability of path availability as a function of time. It is shown how this model provides the basis for dynamically grouping nodes into clusters using an efficient distributed clustering algorithm. Since the criteria for cluster organization depends directly upon path availability, the structure of the cluster topology is adaptive with respect to node mobility. Consequently, this framework supports an adaptive hybrid routing architecture that can be more responsive and effective when mobility rates are low and more efficient when mobility rates are high. Index Terms—Ad hoc networks, dynamic clustering, hierarchical routing, mobile computing, mobility models, routing algorithms, wireless networks. I.
(Show Context)

Citation Context

...will dominate. The cluster framework decouples the routing algorithm specification from the clustering algorithm, and thus, it is flexible enough to support evolving ad hoc network routing strategies =-=[13]-=-, [15], [27], [29] in both the intra- and intercluster domains. The remainder of the paper is organized as follows: Section II presents a review of the significant contributions in the area of dynamic...

Comparative Performance Evaluation of Routing Protocols for Mobile, Ad hoc Networks

by Samir R. Das, Robert Castañeda, Jiangtao Yan, Rimli Sengupta - Mobile Networks and Applications , 1998
"... We evaluate several routing protocols for mobile, wireless, ad hoc networks via packet level simulations. The protocol suite includes routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector, used for dynamic networks. ..."
Abstract - Cited by 203 (8 self) - Add to MetaCart
We evaluate several routing protocols for mobile, wireless, ad hoc networks via packet level simulations. The protocol suite includes routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector, used for dynamic networks. Performance is evaluated with respect to fraction of packets delivered, end-to-end delay and routing load for a given traffic and mobility model. It is observed that the new generation of on-demand routing protocols use much lower routing load. However, the traditional link state and distance vector protocols provide, in general, better packet delivery and delay performance. 1. Introduction A mobile, ad hoc network [4] is an autonomous system of mobile hosts connected by wireless links. There is no static infrastructure such as base stations. If two hosts are not within radio range, all message communication between them must pass through one or more intermediate hosts that double as router...
(Show Context)

Citation Context

...that alternatives are available when a route changes. Some recently proposed protocols use a reactive approach for route discovery and maintenance, instead of the more traditional, proactive approach =-=[10]. In a rea-=-ctive approach protocols are "source initiated;" routes are discovered and maintained on an as needed basis, thus circumventing large overheads of always maintaining routes between all possi...

Geographical routing using partial information for wireless ad hoc networks

by Rahul Jain, Anuj Puri, Raja Sengupta Y - IEEE Personal Communications , 2001
"... In this paper we present an algorithm for routing in wireless ad hoc networks using information about geographical location of the nodes. We assume each node knows its geographical position and the position of the node to which it wants to send a packet. Initially, the nodes know only their neighbor ..."
Abstract - Cited by 181 (1 self) - Add to MetaCart
In this paper we present an algorithm for routing in wireless ad hoc networks using information about geographical location of the nodes. We assume each node knows its geographical position and the position of the node to which it wants to send a packet. Initially, the nodes know only their neighbors, but over time they discover other nodes in the network. The routing table at a node S is a list h(pi�Si)i, where pi is a geographical position and Si is a neighbor of node S. When node S receives a packet for a node D at position pos(D), it finds the pi in its routing table which is closest to pos(D) and forwards the packet to the neighbor Si. We prove the correctness of the algorithm and show that our algorithm naturally aggregates the nodes so that the routing tables remain small. We show that the mean routing table size is O(L log n), where L is the average number of hops between two nodes and n is the number of nodes in the network. We also present methods for taking positional errors, node failures and mobility into account. We justify the results through simulation.
(Show Context)

Citation Context

... to discover the route. Most of the approaches in the literature are variants of the two above approaches with some attempting to combine the best of both. For example, in zone routing protocol (ZRP) =-=[4]-=-, each node has a “routing zone” which includes the nodes within some specified distance. Each node knows the topology within its routing zone by using DSDV protocol. For out-of-zone destinations, DSR...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University