By Topic

Sensor Networks, Ubiquitous, and Trustworthy Computing, 2006. IEEE International Conference on

Date 5-7 June 2006

Go

Filter Results

Displaying Results 1 - 25 of 56
  • IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing - Vol 2 - Workshops - Cover

    Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (185 KB)  
    Freely Available from IEEE
  • IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing - Vol 2 - Workshops - Title Page

    Page(s): i - iii
    Save to Project icon | Request Permissions | PDF file iconPDF (41 KB)  
    Freely Available from IEEE
  • IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing - Vol 2 - Workshops - Copyright

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (52 KB)  
    Freely Available from IEEE
  • AHUC - Table of contents

    Page(s): v - vii
    Save to Project icon | Request Permissions | PDF file iconPDF (35 KB)  
    Freely Available from IEEE
  • CAUL: Table of contents

    Page(s): viii
    Save to Project icon | Request Permissions | PDF file iconPDF (38 KB)  
    Freely Available from IEEE
  • MTUC: Table of contents

    Page(s): xii
    Save to Project icon | Request Permissions | PDF file iconPDF (34 KB)  
    Freely Available from IEEE
  • WCDSN: Table of contents

    Page(s): xvi
    Save to Project icon | Request Permissions | PDF file iconPDF (38 KB)  
    Freely Available from IEEE
  • Message from AHUC-2006 Workshop Co-Chairs

    Page(s): vi
    Save to Project icon | Request Permissions | PDF file iconPDF (35 KB)  
    Freely Available from IEEE
  • Message from CAUL 2006 Workshop Organizers

    Page(s): x
    Save to Project icon | Request Permissions | PDF file iconPDF (38 KB)  
    Freely Available from IEEE
  • Message from MTUC-06 Workshop Chairs

    Page(s): xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (36 KB)  
    Freely Available from IEEE
  • WCDSN Preface

    Page(s): xvii
    Save to Project icon | Request Permissions | PDF file iconPDF (29 KB)  
    Freely Available from IEEE
  • Adaptive Retransmission for Distributed Detection in Wireless Sensor Networks

    Page(s): 2 - 7
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (239 KB) |  | HTML iconHTML  

    An approach combining distributed detection with error-correcting codes has recently been proposed to design a fault-tolerant classification system in wireless sensor networks. The detection result of each sensor must be transmitted to a fusion center for making a final decision. The mis-classification probability using this approach is high when the transmission channel is highly noisy. This work proposes a novel adaptive retransmission algorithm to improve the mis classification probability. The fusion center calculates reliability of each received detection result while making the final decision. When the final decision is not reliable, the sensor which has sent the received result with the lowest reliability will be asked to retransmit its detection result by the fusion center. Simulation results show that the misclassification probability can be effectively reduced through the retransmission View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gathering-Load-Balanced Tree Protocol for Wireless Sensor Networks

    Page(s): 8 - 13
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (296 KB) |  | HTML iconHTML  

    Wireless communications and digital electronics have enabled the development of low-power, low-cost, multifunctional sensors. The functionality of sensor network mainly is the measurement collection. The previous proposed protocols mainly focus on broadcasting tree structure, but it may not be efficient in data gathering. In this paper, we propose novel tree architecture that is a dynamic, adjustable, load-balanced tree in sensor networks to decrease the energy utilization and to prolong the lifetime of sensors. A load-balanced tree can share the forwarding loads between non-leaf nodes. Due to the limit of tree topology, we try to adjust forming a tree that has similar amount of children between non-leaf nodes. When the energy of non-leaf node is lower than a designated threshold, the tree structure can be readjusted to prolong the lifetime of tree. In simulation, we compare our protocol with different adjustment phases and an existed protocol. From the result, our protocol can have better performance than others View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault Estimation and Fault Map Construction on Cluster-based Wireless Sensor Network

    Page(s): 14 - 19
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (243 KB) |  | HTML iconHTML  

    Most applications of wireless sensor networks (WSNs) the sensors are deployed on unfavorable environment such as chemical reactor or battlefield that with high temperature, noise, and interference, could probably incur sensor nodes sense, compute, or communicate improperly. Those also raise error responds to the data collectors. In this paper, a fault estimation model is proposed and can be used to construct the fault map which can be used in WSNs widely, especially in hostile environments. Sensor nodes are transmitting environmental data when it detected with some extra sensed data, such as outward temperature and noise. The fault probability can be estimated and recognized with this extra information using Bayesian belief network (BBN). In this paper, we develop a fault-estimation algorithm is based on the cluster-based framework and show how this model works to find out the probably faulty nodes. Then we simulate and construct the fault map of WSNs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Energy Efficient Data Storage Policy for Object Tracking Wireless Sensor Network

    Page(s): 20 - 25
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (525 KB) |  | HTML iconHTML  

    In wireless sensor networks, storage policy of sensed event affects the number of required control messages. If the number of control message can be reduced, the network lifetime can be increased because transmitting unnecessary control message requires extra energy consumption. In this paper, a local storage method with small control overhead is proposed for object tracking application in wireless sensor network. The main idea is to store the detected events in local storage and maintain the relation of the sensed data through a low cost implicit linked list among sensor nodes. When an object moves across the sensing field, detecting sensor can construct a linked list automatically along moving path of the object. The stored event records can be extracted by tracing the linked list from head to tail to get the complete information. When the memory space in a sensor node is full, a link reconstruction mechanism is proposed to distribute the heavy loads of sensor nodes to nearby nodes. Finally, performance analysis and simulation have been conducted to verify that the proposed method can reduce the amount of control messages and increase the network lifetime View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Passive Self-Configuration MAC Protocol for IEEE 802.11-Based Multi-Hop MANETs

    Page(s): 26 - 31
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (240 KB) |  | HTML iconHTML  

    The paper proposes a passive self-configuration MAC protocol (PSC-MAC) for IEEE 802.11-based multi-hop MANETs. PSC-MAC focuses on determining multiple supervising sets, each of which consists of some power-rich stations, supervisors, to be in charge of the network management. Supervisor determination in PSC-MAC is achieved by a passive manner due to less communication overhead. The main idea of PSC-MAC is beacon interleaving, which guarantees that supervisors in different supervising sets transmit beacons in the different beacon intervals. The proposed rules, deficiency, isolation, and partition rules, enable each station to dynamically and passively transit its role to either a supervisor or a member. Simulation results show that PSC-MAC outperforms IEEE 802.11 and the previous research in terms of supervisor determination, clock synchronization, and energy efficiency View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predicting Time Intervals forResource Availability in MANETs

    Page(s): 32 - 37
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (222 KB) |  | HTML iconHTML  

    In emergency and rescue operations MANETs can help to improve the efficiency of the collaborative work. The goal is to increase the availability of services and information through resource awareness. The work described in this paper, presents our approach towards prediction of current and future resources available on remote devices. Our resource prediction algorithm is based on information extracted from a node's routing protocol. The advantage of this approach is that resource management is not intrusive, does not need location information, and can work with any given routing protocol. We are using simulations with different node mobility models, roasting protocols and communication patterns, to analyze for how far into the future we can make valid predictions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Method of Selecting Stable Paths in Mobile Ad Hoc Networks

    Page(s): 38 - 45
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (280 KB) |  | HTML iconHTML  

    Node mobility is one of dominant factors causing decreased performance in mobile ad hoc networks and restricting network scalability. Selecting stable paths is an effective way to reduce the impact of node mobility. Current methods of selecting stable paths suffer from several shortcomings. They may need a hardware function support for geographical position location or cross-layer function support for sending signal strength information to upper layers. In this paper a new simple method for selecting stable paths is proposed. This method uses a Neighbor Change Ratio metric and does not require any hardware function or cross layer support. The method selects paths which have small hop counts and stable local topologies. An extension to the AODV routing protocol is used as an example of using the Neighbor Change Ratio metric. The resulting NCR-AODV protocol is simulated under various mobility and traffic scenarios. The results show that the NCR-AODV protocol has a lower long path break probability and improved network performance compared to the AODV protocol View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing Calibration Effort for WLAN Location and Tracking System using Segment Technique

    Page(s): 46 - 51
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (435 KB) |  | HTML iconHTML  

    As mobile computing technology becomes more and more mature, people feel great interest on context-aware applications and services. Referring to context, location-aware system is one of the most important components. This paper presents a precise indoor RF-based (IEEE 802.11) locating system named precise indoor locating system (PILS). In order to acquire high level of location estimation result, a large number of training samples should be collected in offline phase. As a result, the system becomes impractical and huge number of man-power is needed. In this paper, we aim to reduce the manual effort in constructing radio map and maintain high accuracy in our system. We propose models for data calibration, interpolating, location estimation, and tracking in PILS. Wireless Channel Propagation model is also in our concern. Large scale and small scale fading are involved in the wireless channel propagation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Intention-Aware Interface for Services Access Enhancement

    Page(s): 52 - 57
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (401 KB) |  | HTML iconHTML  

    An intention-aware services query tool is proposed to enhance the access of services-oriented systems in more efficient and convenient way. The user can request the services by entering a phrase to interact with the system. The system capabilities are represented by a goal structure composed of computable goal models. The request string will be parsed, interpreted and mapped to candidate goal models for representing the user requests. Three types of background knowledge, domain ontology, user's profile and goal structure, are used in the mapping process. The concrete actions of the system, such as user interaction, Web services request generation, and service returned results processing are stored in apian library. The system could refer to the selected goal model and the plan library to generate a plan for user request satisfaction View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple Multi-Secret Sharing Schemes to Achieve the Optimal Maximum Improvement Ratio

    Page(s): 58 - 63
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (200 KB) |  | HTML iconHTML  

    Secret sharing scheme is a way to distribute a secret among several participants in such a way that only qualified subsets of the participants can reconstruct the secret and unqualified subsets have no information about the secret. A multi-secret sharing scheme is the extension of a secret sharing scheme to the case in which there are many secrets need to be shared, and each secret may with different qualified subsets of participants that can reconstruct the secret. The maximum improvement ratio is used to indicate the efficiency of a multi-secret sharing scheme. In 2001, Crescenzo proved a lower bound of the maximum improvement ratio and propose a multi-secret sharing scheme that can achieve this bound. But this scheme must use several complexity theorems that held in some literatures, and in their scheme, the number of participants must decided by the number of secrets. In this paper, we will propose two simple schemes that not only get the same conclusion directly, but also extend this result to all of the case that for any number of participants and secrets such that the number of participants only need to greater than the number of secrets View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Implementation of AES Algorithm with the Multiple Spaces Random Key Pre-Distribution Scheme on MOTE-KIT 5040

    Page(s): 64 - 71
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (227 KB) |  | HTML iconHTML  

    Wireless sensor networks introduce a new way for us to interact with the physical environment. Since wireless sensor networks use radio frequency as the communication medium, chances for the information retrieved by unexpected people are becoming easier and easier. In wireless sensor networks the resources are limited; it seems that AES is a good solution for this communication problem. Beside, a good key pre-distribution scheme is needed to solve the key agreement problem in wireless sensor networks. The main goal of this work is to implement an AES algorithm with the key pre-distribution scheme proposed by Du et al. on MOTE-KIT 5040 produced by crossbow technology. Under our implementation, the actual time of computing a 64-bit secret key is shorter than Du et al.'s and the performance of AES algorithm is better than the AES proposal View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Criteria and Strategies of Ubiquitous Learning

    Page(s): 72 - 77
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (191 KB) |  | HTML iconHTML  

    Recent progress of wireless technologies has initiated a new trend in learning environments, called ubiquitous learning (u-learning), which is able to sense the situation of the learners, and hence provide more adaptive supports. Many researchers have investigated the development of such learning environments; nevertheless, the criteria of establishing a u-learning environment have not been clearly defined, not to mention the strategies for conducting effective learning activities. To cope with these problems, we shall present in this paper the basic criteria of constructing a u-learning environment, such that subsequent researchers can identify and check the necessary items while establishing the learning environment. Moreover, several strategies for conducting u-learning activities are proposed, based on the given criteria View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context Model and Context Acquisition for Ubiquitous Content Access in ULearning Environments

    Page(s): 78 - 83
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (185 KB) |  | HTML iconHTML  

    Context aware ubiquitous access is an interactive model between the context of learners and the content in ubiquitous learning environments. We envision that providing context aware learning content is the first step toward ubiquitous learning by finding right collaborative learners, right learning content and right learning services in the right place at the right time. The major contributions of this paper are the development of our context model and context acquisition. We have developed a context model to formally describe and acquire contextual information pertaining to learners and learning content. Based on this model, we have constructed a context acquisition mechanism for intelligent learning content discovery and access based on learners' surrounding context View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ubiquitous Collaborative Learning in Knowledge-Aware Virtual Communities

    Page(s): 84 - 89
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (623 KB) |  | HTML iconHTML  

    In this paper, we applied peer-to-peer (P2P) and instant messenger (IM) approaches to provide a seamless integration of learning resources. The learning resources contain three categories, namely learning collaborators, content, and services. This seamless learning environment aimed for knowledge sharing in collaboration supported virtual learning communities. Content found by peer-to-peer network refers to the sources of explicit knowledge; while the discussion and interaction details recorded in instant messenger network is the source of tacit knowledge. Interaction occurred in social network can be bi-parties communication, message exchange, file sharing, and knowledge sharing. Results of this study demonstrate that the applied knowledge sharing mechanism helps learning collaborators find right content and related knowledgeable collaborators who are willing to share their knowledge View full abstract»

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