Sciweavers

273 search results - page 18 / 55
» Local approximation schemes for ad hoc and sensor networks
Sort
View
ESA
2003
Springer
98views Algorithms» more  ESA 2003»
14 years 25 days ago
Network Lifetime and Power Assignment in ad hoc Wireless Networks
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsk...
NEW2AN
2007
Springer
14 years 1 months ago
tinyLUNAR: One-Byte Multihop Communications Through Hybrid Routing in Wireless Sensor Networks
Abstract. In this paper we consider a problem of implementing a hybrid routing protocol for wireless sensor networks, which natively supports data-centric, geographic-based and add...
Evgeny Osipov
MOBIHOC
2002
ACM
14 years 7 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
ESAS
2007
Springer
14 years 1 months ago
New Strategies for Revocation in Ad-Hoc Networks
Responding to misbehavior in ad-hoc and sensor networks is difficult. We propose new techniques for deciding when to remove nodes in a decentralized manner. Rather than blackballin...
Tyler Moore, Jolyon Clulow, Shishir Nagaraja, Ross...
ALGOSENSORS
2004
Springer
14 years 1 months ago
A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
Abstract. Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule tra...
Ted Herman, Sébastien Tixeuil