By Topic

Mobile Adhoc and Sensor Systems (MASS), 2012 IEEE 9th International Conference on

Date 8-11 Oct. 2012

Go

Filter Results

Displaying Results 1 - 25 of 32
  • 2012 IEEE 9th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS)

    Publication Year: 2012 , Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (19 KB)  
    Freely Available from IEEE
  • 2012 IEEE 9th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS)

    Publication Year: 2012 , Page(s): 2
    Save to Project icon | Request Permissions | PDF file iconPDF (10 KB)  
    Freely Available from IEEE
  • 2012 IEEE 9th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) - Copyright

    Publication Year: 2012 , Page(s): 3
    Save to Project icon | Request Permissions | PDF file iconPDF (44 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2012 , Page(s): iii - xvii
    Save to Project icon | Request Permissions | PDF file iconPDF (120 KB)  
    Freely Available from IEEE
  • APCAPT: Asymmetric power control against packet tracer attacks for base station location anonymity

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

    Base Station location anonymity is a critical aspect while securing a Wireless Sensor Network (WSN) against local adversarial attacks. WSNs have a wide range of applications where security is a primary concern. Among different security issues, the area of base station (BS) location privacy has been relatively less explored. In this paper, we propose a novel technique to protect the location privacy of the BS against external packet tracer attacks by employing asymmetric power control for the transmissions along the multi hop path between the source and the sink. The transmission range at each sensor node is varied with the objective of minimizing the amount of distance the packet tracer can travel towards the sink, thereby preventing the attacker from tracing packets directly to the BS. We formulate this as an optimization problem and derive the optimal transmission levels for the routing paths to the BS based on our utility that minimizes the mobility of the local adversary. We evaluate the level of security provided by our scheme and measure the overhead involved in terms of additional energy consumed in the network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A game theoretic malicious nodes detection model in MANETs

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

    Network security will face tougher challenges for MANETs due to emerging purposive strategic attacks conducted by smart malicious nodes. All these purposive strategic attacks eventually run out of the throughput which results in network crashes. In this paper, we have proposed a two-level dynamic Bayesian game model to recognize these purposive strategic attacks in MANETs and establish a malicious nodes detection system isolating such attacks. The simulation results have demonstrated that the detection method can effectively enhance cooperation performance and maintain packet forwarding rate under the purposive strategic attacks. Besides, through two-level decision, the system performs well in reducing the missing/false alarming rate, especially suitable for large proportion of malicious nodes in MANETs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codo: confidential data storage for wireless sensor networks

    Publication Year: 2012 , Page(s): 1 - 6
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (150 KB)  

    Many Wireless Sensor Networks (WSNs) are used to collect and process confidential information. Confidentiality must be ensured at all times and, for example, solutions for confidential communication, processing or storage are required. To date, the research community has addressed mainly the issue of confidential communication. Efficient solutions for cryptographically secured communication and associated key exchange in WSNs exist. Many WSN applications, however, rely heavily on available on-node storage space and therefore it is essential to ensure the confidentiality of stored data as well. In this paper we present Codo, a confidential data storage solution which balances platform, performance and security requirements. We implement Codo for the Contiki WSN operating system and evaluate its performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical group key management for wireless mesh networks using multivariate symmetric polynomials

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

    Group communication oriented applications such as multimedia streaming, distant learning, networked gaming, distributed information storage and file sharing can benefit from the community oriented nature of Wireless Mesh Networks (WMNs). However, providing secure group communication services on a WMN platform can be challenging because of the inherent vulnerabilities in wireless broadcasting, distributed network architecture, multi-hop communication and the mobility of mesh clients. Direct implementation of group key management (GKM) schemes developed for wired or other wireless platforms is difficult, if not impossible. Despite these challenges, this paper proposes a symmetric multivariable polynomial based hierarchical GKM with efficient re-keying capabilities. Efficiency in re-keying is achieved by allowing members of the secure communication group to renew the shared traffic encryption key individually and independently upon membership changes. Using the information delivered to the group members during the initial key distribution phase, this renewal process can continue during a group communication session as long as the total number of membership does not reach beyond or fall below a configurable threshold. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Byzantine Attack Isolation in IEEE 802.11 Wireless Ad-Hoc Networks

    Publication Year: 2012 , Page(s): 1 - 5
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (354 KB)  

    This paper introduces an effective solution against Denial of Service (DoS) implemented by byzantine attack in a fully distributed ad-hoc wireless network employing IEEE 802.11. Byzantine attack is the attack performed by a fully trusted node that's turned rogue and already has passed all the authentication and verification processes. When a trusted node is turned rogue, it can easily perform DoS attack on the media access control (MAC) layer to prevent other nodes from communicating. DoS attack is an easy and effective method to disrupt the communications. The byzantine attacker will alter the implementation of the IEEE 802.11 DCF standards to illegally increase the probability of having a successful packet transmitted into the channel on the expense of the other nodes that follow the protocol standards. The solution presented in this paper depends on three stages. First stage is to identify the attacker using mathematical modeling. The second stage utilizes asymmetric cryptography to allow the good nodes communicate to agree on communicating on another frequency and excluding the byzantine attacker, and finally the third stage where the good nodes change the frequency via controlling their transmitters and receivers. The theoretical throughput will be generated using two dimensional Markov Chain to determine the network capacity. Results obtained by the theoretical computations will be used to constantly monitor the network and identify an attacker if present. A cross layer technique will allow the MAC layer to control the Physical layer to change the frequency of the communication session based on the MAC's decision of identifying an attacker. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • T-Hex: true hexagonal regular topology formation in large scale wireless sensor networks

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

    Wireless Sensor Network (WSNs) have seen a steady rise in their popularity and have become an integral part of a large spectrum of applications. Many of these applications advocate the use of large scale WSNs with dense deployments to provide comprehensive sensing coverage. The formation of clusters or overlay networks has been observed to improve the performance of such large scale networks. Furthermore, regular topologies offer many advantages when dealing with networks of this size. Current schemes focus on creating logical or semi-logical regular overlay networks only. In this paper, we present T-Hex, a distributed true hexagonal overlay network formation scheme for large scale networks, where all the nodes chosen to be a part of the overlay network strictly follow the hexagonal topology. We evaluate T-hex by simulating it on a densely deployed WSN, and demonstrate its overlay formation and self-healing capabilities. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel fuzzy HEED security using VEGK for wireless sensor networks

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

    Security is considered a challenge for Wireless Sensor Networks (WSNs) due to the critical information transferred through the collection of smart sensor nodes forming the network. However, due to the energy limitation of these nodes, clustering these nodes can prolong the lifetime of the network. One of the famous clustering algorithms is Hybrid Energy Efficient Distributed Clustering protocol (HEED). At the same time, most of the current clustering protocols are inefficient in terms of cluster head (CH) selection and area coverage. In this paper, we propose a security framework called Virtual ECC Group Key (VEGK) merging Elliptic Curve Cryptography (ECC) with symmetric pairwise keys along with virtual ECC group keys to be used for WSN. In addition, the paper proposes a new fuzzy clustering module as an enhancement to the HEED clustering algorithm for efficient area coverage and network's energy saving. Moreover, we believe that merging the security with clustering will be beneficial to the energy saving in WSN as well. Therefore, another contribution of this paper is to apply the proposed security algorithm during the clustering. Based on different scenarios, our proposed clustering and security frameworks are proved to protect the network from many of the current attacks as well as saving the network energy and enhancing the network coverage. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast verification of an ID-based signature scheme for broadcast authentication inwireless sensor networks

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

    Broadcast authentication is a fundamental security ser- vice in wireless sensor networks (WSNs). Recently, sev- eral public-key-based schemes have been proposed to achieve immediate broadcast authentication with signifi- cantly improved security strength. While the public-key- based schemes obviate the security vulnerability inherent to symmetric-key-based μTESLA-like schemes, their signature verification is time-consuming. Thus, speeding up signa- ture verification is a problem of considerable practical im- portance, especially in resource-constrained environments. This paper presents an accelerated verification of vBNN- IBS, a pairing-free identity-based signature with reduced signature size. A quantitative analysis demonstrates that the accelerated vBNN-IBS reduces 38.62% energy consump- tion in a 4×4 grid-basedWSN and runs 66%faster than the traditional signature verification method. It also allows the total energy consumption to be reduced by up to 23.25% and 25.14% compared to, respectively, IMBAS [1] and EIBAS [13] ID-based broadcast authentication schemes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data-centric anomalies in sensor network deployments: analysis and detection

    Publication Year: 2012 , Page(s): 1 - 6
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (441 KB)  

    Recent real-world sensor network deployments have helped decision makers and sensor data analysts draw highly precise conclusions by relying on finer-grained raw sensory data. A small number of anomalous sensor readings, however, lead to misinterpretations and false conclusions. Hence, detecting and eliminating anomalies in sensor network deployments play a major role during the decision making process by assuring sensor data quality, integrity, and trustworthiness. A sensor network should be able to accurately identify malicious and faulty observations in a timely manner while maintaining a low communication overhead. In this work, we first perform an analysis of anomalies prevalent in sensor network deployments and then propose a distributed data-centric anomaly detection framework for sensor networks where each node in the collection tree is asked to maintain a statistical data summary over a specified period of time. Rather than transmitting raw sensory data, each node only communicates the behavioral summary to the base station. The base station, in turn, learns the behavior of each sensor node and instructs parent `intermediate' nodes in the tree to stop forwarding readings of misbehaving nodes. Given the summaries obtained from all sensor nodes, learning can be performed using existing machine learning techniques. We show that boosting is a good candidate for data classification in sensor networks over a short period of time compared to SVM. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orthogonal cut algorithm for value-based event localization in sensor networks

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

    We investigate the capability of ad-hoc sensor networks equipped with simple sensor devices to enable a more accurate spatial event localization in order to support smart camera networks. We present a novel algorithm named Orthogonal Cut which is suitable for many different event detection scenarios, especially when large interferences occur. It estimates the spatial position of a detected event by dividing the surveillance space of a sensor network into smaller areas until a threshold criteria is met. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-free localization for wireless sensor networks based on neighbor topology

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

    The localization of sensor nodes is one of the key issues for sensor network systems. Therefore, to obtain precise location information, several localization systems have been researched. However, they require an arranged space using a large number of anchor nodes whose locations are well known, or they need advance information such as radio conditions in the space. Otherwise, the systems cannot be used for a space that cannot be arranged in advance with suitable conditions for these systems operation. Furthermore, some localizations assume the use of advanced distance measurements, such as TOA and TDOA, to achieve high accuracy in estimating locations, but these advanced distance measurement schemes cannot be used for ordinary sensor node systems. To resolve these problems, we propose Space-Free Localization for wireless sensor networks. Space- Free Localization requires no distance measurement scheme and no advance information on a space; even then it reproduces a geometry nearly similar to the network¿s original geometry without anchor nodes, and it reproduces a geometry with two anchor nodes that is nearly congruent with the original. Furthermore, using just three anchor nodes, it estimates node absolute localization with high accuracy. Therefore, it can be applied to any space and any sensor node. In this paper, the algorithm of Space-Free Localization is described, and its accuracy based on simulation evaluation is shown. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Online distributed synchronizability check for networks of interconnected systems

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

    The synchronization problem of a network of interconnected systems has been deeply analyzed by the scientific community. In the case of identical systems, under suitable hypotheses, the synchronization depends on the network topology, and specifically on the ratio between the second smallest eigenvalue (algebraic connectivity) and spectral radius of the Laplacian matrix corresponding to the network topology. In this paper a distributed algorithm for the estimation of such a ratio is given, hence providing a distributed synchronizability check for networks of interconnected systems. Simulations results are provided to show the effectiveness of the proposed algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative n-boundary tracking in large scale environments

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

    Monitoring in large scale environments is a typical mission in cooperative robotics. This task requires the exploration of a huge domain by a generally small number of sensor equipped mobile robots. As time restrictions prohibit an exhaustive global search, a sampling strategy is required that allows an efficient spatial mapping of the environment. This paper proposes an adaptive sampling strategy for efficient simultaneous tracking of multiple concentration levels of an atmospheric plume by a team of cooperating unmanned aerial vehicles (UAVs). The approach combines uncertainty and correlation-based concentration estimates to generate sampling points based on already gathered data. The adaptive generation of sampling locations is coupled to a distributed modelpredictive controller for planning optimal vehicle trajectories under collision and communication constraints. Simulation results demonstrate that connectivity of all involved vehicles can be maintained and an accurate reconstruction of the plume is obtained efficiently. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A three-dimensional localization algorithm for wireless sensor networks using artificial neural networks

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (108 KB)  

    Wireless Sensor Networks (WSNs) are being deployed in a variety of location-aware applications, where the measurement of data is meaningless without accurate location. Many localization algorithms have been proposed in the literature. However, localization in threedimensional (3D) space has not been studied sufficiently. Also, artificial neural networks are not commonly used in localization. In this paper, we present a 3D localization algorithm for wireless sensor networks using artificial neural networks. In the proposed scheme, the idea of the 2D localization using neural network is extended to achieve a 3D localization with simplicity, location accuracy, mobility, and low cost. The simulation results depict the performance and the effectiveness of the proposed approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed kalman filtering for noisy consensus networks with time delays

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

    This work focuses on consensus networks consisting of a group of mobile agents in the presence of noise and time delays. Due to noise, exact consensus is never reached. Hence, we propose fully distributed and local Kalman filters that filter only a subset of all system states while maintaining a filter quality close to a global Kalman filter. Feasibility is guaranteed by communicating measurements through the network, introducing time delays. The overall system stability is analyzed. Simulations demonstrate the performance of the proposed distributed filters. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cellular automaton based algorithms for depth adjustment in underwater mobile sensor networks

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

    Three dimensional wireless sensor networks have been extensively studied due, in part, to their applications in underwater sensing. Often algorithmic solutions to analogous problems in two and three dimensions, respectively, can be significantly different. Though there have been many algorithms proposed for two dimensional sensor movement problems, there are very few in the case of three dimensional networks. In this paper we propose cellular automaton based probabilistic depth adjustment algorithms for sensors in underwater networks. Sensors are initially deployed close to the surface and our main goal is to disperse them vertically to maximize the coverage of the network while maintaining the connectivity. We compare our proposed algorithms for three different pairs of communication (Rc) and sensing (Rs) radii. We find that for Rc = 3 and Rs = 1, our algorithm finds the optimal solution. For the other two pairs the algorithm finds solutions that are reasonably close to the used benchmark solutions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indoor wireless sensor localization using mobile robot and RSSI

    Publication Year: 2012 , Page(s): 1 - 6
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (919 KB)  

    Reliable sensor node localization is a critical and difficult task in a large number of wireless sensor networks applications. Received signal strength indication (RSSI) measurements are a simple and inexpensive way to localize mobile robots, but they suffer from large errors due to noise, occlusions, and multi-path specially in indoor environments. Kalman filters and their variations are widely adopted in the community, although the inherent nonlinearity of the problem suggests the use of more general Bayesian techniques. In this paper, we take on the range-only probabilistic localization problem by a mobile robot that depends on RSSI measurements its only information of a sensor node¿s location. We propose a method based on a general Probabilistic Graphical Model and our main contribution is the definition of a reasonable, albeit simple, probabilistic RSSI likelihood model connecting distance to the observed RSSI values. Sensor position estimation is performed by integrating a standard robot's position estimator to our Bayesian estimator. Preliminary experimental evaluation indicates that our methodology leads to low error in sensor node's position estimation. Experiments were performed both by simulation, in the Player/Stage platform, and in a real world scenario, using a 802.11g sensor node and a Pioneer 3AT mobile robot. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HTTP-CoAP cross protocol proxy: an implementation viewpoint

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

    In recent years there has been growing interest for the vision of a so-called Web of Things, which pursues the access to a wide variety of everyday objects through a regular web browser. We believe that this vision is right now at a key moment in its realization, analogous to the '90 for the World Wide Web. The Constrained Application Protocol (CoAP), a web protocol optimized for constrained networks and devices, will hopefully help wireless sensor nodes, a.k.a., smart objects, to become active citizens of the web. Indeed, CoAP has been designed to be easily mapped to HTTP. In this paper we discuss the HTTP mapping of CoAP, and we highlight its different facets and issues. We will describe what are the currently open issues, spanning the deployment of an HTTP-CoAP proxy to the security mapping issues. We also share the authors' experience gained in the design and implementation of two distinct HTTP-CoAP proxies. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating design approaches for smart building systems

    Publication Year: 2012 , Page(s): 1 - 7
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (608 KB)  

    As we are moving towards to the Internet of Things (IoT) era, Wireless Sensor Networks (WSN) in smart buildings delineate the heart of such systems¿ architecture. WSN systems are mature enough to support the IoT vision and different architectural designs and communication protocols are developed to realize this vision. In this paper, two different WSN architectural approaches for smart building systems are presented. In the first one, IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) deployment is used, which is designed specifically for constrained embedded devices. In the second one, the system is developed without the usage of IP. To evaluate these two approaches we implemented a scenario of a smart building environment on top of them. We analyze and compare them, both from theoretical and practical point of view. Finally, as a proof of concept we evaluated them experimentaly in our testbed and we reported our conclusions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connecting the web with the web of things: lessons learned from implementing a CoAP-HTTP proxy

    Publication Year: 2012 , Page(s): 1 - 8
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1367 KB)  

    The Constrained Application Protocol (CoAP) is a lightweight application layer protocol for the Internet of Things. CoAP is based on HTTP mechanisms to build RESTful Web services. In contrast to HTTP, CoAP was designed for machine-to-machine (M2M) communication and uses a binary representation. This allows efficient transport and processing in resource-constrained networks such as Wireless Sensor Networks (WSN). Due to the analogy to REST, a mapping between CoAP and HTTP is possible. In this paper one of the first translating CoAP-HTTP proxies is presented, that provides HTTP clients transparent access to CoAP resources and vice versa. Furthermore, caching relieves CoAP servers, which solves a key challenge for the Internet of Things: to allow a constant/permanent availability of resources from a network of constrained devices, which are required to minimize data transmissions due to their noticeable restrictions in power consumption. We describe, which issues of the translation we found during the time of implementation and testing, and explain how the proxy handles these issues. Finally, an evaluation, using real WSN hardware, is given, and an approximation scheme on how much transmissions can be saved by caching resources is provided. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heterogeneous multi-interface routing: networking stack and simulator extensions

    Publication Year: 2012 , Page(s): 1 - 6
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2429 KB)  

    Most IP routing solutions have been designed to work well for a single communication technology. However, many communication networks consist of a multitude of legacy and new devices using heterogeneous technologies, such as copper wires, optical fibers, wireless and power line communication. In order to leverage the existence of multiple technologies between two devices to achieve availability and robustness, a routing protocol has to solve the problem of addressing multiple interfaces (where each interface supports one communication technology such as copper or wireless), maintaining and exchanging information regarding the involved links and the decision making process when forwarding packets. In this paper we present our extension of the Contiki networking stack uiP with the 1Pv6 routing protocol RPL and of the network simulator Cooja for multiple interfaces, followed by a description and evaluation of a smart grid scenario simulation and a hardware demonstrator. View full abstract»

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