Sciweavers

118 search results - page 7 / 24
» Randomness in Wireless Networks: How to Deal with It
Sort
View
INFOCOM
2012
IEEE
13 years 2 days ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...
JSAC
2008
111views more  JSAC 2008»
14 years 9 months ago
The end-to-end rate control in multiple-hop wireless networks: Cross-layer formulation and optimal allocation
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
Chengnian Long, Bo Li, Qian Zhang, Bin Zhao, Bo Ya...
CN
2010
183views more  CN 2010»
14 years 9 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
ALGOSENSORS
2007
Springer
14 years 11 months ago
Intrusion Detection of Sinkhole Attacks in Wireless Sensor Networks
Abstract. In this paper, we present an Intrusion Detection System designed for wireless sensor networks and show how it can be configured to detect Sinkhole attacks. A Sinkhole at...
Ioannis Krontiris, Tassos Dimitriou, Thanassis Gia...
PERCOM
2005
ACM
15 years 9 months ago
The Area Graph-Based Mobility Model and Its Impact on Data Dissemination
When analyzing dissemination protocols in mobile adhoc networks the underlying mobility model is an important factor because it strongly influences the performance of these protoc...
Sven Bittner, Wolf-Ulrich Raffel, Manuel Scholz