Sciweavers

1370 search results - page 181 / 274
» Cooperative Node Localization for Mobile Sensor Networks
Sort
View
ICC
2008
IEEE
141views Communications» more  ICC 2008»
15 years 11 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
128
Voted
VTC
2008
IEEE
125views Communications» more  VTC 2008»
15 years 11 months ago
A Bio-Inspired Scheduling Scheme for Wireless Sensor Networks
— Sensor networks with a large amount of sensor nodes usually have high redundancy in sensing coverage. The network lifetime can be further extended by proper scheduling and putt...
Chi-Tsun Cheng, Chi Kong Tse, Francis C. M. Lau
148
Voted
ICWMC
2006
IEEE
15 years 10 months ago
The Impact of Location Errors on Geographic Routing in Sensor Networks
Geographic routing in wireless sensor networks is based on the prerequisite that every node has information about its current position, for instance via GPS or some localization a...
Matthias Witt, Volker Turau
ICICS
2004
Springer
15 years 10 months ago
Securing the Destination-Sequenced Distance Vector Routing Protocol (S-DSDV)
A mobile ad hoc network (MANET) is formed by a group of mobile wireless nodes, each of which functions as a router and agrees to forward packets for others. Many routing protocols ...
Tao Wan, Evangelos Kranakis, Paul C. van Oorschot
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
15 years 9 months ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff