Sciweavers

9949 search results - page 117 / 1990
» On the Network Complexity of Selection
Sort
View
INFOCOM
2007
IEEE
14 years 3 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...
GLOBECOM
2006
IEEE
14 years 3 months ago
Self-Adaptive Ad-Hoc/Sensor Network Routing with Attractor-Selection
Abstract— In this paper we propose MARAS, a biologicallyinspired method for routing in a mobile ad-hoc/sensor network environment. We assume that all nodes have no explicit knowl...
Kenji Leibnitz, Naoki Wakamiya, Masayuki Murata
DEXAW
2004
IEEE
97views Database» more  DEXAW 2004»
14 years 21 days ago
A Selective Border-Casting Zone Routing Protocol for Ad-hoc Networks
One of well-known routing protocol for ad-hoc networks is Zone Routing Protocol (ZRP). The performance of ZRP is better than other protocols. However, many useless control packets...
Leonard Barolli, Yoshitaka Honma, Akio Koyama, Arj...
DSN
2004
IEEE
14 years 21 days ago
Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks
Cyclic Redundancy Codes (CRCs) provide a first line of defense against data corruption in many networks. Unfortunately, many commonly used CRC polynomials provide significantly le...
Philip Koopman, Tridib Chakravarty
INFOCOM
2008
IEEE
14 years 3 months ago
Cell Selection in 4G Cellular Networks
—Cell selection is the process of determining the cell(s) that provide service to each mobile station. Optimizing these processes is an important step towards maximizing the util...
David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabr...