Sciweavers

4435 search results - page 554 / 887
» Networking named content
Sort
View
200
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
INFOCOM
2006
IEEE
16 years 24 days ago
DFT-MSN: The Delay/Fault-Tolerant Mobile Sensor Network for Pervasive Information Gathering
Abstract— This paper focuses on the Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN) for pervasive information gathering. We develop simple and efficient data delivery schem...
Yu Wang, Hongyi Wu
LCN
2006
IEEE
16 years 24 days ago
Computing Real Time Jobs in P2P Networks
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
Jingnan Yao, Jian Zhou, Laxmi N. Bhuyan
INFOCOM
2005
IEEE
16 years 11 days ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
WOWMOM
2005
ACM
132views Multimedia» more  WOWMOM 2005»
16 years 10 days ago
Comparisons of Inter-Domain Routing Schemes for Heterogeneous Ad Hoc Networks
— In this paper, we propose three interdomain routing schemes for communications between different ad-hoc groups (subnets), namely the implicit foreign degree based (IFD), the ex...
Wenbin Ma, Mooi Choo Chuah