Sciweavers

1070 search results - page 140 / 214
» On maximum lifetime routing in Wireless Sensor Networks
Sort
View
SASN
2004
ACM
15 years 11 months ago
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
Yih-Chun Hu, David B. Johnson
AINA
2009
IEEE
16 years 1 months ago
Medium Access Control in Large Scale Clusters for Wireless Sensor Networks
—One of the main advantages of clustering algorithms is the ability to allow networks to be physically divided into smaller regions, thereby increasing the theoretical maximum nu...
Pedro N. E. S. Barbosa, Neil M. White, Nick R. Har...
TPDS
2010
136views more  TPDS 2010»
15 years 4 months ago
Gossip-Based Self-Management of a Recursive Area Hierarchy for Large Wireless SensorNets
—A recursive multi-hop area hierarchy has a number of applications in wireless sensor networks, the most common being scalable point-to-point routing, so-called hierarchical rout...
Konrad Iwanicki, Maarten van Steen
MOBIHOC
2005
ACM
16 years 5 months ago
Timed grid routing (TIGR) bites off energy
Energy efficiency and collisions avoidance are both critical properties to increase the lifetime and effectiveness of wireless networks. This paper proposes a family of algorithms...
Roy Friedman, Guy Korland
ADHOCNOW
2004
Springer
15 years 11 months ago
Improving Distance Based Geographic Location Techniques in Sensor Networks
Supporting nodes without Global Positioning System (GPS) capability, in wireless ad hoc and sensor networks, has numerous applications in guidance and surveying systems in use toda...
Michel Barbeau, Evangelos Kranakis, Danny Krizanc,...