Distance-Based Routing Strategy for Traffic Transport in Spatial Networks
It is well known that routing strategies based on global topological information is not a good choice for the enhancement of traffic throughput in large-scale networks due to the heavy communication cost. On the contrary, acquiring spatial information, such as spatial distances among nodes, is more...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Advances in Mathematical Physics |
| Online Access: | http://dx.doi.org/10.1155/2013/879651 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832562862774550528 |
|---|---|
| author | Wei Huang Xiang Pan Xi Yang Jianhua Zhang |
| author_facet | Wei Huang Xiang Pan Xi Yang Jianhua Zhang |
| author_sort | Wei Huang |
| collection | DOAJ |
| description | It is well known that routing strategies based on global topological information is not a good choice for the enhancement of traffic throughput in large-scale networks due to the heavy communication cost. On the contrary, acquiring spatial information, such as spatial distances among nodes, is more feasible. In this paper, we propose a novel distance-based routing strategy in spatial scale-free networks, called LDistance strategy. The probability of establishing links among nodes obeys the power-law in the spatial network under study. Compared with the LDegree strategy (Wang et al., 2006) and the mixed strategy (a strategy combining both greedy routing strategy and random routing strategy), results show that our proposed LDistance strategy can further enhance traffic capacity. Besides, the LDistance strategy can also achieve a much shorter delivering time than the LDegree strategy. Analyses reveal that the superiority of our strategy is mainly due to the interdependent relationship between topological and spatial characteristics in spatial scale-free networks. Furthermore, along transporting path in the LDistance strategy, the spatial distance to destination decays more rapidly, and the degrees of routers are higher than those in the LDegree strategy. |
| format | Article |
| id | doaj-art-2d8db33e9cf14aada56700d35745dd3a |
| institution | Kabale University |
| issn | 1687-9120 1687-9139 |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Advances in Mathematical Physics |
| spelling | doaj-art-2d8db33e9cf14aada56700d35745dd3a2025-02-03T01:21:34ZengWileyAdvances in Mathematical Physics1687-91201687-91392013-01-01201310.1155/2013/879651879651Distance-Based Routing Strategy for Traffic Transport in Spatial NetworksWei Huang0Xiang Pan1Xi Yang2Jianhua Zhang3College of Computer Science, Zhejiang University of Technology, Hangzhou 310023, ChinaCollege of Computer Science, Zhejiang University of Technology, Hangzhou 310023, ChinaCollege of Computer Science, Zhejiang University of Technology, Hangzhou 310023, ChinaCollege of Computer Science, Zhejiang University of Technology, Hangzhou 310023, ChinaIt is well known that routing strategies based on global topological information is not a good choice for the enhancement of traffic throughput in large-scale networks due to the heavy communication cost. On the contrary, acquiring spatial information, such as spatial distances among nodes, is more feasible. In this paper, we propose a novel distance-based routing strategy in spatial scale-free networks, called LDistance strategy. The probability of establishing links among nodes obeys the power-law in the spatial network under study. Compared with the LDegree strategy (Wang et al., 2006) and the mixed strategy (a strategy combining both greedy routing strategy and random routing strategy), results show that our proposed LDistance strategy can further enhance traffic capacity. Besides, the LDistance strategy can also achieve a much shorter delivering time than the LDegree strategy. Analyses reveal that the superiority of our strategy is mainly due to the interdependent relationship between topological and spatial characteristics in spatial scale-free networks. Furthermore, along transporting path in the LDistance strategy, the spatial distance to destination decays more rapidly, and the degrees of routers are higher than those in the LDegree strategy.http://dx.doi.org/10.1155/2013/879651 |
| spellingShingle | Wei Huang Xiang Pan Xi Yang Jianhua Zhang Distance-Based Routing Strategy for Traffic Transport in Spatial Networks Advances in Mathematical Physics |
| title | Distance-Based Routing Strategy for Traffic Transport in Spatial Networks |
| title_full | Distance-Based Routing Strategy for Traffic Transport in Spatial Networks |
| title_fullStr | Distance-Based Routing Strategy for Traffic Transport in Spatial Networks |
| title_full_unstemmed | Distance-Based Routing Strategy for Traffic Transport in Spatial Networks |
| title_short | Distance-Based Routing Strategy for Traffic Transport in Spatial Networks |
| title_sort | distance based routing strategy for traffic transport in spatial networks |
| url | http://dx.doi.org/10.1155/2013/879651 |
| work_keys_str_mv | AT weihuang distancebasedroutingstrategyfortraffictransportinspatialnetworks AT xiangpan distancebasedroutingstrategyfortraffictransportinspatialnetworks AT xiyang distancebasedroutingstrategyfortraffictransportinspatialnetworks AT jianhuazhang distancebasedroutingstrategyfortraffictransportinspatialnetworks |