Sciweavers

567 search results - page 73 / 114
» Centrality-based routing for Wireless Sensor Networks
Sort
View
INFOCOM
2007
IEEE
15 years 4 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...
APNOMS
2009
Springer
15 years 4 months ago
Bypassing Routing Holes in WSNs with a Predictive Geographic Greedy Forwarding
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...
Minh Thiep Ha, Priyadharshini Sakthivel, Hyunseung...
ICC
2009
IEEE
122views Communications» more  ICC 2009»
15 years 4 months ago
Using Area Hierarchy for Multi-Resolution Storage and Search in Large Wireless Sensor Networks
—We consider multi-resolution storage, a technique for providing scalable adaptive data fidelity, necessary for many applications of large wireless sensor networks (WSNs). Altho...
Konrad Iwanicki, Maarten van Steen
INFOCOM
2007
IEEE
15 years 4 months ago
Cost and Collision Minimizing Forwarding Schemes for Wireless Sensor Networks
—The paper presents a novel integrated MAC/routing scheme for wireless sensor networking. Our design objective is to elect the next hop for data forwarding by minimizing the numb...
Michele Rossi, Nicola Bui, Michele Zorzi
JNW
2008
93views more  JNW 2008»
14 years 9 months ago
MAC Protocols for GSP in Wireless Sensor Networks
The Gossip-based Sleep Protocol (GSP) is a routing protocol designed to save energy in Wireless Sensor Networks. This work presents two MAC protocols designed to complement the cha...
Maria Calle, Joseph Kabara