Sciweavers

6506 search results - page 490 / 1302
» Algorithmic models for sensor networks
Sort
View
ISCC
2006
IEEE
190views Communications» more  ISCC 2006»
16 years 27 days ago
Time-Critical Underwater Sensor Diffusion with No Proactive Exchanges and Negligible Reactive Floods
— In this paper we study multi-hop ad hoc routing in a scalable Underwater Sensor Network (UWSN), which is a novel network paradigm for ad hoc investigation of the world below th...
Uichin Lee, Jiejun Kong, Joon-Sang Park, Eugenio M...
IJNSEC
2007
127views more  IJNSEC 2007»
15 years 6 months ago
Markov Chain Modelling of the Probabilistic Packet Marking Algorithm
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
Tsz-Yeung Wong, John Chi-Shing Lui, Man Hon Wong
ICRA
2005
IEEE
102views Robotics» more  ICRA 2005»
16 years 14 days ago
SLAM using Incremental Probabilistic PCA and Dimensionality Reduction
— The recent progress in robot mapping (or SLAM) algorithms has focused on estimating either point features (such as landmarks) or grid-based representations. Both of these repre...
Emma Brunskill, Nicholas Roy
ADHOCNETS
2009
Springer
16 years 1 months ago
Improved Topology Control Algorithms for Simple Mobile Networks
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
Fei Che, Errol L. Lloyd, Liang Zhao
EUROCAST
2007
Springer
132views Hardware» more  EUROCAST 2007»
15 years 10 months ago
Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...