Sciweavers

1355 search results - page 263 / 271
» A Taxonomy of Localization Schemes for Wireless Sensor Netwo...
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 7 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
MOBIHOC
2003
ACM
14 years 7 months ago
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
Chao Gui, Prasant Mohapatra
INFOCOM
2010
IEEE
13 years 6 months ago
From Time Domain to Space Domain: Detecting Replica Attacks in Mobile Ad Hoc Networks
—A common vulnerability of wireless networks, in particular, the mobile ad hoc network (MANET), is their susceptibility to node compromise/physical capture attacks since the wire...
Kai Xing, Xiuzhen Cheng
TWC
2008
201views more  TWC 2008»
13 years 7 months ago
A Novel Algorithm for Multipath Fingerprinting in Indoor WLAN Environments
Abstract--Positioning in indoor wireless environments is growing rapidly in importance and gains commercial interests in context-awareness applications. The essential challenge in ...
Shih-Hau Fang, Tsung-Nan Lin, Kun-Chou Lee
JSAC
2008
140views more  JSAC 2008»
13 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham