Sciweavers

364 search results - page 40 / 73
» Shortest-path network interdiction
Sort
View
GCC
2005
Springer
14 years 1 months ago
A Routing Protocol Based on Trust for MANETs
Abstract. Ad hoc network is a peer-to-peer grid system. The combination of the Knowledge Grid and ad hoc network could have a great effect on the future interconnection environment...
Cuirong Wang, Xiaozong Yang, Yuan Gao
SIGECOM
2003
ACM
124views ECommerce» more  SIGECOM 2003»
14 years 26 days ago
Coalitional games on graphs: core structure, substitutes and frugality
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
Rahul Garg, Vijay Kumar, Atri Rudra, Akshat Verma
CONEXT
2007
ACM
13 years 11 months ago
Exploring the routing complexity of mobile multicast: a semi-empirical study
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
Matthias Wählisch, Thomas C. Schmidt
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 10 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
COMCOM
2006
79views more  COMCOM 2006»
13 years 7 months ago
How many sensors for an acceptable breach detection probability?
Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the num...
Ertan Onur, Cem Ersoy, Hakan Deliç