19 search results - page 3 / 4 » On the Longest RNG Edge of Wireless Ad Hoc Networks |
NAS
2010
IEEE
13 years 5 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
DIALM
2003
ACM
14 years 10 days ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
Broadcasting in ad hoc networks is required for many routing and other network-layer protocols to request information like routes or locations about destination nodes. Most of the...
ADHOCNOW
2003
Springer
14 years 9 days ago
2003
Springer
This paper models an ad-hoc network as a continuum of nodes, ignoring edge effects, to find how the traffic scales with N, the number of nodes. We obtain expressions for the traffi...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...