{"title":"Channel Quality-based Rate Adaptation Scheme for Wireless Networks","authors":"Sunhun Lee, K. Chung","doi":"10.1109/ICOIN.2008.4472758","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472758","url":null,"abstract":"IEEE 802.11 WLANs provide multiple transmission rates to improve the system throughput by adapting the transmission rate to the current wireless channel conditions. Many rate adaptation schemes have been proposed because IEEE 802.11 WLAN standard does not contain any specifications for the rate adaptation scheme. In this paper, in order to overcome limitations of the previous research, we propose a new channel quality-based rate adaptation scheme. The proposed rate adaptation scheme, appropriately adjusts the data transmission rate based on the estimated wireless channel conditions, specifically the measured RSSI at the sender-side. Moreover it continuously updates the thresholds for selecting the transmission rate and selectively enforces the RTS/CTS exchange to adapt the changes in the wireless channel conditions. Through the performance evaluations, we prove that our rate adaptation scheme overcomes the limitations of the previous research and improves the wireless link utilization.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"12 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":"130082467","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":"New Multichannel MAC Protocol for Ad Hoc Networks","authors":"T. Al-Meshhadany, W. Ajib","doi":"10.1109/ICOIN.2008.4472779","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472779","url":null,"abstract":"Since wireless ad hoc networks require a distributed multiple access protocol, the medium access control (MAC) layer can be seen as the bottleneck for the throughput in wireless 802.11-based ad hoc networks. In this paper, we develop a new MAC protocol for multichannel operation in wireless ad hoc networks. The proposed protocol is based on the code division multiple access (CDMA) technique where each spreading code represents one channel. However, the proposed MAC protocol is not limited to CDMA systems. It can be applicable within frequency division multiple access (FDMA) systems (with one radio transceiver) or multi radio systems. We show through computer simulations that our proposition of multichannel MAC protocol significantly improves the communication performance in wireless ad hoc networks.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"61 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":"132455288","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":"Balanced Energy-Efficient Routing in MANETs using Reinforcement Learning","authors":"Wibhada Naruephiphat, W. Usaha","doi":"10.1109/ICOIN.2008.4472784","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472784","url":null,"abstract":"This paper proposes an energy-efficient path selection algorithm which aims at balancing the contrasting objectives of maximizing network lifetime and minimizing energy consumption routing in mobile ad hoc networks (MANETs). The method is based on a reinforcement learning technique called the on- policy Monte Carlo (ONMC) method. Simulation results show that variants of the proposed method can outperform existing schemes such as variants of the conditional max-min battery capacity routing (CMMBR) and the best minimum combined- cost routing algorithm in terms of the long-term average reward which depicts the balance of the tradeoff in dynamic topology environments.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"17 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":"132949345","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}
Ke Zuo, Dongmin Hu, Huaimin Wang, Quanyuan Wu, Liang Su
{"title":"An Efficient Clustering Scheme in Mobile Peer-to-Peer Networks","authors":"Ke Zuo, Dongmin Hu, Huaimin Wang, Quanyuan Wu, Liang Su","doi":"10.1109/ICOIN.2008.4472833","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472833","url":null,"abstract":"With the growing capability of wireless communication and hardware, it is possible to envision networks comprising of a large number of mobile nodes. This kind of networks needs a scalable solution to rapidly deploy and organize these nodes into a functional network. In this paper, we present a clustering scheme based on the Kautz digraph to efficiently solve this problem. We defined nodes identifiers as Kautz strings and used Breadth-First-Search via post-order to travel a well-defined address tree for clusters creation. By formal proof and experimental simulations, our clustering scheme can achieve good performance and effectiveness.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"52 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":"122196123","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":"Processing Sliding Windows over Disordered Streams","authors":"Hyeon Gyu Kim, Myoung-Ho Kim","doi":"10.1109/ICOIN.2008.4472778","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472778","url":null,"abstract":"Bursty and out-of-order tuple arrivals complicate the process of determining the content and boundary of sliding windows. To process windows over such streams, two issues need to be addressed: how to sort input tuples efficiently and how to estimate punctuations. In this paper, we focus on these issues to process sliding windows efficiently and accurately over disordered streams. Regarding the first, we propose an order- preserving hash method to sort input tuples in constant time. Regarding the second, we present an estimation method based on the maximum distance between input tuples and their means. Based on these proposed methods, we finally provide a structure of window operators.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"24 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":"133571997","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}
Hukeun Kwak, Cheong-Ghil Kim, Younghyo Yoon, Myungwon Kim, Dongseung Kim, Kyusik Chung
{"title":"A Method for Optimal Bandwidth Utilization in IEEE 802.11 WLAN Networks","authors":"Hukeun Kwak, Cheong-Ghil Kim, Younghyo Yoon, Myungwon Kim, Dongseung Kim, Kyusik Chung","doi":"10.1109/ICOIN.2008.4472739","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472739","url":null,"abstract":"This paper proposes a load sharing scheme to maximize network bandwidth utilization in IEEE 802.11 WLAN networks using the SSED (Service Set Identifier) hiding. For this purpose, the proposed scheme keeps checking the available bandwidths of a group of wireless routers; selects the most bandwidth-optimal one; makes it visible to clients. Such that, whenever a client connects to a wireless router, only the selected one is visible to it while others are hiding. We implemented the proposed scheme with modifying the firmware of ASUS WL- 500 G wireless router and performed experiments. Experimental results show 35.6% performance increase in the bandwidth utilization compared to the conventional scheme.","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":"126996768","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}
Md. Shariful Islam, Md. Abdul Hamid, C. Hong, B. Chang
{"title":"Preserving Identity Privacy in Wireless Mesh Networks","authors":"Md. Shariful Islam, Md. Abdul Hamid, C. Hong, B. Chang","doi":"10.1109/ICOIN.2008.4472767","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472767","url":null,"abstract":"Wireless mesh network (WMN) has emerged as a key technology for a numerous number of applications because of its ease of deployment, low cost and flexibility of use. WMN infrastructure is a multihop network where mostly the nodes are static in nature. Preserving identity privacy is an important issue in this type of multihop WMN which has been given a little attention in the research community. Compromising privacy may lead an attacker to reveal user's identity, his profiles and gain information about mobility. In this paper, we present an anonymous authentication scheme between mesh client and mesh router for preserving identity privacy and security in data communication in WMN. We have also shown the security and performance analysis of the proposed scheme.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"28 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":"127797483","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}
Dou Jin-feng, Guo Zhongwen, Cao Jiabao, Zhang Guangxu
{"title":"Optimum Transmission Range for Underwater Acoustic Sensor Networks","authors":"Dou Jin-feng, Guo Zhongwen, Cao Jiabao, Zhang Guangxu","doi":"10.1109/ICOIN.2008.4472799","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472799","url":null,"abstract":"An optimum transmission range is presented to prolong the network lifetime for underwater acoustic sensor networks (UASNs). This study is based on the different definitions of the network lifetime and the character of underwater acoustic sensor. The formulation of the optimum transmission range is proposed by the tradeoff between minimizing the energy consumption in network and minimizing the maximum energy consumption in sensor node. Therefore, it provides not only a gauge for performance evaluation of UASNs but also a guideline for the design of UASNs protocols. The predicted results are compared with the measured data and the good agreement is reported.","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":"114169049","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 Energy-Efficient In-network Join for Event Detection in Sensor Networks","authors":"J. Jeon, Myoung-Ho Kim","doi":"10.1109/ICOIN.2008.4472777","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472777","url":null,"abstract":"For energy-efficient event-detection in sensor networks, we can perform an in-network join of two relations, i.e., a sensor table and a condition table, where a condition table is a set of tuples each of which contains condition information about a certain event. In this paper, we propose an in-network method for efficient join of a sensor table and a condition table. We also show through performance experiments that the proposed method works better than the existing method.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"84 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":"115378328","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. R. Huq, Young-Koo Lee, Byeong-Soo Jeong, Sungyoung Lee
{"title":"Towards Building File Sharing and Adaptation Service for Advanced Collaborating Environment","authors":"M. R. Huq, Young-Koo Lee, Byeong-Soo Jeong, Sungyoung Lee","doi":"10.1109/ICOIN.2008.4472769","DOIUrl":"https://doi.org/10.1109/ICOIN.2008.4472769","url":null,"abstract":"Sharing files is very common in collaborative environment. Users may want to share each other's file for more effective and meaningful collaboration. Sometimes it would be preferable to adapt the file so that it can provide the required information to users with minimal overhead. Moreover, users may not want to share files in their original format. Due to device heterogeneity file sharing in original format is less meaningful. Therefore, data adaptation is needed to have the effective file sharing among users. In this paper, we propose a framework for file sharing and adaptation to have effective collaboration among users in advanced collaborating environment. This will certainly enhance the degree of collaboration. Moreover, we propose a hybrid approach for adapting data which considers user preferences and device capabilities at the time of data adaptation. The goal of this adaptation approach is to provide the best possible adaptation strategy based on user preference and device capabilities. Moreover, we discuss about our first prototype implementation here. At it's current stage, our prototype only deals with image files. Our prototype implementation realizes our designed framework and demonstrates the viability of our approach.","PeriodicalId":447966,"journal":{"name":"2008 International Conference on Information Networking","volume":"65 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":"121841616","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}