I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis, "Analysis and experimental evaluation of an innovative and efficient routing protocol for ad-hoc mobile networks," Lecture Notes in Computer Science, vol. 1982. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Survey of Dependability Issues in Mobile Wireless Networks - Basile, Killijian, Powell (2003) (1 citation) (Correct)
....scenarios considered, epidemic routing is able to deliver nearly all transmitted messages while existing ad hoc routing protocols fail to deliver any messages because of the limited node connectivity. The required buffering, of course, causes increased resource consumption. Chatzigiannakis et al. [45] present a snake protocol, where a snake like sequence of carriers (called support stations in the paper) always remain pairwise adjacent and move in a way determined by the snake s head. The head moves by executing a random walk over the area covered by the network. The protocol is theoretically ....
....head. The head moves by executing a random walk over the area covered by the network. The protocol is theoretically analyzed. Results derived from an implementation show that only a small number of carriers is required for efficient communication. Chatzigiannakis et al. 46] extend the work in [45] by presenting a new protocol, called the runners, where each carrier performs a random walk sweeping the whole area covered by the network. The authors perform an experimental evaluation and comparison between the snake protocol and the runners protocol. It turns out that the runners protocol is ....
I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis, "Analysis and experimental evaluation of an innovative and efficient routing protocol for ad-hoc mobile networks," Lecture Notes in Computer Science, vol. 1982.
An Experimental Study of Basic Communication.. - Chatzigiannakis.. (5 citations) Self-citation (Chatzigiannakis Nikoletseas Spirakis) (Correct)
....is based on the idea of forcing only a very small subset of mobile users, called the support of the network, to move as per the needs of the protocol. Such protocols are called semi compulsory protocols. The rst semi compulsory protocol for the basic communication problem was presented in [2]. It uses a snake like sequence of support stations that always remain pairwise adjacent and move in a way determined by the snake s head. The head moves by executing a random walk over the area covered by the network. We shall refer to this protocol as the snake protocol. The snake protocol is ....
....sequence of support stations that always remain pairwise adjacent and move in a way determined by the snake s head. The head moves by executing a random walk over the area covered by the network. We shall refer to this protocol as the snake protocol. The snake protocol is theoretically analyzed in [2] using interesting properties of random walks and their meeting times. A rst implementation of the protocol was developed and experimentally evaluated in [2] with the emphasis to con rm the theoretical analysis. Both the experiments and the theoretical analysis indicated that only a small support ....
[Article contains additional citation context not shown here]
I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. Analysis and Experimental Evaluation of an Innovative and Ecient Routing Approach for Ad-hoc Mobile Networks. In Proc. 4th Annual Workshop on Algorithmic Engineering { WAE'00, 2000.
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