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.
{"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}
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.
{"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}
A Mesh Network Topological Optimization and Routing II (MENTOR-II) algorithm is a low complexity and efficient network design algorithm for IP networks with OSPF routing protocol in which appropriate link weights are assigned to the installed links such that the traffic always routes on the path with minimum distance. However, it should be noted that the flow delay of traffic assigned by MENTOR-II are not controlled because MENTOR-II gives the link weights for only assigning traffic flow into the worthy path, therefore routing of traffic flow does not get together with the traffic engineering. This study proposed a new modified version of MENTOR called Q-MENTOR which is able to assign traffic under flow delay controlled. The Q-MENTOR are evaluated in terms of installation cost, routing cost and reliability for 486 network design conditions. The design results are compared with MENTOR-II and it was found that Q-MENTOR is suitable for designing high maximum utilization networks with good delay and reliability. The results also show that low traffic flow delay requirements often present the worst installation cost, routing cost and reliability.
MENTOR-II (Mesh Network Topological Optimization and Routing II)算法是针对带有OSPF路由协议的IP网络的一种低复杂度、高效率的网络设计算法，该算法为已安装的链路分配适当的链路权重，使流量始终沿着距离最小的路径路由。但是需要注意的是，由于MENTOR-II给出的链路权重只是将交通流分配到有价值的路径上，所以不能控制由MENTOR-II分配的交通流的流延迟，因此交通流的路由不能与交通工程结合在一起。本研究提出了一种新的改进版的指路导师q -指路导师，能够在控制流延迟的情况下进行交通分配。在486种网络设计条件下，对Q-MENTOR进行了安装成本、路由成本和可靠性评估。将设计结果与MENTOR-II进行了比较，发现Q-MENTOR适合设计具有良好延迟和可靠性的高最大利用率网络。结果还表明，低交通流延迟要求往往会带来最差的安装成本、路由成本和可靠性。
{"title":"A Design Algorithm for QoS Network with Flow Delay Control","authors":"K. Jaroenrat","doi":"10.4304/jnw.10.2.85-90","DOIUrl":"https://doi.org/10.4304/jnw.10.2.85-90","url":null,"abstract":"A Mesh Network Topological Optimization and Routing II (MENTOR-II) algorithm is a low complexity and efficient network design algorithm for IP networks with OSPF routing protocol in which appropriate link weights are assigned to the installed links such that the traffic always routes on the path with minimum distance. However, it should be noted that the flow delay of traffic assigned by MENTOR-II are not controlled because MENTOR-II gives the link weights for only assigning traffic flow into the worthy path, therefore routing of traffic flow does not get together with the traffic engineering. This study proposed a new modified version of MENTOR called Q-MENTOR which is able to assign traffic under flow delay controlled. The Q-MENTOR are evaluated in terms of installation cost, routing cost and reliability for 486 network design conditions. The design results are compared with MENTOR-II and it was found that Q-MENTOR is suitable for designing high maximum utilization networks with good delay and reliability. The results also show that low traffic flow delay requirements often present the worst installation cost, routing cost and reliability.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"77 1","pages":"85-90"},"PeriodicalIF":0.0,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90531205","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}
As a result of its low costs and high degree of integration with other services, Voice over Internet Protocol (VoIP) has become very widely used, while Session Initiation Protocol (SIP) is one of the most important protocols for providing the VoIP service. Since SIP is an open source code with a simple structure and high expansibility, SIP servers are more vulnerable to attack by SIP messages malformed in order to stunt the server, or by a flood of SIP messages causing server congestion or shutdown. The system proposed in this paper therefore has two functions; one is to filter malformed messages that conflict with the SIP protocol, and the other is to determine whether an SIP server is under flooding attack. This study used the Chi- square test, usually applied in statistics, to identify flooding attacks. The proposed system can automatically modify an SIP server's blacklist to deter an attacker's subsequent attempts.
VoIP (Voice over Internet Protocol)由于其低成本和与其他业务的高度集成而得到了广泛的应用，而SIP (Session Initiation Protocol)是提供VoIP业务的最重要的协议之一。由于SIP是开源代码，结构简单，可扩展性高，因此SIP服务器更容易受到恶意破坏服务器的SIP消息的攻击，或者受到大量SIP消息导致服务器拥塞或关闭的攻击。因此，本文提出的系统具有两个功能;一是过滤与SIP协议冲突的畸形消息，二是判断SIP服务器是否受到泛洪攻击。本研究使用统计学中常用的卡方检验来识别洪水攻击。该系统可以自动修改SIP服务器的黑名单，以阻止攻击者的后续攻击。
{"title":"An Approach to Resisting Malformed and Flooding Attacks on SIP Servers","authors":"Ming-Yang Su, Chen-Han Tsai","doi":"10.4304/jnw.10.2.77-84","DOIUrl":"https://doi.org/10.4304/jnw.10.2.77-84","url":null,"abstract":"As a result of its low costs and high degree of integration with other services, Voice over Internet Protocol (VoIP) has become very widely used, while Session Initiation Protocol (SIP) is one of the most important protocols for providing the VoIP service. Since SIP is an open source code with a simple structure and high expansibility, SIP servers are more vulnerable to attack by SIP messages malformed in order to stunt the server, or by a flood of SIP messages causing server congestion or shutdown. The system proposed in this paper therefore has two functions; one is to filter malformed messages that conflict with the SIP protocol, and the other is to determine whether an SIP server is under flooding attack. This study used the Chi- square test, usually applied in statistics, to identify flooding attacks. The proposed system can automatically modify an SIP server's blacklist to deter an attacker's subsequent attempts.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"94 1","pages":"77-84"},"PeriodicalIF":0.0,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79037961","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}
Pub Date : 2015-03-03DOI: 10.4304/jnw.10.2.117-124
N. Meghanathan
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%)
{"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}
Pub Date : 2015-03-03DOI: 10.4304/JNW.10.2.108-116
Jing Zhou, Aihuang Guo, H. Nguyen, S. Su
Wireless Body Area Network is a novel technology to provide efficient, convenient and safe health, medical and personal entertainment services but it still faces longstanding challenges in the application. A smart communication standard is essential to solve some problems in wireless data transmission and optimize system performance. This paper proposes an intelligent management of multiple access schemes for contention access and contention free access with game theory. The strategies are determined by requirements of applications and channel status. Nodes in a network choose various strategies for best payoff according to different conditions including normal status, packets-oriented services, emergent situation and bad link states with specific utility functions. The novel management model supports flexible resource allocation and enhances the system performance, which are evaluated by simulations of Castalia under various conditions.
{"title":"Intelligent Management of Multiple Access Schemes in Wireless Body Area Network","authors":"Jing Zhou, Aihuang Guo, H. Nguyen, S. Su","doi":"10.4304/JNW.10.2.108-116","DOIUrl":"https://doi.org/10.4304/JNW.10.2.108-116","url":null,"abstract":"Wireless Body Area Network is a novel technology to provide efficient, convenient and safe health, medical and personal entertainment services but it still faces longstanding challenges in the application. A smart communication standard is essential to solve some problems in wireless data transmission and optimize system performance. This paper proposes an intelligent management of multiple access schemes for contention access and contention free access with game theory. The strategies are determined by requirements of applications and channel status. Nodes in a network choose various strategies for best payoff according to different conditions including normal status, packets-oriented services, emergent situation and bad link states with specific utility functions. The novel management model supports flexible resource allocation and enhances the system performance, which are evaluated by simulations of Castalia under various conditions.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"15 21","pages":"108-116"},"PeriodicalIF":0.0,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91521541","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}
In this work we investigate Epidemic novel strategies called SNPS and EAER-SNPS applied to a DTN Network. These strategies extend the approach of the basic epidemic routing by using the node density estimation and the nodes energy levels; they adopt the forwarding scheme of the n-Epidemic routing. However, differently from n-Epidemic, it applies a dynamic forwarding scheme based on nodes density, that is able to reduce energy consumption and increase message delivery probability. A deep campaign of simulations was carried out in order to verify the effectiveness of the SNPS and EAER-SNPS. Simulation campaigns were conducted to evaluate the message delivery ratio, the average hop count, the average end-to-end delay and the average residual energy. Different mobility scenarios have been considered through the Working Day mobility model and by simulating pedestrians, buses and cars, in order to see how the performance can degrade on the basis of mobility and nodes characteristics
{"title":"Epidemic Strategies in Delay Tolerant Networks from an Energetic Point of View: Main Issues and Performance Evaluation","authors":"F. Rango, Salvatore Amelio, P. Fazio","doi":"10.4304/jnw.10.01.4-14","DOIUrl":"https://doi.org/10.4304/jnw.10.01.4-14","url":null,"abstract":"In this work we investigate Epidemic novel strategies called SNPS and EAER-SNPS applied to a DTN Network. These strategies extend the approach of the basic epidemic routing by using the node density estimation and the nodes energy levels; they adopt the forwarding scheme of the n-Epidemic routing. However, differently from n-Epidemic, it applies a dynamic forwarding scheme based on nodes density, that is able to reduce energy consumption and increase message delivery probability. A deep campaign of simulations was carried out in order to verify the effectiveness of the SNPS and EAER-SNPS. Simulation campaigns were conducted to evaluate the message delivery ratio, the average hop count, the average end-to-end delay and the average residual energy. Different mobility scenarios have been considered through the Working Day mobility model and by simulating pedestrians, buses and cars, in order to see how the performance can degrade on the basis of mobility and nodes characteristics","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"30 1","pages":"4-14"},"PeriodicalIF":0.0,"publicationDate":"2015-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86495839","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}
Wahida Mansouri, K. Mnif, F. Zarai, M. Obaidat, L. Kamoun
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
{"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}
Wireless Mesh Networks (WMN) is one of the most common network infrastructure that provides the technical characteristics to fulfill the requirements proposed by the Smart Cities. In order to obtain an efficient allocation and use of resources in such kind of infrastructures, the design of routing protocols that support Quality of Service (QoS) is fundamental. In this paper we propose a routing algorithm based on the Strength Pareto Evolutionary Algorithm (SPEA). This algorithm intends to build the most efficient routes by considering the shortest path, the energy consumption, the free space lost and QoS restrictions (delay and bandwidth) at the same time. As result, the designed routing protocol could be used in unicast or multicast transmission schemes, with or without restrictions and into centralized or decentralized environments.
{"title":"A Multi-objective Routing Algorithm for Wireless Mesh Network in a Smart Cities Environment","authors":"C. Lozano-Garzon, M. Camelo, P. Vilà, Y. Donoso","doi":"10.4304/jnw.10.01.60-69","DOIUrl":"https://doi.org/10.4304/jnw.10.01.60-69","url":null,"abstract":"Wireless Mesh Networks (WMN) is one of the most common network infrastructure that provides the technical characteristics to fulfill the requirements proposed by the Smart Cities. In order to obtain an efficient allocation and use of resources in such kind of infrastructures, the design of routing protocols that support Quality of Service (QoS) is fundamental. In this paper we propose a routing algorithm based on the Strength Pareto Evolutionary Algorithm (SPEA). This algorithm intends to build the most efficient routes by considering the shortest path, the energy consumption, the free space lost and QoS restrictions (delay and bandwidth) at the same time. As result, the designed routing protocol could be used in unicast or multicast transmission schemes, with or without restrictions and into centralized or decentralized environments.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"147 1","pages":"60-69"},"PeriodicalIF":0.0,"publicationDate":"2015-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76239596","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}
L. Tawalbeh, Y. Jararweh, Fadi Ababneh, Fahd Dosari
Interest in using Mobile Cloud Computing (MCC) for compute intensive mobile devices jobs such as multimedia applications has been growing. In fact, many new research efforts were invested to maximize the mobile intensive jobs offloading to the cloud within the cloud system coverage area. However, a large scale MCC deployment challenges and limitations are not considered. In this paper, a large scale Cloudlet-based MCC system deployment is introduced, aiming at reducing the power consumption and the network delay of multimedia applications while using MCC. The proposed deployment offers a large coverage area that can be used by mobile devices while they are moving from one location to another to reduce broadband communication needs. Practical experimental results and simulated results using show that using the proposed model reduces the power consumption of the mobile devices as well as reducing the communication latency when the mobile device requests a job to be performed remotely while satisfying the high quality of service requirements of mobile users.
{"title":"Large Scale Cloudlets Deployment for Efficient Mobile Cloud Computing","authors":"L. Tawalbeh, Y. Jararweh, Fadi Ababneh, Fahd Dosari","doi":"10.4304/jnw.10.01.70-76","DOIUrl":"https://doi.org/10.4304/jnw.10.01.70-76","url":null,"abstract":"Interest in using Mobile Cloud Computing (MCC) for compute intensive mobile devices jobs such as multimedia applications has been growing. In fact, many new research efforts were invested to maximize the mobile intensive jobs offloading to the cloud within the cloud system coverage area. However, a large scale MCC deployment challenges and limitations are not considered. In this paper, a large scale Cloudlet-based MCC system deployment is introduced, aiming at reducing the power consumption and the network delay of multimedia applications while using MCC. The proposed deployment offers a large coverage area that can be used by mobile devices while they are moving from one location to another to reduce broadband communication needs. Practical experimental results and simulated results using show that using the proposed model reduces the power consumption of the mobile devices as well as reducing the communication latency when the mobile device requests a job to be performed remotely while satisfying the high quality of service requirements of mobile users.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"16 1","pages":"70-76"},"PeriodicalIF":0.0,"publicationDate":"2015-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82470586","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：