Sciweavers

867 search results - page 97 / 174
» Network Robustness and Graph Topology
Sort
View
IWCMC
2006
ACM
14 years 1 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
INFOCOM
2005
IEEE
14 years 1 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
IAJIT
2008
145views more  IAJIT 2008»
13 years 8 months ago
NAMP: Neighbor Aware Multicast Routing Protocol for Mobile Ad Hoc Networks
: A Mobile Ad Hoc Network (MANET) represents a system of wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary network topologies without...
Al-Sakib Khan Pathan, Muhammad Mostafa Monowar, Md...
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 1 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
CONEXT
2005
ACM
13 years 9 months ago
TIE breaking: tunable interdomain egress selection
— The separation of intradomain and interdomain routing has been a key feature of the Internet’s routing architecture from the early days of the ARPAnet. However, the appropria...
Renata Teixeira, Timothy G. Griffin, Mauricio G. C...