Overlay Network Research Articles

Bio-inspired innovative green fault recovery modelling for macro-femtocell mobile network

In an overlay macro-femtocell mobile network, the femtocells are allocated within the macrocell coverage in order to provide good quality of service at indoor environment. Within this network, when a femtocell gets damaged, the adjacent lightly loaded femtocells are searched and the users of the damaged cell are handed over to those lightly loaded adjacent femtocells. However, this increases latency, power consumption and the probability of call dropping. To overcome these difficulties, we propose a red blood cell life cycle-based fault recovery management method which utilises femtocell-to-macrocell and then macrocell-to-femtocell handover to reduce the probability of call dropping, power consumption and latency. We introduce a new database, femtoDB which is stored inside the cloud to be used as a potential repertoire capable to store the femtocell IDs with their users' information in an overlay macro-femtocell network. Based on the information maintained in femtoDB, the macrocell decides to which femtocell the users of the damaged femtocell to be handed over. Simulation results illustrate that the proposed recovery management method reduces the probability of call dropping, power consumption and latency by approximately ~3%, ~75% and ~60% respectively.

Improving the Security and Spectrum Efficiency in Overlay Cognitive Full-Duplex Wireless Networks

In this paper, we design a new collaboration interference (CI) transmission scheme for overlay cognitive full-duplex wireless wiretap networks, where a full-duplex secondary user utilizes the licensed spectrum to transmit the secondary information and uses the secondary signal as a special noise to help and protect the secure transmission of primary information in the presence of multiple passive eavesdroppers, simultaneously. Specifically, the full-duplex secondary user firstly uses the joint transmit antenna selection/maximal ratio combining (TAS/MRC) scheme to transmit the secondary information and receive the primary information at the same time. Then, the full-duplex secondary user utilizes a new interactive zero forcing beamforming (IZFB) algorithm to transmit the primary and secondary information without mutual interference simultaneously. For comprehensively analyzing the secure performance of the primary transmission, two eavesdropping modes, i.e., non-colluding eavesdropping (NCE) and colluding eavesdropping (CE) are considered. Based on the two modes, we derived the exact and asymptotic closed-form expressions for secrecy outage probability (SOP) of the primary transmission. Furthermore, the effective throughput of secondary transmission is also derived. The results demonstrate that the proposed CI-based transmission scheme can simultaneously improve the secrecy performance of primary transmission and throughput of secondary transmission, and can further achieve better spectrum-and-energy efficiency than traditional overlay transmission.

Bio-inspired innovative green fault recovery modelling for macro-femtocell mobile network

In an overlay macro-femtocell mobile network, the femtocells are allocated within the macrocell coverage in order to provide good quality of service at indoor environment. Within this network, when a femtocell gets damaged, the adjacent lightly loaded femtocells are searched and the users of the damaged cell are handed over to those lightly loaded adjacent femtocells. However, this increases latency, power consumption and the probability of call dropping. To overcome these difficulties, we propose a red blood cell life cycle-based fault recovery management method which utilises femtocell-to-macrocell and then macrocell-to-femtocell handover to reduce the probability of call dropping, power consumption and latency. We introduce a new database, femtoDB which is stored inside the cloud to be used as a potential repertoire capable to store the femtocell IDs with their users' information in an overlay macro-femtocell network. Based on the information maintained in femtoDB, the macrocell decides to which femtocell the users of the damaged femtocell to be handed over. Simulation results illustrate that the proposed recovery management method reduces the probability of call dropping, power consumption and latency by approximately ~3%, ~75% and ~60% respectively.

Congestion management in overlay networks

Congestion management in overlay networks

Enhanced satellite positioning methods using ultrawideband D2D-based localization for ultra-dense 5G wireless setting

The drawbacks of legacy satellite positioning systems necessitate new procedures for high resolution location services. Moreover, location-aware devices, systems and networks are critical for 5G/future network setting that seeks to seamlessly connect global devices in an all-IP network. It is therefore believed that satellite positioning could be enhanced with impulse radio (IR) ultrawideband (UWB) localization approaches for accuracy-critical situations expected in 5G wireless. This paper presents results of research on enhanced satellite positioning methods for ultra-dense 5G setting. The methods combine information from satellites, fixed wireless networks, wireless LANs and cellular communication along with global cloud databases. This is conceptualized as an IR-UWB device-to-device (D2D) overlay network that seamlessly incorporates satellite data into the 5G terrestrial network environment. A link to at least one satellite on the global positioning constellation would suffice for accurate localization. Also presented is the IR UWB D2D-propagation-based combined localization and communication scheme (UD-CLOCS). The UD-CLOCS scheme transmits location and communication data in a single signal while performance evaluations have been impressive. It is believed that the solutions have potential for robust and cost-efficient satellite positioning as well as prospect to de-congest licensed spectrum in 5G wireless setting. The significance of the research outcomes is that satellite positioning signal and data could be seamlessly integrated into global 5G networks for enhanced positioning services as well as improved spectral efficiency.

A Routing Table Poisoning Model for Peer-to-Peer (P2P) Botnets

Due to the global increase in mobile devices and cellular networks such as 3G, 4G, or LTE-A networks, the concept of the interpenetration of peer-to-peer (P2P) overlay networks in cellular environments has gained immense popularity among mobile users. P2P networks allow users to share their computing resources efficiently with the advantages of fault tolerance, robust connectivity, load balancing, and easy maintenance. The ability of a peer to connect to another peer depends on the distinguishing features of the overlay networks. For connection, network routing tables are maintained by each peer in the network to construct the P2P overlay on the Internet. This construction renders the P2P networks vulnerable to the existing attacks using the Internet. Some of these attack models have been proposed in the past using botnets. However, models using botnets do not accommodate the advanced attacks that can infect the majority of the entries in the routing table. In this paper, we propose a model to analyze the impacts of routing table poisoning attacks on the P2P botnet (rBot) architecture. We present the security analysis of the proposed epidemic model for state-of-the-art rBots. The obtained results were effective for attacks on the unstructured P2P static and mobile environments.

Improving multidimensional point query search using multi-way peer-to-peer tree network

Nowadays, peer-to-peer (P2P) networks are widely accepted in multidimensional applications like social networking, multiplayer games, P2P e-learning, P2P mobile ad-hoc networks, etc. Various P2P overlay networks combining multidimensional indexing (MI) methods are preferable for efficient multidimensional point or range search in a distributed environment. However, point query search in existing P2P has limitations viz.: 1) either does not give support to MI or uses replications to support MI; 2) point query search cost is limited to O(log2N). Hence, traditional MI techniques based on the multi-way tree structure (having larger fan-out) can be employed to enhance the multidimensional point query search capabilities. Based on our observations, a hybrid model combining m-ary (m fan-out of the tree, > 2) P2P tree network and MI based on space containment relationships is preferred to reduce point query search performance bound to O(logmN) using single overlay network. The present paper shows how this model improves the search performance of the point queries in O(logmN) steps, independent of the dimensionality of objects.

Improving multidimensional point query search using multi-way peer-to-peer tree network

Nowadays, peer-to-peer (P2P) networks are widely accepted in multidimensional applications like social networking, multiplayer games, P2P e-learning, P2P mobile ad-hoc networks, etc. Various P2P overlay networks combining multidimensional indexing (MI) methods are preferable for efficient multidimensional point or range search in a distributed environment. However, point query search in existing P2P has limitations viz.: 1) either does not give support to MI or uses replications to support MI; 2) point query search cost is limited to O(log2N). Hence, traditional MI techniques based on the multi-way tree structure (having larger fan-out) can be employed to enhance the multidimensional point query search capabilities. Based on our observations, a hybrid model combining m-ary (m fan-out of the tree, > 2) P2P tree network and MI based on space containment relationships is preferred to reduce point query search performance bound to O(logmN) using single overlay network. The present paper shows how this model improves the search performance of the point queries in O(logmN) steps, independent of the dimensionality of objects.

A priority-based queuing system for P2P-SIP call communications control

Regarding the shortcoming of fundamental existing solutions for VoIP communications (e.g., SIP) based on centralisation, both academia and industry have initiated research projects that focus on the integration of peer-to-peer (P2P) paradigms into session initiation protocol (SIP) communication systems (e.g., P2P-SIP). P2P-SIP builds an overlay network to provide efficient, interoperable and flexible SIP-based services. In this paper, we propose a new model for critical calls, that takes into consideration the priority aspect of some specific requests (e.g., emergency calls). The proposed model is generic regarding the P2P underlying and physical architectures. For illustration purposes, we consider Gnutella, as a representative of unstructured P2P networks, and Chord, as a representative of structured P2P networks. In order to validate the proposed solution, a M/M/1 queuing model is considered. Performance evaluations show that the preliminary results are globally satisfactory and that our proposed model under certain conditions is relevant.

Outage Performance of NOMA-Based Cognitive Hybrid Satellite-Terrestrial Overlay Networks by Amplify-and-Forward Protocols

In this paper, we investigate the outage probability (OP) performance of amplify-and-forward (AF) cognitive hybrid satellite-terrestrial overlay networks (CHSTONs) with the non-orthogonal multiple access (NOMA) scheme, in which half-duplexing terrestrial secondary networks cooperate with a primary satellite network for dynamic spectrum access. In order to improve the fairness of overlay paradigm, a NOMA-based power allocation profile is determined by instantaneous channel conditions. Considering the generalized shadowed-Rician fading for satellite links and Nakagami-$m$ fading for terrestrial links, we derive the closed-form OP expressions for both the primary and secondary users. Then, the asymptotic OP expressions at the high signal-to-noise ratio (SNR) regime are also obtained to evaluate the achievable diversity order and coding gain. Finally, the numerical simulations are provided to validate the theoretical results as well as the superiority of the NOMA scheme in CHSTONs and proclaim the effect of key parameters on the performance of the NOMA users, such as fading configurations and the power split factor.

Оцінка пропускної здатності бездротового каналу стандартів IEEE802.11 за використання протоколів IPv4 та IPv6

Transmission of data through wireless communication channels is carried out by the TCP / IP protocol stack. This stack of protocols should be hardware-independent, that is, applied regardless of which operating systems it operates, which communication channels are used. It provides universality to data transfer systems, however, it can negatively affect the operation of transmission channels, in particular wireless networks that have a limited data rate. Increasing redundancy in the formation of data packets may reduce the bandwidth of the channel and, accordingly, the speed of the channel. For wireless communication channels, IEEE802.11 standards achieve high speeds through the use of MIMO spatial multiplexing technology and channel bandwidth expansion through the use of 2.4 GHz and 5 GHz bands, which also use packet data and various types of IP addressing. Systems with different types of IP addressing can use Dynamic Host Configuration (DHCP) protocols, which allow to automatically receiving the required parameters for network operation. According to protocol specification, IP addressing will affect the dimension of packets and the order of its formation. Estimating the performance of using protocols of various versions is possible with the help of maximum and average values of delta, maximum and average jitter (as variation of delay), packet delays, and bandwidth. The analysis of possible options for improving network parameters, when applying a certain network architecture, including a two-stacked network, is a transition technology in which IPv4 and IPv6 work in tandem with a general or dedicated link; tunneling to create an overlay network that tunnels one protocol by another, encapsulating IPv6 packets in IPv4 packets and IPv4 packets in IPv6 packets; Broadcasts that facilitate the exchange of data between hosts and networks only for IPv6 and only for IPv4 by executing an IP header and converting addresses between two groups of addresses, domain name mapping, and IP addresses of the DNS protocol. The purpose of this article is to study changes in the characteristics of the information parameter of the wireless communication channel IEEE802.11 standards when using IPv4 and IPv6 protocols of different types.

User Topic Preferences Based Influence Maximization in Overlapped Networks

With the rapid development of online social networks, there is a trend of information interconnection among online social networks. User’s social behaviors are no longer confined to a single network but interact in the form of overlapping networks. Studying the problem of maximizing the influence of overlapping networks can not only make the influence spread to the extent that a single network cannot reach, but also effectively control the cost of advertising while maintaining the scope of diffusion. However, the existing models of user identification and influence propagation in overlapping networks are still not efficient enough. For this reason, this paper studies the problem of maximizing influence in overlapping networks based on user interests. First, network coupling is carried out through the “bridge” role of overlapping network users; secondly, independent cascade model is used. On the basis of this, a User Interest-based Influence Propagation Model of the Overlay Network (UI-IPM) is designed. Finally, based on the UI-IPM model, a heuristic algorithm combined with the greedy algorithm is designed to maximize the impact of overlapping networks (UI-IPM) and achieve Influence Maximization of the Overlay Network (IMON) mining seed nodes. The experimental results show the effectiveness of IMON algorithm in terms of influence sphere and time efficiency, and also verify the efficiency of seed nodes mining in overlapping network environment compared with a single network environment.

Preventing Sybil attacks in chord and Kademlia protocols

Structured p2p overlay networks, such as chord, Kademlia, CAN, pastry and tapastry allow participant to generate multiple identities on shared physical node. This practice of Sybil attacks introduces the risks of damaging the routing protocol and blocking access to information by impeding queries. Most existing security monitoring mechanisms are inefficient when applied to structured p2p overlay networks. In this work we propose a monitoring strategy allowing the decrease of Sybil nodes rate. We investigate this problem and find ways to detect suspicious behaviours. The key idea of our solution is to use the attack against the attack. We use Sybil attacks to infiltrate and launch monitor peers under different strategies to maximise the likelihood of detection. We were able to infiltrate and monitor in-depth the overlay using a small number of Sybils introduced in strategic zones, which allows us to estimate the number of malicious nodes. The proposed strategy is evaluated against the use of multiple identities both in chord and Kademlia protocols as most cited and popular p2p overlay networks. We find that adoption of limited number of monitors makes Sybil attacks ineffective.

A Distributed Flow Correlation Attack to Anonymizing Overlay Networks Based on Wavelet Multi-resolution Analysis

Government agencies rely more and more heavily on the availability of flexible and intelligent solutions for the interception and analysis of Internet-based telecommunications. Unfortunately, the global lawful interception market has been recently put into a corner by the emerging sophisticated encryption, obfuscation and anonymization technologies provided by modern overlay communication infrastructures. To face this challenge, this work proposes a novel strategy for defeating the anonymity of traffic flows, collected within and at the exit of these anonymizing networks, relying on distributed flow-capture, characterization and correlation attacks driven by wavelet-based multi-resolution analysis. Such a strategy, starting from a properly formalized attack model, results in an effective and promising framework that can be easily deployed on real-life network equipment and can potentially scale by working according to different distribution/parallelization scenarios.

Modeling and Simulation on Securing of Software Defined Network Overlays

Security is one of the key technologies with which DX (Digital Transformation) supported. A sent data was sometimes noise for this nonlinear programming technique to have the restrictions which won't be more than 1 for the value of the amplified bit, without the most suitable functions can be found. It wasn't possible to build the large-scale network of which high security including authentication is requested. The same problem generated the algorithm which does a weighting of each antenna it became stable, and to secure high-speed transmission of a time zone cord at a multiple-input multiple-out (MIMO) channel by the Wireless environment equally. The purpose of this system is here to achieve to develop the technology for which security is secured by also utilizing the algorithm which will improve the algorithm which selects the filtering technique and the filtering which are the multiplex technology when a network transmits at high speed, and select the filtering later for a weighting of each antenna by time zone coding at the MIMO channel which is high-speed transmission technology by the wireless society and build the large-scale network environment that advantage convenience guaranteed high security highly freely and easily.

A survey and comparison on overlay‐underlay mapping techniques in peer‐to‐peer overlay networks

SummaryPeer‐to‐peer (P2P) overlay networks were developed initially for file sharing such as Napster and Gnutella; but later, they have become popular for content sharing, media streaming, telephony applications, etc. Underlay‐unawareness in P2P systems can result in suboptimal peer selection for overlay routing and hence poor performance. In this paper, we present a comprehensive survey of the research work carried out to solve the overlay‐underlay mapping problems up till now. The majority of underlay‐aware proposals for peer selection focus on finding the shortest overlay routes by selecting nearest nodes according to proximity information. Another class of approaches is based on passive or active probing for provision of underlay information to P2P applications. Some other optimizations propose use of P2P middleware to extract, process, and refine underlay information and provide it to P2P overlay applications. Another class of approaches strive to use ISPs or third parties to provide underlay information to P2P overlay applications according to their requirements. We have made a state‐of‐the‐art review and comparison for addressing the overlay‐underlay mismatch in terms of their operation, merits, limitations, and future directions.

Evaluation Method for SDN Network Effectiveness in Next Generation Cellular Networks

5G mobile technology will become the new revolution in the mobile communication market. The new networks will focus on significantly improving the quality of service. The basis for their construction will form SDN networks. Therefore, the work analyzed the advantages and disadvantages of two SDN implementing methods. It was developed mathematical method to assess their complex effectiveness, which consider QoS requirements of implementing service through special weights for scalability, performance and packet delay. There were simulations of Overlay networks by using softswitches to verify the adequacy of the proposed method. The results showed that the use of SDN networks more efficiently by using IP networks for large volumes of traffic and with a large number of network equipment. Also, there were compared the approaches to build SDN management level architecture. Based on the studies and modeling we suggested to use distributed controller architecture because of its higher level of reliability.

Reputation based approach for improved fairness and robustness in P2P protocols

Peer-to-Peer (P2P) overlay networks have gained popularity due to their robustness, cost advantage, network efficiency and openness. Unfortunately, the same properties that foster their success, also make them prone to several attacks. To mitigate these attacks, several scalable security mechanisms which are based on the concepts of trust and reputation have been proposed. These proposed methods tend to ignore some core practical requirements that are essential to make them more useful in the real world. Some of such requirements include efficient bootstrapping of each newcomer’s reputation, and mitigating seeder(s) exploitation. Additionally, although interaction among participating peers is usually the bases for reputation, the importance given to the frequency of interaction between the peers is often minimized or ignored. This can result in situations where barely known peers end-up having similar trust scores to the well-known and consistently cooperative nodes. After a careful review of the literature, this work proposes a novel and scalable reputation based security mechanism that addresses the aforementioned problems. The new method offers more efficient reputation bootstrapping, mitigation of bandwidth attack and better management of interaction rate, which further leads to improved fairness. To evaluate its performance, the new reputation model has been implemented as an extension of the BitTorrent protocol. Its robustness was tested by exposing it to popular malicious behaviors in a series of extensive PeerSim simulations. Results show that the proposed method is very robust and can efficiently mitigate popular attacks on P2P overlay networks.

Queueing analysis of DTN protocols in deep-space communications

Delay/disruption tolerant networking (DTN) [1] is proposed as an internetworking architecture for reliable data delivery despite a long propagation delay and/or lengthy link disruptions. DTN targets challenging networking environments where traditional networking protocols such as the terrestrial Transmission Control Protocol/Internet Protocol (TCP/IP) typically do not work effectively. The challenging problem of mission control and data delivery in space communications is a typical application scenario of the DTN technology. Reliable and highly efficient data delivery of DTN relies heavily on the bundle protocol (BP) [2]. BP is intended to establish an overlay network that is able to withstand intermittent data link connectivity in the delivery of DTN data units, termed bundles. BP adopts a store-and-forward mechanism and a custody transfer option for transmission reliability.

Delay-Aware Task Offloading in Shared Fog Networks

Offloading computation tasks from resource-poor end devices to powerful backend clouds has become a prevalent solution thanks to the rapid development of cloud computing. However, modern Internet of Things applications, such as augmented reality and real-time monitoring, bring stringent delay requirements to the computation tasks in the device-to-computing-facility communications. To better accommodate the delay requirements of the computation tasks, the recently proposed fog computing architecture suggests that these computation tasks can be extensively offloaded to the distributed computation facilities along the cloud-to-things continuum. These computation facilities, including central clouds and the computation facilities standing at the network edge, jointly form an overlay network, named a fog network, to provide fog computing services for end devices. This paper targets a practical and efficient scheme to schedule tasks with heterogeneous delay sensitivities in a shared fog network. A mathematical model is first constructed to capture the major characteristics of a fog network. The model enforces lexicographic max–min fairness, an enhanced metric compared to conventional max–min fairness. The task offloading problem is modeled as an integer nonlinear program. An efficient and exact solution method is proposed based on problem-specific analysis. Finally, synthesized-trace-driven simulations demonstrate the efficacy of our proposed offloading scheme.