Network management platform based on mobile agents

Many of the modern network management solutions are based on commercially available management platforms. These platforms offer common management services, such as support for multiple‐management protocols, alarm management, and event correlation. Most of these platforms are based on the traditional manager—agent model adopted in standard protocols, such as Internet SNMP. However, these platforms suffer from limitations imposed by the centralized, static, polling‐based management model of SNMP, and the need for maintaining a central intelligence at the platform level. In view of the dynamic nature of evolving networks, future network management solutions need to be flexible, adaptable, and intelligent without increasing the burden on network resources. We have addressed this requirement with a new management platform architecture based on ontology‐driven mobile agents. This paper presents the new management platform architecture, its prototype implementation, and the results of its evaluation. Copyright © 2004 John Wiley & Sons, Ltd.     

多代理系统在异构无线网络资源管理中的应用

在网络向着高速化、宽带化、泛在化发展的过程中,出现了多种多样的无线通信系统,给网络带来了丰富的异构性。然而异构网络缺少互通机制,缺乏有效的协调,具有系统间的干扰、单一网络业务提供能力有限、频谱资源稀缺等问题,网络资源利用率低下。为使网络资源能够高效使用,联合资源管理必不可少。而传统的集中式资源管理架构不能满足异构网络环境的需求,分布式基于多代理的网络资源管理架构将是未来异构无线网络联合资源管理的主要形式。     

Applying autonomy with bandwidth allocation models

Bandwidth Allocation Models (BAMs) are resource allocation methods used for networks in general. BAMs are currently applied for handling resources such as bandwidth allocation in MPLS DS‐TE networks (LSP setup). In general, BAMs define resource restrictions by ‘class’ and allocate the available resources on demand. This is frequently necessary to manage large and complex systems like routing networks. G‐BAM is a new generalized BAM that, by configuration, incorporates the ‘behavior’ of existing BAMs (MAM, RDM, G‐RDM and AllocTC‐Sharing). In effect, any current available BAM ‘behavior’ is reproduced by G‐BAM by simply adjusting its configuration parameters. This paper focuses on investigating the applicability of using autonomy together with BAMs for improve performance and facilitating the management of MPLS DS‐TE networks. It is investigated the applicability of ‘BAM switching’ using a framework with autonomic characteristics. In brief, it is investigated the switching among ‘BAM behaviors’ and BAM's reconfiguration with distinct network traffic scenarios by using G‐BAM. Simulation results suggest that the autonomic switching of ‘BAM behaviors’ based on high‐level management rules (Service Level Agreements, Quality of Service (QoS) or other police) may result in improving overall network management and operational parameters such as link utilization and preemption. Copyright © 2016 John Wiley & Sons, Ltd.     

Improving node behaviour in a QoS control environment by means of load‐dependent resource redistributions in LANs

An important means to guarantee an acceptable quality of service in networks with real‐time communication requirements is the reservation of resources at connection setup time. However, such reserved resources, e.g. transmission bandwidth, may be unused as a consequence of the variations in the actual resource demands. Therefore, a more efficient resource utilization is possible if communicating stations or end‐users dynamically hand over some of the free resources temporarily to the other communication partners, e.g. of a ‘broadcast network’. This paper concentrates on two fundamental problems of such a demand‐based sharing of resources: on the one hand, estimation of the current resource requirement on the basis of load measurements is investigated and, on the other hand, we elaborate efficient algorithms for resource sharing respecting real‐time requirements. The algorithms proposed for load estimation and for resource sharing are evaluated analytically with respect to their efficiency for worst‐case, average‐case and realistic load scenarios. Our approach suggested for resource and traffic management allows one to achieve significantly better utilization of network resources. Copyright © 2005 John Wiley & Sons, Ltd.     

A heterogeneous‐network aided public‐key management scheme for mobile ad hoc networks

A mobile ad hoc network does not require fixed infrastructure to construct connections among nodes. Due to the particular characteristics of mobile ad hoc networks, most existing secure protocols in wired networks do not meet the security requirements for mobile ad hoc networks. Most secure protocols in mobile ad hoc networks, such as secure routing, key agreement and secure group communication protocols, assume that all nodes must have pre‐shared a secret, or pre‐obtained public‐key certificates before joining the network. However, this assumption has a practical weakness for some emergency applications, because some nodes without pre‐obtained certificates will be unable to join the network. In this paper, a heterogeneous‐network aided public‐key management scheme for mobile ad hoc networks is proposed to remedy this weakness. Several heterogeneous networks (such as satellite, unmanned aerial vehicle, or cellular networks) provide wider service areas and ubiquitous connectivity. We adopt these wide‐covered heterogeneous networks to design a secure certificate distribution scheme that allows a mobile node without a pre‐obtained certificate to instantly get a certificate using the communication channel constructed by these wide‐covered heterogeneous networks. Therefore, this scheme enhances the security infrastructure of public key management for mobile ad hoc networks. Copyright © 2006 John Wiley & Sons, Ltd.     

Reconstruction of chaotic signals with application to channel equalization in chaos‐based communication systems

A number of schemes have been proposed for communication using chaos over the past years. Regardless of the exact modulation method used, the transmitted signal must go through a physical channel which undesirably introduces distortion to the signal and adds noise to it. The problem is particularly serious when coherent‐based demodulation is used because the necessary process of chaos synchronization is difficult to implement in practice. This paper addresses the channel distortion problem and proposes a technique for channel equalization in chaos‐based communication systems. The proposed equalization is realized by a modified recurrent neural network (RNN) incorporating a specific training (equalizing) algorithm. Computer simulations are used to demonstrate the performance of the proposed equalizer in chaos‐based communication systems. The Hénon map and Chua's circuit are used to generate chaotic signals. It is shown that the proposed RNN‐based equalizer outperforms conventional equalizers as well as those based on feedforward neural networks for noisy, distorted linear and non‐linear channels. Copyright © 2004 John Wiley & Sons, Ltd.     

Interference management for spectral coexistence in a heterogeneous satellite network

With the advent of the fifth generation of mobile radio communication by 2020, there will be many challenges such as increasing service demand with low delay in providing billions of end users called the satellite mobile users. It is expected that terrestrial communication systems will be faced with a dense network having many small cells anywhere and anytime. Therefore, there are some remote regions in the world where terrestrial systems cannot provide any services to end users. Furthermore, because of lack of spectral resources, it is very important that the spectrum is shared between satellite systems and terrestrial equipment by a suitable solution to interference management. In this paper, a heterogeneous satellite network that includes low earth orbit (LEO) satellite constellation and terrestrial equipment is proposed to provide low delay services. In this type of structure, interference management based on transmission power control between LEO satellite systems and mobile users is very important for obtaining high throughput. Moreover, in order to mitigate interference, transmission power control is shown based on noncooperative Stackelberg game under many subgames through pricing‐based algorithm and convex optimization method. Finally, the simulation results show that the performance of this study's system model will be improved through the proposed algorithm.     

A smartphone‐based U‐Healthcare system for real‐time monitoring of acute myocardial infarction

In recent years, medical service has been evolving from systems designed around centralized hospitals to Ubiquitous Healthcare (U‐Healthcare). U‐Healthcare system can facilitate real‐time monitoring of patient states, and can provide medical checkups and management whenever and wherever the medical staff deems necessary. U‐Healthcare services can provide chronic condition monitoring in the early stages of diseases and help execute decisive medical action in emergencies. However, thus far, the application of U‐Healthcare systems has been limited to diseases such as obesity, diabetes, etc. Acute myocardial infarction (AMI) is among the most critical chronic diseases and requires early detection and treatment. In this paper, we propose an AMI diagnostic software technique and protocol that can support real‐time communication between the patient and medical personnel. Our monitoring and diagnostic system has been developed using a protocol based on ISO/IEEE 11073. When data is transferred from the patient's smartphone to a server in hospital, the medical personnel consult the patient's biosensor data to determine the status of the relevant disease and provide appropriate medical service. The relevant information is sent back to the patient's smartphone through a wireless network, and patients can view their data in graphical format through their smartphone. Copyright © 2015 John Wiley & Sons, Ltd.     

A novel architecture of Proxy‐LMA mobility management scheme for software‐based smart factory networking

Mobile users expect a network service, in which seamless handoff occurs while moving on a next generation wireless network. In addition, in smart factories (SFs), communication is required between factory floor and manufacturing zone, as well as connectivity towards office IT, or remote production facilities that are connected via wide area network or internet. For this purpose, interworking between heterogeneous networks is important, but there has been little research on global mobility support. Therefore, this paper proposes Proxy‐LMA technology, a mobile IP‐based global internetworking system, to improve global mobility and interoperability in the SFs network environment. The purpose of the proposed Proxy‐LMA system is to support global mobility by using mobility management protocols such as PMIPv6 and MIPv6 in heterogeneous network environment. As a result of the performance evaluation, Proxy‐LMA system is more efficient than other methods in terms of signaling cost and response delay in heterogeneous network environment. Software‐based networking in SFs enables them to easily adapt the communication network to changing requirements. Similar to cloud‐based systems, such SFs could be seen as production clusters that could be rented and configured as needed. The SF network uses software‐defined networking combined with network functions virtualization, to achieve the required flexibility. Despite the fact that the technology is nowadays not yet ready for deployment in today's manufacturing networks, a novel network architecture for SFs based on software‐defined networking and network virtualization is here proposed, to support smart services, especially for Industrie 4.0.     

Multiparallel processing for enhancing the V2V clustering performance

In order to support the demand of the users in the new generation wireless systems (such as the smart interaction between the mobile devices and the mobile human), the resources of the intelligent transportation system should be utilized efficiently. Thus, the network structure adaptation due to the rapid changes in such communication process should be investigated. This is in addition to save the direct impact of the network resources such as high speed data transmission and data processing. Based on the standards for both of vehicular ad hoc network (VANET) and IEEE 802.11p, two main propositions have been examined to attain the improvement in such intelligent systems performance. In this paper, we improved the QoS and proposed a clustering algorithm named MP‐RC‐MBOFDM. It groups the mobile nodes based on their speeds with some modified head assignments processes. This will be combined with a parallel‐processing technique and a wavelet processing stage to optimize the transmitted power phenomenon. The simulation results of five main efficiency factors that have been involved, namely, complementary cumulative distributions, bit rates, energy efficiency, the cluster head life time, and the ordinary nodes reattaching‐head average times, show the feasibility of the new proposition in the V2V data transmission.     

LEO satellite communication networks—a routing approach

In the modern world of telecommunications, the concept of wireless global coverage is of the utmost importance. However, real global coverage can only be achieved by satellite systems. Until recently, the satellites were in geostationary orbit and their high altitude could not allow real‐time communication such as cellular networks. The development of LEO satellite networks seems to overcome this limit. However, LEO satellite systems have specific characteristics that need to be taken into account. In the same manner, the TCP/IP standard was developed for terrestrial network. The need is then to come up with a solution that would permit the use of TCP/IP on LEO satellite networks without losing too many packets. The idea is to develop a routing algorithm that maximizes the RTT delays compared to the TCP timer granularity. For that matter, we use an FSA‐based link assignment that simulates the satellite constellation as a fixed network for a predetermined time interval. In this configuration, the problem becomes a static routing problem where an algorithm can find the best solution. Copyright © 2003 John Wiley & Sons, Ltd.     

Efficient and secure business model for content centric network using elliptic curve cryptography

Initially, Internet has evolved as a resource sharing model where resources are identified by IP addresses. However, with rapid technological advancement, resources/hardware has become cheap and thus, the need of sharing hardware over Internet is reduced. Moreover, people are using Internet mainly for information exchange and hence, Internet has gradually shifted from resource sharing to information sharing model. To meet the recent growing demand of information exchange, Content Centric Network (CCN) is envisaged as a clean‐slate future network architecture which is specially destined for smooth content distribution over Internet. In CCN, content is easily made available using network caching mechanism which is misaligned with the existing business policy of content providers/publishers in IP‐based Internet. Hence, the transition from contemporary IP‐based Internet to CCN demands attention for redesigning the business policy of the content publishers/providers. In this paper, we have proposed efficient and secure communication protocols for flexible CCN business model to protect the existing business policies of the content publisher while maintaining the salient CCN features like in‐network content caching and Interest packet aggregation. To enhance the efficiency and security, the Elliptic Curve Cryptography (ECC) is used. The proposed ECC‐based scheme is analyzed to show that it is resilient to relevant existing cryptographic attacks. The performance analysis in terms of less computation and communication overheads and increased efficiency is given. Moreover, a formal security verification of the proposed scheme is done using widely used AVISPA simulator and BAN logic that shows our scheme is well secured.     

A pre‐emption framework for UMTS compatible satellite system supporting multimedia traffic

The pre‐emption procedure is an important part of the radio resource management when dealing with the emergency traffic. It allows resources to be allocated to higher priority connections by pre‐empting lower priority connections. The provision of the pre‐emption mechanism becomes much more important in the case of satellite systems such as the Inmarsat Broadband Global Area Network system, which aids in providing the communication during a catastrophe. This paper focuses on the pre‐emption framework for a Universal Mobile Telecommunications System‐based satellite systems. Three algorithms have been proposed, Greedy, SubSetSum and Fuzzy pre‐emption algorithm. Extensive simulations are carried out for the three algorithms, and their performances are compared against each other. Simulation results show that the Fuzzy pre‐emption algorithm performs better than the other two algorithms. Copyright © 2014 John Wiley & Sons, Ltd.     

Attack modeling and intrusion detection system for 5G wireless communication network

Research has been going around the globe to overcome the challenges that are associated with the increase in the number of users, such as interference management, load sharing, and increased capacity. 5G is emerging as a budding prospect for fulfilling demand and overcoming these challenges. For meeting the increased demands, new technologies such as relays in device‐to‐device communication and small cell access points have been introduced. However, these introductions have opened up security issues in the 5G wireless communication networks. This article focuses on security issues of the 5G wireless communication networks and analyzes the effect of a bandwidth spoofing attack using game theory on the small cell access point in 5G wireless communication network. This article also proposes an adaptive intrusion detection system using a hidden Markov Model for detecting an intrusion on small cell access point in a 5G wireless communication networks.     

Fusion of artificial intelligence and game theory for resource allocation in non-orthogonal multiple access-assisted device-to-device cooperative communication

Device-to-device (D2D) communication offers a low-cost paradigm where two devices in close proximity can communicate without needing a base station (BS). It significantly improves radio resource allocation, channel gain, communication latency, and energy efficiency and offers cooperative communication to enhance the weak user's network coverage. The cellular mobile users (CMUs) share the spectral resources (e.g., power, channel, and spectrum) with D2D mobile users (DMUs), improving spectral efficiency. However, the reuse of radio resources causes various interferences, such as intercell and intracell interference, that degrade the performance of overall D2D communication. To overcome the aforementioned issues, this paper presents a fusion of AI and coalition game for secure resource allocation in non-orthogonal multiple access (NOMA)-based cooperative D2D communication. Here, NOMA uses the successive interference cancellation (SIC) technique to reduce the severe impact of interference from the D2D systems. Further, we utilized a coalition game theoretic model that efficiently and securely allocates the resources between CMUs and DMUs. However, in the coalition game, all DMUs participate in obtaining resources from CMUs, which increases the computational overhead of the overall system. For that, we employ artificial intelligence (AI) classifiers that bifurcate the DMUs based on their channel quality parameters, such as reference signal received power (RSRP), received signal strength indicator (RSSI), signal-to-noise ratio (SNR), and channel quality indicator (CQI). It only forwards the DMUs that have better channel quality parameters into the coalition game, thus reducing the computational overhead of the overall D2D communication. The performance of the proposed scheme is evaluated using various statistical metrics, for example, precision score, accuracy, recall, F1 score, overall sum rate, and secrecy capacity, where an accuracy of 99.38% is achieved while selecting DMUs for D2D communication.     

Fair end‐to‐end window‐based congestion control in time‐varying data communication networks

Communication networks are time varying and, hence, fair sharing of network resources among the users in such a dynamic environment is a challenging task. In this context, a time‐varying network model is designed, and the shortest user's route is found. In the designed network model, an end‐to‐end window‐based congestion control scheme is developed with the help of internal nodes or router, and the end user can get implicit feedback (throughput). This scheme is considered as fair if the allocation of resources among users minimizes overall congestion or backlog in the networks. Window update approach is based on a multi‐class fluid model and is updated dynamically by considering delays (communication, propagation, and queuing) and the backlog of packets in the user's routes. Convergence and stability of the window size are obtained using a Lyapunov function. A comparative study with other window‐based methods is also provided.     

Deterministic K‐means secure coverage clustering with periodic authentication for wireless sensor networks

Innovative and emerging developments in sensor networks are proven to be the backbone for real‐time applications such as satellite communications, military and border area surveillance systems, health care systems, traffic monitoring systems, seismic and underwater monitoring systems, and agriculture and habitat environment systems. Coverage and clustering techniques enable the sensor network to operate in group‐based and region‐based communication and thus save the node energy. Energy‐efficient protocols save the node energy and increase the network life cycle in a resource‐constrained sensor network. Cluster head (CH) node manages and controls the operations such as network topology, coverage area, and routing paths (multi‐paths and fault‐tolerant paths) of the network. In this paper, we present deterministic K‐means secure coverage clustering (K‐SCC) with periodic authentication. The proposed protocol uses coverage clustering technique with periodic authentication between the CH node and sensor nodes to establish the secure channel in the network. Maximum cover of K nodes is maintained in the secure coverage cluster to achieve authenticated communication between the sensor nodes in the network. The proposed K‐SCC protocol is compared with the existing protocols such as deterministic‐SCC and random‐SCC protocols. Simulation results indicate that the proposed K‐SCC protocol achieves an average of 84% coverage ratio (cluster/sensor node ratio) as compared with 62% coverage ratio in the existing SCC protocols. Simulations also indicate that the proposed K‐SCC protocol consumes 20% less energy as compared with the existing SCC protocol. Copyright © 2015 John Wiley & Sons, Ltd.     

Towards a resource management and service deployment framework

Owing to the increase in both heterogeneity and complexity in today's networking systems, the need arises for new network‐based services architectures. They must provide flexibility and efficiency in the definition, deployment and execution of the services and, at the same time, handle the adaptability and evolution of such services. In this paper we present an approach that applies a Web‐service‐based resource management framework. It enables the provision of parallel applications as QoS‐aware applications, whose performance characteristics may be dynamically negotiated between a client application and service providers. Our component model allows context dependencies to be explicitly expressed and dynamically managed with respect to the hosting environment, computational resources and dependencies on other components. In such a model the resource management, in terms of representation, allocation and management of the resources, plays a vital role regarding the efficiency of the entire dynamic service deployment architecture. Copyright © 2007 John Wiley & Sons, Ltd.     

Web Services‐based network management: approaches and the WSNET system

While the Simple Network Management Protocol (SNMP) is still the dominant protocol for managing network elements in IP‐based networks and the Internet, network managers are acknowledging its limitations with respect to configuration management, application development and decentralization of management tasks. Web Services (WS) have been recently proposed to alleviate these limitations, given their pertinence to both decentralized management paradigms (e.g., CORBA), and XML management systems which provide efficiency in configuration management operations. This paper reviews architectures for WS‐based network management, outlining their advantages and disadvantages. These architectures address management of both individual network elements and composite multi‐device networks. Moreover, the paper introduces the architecture of a prototype system for WS‐based network management, namely WSNET. Along with presentation of the WSNET system, we provide a set of experimental results reporting performance figures for the WSNET system, as well as for systems based on other WS architectures. These figures allow for a comparative evaluation of the various systems, and manifest the benefits of the WSNET implementation. An important conclusion from our work is that WS should be seen as an accompaniment to conventional SNMP management rather than a replacement. However, there are also cases (e.g., need for secure remote access) where WS serve as a core rather than auxiliary solution, given that conventional methods are not applicable. Copyright © 2006 John Wiley & Sons, Ltd.     

Invincible AODV to detect black hole and gray hole attacks in mobile ad hoc networks

Today's communication world is majorly driven by mobile nodes that demand wireless systems for their data relay. One such network is mobile ad hoc network, which is a purely wireless network with which communication is feasible instantly without any aid of preexisting infrastructure; due to this magnificent feature, it has a wide variety of applications. Mobile ad hoc network hinges on cooperative nature of the mobile nodes for relaying data. But at the same time, nodes relaying data for others may compromise, leading to various security attacks. Two main security attacks that drastically bring down the performance of mobile ad hoc network are black hole and gray hole attacks. In this paper, we propose 2 versions of invincible Ad hoc On‐Demand Distance Vector protocol to detect black hole and gray hole nodes that have bypassed preventive mechanism during route discovery process. First is the basic version, which is based on node‐to‐node frame check sequence tracking mechanism, and second is the enhanced version, which is based on signed frame check sequence tracking mechanism. They create a deterrent environment addressing all kinds of black and gray hole attacks. They also provide reliable data transmission to all the nonmalicious nodes in the network by using end‐to‐end authentication mechanism. Simulation results show better performance in packet delivery ratio when compared with other contemporary solutions while addressing all kinds of black and gray hole attacks. It shows significant improvement in end‐to‐end delay and normalized routing load over Ad hoc On‐Demand Distance Vector under black hole or gray hole attacks and also shows better throughput and packet delivery ratio than the existing solution.