Sciweavers

1144 search results - page 63 / 229
» Locally constructed algorithms for distributed computations ...
Sort
View
HPCC
2007
Springer
14 years 21 days ago
FTSCP: An Efficient Distributed Fault-Tolerant Service Composition Protocol for MANETs
Abstract. Service composition, which enables users to construct complex services from atomic services, is an essential feature for the usability of Mobile Ad hoc Networks (MANETs)....
Zhen-guo Gao, Sheng Liu, Ming Ji, Jinhua Zhao, Lih...
MOBIHOC
2006
ACM
14 years 8 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
INFOCOM
2005
IEEE
14 years 2 months ago
Random-access scheduling with service differentiation in wireless networks
— Recent years have seen tremendous growth in the deployment of Wireless Local Area Networks (WLANs). An important design issue in such networks is that of distributed scheduling...
Piyush Gupta, Yogesh Sankarasubramaniam, Alexander...
PODC
2004
ACM
14 years 2 months ago
Gradient clock synchronization
We introduce the distributed gradient clock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clo...
Rui Fan, Nancy A. Lynch
INFOCOM
2011
IEEE
13 years 16 days ago
Fine-grained location-free planarization in wireless sensor networks
—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...
Dezun Dong, Yunhao Liu, Xiangke Liao, Xiang-Yang L...