By Topic

Communications (ICC), 2014 IEEE International Conference on

Date 10-14 June 2014

Filter Results

Displaying Results 1 - 25 of 992
  • Index [breaker page]

    Publication Year: 2014 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (32 KB)  
    Freely Available from IEEE
  • Welcome message from general chair

    Publication Year: 2014 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (47 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Welcome message from TPC chair

    Publication Year: 2014 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (38 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2014 , Page(s): 1 - 8
    Save to Project icon | Request Permissions | PDF file iconPDF (84 KB)  
    Freely Available from IEEE
  • Technical program committees

    Publication Year: 2014 , Page(s): 1 - 28
    Save to Project icon | Request Permissions | PDF file iconPDF (110 KB)  
    Freely Available from IEEE
  • Committees

    Publication Year: 2014 , Page(s): 1 - 9
    Save to Project icon | Request Permissions | PDF file iconPDF (81 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2014 , Page(s): 1 - 87
    Save to Project icon | Request Permissions | PDF file iconPDF (398 KB)  
    Freely Available from IEEE
  • Characterization of long term channel variations in industrial wireless sensor networks

    Publication Year: 2014 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (363 KB) |  | HTML iconHTML  

    Wireless sensor networks (WSNs) are being increasingly used for monitoring and control in modern process industries, which until a few years ago were almost exclusively done by cables. In order to successfully integrate WSNs in process industries, proper understanding of the radio channel characteristics is necessary. Predominantly, in control applications, the sensors are static, and variations in the channel are caused by the objects in the region, which move to different locations every now and then. Hence, over a period of several hours, the radio channel will have completely different properties, which will have a significant impact on network performance. In this paper, we conduct and analyze channel measurements in a fully functional factory over a much longer time horizon of 20 hours, which, to the best of our knowledge, have not been undertaken before. A key observation from our analysis is that the radio channel, over a longer time scale, shows a more complicated behavior than over a relatively shorter time period. We also show that if the long-term channel variations are not effectively characterized, then we run the risk of transmitting at a rate, as low as, 94% less than what the channel could actually support. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A decision-support tool for Wireless Sensor Networks

    Publication Year: 2014 , Page(s): 7 - 11
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (316 KB) |  | HTML iconHTML  

    The design of efficient Wireless Sensor Networks (WSN) is a very hot topic nowadays. The efficiency could be observed at many levels, from the application layer to the physical part. In order to get better performances over WSN, many parameters could be considered: the application type, the routing protocol, the MAC protocol, the physical protocol, the radio range of nodes, the topology of the networks. In this paper 1, 2, we present a support-tool that we have developed in order to manage all these parameters in order to help designers to choose the most appropriate value for each parameter involved in the design of efficient solutions based on WSN. This tool has used a learning step where intensive simulations have been conducted. The results of this step allow the platform to suggest the most appropriate parameter for any situation chosen by the designer. The tool could be handled easily with adequate GUI. In addition, it is also able to generate NS-2 scripts in order to check the efficiency of the proposed configurations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing towards a mobile sink using virtual coordinates in a wireless sensor network

    Publication Year: 2014 , Page(s): 12 - 17
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (263 KB) |  | HTML iconHTML  

    Geographical routing can provide significant advantages in wireless sensor networks. However in many sensor networks, it is difficult or costly to find the exact location of the nodes. The virtual coordinate techniques allow a network to acquire a coordinate system without relying on geographical location. In this paper, we describe MS-DVCR, an extension of a state-of-the-art virtual coordinate routing protocol (DVCR) with the ability to route towards a mobile sink. We describe the design principles and implementation of the proposed protocol and through an experimental study, we show that it matches the performance of a simple extension of DVCR for mobile sinks while providing a significantly lower energy consumption. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel compressive sensing based Data Aggregation Scheme for Wireless Sensor Networks

    Publication Year: 2014 , Page(s): 18 - 23
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (204 KB) |  | HTML iconHTML  

    The random distribution of sensors and the irregularity of routing paths lead to unordered sensory data which are difficult to deal with in Wireless Sensor Networks (WSNs). However, for simplicity, most existing researches ignore those characteristics in the designs of Compressive Sensing based Data Aggregation Schemes (CSDAS). Since conventional sparsification bases (e.g., DCT, Wavelets) are inefficient to deal with unordered data, performances of CSDAS with conventional bases are inevitably constrained. In this work, a novel CSDAS which adopts Treelet transform as a sparse transformation tool is proposed. Our CSDAS is capable to exploit both spatial relevance and temporal smoothness of sensory data. Moreover, our CSDAS contains a novel correlation based clustering strategy which is realized with the localized correlation structure of sensory data returned by Treelets and facilitates energy saving of CSDAS in WSNs. Comparative results show the reconstruction error rate with adopting Treelet transform in CSDAS is about 18% lower than that of conventional ones when the normalized energy consumption is 0.3. Even larger performance gain will be obtained at higher energy consumption level. Meanwhile, simulations results further show that our novel correlation based clustering strategy is of great potential. Specially, there is a gain of roughly 35% for total energy savings with our proposed clustering strategy. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial sensing coverage in 3D wireless lattice sensor networks

    Publication Year: 2014 , Page(s): 24 - 29
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (327 KB) |  | HTML iconHTML  

    Although most research in lattice wireless sensor networks are focus on determining the optimal deployment pattern to provide full sensing coverage while maximizing the deployment efficiency, we study the partial sensing coverage problem and the corresponding node saving rate in 3D lattice WSNs. Two popular 3D deployment patterns including cube and triangular prism are considered. The partial sensing coverage and the note saving rate with respect to full sensing coverage are derived through mathematically modeling and theoretical analysis. Research results show that partial sensing coverage is of paramount significance to 3D lattice WSN design and implementation as a large amount of expensive 3D sensors can be saved by sacrificing a small amount of sensing coverage. For example, 38.43% and 22.14% sensors can be saved when providing 0.9864 and 0.9898 sensing coverage with respect to full sensing coverage in a cubic pattern and a triangular prism pattern based lattice WSN respectively. Computer-based simulations results validate the modeling and analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the efficiency of merging procedures in hierarchical mobile cooperative networks

    Publication Year: 2014 , Page(s): 30 - 35
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (754 KB) |  | HTML iconHTML  

    Hierarchical ad hoc networks have gained popularity due to the huge number of mobile devices, as well as the social content distribution which is frequently location based. One major issue of hierarchical networks due to mobility is the overlapping of clusters. The issue is often resolved by merging of overlapping clusters. Some efforts propose immediate merging of clusters, while others suggest contention intervals before merging without detailed analysis of the length of such intervals. The literature lacks a thorough study of the efficiency of merging procedures. This paper represents a comprehensive study of the merging procedures. The paper derives an analytical model to compare the merging procedure with and without applying contention intervals. The effect of varying the length of contention intervals on the cluster stability and energy efficiency is also studied. The results show that adopting contention intervals is not recommended. Instead, to achieve the best energy efficiency when two clusters overlap, the clusters should either merge immediately or avoid merging, depending on the characteristics of the scenario. The analytical results are supported with simulations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information-centric collaborative data collection for mobile devices in wireless sensor networks

    Publication Year: 2014 , Page(s): 36 - 41
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (266 KB) |  | HTML iconHTML  

    The advancement of smart phones enables mobile users to collect data from their surrounding sensors using short-range wireless communication. However, the limited contact time and the wireless capacity constrain the amount of data to be collected by the mobile users. It is crucial for mobile users to collect sensing data that can maximize their data utility. In this paper, we propose a distributed algorithm to provide information-centric ubiquitous data collection for multiple mobile users. The mobile users construct data collection trees adaptively according to their dynamic moving speeds. They prioritize data collection according to the information value carried by the sensing data. The distributed algorithm can support smooth data collection and coordination among multiple mobile users. We evaluate the data utility, energy efficiency and scalability of our solution with extensive simulations. The results showed that our distributed algorithm can improve information value up to 50% and reduce energy consumption to half compared with the existing approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A neighbor collaboration mechanism for mobile crowd sensing in opportunistic networks

    Publication Year: 2014 , Page(s): 42 - 47
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (244 KB) |  | HTML iconHTML  

    Data collection from a crowd of mobile devices is an essential building block of emerging mobile sensing systems. In this paper, we propose an efficient information diffusion protocol for sensor data collection via an opportunistic network. The proposed method detects groups of pedestrians based on the history of radio connectivity between the nodes and maintains a local network (i.e., a cluster) among the detected group members. By collaboratively performing neighbor discovery and link management with the cluster members, it enhances energy-efficiency of the neighbor discovery and minimizes the information delivery delay. Simulation results show that the proposed method can improve the message delivery performance by 16%-83% with equivalent contact probing intervals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CLARET: A Cooperative cLuster-heAd failuRE deTection mechanism for wireless sensor networks

    Publication Year: 2014 , Page(s): 48 - 52
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (311 KB) |  | HTML iconHTML  

    This paper considers the cluster-head failure detection problem in WSNs and proposes a Cooperative cluster-head failure detection (CLARET) mechanism to accurately detect the failure status of a cluster head. The proposed CLARET mechanism allows the cluster head of a cluster to periodically broadcast a “heartbeat” message to all its members and each cluster member to independently detect the status of the cluster head based on the “heartbeat” messages it has received. Furthermore, it introduces a cooperative detection mechanism for a cluster member detecting a potential failure of the cluster head to confirm its detected failure by checking the status information piggybacked in the data packets sent by its neighbors. An analytical model is developed to analyze the false detection probability of CLARET. Simulation results show that the analytical model is basically effective and accurate in evaluating the false detection probability, and CLARET outperforms a traditional cluster-head failure detection mechanism in terms of both the failure detection time and the false detection probability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-channel Directional Medium Access Control for ad hoc networks: A cooperative approach

    Publication Year: 2014 , Page(s): 53 - 58
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (265 KB) |  | HTML iconHTML  

    Directional Medium Access Control protocols (DMACs) have been studied for decades. Since most existing DMACs assume an ideal antenna model which does not consider the minor-lobe interference, their performance cannot be guaranteed in practice. Other approaches assuming non-ideal antenna require either extra equipment or clock synchronization, making the system more complicated. It is also observed that directional transmission is rarely discussed in multi-channel scenarios. In this paper, a Cooperative Multi-channel Directional Medium Access Control protocol (CMDMAC) is proposed, incorporating directional transmission and multi-channel transmission to enhance system performance. Without making the terminals more complex or requiring clock synchronization, CMDMAC uses cooperative methods to solve the hidden terminal and deafness problems, taking into account minor-lobe interference effects of the directional antennas. Protocol performance is studied via simulation in NS2, showing that CMDMAC has good performance in terms of throughput and data packet transmission ratio. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On throughput gain of interference alignment in multi-hop MIMO networks

    Publication Year: 2014 , Page(s): 59 - 64
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (573 KB) |  | HTML iconHTML  

    In this paper, we investigate the potential throughput gain brought by cooperative interference alignment (IA) in multi-hop MIMO networks. Unlike the fully-connected K-user interference network where IA is usually considered, IA cooperations in multi-hop MIMO networks are limited by node density, leading to an inevitable coexistence of IA and non-IA links. Though cooperating links within the same IA group can nullify intra-group interference via IA, uncoordinated inter-group interferences as well as the interferences from non-IA links retain with noises. Hence, whether or not IA can brought throughput gain for such networks is still an open question. In allusion to this question, we firstly extend a cross-layer PHY-MAC model for MIMO networks to jointly abstract the IA and non-IA links with a set of transmission patterns. Then we formulate the problem of throughput-optimal topology control for multi-hop MIMO networks with IA and that without IA and prove their NP-hardness. We further propose integer linear mathematical models for the formulated problems and investigate the benefits of IA cooperations via simulations. Simulation results show that regardless of the number of antennas, IA cooperations do not offer noticeable throughput gain in random networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Hierarchical Data Aggregation using Compressive Sensing (A-HDACS) for Non-Smooth Data Field

    Publication Year: 2014 , Page(s): 65 - 70
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (491 KB) |  | HTML iconHTML  

    Compressive Sensing (CS) has been applied successfully in a wide variety of applications in recent years, including photography, holography, optical system research, facial recognition, and Medical Resonance Imaging (MRI). In wireless sensor networks (WSNs), significant research work has been pursued to investigate the use of CS to reduce the amount of data communicated, particularly in data aggregation applications and thereby improving energy efficiency. However, most of the previous work in WSN has used CS under the assumption that data field is smooth with negligible white Gaussian noise. In these schemes signal sparsity is estimated globally based on the entire data field, which is then used to determine the CS parameters. In more realistic scenarios, where data field may have regional fluctuations or it is piecewise smooth, existing CS based data aggregation schemes yield poor compression efficiency. In order to take full advantage of CS in WSNs, we propose an adaptive aggregation scheme referred to as Adaptive Hierarchical Data Aggregation using Compressive Sensing (A-HDACS). The proposed schemes dynamically determines sparsity values based on signal variations in local regions. We prove that A-HDACS enables more sensor nodes to employ CS compared to the schemes that do not adapt to the changing field. Also, the simulation results demonstrate improvement in energy efficiency and accuracy in signal recovery. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On modulation for magnetic induction based transmission in wireless underground sensor networks

    Publication Year: 2014 , Page(s): 71 - 76
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (357 KB) |  | HTML iconHTML  

    Wireless underground sensor networks (WUSNs) are an emerging and promising research area. The aim of WUSNs is to establish an efficient wireless communication in the underground medium. A magnetic induction (MI)-based waveguide technique has been proposed to overcome the very harsh propagation conditions in WUSNs. In this approach, several resonant relay circuits are deployed between the two nodes to be connected. This technique allows for an extension of the transmission range. In this work, we investigate digital transmission schemes for MI-WUSNs. We analyze the influence of transmission parameters like symbol duration and modulation scheme and propose methods for their optimization. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network connectivity: Stochastic vs. deterministic wireless channels

    Publication Year: 2014 , Page(s): 77 - 82
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (597 KB) |  | HTML iconHTML  

    We study the effect of stochastic wireless channel models on the connectivity of ad hoc networks. Unlike in the deterministic geometric disk model where nodes connect if they are within a certain distance from each other, stochastic models attempt to capture small-scale fading effects due to shadowing and multipath received signals. Through analysis of local and global network observables, we present conclusive evidence suggesting that network behaviour is highly dependent upon whether a stochastic or deterministic connection model is employed. Specifically we show that the network mean degree is lower (higher) for stochastic wireless channels than for deterministic ones, if the path loss exponent is greater (lesser) than the spatial dimension. Similarly, the probability of forming isolated pairs of nodes in an otherwise dense random network is much less for stochastic wireless channels than for deterministic ones. The latter realisation explains why the upper bound of k-connectivity is tighter for stochastic wireless channels. We obtain closed form analytic results and compare to extensive numerical simulations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MMCD: Max-throughput and min-delay cooperative downloading for Drive-thru Internet systems

    Publication Year: 2014 , Page(s): 83 - 87
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (242 KB) |  | HTML iconHTML  

    Advances in low-power wireless communications and micro-electronics make a great impact on a transportation system and pervasive deployment of road-side units (RSU) is promising to provide drive-thru Internet to vehicular users anytime and anywhere. Downloading data packets from the RSU, however, is not always reliable because of high mobility of vehicles and high contention among vehicular users. Using inter-vehicle communication, cooperative downloading can maximize the amount of data packets downloaded per user request. In this paper, we focus on effective data downloading for realtime applications (e.g., video streaming, online game) where each user request is prioritized by the delivery deadline. We propose a cooperative downloading algorithm, namely MMCD, which maximizes the amount of data packets downloaded from the RSU while minimizing delivery delay of each user request. The performance of MMCD is evaluated by extensive simulations and results demonstrate that our algorithm can reduce mean delivery delay while gaining downloading throughput as high as that of a state-of-the-art method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Your friends are more powerful than you: Efficient task offloading through social contacts

    Publication Year: 2014 , Page(s): 88 - 93
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (438 KB) |  | HTML iconHTML  

    In this work, we investigate the distributed and balanced task reassignment in mobile social networks. Previous studies have shown the power of random choice in load balancing with random walking model. Inspired by the `2-choice' paradigm in `ball and bin' theory, we evaluate this simple but effective scheme with real trace data `MobiClique'. According to the preliminary evaluation results, we find that, social relationship significantly differs from pure random walk model, and will bring challenges in task reassignment in the followings: First, friendships are relatively stable, which will lead to imbalanced task assignment. Second, some users meet quite infrequently, which will lead to intolerable time delay and uneven task distribution. In tackling with these challenges, we propose `iTop-K', leveraging the basic concept, i.e., your friends are more powerful than you, which encourages mobile users to assign tasks among intimate friends instead of pure random assignment. With the selection of `top-K' friends, we can achieve load balancing and guaranteed network performance at the same time. Experimental studies verify our scheme and show the effectiveness. In typical working scenario, where real-trace driven simulation is applied, ours outperforms the conventional random choice up to 15×, and the social relationship assignment without priority method up to 9×. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal buffer management policies in DTNs: A POMDP approach

    Publication Year: 2014 , Page(s): 94 - 99
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (158 KB) |  | HTML iconHTML  

    Using Delay Tolerant Networks (DTNs) would facilitate the connection of devices and areas across the world that are under-served by current networks. The DTNs are based on the concept of store-carry-and-forward protocols. A node may store a message in its buffer and carry it for a short or a long period of time, until an appropriate forwarding opportunity arises. A critical challenge is to determine routes through the network without even having an end-to-end connection. In order to increase the probability of message delivery, a known approach is implemented using epidemic message replication. This combination of long-term storage and message replication imposes a high storage and bandwidth overhead. Thus, efficient scheduling and dropping policies are necessary to decide which messages should be discarded when nodes' buffers operate close to their capacity. If a relay buffer is full and needs to store a new packet, it has to decide either to keep the current message or to drop it. This decision depends on the number of transmissions of the message in its buffer and the message which has just arrived. In this paper, a Partially Observed Markov Decision Process (POMDP) framework is proposed to solve the problem of buffer management in DTNs. This modeling technique predicts some properties of the optimal buffer management policy. In addition, numerical examples are presented to illustrate the findings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of imperfect CSI on the performance of random ad-hoc networks

    Publication Year: 2014 , Page(s): 100 - 105
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (170 KB) |  | HTML iconHTML  

    The performance of Wireless Ad hoc Networks (WANETs) depends on the availability of Channel State Information (CSI) on all channels in the network. In this work we study the performance when each receiver has CSI only on the channel from its desired transmitter. We present a novel lower bound on the Ergodic Rate Density of a WANET with partial CSI. The novel bound is compared to a previously known bound and its superiority is demonstrated. We also use the novel bound to study the effect of CSI availability on the WANETs' performance. We show that for Rayleigh fading the CSI-gain of the bound can be up to 78%. But, if each network is optimized with respect to the active transmitter density, then the CSI gain of the bound is at most 13%. Simulation results show the practicality of the novel bound and the accuracy of the CSI-gain expressions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.