This paper is concerned with the scaling of the number of relay nodes (ie, hops) individual
messages have to transit through in a large-scale wireless ad hoc network (WANET); we call …

With the growing abundance of portable wireless communication devices, a challenging
question that arises is whether one can efficiently harness the collective communication and …

BACKGROUND An ad hoc wireless network is one in which a packet may travel multiple
wireless hops to reach its destination. It con sists of a set of nodes or stations that …

We consider the problem of energy aware localized routing in ad hoc networks. In localized
routing algorithms, each node forwards a message based on the position information about …

Recent work of Gupta and Kumar (2000) has shown that in a multi-hop wireless network the
throughput capacity per source-destination pair goes to zero as the node density increases …

Wireless networks are often very lightly used. Some wireless networks, most notably sensor
networks, are also energy-constrained–that is, the period of time during which the network is …

We present Delay-Energy Aware Routing (DEAP) a novel protocol for heterogeneous
wireless ad hoc networks. DEAP is a crosslayer scheme that: first, manages adaptively the …

We present m-limited forwarding, a technique to reduce the cost of disseminating
information in a power-constrained environment by limiting the cardinality of the subset of …

In this paper, the problem of improving reliability and reducing routing overhead in dynamic
scalable Wireless Ad hoc NETworks (WANETs) is considered. Having in mind that the …

Gupta and Kumar (2000) showed that the throughput capacity of static ad hoc networks with
n randomly positioned nodes is/spl Theta/(/spl radic/(n/log n)). Grossglauser and Tse …