Sciweavers

661 search results - page 62 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
MOBIHOC
2007
ACM
15 years 9 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
COMPLEX
2009
Springer
15 years 4 months ago
Composing Music with Complex Networks
—In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes an...
Xiaofan Liu, Chi Kong Tse, Michael Small
NIPS
2004
14 years 11 months ago
Validity Estimates for Loopy Belief Propagation on Binary Real-world Networks
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....
Joris M. Mooij, Hilbert J. Kappen
AINA
2006
IEEE
15 years 3 months ago
Clustering Protocol for Sensor Networks
In this paper we present Clustering Protocol (CP) for sensor networks. Clustering techniques are used by different protocols and applications to increase scalability and reduce de...
Arjan Durresi, Vamsi Paruchuri, Leonard Barolli
UCS
2007
Springer
15 years 4 months ago
A Media Access Protocol for Proactive Discovery in Ubiquitous Wireless Networks
A MAC protocol is proposed for proactive discovery in which wireless devices periodically broadcast packets containing presence or service information. The protocol is based on Fra...
Pavel Poupyrev, Peter Davis, Hiroyuki Morikawa