J. Beal. Persistent nodes for reliable memory in geographically local networks. AI Memo 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
RAMBONODEs for the Metropolitan Ad Hoc Network - Beal, Gilbert (2004) Self-citation (Beal) (Correct)
No context found.
Jacob Beal. Persistent nodes for reliable memory in geographically local networks. Technical Report AIM-2003-11, MIT, 2003.
RAMBONODES for the Metropolitan Ad Hoc Network - Jacob Beal Seth (2003) Self-citation (Beal) (Correct)
No context found.
J. Beal. Persistent nodes for reliable memory in geographically local networks. Tech Report AIM-2003-11, MIT, 2003.
A Robust Amorphous Hierarchy from Persistent Nodes - Beal (2003) (3 citations) Self-citation (Beal) (Correct)
....and analyze properties of the hierarchy produced. 3.1 A Brief Review of Persistent Nodes Most of the functionality of Persistent Nodes is actually not used by PNHmRARCHY: this section will sketch only their anatomy and movement. For an in depth treatment of the PERSISTENTNODE algorithm, see [4]. Persistent Nodes, as used by the PNHIERARCHY algorithm, are named spherical regions of a geographically local network. A Persistent Node N begins life centered at a single particle and expands to incorporate all the particles within r hops. Thereafter, it slowly shifts its center according to a ....
....to repel each other. For a node N, let l be the number of reflectors for PNPartition(r) nodes 2 other than N to which a particle belongs, and let K(p) iCchildren(p) v(i) the sum of heuristic values at the children of the particle. Then we define the potential function piecewise as: lIn [4] k 3. In this paper, however, we adjust k up to 8. Since particles in the umbra play no computational role in the node, this does not change any results from [4] 2This specifically excludes nodes used by all other processes, including partition processes with different values of r, in order ....
[Article contains additional citation context not shown here]
Jacob Beal. Persistent Nodes for Reliable Memory in Geographically Local Networks. MIT AI Memo 2003-011.
LOCI: Local Clustering Service for Large Scale Wireless.. - Mittal, Demirbas, Arora (2003) (Correct)
No context found.
J. Beal. Persistent nodes for reliable memory in geographically local networks. AI Memo 2003.
Virtual Mobile Nodes for Mobile Ad Hoc Networks.. - Dolev, Gilbert.. (2004) (Correct)
No context found.
BEAL, J. Persistent nodes for reliable memory in geographically local networks. Tech. Rep. AIM
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC