Sciweavers

INFOCOM
2003
IEEE
13 years 9 months ago
Unreliable Sensor Grids: Coverage, Connectivity and Diameter
Abstract— We consider an unreliable wireless sensor gridnetwork with n nodes placed in a square of unit area. We are interested in the coverage of the region and the connectivity...
Sanjay Shakkottai, R. Srikant, Ness B. Shroff
INFOCOM
2003
IEEE
13 years 9 months ago
Distributed Construction of Random Expander Networks
— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
Ching Law, Kai-Yeung Siu
INFOCOM
2003
IEEE
13 years 9 months ago
Localized minimum-energy broadcasting in ad-hoc networks
— In the minimum energy broadcasting problem, each node can adjust its transmission power in order to minimize total energy consumption but still enable a message originated from...
Julien Cartigny, David Simplot, Ivan Stojmenovic
ICDCS
2003
IEEE
13 years 9 months ago
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
—We propose a generic framework for distributed broadcasting in ad hoc wireless networks. The approach is based on selecting a small subset of nodes to form a forward node set to...
Jie Wu, Fei Dai
HICSS
2003
IEEE
94views Biometrics» more  HICSS 2003»
13 years 9 months ago
A Hop Constrained Min-Sum Arborescence with Outage Costs
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
Rakesh Kawatra
ACSC
2003
IEEE
13 years 9 months ago
Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
Xiaodi Huang, Wei Lai
MWCN
2004
Springer
13 years 10 months ago
The Receiver's Dilemma
In Mobile Ad Hoc Networks (MANETs), each node has the capacity to act as a router. The performance of the MANET relies on how well the nodes perform this function. In simulations,...
John P. Mullen, Timothy Matis, Smriti Rangan
WINE
2005
Springer
143views Economy» more  WINE 2005»
13 years 10 months ago
Economic Mechanisms for Shortest Path Cooperative Games with Incomplete Information
Abstract. In this paper we present a cooperative game theoretic interpretation of the shortest path problem. We consider a buying agent who has a budget to go from a specified sou...
T. S. Chandrashekar, Yadati Narahari
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
13 years 10 months ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer
PERVASIVE
2005
Springer
13 years 10 months ago
Parasitic Mobility for Pervasive Sensor Networks
Distributed sensor networks offer many new capabilities for contextually monitoring environments. By making such systems mobile, we increase the application-space for the distribut...
Mathew Laibowitz, Joseph A. Paradiso