Results 1 - 10 of 104,630

Maxmin fair scheduling in wireless ad hoc networks

by Leandros Tassiulas, Saswati Sarkar - IEEE J. SEL. AREAS COMMUN , 2005
"... We investigate from an algorithmic perspective the maxmin fair allocation of bandwidth in wireless ad hoc networks. We formalize the maxmin fair objective under wireless scheduling constraints, and present a necessary and sufficient condition for maxmin fairness of a bandwidth allocation. We propos ..."
Abstract - Cited by 31 (4 self) - Add to MetaCart
We investigate from an algorithmic perspective the maxmin fair allocation of bandwidth in wireless ad hoc networks. We formalize the maxmin fair objective under wireless scheduling constraints, and present a necessary and sufficient condition for maxmin fairness of a bandwidth allocation. We

Capacity of Ad Hoc Wireless Networks

by Jinyang Li, Charles Blake, Douglas S. J. De Couto, Hu Imm Lee, Robert Morris
"... Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper examine ..."
Abstract - Cited by 626 (14 self) - Add to MetaCart
Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper

Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment

by Laura Marie Feeney, Martin Nilsson - In IEEE Infocom , 2001
"... Energy-aware design and evaluation of network protocols requires knowledge of the energy consumption behavior of actual wireless interfaces. But little practical information is available about the energy consumption behavior of well-known wireless network interfaces and device specifications do not ..."
Abstract - Cited by 655 (3 self) - Add to MetaCart
not provide information in a form that is helpful to protocol developers. This paper describes a series of experiments which obtained detailed measurements of the energy consumption of an IEEE 802.11 wireless network interface operating in an ad hoc networking environment. The data is presented as a

A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks

by Elizabeth M. Royer, Chai-Keong Toh
"... An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate communication within the network, a routing protocol is used to discove ..."
Abstract - Cited by 1261 (3 self) - Add to MetaCart
An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate communication within the network, a routing protocol is used

Power-Aware Routing in Mobile Ad Hoc Networks

by Mike Woo, Suresh Singh, C. S. Raghavendra , 1998
"... In this paper we present a case for using new power-aware metrics for determining routes in wireless ad hoc networks. We present five different metrics based on battery power consumption at nodes. We show that using these metrics in a shortest-cost routing algorithm reduces the cost/packet of rout ..."
Abstract - Cited by 763 (5 self) - Add to MetaCart
In this paper we present a case for using new power-aware metrics for determining routes in wireless ad hoc networks. We present five different metrics based on battery power consumption at nodes. We show that using these metrics in a shortest-cost routing algorithm reduces the cost

Ariadne: A secure on-demand routing protocol for ad hoc networks

by Yih-chun Hu , 2002
"... An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a n ..."
Abstract - Cited by 900 (11 self) - Add to MetaCart
An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a

SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks

by Yih-Chun Hu, David B. Johnson, Adrian Perrig , 2003
"... An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vec ..."
Abstract - Cited by 522 (8 self) - Add to MetaCart
An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance

Max-Min D-Cluster Formation in Wireless Ad Hoc Networks

by Alan Amis , Ravi Prakash, Thai H. P. Vuong , Dung T. Huynh - IN PROCEEDINGS OF IEEE INFOCOM , 2000
"... An ad hoc network may be logically represented as a set of clusters. The clusterheads form a d-hop dominating set. Each node is at most d hops from a clusterhead. Clusterheads form a virtual backbone and may be used to route packets for nodes in their cluster. Previous heuristics restricted themselv ..."
Abstract - Cited by 268 (4 self) - Add to MetaCart
themselves to 1-hop clusters. We show that the minimum d-hop dominating set problem is NP-complete. Then we present a heuristic to form d-clusters in a wireless ad hoc network. Nodes are assumed to have non-deterministic mobility pattern. Clusters are formed by diffusing node identities along the wireless

Performance comparison of two on-demand routing protocols for ad hoc networks

by Samir R. Das, Charles E. Perkins , 2000
"... Abstract — Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the performance of two prominent ondemand routing protocols for mobile ad hoc networks — Dynamic Source Routing (DSR) ..."
Abstract - Cited by 542 (21 self) - Add to MetaCart
Abstract — Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the performance of two prominent ondemand routing protocols for mobile ad hoc networks — Dynamic Source Routing (DSR

Ad-hoc On-Demand Distance Vector Routing

by Charles E. Perkins, Elizabeth M. Royer - IN PROCEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS , 1997
"... An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc n ..."
Abstract - Cited by 3167 (15 self) - Add to MetaCart
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc
Results 1 - 10 of 104,630