Dynamic pricing for load‐balancing in user‐centric joint call admission control of next‐generation wireless networks

Next‐generation wireless networks (NGWN) will be heterogeneous, comprising of a number of radio access technologies (RATs) co‐existing in the same geographical area. In NGWN, joint call admission control (JCAC) algorithms are required to select the most appropriate RAT for each incoming call. It is envisaged that these JCAC algorithms will be user‐centric (i.e. will consider users' preferences in making RAT selection decisions) in order to enhance user satisfaction. However, user‐centric JCAC algorithms can lead to highly unbalanced traffic load among the available RATs in NGWN because users act independently, and most of them may prefer to be connected through a particular RAT. Highly unbalanced traffic load in NGWN will result in high overall call blocking/dropping probability and poor radio result utilization. To address this problem, we propose dynamic pricing for balancing traffic load among available RATs in heterogeneous wireless networks where users' preferences are considered in making RAT selection decisions. By dynamically adjusting the service price in each of the available RATs, the proposed user‐centric JCAC scheme evens out the unbalanced traffic load caused by independent users' preferences. The JCAC scheme uses fuzzy multiple attribute decision‐making (MADM) technique to select the most appropriate RAT for each incoming call. We develop a Markov model to evaluate the overall call blocking/dropping probability and percentage load in each RAT in heterogeneous wireless networks. Performance of the proposed JCAC scheme is compared with that of a scheme that does not use dynamic pricing. Simulation results are given to show the effectiveness of the proposed JCAC scheme. Copyright © 2009 John Wiley & Sons, Ltd.     

Optimizing content routers deployment in large‐scale information centric core‐edge separation Internet

In this paper, we investigate the optimization of content router deployment in large‐scale information centric core‐edge separation Internet. We formulate the target cost function, which captures the trade‐off between the cost for traffic transmission and cost due to additional deployment of content routers. To solve the problem, we first derive the analytical results of traffic ratio and its closed‐form approximation. We then construct a convex optimization problem, from which the optimal deployment probability can be solved. By extensive numerical results, the accuracy of the closed‐form approximation of traffic ratio is demonstrated. And, it is found that the optimal deployment probability is decided by the average number of hops for obtaining the content, the cost for traffic transmission, and the cost of extending router to content router. Copyright © 2013 John Wiley & Sons, Ltd.     

Carrier‐sense‐assisted adaptive learning MAC protocols for distributed wireless LANs

A Carrier‐sense‐assisted adaptive learning MAC protocol for wireless LANs, capable of operating efficiently in bursty traffic wireless networks with unreliable channel feedback, is introduced. According to the proposed protocol, the mobile station that is granted permission to transmit is selected by means of learning automata. At each station, the learning automaton takes into account the network feedback information in order to update the choice probability of each mobile station. The proposed protocol utilizes carrier sensing in order to reduce the collisions that are caused by different decisions at the various mobile stations due to the unreliable channel feedback. Simulation results show satisfactory performance of the proposed protocol compared to similar MAC protocols. Copyright © 2005 John Wiley & Sons, Ltd.     

In‐service QoS monitoring of real‐time applications using SM MIB

Current network management needs an end‐to‐end overview of various flows rather than the information that is purely local to the individual devices. The typical manager‐centric polling approach, however, is not suitable to understand network‐wide behavior of a large‐scale Internet. In this paper, we propose a new management information base (MIB) approach called Service Monitoring MIB (SM MIB). The MIB provides a network manager with dynamic end‐to‐end management information by utilizing special packets. The special packet is an Internet control message protocol (ICMP) application that is sent to a remote network element to monitor Internet services. The SM MIB makes an end‐to‐end management feasible while it reduces management‐related traffic and manager‐to‐manager interactions. Real examples show that the proposed SM MIB is useful for end‐to‐end QoS monitoring. We discuss the accuracy of the obtained data as well as the monitoring overhead. Copyright © 2004 John Wiley & Sons, Ltd.     

Improving energy efficiency in information‐centric mobile ad‐hoc networks using places of interest while respecting privacy

The fact that network users mostly look for content regardless of its location has led to the creation of information‐centric networks with NDN (named data networking project) as the most famous instance. NDN can be implemented in any type of network including MANET (mobile ad‐hoc network) which can be easily created among a collection of smartphones. The first step for content retrieval in NDN is propagating interest packets which has a dramatic effect on energy consumption because of wireless communications. Methods have been devised for limiting the amount of packet propagation. But they are not appropriate for smartphones either because they require multiple WiFi interfaces which is not available in usual smartphones or because they require the exact position of nodes which conflicts privacy. In our proposed approach, a single WiFi interface is used, and mobile nodes will share only an imprecise version of their current and their predicted next location, which complies much better with privacy. Using this information, the amount of interest and data packets will decrease of more than 15%. When location information is spread through the network, this reduction will be almost doubled.     

Extending P2PMesh: topology‐aware schemes for efficient peer‐to‐peer data sharing in wireless mesh networks

Wireless mesh networks (WMNs) have emerged as a promising technology that provides low‐cost broadband access to the Internet for fixed and mobile wireless end users. An orthogonal evolution in computer networking has been the rise of peer‐to‐peer (P2P) applications such as P2P data sharing. It is of interest to enable effective P2P data sharing in this type of networks. Conventional P2P data sharing systems are not cognizant of the underlying network topology and therefore suffer from inefficiency. We argue for dual‐layer mesh network architecture with support from wireless mesh routers for P2P applications. The main contribution of this paper is P2PMesh: a topology‐aware system that provides combined architecture and efficient schemes for enabling efficient P2P data sharing in WMNs. The P2PMesh architecture utilizes three schemes: (i) an efficient content lookup that mitigates traffic load imbalance at mesh routers; (ii) an efficient establishment of download paths; and (iii) a data transfer protocol for multi‐hop wireless networks with limited capacity. We note here that the path establishment and data transfer schemes are specific to P2P traffic and that other traffic would use routes determined by the default routing protocol in the WMN. Simulation results suggest that P2PMesh has the potential to improve the performance of P2P applications in a wireless multi‐hop setting; specifically, we focused on data sharing, but other P2P applications can also be supported by this approach. Copyright © 2011 John Wiley & Sons, Ltd.     

BRAIN—an architecture for a broadband radio access network of the next generation

The tremendous growth rates of the Internet as well as the area of mobile communications give rise to the chance that the mobile Internet is most promising by combining both the Internet and mobile communications. These prospects are the motivation for the European research project BRAIN (Broadband Radio Access for IP‐based Networks), which is developing an open architecture for a broadband wireless mobile access network offering an integrated communication platform across heterogeneous networks and, thus, goes beyond current third generation systems and towards the mobile Internet. The project covers three major technical areas: support of seamless service provision in a mobile environment; the design of an IP‐based access network that will support non‐cellular technologies such as wireless LANs; and requirements of a broadband air interface suitable for hot spots. BRAIN is going to integrate HIPERLAN/2 with UMTS by means of an IP access network. The work is guided by a user‐centric top‐down approach ensuring that user functionality is the key driver of the project. This article will focus on that part of the BRAIN work which specifies the main interfaces of the BRAIN architecture and deals with aspects related to the support of Quality of Service and mobility. Copyright © 2001 John Wiley & Sons, Ltd.     

Defending Wireless Infrastructure Against the Challenge of DDoS Attacks

This paper addresses possible Distributed Denial-of-Service (DDoS) attacks toward the wireless Internet including the Wireless Extended Internet, the Wireless Portal Network, and the Wireless Ad Hoc network. We propose a conceptual model for defending against DDoS attacks on the wireless Internet, which incorporates both cooperative technological solutions and economic incentive mechanisms built on usage-based fees. Cost-effectiveness is also addressed through an illustrative implementation scheme using Policy Based Networking (PBN). By investigating both technological and economic difficulties in defense of DDoS attacks which have plagued the wired Internet, our aim here is to foster further development of wireless Internet infrastructure as a more secure and efficient platform for mobile commerce.     

Robust H∞ Power Control for CDMA Systems in User‐Centric and Network‐Centric Manners

In this paper, we present a robust H_∞ distributed power control scheme for wireless CDMA communication systems. The proposed scheme is obtained by optimizing an objective function consisting of the user's performance degradation and the network interference, and it enables a user to address various user‐centric and network‐centric objectives by updating power in either a greedy or energy efficient manner. The control law is fully distributed in the sense that only its own channel variation needs to be estimated for each user. The proposed scheme is robust to channel fading due to the immediate decision of the power allocation of the next time step based on the estimations from the H_∞ filter. Simulation results demonstrate the robustness of the scheme to the uncertainties of the channel and the excellent performance and versatility of the scheme with users adapting transmit power either in a user‐centric or a network‐centric efficient manner.     

战术云在战术边缘的应用研究

随着网络中心战的发展,战术边缘的态势感知和信息处理能力对瞬息万变的战争局势的影响越来越大。基于云计算技术的战术云可以为战术边缘提供强大的计算、存储和信息处理能力,分析对比了目前外军主要的四种战术云架构的技术特点,并以微云架构为基础,提出了一种基于软件定义的战术云方案,该方案可以灵活地为战术边缘的移动设备提供各种应用服务,同时可以保障业务的QoS以及优化无线资源的利用率。     

Distributed mobility management in named data networking

The information‐centric networking concept was proposed to fulfill the scalability and efficiency requirements of the content‐centric Internet in the future. Among the multiple information‐centric networking proposals, Named Data Networking (NDN) is one of the most important representatives. NDN uses a hierarchical name to identify the data after which the on‐path cache can be deployed to improve the efficiency of data retrieval. However, with the development of mobile Internet, how to extend NDN in the mobile environment to enable efficient and scalable mobility management remains a challenge. We propose a distributed mobility management scheme for both the mobile receiver and the mobile publisher in NDN. Our proposed approach is based on the basic NDN naming and routing principles to select the branching node of the previous and new access locations of the mobile terminal after which the on‐path routing states are dynamically adjusted accordingly. Then we propose a novel analytical model to analyze the performance of the proposed scheme. The results demonstrate that the proposed scheme inherits the scalability and efficiency of NDN in the mobile Internet. Copyright © 2015 John Wiley & Sons, Ltd.     

Detection and defense of DDoS attack–based on deep learning in OpenFlow‐based SDN

Distributed denial of service (DDoS) is a special form of denial of service attack. In this paper, a DDoS detection model and defense system based on deep learning in Software‐Defined Network (SDN) environment are introduced. The model can learn patterns from sequences of network traffic and trace network attack activities in a historical manner. By using the defense system based on the model, the DDoS attack traffic can be effectively cleaned in Software‐Defined Network. The experimental results demonstrate the much better performance of our model compared with conventional machine learning ways. It also reduces the degree of dependence on environment, simplifies the real‐time update of detection system, and decreases the difficulty of upgrading or changing detection strategy.     

QoS‐aware LTE‐A downlink scheduling algorithm: A case study on edge users

4G/LTE‐A (Long‐Term Evolution—Advanced) is the state of the art wireless mobile broadband technology. It allows users to take advantage of high Internet speeds. It makes use of the OFDM technology to offer high speed and provides the system resources both in time and frequency domain. A scheduling algorithm running on the base station holds the allocation of these resources. In this paper, we investigate the performance of existing downlink scheduling algorithms in two ways. First, we look at the performance of the algorithms in terms of throughput and fairness metrics. Second, we suggest a new QoS‐aware fairness criterion, which accepts that the system is fair if it can provide the users with the network traffic speeds that they demand and evaluate the performance of the algorithms according to this metric. We also propose a new QoS‐aware downlink scheduling algorithm (QuAS) according to these two metrics, which increases the QoS‐fairness and overall throughput of the edge users without causing a significant degradation in overall system throughput when compared with other schedulers in the literature.     

Mobile device‐centric access point monitoring scheme for handover decision triggering in heterogeneous networks

Because of the low throughput and the high packet error rate in wireless communications, the network traffic often converges at access points (APs), which take a role of connecting wired and wireless communication interfaces, and APs are usually bottleneck points in wireless networks. In heterogeneous networks, various networks are around mobile devices. Furthermore, today's mobile devices have various wireless network capabilities. Thus, mobile devices should be able to understand network situations autonomously and use a wide range of network options in heterogeneous networks. However, since current mobile devices cannot know the connected AP's network condition, they continue to use the AP, which provides poor‐quality networks even though there are other available APs and networks nearby. To resolve the aforementioned problems, we propose MAPS , the low‐power AP monitoring scheme for handover decision triggering in heterogeneous networks. Using MAPS , a mobile device can trigger a handover decision properly through predicting the connected AP's network condition accurately without any cooperation from other devices. Furthermore, MAPS does not require any modification on existing network systems, and the mobile device can use MAPS with simple application installation. Through diverse simulations, actual experiments, and power consumption analysis, we validate that MAPS can detect the busy AP effectively and is suitable for mobile devices because of low power consumption.     

Opportunistic delay‐margin‐based resource allocation for next‐generation wireless networks

This paper studies and develops efficient traffic management techniques for downlink transmission at the base station (BS) of multi‐service IP‐based networks by combining quality‐of‐service (QoS) provision and opportunistic wireless resource allocation. A delay‐margin‐based scheduling (DMS) for downlink traffic flows based on the delays that each packet has experienced up to the BS is proposed. The instantaneous delay margin, represented by the difference between the required and instantaneous delays, quantifies how urgent the packet is, and thus it can determine the queuing priority that should be given to the packet. The proposed DMS is further integrated with the opportunistic scheduling (OPS) to develop various queueing architectures to increase the wireless channel bandwidth efficiency. Different proposed integration approaches are investigated and compared in terms of delay outage probability and wireless channel bandwidth efficiency by simulation. Copyright © 2010 John Wiley & Sons, Ltd.     

Prediction‐based MAC‐layer sensing in cognitive radio networks

We consider a cognitive radio network which coexists with multiple primary users (PUs) and secondary users (SUs) transmit over time‐varying channels. In this scenario, one problem of the existing work is the poor performances of throughput and fairness due to variances of SUs' channel conditions and PUs' traffic patterns. To solve this problem, we propose a novel prediction‐based MAC‐layer sensing algorithm. In the proposed algorithm, the SUs' channel quality information and the probability of the licensed channel being idle are predicted. Through the earlier predicted information, we schedule the SUs to sense and transmit on different licensed channels. Specifically, multiple significant factors, including network throughput and fairness, are jointly considered in the proposed algorithm. Then, we formulate the prediction‐based sensing scheduling problem as an optimization problem and solve it with the Hungarian algorithm in polynomial time. Simulation results show that the proposed prediction‐based sensing scheduling algorithm could achieve a good tradeoff between network throughput and fairness among SUs. Copyright © 2014 John Wiley & Sons, Ltd.     

Autonomous and adaptive beaconing strategy for multi‐interfaced wireless mobile nodes

Ad hoc wireless communications rely on beaconing to manage and maintain several network operations and to share relevant network parameters among network nodes. Beacon frames are sent at the start of each beacon interval. The frequency of beaconing depends on whether beacon intervals are fixed size or may be adapted and regulated according to the perceived network and workload conditions. On the other hand, current mobile nodes usually embed several heterogeneous wireless interfaces that urge the design of an adaptive beaconing strategy. In this paper, we propose an autonomous and adaptive beaconing strategy for multi‐interfaced mobile wireless nodes that is capable of regulating the beacon interval size dynamically according to the perceived network conditions. The proposed strategy is based on a joint dynamic estimation of both the announcement traffic indication message (ATIM) window and the beyond‐ATIM window sizes for each beacon interval. Extensive simulations were conducted using OMNeT++ to ascertain the improvements achieved by autonomously regulating the entire beacon interval to take into account the network and workload conditions. Obtained results showed that the two proposed approaches improve significantly the efficiency of the network in terms of throughput, end‐to‐end delay, and power consumption. The proposed fixed beacon interval (fixed‐BI) approach stands as an enhanced version of the power‐saving multi‐channel MAC protocol (PSM‐MMAC). The proposed variable beacon interval (variable‐BI) approach, which regulates dynamically both of the ATIM and the beyond‐ATIM windows, outperforms both the fixed‐BI and the PSM‐MMAC. In particular, under nominal traffic loads, the end‐to‐end delay of the variable‐BI is much lower than those provided by the fixed‐BI and PSM‐MMAC. Copyright © 2015 John Wiley & Sons, Ltd.     

VoIP traffic in wireless mesh networks: a MOS‐based routing scheme

Support of Voice over Internet Protocol (VoIP) services in wireless mesh networks requires implementation of efficient policies to support low‐delay data delivery. Multipath routing is typically supported in wireless mesh networks at the network level to provide high fault tolerance and load balancing because links in the proximity of the wireless mesh gateways can be very stressed and overloaded, thus causing scarce performance. As a consequence of using multipath solutions, lower delay and higher throughput can be supported also when a given path is broken because of mobility or bad channel conditions, and alternative routes are available. This can be a relevant improvement especially when assuming that real‐time traffic, such as VoIP, travels into the network. In this paper, we address the problem of Quality of Service (QoS) support in wireless mesh networks and propose a multipath routing strategy that exploits the Mean Opinion Score (MOS) metric to select the most suitable paths for supporting VoIP applications and performing adaptive load balancing among the available paths to equalize network traffic. Performance results assess the effectiveness of the proposed approach when compared with other existing methodologies. Copyright © 2015 John Wiley & Sons, Ltd.     

Performance of delay‐sensitive traffic in multi‐layered satellite IP networks with on‐board processing capability

In this article, performance of delay‐sensitive traffic in multi‐layered satellite Internet Protocol (IP) networks with on‐board processing (OBP) capability is investigated. With OBP, a satellite can process the received data, and according to the nature of application, it can decide on the transmission properties. First, we present a concise overview of relevant aspects of satellite networks to delay‐sensitive traffic and routing. Then, in order to improve the system performance for delay‐sensitive traffic, specifically Voice over Internet Protocol (VoIP), a novel adaptive routing mechanism in two‐layered satellite network considering the network's real‐time information is introduced and evaluated. Adaptive Routing Protocol for Quality of Service (ARPQ) utilizes OBP and avoids congestion by distributing traffic load between medium‐Earth orbit and low‐Earth orbit layers. We utilize a prioritized queueing policy to satisfy quality‐of‐service (QoS) requirements of delay‐sensitive applications while evading non‐real‐time traffic suffer low performance level. The simulation results verify that multi‐layered satellite networks with OBP capabilities and QoS mechanisms are essential for feasibility of packet‐based high‐quality delay‐sensitive services which are expected to be the vital components of next‐generation communications networks. Copyright © 2007 John Wiley & Sons, Ltd.     

Fog‐SDN: A light mitigation scheme for DDoS attack in fog computing framework

Cloud computing is one of the most tempting technologies in today's computing scenario as it provides a cost‐efficient solutions by reducing the large upfront cost for buying hardware infrastructures and computing power. Fog computing is an added support to cloud environment by leveraging with doing some of the less compute intensive task to be done at the edge devices, which reduces the response time for end user computing. But the vulnerabilities to these systems are still a big concern. Among several security needs, availability is one that makes the demanded services available to the targeted customers all the time. Availability is often challenged by external attacks like Denial of service (DoS) and distributed denial of service (DDoS). This paper demonstrates a novel source‐based DDoS mitigating schemes that could be employed in both fog and cloud computing scenarios to eliminate these attacks. It deploys the DDoS defender module which works on a machine learning–based light detection method, present at the SDN controller. This scheme uses the network traffic data to analyze, predict, and filter incoming data, so that it can send the filtered legitimate packets to the server and blocking the rest.