Sciweavers

414 search results - page 11 / 83
» Minimizing Routing State for Light-Weight Network Simulation
Sort
View
MOBIHOC
2000
ACM
15 years 4 months ago
LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility
– In this paper, we present a novel routing protocol for wireless ad hoc networks – Landmark Ad Hoc Routing (LANMAR). LANMAR combines the features of Fisheye State Routing (FSR...
Guangyu Pei, Mario Gerla, Xiaoyan Hong
ISCA
2009
IEEE
186views Hardware» more  ISCA 2009»
15 years 6 months ago
Application-aware deadlock-free oblivious routing
Conventional oblivious routing algorithms are either not application-aware or assume that each flow has its own private channel to ensure deadlock avoidance. We present a framewo...
Michel A. Kinsy, Myong Hyon Cho, Tina Wen, G. Edwa...
MOBIHOC
2004
ACM
15 years 11 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
CORR
2012
Springer
225views Education» more  CORR 2012»
13 years 7 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
CDC
2009
IEEE
142views Control Systems» more  CDC 2009»
14 years 9 months ago
Asynchronous distributed optimization with minimal communication and connectivity preservation
Abstract-- We consider problems where multiple agents cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchan...
Minyi Zhong, Christos G. Cassandras