M. Adler, C. Scheideler, "E#cient communication strategies for ad-hoc wireless networks", Proc. SPAA 98: 10th Annual ACM Symp. Parallel Algorithms and Architectures, 1998, pp. 259-268. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Randomized Communication in Radio Networks - Chlebus (3 citations) (Correct)
....metric space and the reachability relation is determined by ranges that the nodes can cover. A multi hop network is called power controlled if hosts are able to change their transmission ranges, and in this way change also the topology of the underlying reachability graph. Adler and Scheideler [5] introduced a general formal model of power controlled networks, in which each pair of vertices is assigned the lowest transmission power that allows to maintain a direct connection between the vertices. They developed ecient strategies for permutation routing in such networks. They considered ....
M. Adler, and C. Scheideler, Ecient communication strategies for ad-hoc wireless networks, in Proc. 10th ACM Symp. Parallel Algorithms and Architectures, Puerto Vallerta, Mexico, 1998, pp. 259-268.
Analysis and Experimental Evaluation of an Innovative .. - Chatzigiannakis.. (2000) (1 citation) (Correct)
....equipped with wireless transmitters and receivers are moving in a geographical area forming an ad hoc network. Suppose further that these hosts want to execute a simple distributed protocol such as leader election. One way to perform this is to utilise an underlying communication protocol (see [4]) which delivers (if possible) a message from one mobile host to another, regardless of their position. This scheme, in the case of increased mobility of the hosts, could lead to a situation where most of the computational and battery power of the hosts is consumed for the communication ....
....visited or even the last two positions visited, the overall message delay is only slightly reduced. Actually, we remark that for larger memory sizes (i.e. when the head remembers and avoids the last nodes visited, for 4) there is no further reduction on the overall message delay. In table [4] we compare the measured average message delay for a xed grid graph of 100 nodes size and a xed size of k=20. The gure [4] shows clearly that for a memory size 3 we already achieve the maximum performance bene t. 3.2 Implementation For the implementation of the proposed algorithm, the LEDA ....
[Article contains additional citation context not shown here]
M. Adler and C. Scheideler.. Ecient Communication Strategies for Ad-Hoc Wireless Networks. In Proc. 10th Annual Symposium on Parallel Algorithms and Architectures (SPAA'98) (1998).
An Experimental Study of Basic Communication.. - Chatzigiannakis.. (5 citations) (Correct)
....infrastructure of support stations with centralized network management is provided in order to ensure ecient communication. A more recent model is the ad hoc model which assumes that mobile hosts can form networks without the participation of any xed infrastructure. An ad hoc mobile network [1, 8] is a collection of mobile hosts with wireless network interfaces forming a temporary network without the aid of any established infrastructure or centralized administration. In an ad hoc network two hosts that want to communicate may not be within wireless transmission range of each other, but ....
....in [10] The protocol forces all mobile users to slightly deviate (for a short period of time) from their prede ned, deterministic routes, in order to propagate the messages. This protocol is also compulsory for any host and it works only for deterministic host routes. Adler and Scheideler [1] in a previous work, dealt only with static transmission graphs, i.e. the situation where the positions of the mobile hosts and the environment do not change. In [1] the authors pointed out that static graphs provide a starting point for the dynamic case. In our work, we consider the dynamic case ....
[Article contains additional citation context not shown here]
M. Adler and C. Scheideler. Ecient Communication Strategies for Ad-Hoc Wireless Networks. In Proc. 10th Annual Symposium on Parallel Algorithms and Architectures { SPAA'98, 1998.
Models and Techniques for Communication in Dynamic Networks.. - Scheideler (2001) (2 citations) Self-citation (Scheideler) (Correct)
No context found.
M. Adler and C. Scheideler. Ecient communication strategies for ad hoc wireless networks. Theory Comput. Systems, 33:337-391, 2000.
Minimal CDMA Recoding Strategies - In Power-Controlled Ad-Hoc (2001) (Correct)
No context found.
M. Adler, C. Scheideler, "E#cient communication strategies for ad-hoc wireless networks", Proc. SPAA 98: 10th Annual ACM Symp. Parallel Algorithms and Architectures, 1998, pp. 259-268.
Multicast Time Maximization in Energy Constrained.. - Floreen, Kaski.. (2003) (Correct)
No context found.
M. Adler and C. Scheideler, "E#cient communication strategies for ad hoc wireless networks." Theory Comput. Systems 33 (2000), 337--391.
Lifetime Maximization for Multicasting in.. - Floreen, Kaski, al. (Correct)
No context found.
M. Adler and C. Scheideler, \Ecient communication strategies for ad hoc wireless networks." Theory of Computing Systems 33 (2000), 337-391.
Topology Control and Routing in Ad hoc Networks: A Survey - Rajaraman (2002) (14 citations) (Correct)
No context found.
M. Adler and C. Scheideler. Ecient communication strategies for ad-hoc wireless networks. In Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 259-268, June 1998.
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