Users demand not only seamless continuation but also high throughput of Internet access as they hop across different administrative domains and heterogeneous networks during an ongoing session. By extending the multiple care-of addresses registration based on mobile IPv6, the proposed mechanism may provide seamless access with soft handoff notion as well as high throughput with automatically selecting the best link among multiple interfaces when the wireless channel continuously changes. Moreover, our mechanism can fit for any access technologies because only layer three modification and techniques (like packet pair) are required. The simulation result shows the proposed scheme outperforms the conventional mobile IPv6 in both seamless continuation and throughput. This study also provides a further insight on the issues of multiple interfaces and heterogeneous networks, which can promote the technology of next generation wireless network.
{"title":"Multiple Care-of Addresses Registration and Capacity-Aware Preference on Multi-Rate Wireless Links","authors":"Jen-Yi Pan, Jing Lin, Kai-Fung Pan","doi":"10.1109/WAINA.2008.154","DOIUrl":"https://doi.org/10.1109/WAINA.2008.154","url":null,"abstract":"Users demand not only seamless continuation but also high throughput of Internet access as they hop across different administrative domains and heterogeneous networks during an ongoing session. By extending the multiple care-of addresses registration based on mobile IPv6, the proposed mechanism may provide seamless access with soft handoff notion as well as high throughput with automatically selecting the best link among multiple interfaces when the wireless channel continuously changes. Moreover, our mechanism can fit for any access technologies because only layer three modification and techniques (like packet pair) are required. The simulation result shows the proposed scheme outperforms the conventional mobile IPv6 in both seamless continuation and throughput. This study also provides a further insight on the issues of multiple interfaces and heterogeneous networks, which can promote the technology of next generation wireless network.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130626263","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}
One of recent efforts for mobile computing in IETF is a network-based localized mobility management (NetLMM) approach. In the NetLMM approach Proxy Mobile IPv6 (PMIPv6) is one of proposed solutions to support a localized mobility management for a mobile node (MN). In PMIPv6, a PMIP client is a main entity responsible for sending messages on behalf of an MN whenever the MN hands off across access points (APs) within a local mobility domain (LMD). As multiple PMIP clients are configured in the LMD for redundancy and load balance concerns, a selection of PMIP client has to be carefully considered on the overall network performance. Thus, in this paper, we propose two distance-based PMIP client selection schemes - the nearest PMIP client selection scheme and the furthest PMIP client selection scheme. The proposed distance-based selection schemes, where an MN is registered via the nearest or the furthest PMIP client, announce the distance information of PMIP client, so that the PMIP selection is achieved by considering the distance between the PMIP client and the current attachment.
{"title":"An Investigation of Distance-Based Proxy Mobile Client Selection Schemes for NetLMM","authors":"Jong‐Hyouk Lee, Yeongdeok Kim, Tai-Myung Chung","doi":"10.1109/WAINA.2008.94","DOIUrl":"https://doi.org/10.1109/WAINA.2008.94","url":null,"abstract":"One of recent efforts for mobile computing in IETF is a network-based localized mobility management (NetLMM) approach. In the NetLMM approach Proxy Mobile IPv6 (PMIPv6) is one of proposed solutions to support a localized mobility management for a mobile node (MN). In PMIPv6, a PMIP client is a main entity responsible for sending messages on behalf of an MN whenever the MN hands off across access points (APs) within a local mobility domain (LMD). As multiple PMIP clients are configured in the LMD for redundancy and load balance concerns, a selection of PMIP client has to be carefully considered on the overall network performance. Thus, in this paper, we propose two distance-based PMIP client selection schemes - the nearest PMIP client selection scheme and the furthest PMIP client selection scheme. The proposed distance-based selection schemes, where an MN is registered via the nearest or the furthest PMIP client, announce the distance information of PMIP client, so that the PMIP selection is achieved by considering the distance between the PMIP client and the current attachment.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130646488","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}
It is desirable for the IP packet size variability of real time traffic classes to be small. This enables the adoption of schedulers such as weighted round robin, which are of low complexity and, under the assumption of approximately constant packet sizes, are suitable to real time traffic. Compressed video exhibits high variability in different time scales, so video smoothing techniques have been developed in order to reduce bit rate variability. This facilitates resource allocation to video streams. In particular, it may lead to schedulers that assume constant bit rate (CBR) on a per interval basis, as most smoothing techniques lead to a sequence of intervals of CBR. One such scheme is a version of weighted Round Robin scheduling. We carry out an experiment using traces of compressed video (MPEG-4) in order to establish how easily they can be packetised into fixed size packets.
{"title":"Packet Size Variability in Real Time Transmission of Smoothed MPEG-4 Streams","authors":"R. Pereira, E. Pereira","doi":"10.1109/WAINA.2008.107","DOIUrl":"https://doi.org/10.1109/WAINA.2008.107","url":null,"abstract":"It is desirable for the IP packet size variability of real time traffic classes to be small. This enables the adoption of schedulers such as weighted round robin, which are of low complexity and, under the assumption of approximately constant packet sizes, are suitable to real time traffic. Compressed video exhibits high variability in different time scales, so video smoothing techniques have been developed in order to reduce bit rate variability. This facilitates resource allocation to video streams. In particular, it may lead to schedulers that assume constant bit rate (CBR) on a per interval basis, as most smoothing techniques lead to a sequence of intervals of CBR. One such scheme is a version of weighted Round Robin scheduling. We carry out an experiment using traces of compressed video (MPEG-4) in order to establish how easily they can be packetised into fixed size packets.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123384316","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}
Applications that rely on the publish-subscribe model (such as those dedicated to news or event distribution) require a communication model whereby information can flow towards any interested receiver rather than towards set destinations. Content-based communication is a style of communication that perfectly fits the needs of such applications. Yet supporting this kind of communication in partially or intermittently connected mobile ad hoc networks (MANETs) is still a challenge, for end-to-end content-driven routing structures can hardly be constructed and maintained in such environments. In this paper we provide an overview of a protocol we designed to support opportunistic, delay-tolerant, content- based communication in a disconnected MANET. We also describe our project of using this protocol to implement a peer-to-peer, Usenet-inspired discussion system.
{"title":"Towards a Usenet-Like Discussion System for Users of Disconnected MANETs","authors":"J. Haillot, F. Guidec","doi":"10.1109/WAINA.2008.71","DOIUrl":"https://doi.org/10.1109/WAINA.2008.71","url":null,"abstract":"Applications that rely on the publish-subscribe model (such as those dedicated to news or event distribution) require a communication model whereby information can flow towards any interested receiver rather than towards set destinations. Content-based communication is a style of communication that perfectly fits the needs of such applications. Yet supporting this kind of communication in partially or intermittently connected mobile ad hoc networks (MANETs) is still a challenge, for end-to-end content-driven routing structures can hardly be constructed and maintained in such environments. In this paper we provide an overview of a protocol we designed to support opportunistic, delay-tolerant, content- based communication in a disconnected MANET. We also describe our project of using this protocol to implement a peer-to-peer, Usenet-inspired discussion system.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"2021 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114027020","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. Mubarak, Sara Sultana, Zarrar Khan, H. F. Ahmad, H. Asghar, H. Suguri
Strong mobility is the movement of code, data and execution state of distributed entities from one computational unit to another. General issues related to strong mobility are inefficiency and increased code overhead. Our main concern is to optimize strong mobility to improve performance and reliability. This paper proposes an architecture namely "strongly instrumented generic mobility architecture (SIGMA)" that significantly increases efficiency and thereby reduces code overheads. This helps to achieve reliability and fault tolerance. Java is the choice of implementation for the proposed architecture but it restricts access to the execution state of a thread. Therefore, achieving strong mobility in a way that software quality parameters like portability, efficiency and reliability are preserved becomes a challenging task. To achieve these parameters, the paper realizes the implementation of strong mobility using byte code instrumentation technique in the form of a generic plug-in named SIGMA. Performance evaluation of the proposed system shows significant efficiency improvement and reduced code overhead.
{"title":"Strongly Instrumented Generic Mobility Architecture (SIGMA)","authors":"M. Mubarak, Sara Sultana, Zarrar Khan, H. F. Ahmad, H. Asghar, H. Suguri","doi":"10.1109/WAINA.2008.221","DOIUrl":"https://doi.org/10.1109/WAINA.2008.221","url":null,"abstract":"Strong mobility is the movement of code, data and execution state of distributed entities from one computational unit to another. General issues related to strong mobility are inefficiency and increased code overhead. Our main concern is to optimize strong mobility to improve performance and reliability. This paper proposes an architecture namely \"strongly instrumented generic mobility architecture (SIGMA)\" that significantly increases efficiency and thereby reduces code overheads. This helps to achieve reliability and fault tolerance. Java is the choice of implementation for the proposed architecture but it restricts access to the execution state of a thread. Therefore, achieving strong mobility in a way that software quality parameters like portability, efficiency and reliability are preserved becomes a challenging task. To achieve these parameters, the paper realizes the implementation of strong mobility using byte code instrumentation technique in the form of a generic plug-in named SIGMA. Performance evaluation of the proposed system shows significant efficiency improvement and reduced code overhead.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124321554","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}
Mahmoud M. Nasreldin, H. Aslan, M. El-Hennawy, A. El-Hennawy
Broadband wireless access security becomes more complicated when wireless devices are added to the network. Threats are ranked according to the level of risk they present. Authentication in WiMax (IEEE 802.16) will be examined using different protocols. This paper reflects to most recent work of the IEEE and WiMax forums and it can be used to prioritize future research directions in Wireless security.
{"title":"WiMax Security","authors":"Mahmoud M. Nasreldin, H. Aslan, M. El-Hennawy, A. El-Hennawy","doi":"10.1109/WAINA.2008.190","DOIUrl":"https://doi.org/10.1109/WAINA.2008.190","url":null,"abstract":"Broadband wireless access security becomes more complicated when wireless devices are added to the network. Threats are ranked according to the level of risk they present. Authentication in WiMax (IEEE 802.16) will be examined using different protocols. This paper reflects to most recent work of the IEEE and WiMax forums and it can be used to prioritize future research directions in Wireless security.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124488965","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}
Rich information from various data sources has been recognized for enabling people to perform an efficient decision-making and problem-solving. According to thousands of data sources and numerous information types available at the edge of the Internet, the discovery of all potential data sources are needed to facilitate the procurement of rich information. However, current P2P approaches are limited to the discovery of potential data sources in which the number of data sources does not cause tremendous consequences for decision-making and problem-solving. In this paper, we thus propose WindChimer, a partially centralized and controlled P2P system that hybridly combines network topology of structured and unstructured P2P systems. Our experiments showed that the partially centralized and controlled topology enables an efficient discovery of all potential peers as per a given information type. This was accomplished via (i) acceptable number of messages sent throughout the network; (ii) high messaging accuracy for propagating the message to potential peers; and (iii) effective scalability when adding more peers. However, it is currently applicable for low degree of transient peer population, and sustainable data sources of organizations only.
{"title":"WindChimer: The Partially Centralized and Controlled P2P System for Better Discovery","authors":"J. Phengsuwan, N. Sahavechaphan","doi":"10.1109/WAINA.2008.234","DOIUrl":"https://doi.org/10.1109/WAINA.2008.234","url":null,"abstract":"Rich information from various data sources has been recognized for enabling people to perform an efficient decision-making and problem-solving. According to thousands of data sources and numerous information types available at the edge of the Internet, the discovery of all potential data sources are needed to facilitate the procurement of rich information. However, current P2P approaches are limited to the discovery of potential data sources in which the number of data sources does not cause tremendous consequences for decision-making and problem-solving. In this paper, we thus propose WindChimer, a partially centralized and controlled P2P system that hybridly combines network topology of structured and unstructured P2P systems. Our experiments showed that the partially centralized and controlled topology enables an efficient discovery of all potential peers as per a given information type. This was accomplished via (i) acceptable number of messages sent throughout the network; (ii) high messaging accuracy for propagating the message to potential peers; and (iii) effective scalability when adding more peers. However, it is currently applicable for low degree of transient peer population, and sustainable data sources of organizations only.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124133601","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}
Grid computing is to enable coordinated resource sharing in dynamic, distinct virtual organizations, which are consisted of different grid entities from traditional organizations. Grid security must ensure secure and authorized access to grid services in such dynamic, heterogeneous and unpredictable gird environment. The main current security solution is applying trust as an important factor to the gird computing to realize cooperation between unknown entities.However, most of the research work inherites the conception of trust from peer-to-peer network and is not accurately satsified the requirements in grid environemnt. In this paper, we propose a multi-virtual organizations trust evaluation method. The unique feature of our trust model is that introducing VO trust relationship into traditional grid entities, with which we can more effectively and dynamically share grid resources. In addition the new method uses clustering analysis to evaluate grid entities' trust in VOs and a weighted path to compute transitivity of trust. The simulation result shows that it improves the overall performance of grid system.
{"title":"A Clustering Analysis Based Trust Model in Grid Environment Supporting Virtual Organizations","authors":"Xudong Ni, Junzhou Luo","doi":"10.1109/WAINA.2008.162","DOIUrl":"https://doi.org/10.1109/WAINA.2008.162","url":null,"abstract":"Grid computing is to enable coordinated resource sharing in dynamic, distinct virtual organizations, which are consisted of different grid entities from traditional organizations. Grid security must ensure secure and authorized access to grid services in such dynamic, heterogeneous and unpredictable gird environment. The main current security solution is applying trust as an important factor to the gird computing to realize cooperation between unknown entities.However, most of the research work inherites the conception of trust from peer-to-peer network and is not accurately satsified the requirements in grid environemnt. In this paper, we propose a multi-virtual organizations trust evaluation method. The unique feature of our trust model is that introducing VO trust relationship into traditional grid entities, with which we can more effectively and dynamically share grid resources. In addition the new method uses clustering analysis to evaluate grid entities' trust in VOs and a weighted path to compute transitivity of trust. The simulation result shows that it improves the overall performance of grid system.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127677115","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}
Reflecting the rapid growth of information technology, the configuration of software applications, such as word processors and spreadsheets, is both sophisticated and complicated. It is often difficult for users to identify the relevant functions in an online manual of a target application. In this paper, we propose a question answering system that finds functions related to a user's request. To enhance our system, we addressed two "mismatch" problems. The first problem is associated with mismatch in vocabulary, in which the same concept is represented by different words in the manual and in the user's question. The second problem is associated with mismatch in function. Although a user may have a hypothetical function for their purpose in mind, the purpose can sometimes be accomplished by other functions. To resolve these mismatch problems, we use the World Wide Web to extract related terms for software functions, so that a user's question can be matched to the relevant function with a high accuracy. We show the effectiveness of our system experimentally.
{"title":"A Question Answering System for the Operation of Software Applications","authors":"Atsushi Fujii, Seiji Takegata","doi":"10.1109/WAINA.2008.127","DOIUrl":"https://doi.org/10.1109/WAINA.2008.127","url":null,"abstract":"Reflecting the rapid growth of information technology, the configuration of software applications, such as word processors and spreadsheets, is both sophisticated and complicated. It is often difficult for users to identify the relevant functions in an online manual of a target application. In this paper, we propose a question answering system that finds functions related to a user's request. To enhance our system, we addressed two \"mismatch\" problems. The first problem is associated with mismatch in vocabulary, in which the same concept is represented by different words in the manual and in the user's question. The second problem is associated with mismatch in function. Although a user may have a hypothetical function for their purpose in mind, the purpose can sometimes be accomplished by other functions. To resolve these mismatch problems, we use the World Wide Web to extract related terms for software functions, so that a user's question can be matched to the relevant function with a high accuracy. We show the effectiveness of our system experimentally.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127750454","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}
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destination. In this paper we present LAROD, a geographical routing protocol for intermittently connected networks. Combining beacon less geographical routing with store-carry-forward LAROD greedily searches for the shortest way to the destination and when no progress is possible packets are temporarily stored until node mobility has created a new path. In the paper we have shown by a comparative study that LAROD has almost as good delivery rate as an epidemic routing scheme, but at a substantially lower overhead.
{"title":"Geographical Routing in Intermittently Connected Ad Hoc Networks","authors":"Erik Kuiper, S. Nadjm-Tehrani","doi":"10.1109/WAINA.2008.132","DOIUrl":"https://doi.org/10.1109/WAINA.2008.132","url":null,"abstract":"In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destination. In this paper we present LAROD, a geographical routing protocol for intermittently connected networks. Combining beacon less geographical routing with store-carry-forward LAROD greedily searches for the shortest way to the destination and when no progress is possible packets are temporarily stored until node mobility has created a new path. In the paper we have shown by a comparative study that LAROD has almost as good delivery rate as an epidemic routing scheme, but at a substantially lower overhead.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127776132","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：