Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
59,494
The capacity of wireless networks
- IEEE TRANSACTIONS ON INFORMATION THEORY
, 2000
"... When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally p ..."
Abstract
-
Cited by 3243 (42 self)
- Add to MetaCart
When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally
Minimum energy mobile wireless networks
- IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1999
"... We describe a distributed position-based network protocol optimized for minimum energy consumption in mobile wireless networks that support peer-to-peer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each n ..."
Abstract
-
Cited by 749 (0 self)
- Add to MetaCart
We describe a distributed position-based network protocol optimized for minimum energy consumption in mobile wireless networks that support peer-to-peer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each
Capacity of Ad Hoc Wireless Networks
"... 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 636 (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
Adaptive clustering for mobile wireless networks
- IEEE Journal on Selected Areas in Communications
, 1997
"... This paper describes a self-organizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically reconfig ..."
Abstract
-
Cited by 561 (11 self)
- Add to MetaCart
This paper describes a self-organizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically
XORs in the air: practical wireless network coding
- In Proc. ACM SIGCOMM
, 2006
"... This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our de ..."
Abstract
-
Cited by 548 (20 self)
- Add to MetaCart
This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our
GPSR: Greedy perimeter stateless routing for wireless networks
- MOBICOM
, 2000
"... We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of touters and a packer's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's i ..."
Abstract
-
Cited by 2290 (8 self)
- Add to MetaCart
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of touters and a packer's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router
Mobility increases the capacity of ad-hoc wireless networks
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 2002
"... The capacity of ad-hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad-hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session throughpu ..."
Abstract
-
Cited by 1220 (5 self)
- Add to MetaCart
The capacity of ad-hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad-hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per
Routing with Guaranteed Delivery in ad hoc Wireless Networks
, 2001
"... We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication of ..."
Abstract
-
Cited by 849 (80 self)
- Add to MetaCart
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication
Critical Power for Asymptotic Connectivity in Wireless Networks
, 1998
"... : In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others ' pack ..."
Abstract
-
Cited by 541 (19 self)
- Add to MetaCart
: In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others &apos
Results 1 - 10
of
59,494
