Sciweavers

105 search results - page 21 / 21
» Hierarchical routing in ad hoc networks using k-dominating s...
Sort
View
WINE
2005
Springer
161views Economy» more  WINE 2005»
13 years 10 months ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
SASN
2003
ACM
13 years 10 months ago
SECTOR: secure tracking of node encounters in multi-hop wireless networks
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
Srdjan Capkun, Levente Buttyán, Jean-Pierre...
INFOCOM
2007
IEEE
13 years 11 months ago
Modeling Time-Variant User Mobility in Wireless Mobile Networks
Abstract— Realistic mobility models are important to understand the performance of routing protocols in wireless ad hoc networks, especially when mobility-assisted routing scheme...
Wei-jen Hsu, Thrasyvoulos Spyropoulos, Konstantino...
SENSYS
2003
ACM
13 years 10 months ago
Timing-sync protocol for sensor networks
Wireless ad-hoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborati...
Saurabh Ganeriwal, Ram Kumar, Mani B. Srivastava
IPSN
2007
Springer
13 years 11 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...