Accepted Papers

  • Flooding Attacks Detection of Mobile Agents in IP Networks
    Jean Tajer, Mo Adda and Benjamin Aziz, University of Portmouth, United Kingdom

    This paper deals with detection of flooding attacks which are the most common type of Denial of Service (DoS) attacks in a Mobile Agent World. We propose a new framework for the detection of flooding attacks by integrating Divergence measures over Sketch data structure. The performance of the proposed framework is investigated in terms of detection probability and false alarm ratio. We focus on tuning the parameter of Divergence Measures to optimize the performance. We conduct performance analysis over publicly available real IP traces, in Mobile Agent Network, integrated with flooding attacks. Our analysis results prove that our proposed algorithm outperforms the existing solutions.

  • Dynamic Curative Mechanism for Geographic Routing in Wireless Multimedia Sensor Networks
    Mohamed Nacer Bouatit and Selma Boumerdassi, Conservatoire National des Arts et Metiers - Paris, France

    Maintaining network stability and extending network lifetime to cope with breaking links and topology changes remain nowadays a unsolved issues in Wireless Multimedia Sensor Networks (WMSNs), which aim to ensure flow delivery while guaranteeing QoS requirements, particularly, during data transmission phase. Therefore, in this paper, we jointly consider multipath transmission, load balancing and fault tolerance, to enhance the reliability of transmitted data. We propose a Dynamic Curative Mechanism for Geographic Routing in WMSNs. Theoricals results and those obtained from simulation study demonstrate the validity and efficiency of our proposed mechanism, and indicate that it is highly advised for multimedia transmission and network stability.

  • Large-Scale Multi-User MIMO Approach for Wireless Backhaul Based HETNETs
    Mostafa Hefnawi, Royal Military College of Canada, Canada

    In this paper, we consider the optimization of wireless capacity-limited backhaul links in future heterogeneous networks (HetNets). We assume that the HetNet is formed with one macro-cell base station (MBS), which is associated with multiple small-cell base stations (SBSs). It is also assumed both the MBS and the SBSs are equipped with massive arrays, while all mobiles users (macro-cell and small-cell users) have single antenna. For the backhaul links, we propose to use a capacity-aware beamforming scheme at the SBSs and MRC at the MBS. Using particle swarm optimization (PSO), each SBS seeks the optimal transmit weight vectors that maximize the backhaul uplink capacity and the access uplinks signal-to-interference plus noise ratio (SINR). The performance evaluation in terms of the symbol error rate (SER) and the ergodic system capacity shows that the proposed capacity-aware backhaul link scheme achieves similar or better performance than traditional wireless backhaul links and requires considerably less computational complexity.

  • Finding an Immuned Path Against Single Primary User Activity in Cognitive Radio Networks
    Sharhabeel H. Alnabelsi, Al-Balqa' Applied University, Jordan.

    Due to recent crowdedness in unlicensed spectrum, a new technology is introduced which allows unlicensed users, known as Secondary Users (SUs), to dynamically access licensed spectrum whenever they are not used by their licensed users, known as Primary Users (PUs). Routing in Cognitive Radio Networks (CRNs) is different from traditional routing in wireless networks, since it requires SUs to periodically sense licensed spectrum, channels availability changes over time, knowledge of tolerated interference by PUs. In this paper, a novel routing discovery technique is proposed to find a primary path, if exist, which is immuned to one PU, such that at most one SU fails (must back off transmission) when a PU becomes active again. Also, a backup path can be discovered using the same technique with the condition that it is channel-link disjoint from the primary path. The problem is modeled using a multi-layer graph where each layer corresponds to a channel in a network. The proposed strategy reduces number of required channel-links maintenance to two, if failed due to one PU activity.

  • Practical Optimization for Wireless Network with Intra-session Network Coding and SIC
    Haiping Wang, Yunxiao Sun and Sanfeng Zhang, Southeast University, Bangladesh

    The individual applications of network coded opportunistic routing and successive interference cancellation have been proven with significant improvement on throughput performance of wireless multihop networks, but there lacks practical optimization on their combination application. Based on a TDMA system, this paper models the throughput maximization as network utility function maximization problem. Applying Lagrangian dual decomposition theory and sub-gradient method, the network utility maximization problem is decomposed into source rate control, routing with NCOR and scheduling under SIC. These three subproblems are solved independently and linked by queue length to achieve coordinating and solve joint maximizing problem of network throughput. To provide practical optimization, this paper implements the joint optimization framework with low-overhead distributed algorithm and verifies its performance through experiments. The numeral results show that the cross-layer combination of NCOR and SIC achieves significant effect on enhancing throughput, improving efficiency and reducing slot overhead, compared to cross-layer or layered models which only consider network coding.

  • Jcwaeed: Joint Channel Assignment and Weighted Average Expected End-To-End Delay Routing Protocol in Wireless Mesh Networks
    Wang Yi-rong1, Wang Yan-ru2, Zhang Hao3, Liu Kai-ming and Li Nan, 1&2Beijing Guodiantong Network Technology Co.Ltd., Beijing, China, 3State Grid Shandong Electric Power Corporation, Economic and Technical Research Institute, Shandong, China

    In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, self-organization, self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-to-end delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.