Sciweavers

461 search results - page 78 / 93
» p-Percent Coverage Schedule in Wireless Sensor Networks
Sort
View
MOBIHOC
2004
ACM
15 years 9 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
MOBICOM
2003
ACM
15 years 2 months ago
Topology control for wireless sensor networks
We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters deployed around strategic locations and base-stations (BSs) whose locations are relatively fl...
Jianping Pan, Yiwei Thomas Hou, Lin Cai, Yi Shi, S...
79
Voted
DCOSS
2005
Springer
15 years 3 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
DSN
2005
IEEE
15 years 3 months ago
TIBFIT: Trust Index Based Fault Tolerance for Arbitrary Data Faults in Sensor Networks
Since sensor data gathering is the primary functionality of sensor networks, it is important to provide a fault tolerant method for reasoning about sensed events in the face of ar...
Mark D. Krasniewski, Padma Varadharajan, Bryan Rab...
MOBICOM
2009
ACM
15 years 4 months ago
Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has ...
Shuo Guo, Yu Gu, Bo Jiang, Tian He