Sciweavers

3370 search results - page 465 / 674
» Adding Networks
Sort
View
COMPGEOM
2005
ACM
15 years 8 months ago
Finding the best shortcut in a geometric network
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...
PERCOM
2007
ACM
16 years 6 months ago
SOS: Secure Overlay Sensornets
Overlay Networks (ONs) are logical networks built on top of a physical network with the aim of moving part of the routing complexity to the application layer. At the same time, sen...
Leonardo B. Oliveira, Antonio Alfredo Ferreira Lou...
202
Voted
MOBIHOC
2006
ACM
16 years 6 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
ICPPW
2002
IEEE
15 years 11 months ago
ARA - The Ant-Colony Based Routing Algorithm for MANETs
A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kind of networks are very flexible, thus they do not require any existing infr...
Mesut Günes, Udo Sorges, Imed Bouazizi
MOBILWARE
2009
ACM
16 years 27 days ago
Chapar: A Cross-Layer Overlay Event System for MANETs
Abstract. In this paper, we present Chapar, an event system designed for mobile ad hoc networks that supports the publish-subscribe model as well as pointto-point and point-to-mult...
Amir R. Khakpour, Isabelle M. Demeure