Sciweavers

1306 search results - page 241 / 262
» Localizing Jammers in Wireless Networks
Sort
View
INFOCOM
2010
IEEE
14 years 10 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
MST
2010
187views more  MST 2010»
14 years 6 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
107
Voted
GLOBECOM
2006
IEEE
15 years 5 months ago
Position-based Routing using Virtual Small World in MANETs
— Routing is the foremost issue in mobile ad hoc networks (MANETs), In a wireless environment characterized by small bandwidth and limited computation resources, positionbased ro...
Cong Liu, Jie Wu
EUC
2006
Springer
15 years 3 months ago
Scalable Message Routing for Mobile Software Assistants
In this paper we define an algorithm for location-independent communication of mobile software Personal Assistants (PAs). The algorithm extends the Query Server with Caching algor...
Pawel T. Wojciechowski
INFOCOM
2011
IEEE
14 years 3 months ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...