I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Near optimal geographic routing with obstacle avoidance in ..:
, In:
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
,
Moraru, Luminita
;
Leone, Pierre
;
Nikoletseas, Sotiris
. - p. 31-38 , 2007
Link:
https://dl.acm.org/doi/10.1145/1298239.1298246
RT T1
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
: T1
Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms
UL https://suche.suub.uni-bremen.de/peid=acm-1298246&Exemplar=1&LAN=DE A1 Moraru, Luminita A1 Leone, Pierre A1 Nikoletseas, Sotiris A1 Rolim, José D. P. PB ACM YR 2007 K1 QoS routing K1 communication void K1 geographic ad-hoc routing K1 geographic routing K1 obstacle avoidance K1 optimal path K1 sensor networks K1 void-handling technique K1 Networks K1 Network protocols K1 Network layer protocols K1 Routing protocols K1 Theory of computation K1 Randomness, geometry and discrete structures K1 Computational geometry K1 Design and analysis of algorithms K1 Approximation algorithms analysis K1 Routing and network design problems K1 Graph algorithms analysis K1 Network flows K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory SP 31 OP 38 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/1298239.1298246 DO https://dl.acm.org/doi/10.1145/1298239.1298246 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)