Accepted Papers

  • Interference Suppressing Receiver Technique For Wireless Ad Hoc Networks
    Sunho Park and Byonghyo Shim,Institute of New Media and Communication,Seoul National University, Seoul, Korea
    ABSTRACT
    Recent works on ad hoc network study have shown that achievable throughput can be made to scale linearly with the number of receive antennas even if the transmitter has a single antenna. In this paper, we propose a method pursuing robustness in ad hoc network system when the channel state information (CSI) of interferers is unavailable. The non-parametric linear minimum mean square error (MMSE) filter is exploited to achieve large fraction of the MMSE filter transmission capacity employing the perfect covariance matrix information. The key feature ingredient to make our approach effective is to exploit the autocorrelation of received signal, which obtains the covariance matrix information without transmission rate loss. From the numerical results, we show that the proposed scheme brings substantial transmission capacity gain over conventional MMSE filter using sample covariance matrix.
  • Multiple Metrics Aware and Selectable Routing for Heterogeneous Wireless Sensor Networks
    Dong Wang1, Xinheng Wang1 and Hong-Hsu Yen2, University of the West of Scotland, Paisley, Scotland, UK, and 2Shih HsinUniversity, Taiwan
    ABSTRACT
    The application of heterogeneous wireless sensor networks develops rapidly in recent years. Various wireless sensor nodes with different capacities join in a wireless network and then a large-scale heterogeneous network is formed. With the increasing number of nodes joining in, the network becomes complicated and the problems about network energy consumption and congestion are much more serious. Therefore, it is important to solve these problems with new network analysis models and novel routing protocols. Based on Polychromatic Sets (PS) theory, a network with multiple properties is defined and a multiple properties aware and properties selectable routing is presented in this paper. Based on this routing protocol, a new properties aware optimizing scenario is investigated, while routing protocols can be changed dynamically following the situations of the application. In this paper, two optimizing scenarios considering the optimized energy consumption or optimized QoS are studied respectively. In contrast with traditional geographical routing, this routing protocol improves the performance of energy consumption or QoS distinctly when considering the corresponding properties.
  • An Efficient Deployment Approach for Improved Coverage in Wireless Sensor Networks based on Flower Pollination Algorithm
    Faten Hajjej, Ridha Ejbali and Mourad Zaied,Research Group on Intelligent Machines (REGIM-Lab)Sfax, Tunisia
    ABSTRACT
    Wireless Sensor Networks (WSNs) are experiencing a revival of interest and a continuous advancement in various scientific and industrial fields. WSNs offer favorable low cost and readily deployable solutions to perform the monitoring, target tracking, and recognition of physical events. The foremost step required for these types of ad-hoc networks is to deploy all the sensor nodes in their positions carefully to form an efficient network. Such network should satisfy the quality of service (QoS) requirements in order to achieve high performance levels. In this paper we address the coverage requirement and its relation with WSN nodes placement problems. In fact, we present a new optimization approach based on the Flower Pollination Algorithm (FPA) to find the best placement topologies in terms of coverage maximization. We have compared the performance of the resulting algorithm, called FPACO, with the original practical swarm optimization (PSO) and the genetic algorithm (GA). In all the test instances, FPACO performs better than all other algorithms.
  • A Dynamic Route Discovery Scheme for Heterogeneous Wireless Sensor Networks Based on Polychromatic Sets Theory
    Dong Wang1, Xinheng Wang1 and Hong-Hsu Yen2, University of the West of Scotland, Paisley, Scotland, UK, and 2Shih HsinUniversity, Taiwan
    ABSTRACT
    With the development of new networking paradigms and wireless protocols, nodes with different capabilities are used to form a heterogeneous network. The performance of this kind of networks is seriously deteriorated because of the bottlenecks inside the network. In addition, because of the application requirements, different routing schemes are required toward one particular application. This needs a tool to design protocols to avoid the bottlenecked nodes and adaptable to application requirement. Polychromatic sets theory has the ability to do so. This paper demonstrates the applications of polychromatic sets theory in route discovery and protocols design for heterogeneous networks. From extensive simulations, it shows the nodes with high priority are selected for routing, which greatly increases the performance of the network. This demonstrates that a new type of graph theory could be applied to solve problems of complex networks
Copyright ® GRAPH-HOC 2016