The price of anarchy is independent of the network topology
T Roughgarden - Proceedings of the thiry-fourth annual ACM symposium …, 2002 - dl.acm.org
We study the degradation in network performance caused by the selfish behavior of
noncooperative network users. We consider a directed network in which each edge …
noncooperative network users. We consider a directed network in which each edge …
Hidden conditional random fields for gesture recognition
We introduce a discriminative hidden-state approach for the recognition of human gestures.
Gesture sequences often have a complex underlying structure, and models that can …
Gesture sequences often have a complex underlying structure, and models that can …
Power consumption in packet radio networks
In this paper we study the problem of assigning transmission ranges to the nodes of a multi-
hop packet radio network so as to minimize the total power consumed under the constraint …
hop packet radio network so as to minimize the total power consumed under the constraint …
Minimizing broadcast latency and redundancy in ad hoc networks
Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting,
a source node end a message to all the other nodes in the network. In this paper, we …
a source node end a message to all the other nodes in the network. In this paper, we …
Algorithms for wireless sensor networks
S Sahni, X Xu - International journal of distributed sensor …, 2005 - journals.sagepub.com
Algorithms for Wireless Sensor Networks - Sartaj Sahni, **aochun Xu, 2005 Skip to main
content Intended for healthcare professionals Sage Journals Home Search this journal Search …
content Intended for healthcare professionals Sage Journals Home Search this journal Search …
Fast broadcasting and gossi** in radio networks
We establish an O (nlog2n) upper bound on the time for deterministic distributed
broadcasting in multi-hop radio networks with unknown topology. This nearly matches the …
broadcasting in multi-hop radio networks with unknown topology. This nearly matches the …
An Lower Bound for Broadcast in Radio Networks
We show that for any randomized broadcast protocol for radio networks, there exists a
network in which the expected time to broadcast a message is Ω(D\log(N/D)), where D is the …
network in which the expected time to broadcast a message is Ω(D\log(N/D)), where D is the …
Nearly constant approximation for data aggregation scheduling in wireless sensor networks
Data aggregation is a fundamental yet time-consuming task in wireless sensor networks. We
focus on the latency part of data aggregation. Previously, the data aggregation algorithm of …
focus on the latency part of data aggregation. Previously, the data aggregation algorithm of …
Deterministic broadcasting in ad hoc radio networks
We consider the problem of distributed deterministic broadcasting in radio networks of
unknown topology and size. The network is synchronous. If a node u can be reached from …
unknown topology and size. The network is synchronous. If a node u can be reached from …
Dynamic probabilistic broadcasting in MANETs
Q Zhang, DP Agrawal - Journal of parallel and Distributed Computing, 2005 - Elsevier
In mobile ad hoc networks (MANETs), the efficiency of broadcasting protocol can
dramatically affect the performance of the entire network. Appropriate use of a probabilistic …
dramatically affect the performance of the entire network. Appropriate use of a probabilistic …