2007 2nd International Conference on Communication Systems Software and Middleware最新文献

{"title":"Profiling Pseudonet Architecture for Coordinating Mobile Robots","authors":"S. Raghavan, Balaraman Ravindran","doi":"10.1109/COMSWA.2007.382570","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382570","url":null,"abstract":"Area coverage and Navigation are two fundamental requirements for robot applications. When multiple robots are fielded in a scene, coordination through communication becomes a natural pre-requisite. This paper focuses on the area coverage problem and proposes periodic exchange of state information related to location and coverage as a solution. The solution is based on pseudonet communication architecture that enables exchange of messages between the robots by setting up a Bluetooth piconet or scatternet and maintaining the same throughout the process of covering the area.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132749923","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An Analysis of Epidemic Information Access in the PeopleNet Architecture","authors":"V. Srinivasan, M. Motani","doi":"10.1109/COMSWA.2007.382415","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382415","url":null,"abstract":"In this paper, we look at the performance of epidemic information access in PeopleNet-like networks. PeopleNet is based on the idea of wireless virtual social networking, which mimics the way people find information via their social contacts. The basic idea is that people want easy access to information. Information, which is in high demand, can be collected and stored in a central repository or database, e.g., libraries, archives, and web sites. However, there are certain kinds of information which can neither be quantified nor categorized nicely. These kinds of information are typically location specific, community specific and even time-specific and are often found by asking your family, friends, colleagues or people you trust. Our architecture for PeopleNet consists of a multi-tiered architecture of mobile devices and access points, which allow users to navigate for information. We study and simulate the performance of an epidemic style of content dissemination and access in the PeopleNet networks. Our initial analysis indicates that PeopleNet can result in several orders of magnitude improvements over other naive proposals for wireless virtual social networking.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134473327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Location-Based Cooperative Relaying in Wireless Sensor Networks","authors":"P. Coronel, R. Doss, W. Schott","doi":"10.1109/COMSWA.2007.382476","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382476","url":null,"abstract":"In this work, we present a novel routing protocol for energy constrained multi-hop wireless sensor networks. The proposed mechanism exploits the broadcast nature of the wireless channel to enable cooperative relaying in an on-demand manner. It also introduces the concept of leapfrogging that aids in circumventing links with weak channels. Further, in order to achieve energy efficiency, we define a novel metric that takes into account both location as well as channel state information for next-hop selection. The protocol is completely decentralized and preliminary analysis shows that the proposed approach offers significant benefits by reducing the number of (re)transmissions required to reach a destination. This translates into network-wide energy savings that can potentially increase the network lifetime.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122337522","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"RAT: Routing by Adaptive Targeting in Wireless Sensor/Actor Networks","authors":"G. Shah, M. Bozyigit, D. Aksoy","doi":"10.1109/COMSWA.2007.382623","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382623","url":null,"abstract":"Wireless sensor networks have attracted significant interest for various scientific, military, and e-health applications. Recently a new class of sensor networks \"sensor/actuator\" has been introducing new research challenges due to the unique coordination requirements. In particular, actuators that have the capability to move can respond to emergencies with adaptive targeting in comparison to static sink-based target management. In this regard, little work is done in terms of co-existing push and pull data flows in the network. Also positioning of the actuators in response to observations is still an open question. In this paper we propose an adaptive targeting (RAT) protocol that allows dynamic sensor-to-actor communication and actors coordination in response to emergencies. RAT exploits the mobility of actor nodes to form dynamic responsibility clusters, thus ensures an event specific response time to emergencies. Simulation results suggest significant performance improvements in terms of response time and energy conservation.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122338293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Peer-to-Peer Scheme to Discover and Select QoS Enhanced Alternate Paths","authors":"T. Rakotoarivelo, P. Sénac, A. Seneviratne, M. Diaz","doi":"10.1109/COMSWA.2007.382552","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382552","url":null,"abstract":"Increasing number of communication softwares are built on distributed architectures based on the Peer-to-Peer (P2P) model, such as Skype [1], and PeerCast [2]. This model provides several significant benefits, such as deployment scalability, resilience to single points of failure, communication cost sharing, and anonymity. In a former contribution, we proposed an unstructured Super-Peer architecture (SPAD) that further uses the P2P paradigm to provide enhanced Quality of Service (QoS) between two users of these communication softwares. SPAD allows the discovery and use of composite alternate end-to-end paths that experience better delay than the path given by the default IP routing mechanisms. This paper extends SPAD's capabilities to multi-QoS constrained alternate-paths. It presents two extensions: i) the capability to discover alternate paths with better packet-loss and/or delay, ii) multiple schemes to select among the discovered paths the ones that best meets the requirements of the users.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122910326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors","authors":"F. Ingelrest, D. Simplot-Ryl, I. Stojmenovic","doi":"10.1109/COMSWA.2007.382576","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382576","url":null,"abstract":"In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself dominant or neighbor of a dominant node. Application of such a set may for example be broadcasting, where the size of the set greatly impacts on energy consumption. Obtaining small sets is thus of prime importance. As a basis for our work, we use a heuristic given by Dai and Wu for constructing such a set. Their approach, in conjunction with the elimination of message overhead by Stojmenovic, has been recently shown to be an excellent compromise with respect to a wide range of metrics. In this paper, we present an enhanced definition to obtain smaller sets in the specific case where 2-hop information is considered. In our new definition, a node μ is not dominant if there exists in its 2-hop neighborhood a connected set of nodes with higher priorities that covers μ and its 1-hop neighbors. This new rule requires the same level of knowledge used by the original heuristic: only neighbors of nodes and neighbors of neighbors must be known to apply it. However, it takes advantage of some topological knowledge originally not taken into account, that may be used to deduce communication links between 1 -hop and 2-hop neighbors. We provide the proof that the new set is a subset of the one obtained with the original heuristic. We also give the proof that our set is always dominating for any graph, and connected for any connected graph. Two versions are considered: with topological and positional information, which differ in whether or not nodes are aware of links between their 2-hop neighbors that are not 1-hop neighbors. An algorithm for locally applying the concept at each node is described. We finally provide experimental data that demonstrates the superiority of our rule in obtaining smaller dominating sets. A centralized algorithm is used as a benchmark in the comparisons. The overhead of the size of connected dominating set is reduced by about 15% with the topological variant and by about 30% with the positional variant of our new definition.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123878886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Evaluating the Network Processor Architecture for Application-Awareness","authors":"T. S. L. Priya, V. Prasad, D. Kannan, L. Singaram, G. Madhan, R. Sundaram, R. Prasad, R. Parthasarathi","doi":"10.1109/COMSWA.2007.382437","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382437","url":null,"abstract":"The introduction of deep packet inspection technique has enabled the provision of 'application-specific' QoS. Application-aware processing is a natural extension of this 'higher layer header examination' technique. The introduction of multicore, programmable, network processors has largely contributed to this extension. In addition to network-specific services inherently supported by the NP architecture, application-aware services also find a place in the fast path. In this paper, we examine the feasibility and suitability of porting application-aware operations on network processors. We have selected a popular application of content delivery -both text and media, to demonstrate the process of building application awareness in the network, and to critically examine the scalability of the concept. We also propose a generic evaluation methodology for application-awareness on NPs and adopt the same to evaluate the Intel IXP network processor. One of the highlights of this study is the design and evaluation of XML processing on the Intel IXP architecture. The resource utilization for the two case studies indicate that different demanding services can be easily accommodated on the NP, and that the NPs have 'headroom' to support multiple services.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121369429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"S-WOW: Signature based Wake-on-WLAN","authors":"Nilesh Mishra, Dhiraj Golcha, Akhilesh Bhadauria, B. Raman, Kameswari Chebrolu","doi":"10.1109/COMSWA.2007.382460","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382460","url":null,"abstract":"Long distance Wi-Fi links are cost effective alternative to provide Internet and VoIP connectivity, in rural areas. In developing regions these low cost solutions have a challenge of an irregular power supply. In prior research Wake-on-WLAN has been proposed as a way of reducing power consumption by using low power sensor nodes to reduce the duty cycle of the more energy consuming Wi-Fi devices at a node. These sensor nodes wake-up the Wi-Fi device at the link node on receiving 802.11 traffic from neighboring link. The current Wake-on-WLAN implementation scheme suffers with false wake-up due to channel activity generated from noise in the operating frequency of the sensor node. In this work we devise a signature based wake-up mechanism called S-WOW, to avoid the false wake-ups. This is challenging as the sender and the receiver of a signature pattern at a link are operating with heterogeneous radios. Our scheme is robust enough to work in presence of periodic or non-periodic impulsive noise as well as prevents false wake-up when the channel is filled with (noise) energy.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115253972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Disruption-Tolerant Link-level Mechanisms for Extreme Wireless Network Environments","authors":"V. Subramanian, Kadangode K. Ramakrishnan, S. Kalyanaraman","doi":"10.1109/COMSWA.2007.382567","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382567","url":null,"abstract":"Wireless links pose significant challenges in terms of achievable goodput and residual loss-rate. Our recent enhancements, called LT-TCP make TCP loss-tolerant in heavy/bursty erasure environments. Link-level protocols mitigate these problems by using a combination of FEC and ARQ but are insufficient when the channel experiences disruptions. When the underlying source of loss is interference (e.g., 802.11 environments), MAC-level mechanisms misinterpret interference as noise leading to poor scheduling (e.g., capture effects) and limit the benefit of transport layer mitigation efforts. We propose enhancements to link-level protocols that enable survival during disruptions. We explore an adaptive link-level strategy to export a small residual loss rate and bounded latency under high loss/ disruption conditions. We evaluate the proposed link-level enhancements, showing that the combination with LT-TCP helps achieve significant end-to-end performance gains. We also demonstrate the trade-off between reduced link layer residual loss (by increasing ARQ persistence) and transport layer timeouts.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114895636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Possibilities to Estimate Reliability in XML Format Data Communication in Web Based Distributed Applications","authors":"Tuulikki Gyllensvard, T. Stålhane","doi":"10.1109/COMSWA.2007.382479","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382479","url":null,"abstract":"Different possibilities to establish reliability for a web application's communication with an external service provider are examined in this paper. The focus lies on a distributed, two node connection that is using XML messages and various PHP extensions for the communication. Apart from manipulating XML messages or XML Schemas syntax or constraints, it is proposed that some traditional software reliability theory may be used to model the communication. Finally, some ideas on other approaches to model reliability are given.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125461575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}