#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2011

2016

- This year (0)
- Last five years (6)

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Jianhang Gao, Qing Zhao, Wei Ren, Ananthram Swami, Ram Ramanathan, Amotz Bar-Noy
- 2012 10th International Symposium on Modeling and…
- 2012

A hypergraph is a set V of vertices and a set of non-empty subsets of V , called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions in social and communication networks that go beyond a simple union of pairwise relationships. In this paper, we consider the shortest path problem in hypergraphs. We develop two algorithms for finding… (More)

- Wei Ren, Qing Zhao, +5 authors Prithwish Basu
- MASS
- 2011

We consider the broadcasting problem in multi-radio multi-channel ad hoc networks. The objective is to minimize the total cost of the network-wide broadcast, where the cost can be of any form that is summable over all the transmissions (e.g., the transmission and reception energy, the price for accessing a specific channel). Our technical approach is based… (More)

- Jianhang Gao, Qing Zhao, Ananthram Swami
- 2012 50th Annual Allerton Conference on…
- 2012

We formulate and study the thinnest path problem in wireless ad hoc networks. The objective is to find a path from the source to the destination that results in the minimum number of nodes overhearing the message by carefully choosing the relaying nodes and their corresponding transmission power. We adopt a directed hypergraph model of the problem and… (More)

- Jianhang Gao, Qing Zhao, Ananthram Swami
- IEEE Transactions on Network Science and…
- 2016

We consider the problem of sampling a node-valued graph. The objective is to infer the values of all nodes from that of a minimum subset of nodes by exploiting correlations in node values. We first introduce the concept of information dominating set (IDS). A subset of nodes in a given graph is an IDS if the values of these nodes are sufficient to infer the… (More)

- Jianhang Gao, Qing Zhao, Ananthram Swami
- IEEE/ACM Transactions on Networking
- 2015

We formulate and study the thinnest path problem for secure communication in wireless ad hoc networks. The objective is to find a path from a source to its destination that results in the minimum number of nodes overhearing the message by a judicious choice of relaying nodes and their corresponding transmission powers. We adopt a directed hypergraph model… (More)

- Jianhang Gao, Qing Zhao, Ananthram Swami
- 2015 IEEE International Conference on Acoustics…
- 2015

We consider the problem of sampling a node-weighted graph. The objective is to infer the values of all nodes from that of a minimum subset of nodes by exploiting correlations in node values. We first introduce the concept of information dominating set (IDS). A subset of nodes in a given graph is an IDS if the value of these nodes is sufficient to infer the… (More)

- Jianhang Gao, Qing Zhao, Ananthram Swami
- ArXiv
- 2014

We consider the problem of inferring the opinions of a social network through strategically sampling a minimum subset of nodes by exploiting correlations in node opinions. We first introduce the concept of information dominating set (IDS). A subset of nodes in a given network is an IDS if knowing the opinions of nodes in this subset is sufficient to infer… (More)

- ‹
- 1
- ›