{"title":"Multipath Associativity Based Routing","authors":"Patrick McCarthy, D. Grigoras","doi":"10.1109/WONS.2005.24","DOIUrl":"https://doi.org/10.1109/WONS.2005.24","url":null,"abstract":"This paper introduces a series of new multipath routing protocols developed upon Associativity Based Routing (ABR) for wireless ad-hoc networks. ABR selects routes based on their stability and is an on-demand reactive routing protocol similar to Dynamic Source Routing (DSR) and Ad-Hoc On-Demand Distance Vector Routing (AODV). The multipath protocols proposed in this paper seek to reduce the number of route discoveries and average end-to-end delay by providing alternative routes between communicating source and destination nodes. Four protocols are developed and compared using different route selection criteria in order to find the most effective method used in the creation of multipath routes. The selection criteria cover node-disjoint, partial node-disjoint, disjoint and intermediate node-disjoint based approaches.","PeriodicalId":120653,"journal":{"name":"Second Annual Conference on Wireless On-demand Network Systems and Services","volume":"04 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129032388","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":"WiSwitch: Seamless Handover between Multi-Provider Networks","authors":"S. Giordano, D. Lenzarini, A. Puiatti, S. Vanini","doi":"10.1109/WONS.2005.36","DOIUrl":"https://doi.org/10.1109/WONS.2005.36","url":null,"abstract":"Traditionally, global node mobility problem is addressed at networking layer (e.g. Mobile IP and related solutions). However, none of these classes of solution is designed for supporting seamless handover switch between different network providers and technologies, where the node accesses the network from another point of access (with new access procedure) and can change technology access. Starting from the observation that seamless mobility is requested by the applications, we tackle the problem at higher layer. The proposed solution, called WiSwitch, provides always-on, continuous and optimised network services, whenever possible, to the applications independently from lower layers.","PeriodicalId":120653,"journal":{"name":"Second Annual Conference on Wireless On-demand Network Systems and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130580734","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 partition prediction algorithm for service replication in mobile ad hoc networks","authors":"A. Derhab, N. Badache, A. Bouabdallah","doi":"10.1109/WONS.2005.1","DOIUrl":"https://doi.org/10.1109/WONS.2005.1","url":null,"abstract":"Due to the mobility of nodes in ad hoc networks, network topology is dynamic and unpredictable, which leads to frequent network partitioning. This partitioning disconnects many nodes from the centralized server. Being aware of future partitioning can help to provide a continuous service availability for all mobile nodes. In this paper, we propose a partition prediction algorithm, based on: (i) the partition detection mechanism used by TORA routing protocol and (ii) the residual link lifetime of wireless links. The node that predicts network partitioning, demands the server node to replicate the service in the future separate partition before its disconnection. We propose also a scheme that describes how the service replicas are dynamically deployed in the network. Using linear time temporal logic, we show that whenever a partition is detected, then it has been predicted before. Our analysis of complexity shows that the proposed algorithm guarantee the service availability to each mobile node without incurring high cost.","PeriodicalId":120653,"journal":{"name":"Second Annual Conference on Wireless On-demand Network Systems and Services","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125501705","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":"Rural/Remote WiFi Wireless Broadband System","authors":"W. Almuhtadi","doi":"10.1109/WONS.2005.29","DOIUrl":"https://doi.org/10.1109/WONS.2005.29","url":null,"abstract":"This paper is the outcome of the research project that has been carried out at Algonquin College, Ottawa, Canada to examine, test, develop and design a range of solutions of WiFi WLAN broadband networks (802.11b/g) using off-the-shelf equipment that are cost effective and practical for deployment in the rural and remote areas under a unique set of conditions such as climate, power, terrain, special service needs and other factors. The research project is focused on Canadian and international Wireless Internet technology and know-how, as applied to the developing countries (especially Asia Pacific) and to rural and remote Canadian locales (including remote First Nation communities).","PeriodicalId":120653,"journal":{"name":"Second Annual Conference on Wireless On-demand Network Systems and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129097957","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}
S. Kutten, H. Ono, D. Peleg, K. Sadakane, M. Yamashita
{"title":"Energy-optimal online algorithms for broadcasting in wireless networks","authors":"S. Kutten, H. Ono, D. Peleg, K. Sadakane, M. Yamashita","doi":"10.1109/WONS.2005.14","DOIUrl":"https://doi.org/10.1109/WONS.2005.14","url":null,"abstract":"The paper considers the design of energy-efficient online protocols for the basic problem of message transmission to hosts positioned at unknown distances in ad-hoc wireless networks. The paper formulates a number of variants of this problem and presents optimally competitive algorithms for those variants.","PeriodicalId":120653,"journal":{"name":"Second Annual Conference on Wireless On-demand Network Systems and Services","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116031421","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":"Experiments of Some Performance Issues with IEEE 802.11b in Ad Hoc Networks","authors":"Claude Chaudet, D. Dhoutaut, I. G. Lassous","doi":"10.1109/WONS.2005.16","DOIUrl":"https://doi.org/10.1109/WONS.2005.16","url":null,"abstract":"In this paper, we experiment different ad hoc configurations that have been pointed out in the literature for presenting some performance problems with IEEE 802.11 MAC protocol. We focus on fairness issues and show that some problems identified by simulation are real and should be considered while others are softened and some are even nonexistent due to either radio propagation or to implementation choices made by manufacturers.","PeriodicalId":120653,"journal":{"name":"Second Annual Conference on Wireless On-demand Network Systems and Services","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116952750","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":"SAMPLE: Statistical Network Link Modelling in an On-Demand Probabilistic Routing Protocol for Ad Hoc Networks","authors":"E. Curran, J. Dowling","doi":"10.1109/WONS.2005.30","DOIUrl":"https://doi.org/10.1109/WONS.2005.30","url":null,"abstract":"Existing routing protocols for multi-hop wireless networks assume an idealised wireless network in which all links in the network are either on or off and where all functioning links are equally good. Such a model interprets the fraction of packets that are dropped due to contention or interference as broken links, which can in turn lead to increased routing traffic and radio contention. This paper introduces a statistical model of estimated link reliability in wireless networks based on sampling attempted and successful packet transmissions in the network. We present a path metric based on the link model to capture the cost of routes in the network. We investigate both the link model and the path metric in an on-demand probabilistic routing protocol called SAMPLE that is inspired by reinforcement learning techniques. Different scenario-based performance evaluations of the protocol in NS-2 are presented. In comparisons with AODV and DSR, SAMPLE exhibits improved performance in both lossy and congested wireless networks.","PeriodicalId":120653,"journal":{"name":"Second Annual Conference on Wireless On-demand Network Systems and Services","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124973005","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":"Merit of Adaptability to Mobile User Parameters in IP Paging","authors":"H. Do, Y. Onozato","doi":"10.1109/WONS.2005.22","DOIUrl":"https://doi.org/10.1109/WONS.2005.22","url":null,"abstract":"Recent research works have attempted to improve the efficiency of Mobile IP by extending it with a layer 3 paging mechanism so-called IP paging. The employment of adaptability in some manner to user parameters in order to enhance the efficiency of IP paging schemes is probably a promising approach. In this paper, we present an analysis on the effect of both user-adaptability and time-adaptability to mobile user parameters in Individual Paging schemes by comparing the signaling cost of an adaptive Individual Paging scheme to that of a non-adaptive counterpart. From our analysis, specifying the optimal paging area (PA) is critical in saving signaling cost of IP paging. Thus, our investigation is focused on the adaptability of PA to maintain its optimality. We demonstrate that while the adaptability offers certain benefits in terms of signaling cost, the effects of user and time adaptability to different parameters may vary considerably.","PeriodicalId":120653,"journal":{"name":"Second Annual Conference on Wireless On-demand Network Systems and Services","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125172920","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":"Gibraltar: Application and Network Aware Adaptive Power Management for IEEE 802.11","authors":"Rajesh Banginwar, E. Gorbatov","doi":"10.1109/WONS.2005.20","DOIUrl":"https://doi.org/10.1109/WONS.2005.20","url":null,"abstract":"IEEE 802.11 power save mode and other power management mechanisms while reducing the power consumption of a wireless subsystem may significantly degrade application performance increasing overall system power. A new power management algorithm, codenamed Gibraltar, which adapts to application level network behavior and current network conditions, has been developed to reduce 802.11 power consumption and to limit application delays. Gibraltar algorithm was implemented as an NDIS intermediate driver for the Intel PRO/Wireless 2200BG miniPCI card and experiments were conducted for web browsing and email applications. Measured results demonstrated that Gibraltar is very effective in managing power of a wireless subsystem and limiting application delay. For example, for web browsing when compared to 802.11 power save mode, Gibraltar reduces power consumption by 28% and delay by 19%. Further, Gibraltar is able to consistently reduce system energy consumption across applications and device types providing a viable solution for 802.11 power management.","PeriodicalId":120653,"journal":{"name":"Second Annual Conference on Wireless On-demand Network Systems and Services","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115848437","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. Wellens, M. Petrova, Janne Riihijärvi, P. Mähönen
{"title":"Building a better wireless mousetrap: need for more realism in simulations","authors":"M. Wellens, M. Petrova, Janne Riihijärvi, P. Mähönen","doi":"10.1109/WONS.2005.6","DOIUrl":"https://doi.org/10.1109/WONS.2005.6","url":null,"abstract":"Reliable network simulators are important tools for research and development in the field of wireless communication. Although the ns-2 simulator is quite popular for testing wireless network protocols in industry and academia, it is more than clear that it needs numerous improvements in order to produce results fitting to realistic scenarios. There are many PHY/MAC modelling parameters that contribute to the overall accuracy but are not taken into account in the current ns-2 versions. In this paper we stress out the importance of adaptive error models, propagation and mobility models and better interference calculation. We propose a SNIR-based error model in order to reliably simulate the behaviour of the wireless channel and facilitate more realistic results of WLAN simulations. The results prove that our extensions are suitable and allow precise simulations of static WLAN scenarios.","PeriodicalId":120653,"journal":{"name":"Second Annual Conference on Wireless On-demand Network Systems and Services","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122024316","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}