Results 1  10
of
25,044
The mathematics of routing in massively dense adhoc networks
 the proceedings of AdHocNOW Conference
"... Abstract. Computing optimal routes in massively dense adhoc networks becomes intractable as the number of nodes becomes very large. One recent approach to solve this problem is to use a fluid type approximation in which the whole network is replaced by a continuum plain. Various paradigms from physi ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Abstract. Computing optimal routes in massively dense adhoc networks becomes intractable as the number of nodes becomes very large. One recent approach to solve this problem is to use a fluid type approximation in which the whole network is replaced by a continuum plain. Various paradigms from
Routing in massively dense adhoc networks: Continum
"... Let Ω be a connected smooth open set in R 2, with ∂Ω = R ∪ S ∪ T. Messages originate in S, with density σ(x), and have to be routed through Ω to R, with zero flux through T. At each point x ∈ Ω, messages flow in only one direction, but with a density ϕ of messages (intensity of the flow) that may va ..."
Abstract
 Add to MetaCart
Let Ω be a connected smooth open set in R 2, with ∂Ω = R ∪ S ∪ T. Messages originate in S, with density σ(x), and have to be routed through Ω to R, with zero flux through T. At each point x ∈ Ω, messages flow in only one direction, but with a density ϕ of messages (intensity of the flow) that may vary from point to point. The intensity ϕ of messages flowing through a point x has a “cost ” c(x, ϕ) (Delays, energy use,...) Investigate both the collectively optimal routing and the Wardrop equilibria.
Connectivity vs Capacity in Dense Ad Hoc Networks
, 2004
"... We study the connectivity and capacity of finite area ad hoc wireless networks, with an increasing number of nodes (dense networks). We find that the properties of the network strongly depend on the shape of the attenuation function. For power law attenuation functions, connectivity scales, and the ..."
Abstract

Cited by 84 (1 self)
 Add to MetaCart
We study the connectivity and capacity of finite area ad hoc wireless networks, with an increasing number of nodes (dense networks). We find that the properties of the network strongly depend on the shape of the attenuation function. For power law attenuation functions, connectivity scales
G.: Multicast Scaling Properties in Massively Dense Ad Hoc Networks
 In: ICPADS (2
"... We study the benefits of multicast routing in the performance of mobile ad hoc networks. In particular we show that if a node wishes to communicate with n distinct destinations, multicast can reduce the overall network load by a factor O (√n), when used instead of unicast. One of the implications ..."
Abstract

Cited by 48 (1 self)
 Add to MetaCart
We study the benefits of multicast routing in the performance of mobile ad hoc networks. In particular we show that if a node wishes to communicate with n distinct destinations, multicast can reduce the overall network load by a factor O (√n), when used instead of unicast. One of the im
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
 Journal of Ad hoc Networks, Elsevier
, 2006
"... Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but because of its extreme redundancy, it is impractical in dense networks. Indeed in large wireless networks, the use of flooding algo ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but because of its extreme redundancy, it is impractical in dense networks. Indeed in large wireless networks, the use of flooding
Efficient Query Propagation by Adaptive Bordercast Operation in Dense Ad Hoc Network
, 2007
"... We designed the Adaptive Bordercast Resolution Protocol for efficient query propagation in a flat ad hoc network. The characteristic of Ad hoc networks like dynamic topology, network density causes asymptotic packet generation that results in degraded performance of routing protocols. The Bordercast ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We designed the Adaptive Bordercast Resolution Protocol for efficient query propagation in a flat ad hoc network. The characteristic of Ad hoc networks like dynamic topology, network density causes asymptotic packet generation that results in degraded performance of routing protocols
A New Routing Metric for High Throughput in Dense Ad Hoc Networks
"... Abstract — Routing protocols in most ad hoc networks use the length of paths as the routing metric. Recent findings have revealed that the minimumhop metric can not achieve the maximum throughput because it tries to reduce the number of hops by containing long range links, where packets need to be ..."
Abstract
 Add to MetaCart
Abstract — Routing protocols in most ad hoc networks use the length of paths as the routing metric. Recent findings have revealed that the minimumhop metric can not achieve the maximum throughput because it tries to reduce the number of hops by containing long range links, where packets need
Optimized Link State Routing Protocol for Ad Hoc Networks
, 2001
"... In this paper we propose and discuss an optimized link state routing protocol, named OLSR, for mobile wireless networks. The protocol is based on the link state algorithm and it is proactive (or tabledriven) in nature. It employs periodic exchange of messages to maintain topology information of the ..."
Abstract

Cited by 261 (1 self)
 Add to MetaCart
to efficiently and economically flood its control messages. It provides optimal routes in terms of number of hops, which are immediately available when needed. The proposed protocol is best suitable for large and dense ad hoc networks.
Mobility increases the capacity of adhoc wireless networks
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 2002
"... The capacity of adhoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an adhoc network where n nodes communicate in random sourcedestination pairs. These nodes are assumed to be mobile. We examine the persession throughpu ..."
Abstract

Cited by 1220 (5 self)
 Add to MetaCart
The capacity of adhoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an adhoc network where n nodes communicate in random sourcedestination pairs. These nodes are assumed to be mobile. We examine the per
Energy Conserving Routing in Wireless Adhoc Networks
, 2000
"... An adhoc 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
An adhoc 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
Results 1  10
of
25,044