Sciweavers

548 search results - page 105 / 110
» A Connection Entropy-based Multi-Rate Routing Protocol for M...
Sort
View
CCCG
2008
13 years 9 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
GLOBECOM
2008
IEEE
14 years 2 months ago
A Novel Coalitional Game Model for Security Issues in Wireless Networks
—In this paper, we propose a novel coalitional game model for security issues in wireless networks. The model can be applied to not only mobile ad hoc networks but also wireless ...
Xiaoqi Li, Michael R. Lyu
INFOCOM
2009
IEEE
14 years 2 months ago
On Leveraging Partial Paths in Partially-Connected Networks
Abstract—Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either ...
Simon Heimlicher, Merkourios Karaliopoulos, Hanoch...
SPAA
2005
ACM
14 years 1 months ago
Constant density spanners for wireless ad-hoc networks
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
Kishore Kothapalli, Christian Scheideler, Melih On...
TMC
2011
223views more  TMC 2011»
13 years 2 months ago
Bidirectionally Coupled Network and Road Traffic Simulation for Improved IVC Analysis
Abstract—Recently, many efforts have been made to develop more efficient Inter-Vehicle Communication (IVC) protocols for ondemand route planning according to observed traffic con...
Christoph Sommer, Reinhard German, Falko Dressler