Sciweavers

654 search results - page 95 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
MOBIQUITOUS
2007
IEEE
14 years 3 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
TWC
2008
120views more  TWC 2008»
13 years 8 months ago
Cooperation Enforcement and Learning for Optimizing Packet Forwarding in Autonomous Wireless Networks
In wireless ad hoc networks, autonomous nodes are reluctant to forward others' packets because of the nodes' limited energy. However, such selfishness and noncooperation ...
Charles Pandana, Zhu Han, K. J. Ray Liu
OPODIS
2004
13 years 10 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
JPDC
2006
187views more  JPDC 2006»
13 years 8 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
DASFAA
2011
IEEE
341views Database» more  DASFAA 2011»
13 years 6 months ago
Utility-Oriented K-Anonymization on Social Networks
\Identity disclosure" problem on publishing social network data has gained intensive focus from academia. Existing k-anonymization algorithms on social network may result in n...
Yazhe WANG, Long XIE, Baihua ZHENG, and Ken C. K. ...