Sciweavers

273 search results - page 52 / 55
» Local approximation schemes for ad hoc and sensor networks
Sort
View
SASN
2006
ACM
14 years 2 months ago
Robust cooperative trust establishment for MANETs
In a mobile ad hoc network (MANET), a source node must rely on intermediate nodes to forward its packets along multihop routes to the destination node. Due to the lack of infrastr...
Charikleia Zouridaki, Brian L. Mark, Marek Hejmo, ...
INFOCOM
2008
IEEE
14 years 3 months ago
Randomized 3D Geographic Routing
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
Roland Flury, Roger Wattenhofer
DCOSS
2006
Springer
14 years 13 days ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
SMA
2008
ACM
154views Solid Modeling» more  SMA 2008»
13 years 8 months ago
Consistent computation of first- and second-order differential quantities for surface meshes
Differential quantities, including normals, curvatures, principal directions, and associated matrices, play a fundamental role in geometric processing and physics-based modeling. ...
Xiangmin Jiao, Hongyuan Zha
INFOCOM
2000
IEEE
14 years 1 months ago
Energy Conserving Routing in Wireless Ad-hoc Networks
— An ad-hoc 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 need...
Jae-Hwan Chang, Leandros Tassiulas