๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Flooding Strategy for Target Discovery in Wireless Networks

โœ Scribed by Zhao Cheng; Wendi B. Heinzelman

Publisher
Springer
Year
2005
Tongue
English
Weight
624 KB
Volume
11
Category
Article
ISSN
1022-0038

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Searching strategies for target discover
Searching strategies for target discovery in wireless networks
โœ Zhao Cheng; Wendi B. Heinzelman ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB

In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In order to find the nearest k targets from a total of m members using the minimum cost, should we search the network only once,

Flooding in wireless ad hoc networks
Flooding in wireless ad hoc networks
โœ H Lim; C Kim ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 265 KB

In an ad hoc network, each host assumes the role of a router and relays packets toward ยฎnal destinations. This paper studies efยฎcient routing mechanisms for packet ยฏooding in ad hoc wireless networks. Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network

An asynchronous neighbor discovery algor
An asynchronous neighbor discovery algorithm for wireless sensor networks
โœ Steven A. Borbash; Anthony Ephremides; Michael J. McGlynn ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 580 KB

We consider the problem of determining, in a distributed, asynchronous and scalable manner, what nodes are ''neighbors'' in a wireless network. Neighbor discovery is an important enabler of network connectivity and energy conservation. An asynchronous, probabilistic neighbor discovery algorithm is p