Sciweavers

218 search results - page 2 / 44
» A simulation study of the OSPF-OMP routing algorithm
Sort
View
MOBIHOC
2004
ACM
14 years 4 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...
MOBIHOC
2003
ACM
14 years 4 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
CISIS
2008
IEEE
13 years 5 months ago
A Study of Maximum Lifetime Routing in Sparse Sensor Networks
A major issue in wireless sensor networks is to prolong network lifetime by efficient energy management. In this paper we present an initial study of maximum lifetime routing in s...
Ewa Hansen, Mikael Nolin, Mats Björkman
EJWCN
2010
156views more  EJWCN 2010»
13 years 3 days ago
On Performance Modeling of Ad Hoc Routing Protocols
Simulation studies have been the predominant method of evaluating ad hoc routing algorithms. Despite their wide use and merits, simulations are generally time consuming. Furthermo...
Muhammad Saleem, Syed Ali Khayam, Muddassar Farooq
ISPAN
2005
IEEE
13 years 10 months ago
A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
Vinh Trong Le, Son-Hong Ngo, Xiaohong Jiang, Susum...