Software-Defined Networking-Assisted Content Delivery at Edge of Mobile Social Networks

In mobile social networks, the mobility and connectivity of nodes are often non-deterministic. Source and destination nodes may not have a meeting opportunity and the content dissemination and delivery most of the time require the cooperation of nodes. However, this causes nodes spend energy, thus, they may be reluctant to participate in the dissemination process to conserve energy. One approach to motivate user participation is to transfer energy for their service so that their potential loss is compensated. However, this makes routing problem much challenging as the source node needs to decide not only the best relay nodes but also the amount of energy transfer to them. In this paper, we study this energy sharing based content delivery problem in mobile social networks. To this end, we assume that a node is willing to carry the content as long as the energy received for this delivery lasts, after which it drops the content (i.e., time-to-live). We utilize optimal stopping theory and dynamic programming to model the content delivery problem under this energy sharing paradigm between the nodes. The simulation results show that energy sharing based content delivery can potentially increase the routing performance under certain settings.

Mobile social network (MSN) emerges as a promising social network paradigm that enables mobile users' information sharing in the proximity and facilitates their cyber-physical-social interactions. As the advertisements, rumors, and spams spread in MSNs, it is necessary to filter spams before they arrive at the recipients to make the MSN energy efficient. To this end, we propose a personalized fine-grained filtering scheme (PIF) with privacy preservation in MSNs. Specifically, we first develop a social-assisted filter distribution scheme, where the filter creators send filters to their social friends (i.e., filter holders). These fil- ter holders store filters and decide to block spams or relay the desired packets through coarse-grained and fine-grained keyword filtering schemes. Meanwhile, the developed cryptographic filter- ing schemes protect creator's private information (i.e., keyword) embedded in the filters from directly disclosing to other users. In addition, we establish a Merkle Hash tree to store filters as leaf nodes where filter creators can check if the distributed filters need to be updated by retrieving the value of root node. It is demon- strated that the PIF can protect users' private keywords included in the filter from disclosure to others and detect forged filters. We also conduct the trace-driven simulations to show that the PIF can not only filter spams efficiently but also achieve high delivery ratio and low latency with acceptable resource consumption.

In Mobile Social Networks (MSN) individuals with similar interests or commonalities connect to each other using the mobile phones. MSN are special kind of Ad-hoc Networks in which wireless connectivity (i.e. encounters and re-encounters) with social peers is predictable. Most of the recent research proposes routing framework to exploit these predictable patterns to identify the best information carriers. The best information carriers are selected based on the high probability of encounter with potential information recipients. In these approaches an important variable is ignored i.e. time of encounter. Considering encounter time in the protocol gives time assurance of message delivery for time critical application. Therefore in this paper we address the research question, how to exploit people's predictable social patterns to improve the content delivery performance and lower end-to-end delay in time critical applications? Our assumption is that the people follow similar mobility patterns daily (i.e. Monday to Friday). In this paper we verify our research question and assumption using real trace data of 100 users carrying Nokia 6600 smart phones over the course of nine months. Furthermore we model, analyze and propose algorithms for social encounter based content delivery system for time critical applications. The simple heuristics and initial study presented in this paper achieve a timely content delivery using predictable patterns while lowering system wide traffic flooding.

It is Software defined networking (SDN) is a new network approach which allows separation of the forwarding plane from the control plane in network architecture, that aids in the efficient control of data flow and gives network administrators a software- based method for managing and configuring the networks. In contrast to SDN, which provides a centralized controller, traditional network topologies require the individual configuration of each network device. Due to a centralized control functionality, SDN is increasingly used by businesses, telecom service providers, cloud providers, and many other users, as it encourages flexibility and scalability in the network while also assisting in streamlining operations. There is significant demand of SDN for effective and adaptable networks. SDN adoption has also been rising in the campuses and corporate sectors. This paper provides a concise overview of the Software Defined Networks (SDN) topic, which is essential for comprehending the fundamental principles of SDN in order to conduct research and implement SDN in many sectors. The initial focus is on the discussion of traditional networks, including their limitations, as well as the many issues encountered by industries. The topic of Software Defined Networks is explored, encompassing their necessity, historical background, architectural structure, interfaces, and models. Next, the many applications of Software-Defined Networking (SDN) are examined. Additionally, the various SDN case studies, vendors, setup issues with SDN, and current research fields were elucidated. The discussion focuses on the role of Software-Defined Networking (SDN) in Artificial Intelligence (AI), specifically addressing the issues associated with implementing SDN in AI.

Underwater sensor networks are used to detect the objects and the environmental pattern under the sea water. Some of its limiting features are high latency, low bandwidth, and high energy consumption. Some of the applications of under sensor networks are oceanographic data collection, pollution monitoring and disaster prevention. The issues which have to be resolved in the underwater sensor networks are high energy consumption and low delivery rate. Since the sensor devices are placed under the sea water it is difficult to change the batteries frequently. So maintaining the life time of the sensor nodes is the biggest challenge. There are several methods available to overcome the issue namely VBR, Depth Based Forwarding and Focus Beam Routing protocol. In the existing system, Q-Learning based tracking technique is used to find the next forwarding node based on the residual energy of the individual node. So that number of forwarding will be reduced and energy consumption of the sensor nodes will be reduced. In my proposed work the buffer size is also considered for finding the next forwarder, so that the dropping on the packets will be reduced.

As a new networking paradigm, opportunistic networking communications have great vision in animal migration tracking, mobile social networking, network communications in remote areas and intelligent transportation, and so on. Opportunistic networks are one of the evolutionary mobile ad hoc networks, whose communication links often suffer from frequent disruption and long communication delays. Therefore, many opportunistic forwarding protocols present major security issues, and the design of opportunistic networks faces serious challenges such as how to effectively protect data confidentiality and integrity and how to ensure routing security, privacy, cooperation, and trust management. In this paper, we first systematically describe the security threats and requirements in opportunistic networks; then propose a general security architecture of opportunistic networks; and then make an in‐depth analysis on authentication and access control, secure routing, privacy protection, trust management, and incentive cooperation mechanisms; and at the same time, we present a comparison of various security and trust solutions for opportunistic networks. Finally, we conclude and give future research directions. Copyright © 2014 John Wiley & Sons, Ltd.

The construction of social networks over mobile devices in the events or at locations has emerged as a new network paradigm. These new mobile social networks enable people to communicate and share their experiences without the need to have Internet access and with minimum required infrastructure. However, the functionality and security of such networks would be potentially undermined without an effective trust management scheme. Although many trust management systems have been proposed, few of them can be applied to these new mobile social networks because of the unique network and communication characteristics. This paper presents a novel trust management system, termed MobileTrust, to establish decentralized, secure and reliable trust relationships between mobile ad hoc social network participants. Specifically, the construction of trust models encompasses both scenarios that users are experienced with the network and users are unacquainted with the environment. The trust models cover various important factors of trust relationships in social networks, including the similarity of user profile, reputation, and history of friendship. A set of simulations is conducted to evaluate our system deployed in a mobile social network in the presence of dishonest users.

Rarely the interest in a new networking paradigm has increased at such a velocity as it is happening for software defined networking (SDN). Motivations of this hype of interest are several but the most important can be re-conducted to the following three: (i) SDN simplifies network configuration and management; (ii) SDN makes the network evolvable; (iii) SDN frees operators from vendors' lock-in. Eagerly, in some cases, or reluctantly, in others, both operators and manufacturers of communication and networking equipments have started new lines of research, development, and marketing focused on SDN. A quick look at the list of members of the organizations promoting the development of SDN-related standards suffices to understand that players of the wireless domain are trying to ride this wave as well. However, it is difficult for the observers to understand where such a wave is headed to in very common networking scenarios involving infrastructureless wireless communications. This paper is an attempt to fill this gap. In fact, a major objective of this paper is to analyze (i) what are the advantages of SDN in infrastructureless wireless networking environments such as wireless personal area networks (W-PANs), and (ii) what are the requirements that must be satisfied to apply SDN in W-PANs. Furthermore, a complete SDN solution for W-PANs, named Software Defined Wireless Network (SDWN), is introduced and a prototype implementation is described.

SummaryNetwork virtualization (NV) technologies have attracted a lot of attention as an essential solution for future networking infrastructure. The NV enables multiple tenants to share the same physical infrastructure and to create independent virtual networks (VNs) by decoupling the physical network in terms of topology, address, and control functions. One feasible way to realize full NV involves considering solutions based on the software‐defined networking (SDN) paradigm using its programmability. The SDN contributes many benefits to both network operations and management including programmability, agility, elasticity, and flexibility. There are several SDN‐based NV solutions; however, they suffered from a lack of scalability, high availability. Also, they have high latency between control and data plane because of proxy‐based architecture. In this thesis, we introduce a new NV platform, named Open Network Hypervisor (ONVisor). The design objectives include, among the features, (1) multitenancy, (2) scalability, (3) flexibility, (4) isolated VNs, and (5) VN federation. ONVisor was designed and implemented by extending Open Network Operating System, an open‐source SDN controller. The main features of ONVisor are (1) isolated control and data plane per VN, (2) support of distributed operations, (3) extensible translators, (4) on‐platform VN application development and execution, and (5) support of heterogenous SDN data‐plane implementations. Several experiments are conducted on various test scenarios in different test environments in terms of control and data plane performance compared to nonvirtualized SDN network. The results show that ONVisor can provide VNs a little bit lower control plane performance and similar data plane performance.

Software-Defined Networking (SDN) decouples the control plane and the data plane in network switches and routers, which enables the rapid innovation and optimization of routing and switching configurations. However, traditional routing mechanisms in SDN, based on the Dijkstra shortest path, do not take the capacity of nodes into account, which may lead to network congestion. Moreover, security resource utilization in SDN is inefficient and is not addressed by existing routing algorithms. In this paper, we propose RouteGuardian, a reliable security-oriented SDN routing mechanism, which considers the capabilities of SDN switch nodes combined with a Network Security Virtualization framework. Our scheme employs the distributed network security devices effectively to ensure analysis of abnormal traffic and malicious node isolation. Furthermore, RouteGuardian supports dynamic routing reconfiguration according to the latest network status. We prototyped RouteGuardian and conducted theoretical analysis and performance evaluation. Our results demonstrate that this approach can effectively use the existing security devices and mechanisms in SDN.

Software defined networks (SDN) has gained a lot of attention from both academia and industry recently. SDN is a new networking paradigm that decouples the control plane from the data plane. In this paradigm, control functions are centralized in an SDN controller. The migration from traditional networks to SDN is highly challenging for network operators. Sudden migration may not be possible due to the cost and operational issues. Therefore, incremental deployment of SDN is considered as a viable solution, resulting in the formation of hybrid SDN networks. An important task in hybrid SDN networks is bandwidth allocation and routing considering the coexistence of both conventional and SDN-enabled routers. In this paper, we first formulate this problem as a multi-objective integer program with delay and capacity constraints. Then, a heuristic approach is proposed to combat the computational complexity of the model. Our proposed method is extensively analyzed through simulations, and the evaluation results confirm the effectiveness of our approach.

Weak ties, introduced in the seminal paper by Granovetter [6], refer to people's relationships with acquaintances outside their social circle (i.e., acquaintances with which they interact infrequently). We show that weak ties play an important role on the dissemination of content updates over a mobile social network. From a practical perspective, weak ties can be used to design strategies for limiting the bandwidth usage on such a network, without severely impacting the speed with which the content is disseminated. Moreover, the importance of weak ties can be traced on the effect they have on the edge expansion of the social network. By identifying this relationship, we extend and validate earlier work [7], that characterizes the speed of content dissemination in terms of the network's edge expansion.

Software Defined Networks (SDN) is a networking paradigm that separates the control plane from the data plan of a network, and controls data flow with a SDN controller. This networking model would be useful for ISP (Internet Service Provider) networks in order to control their own networks via the controller. Unfortunately, it is difficult to fully implement SDN in ISP networking due to financial and operational constraints. In this article, we will identify the various migration challenges for hybrid SDN in ISP networks, and investigate on the network planning tools currently available in the market that with regards to facilitate the migration process. Lastly, we will discuss on the future direction of research and development in the field of hybrid SDN migration.

Software-Defined Network (SDN) is a new networking paradigm that adopts centralized control logic and provides more control to the network operators over the network infrastructure to meet future network requirements. SDN controller known as operation system, which is responsible for running network applications and maintaining the different network services and functionalities. Despite all its great capabilities, SDN is facing different security threats due to its various architectural entities and centralized nature. Distributed Denial of Service (DDoS) is a promptly growing attack and becomes a major threat for the SDN. To date, most of the studies focus on detecting high-rate DDoS attacks at the control layer of SDN and low-rate DDoS attacks are high concealed because they are difficult to detect. Furthermore, the existing methods are useful for the detection of high-rate DDoS, so need to focus on low-rate DDoS attacks separately. Hence, the use of machine learning algorithms is growing for the detection of low-rate DDoS attacks in the SDN, but they achieved low accuracy against this attack. To improve the detection accuracy, this paper first describes the attack's mechanism and then proposes a Recurrent Neural Network (RNN) based method. The extracted features from the flow rules are used by the RNN for the detection of low-rate attacks. The experimental results show that the proposed method intelligently detects the attack, and its detection accuracy reaches 98.59%. The proposed method achieves good detection accuracy as compared to existing studies.

Mobile social networks (MSNs) are a kind of delay tolerant network that consists of lots of mobile nodes with social characteristics. Recently, many social-aware algorithms have been proposed to address routing problems in MSNs. However, it also brings more security and privacy concerns. In this paper, we discuss a specific type of Sybil attack in MSNs, which few researches has been focused on. We proposed a security mechanism to detect Sybil nodes and eliminate them to ensure the routing security while routing forwarding. It needs to cooperate by two sides, which is, respectively measuring distance in client side and eliminating Sybil nodes in server side. We also demonstrate the solution is correct and analyze its energy costs.