Sciweavers

1594 search results - page 205 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
INFOCOM
2007
IEEE
15 years 9 months ago
Geographic Routing Using Hyperbolic Space
Abstract— We propose a scalable and reliable point-topoint routing algorithm for ad hoc wireless networks and sensornets. Our algorithm assigns to each node of the network a virt...
Robert Kleinberg
152
Voted
DIALM
2004
ACM
165views Algorithms» more  DIALM 2004»
15 years 8 months ago
LLS: a locality aware location service for mobile ad hoc networks
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
Ittai Abraham, Danny Dolev, Dahlia Malkhi
INFOCOM
2003
IEEE
15 years 8 months ago
Routing for Network Capacity Maximization in Energy-constrained Ad-hoc Networks
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman, L...
ICSNC
2007
IEEE
15 years 9 months ago
Movement Prediction Using Bayesian Learning for Neural Networks
Nowadays, path prediction is being extensively examined for use in the context of mobile and wireless computing towards more efficient network resource management schemes. Path pr...
Sherif Akoush, Ahmed Sameh
122
Voted
CN
2007
141views more  CN 2007»
15 years 3 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou