Jie Wu and Hailan Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In DIALM '99: Proceedings of the 3rd international workshop on discrete algorithms and methods for mobile computing and communications, pages 7--14. ACM Press, 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....GFG (and its variants) BMSU] guarantees delivery, but only for wireless networks modeled by unit graphs. In addition, it requires accurate position of destination. Finally, GFG is a memoryless algorithm (that is, nodes do not need to memorize past traffic) The concept of internal nodes [WL, SSZ] is shown to improve the performance of routing algorithms, and will be applied also in this paper. All QoS routing algorithms for wireless networks proposed in literature are non localized, and do not use GPS in their routing decisions. This paper is organized as follows. Section 2 gives a ....

....either in the set or neighbors of nodes in the set. Nodes that belong to a dominating set will be called internal nodes for G (of course, a different definition for dominating set leads to different set of internal nodes) Routing based on a connected dominating set is frequently used approach 5 [WL], where the searching space for a route is reduced to corresponding internal nodes. The routing process, in this approach, is divided into three steps. If source node is not an internal node, it forwards the packets to one of its adjacent internal nodes. This internal node then acts as a new ....

[Article contains additional citation context not shown here]

J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc. DIAL M, Seattle, Aug. 1999, 7-14. This research is supported by NSERC and CONACYT research grants.

....past traffic is memorized or a timestamp is enforced [SL] A routing algorithm that guarantees delivery in unit graphs is described in [BMSU] It has been generalized in 3 [BFNO] for wider ranges of graphs. Power aware routing is discussed in [SL2] The concept of internal nodes is introduced in [WL] and it significantly improves delivery rates and hop counts in routing algorithms [SSW] Detailed survey on position based routing schemes in given in [GSB] A detailed literature review on location update schemes for efficient routing in ad hoc networks is given in recent survey [S2] The ....

....all its r hop neighbors to that node. We observe that this is, in fact, a well known clustering algorithm [LG] generalized to r hops. The maintenance of cluster structure is known to require significant communication overhead (for instance, local changes may cause global updates by chain effect) [GKP, WL]. A significantly better backbone structure, one that does not require any communication overhead and provides connectivity between nodes, is described in [WL] and can be also generalized to r hop case. Nodes in virtual backbone are database servers for location information. 4 They define a ....

[Article contains additional citation context not shown here]

J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc. DIAL M, Seattle, Aug. 1999, 7-14.

....or round robin can be employed. A dominating set is set of nodes so that each node is either in the set or a neighbor of node from the set. The nodes belonging to dominating sets are called internal nodes or gateway nodes. Several 15 localized connected dominating set definitions are given in [WL]. A node that does not have two unconnected neighbors is not in dominating set. Node A that has a neighbor B such that any path EAF can be replaced by the path EBF, and B has higher ID than A, can also be removed from dominating set. Finally, node A can be removed if it has two neighbors B and C ....

....then it forwards message to the best gateway node neighbor, which routes the message toward D by considering only gateway nodes for forwarding. The message is delivered to if D when message reaches a gateway node neighbor of D for the first time. Such dominating set based routing was considered in [WL] to reduce the size of routing tables in non position based routing algorithms. In order to reduce the length of route discovery path (which appears to be significant) in DFS and position based routing algorithm, SRV] proposed to apply dominating set concept. The application of dominating set ....

[Article contains additional citation context not shown here]

J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc. DIAL M, Seattle, Aug. 1999, 7-14.

....set of the graph formed by the nodes of the ad hoc network. A connected dominating set of a graph G is a connected subgraph of G such that every vertex u in G is either in or adjacent to some v in . Routing using connected dominating sets of a graph can reduce the search space for routes [6, 27]. Das and Bharghavan [6] approximate the minimum connected dominating set of an ad hoc network, and route packets using nodes from that set. The set of coordinators elected by Span, however, has the additional property of being capacity preserving. Consequently, the connected dominating set ....

....dominating set elected by Span is likely to be larger than a minimal connected dominating set. For example, the black nodes in Figure 1 form a minimal connected dominating set. However, Span s election algorithm would additionally elect node 5 to be a coordinator to preserve capacity. Wu and Li [27] propose a distributed algorithm for approximating connected dominating sets in an ad hoc network that also appears to preserve capacity. In a later paper, Wu an Gao [26] discuss power aware routing using the connected dominating sets. Their algorithm is similar to Span s coordinator election ....

WU, J., AND LI, H. On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. In Proceedings of the Third International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Seattle, WA, Aug. 1999).

....is also the case in AHBP [7] A more efficient algorithm is proposed recently by Lou and Wu [6] where not only the 1 hop neighbors but also some of the 2 hop neighbors of the last visited node are excluded from the current set to be covered. In self pruning methods [9] 10] 11] 12] 13] [14], each node makes its local decision on forwarding status: forwarding or non forwarding. Although these algorithms are based on similar ideas, this similarity is not recognized or discussed in depth. Fair comparison of these algorithms is complicated by the lack of in depth understanding of the ....

....of different broadcast algorithms via simulation, and Section 5 concludes the paper. II. BROADCASTING THROUGH SELF PRUNING For broadcasting based on self pruning, each node may determine its own status as a forward node or non forward node (1) before a broadcast packet is received [9] 10] [14], 2) after the first copy of a broadcast packet is received [13] or (3) after several copies of a broadcast packet are received [11] 12] Algorithms in category (1) produce a relatively stable forward node set and can also be used in unicasting and multicasting. However, by neglecting the ....

[Article contains additional citation context not shown here]

J. Wu and H. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks," in Proceedings of the Third International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DiaLM), 1999, pp. 7--14.

....and computation costs should be scalable as the wireless ad hoc networks are typically deployed with large network size. In this paper, we first reinvestigate the performance of the three known distributed approximation algorithms for MCDS, proposed by Das et al. in [1] 7] 10] by Wu and Li in [12] and by Stojmenovic et al. in [11] respectively. After that we propose a new distributed algorithm. We show that our algorithm outperforms significantly the existing algorithms. A remark is that this paper focuses on the generation of a CDS. The maintenance of CDS is not discussed in this paper. ....

....proposed by Das et al. in [1] 7] 10] is between and 3H ( Delta) Both its message complexity and time complexity are O . IV. WU AND LI S ALGORITHM While the algorithm proposed by Das et al. first findsaDS and then grow this DS into a CDS, the algorithm proposed by Wu and Li in [12] takes an opposite approach. The algorithm in [12] first finds a CDS and then prune certain redundant nodes from the CDS. The initial CDS U consists of all nodes which have at least two non adjacent neighbors. A node u in U is considered as locally redundant if it has either a neighbor in U with ....

[Article contains additional citation context not shown here]

J. Wu and H.L. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks", Proceedings of the 3rd ACM international workshop on Discrete algorithms and methods for mobile computing and communications, 1999, Pages 7--14.

....the maximal nodal degree [1] This algorithm has been implemented in distributed manner in wireless networks [2] 4] This distributed implementation suffers from high time and message complexity, and the performance ratio remains . Another distributed algorithm has been developed in [5], with performance ratio of . Both algorithms require two hop neighborhood knowledge and a message length of . On the other hand, wireless ad hoc networks have a unique geometric nature, which can be modeled as a unitdisk graph (UDG) and thus admits heuristics with better ....

....these approximation algorithms suffer from high performance ratio, and high implementation complexities, 1 time and messages. The construction of the MCDS requires hop neighborhood knowledge, which means larger message size, frequent updates, slower convergence speed, and more memory. In [5], a distributed algorithm was proposed for the construction of an approximation MCDS. This algorithm runs in two phases. In the first phase, each node first broadcasts to its neighbors the entire set of IDs of its neighboring nodes, and after receiving this adjacency information from all neighbors ....

[Article contains additional citation context not shown here]

J. Wu and H.L. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks," in Proc. The 3rd ACM Int. Workshop Disc. Algor. and Methods for Mobile Computing and Commun., 1999, pp. 7--14.

....Avg. Delay Localized CR vs. CA, Mobility 5m sec Localized Cert. Renewal Central Authority 1 serv. Central Authority 4 serv. Figure 2. Avg. delay vs. node # There were several proposals of building logical infrastructure for ad hoc networks such as clustering [19] and virtual backbone [28, 32]. To avoid additional overhead and complexity, we do not assume infrastructure support in our design. Communication issues in ad hoc wireless networks are addressed through fully distributed service model and its localized implementation in our architecture. PGP [11, 1] follows a web of trust ....

J. Wu and H. Li. On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. In Third International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 1999.

....and computation costs should be scalable as the wireless ad hoc networks are typically deployed with large network size. In this paper, we first reinvestigate the performance of the three known distributed approximation algorithms for MCDS, proposed by Das et al. in [1] 7] 10] by Wu and Li in [12], and by Stojmenovic et al. in [11] respectively. While the first one has a logarithmic approximation factor, the other two both have linear approximation factors. Thus none of them can guarantee to generate a CDS of small size. The algorithms also have very high implementation cost in terms of ....

....a Omega n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS. In 0 7803 7476 2 02 17.00 (c) 2002 IEEE. Section III, Section IV and Section V, we analyzes the performances of the three existing algorithms by Das et al. in [1] 7] 10] by Wu and Li in [12], and by Stojmenovic et al. in [11] respectively. In Section VI, we present a better distributed algorithm and analyze its performance. Finally, we conclude this paper in Section VII. II. LOWER BOUND ON MESSAGE COMPLEXITY In this section, we establish the Omega n log n) lower bound on the ....

[Article contains additional citation context not shown here]

J. Wu and H.L. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks", Proceedings of the 3rd ACM international workshop on Discrete algorithms and methods for mobile computing and communications, 1999.

....AHBP uses a more efficient algorithm for selecting next hop rebroadcasting nodes than Dominant Pruning. In addition, AHBP appears to benefit from the three ways in which it differs from Multipoint Relaying. Other work on connected dominating set based routing in ad hoc networks include [16] and [18], both of which propose distributed algorithms to efficiently approximate a minimum CDS in a network. However, since AHBP and its mobility extension (AHBP EX) are well defined in [14] we chose it over the CDSBased Broadcast Algorithm. 4. DESCRIPTION OF STUDIES We provide a side by side ....

....performance evaluation of broadcast protocols provides other directions for valuable future research as well. In Section 5.1 we demonstrate that AHBP approximates MCDS within 10 in dense networks. While the CDS Based Broadcast Algorithm and other algorithmic optimizations provided in [16] and [18] may improve the approximation of MCDS, the fact that these protocols all rely on extremely accurate neighbor knowledge information makes them unattractive in dynamic networks; in other words, they share AHBP s deficiency in non static networks. Therefore, further research in algorithmic ....

J. Wu and H. Li. On calculating connected dominating sets for efficient routing in ad hoc wireless networks. In Algorithms and methods for Mobile Computing and Communication (DIAL-M), pages 7--14, 1999.

....structure is effective in enhancing the performance of the routing protocols. Actually prior to this work, inspired by the physical backbone in a wired network, many researchers proposed the concept of virtual backbone for unicast, multicast broadcast in ad hoc wireless networks (see [2] 8] [17]) In this paper, we will study the problem of efficiently constructing virtual backbone for ad hoc wireless networks. The number of hosts forming the virtual backbone must be as small as possible to decrease protocol overhead. The algorithm must be time message efficient due to resource ....

....v is located in u s transmission range, v is not reachable from u due to hidden exposed terminal problems. But in this paper we only consider bidirectional links. From now on, we use host and node interchangeably to represent a wireless mobile. There exist several distributed algorithms ( 1] 8][17]) for MCDS computation in the context of ad hoc wireless networking. The one in [1] first builds a rooted tree distributedly. Then the status (inside or outside of the CDS) is assigned for each host based on the level of the host in the tree. Das and Bharghavan in [8] provide the distributed ....

[Article contains additional citation context not shown here]

J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc. of the 3rd International Workshop on Discrete Algothrithms and Methods for MOBILE Computing and Communications, 1999, Seattle, WA USA, pp.7-14. 12

....core structure is effective in enhancing the performance of the routing protocols. Actually prior to this work, inspired by the physical backbone in a wired network, many researchers proposed the concept of virtual backbone for unicast, multicast broadcast in ad hoc wireless networks (see [7] and [15]) The virtual backbone is mainly used to collect topology information for route detection. It also works as a backup when route is unavailable temporarily. In this paper, we will study the problem of efficiently constructing virtual backbone for ad hoc wireless networks. The number of hosts ....

....v is located in u s transmission range, v is not reachable from u due to hidden exposed terminal problems. But in this paper we only consider bidirectional links. From now on, we use host and node interchangeably to represent a wireless mobile. There exist several distributed algorithms ( 1] 7][15]) for MCDS computation in the context of ad hoc wireless networking. The one in [1] first builds a rooted tree distributedly. Then the status (inside or outside of the CDS) is assigned for each host based on the level of the host in the tree. Das and Bharghavan in [7] provide the distributed ....

[Article contains additional citation context not shown here]

J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc. of the 3rd International Workshop on Discrete Algothrithms and Methods for MOBILE Computing and Communications, 1999, Seattle, WA USA, pp.7-14. 5

No context found.

J. WU AND H. LI, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc. DIAL M, Seattle, Aug. 1999, 7-14.

....scheme works well in practice. A similar idea leads to the Max Min D clustering scheme that was proposed by Amis et al. 2] For the connected dominating set problem, Wu and Li proposed a distributed algorithm that performs badly in the worst case (O(n) approximation) but works well in simulation [26]. 3 Basic algorithm Before presenting the algorithms, we first give some formal definitions. A d cube with size r is a d dimensional axis aligned cube with side length r. When d = 1 or 2, a d cube is also called an interval or a square, respectively. For two points p and q, p is said to be ....

J. Wu and H. Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing & Communications, 1999. 20

....traffic. Flooding is unreliable [8] in moderately sparse graphs the expected number of nodes in the network that will receive a broadcast message was shown to be as low as 80 [15] To overcome or at least alleviate these problems, virtual backbone based routing strategy is introduced [2] 6][16]) Note that virtual backbone mimics the wired backbone. The most important benefit of virtual backbone based routing is the dramatic reduction of protocol overhead, thus greatly improve the network throughput. This is achieved by propagating control packets inside the virtual backbone, not the ....

J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc. of the 3rd International Workshop on Discrete Algothrithms and Methods for MOBILE Computing and Communications, 1999, Seattle, WA USA, pp.7-14. 14

No context found.

Jie Wu and Hailan Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In DIALM '99: Proceedings of the 3rd international workshop on discrete algorithms and methods for mobile computing and communications, pages 7--14. ACM Press, 1999.

No context found.

J. Wu, H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proceedings of the Third International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications 1999; 7--14.

No context found.

J. Wu and H. Li, "On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks," in Proc. of the 3 Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DialM), 1999, pp. 7--14.

No context found.

J. Wu and H. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks," in Proc. of DiaLM, 1999, pp. 7--14.

No context found.

J. Wu and H. Li. On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. In Proc. of Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DialM), pages 7--14, 1999. 16

No context found.

J. Wu and H. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks," in Proc. of the 3rd Int'l Workshop on Discrete Algorithms and Methods for Mobile Computing and Commun., 1999, pp. 7--14

No context found.

J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc. DIAL M, Seattle, Aug. 1999, 7-14.

No context found.

J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, DIAL M, Aug. 1999, 7-14.

No context found.

J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Telecommunications Systems 18(1--3) (September 2001.

No context found.

J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Telecommunication Systems 18 (2001.

First 50 documents

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