{"title":"在manet中使用可调传输范围的一种分布式虚拟主干网","authors":"Jie Wu, Fei Dai","doi":"10.1109/ICDCS.2004.1281602","DOIUrl":null,"url":null,"abstract":"Recently, the use of a virtual backbone (connected dominating set) in various applications in mobile ad hoc networks (MANETs) has become popular. These applications include topology management, point and area coverage, and routing protocol design. In a mobile environment such as a MANET, one challenging issue in constructing a virtual backbone is to accomplish a distributed and localized solution that aims at balancing several contradicting objectives: small approximation ratio, fast convergence, and low computation cost. Many existing distributed and localized algorithms select a virtual backbone without resorting to global or geographical information. However, these algorithms incur a high computation cost in a dense network. In this paper, we propose a distributed solution based on reducing the density of the network using two mechanisms: clustering and adjustable transmission range. By using adjustable transmission range, we also achieve another objective, energy-efficient design, as a by-product. As an application, we show an efficient broadcasting where nodes (and only nodes) in a virtual backbone are used to forward the broadcast message. The virtual backbone is constructed using Wu and Li's marking process [J. Wu et al., (1999)] and the proposed density reduction process. The application of the density reduction process to other localized algorithms is also discussed. The efficiency of our approach is confirmed through both analytic and simulation study.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":"{\"title\":\"A distributed formation of a virtual backbone in MANETs using adjustable transmission ranges\",\"authors\":\"Jie Wu, Fei Dai\",\"doi\":\"10.1109/ICDCS.2004.1281602\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, the use of a virtual backbone (connected dominating set) in various applications in mobile ad hoc networks (MANETs) has become popular. These applications include topology management, point and area coverage, and routing protocol design. In a mobile environment such as a MANET, one challenging issue in constructing a virtual backbone is to accomplish a distributed and localized solution that aims at balancing several contradicting objectives: small approximation ratio, fast convergence, and low computation cost. Many existing distributed and localized algorithms select a virtual backbone without resorting to global or geographical information. However, these algorithms incur a high computation cost in a dense network. In this paper, we propose a distributed solution based on reducing the density of the network using two mechanisms: clustering and adjustable transmission range. By using adjustable transmission range, we also achieve another objective, energy-efficient design, as a by-product. As an application, we show an efficient broadcasting where nodes (and only nodes) in a virtual backbone are used to forward the broadcast message. The virtual backbone is constructed using Wu and Li's marking process [J. Wu et al., (1999)] and the proposed density reduction process. The application of the density reduction process to other localized algorithms is also discussed. The efficiency of our approach is confirmed through both analytic and simulation study.\",\"PeriodicalId\":348300,\"journal\":{\"name\":\"24th International Conference on Distributed Computing Systems, 2004. Proceedings.\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"37\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"24th International Conference on Distributed Computing Systems, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS.2004.1281602\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2004.1281602","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 37
摘要
近年来,虚拟骨干网(连接支配集)在移动自组网(manet)的各种应用中得到了广泛的应用。这些应用包括拓扑管理、点和区域覆盖以及路由协议设计。在移动环境(如MANET)中,构建虚拟骨干网的一个具有挑战性的问题是实现分布式和本地化的解决方案,该解决方案旨在平衡几个相互矛盾的目标:小近似比,快速收敛和低计算成本。许多现有的分布式和本地化算法在选择虚拟骨干网时不依赖全局或地理信息。但是,这些算法在密集的网络中计算成本很高。在本文中,我们提出了一种基于降低网络密度的分布式解决方案,采用两种机制:集群和可调传输范围。通过使用可调节的传动范围,我们还实现了另一个目标,节能设计,作为副产品。作为一个应用程序,我们展示了一种高效的广播,其中虚拟骨干中的节点(且仅节点)用于转发广播消息。虚拟骨干网是利用Wu和Li的标记过程构建的[J]。Wu et al.,(1999)]和提出的密度降低过程。本文还讨论了密度降低过程在其他局部算法中的应用。通过分析和仿真验证了该方法的有效性。
A distributed formation of a virtual backbone in MANETs using adjustable transmission ranges
Recently, the use of a virtual backbone (connected dominating set) in various applications in mobile ad hoc networks (MANETs) has become popular. These applications include topology management, point and area coverage, and routing protocol design. In a mobile environment such as a MANET, one challenging issue in constructing a virtual backbone is to accomplish a distributed and localized solution that aims at balancing several contradicting objectives: small approximation ratio, fast convergence, and low computation cost. Many existing distributed and localized algorithms select a virtual backbone without resorting to global or geographical information. However, these algorithms incur a high computation cost in a dense network. In this paper, we propose a distributed solution based on reducing the density of the network using two mechanisms: clustering and adjustable transmission range. By using adjustable transmission range, we also achieve another objective, energy-efficient design, as a by-product. As an application, we show an efficient broadcasting where nodes (and only nodes) in a virtual backbone are used to forward the broadcast message. The virtual backbone is constructed using Wu and Li's marking process [J. Wu et al., (1999)] and the proposed density reduction process. The application of the density reduction process to other localized algorithms is also discussed. The efficiency of our approach is confirmed through both analytic and simulation study.