Sciweavers

98 search results - page 6 / 20
» Geometric partitioning and robust ad-hoc network design
Sort
View
IPPS
2008
IEEE
15 years 4 months ago
A game theoretical data replication technique for mobile ad hoc networks
Adaptive replication of data items on servers of a mobile ad hoc network can alleviate access delays. The selection of data items and servers requires solving a constrained optimi...
Samee Ullah Khan, Anthony A. Maciejewski, Howard J...
109
Voted
MOBIHOC
2002
ACM
15 years 9 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
112
Voted
INFOCOM
2006
IEEE
15 years 4 months ago
A Framework for Distributed Spatio-Temporal Communications in Mobile Ad Hoc Networks
— Space-time communications can help combat fading and hence can significantly increase the capacity of ad hoc networks. Cooperative diversity or virtual antenna arrays facilita...
Gentian Jakllari, Srikanth V. Krishnamurthy, Micha...
JSAC
2006
111views more  JSAC 2006»
14 years 10 months ago
On trust models and trust evaluation metrics for ad hoc networks
Within the realm of network security, we interpret the concept of trust as a relation among entities that participate in various protocols. Trust relations are based on evidence cr...
George Theodorakopoulos, John S. Baras
90
Voted
DCOSS
2006
Springer
15 years 1 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama