scholarly journals Benefiting from the community structure in opportunistic forwarding

2013 ◽  
Vol 10 (2) ◽  
pp. 865-876
Author(s):  
Bing Bai ◽  
Zhenqian Feng ◽  
Baokang Zhao ◽  
Jinshu Su
Keyword(s):  
Community Structure ◽  
Complex Network ◽  
Single Copy ◽  
Routing Algorithms ◽  
Node Mobility ◽  
Challenging Problem ◽  
Community Based ◽  
Single Node ◽  
Inherent Structure ◽  
Delay Tolerant

In Delay Tolerant Networks (DTNs), an end-to-end connectivity cannot be assumed for node mobility and lack of infrastructure. Due to the uncertainty in nodal mobility, routing in DTNs becomes a challenging problem. To cope with this, many researchers proposed opportunistic routing algorithms based on some utilities. However, these simple metrics may only capture one facet of the single node?s mobility process, which cannot reflect the inherent structure of the networks well. Recently, some researchers introduce the Complex network analysis (CNA) to formulate and predict the future contact in DTNs. The community structure is one of the most important properties of CNA. And it reveals the inherent structure of the complex network. In this paper, we present a community-based single-copy forwarding protocol for DTNs routing, which efficiently utilizes the community structure to improve the forwarding efficiency. Simulation results are presented to support the effectiveness of our scheme.

scholarly journals LIMITED RESOLUTION AND MULTIRESOLUTION METHODS IN COMPLEX NETWORK COMMUNITY DETECTION

2007 ◽  
Vol 07 (03) ◽  
pp. L209-L214 ◽  
Author(s):  
JUSSI M. KUMPULA ◽  
JARI SARAMÄKI ◽  
KIMMO KASKI ◽  
JÁNOS KERTÉSZ
Keyword(s):  
Simulated Annealing ◽  
Community Structure ◽  
Complex Network ◽  
Community Detection ◽  
Real World ◽  
Tuning Parameter ◽  
Challenging Problem ◽  
Resolution Limit ◽  
Network Community ◽  
Multiresolution Methods

Detecting community structure in real-world networks is a challenging problem. Recently, it has been shown that the resolution of methods based on optimizing a modularity measure or a corresponding energy is limited; communities with sizes below some threshold remain unresolved. One possibility to go around this problem is to vary the threshold by using a tuning parameter, and investigate the community structure at variable resolutions. Here, we analyze the resolution limit and multiresolution behavior for two different methods: a q-state Potts method proposed by Reichard and Bornholdt, and a recent multiresolution method by Arenas, Fernández, and Gómez. These methods are studied analytically, and applied to three test networks using simulated annealing.

scholarly journals A Method of Node Layout of a Complex Network Based on Community Compression

2019 ◽  
Vol 11 (12) ◽  
pp. 250 ◽  
Author(s):  
Chengxiang Liu ◽  
Wei Xiong ◽  
Xitao Zhang ◽  
Zheng Liu
Keyword(s):  
Community Structure ◽  
Complex Network ◽  
Network Node ◽  
Single Node ◽  
Structure Characteristics ◽  
Mesoscale Structure ◽  
The Status ◽  
Importance Analysis ◽  
And Function ◽  
Important Nodes

As the theory of complex networks is further studied, the scale of nodes in the network is increasing, which makes it difficult to find useful patterns from only the analysis of nodes. Therefore, this paper proposes a complex network node layout method based on community compression, which can effectively display the mesoscale structure characteristics of the network, making it more convenient for users to analyze the status and function of a single node or a class of nodes in the whole complex network. To begin with, the whole network is divided into communities with different granularity by the Louvain algorithm. Secondly, the method of nodes importance analysis based on topological potential theory is extended from the network to the community structure, and the internal nodes of the community are classified into three types, namely important nodes, relatively important nodes, and fringe nodes. Furthermore, a compression algorithm for the community structure is designed to realize the compression of the network by retaining important nodes and merging fringe nodes. Finally, the compression network is laid out by the traditional force-directed layout method. Experimental results show that, compared with the compression layout methods of a complex network based on degree or PageRank, the method in this paper can retain the integrated community composition and its internal structure, which is convenient for users to effectively analyze the topology structure of a complex network.

Study on Construction of Close-to-Nature Man-Made Plant Landscape Based on Natural Plant Communities: the Case of West Lake Scenic Area in Hangzhou

2012 ◽  
Vol 468-471 ◽  
pp. 2764-2770
Author(s):  
Shan Lu ◽  
Bo Chen ◽  
Shao Qing Hu ◽  
Jing Jing Zhang ◽  
Jun Hao Jiang ◽  
...  
Keyword(s):  
Community Structure ◽  
Plant Community ◽  
Plant Communities ◽  
Vegetation Composition ◽  
Natural Community ◽  
Community Based ◽  
Natural Plant ◽  
West Lake ◽  
Construction Methods ◽  
Landscape Plant

Urban close-to-nature plant community is a sustainable design and construction philosophy of landscape greenbelt planning. However, there is no explicit guide for constructing close-to-nature plant community Based on the analysis of community structure and characteristics of 10 typical natural plant communities in the West Lake Scenic Area in Hangzhou and summary of the features of natural community, as well as the analysis of plant landscape of Hangzhou Huagangguanyu Park to prove that the close-to-nature man-made plant community and natural plant community are interrelated in respect of vegetation composition and community structure, this paper puts forward to the essential construction methods of the close-to-nature landscape community, providing theoretical basis for research and construction of urban close-to-nature landscape plant community in China.

scholarly journals Community Structure of Dragonfly (Ordo: Odonata) in Natural Forest and Tourist Sites Petungkriyono Forest, Central Java, Indonesia

2021 ◽  
Vol 6 (3) ◽  
pp. 67328
Author(s):  
Nur Apriatun Nafisah ◽  
R.C.Hidayat Soesilohadi
Keyword(s):  
Community Structure ◽  
Tropical Rainforest ◽  
Diversity Index ◽  
Natural Forest ◽  
Natural Forests ◽  
Community Based ◽  
Central Java ◽  
Wiener Diversity Index ◽  
Index Value ◽  
Total Species

Petungkriyono forest is a tropical rainforest with high biodiversity. The increasing tourism activities in Petungkriyono lead to land conversion. Dragonfly (order Odonata) is a good bioindicator for aquatic and terrestrial. This study aimed to compare the community structure of Odonata in natural forests and tourist sites. The method of collecting imago Odonata was done by direct searching, samples were captured using sweep netting. The results showed that the dragonflies found in all locations consisted of the same family, 2 families (Gomphidae and Libellulidae) from the suborder Anisoptera and 6 families (Calopterygidae, Chlorocyphidae, Coenagrionidae, Euphaidae Platycnemididae, and Platystictidae) from the suborder Zygoptera. The total species of dragonflies found in Sokokembang were 15 species with a total of 293 individuals, Tirta Muncar 13 species of 287 individuals, Karanggondang 17 species of 276 individuals, and Curug Lawe 14 species of 242 individuals. The highest relative abundance of individuals was in the natural forest of Sokokembang is Drepanosticta spatulifera (26.28%) and in Karanggondang Vestalis luctuosa (24.64%), while in the tourist forests of Tirta Muncar and Curug Lawe were Euphaea variegata (34.84% and 28.51 %). The structure of the Odonata community is based on the Shannon-Wiener diversity index in the natural forests of Sokokembang (2.18) and Karanggondang (2.21) at the tourist sites of Tirta Muncar (1.84) and Curug Lawe (2.11). The results showed that the structure of the Odonata community based on the level of the diversity index value, evenness index, and dominance index in natural forests and tourist sites in Petungkriyono forest was not significantly different. 

scholarly journals DRANS: Daily Routine Analysis for Node Searching in delay tolerant networks

2017 ◽  
Vol 13 (7) ◽  
pp. 155014771771810 ◽  
Author(s):  
Xingyu He ◽  
Guisong Yang ◽  
Hao Zhang
Keyword(s):  
Success Rate ◽  
Delay Tolerant Networks ◽  
Transmission Delay ◽  
Routine Analysis ◽  
Destination Node ◽  
Daily Routine ◽  
Node Mobility ◽  
Mobility Patterns ◽  
Probability Table ◽  
Delay Tolerant

In delay tolerant networks, the success rate and the transmission speed are restricted by limited social interaction and complex node mobility pattern analysis. To increase the success rate and reduce the transmission delay in delay tolerant networks, we propose Daily Routine Analysis for Node Searching in delay tolerant networks. In Daily Routine Analysis for Node Searching, each node is required to generate a Staying Probability Table and a Transiting Probability Table by analyzing its own daily routine, then to distribute its Staying Probability Table and Transiting Probability Table to the whole network with the help of other nodes having different mobility patterns. On the basis of the Staying Probability Table and Transiting Probability Table, Daily Routine Analysis for Node Searching further provides a node tracking strategy and an opportunistic routing strategy for delivering data from the source node to the destination node. Trace-driven experiments are performed to compare Daily Routine Analysis for Node Searching with previous node searching methods. The experimental results demonstrate that Daily Routine Analysis for Node Searching is able to promote the success rate and reduce the transmission delay effectively.

Sign in / Sign up

Export Citation Format

Share Document