Sciweavers

312 search results - page 36 / 63
» Degree Bounded Network Design with Metric Costs
Sort
View
IPPS
2008
IEEE
14 years 3 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
IWCMC
2010
ACM
14 years 1 months ago
Energy-aware online routing with QoS constraints in multi-rate wireless ad hoc networks
Wireless ad hoc networks consist of hundreds to thousands of mobile nodes that are powered by batteries. To prolong the network operational time, energy conservation in such netwo...
Wei Yang, Weifa Liang, Jun Luo, Wenhua Dou
CAMAD
2009
IEEE
14 years 1 months ago
Improving Federation Executions with Migrating HLA/RTI Central Runtime Components
— Simulation tools are popular in the design and study of communication systems and networks. The implementation of analytic distributed simulations commonly require a central en...
Ricardo Lent
WS
2006
ACM
14 years 2 months ago
Modeling Ad-hoc rushing attack in a negligibility-based security framework
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
Jiejun Kong, Xiaoyan Hong, Mario Gerla
DCOSS
2006
Springer
14 years 9 days ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...