Sciweavers

103 search results - page 7 / 21
» A bidirected generalization of network matrices
Sort
View
MOBIHOC
2002
ACM
15 years 9 months ago
Routing performance in the presence of unidirectional links in multihop wireless networks
We examine two aspects concerning the influence of unidirectional links on routing performance in multihop wireless networks. In the first part of the paper, we evaluate the benef...
Mahesh K. Marina, Samir Ranjan Das
AAIM
2008
Springer
142views Algorithms» more  AAIM 2008»
14 years 11 months ago
Engineering Label-Constrained Shortest-Path Algorithms
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
14 years 9 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
ICC
2009
IEEE
170views Communications» more  ICC 2009»
15 years 4 months ago
Transmission Capacity of Two-Way Communication in Wireless Ad Hoc Networks
—Wireless ad hoc networks require bidirectional data transmission to support two-way traffic and control functions like packet acknowledgement. Most prior work on the capacity o...
Kien T. Truong, Steven Weber, Robert W. Heath Jr.
ICDCS
2010
IEEE
14 years 9 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...