{"title":"Connected K-coverage problem in sensor networks","authors":"Zongheng Zhou, Samir R Das, Himanshu Gupta","doi":"10.1109/ICCCN.2004.1401672","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401672","url":null,"abstract":"In overdeployed sensor networks, one approach to conserve energy is to keep only a small subset of sensors active at any instant. In this article, we consider the problem of selecting a minimum size connected K-cover, which is defined as a set of sensors M such that each point in the sensor network is \"covered\" by at least K different sensors in M, and the communication graph induced by M is connected. For the above optimization problem, we design a centralized approximation algorithm that delivers a near-optimal (within a factor of O(lg n)) solution, and present a distributed version of the algorithm. We also present a communication-efficient localized distributed algorithm which is empirically shown to perform well","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113971814","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}
Aameek Singh, Priya Mahadevan, A. Acharya, Zon-Yin Shae
{"title":"Design and implementation of SIP network and client services","authors":"Aameek Singh, Priya Mahadevan, A. Acharya, Zon-Yin Shae","doi":"10.1109/ICCCN.2004.1401726","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401726","url":null,"abstract":"Session initiation protocol (SIP) is being widely adopted for VoIP, IM and other collaborative applications due to its simple yet rich functional design. However, one of the main drawbacks has been its per-application deployment (each application using its own SIP stack), leading to narrowly focused development of SIP based services. In this paper, we propose a client-side SIP service and supporting network infrastructure blocks that provide unified mechanisms to execute generic SIP functions. The composition of these building blocks allows for creating richer applications, e.g. a conferencing server coupled with a gaming server provides dynamic conferencing between current occupants of a game room. The main feature of our framework is its availability to all applications including the ones not inherently based on SIP. Also, the SIP service API is designed to be extensible and in addition to providing novel higher level functional primitives like adhoc conferencing and seamless transition of sessions, it also exports a low level interface for specialized applications. Another feature of the service is that it allows a user to plug-in an end device of his/her choice on a per-session basis. We demonstrate the richness of the API by describing prototypes for enhancing various applications as well as new converged applications","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130688711","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":"ForCES protocol design analysis for protection against DoS attacks","authors":"S. Lakkavalli, H. Khosravi","doi":"10.1109/ICCCN.2004.1401737","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401737","url":null,"abstract":"This work discusses a design analysis for the protection of the ForCES protocol against denial of service (DoS) attacks, which is a key requirement for the ForCES protocol. In order to meet this requirement, the control and data messages in the protocol needs to be separated. The separation scheme consists of: (1) separating the congestion aware, control and data transport connections such as TCP connections and (2) gives higher priority for control. The design issues along with the experimental results are discussed.","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131560937","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 effective scheduling method with finer data division for continuous media data broadcasting","authors":"T. Yoshihisa, M. Tsukamoto, S. Nishio","doi":"10.1109/ICCCN.2004.1401688","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401688","url":null,"abstract":"Due to the recent popularization of digital broadcasting systems, broadcasting continuous media data such as music or movies has attracted much attention. In general continuous media data broadcasting, since clients have to wait to receive data before playing it, various methods to reduce waiting time have been studied. Some reduce the waiting time by dividing the data into several segments and broadcasting precedent segments frequently with a single channel. However, by dividing the data into finer segments and producing an effective broadcast schedule, the waiting time can be further reduced. In this paper, we propose an effective scheduling method to reduce waiting time with finer data division","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134405770","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":"SODON: a high availability multi-source content distribution overlay","authors":"Pei Zheng","doi":"10.1109/ICCCN.2004.1401596","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401596","url":null,"abstract":"Multi-source content distribution and file download systems such as BitTorrent and Edonkey emerge as a better scheme than the traditional ftp systems in distributing files to very large scale systems. However, a major drawback of those systems is that they largely rely on a tracker server to maintain state information of a horde. Furthermore, if the peer holding all the pieces of a file leaves the system, there is a high probability that the other peers cannot download the entire file. We propose a scalable and highly available P2P multi-source content distribution system called SODON to solve those problems. SODON distributes all the pieces of a file from a seed to a number of carefully selected sub-seeds in order to guarantee a complete set of pieces that are available for a long time. The sub-seeds also work as sub-trackers to maintain the horde state information. As a result, the original tracker server is not overwhelmed by a large population of download requests. Our traces on BitTorrent and simulation result show that SODON is feasible to build, and the sub-seeding and sub-tracking schemes effectively reduce the tracker load while offering a comparatively high availability of shared files","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133734328","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":"Querying sensor networks: techniques, evaluation, and new directions","authors":"S. Ahmed, Mehmet Rasit Eskicioglu, S. Hussain","doi":"10.1109/ICCCN.2004.1401735","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401735","url":null,"abstract":"Advances in sensor nodes hardware, which comprises sensors, embedded processors, and communication components, have made the large-scale deployment of sensor networks a reality. Various sensor network applications ranging from monitoring to military require sensor nodes to collect data over a continuous time period. The placement, management, and processing of the sensor data necessitates an effective data storage, management and query processing policy. This poster attempts to identify the key query processing techniques in the sensor networks. Design goals and challenges of the query processing techniques are identified. The techniques are evaluated in terms of efficiency, scalability, applicability, and reliability. The evaluation of the techniques is guided by the distinctive query processing features supported by both types of sensor networks, conventional and wide area. Moreover, we argued for the integration of conventional and wide area sensor networks and addressed the integration issues and design goals. In particular, a query processing architecture is proposed to meet the emerging needs of the sensor networks. The architecture addressed the requirements for different layers of the integrated sensor network components such as base stations, sensor nodes, and the workstations in wide area. Additionally, the future research directions for the query processing are outlined","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121187951","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":"Multicast state balancing by using alternate shortest paths","authors":"D. Magoni","doi":"10.1109/ICCCN.2004.1401651","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401651","url":null,"abstract":"The lack of resources in routers becomes a crucial issue with the deployment of state storing protocols such as QoS or multicast ones. In particular, single or any source multicast protocols most probably take over resources up to their limits for maintaining multicast tree information. The aim of this paper is to study the possibility and benefit of using multiple shortest paths in order for a new member to reach a multicast tree. Such a mechanism would not reduce the overall amount of state information in the network but it would distribute this amount more evenly among all routers. The idea is to use an alternate shortest path provided by the underlying unicast routing protocol to avoid a saturated router, that is a router that can not or does not want to store any more multicast state information. As the simulation results are very sensitive to the topology used, we have used as input topology a real public Internet map. We have then simulated our multipath-aware join mechanism upon samples of this map. We have found that depending on the tree size, the use of our mechanism can increase successful join attempts by up to 55% when the network is half saturated","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128987808","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}
M. Görtz, R. Ackermann, Johannes Schmitt, R. Steinmetz
{"title":"Context-aware communication services a framework for building enhanced IP telephony services","authors":"M. Görtz, R. Ackermann, Johannes Schmitt, R. Steinmetz","doi":"10.1109/ICCCN.2004.1401727","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401727","url":null,"abstract":"Communication is an essential part of our daily life. A multitude of devices enable users to communicate everywhere and anytime. One drawback resulting from this ability is the expectation of a caller to always reach the callee. As a consequence the possibility to restrict \"availability for communication\" becomes a necessary feature too. Users demand efficient filtering mechanisms to control incoming calls according to their current context. Communication services should become more user centric and consider context information to adapt to the most suitable behavior. This paper investigates the use of context information to enhance existing SIP call control services and services created with the call processing language (CPL). These context-aware communication services are the proposed approach to cope with the demand for a user centric control of incoming calls. The proposed solutions have been implemented as an extended SIP call control service and an extension to the existing CPL syntax. Currently, location information forms the primary source of context information. Different indoor location sensing systems have been evaluated. Finally, two different kinds of service types have been chosen for evaluation as representatives for the variety of service creation approaches especially in a SIP environment","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125125494","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}