1-6hit |
Ryo YAMAMOTO Satoshi OHZAHATA Toshihiko KATO
The self-organizing nature of ad hoc networks is a good aspect in that terminals are not dependent on any infrastructure, that is, networks can be formed with decentralized and autonomous manner according to communication demand. However, this characteristic might affect the performance in terms of stability, reliability and so forth. Moreover, ad hoc networks face a scalability problem, which arise when the number of terminals in a network increases or a physical network domain expands, due to the network capacity limitation caused by the decentralized and the autonomous manner. Regarding this problem, some hierarchical and cluster-based routings have been proposed to effectively manage the networks. In this paper, we apply the concept of hierarchical routing and clustering to opportunistic routing, which can forward packets without using any pre-established path to achieve a path diversity gain with greater reachability. The simulation results show that the proposed method can achieve 11% higher reliability with a reasonable end-to-end delay in dense environments and 30% higher in large-scale networks.
Daisuke MAEDA Hideyuki UEHARA Mitsuo YOKOYAMA
We propose a novel clustering scheme considering non-uniform correlation distribution derived by experimental environment property. Firstly, we investigate the entropy property of actual environment, and then show that its spatial correlation is not uniformly distributed. Based on this result, we present the clustering strategy which provides the efficient data aggregation. Through the simulation under the non-uniform correlation distribution, we show the advantage of the proposed scheme in terms of the energy consumption property per node and the network lifetime.
Yukinobu FUKUSHIMA Hiroaki HARAI Shin'ichi ARAKAWA Masayuki MURATA
The scalability of routing protocol has been considered as a key issue in large-scaled wavelength routed networks. Hierarchical routing scales well by yielding enormous reductions in routing table length, but it also increases path length. This increased path length in wavelength-routed networks leads to increased blocking probability because longer paths tend to have less free wavelength channels. However, if the routes assigned to longer paths have greater wavelength resources, we can expect that the blocking probability will not increase. In this paper, we propose a distributed node-clustering method that maximizes the number of lightpaths between nodes. The key idea behind our method is to construct node-clusters that have much greater wavelength resources from the ingress border nodes to the egress border nodes, which increases the wavelength resources on the routes of lightpaths between nodes. We evaluate the blocking probability for lightpath requests and the maximum table length in simulation experiments. We find that the method we propose significantly reduces the table length, while the blocking probability is almost the same as that without clustering.
Tomoyuki OHTA Munehiko FUJIMOTO Ryotaro ODA Yoshiaki KAKUDA
Along with expansion of utilization of mobile ad hoc networks, it is expected that the network size becomes large. However, design of current typical routing protocols supposes at most several hop routes between source and destination nodes. When messages are delivered along long hop routes in the networks, such routing protocols tend to degrade performance. Previously, we have proposed an autonomous clustering scheme for constructing and maintaining hierarchical structure in mobile ad hoc networks, which are adaptive to node movement. This paper proposes a class of hierarchical routing protocols Hi-TORA, Hi-DSR and Hi-AODV, all of which are based on the autonomous clustering scheme, compares them with their corresponding flat routing protocols TORA, DSR and AODV, respectively, and shows effectiveness of these hierarchical routing protocols by simulation experiments.
Tomoyuki OHTA Munehiko FUJIMOTO Shinji INOUE Yoshiaki KAKUDA
Recently, in wired networks, a hierarchical structure has been introduced to improve management and routing. In ad hoc networks, we introduce a hierarchical structure to achieve the same goal. However, it is difficult to introduce the hierarchical structure because all mobile hosts are always moving around the network. So, we proposed the clustering scheme to construct the hierarchical structure before. In this paper, we propose a new hierarchical routing protocol called Hi-TORA based on the clustering scheme. And we show the experimental evaluation of Hi-TORA with respect to the number of control packets, accuracy of packet delivery and hop counts in comparison with TORA.
Space-time tradeoff is a very fundamental issue to design a fault-tolerant real-time (called responsive) system. Routing a message in large computer networks is efficient when each node knows the full topology of the whole network. However, in the hierarchical routing schemes, no node knows the full topology. In this paper, a tradeoff between an optimality of path length (message delay: time) and the amount of topology information (routing table size: space) in each node is presented. The schemes to be analyzed include K-scheme (by Kamoun and Kleinrock), G-scheme (by Garcia and Shacham), and I-scheme (by authors). The analysis is performed by simulation experiments. The results show that, with respect to average path length, I-scheme is superior to both K-scheme and G-scheme, and that K-scheme is better than G-scheme. Additionally, an average path length in I-scheme is about 20% longer than the optimal path length. On the other hand, for the routing table size, three schemes are ranked in reverse direction. However, with respect to the order of size of routing table, the schemes have the same complexity O (log n) where n is the number of nodes in a network.