By Topic

Asia-Pacific Service Computing Conference, The 2nd IEEE

Date 11-14 Dec. 2007

Filter Results

Displaying Results 1 - 25 of 82
  • The 2nd IEEE Asia-Pacific Service Computing Conference - Cover

    Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (68 KB)  
    Freely Available from IEEE
  • The 2nd IEEE Asia-Pacific Service Computing Conference - Title

    Page(s): i - iii
    Save to Project icon | Request Permissions | PDF file iconPDF (82 KB)  
    Freely Available from IEEE
  • The 2nd IEEE Asia-Pacific Service Computing Conference - Copyright

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (46 KB)  
    Freely Available from IEEE
  • The 2nd IEEE Asia-Pacific Service Computing Conference - TOC

    Page(s): v - ix
    Save to Project icon | Request Permissions | PDF file iconPDF (129 KB)  
    Freely Available from IEEE
  • Message from the General Chair

    Page(s): x
    Save to Project icon | Request Permissions | PDF file iconPDF (97 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Organizing Committee

    Page(s): xi
    Save to Project icon | Request Permissions | PDF file iconPDF (81 KB)  
    Freely Available from IEEE
  • Program Comittee

    Page(s): xii - xv
    Save to Project icon | Request Permissions | PDF file iconPDF (79 KB)  
    Freely Available from IEEE
  • Automated Resource Management Framework for Adjusting Business Service Capability

    Page(s): 3 - 9
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (319 KB) |  | HTML iconHTML  

    The value of business service is depended on efficient resource management in meeting service level agreements (SLAs) with clients and other business objectives. Agreement based resource management in service environment enable service provider to know customer demand in advance and allocate the required resources for the service. However, traditional resource management scheduling systems for the service model have tended to be statically configured and to be non-adaptive at runtime, and have addressed coordination across resources in a limited fashion. In this paper we present a novel resource management framework in which resources can be flexible assigned to business process tasks in an efficient and adaptive way to adjust business service capability when service requirements change. The framework also uniformly accommodates an extensible set of resource types that may be both fine-grained and abstract. In addition, it is highly configurable and extensible in terms of pluggable strategies, and supports flexible runtime adaptation to fluctuating application demand and resource availability. It thus comprises a QoS driven and potentially autonomic resource management facility. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coordinating Service Distribution through Cooperative "YuuZuu" Reservations

    Page(s): 10 - 17
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (680 KB) |  | HTML iconHTML  

    Services are perishable and are simultaneously produced and consumed. A reservation is a traditional and effective means for coordinating service demand and supply. In recent years, computerized reservation systems have been used widely by many service vendors such as airline companies and hotels to improve their profits. In this paper, we propose and describe a "YuuZuu" reservation that motivates cooperation among customers with different preferences for services. It increases utilization of vendor-provided services. The DREAM reservation system, which is an implementation of "YuuZuu" reservation, comprises three functions: (1) reservation allocation, (2) price optimization, and (3) demand prediction. Preliminary experiments show that the DREAM reservation system outperforms a standard reservation system when some customers are insistent upon detailed preferences and others are not, which, we believe, reflects real-world conditions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scenario-Based Petri Net Approach for Collaborative Business Process Modelling

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

    Web services composition techniques provide a practical foundation for business process management in loosely coupled distributed environments. Requirements analysis, however, is still the essential step for launching any commercial systems. Nevertheless, what is needed from the business world and what is available from the IT world remain indistinguishable, that obstructs the way to achieve smooth business collaboration. In order to bridge this gap, a scenario-based Petri Net approach for collaborative business process modelling is proposed. 33 scenarios from 6 projects in recent 10 years are analysed and Petri Nets methodology is used to model the elements in collaborative business process. Finally the requirements are identified from both collaboration levels and abstraction levels based on these scenarios. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Context-Aware Service Matchmaking Method Using Description Logic

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

    The current trend of Web service research is towards automatic service composition. Undoubtedly, service matchmaking is one of the critical problem to achieve the intention. Previous methods concerns service matchmaking considers the problem in a context free manner , in another word, they are domain independent. Obviously, without the consideration of context information, the degree of recall and precision regarding service matchmaking can be significantly declined. In this paper, we formally analyzed the problem using description logic and present a complete solution to resolve it. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Considering Cultural Issues in E-Business Solutions

    Page(s): 33 - 39
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (602 KB) |  | HTML iconHTML  

    This paper addresses cultural issues in e-business solutions. The study explores the preferences of users based on two different culture groups. The paper commenced with the current e-commerce practice of e-commerce implementation on a global level. A survey was conducted to find Australian and Korean users' experiences on global business-to customer (B2C) e-commerce sites. One of the key findings is that different culture background users have dissimilar preferences and purposes of using sites. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Third Parth Subsidy is Not Effective towards Improving the Trading Efficiency for Most E-Business Markets

    Page(s): 40 - 47
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3035 KB) |  | HTML iconHTML  

    Research equipments in China were heavily underutilized. An e-business market was created to allow students to reserve available equipment service time from different universities; however, low trading success rate has been the bottleneck of the market efficiency. A third-party subsidy program is being considered to encourage equipment service providers (sellers) to lower their asking prices; hence it should improve the trading success rate. For varies reasons, most e-business markets have higher than usual price dispersion problems. Third-party subsidy program will not be as effective towards high price dispersal markets. Experimental results confirm that subsidy will provide little improvement towards the overall trading success rate, within a market with high price dispersion problem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Secure Routing Protocol with Malicious Nodes Detecting and Diagnosing Mechanism for Wireless Sensor Networks

    Page(s): 49 - 55
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (393 KB) |  | HTML iconHTML  

    Routing protocol security is the key element in the research of secure wireless sensor networks. Due to its special characteristic, designing security routing protocol is a challenge in these networks. A secure routing protocol with malicious nodes detecting and diagnosing mechanism is used to reduce the malicious nodes' threat to the WSNs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Sink Mobility and Data Diffusion for Lifetime Optimization in Wireless Sensor Networks

    Page(s): 56 - 61
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (195 KB) |  | HTML iconHTML  

    In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularly challenging since we need to consider both mobility scheme and storage constraint. Previous works suggest to use a simple single-hop routing model in which source nodes can only communication with the sink node directly in those mobile networks. However, we notice that this statement is unsuitable for sensor networks with storage constraint because we prove it is a NP-complete problem under single-hop routing model by reducing the traveling salesman problem (TSP) to it in polynomial time. Hence, we try a different way. First we analyze this problem and give a lifetime upperbound, so whether this upperbound is tight is what we concern mostly. Thus, we first construct a 2-approximation O(n2) algorithm to solve the TSP problem, then a novel data diffusion mechanism is built to achieve this upperbound. We prove that under some reasonable assumptions, our algorithm can output this optimal lifetime. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secure Location Verification Using Hop-Distance Relationship in Wireless Sensor Networks

    Page(s): 62 - 68
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (258 KB) |  | HTML iconHTML  

    With the growing prevalence of wireless sensor networks comes a new need for location-based access control mechanisms. Thus we need a method to perform location verification to enforce location-based access to information resources. In this work, a statistic location verification algorithm in randomly deployed sensor networks is proposed. The nodes in the networks are classified to three roles. The claimer broadcasts the position message. The witnesses rebroadcast it and report the distance and lowest hop information to the verifier. The verifier makes use of hypothesis tests to make a decision. At last the simulation results confirm the validation of the algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Energy-Efficient TDMA MAC for Wireless Sensor Networks

    Page(s): 69 - 74
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (300 KB) |  | HTML iconHTML  

    This paper proposes an energy-efficient and collision-free medium access control protocol TDMA-WSN for wireless sensor networks. The protocol is based on time division multiple access (TDMA) principle and reduces energy consumption by avoiding overhearing, collision and idle listening. Nodes in TDMA-WSN build schedules based on information about their neighborhood to determine when they can transmit to their neighbors and when they should listen to the channel or sleep. TDMA-WSN proposes a novel resolution with three-d-hop neighborhood information to avoid collision caused by the two-hop collision-free principle used in some protocols. TDMA-WSN can accelerate passing message by arranging schedule based on routing information from the upper-layer. The simulation results indicate that TDMA-WSN outperforms contention-based protocols (e.g., S-MAC) and scheduling-based protocols (e.g., NAMA) with significant energy savings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy Efficient Multi-rate Based Time Slot Pre-schedule Scheme in WSNs for Ubiquitous Environment

    Page(s): 75 - 80
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (120 KB) |  | HTML iconHTML  

    Nowadays, smart spaces occupy an essential part of ubiquitous computing environment. The spaces integrated with wireless sensors networks, actuators and context-aware services become part of our daily life. Smart spaces are equipped with a large number of wireless sensors that aim to collect large quantities of context information, during the process, there exists a large amount of collisions and energy consumption. Therefore, this paper provides a novel multi-rate based local framing pre-schedule scheme to further reduce collisions and improve energy efficiency in CSMA/TDMA hybrid MAC layer of wireless sensor network. This MAC combines CSMA and TDMA functionalities together while obviates their shortcomings. Having been assigned, slot 0 is preserved as the pre-schedule slot, to inform neighbor nodes the schedule of the senders. During the pre-schedule slot, each node knows exactly the schedule of other neighbor nodes. Multi-rate and power scaling are applied to achieve further energy saving by adpoting an acceptable rate rather than maximum rate. Data rate is dynamically adjusted according to the traffic load of sending nodes, in an energy efficient data rate, to save energy. Being compared with Z-MAC in terms of performances, local framing pre-schedule and multi-rate in this experiment achieved further energy efficiency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Scheduling and Routing for Lifetime Elongation in Surveillance Sensor Networks

    Page(s): 81 - 88
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (219 KB) |  | HTML iconHTML  

    In this paper, we address the problem of lifetime optimization under coverage and connectivity requirements for sensor networks where different targets need to be monitored by different types of sensors running at possibly different sampling rates as well as different initial energy reserve. The problem is particularly challenging since we need to consider both connectivity requirement and so-called target Q-coverage requirement, i.e., different targets may require different sensing quality in terms of the number of transducers, sampling rate, etc. First we formulate this NP-complete lifetime optimization problem, which is general and allows unprecedented diversity in coverage requirements, communication ranges, and sensing ranges. Our approach is based on column generation, where a column corresponds to a feasible solution; our idea is to find a column with steepest ascent in lifetime, based on which we iteratively search for the maximum lifetime solution. To speed up the convergence rate, we generate an initial solution through a novel random selection algorithm. Through extensive simulations, we systematically study the effect of target priorities, communication ranges, and sensing ranges on the lifetime. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Global-Energy-Balancing Real-Time Routing in Wireless Sensor Networks

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

    Many applications in wireless sensor networks like video surveillance have the requirement of timely data delivery. Real-time routing is needed in these applications. Because of the limitation of node energy, energy efficiency is also an important concern in routing protocol design in order to increase the network lifetime. In this paper, we propose a global-energy-balancing routing scheme (GEBR) for real-time traffic based on directed diffusion (DD), which balances node energy utilization to increase the network lifetime. GEBR can find an optimal path in sensor networks for data transfer considering global energy balance and limited delivery delay. Simulation results show that GEBR significantly outperforms DD in uniform energy utilization. GEBR achieves better global energy balance and longer network lifetime. The time for real-time service of the sensor networks using GEBR is prolonged by about 4.37% and the network lifetime is prolonged by 44.6%. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-Access Channel Model for P2P Networks

    Page(s): 94 - 101
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (341 KB) |  | HTML iconHTML  

    Peer-to-peer (P2P) technology encounters serious methodological limitations to guarantee the quality of services (QoS) of P2P networks with very few peers. In this paper, we propose multiple-access channel model (MACM) to merge different P2P networks as a whole to share their data-transfer capability. The model abstracts the interlaced data links between peers as logical data channels according to their spatial-temporal relations. The channels can be subdivided based on multiplex technology and serve different applications at same time. MACM redefines P2P data-packet structure and organizes data packets into time-related groups according to cascade-packet rule to support controllable data-projection between data pools of peers. MACM-based P2P networks can be created as virtual sub-network or virtual-peer bridging strategy so as to improve the performance of P2P networks with few peers but high priorities within Internet protocol television (IPTV) and wireless sensor network (WSN) applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ID-Based Key Agreement for Dynamic Peer Groups in Mobile Computing Environments

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

    In order to secure communications for dynamic peer groups in mobile computing environments, key agreement protocols are required. In this paper, we propose a new key agreement protocol based on identities of mobile users, composed of a basic protocol and a dynamic protocol, for dynamic peer groups. With the basic protocol, an initial secret group key can be achieved in a peer group. By the dynamic protocol, a new secret group key can be reached whenever member or mass join, group mergence, group division, member or mass quit occurs. Our protocol has security features, such as implicit group key authentication, key confirmation, forward secrecy, key independence, and etc. Because our protocol runs in parallel, it is more efficient than those running in series. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Game-Theoretic Approach for Information Sharing

    Page(s): 111 - 121
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (374 KB) |  | HTML iconHTML  

    This paper presents an integrated methodology to support decision making in cooperation through interorganizational information sharing. The methodology employs game-theoretic approach to determine whether it is advantageous to share information between two or three firms, each possessing one piece of information. While a firm in a two-firm situation has to decide either sharing nothing or sharing all, a firm in a three-firm situation has an additional decision to determine with which firm it should form coalition. A scope of this research focuses on two collaborative frameworks: 1) competition- cooperation and 2) co-opetition. Finally, examples are provided to illustrate how the methodology can be used in practice. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Game-Theoretic Approach for Partial Sharing of Information

    Page(s): 122 - 129
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (542 KB) |  | HTML iconHTML  

    This paper presents an integrated methodology to support decision making in cooperation through interorganizational information sharing. The methodology employs game-theoretic approach to determine whether it is advantageous to share information in situations of 1) competition-cooperation and 2) co-opetition. The decision allows partial sharing of information which we quantify on a scale from 0 to 100%. The focus of this research is developing a methodology to determine the optimal strategy to assist decision makers so we limit the choices to three specific shapes for the payoff functions: linear, concave nonlinear, and convex nonlinear. These three types of function; however, capture human behavior. Linear, concave, and convex utility functions are employed for players who prefer risk-neutral, risk averse, and risk loving, respectively. Finally, examples are provided to illustrate how the methodology can be used in practice. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contact Profile Based Routing within Intermittently Connected Mobile Ad-hoc Networks

    Page(s): 130 - 137
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (348 KB) |  | HTML iconHTML  

    Routing in intermittently connected networks(ICN) is a challenging problem due to the time varying nature of network connectivity. In this work, we focus on a special class of ICN formed by mobile ad-hoc participates called ICMAN. Asynchronous contacts become the basic way of communication in ICMANs instead of data links in traditional ad-hoc networks. Current approaches are primarily based on estimation with pure probability calculation. Stochastic forwarding decisions from statistic results can lead to disastrous routing performance when wrong choices are made. This paper introduces a new routing protocol, based on contact profile, to address the problem. To exploit the knowledge about contact profiles, we propose a contact modeling method and the corresponding contact prediction algorithm makes use of both statistic and time sequence information of contacts and allows to choose the relay that has the earliest contact to destination, which results in low average latency. Simulation is used to compare the routing performance of our algorithm with three other categories of forwarding algorithms proposed already. The results demonstrate that our scheme is more efficient in both data delivery and energy consumption than previously proposed schemes. View full abstract»

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