By Topic

Sensor Networks, Ubiquitous and Trustworthy Computing, 2008. SUTC '08. IEEE International Conference on

Date 11-13 June 2008

Filter Results

Displaying Results 1 - 25 of 100
  • [Front cover]

    Publication Year: 2008 , Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (409 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2008 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (60 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2008 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (113 KB)  
    Freely Available from IEEE
  • [Copyright notice]

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

    Publication Year: 2008 , Page(s): v - xii
    Save to Project icon | Request Permissions | PDF file iconPDF (171 KB)  
    Freely Available from IEEE
  • Foreword

    Publication Year: 2008 , Page(s): xiii - xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (128 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Welcome from the Conference Program Co-Chairs

    Publication Year: 2008 , Page(s): xv
    Save to Project icon | Request Permissions | PDF file iconPDF (121 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Committees

    Publication Year: 2008 , Page(s): xvi - xxi
    Save to Project icon | Request Permissions | PDF file iconPDF (146 KB)  
    Freely Available from IEEE
  • Cyber-Physical Systems: A New Frontier

    Publication Year: 2008 , Page(s): 1 - 9
    Cited by:  Papers (24)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (263 KB) |  | HTML iconHTML  

    The report of the President's Council of Advisors on Science and Technology (PCAST) has placed CPS on the top of the priority list for federal research investment [6]. This article first reviews some of the challenges and promises of CPS, followed by an articulation of some specific challenges and promises that are more closely related to the sensor networks, ubiquitous and trustworthy computing conference. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security Enforcement Model for Distributed Usage Control

    Publication Year: 2008 , Page(s): 10 - 18
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (266 KB) |  | HTML iconHTML  

    Recently proposed usage control concept and models extend traditional access control models with features for contemporary distributed computing systems, including continuous access control in dynamic computing environments where subject attributes and system states can be changed. Particularly, this is very useful in specifying security requirements to control the usage of an object after it is released into a distributed environment, which is regarded as one of the fundamental security issues in many distributed systems. However, the enabling technology for usage control is a challenging problem and the space has not been fully explored yet. In this paper we identify the general requirements of a trusted usage control enforcement in heterogeneous computing environments, and then propose a general platform architecture and enforcement mechanism by following these requirements. According to our usage control requirements, we augment the traditional SELinux MAC enforcement mechanism by considering subject/object integrity and environmental information. The result shows that our framework is effective in practice and can be seen as a general solution for usage control in distributed and pervasive computing environments with widely deployed trusted computing technologies on various computing devices. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • China's National Research Project on Wireless Sensor Networks

    Publication Year: 2008 , Page(s): 19
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (138 KB)  

    This talk will give an overview of the 5-year National Basic Research Program of China (also known as the 973 Program) on Wireless Sensor Networks that was launched in September 2006 and sponsored by the Ministry of Science and Technology. This national research project involves researchers from many major universities in China and Hong Kong, and aims to tackle fundamental research issues rising in three major application domains: coal mine surveillance, water pollution monitoring, and traffic monitoring and control. The distinctive feature of this project is that it will present a systematic study of wireless sensor networks, from node platform development, core protocol design and system solution development to critical problems. This talk will address the research challenges, current progress, and future plans. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong QoS and Collision Control in WLAN Mesh and Ubiquitous Networks

    Publication Year: 2008 , Page(s): 20 - 27
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (195 KB) |  | HTML iconHTML  

    Quality of service (QoS) provisioning is critical to real-time applications such as VOIP and IPTV, but has not been resolved in multihop networks such as mesh and ad hoc networks. For multiple access in ubiquitous networks, energy efficiency is of the single most important design goal, and can be supported through power save and power control techniques. In this paper, we propose a class of MAC protocols based on binary countdown for strong differentiation capability and energy efficiency. A unique advantage for this class of protocols is that the collision rate can be significantly reduced or virtually eliminated. This collision rate issue is often ignored in QoS MAC and sensor MAC protocol designs, but is in fact indispensable for QoS and energy-efficient MAC since service quality will be otherwise considerably degraded due to exponentially increased backoff delay, and energy will be wasted unnecessarily. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construct Small Worlds in Wireless Networks Using Data Mules

    Publication Year: 2008 , Page(s): 28 - 35
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (921 KB) |  | HTML iconHTML  

    A small world phenomenon has been discovered in a wide range of disciplines, such as physics, biology, social science, information system, computer networks, etc. In a wireless network, the small world phenomenon is used in the development of novel routing strategies. However, past studies made use of wire lines as shortcuts to construct a small world in a wireless network. First, it's difficult to determine the length of these wired shortcuts in advance. Second, wired lines are unsuitable in certain circumstances such as rural area, battlefield, etc. They are more costly in deployment and more vulnerable to unexpected damage. Finally, in wireless networks that lack central infrastructures such as mobile ad hoc networks (MANET) and wireless vehicular networks, fixed-length wired line shortcuts cannot be employed. This study proposes a new method to construct a small world in a wireless network. Instead of deploying wired lines as shortcuts. Variable length shortcuts are constructed by using mobile router nodes called data mules. Data mules move data between nodes which don't have direct wireless communication link. These data mules imitate shortcuts in a small world. The small world phenomenon in connected and disconnected wireless networks containing various numbers of data mules is then discussed. Finally the small world phenomenon is considered in wireless sensor networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load Awareness Multi-Channel MAC Protocol Design for Ad Hoc Networks

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

    Exploiting multiple channels improves the system performance in a heavy-loaded wireless ad hoc network. Many multi-channel MAC protocols have been proposed recently. The number of channels being used is fixed for these protocols, which limits their flexibility. As a result, these protocols may suffer from either longer delay in a light-loaded network or higher collision probability in a heavy-loaded one. In this paper, we propose a load awareness multichannel MAC (LAMM) protocol which dynamically adjusts the number of channels being used according to the network load. Our scheme is able to utilize multiple channels to increase throughput when the network is heavily loaded. It can also switch back to use a single channel to reduce transmission delay when the network is lightly loaded. Simulation results verify that our LAMM significantly improves the network performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Reactive Local Positioning System for Ad Hoc Networks

    Publication Year: 2008 , Page(s): 44 - 51
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4265 KB) |  | HTML iconHTML  

    Existing ad hoc location systems measure locations proactively by continuous measurements and communication among all nodes in an ad hoc network. However, in certain location-based applications only a few nodes need the location of a few other nodes, in which case the proactive approach results in an unnecessarily large overhead. We propose a scheme for a reactive ad hoc location system, which avoids the overhead of a proactive scheme by limiting multi- lateration and coordination of coordinate systems to nodes centered around the route between the source node requesting the location and the target node whose location is being requested. Simulations show that our scheme reduces overheads substantially compared to an existing proactive scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Distributed Authentication Framework for Single Sign-On Services

    Publication Year: 2008 , Page(s): 52 - 58
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (224 KB) |  | HTML iconHTML  

    In this paper we present a novel single sign-on scheme known as secure distributed single sign-on (SeDSSO). SeDSSO provides secure fault-tolerant authentication using threshold key encryption with a distributed authentication service. The authentication service consists of n total authentication servers utilizing a (t, n) threshold encryption scheme, where t distinct server-signed messages are required to generate a message signed by the service. SeDSSO provides secure portable identities by defining a two-factor identity that uses both a username/password and a unique USB device. The combination of a distributed authentication service and two-factor identities allows SeDSSO to securely authenticate users in any environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Study on Digital Audio Watermarking Internet Applications

    Publication Year: 2008 , Page(s): 59 - 66
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (321 KB) |  | HTML iconHTML  

    This paper aims to explore the feasibility of embedding Cellophane's QR Code in sound watermarking and conducting simultaneous linkage of hidden information through the principles of psychological and physiological models. In the research, we tried to realize the theory through Visual Basic and observed that different type of music would indirectly affect the identifiably of sound watermarking. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Enhanced Trust Model Based on Reputation for P2P Networks

    Publication Year: 2008 , Page(s): 67 - 73
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (150 KB) |  | HTML iconHTML  

    Trust plays an important role in peer-to-peer (P2P) networks for enabling peers to share resources and services. It is necessary to build an effective security trust model to solve the trust problem during interactions between peers. In this paper, we propose an enhanced trust model based on reputation. We apply SupP2Prep [Chhabra et al., 2004] in our trust model, which is a protocol for reputation management via polling in P2P networks, but with three adjustments. Most of the existing trust models only consider the poll problem from the perspective of trust. Here, we consider voting for peers from the perspectives of both trust and distrust. Our work appears to be the first attempt to incorporate distrust in the polling algorithm. The proposed model is shown to be robust in the presence of attackers through simulation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Security of the Full-Band Image Watermark for Copyright Protection

    Publication Year: 2008 , Page(s): 74 - 80
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (920 KB) |  | HTML iconHTML  

    Digital watermarks have been embedded invisibly in digital media to protect copy rights of legal owners. The embedded watermarks can be extracted to indicate ownership originals. In this paper a robust Full-Band Image Watermark method is investigated by using various attacks on the watermarked image. Image attacks have evolved so much that they are not just destructive, that is, degrading the visual quality of the image, but somehow, constructive, that is, altering the original work in creative ways to make it look as if a new piece of creation. We launched many destructive and constructive attacks on images embedded with our watermarking method to test its security. The experimental results prove that it is very robust against image attacks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Body Sensor Networks for Increased Safety in Bomb Disposal Missions

    Publication Year: 2008 , Page(s): 81 - 89
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (251 KB) |  | HTML iconHTML  

    Bomb disposal manned missions are inherently safety-critical. Wireless sensor network (WSN) technology potentially offers an opportunity to increase the safety of the operatives involved in such missions through detailed physiological parameters monitoring and fusion of "health" information. Wearing heavy armour during bomb disposal manned missions may have side effects that, due to reduction of the body's ability to regulate core temperature in the enclosed environment of the suit, lead to uncompensable heat stress and thus impair the technician's physical or mental ability. Experimental trials have shown no obvious relationship between temperature of any single skin site and the core temperature nor between single point temperature and subjective thermal sensation (usually associated with comfort). Also, core temperature alone may not yield indicators of danger sufficiently early. This paper proposes to integrate a body network of temperature sensors into the bomb disposal suit. The paper describes an in-network sensor data fusion and modelling approach that estimates the overall thermal sensation for the suit wearer, in real time, based on the multi-point temperature data. The case is made for performing the modelling in-network on the basis of reducing communications with the remote mission control point and to better support actuation of an in-suit cooling system. It is also argued that thermal sensation indicators are more useful to present at an on-line remote monitoring station than individual temperatures. The appropriateness of the developed body sensor network (BSN) application is supported by experimental validation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Cloaking Algorithm Based on Spatial Networks for Location Privacy

    Publication Year: 2008 , Page(s): 90 - 97
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (262 KB) |  | HTML iconHTML  

    Most of research efforts have elaborated on k-anonymity for location privacy. The general architecture for implementing k-anonymity is that there is one trusted server (referred to as location anonymizer) responsible for cloaking at least k users' locations for protecting location privacy. A location anonymizer will generate cloaked regions in which there are at least k users for query processing. Prior works only explore grid shape cloaked regions. However, grid shape cloaked regions result in a considerable amount of query results, thereby increasing the overhead of filtering unwanted query results. In this paper, we propose a cloaking algorithm in which cloaked regions are generated acording to the features of spatial networks. By exploring the features of spatial networks, the cloaked regions are very efficient for reducing query results and improving cache utilization of mobile devices. Furthermore, an index structure for spatial networks is built and in light of the proposed index structure, we develop a Spatial-Temporal Connective Cloaking algorithm(abbreviated as STCC). A simulator is implemented and extensive experiments are conducted. Experimental results show that our proposed algorithm out-performs prior cloaking algorithms in terms of the candidate query results and the cache utilization. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Controlled Disclosure of Context Information across Ubiquitous Computing Domains

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

    One of the challenges in ubiquitous computing is that of mobility, which typically requires interaction between intelligent environments in different domains of administration. We present a highly distributed and collaborative system that enables context-aware applications to obtain context information about mobile entities (users or devices) independent of the domain that produces this information. The added value of the system is that it enriches the amount of available context information about these entities in a way that is transparent for applications. In addition, the system shares context information across domains in a controlled manner by taking privacy policies into account, both of the mobile entity as well as of the domains it visits. We discuss the system's architecture, its implementation, and the way we deployed it. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Proxy Signatures For Ubiquitous Computing

    Publication Year: 2008 , Page(s): 106 - 113
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (246 KB) |  | HTML iconHTML  

    Proxy signatures have been extensively used to solve authentication issues in mobile agent applications and authorization problems in distributed systems. However, conventional proxy signatures use traditional public key cryptosystems and are quite heavyweight. Thus, a direct application of these traditional signatures face significant performance challenges when applied to resource constrained ubiquitous computing environments. In this paper, we introduce the use of an efficient cryptographic primitive from linear feedback shift register (LFSR) sequences to build lightweight proxy signatures, suitable for resource constrained devices. We present a novel third-order LFSR sequence- based, 2-party signature scheme, SCLFSR, following a well- known Schnorr signature scheme. Using SCLFSR, we construct an efficient proxy signature, PC LFSR, which can serve as a protocol building block for performance sensitive ubiquitous computing applications. The scheme, PCLFSR, is also the first construction of a proxy signature using primitives from LFSR sequences. We perform extensive theoretical analysis including correctness and security of PCLFSR and also present a performance (computation and communication costs, storage overhead) comparison of the proposed scheme with well-known traditional constructions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sub-optimal Step-by-Step Node Deployment Algorithm for User Localization in Wireless Sensor Networks

    Publication Year: 2008 , Page(s): 114 - 121
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (291 KB) |  | HTML iconHTML  

    User/object localization is one of the promising applications for WSNs. So far, there is no flexible node deployment algorithm targeting on optimizing the localization performance. To facilitate node deployment for localization applications in WSNs, we propose, based on a universal performance evaluation metric, a low-complexity, step-by-step node deployment algorithm which provides sub-optimal solutions feasible for large-scale WSNs. This proposed node deployment algorithm has the computational complexity linearly proportional to the number of available nodes, and is flexible for different system scenarios, including the cases with a non-homogeneous user distribution and with an irregular sensing area. The performance of our proposed algorithm is compared with some other available benchmarks. It is found that the proposed deployment algorithm can provide flexible network topologies with very good location estimation performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neighborhood-Aware Density Control in Wireless Sensor Networks

    Publication Year: 2008 , Page(s): 122 - 129
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (520 KB) |  | HTML iconHTML  

    In dense wireless sensor networks, density control is an important technique for prolonging network's lifetime. However, due to the intrinsic many-to-one communication pattern of sensor networks, nodes close to the sink tend to deplete their energy faster than other nodes. This unbalanced energy usage among nodes significantly reduces the network lifetime. In this paper, we propose neighborhood-aware density control (NADC) to alleviate this undesired effect by reducing unnecessary overhearing along routing paths. In NADC, nodes observe their neighborhoods and dynamically adapt their participation in the multihop network topology. Since the neighborhood information can be easily observed through the overheard information, the density in different regions can be adaptively adjusted in a totally distributed manner. Simulation experiments demonstrate that NADC alleviates the extremely unbalanced workload and extends the effective network lifetime without significant increase in data delivery latency. View full abstract»

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