G. Calinescu, I. Mandoiu, P.-J. Wan, and A. Zelikovsky, "Selecting forwarding neighbors in wireless ad hoc networks," in Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications. ACM Press, 2001, pp. 34--43.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....dominating sets We shall now present, in the coming sections, methods that are reliable and fully localized. That is, node mobility impacts only local structure. This section deals with methods where the selection of forwarding nodes depends on the source of broadcasting task. Several authors [CMWZ, QVL, LK, SL] proposed independently reliable broadcasting schemes in which the sending node selects adjacent nodes that should relay the packet to complete broadcast. The IDs of selected adjacent nodes are recorded in the packet as a forward list. An adjacent node that is requested to relay the packet again ....

....node establishes priorities between forwarding nodes, and each forwarding node should eliminate from the consideration not only neighbors of the sender node, but also neighbors of each relaying node with higher priority. Sun and Lai [SL, SL1, SL2] and Calinescu, Mandoiu, Wan and Zelikovsky [CMWZ] presented heuristics that aimed at covering the whole area where 2 hop neighbors could be located by minimal set of 1 hop neighbors, and analyzed the performance of their schemes. The problem is equivalent to selecting minimal set of disks that still cover the same area as the area covered by all ....

[Article contains additional citation context not shown here]

G. Calinescu, I. Mandoiu, P.J. Wan and A. Zelikovsky, Selecting forwarding neighbors in wireless ad hoc networks, Proc. DIAL M, 2001.

....S will receive it. The goal is to minimize the number of relay points of S. The computation of a multipoint relay set with minimal size is an NP complete problem, as proven in [24] Two practical heuristics for selecting the minimum number of forwarding neighbors (i.e. relay points) are given in [4]. The multipoint relay method [8] 24] is a heuristic that works as follows: Let N1 ( and N2 ( be sets of one hop and two hop neighbors of S, respectively. Further, let the relay points of S form the set MPR(S) A small size set MPR(S) is computed by the procedure relays(S) which starts with ....

....precisely, ratios are quite stable for clustering and intergateway methods, somewhat increasing (with increasing d) for intermediate method, and notably decreasing for gateway method. The multipoint relay method performs well, with savings between intergateway and gateway methods (note that papers [4], 24] did not evaluate the performance of the multipoint method for solving broadcasting task on random unit graphs) Thus, the gateway method appears to be the overall winner. Recall that this comparison involves only retransmissions involved in direct broadcasting tasks and for initial ....

G. Calinescu, I. Mandoiu, P.J. Wan, and A. Zelikovsky, "Selecting Forwarding Neighbors in Wireless Ad Hoc Networks," Proc. Fifth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL M), 2001.

No context found.

G. Calinescu, I. Mandoiu, P.-J. Wan, and A. Zelikovsky, \Selecting Forwarding Neighbors in Wireless Ad Hoc Networks", 5th International Workshop on Discrete Algorithms and Methods for Mobility, 2001, Pages 34-43.

....when all 2 hop neighbors are in the same quadrant with respect to the source node. A constant factor approximation for the Minimum Disk Cover problem with disks of the same radius, based on rounding the optimal solution of a linear programming relaxation. A preliminary version of this paper [3] presents the same results, except for the 3 approximation algorithm and the exact algorithm for the special case above, where the running time in [3] is O(n ) The paper is organized as follows. In next section we reformulate the Minimum Forwarding Set problem in geometric terms, give a ....

....with disks of the same radius, based on rounding the optimal solution of a linear programming relaxation. A preliminary version of this paper [3] presents the same results, except for the 3 approximation algorithm and the exact algorithm for the special case above, where the running time in [3] is O(n ) The paper is organized as follows. In next section we reformulate the Minimum Forwarding Set problem in geometric terms, give a high level algorithm based on decomposition into quadrants, and establish basic geometric properties of the partitioned sets of 1 and 2 hop neighbors. The ....

[Article contains additional citation context not shown here]

G. Calinescu, I. Mandoiu, P-J. Wan, and A. Zelikovsky, "Selecting Forwarding Neighbors in Wireless Ad Hoc Networks," Proc. 5 International Workshop on Discrete Algorithms and Methods for Mobility, 2001, 34--43.

No context found.

G. Calinescu, I. Mandoiu, P.-J. Wan, and A. Zelikovsky, "Selecting forwarding neighbors in wireless ad hoc networks," in Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications. ACM Press, 2001, pp. 34--43.

No context found.

Gruia C alinescu, Ion M andoiu, Peng-Jun Wan, and Alexander Zelikovsky, "Selecting forwarding neighbors in wireless ad hoc networks," in ACM DialM, 2001.

No context found.

G. Calinescu, I. Mandoiu, P. J. Wan, and A. Zelikovsky. Selecting forwarding neighbors in wireless ad hoc networks. Proc. ACM DIALM'2001.

No context found.

Gruia Calinescu, Ion Mandoiu, Peng-Jun Wan, and Alexander Zelikovsky, \Selecting forwarding neighbors in wireless ad hoc networks," in ACM DialM, 2001.

No context found.

Gruia Calinescu, Ion Mandoiu, Peng-Jun Wan, and Alexander Zelikovsky, "Selecting forwarding neighbors in wireless ad hoc networks," in ACM

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