{"title":"Efficient Data Gathering Mechanism for Mobile Sink node in ZigBee Network","authors":"H. S. Lim, C. Hong","doi":"10.1109/ICOIN.2008.4472786","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472786","url":null,"abstract":"In wireless sensor network, sensors distributed at specific regions sense some data, and a sink node collects data from source nodes. The sink node can be one or few. By supporting mobility, the sink node can stay in different sensor networks, and can gather specific data that is needed. Recently, many researchers and companies like IEEE 802.15.4 working group and ZigBee alliance are trying to implement sensor networks to apply it to real world. However, the selection mechanism of sink nodes supporting mobility to gather sensed data has not been addressed sufficiently. In this paper, we design a mobile sink node selection mechanism which can collect data sensed in ZigBee-based network for processing information.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121395353","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}
Jin-Woo Song, Kwang-Jo Lee, Jung-Suk Han, Sung-Bong Yang
{"title":"Vertex-based Shared Data Allocation in a Mobile Computing System","authors":"Jin-Woo Song, Kwang-Jo Lee, Jung-Suk Han, Sung-Bong Yang","doi":"10.1109/ICOIN.2008.4472765","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472765","url":null,"abstract":"In mobile environments, mobile users transfer and access a great deal of data. In order to enhance user's access speed in a mobile network, replicated servers can be of great help. But usually a limited number of such servers are deployed in a network due to the cost factor. Thus available replicated servers should be located appropriately; they should be placed at the cells where many users visit frequently. In this paper we propose two vertex-based algorithms that calculate the cumulative numbers of shared data accesses by mobile users at the cells and allocates replicated severs at the cell with the largest numbers of accesses. The proposed algorithms exploit users' moving patterns and data access patterns for locating replicated servers in order to maximize the local access hit ratio of users. The experimental results show that the proposed algorithms improve the system performance over a typical algorithm.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123888093","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":"Infrastructure Sharing for Mobile Network Operators; From a Deployment and Operations View","authors":"T. Frisanco, P. Tafertshofer, P. Lurin, R. Ang","doi":"10.1109/ICOIN.2008.4472768","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472768","url":null,"abstract":"The traditional mobile network operator (MNO) business model is based on the carrier's full ownership of the physical network assets. However, rapid and complex technology migration, regulatory requirements, and increasing capital expenditures on one side and competitive environments, saturated markets, and pressure on margins on the other side advocate a new paradigm: the focus on \";critical success factors\"; and \";key assets\";. Simultaneously, telecommunications equipment is commoditized. These trends are paving the way for the sharing of network infrastructure in the core and radio access networks among multiple operators. Challenges arise with regard to technical solutions to enable such business models in a multi-vendor landscape, but also in the context of the principal-agent-problem accompanying the re-allocation of assets and operational duties. This paper investigates the current technological, regulatory, and business landscape from the perspective of sharing network resources, and proposes several different approaches and technical solutions for network sharing. We introduce a model for estimating savings on capital and operating expenses, and present the results of our simulations for the various scenarios. Finally, we assess the benefits of \";Managed Services\"; for the shared network case, a potentially highly attractive model to overcome some of the challenges posed by infrastructure sharing.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129237420","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":"On the Impact of P2P File Sharing Traffic Restrictions on User Perceived Performance","authors":"R. Pereira, T. Vazão","doi":"10.1109/ICOIN.2008.4472802","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472802","url":null,"abstract":"Peer to peer (P2P) file sharing (FS) applications represent, today, the major traffic source on the Internet. Unlike other traffic types, such as HTTP, where the major traffic sources are identifiable, peers are, by definition, spread over the Internet, making it hard for ISPs to architect their networks to accommodate Peer to Peer traffic. In order to alleviate the impact of P2P FS traffic on other applications, ISPs often resort to price strategies based on traffic or traffic shaping techniques, in order to restrict P2P FS applications usage. The success of these initiatives is often limited, as they may aggravate other customers which do not use P2P FS or be circumvented by some of the P2P FS applications, which try to misrepresent their traffic as belonging to other applications. In this paper we study the impact that different methods for P2P FS traffic reduction have on the traffic carried by ISPs and on the download performance perceived by P2P FS users. Through simulation we compared the usage of traffic shaping with the more recent techniques Biased Neighbour Selection (BNS) and Adaptive Search Radius (ASR). We observed that traffic shaping provides ISPs with the fewer traffic savings, especially when compared to the price paid by P2P FS users. BNS and ASR provide similar benefits for users and ISPs. We've also observed that BNS and ASR are complementary technologies, which may be combined in order to achieve higher efficiency.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129589792","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}
Kouji Okada, Hideaki Yoshifuji, K. Muda, R. Wakikawa, Y. Nishida, J. Murai
{"title":"Protocol Design for All-IP Computer Architecture","authors":"Kouji Okada, Hideaki Yoshifuji, K. Muda, R. Wakikawa, Y. Nishida, J. Murai","doi":"10.1109/ICOIN.2008.4472824","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472824","url":null,"abstract":"In this paper, we present a new computer architecture called All-IP computer architecture, which realize a flexible computer re-configuration environment via IP networks. Our new IP-based protocols connect devices to the host computer that were previously limited to a physical attachment. To construct All-IP computer environment, we designed a protocol to manage and discover device resources on IP networks. We also evaluated a protocol called USB/IP, which is expected to be one of the device interconnection protocols in the All-IP computer architecture.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131454439","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 Novel Cross-Layer QoS Routing Algorithm for Wireless Mesh Networks","authors":"C. Liu, K. Leung, A. Gkelias","doi":"10.1109/ICOIN.2008.4472759","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472759","url":null,"abstract":"Wireless mesh networks (WMNs) are expected to support various types of applications with different quality of service (QoS) requirements. Existing works are limited to layered approaches that overlook the interaction between medium access control (MAC) and routing algorithms and often fail to satisfy these requirements in such dynamic wireless environments. The inefficiency of current layered schemes to guarantee these demands has recently triggered the interest for new cross-layered approaches. In this paper, we propose a distributed, multi- constrain, cross-layer QoS routing algorithm for wireless mesh networks that can simultaneous satisfy multiple QoS requirements. Studies with different scheduling algorithms and routing protocols have shown that our algorithm successfully guarantees various QoS requirements and achieves higher network throughput when compared with other standard techniques.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127296463","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":"Data collection in wireless sensor networks using mobile base stations and geographic forwarding","authors":"M. D. Pozzo, V. Tralli","doi":"10.1109/ICOIN.2008.4472781","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472781","url":null,"abstract":"In wireless sensor networks deployed for collecting data related to environmental monitoring a challenging issue is to distribute relaying traffic evenly among the networks nodes to avoid overloads with consequent fast battery depletion of nodes located near base stations. In this paper we address the issue by considering the use of mobile base stations and energy-aware multi-hop geographic forwarding of data packets. Geographic forwarding is able to adaptively build a route for each packet in a dynamic scenario where base stations move, channel fluctuates due to fading, and sensor nodes periodically sleep and wake up to spare energy. More precisely, here we provide a model for offline estimation of traffic load distribution in the network when single/multiple base station move along a trajectory. Moreover, we propose and investigate forwarding strategies which try to trade off energy-efficiency of single packet collection with overload balancing among relays.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125821116","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":"Efficient Load Balancing System for Overlay Multicast","authors":"Kwangman Koh, Sunyoung Han, Euijun Kim","doi":"10.1109/ICOIN.2008.4472823","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472823","url":null,"abstract":"Multicast technology is known as the networking technology for multimedia services. Despite the multicast technology has been practically used in limited environment although it has superior efficiency. In addition, the existing central services providing structures require a solution to solve the performance drop due to overloads in large service environments that targets multiple users. This paper solves the network limitations by using an overlay multicast method. To provide overlay multicast, a proxy server is created and a system is designed to support efficient load balancing among proxy servers. Also, delay time is minimized and an efficient connection algorithm and mechanism on the OMS proxy is provided to materialize an overlay multicast system with improved performance.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128783333","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}
Jaeyeon Kim, Young-Sik Moon, Taekon Kim, Hyungkeun Lee
{"title":"Efficient Polling MAC Scheduler for IEEE 802.11 WLAN","authors":"Jaeyeon Kim, Young-Sik Moon, Taekon Kim, Hyungkeun Lee","doi":"10.1109/ICOIN.2008.4472742","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472742","url":null,"abstract":"Although the Distributed Coordination Function is the fundamental access protocol of IEEE 802.11, it cannot meet the quality of service (QoS) requirements in general. So, the Point Coordinate Function is provided to support QoS related services. However, it has inherent problems. Access point (AP) has no knowledge of the queue status and instantaneous channel condition of stations in the system. In this paper we propose an efficient and versatile polling scheduler that shows excel-lent throughput and fairness performance. Comparison with well known polling schemes is provided through computer simulation under various channel situations including error prone environments.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134262890","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":"Inter-System Handover on a Cellular Level in a Hierarchical Structure","authors":"H. Persson, R. Zander, J. Karlsson","doi":"10.1109/ICOIN.2008.4472738","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472738","url":null,"abstract":"Within this paper a simulation model of a hierarchical structure with three levels with different wireless systems is presented and investigated. The analysis is placed on a cellular level to better understand the user behavior. Modeled is a city environment, where the focus is made on the inter-system handovers between the different wireless systems and how they are affected by the change of different parameters. The results show that inter-system handovers will react differently dependent on what type of handover that is investigated. The results can be used to analyze the influence of mobility, as well as service demands. This can be an effective way to dimensioning cooperating wireless systems and to analyze the effect of introducing a new service or application.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128769663","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}