Sciweavers

5911 search results - page 741 / 1183
» Annealing Sensor Networks
Sort
View
204
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
MOBICOM
2006
ACM
16 years 25 days ago
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
Hannes Frey, Ivan Stojmenovic
185
Voted
MSN
2007
Springer
187views Sensor Networks» more  MSN 2007»
16 years 1 months ago
Performance Analysis of IEEE 802.11 in Multi-hop Wireless Networks
Abstract. Multi-hop wireless networks provide a quick and easy way for networking when we need a temporary network or when cabling is difficult. The 802.11 Medium Access Control (M...
Lan Tien Nguyen, Razvan Beuran, Yoichi Shinoda
186
Voted
GLOBECOM
2009
IEEE
16 years 1 months ago
MAC Protocol Engine for Sensor Networks
—We present a novel approach for Medium Access Control (MAC) protocol design based on protocol engine. Current way of designing MAC protocols for a specific application is based...
Sinem Coleri Ergen, Piergiuseppe Di Marco, Carlo F...
ICC
2008
IEEE
141views Communications» more  ICC 2008»
16 years 1 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