Results 1 - 10
of
9,690
Source node
"... Abstract — A multi-hop mobile ad-hoc network is considered as a kinetic dynamic set of circles, where each circle represents the wireless transmission range of a mobile host placed at the center of that circle. A mobile host can communicate directly with another host if the distance between the cent ..."
Abstract
- Add to MetaCart
the centers of the circles representing and is smaller than the radius of the circle representing. A route from a source to destination is a finite sequence of mobile hosts; such that, for, can communicate directly with. Mobile hosts move autonomously. So, finding and maintaining a route through which a
Source Nodes Relay Nodes
"... Abstract—This paper deals with wireless relay communication systems in which multiple sources transmit information to the destination node by the help of multiple relays. We consider a signal forwarding technique based on the minimum mean-square error (MMSE) approach with multiple antennas for each ..."
Abstract
- Add to MetaCart
Abstract—This paper deals with wireless relay communication systems in which multiple sources transmit information to the destination node by the help of multiple relays. We consider a signal forwarding technique based on the minimum mean-square error (MMSE) approach with multiple antennas for each
A generalized processor sharing approach to flow control in integrated services networks: The single-node case
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... The problem of allocating network resources to the users of an integrated services network is investigated in the context of rate-based flow control. The network is assumed to be a virtual circuit, connection-based packet network. We show that the use of Generalized processor Sharing (GPS), when co ..."
Abstract
-
Cited by 2010 (5 self)
- Add to MetaCart
, the performance of a single-server GPS system is analyzed exactly from the standpoint of worst-case packet delay and burstiness when the sources are constrained by leaky buckets. The worst-case session backlogs are also determined. In the sequel to this paper, these results are extended to arbitrary topology
DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks”, in Ad Hoc Networking, edited by Charles E.
- Perkins, Chapter
, 2001
"... Abstract The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network ..."
Abstract
-
Cited by 764 (8 self)
- Add to MetaCart
Abstract The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network
Cooperative strategies and capacity theorems for relay networks
- IEEE TRANS. INFORM. THEORY
, 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant of ..."
Abstract
-
Cited by 739 (19 self)
- Add to MetaCart
Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant
An Energy-Efficient MAC Protocol for Wireless Sensor Networks
, 2002
"... This paper proposes S-MAC, a medium-access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect senso ..."
Abstract
-
Cited by 1517 (36 self)
- Add to MetaCart
, on a source node, an 802.11-like MAC consumes 2--6 times more energy than S-MAC for traffic load with messages sent every 1-10s.
The dynamic behavior of a data dissemination protocol for network programming at scale
- In Proceedings of the Second International Conferences on Embedded Network Sensor Systems (SenSys
"... To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over a multihop, wireless sensor network. Deluge builds from prior work in density-aware, epidemic maintenance protocols. Usi ..."
Abstract
-
Cited by 492 (24 self)
- Add to MetaCart
To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over a multihop, wireless sensor network. Deluge builds from prior work in density-aware, epidemic maintenance protocols
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
A Scalable Location Service for Geographic Ad Hoc Routing,”
- Proceedings of ACM/IEEE MobiCom
, 2000
"... Abstract. GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work. GLS is decentralized and runs on the mobile node ..."
Abstract
-
Cited by 769 (17 self)
- Add to MetaCart
forwarding combined with GLS compares favorably with Dynamic Source Routing (DSR): in larger networks (over 200 nodes) our approach delivers more packets, but consumes fewer network resources.
Geography-informed Energy Conservation for Ad Hoc Routing
- ACM MOBICOM
, 2001
"... We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity. GA ..."
Abstract
-
Cited by 1045 (21 self)
- Add to MetaCart
. GAF moderates this policy using application- and system-level information; nodes that source or sink data remain on and intermediate nodes monitor and balance energy use. GAF is independent of the underlying ad hoc routing protocol; we simulate GAF over unmodified AODV and DSR. Analysis and simulation
Results 1 - 10
of
9,690