Sciweavers

1204 search results - page 154 / 241
» Optimal Routing in a Small-World Network
Sort
View
NETWORKS
2008
15 years 6 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
GECCO
2007
Springer
268views Optimization» more  GECCO 2007»
16 years 10 days ago
Vulnerability analysis and security framework (BeeSec) for nature inspired MANET routing protocols
Design, development and evaluation of adaptive, scalable, and power aware Bio/Nature inspired routing protocols has received a significant amount of attention in the recent past....
Nauman Mazhar, Muddassar Farooq
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
16 years 6 months ago
Signing a Linear Subspace: Signature Schemes for Network Coding
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, netw...
Dan Boneh, David Freeman, Jonathan Katz, Brent Wat...
ICDCS
2002
IEEE
15 years 11 months ago
A Reliable Multicast Algorithm for Mobile Ad Hoc Networks
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
Thiagaraja Gopalsamy, Mukesh Singhal, Dhabaleswar ...
IWSOS
2009
Springer
16 years 22 days ago
Revisiting P2P Content Sharing in Wireless Ad Hoc Networks
Classical content sharing applications like BitTorrent are not designed to run over wireless networks. When adapting them to these constrained networks, two main problems arise. On...
Mohamed Karim Sbai, Chadi Barakat