J. Networks最新文献_第7页

Pairwise Co-betweenness for Several Types of Network 几种类型网络的两两共间性

J. Networks Pub Date : 2015-03-03 DOI: 10.4304/jnw.10.2.91-98

Liang Li, Gaoxia Wang, Man Yu

{"title":"Pairwise Co-betweenness for Several Types of Network","authors":"Liang Li, Gaoxia Wang, Man Yu","doi":"10.4304/jnw.10.2.91-98","DOIUrl":"https://doi.org/10.4304/jnw.10.2.91-98","url":null,"abstract":"Vertex betweenness centrality is essential in the analysis of social and information networks, and it quantify vertex importance in terms of its quantity of information along geodesic paths in network. Edge betweenness is similar to the vertex betweenness. Co-betweenness centrality is a natural developed notion to extend vertex betweenness centrality to sets of vertices, and pairwise co-betweenness is a special case of co-betweenness. In this paper, we analysis the pairwise co-betweenness of WS network model with the different reconnection probability which including rule, smallworld and random network. The pairwise co-betweenness value is represented by several different ways, and it shows some regularity with changing reconnection probability of each edge in WS network model. Meanwhile, for communitystructure network, we obtain vertex-induced subgraph with the highest betweenness vertices, and the edge-induced subgraph with the highest pairwise co-betweenness edges. We demonstrate that the edge of cross-groups is consistent with the edges with top incidental pairwise co-betweenness. Finally, further illustration to the interaction of pairwise co-betweenness and network structure is provided by a practical social network.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"1 1","pages":"91-98"},"PeriodicalIF":0.0,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75781418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Clustering and Profiling IP Hosts Based on Traffic Behavior 基于流量行为的IP主机集群和分析

J. Networks Pub Date : 2015-03-03 DOI: 10.4304/jnw.10.2.99-107

Ahmad Jakalan, G. Jian, Weiwei Zhang, Su Qi

{"title":"Clustering and Profiling IP Hosts Based on Traffic Behavior","authors":"Ahmad Jakalan, G. Jian, Weiwei Zhang, Su Qi","doi":"10.4304/jnw.10.2.99-107","DOIUrl":"https://doi.org/10.4304/jnw.10.2.99-107","url":null,"abstract":"The objective of this research is to study the behavior of IP Network nodes (IP hosts) from the prospective of their communication behavior patterns to setup hosts’ behavior profiles of the observed IP nodes by clustering hosts into clusters of similar communication behaviors. The problem of IP address behavior analysis and profile establishment is the one that not fully discussed and the results achieved are not good enough, there is no complete solution yet. There are many potential applications of this work, the results of this research will be useful to the network management and Network security situation awareness in addition to the applications in studying the network user behavior. The contribution of this paper includes: 1) discussion about the features or host behavior communication patterns to be utilized in hosts clustering to characterize accurately and efficiently groups of host behavior traffic. 2) We presented an algorithm to extract most significant IP nodes to be analyzed instead of analyzing the complete list of millions of IP nodes that exist in the trace. 3) We analyzed IP nodes traffic behavior on relatively long periods of traces, which help to extract a more stable host’s behavior. While previous studies focus only on host behavior for relatively short periods of 5 to 15 minutes, we extract host’s behavior patterns over a period of one hour which needs big data analysis to provide results in a reasonable time.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"44 1","pages":"99-107"},"PeriodicalIF":0.0,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86816131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

A Design Algorithm for QoS Network with Flow Delay Control 具有流延迟控制的QoS网络设计算法

J. Networks Pub Date : 2015-03-03 DOI: 10.4304/jnw.10.2.85-90

K. Jaroenrat

引用次数: 1

An Approach to Resisting Malformed and Flooding Attacks on SIP Servers 一种抵抗SIP服务器畸形和泛洪攻击的方法

J. Networks Pub Date : 2015-03-03 DOI: 10.4304/jnw.10.2.77-84

Ming-Yang Su, Chen-Han Tsai

引用次数: 7

A Stable Path Routing Protocol for Cognitive Radio Ad hoc Networks based on the Maximum Number of Common Primary User Channels 基于最大公共主用户信道数的认知无线电自组织网络稳定路径路由协议

J. Networks Pub Date : 2015-03-03 DOI: 10.4304/jnw.10.2.117-124

N. Meghanathan

{"title":"A Stable Path Routing Protocol for Cognitive Radio Ad hoc Networks based on the Maximum Number of Common Primary User Channels","authors":"N. Meghanathan","doi":"10.4304/jnw.10.2.117-124","DOIUrl":"https://doi.org/10.4304/jnw.10.2.117-124","url":null,"abstract":"We propose a novel local spectrum knowledge-based distributed stable path routing protocol for cognitive radio ad hoc networks (CRAHNs) where the unlicensed secondary users (SUs) make use of the licensed channels of the Primary Users (PUs) when the latter are not actively using the channels. We model a time-variant CRAHN of SUs with links between any two SUs if they have at least one common PU channel available for use in their neighborhood and the weight of an edge is the number of such common PU channels available for use. Referred to as the Maximum Common Primary User channel-based Routing (MCPUR) protocol, the proposed protocol prefers to choose an SU-SU source-destination ( s-d ) path with the largest value for the sum of the number of common PU channels available for use across each of its constituent edges. Our hypothesis is that such an s-d route is likely to exist for a longer time (and incur fewer broadcast route discoveries) as the end nodes of the constituent SU-SU edges are more likely to have at least one common available PU channel that can be used to complete the transmission and reception of data packets. Simulation results confirm our hypothesis to be true: the number of path transitions incurred with MCPUR could be at most 62% lower than that of the path transitions incurred with a minimum hop-based shortest path routing (SPR) protocol. The tradeoff is a low-moderate increase in the hop count per path (as large as 17%)","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"1 1","pages":"117-124"},"PeriodicalIF":0.0,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86405138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Intelligent Management of Multiple Access Schemes in Wireless Body Area Network 无线体域网络中多接入方案的智能管理

J. Networks Pub Date : 2015-03-03 DOI: 10.4304/JNW.10.2.108-116

Jing Zhou, Aihuang Guo, H. Nguyen, S. Su

引用次数: 8

Epidemic Strategies in Delay Tolerant Networks from an Energetic Point of View: Main Issues and Performance Evaluation 从能量的角度看容延迟网络的流行策略:主要问题和性能评价

J. Networks Pub Date : 2015-02-28 DOI: 10.4304/jnw.10.01.4-14

F. Rango, Salvatore Amelio, P. Fazio

引用次数: 20

Capacity Analysis in the Next Generation Wireless Networks Based on SINR Constraints 基于SINR约束的下一代无线网络容量分析

J. Networks Pub Date : 2015-02-28 DOI: 10.4304/jnw.10.01.29-38

Wahida Mansouri, K. Mnif, F. Zarai, M. Obaidat, L. Kamoun

{"title":"Capacity Analysis in the Next Generation Wireless Networks Based on SINR Constraints","authors":"Wahida Mansouri, K. Mnif, F. Zarai, M. Obaidat, L. Kamoun","doi":"10.4304/jnw.10.01.29-38","DOIUrl":"https://doi.org/10.4304/jnw.10.01.29-38","url":null,"abstract":"The demand for accessing services while on the move, at any place and anytime, has led to the current efforts towards integration ofheterogeneous wireless networks. In particular, interoperability of cellular networks and Wireless Local Area Network (WLAN), as complementarysystems in providing capacity and coverage, has drawn a lot of attention. Next Generation Wireless Networks (NGWNs) are expected to be heterogeneous networks which integrate different Radio Access Technologies (RATs) such as 3GPP’s Long Term Evolution (LTE) andWLANwhere a transmission is supported if the signal-to-interference-plus-noise ratio (SINR) at the receiver is greater than some threshold. It is based on the fact that several competing technologies, which have different requirements and capabilities, can co-exist. This approach tries to select always the best network according to a set of requirements and perform the inter-system handover between them, when those requirements are not fulfilled. In this article, we analyze the interference in heterogeneous wireless networks and determinethe capacity, in a study based on Markov chains, by taking into considerationthe class of traffic of each call and considering both intra-network interference and inter-network interference. Our analysis approach is based on modeling of the system as a multi-dimensional Markov chain which represents the current number of ongoing calls of different classes of services in the system. This analysis allows us to simplify the estimation of capacity under SINR interference constraints in different wireless networks. Based on this analysis, we derive performance evaluation results regarding blocking of real-time and non-real-time calls in each RAT and under different network sizes","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"5092 4 1","pages":"29-38"},"PeriodicalIF":0.0,"publicationDate":"2015-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75093990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

A Multi-objective Routing Algorithm for Wireless Mesh Network in a Smart Cities Environment 智慧城市环境下无线Mesh网络的多目标路由算法

J. Networks Pub Date : 2015-02-28 DOI: 10.4304/jnw.10.01.60-69

C. Lozano-Garzon, M. Camelo, P. Vilà, Y. Donoso

引用次数: 14

Large Scale Cloudlets Deployment for Efficient Mobile Cloud Computing 大规模部署Cloudlets实现高效移动云计算

J. Networks Pub Date : 2015-02-28 DOI: 10.4304/jnw.10.01.70-76

L. Tawalbeh, Y. Jararweh, Fadi Ababneh, Fahd Dosari

引用次数: 64