Oliver Hanka, Christoph Spleiß, Gerald Kunzmann, J. Eberspächer
{"title":"A Novel DHT-Based Network Architecture for the Next Generation Internet","authors":"Oliver Hanka, Christoph Spleiß, Gerald Kunzmann, J. Eberspächer","doi":"10.1109/ICN.2009.12","DOIUrl":"https://doi.org/10.1109/ICN.2009.12","url":null,"abstract":"The Internet architecture of today is the result of a constant evolution during the past 25 years. However, this layering of add-ons, bug fixes and extensions has grown into a tremendously complex and, therefore, increasingly static platform. On the contrary, a multitude of new challenges related to issues never conceived in the original design, such as security and mobility has become more and more important. Hence, we propose a clean-slate approach based on a two-tier locator identifier split. Combined with Distributed Hash-Tables (DHT), we developed a scalable long-term alternative to the current Internet architecture.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122365818","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}
Yuichi Kanamori, K. Kawano, K. Kinoshita, K. Murakami
{"title":"An Effective Dynamic Spectrum Assignment in WiFi/WiMAX Integrated Networks","authors":"Yuichi Kanamori, K. Kawano, K. Kinoshita, K. Murakami","doi":"10.1109/ICN.2009.43","DOIUrl":"https://doi.org/10.1109/ICN.2009.43","url":null,"abstract":"With advances in communication technologies, network services provided via the Internet have been widely diversified, and people can use these services not only via wired networks but also via wireless networks. There are several wireless systems in practical use such as Cellular, WiMAX and WiFi. Although these wireless network systems have developed independently of each other, they should be integrated for seamless access by users. On the other hand, each system uses an individual spectrum prescribed by law to avoid radio interference. To overcome this problem, dynamic spectrum access technology receives much attention. We propose a dynamic spectrum assignment method in which a WiFi system temporarily uses a spectrum band of the WiMAX system in WiFi/WiMAX integrated networks to reduce call blocking probability of multimedia communication services. We confirm the effectiveness of the proposed method by simulation experiments.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125078966","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":"Energy Aware Database Updating Protocols for Autoconfigurable Sensor Networks","authors":"C. Diallo, Ashish Gupta, M. Becker, M. Marot","doi":"10.1109/ICN.2009.36","DOIUrl":"https://doi.org/10.1109/ICN.2009.36","url":null,"abstract":"In this paper, we propose two database updating models for homogeneous and auto configurable sensor network deployed in a truck without base station. In the first model, a Virtual Base Station (VBS) is periodically elected to act as classical base station for a given period of time. VBS election algorithm is based on the remaining energy level of each node at the time of selection of the VBS. The second idea deals with Energy aware Wait and See (WaS) protocol which manages update requests to avoid collisions. Like VBS, this protocol is also based on energy. Simulation results show that VBS and WaS models introduce very low overhead with respect to the classical network with permanent base station.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121373970","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}
Hiroshi Tokito, Masahiro Sasabe, G. Hasegawa, H. Nakano
{"title":"Routing Method for Gateway Load Balancing in Wireless Mesh Networks","authors":"Hiroshi Tokito, Masahiro Sasabe, G. Hasegawa, H. Nakano","doi":"10.1109/ICN.2009.21","DOIUrl":"https://doi.org/10.1109/ICN.2009.21","url":null,"abstract":"Wireless mesh networks have been attracting many users in recent years to achieve a wide-area wireless environment with flexible-configuration and low-cost properties by connecting base stations (mesh nodes) with each other via wireless connections. When the wireless mesh networks are used as an infrastructure for Internet access, all network traffic from mobile nodes go through a gateway node which is directly connected to the wired network. Therefore, we need to distribute the entire traffic load by deploying multiple gateway nodes and each mesh node should select a gateway node to access the Internet according to its traffic load, processing power, and access link capacity. In this paper, we propose a routing method that distributes the traffic load on the gateway nodes. Through several simulations, we show that the proposed method can uniformly distribute the traffic load on gateway nodes, keeping the time complexity and suppressing an increase in the path length at most 15% compared to the conventional shortest path routing.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114238862","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 Approach to Data Extraction and Visualisation for Wireless Sensor Networks","authors":"Mohammad Hammoudeh, R. Newman, S. Mount","doi":"10.1109/ICN.2009.17","DOIUrl":"https://doi.org/10.1109/ICN.2009.17","url":null,"abstract":"Ever since Descartes introduced planar coordinate systems, visual representations of data have become a widely accepted way of describing scientific phenomena. Modern advances in measurement and instrumentation have required increasingly sophisticated visual representations, to ensure that scientists can quickly and accurately interpret increasingly complex data. Most recently, wireless sensor networks (WSNs) have emerged as a technology which is capable of collecting a vast amount of data over space and time. The sheer volume of the data makes it difficult to be interpreted by humans into meaningful insights. This presents a number of challenges for developers of visualisation techniques which seek to ``map'' the data sensed by a network. Visualisation techniques helps to turn large amounts of raw data into credible visual information such as graphs, charts, or maps, that can assist in understanding of the meaning of that data. In this paper we propose a map as a suitable data visualisation and extraction tool. We aim to develop an in-network distributed information extraction and visualisation service. Such a service would greatly simplify the production of higher-level information-rich representations suitable for informing other network services and the delivery of field information visualisation.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"1986 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120849152","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}
F. Vanhaverbeke, M. Moeneclaey, K. Laevens, N. Degrande, D. D. Vleeschauwer
{"title":"Video Quality Protection Strategies for HDTV in the Presence of Buffer Overflow","authors":"F. Vanhaverbeke, M. Moeneclaey, K. Laevens, N. Degrande, D. D. Vleeschauwer","doi":"10.1109/ICN.2009.10","DOIUrl":"https://doi.org/10.1109/ICN.2009.10","url":null,"abstract":"We investigate the impact of Forward Error Correction (FEC) and retransmissions on the video quality of packetized HDTV video flows with possible buffer overflow at the ingress node of the video network. The use of protection is a mixed blessing. On the one hand, it increases the packet rate associated with each video flow (due to overhead), which results in a higher buffer overflow probability. On the other hand, protection allows for the recovery of lost packets, which alleviates the problem of buffer overflow. It turns out that the overall impact of FEC and retransmission is very beneficial for the video quality. Moreover, retransmissions clearly outperform FEC, and can ensure HDTV video quality up to loads at the ingress node close to one.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121483476","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":"Solutions and Comparison of Performance to the Key Technologies of PIM-SM under ForCES Architecture's Router","authors":"Chuanhuang Li, Weiming Wang","doi":"10.1109/ICN.2009.47","DOIUrl":"https://doi.org/10.1109/ICN.2009.47","url":null,"abstract":"The update of many stats and timers maintained in PIM-SM protocol relies on the current forwarding results of multicast packets on FE. There is a new challenge to the realization of the protocol in ForCES architecture router because the main body of PIM-SM is running on CE under ForCES architecture. In this paper, we analyze key technologies of PIM-SM in the ForCES architecture router, and present their possible solutions. We also implement the ForCES router test bed according to the solutions. Through the experiment results, some detailed comparison and performance analysis are finally made in this paper.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121496084","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":"Combining Reliability and Economic Incentives in Peer-to-Peer Grids","authors":"Hailong Sun, J. Huai","doi":"10.1109/ICN.2009.32","DOIUrl":"https://doi.org/10.1109/ICN.2009.32","url":null,"abstract":"Peer-to-peer grids emerge as the convergence of grid computing and peer-to-peer technologies. In p2p grids, unreliability and free-riding are two serious problems that must be effectively solved. Existing studies are concerned with either of the two problems, while we believe they are closely related for building a practical p2p grid system. Our goal is to ensure consumer tasks can be reliably executed while the economic revenue of service peers is maximized. In this work, we combine reliability and economic incentives to achieve such a goal. First, we design a scheme to determine the minimum reliability threshold based on the bidding price of a consumer. Second, we propose a group of scheduling heuristics to obtain the approximately maximum revenue of service providers in p2p grids. Finally, we perform extensive simulations to evaluate the effectiveness of our solution.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"275 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814927","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}
Fereidoun Ahourai, M. Tabandeh, M. Jahed, Bahman Afsari
{"title":"A Fair Routing Algorithm for Wireless Mesh Networks Based on Game Theory","authors":"Fereidoun Ahourai, M. Tabandeh, M. Jahed, Bahman Afsari","doi":"10.1109/ICN.2009.69","DOIUrl":"https://doi.org/10.1109/ICN.2009.69","url":null,"abstract":"Knowing the capabilities of game theory in analyzing environment consisting of many decision-makers or agents, it has been the goal of many researchers to apply Game Theory analyses in computer and telecommunication networks. One of the main subjects in the networks based on the viewpoint of Game Theory is routing problems in special networks.In this paper, routing in Wireless Mesh Networks, which are growing and developing rapidly, is studied as an example for routing in computer and telecommunication networks and a new model for such networks is proposed based on Non-cooperative Game Theory. It is proposed to solve this model by a heuristic method essentially based on simulated annealing in order to obtain a better routing method than traditional methods. This routing is implemented in OMNET++ simulator and compared with available routing methods in OMNET++.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130237843","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}
T. Bchini, N. Tabbane, S. Tabbane, E. Chaput, A. Beylot
{"title":"QoS in IEEE 802.16e for VoIP and Video with Mechanism of Soft Handover – FBSS in Highway","authors":"T. Bchini, N. Tabbane, S. Tabbane, E. Chaput, A. Beylot","doi":"10.1109/ICN.2009.54","DOIUrl":"https://doi.org/10.1109/ICN.2009.54","url":null,"abstract":"This evaluation is intended to show through simulations, the performance of FBSS Handover mechanism in the case of high speed mobility with mobile WIMAX for multimedia. The model we propose for the evaluation, is close to a real case in life, where it is made up of a highway between two cities far from 145 km and responsible of vehicles traveling in both directions with relatively high speeds and variable between 70 and 130 km/h. The passengers in vehicles are equipped with terminals adapted to the IEEE 802.16e better known as the \"mobile WiMAX\". As a result we will suppose that the terminals exchange traffics such as VoIP and video with base stations for a real time of 100 minutes. The highway is covered by 6 base stations, whose range is a 14 km (radius) and every two base stations belong to the same ASN. So, we will evaluate the QoS of this mobility model, which uses the mechanism of Handover: Fast Base Station Switching (FBSS) during the passage of vehicles between WIMAX cells, through the measures that we will obtain by simulations. The simulations were conducted under the mobility module NIST of the simulator NS2.29.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121259692","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}