Results 1 - 10
of
7,862
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
Energy Conserving Routing in Wireless Ad-hoc Networks
, 2000
"... An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set ..."
Abstract
-
Cited by 622 (2 self)
- Add to MetaCart
the set of possible one hop away neighbors. Traffic forwarding through multiple hops is employed when the intended destination is not within immediate reach. The nodes have limited initial amounts of energy that is consumed in different rates depending on the power level and the intended receiver. We
Random Key Predistribution Schemes for Sensor Networks”,
- IEEE Symposium on Security and Privacy,
, 2003
"... Abstract Efficient key distribution is the basis for providing secure communication, a necessary requirement for many emerging sensor network applications. Many applications require authentic and secret communication among neighboring sensor nodes. However, establishing keys for secure communicatio ..."
Abstract
-
Cited by 832 (12 self)
- Add to MetaCart
keys for all pairs of nodes is not viable due to the large number of sensors and the limited memory of sensor nodes. A new key distribution approach was proposed by Eschenauer and Gligor [11] to achieve secrecy for node-to-node communication: sensor nodes receive a random subset of keys from a key pool
Performance Improvement Using Receiver Node Selection in Receiver Cooperative Downlink Systems
"... We examine the downlink of wireless communication systems with receiver cooperation. The cooperative utilization among closely-located receiver nodes is referred to as cooperative receiving, which behaviors similar to multiple-antenna receiving. To realize this, a group of receiver nodes are first t ..."
Abstract
- Add to MetaCart
We examine the downlink of wireless communication systems with receiver cooperation. The cooperative utilization among closely-located receiver nodes is referred to as cooperative receiving, which behaviors similar to multiple-antenna receiving. To realize this, a group of receiver nodes are first
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
SplitStream: High-Bandwidth Multicast in Cooperative Environments
- SOSP '03
, 2003
"... In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highly available, d d cated infrastructure routers but it poses a problem for application-level multicast in peer-to-peer systems. ..."
Abstract
-
Cited by 578 (17 self)
- Add to MetaCart
In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highly available, d d cated infrastructure routers but it poses a problem for application-level multicast in peer-to-peer systems
How practical is network coding?
, 2006
"... With network coding, intermediate nodes between the source and the receivers of an end-to-end communication session are not only capable of relaying and replicating data messages, but also of coding incoming messages to produce coded outgoing ones. Recent studies have shown that network coding is ..."
Abstract
-
Cited by 1016 (23 self)
- Add to MetaCart
With network coding, intermediate nodes between the source and the receivers of an end-to-end communication session are not only capable of relaying and replicating data messages, but also of coding incoming messages to produce coded outgoing ones. Recent studies have shown that network coding
Ad hoc positioning system (APS) using AoA
, 2003
"... AoA(Angle of Arrival) is a well known method used for positioning in providing services such as E911, and for other military and civil radio-location applications, such as sonars and radars. Although devices such as GPS receivers and digital compasses provide good positioning and orientation outdoo ..."
Abstract
-
Cited by 484 (6 self)
- Add to MetaCart
AoA(Angle of Arrival) is a well known method used for positioning in providing services such as E911, and for other military and civil radio-location applications, such as sonars and radars. Although devices such as GPS receivers and digital compasses provide good positioning and orientation
PAMAS -- Power Aware Multi-Access protocol with Signalling for Ad Hoc Networks
, 1998
"... In this paper we develop a new multiaccess protocol for ad hoc radio networks. The protocol is based on the original MACA protocol with the adition of a separate signalling channel. The unique feature of our protocol is that it conserves battery power at nodes by intelligently powering off nodes t ..."
Abstract
-
Cited by 467 (8 self)
- Add to MetaCart
that are not actively transmitting or receiving packets. The manner in which nodes power themselves off does not influence the delay or throughput characteristics of our protocol. We illustrate the power conserving behavior of PAMAS via extensive simulations performed over ad hoc networks containing 10-20 nodes. Our
GPS-free positioning in mobile ad hoc networks
- Cluster Computing
, 2001
"... this paper, we describe an algorithm for the positioning of nodes in an ad hoc network that does not use GPS. The algorithm provides a position information to the nodes in the scenarios where an infrastructure does not exist and GPS cannot be used. GPS-free positioning is also desirable, when the GP ..."
Abstract
-
Cited by 462 (12 self)
- Add to MetaCart
this paper, we describe an algorithm for the positioning of nodes in an ad hoc network that does not use GPS. The algorithm provides a position information to the nodes in the scenarios where an infrastructure does not exist and GPS cannot be used. GPS-free positioning is also desirable, when
Results 1 - 10
of
7,862