Sciweavers

116 search results - page 21 / 24
» Formal modeling and analysis of wireless sensor network algo...
Sort
View
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 4 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
INFOCOM
2007
IEEE
14 years 1 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 7 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
MOBICOM
2005
ACM
14 years 1 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
MOBIHOC
2007
ACM
14 years 7 months ago
Allocating dynamic time-spectrum blocks in cognitive radio networks
A number of studies have shown the abundance of unused spectrum in the TV bands. This is in stark contrast to the overcrowding of wireless devices in the ISM bands. A recent trend...
Yuan Yuan, Paramvir Bahl, Ranveer Chandra, Thomas ...