Sciweavers

415 search results - page 9 / 83
» Reactive routing overhead in networks with unreliable nodes
Sort
View
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 2 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
BROADNETS
2004
IEEE
14 years 9 days ago
A Distributed Mobile Backbone Formation Algorithm for Wireless Ad Hoc Networks
In this paper, we present a novel fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backbone...
Laura Huei-jiun Ju, Izhak Rubin, Kevin Ni, Christo...
ISCC
2006
IEEE
190views Communications» more  ISCC 2006»
14 years 2 months ago
Time-Critical Underwater Sensor Diffusion with No Proactive Exchanges and Negligible Reactive Floods
— In this paper we study multi-hop ad hoc routing in a scalable Underwater Sensor Network (UWSN), which is a novel network paradigm for ad hoc investigation of the world below th...
Uichin Lee, Jiejun Kong, Joon-Sang Park, Eugenio M...
NOCS
2010
IEEE
13 years 7 months ago
A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors
A new asynchronous interconnection network is introduced for globally-asynchronous locally-synchronous (GALS) chip multiprocessors. The network eliminates the need for global cloc...
Michael N. Horak, Steven M. Nowick, Matthew Carlbe...
MOBIHOC
2003
ACM
14 years 8 months ago
PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols
We develop a detailed approach to study how mobilityimpacts the performance of reactive MANET routing protocols. In particular we examine how the statistics of path durations inclu...
Narayanan Sadagopan, Fan Bai, Bhaskar Krishnamacha...