Sampath N. Ranasinghe, H. Chaouchi, V. Friderikos, H. Aghvami
This paper presents a distributed authentication architecture based on peer-to-peer networking paradigms to minimise the delays in authenticating and authorising mobile nodes roaming across different wireless networks. The fundamental principle is to provide a mechanism to shift elements required for authentication closer to the mobile node's current point of access thus reducing the need for interaction with the home network's authentication, authorisation and accounting (AAA) servers. We propose to harness the power of self-organising peer-to-peer networking principles to provide an efficient, reliable and low overhead infrastructure for securely transporting and managing the mobile user's security context and information as they roam between foreign networks.
{"title":"Peer-to-peer assisted security context transfer for mobile terminals","authors":"Sampath N. Ranasinghe, H. Chaouchi, V. Friderikos, H. Aghvami","doi":"10.1109/WD.2008.4812922","DOIUrl":"https://doi.org/10.1109/WD.2008.4812922","url":null,"abstract":"This paper presents a distributed authentication architecture based on peer-to-peer networking paradigms to minimise the delays in authenticating and authorising mobile nodes roaming across different wireless networks. The fundamental principle is to provide a mechanism to shift elements required for authentication closer to the mobile node's current point of access thus reducing the need for interaction with the home network's authentication, authorisation and accounting (AAA) servers. We propose to harness the power of self-organising peer-to-peer networking principles to provide an efficient, reliable and low overhead infrastructure for securely transporting and managing the mobile user's security context and information as they roam between foreign networks.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134482115","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}
Extending system lifespan by managing power on mobile nodes is critical and primordial in wireless ad hoc networks. Recent work has shown that, by appropriately powering off nodes, energy may be significantly saved, especially when node density is high. Such approaches rely on the selection of a virtual backbone of the topology to forward ongoing traffic, coupled with functions to reorganize (manually or periodically) such a backbone for load balancing purposes. The common drawback of such schemes is the need to involve periodic message exchanges to establish synchronization and announcement of the traffic. This paper presents UTA-DCS, a neighborhood and traffic aware power saving mechanism that dynamically adjusts the announcement period in order to optimize its value and thus conserve energy. UTA-DCS combines the functionalities of two power saving mechanisms, UTA-PSM and DCS-ATIM to ensure the best performances in all traffic loads. Simulation results testified to the superiority of UTA-DCS over PSM and DCS-ATIM in ensuring greater power saving, higher throughput and lower delay.
{"title":"Improving neighborhood aware power saving mechanism using carrier sensing for dynamic advertising windows","authors":"Wafa Akkari, A. Belghith","doi":"10.1109/WD.2008.4812873","DOIUrl":"https://doi.org/10.1109/WD.2008.4812873","url":null,"abstract":"Extending system lifespan by managing power on mobile nodes is critical and primordial in wireless ad hoc networks. Recent work has shown that, by appropriately powering off nodes, energy may be significantly saved, especially when node density is high. Such approaches rely on the selection of a virtual backbone of the topology to forward ongoing traffic, coupled with functions to reorganize (manually or periodically) such a backbone for load balancing purposes. The common drawback of such schemes is the need to involve periodic message exchanges to establish synchronization and announcement of the traffic. This paper presents UTA-DCS, a neighborhood and traffic aware power saving mechanism that dynamically adjusts the announcement period in order to optimize its value and thus conserve energy. UTA-DCS combines the functionalities of two power saving mechanisms, UTA-PSM and DCS-ATIM to ensure the best performances in all traffic loads. Simulation results testified to the superiority of UTA-DCS over PSM and DCS-ATIM in ensuring greater power saving, higher throughput and lower delay.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134588409","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}
The increasing interest in wireless mesh network technology and its popularity leads to the vision that we are going to have a wireless cover almost ubiquitous in urban areas. Nevertheless, how will be negotiated these networks services? This article propose a solution to the negotiation of network services using autonomous agents based on simple machine learning techniques combined to economic theories which provides a rationality, even limited, in an autonomous behavior. The results obtained demonstrate that services negotiation done in indiscriminate ways may cause network resources loss of quality and productivity and that measuring actions avoid these problems.
{"title":"Service negotiation over wireless mesh networks : an approach based on economic agents","authors":"Jeferson M. Anjos, L. B. Ruiz","doi":"10.1109/WD.2008.4812892","DOIUrl":"https://doi.org/10.1109/WD.2008.4812892","url":null,"abstract":"The increasing interest in wireless mesh network technology and its popularity leads to the vision that we are going to have a wireless cover almost ubiquitous in urban areas. Nevertheless, how will be negotiated these networks services? This article propose a solution to the negotiation of network services using autonomous agents based on simple machine learning techniques combined to economic theories which provides a rationality, even limited, in an autonomous behavior. The results obtained demonstrate that services negotiation done in indiscriminate ways may cause network resources loss of quality and productivity and that measuring actions avoid these problems.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133547434","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}
Software applications running on portable wireless devices communicate with the rest of the network over a wireless link. In these portable devices, the communication cost is a large fraction of the total energy consumption. The amount of energy consumed by the communication component of a portable device mostly depends on different parameters such as packet size and packet rate (or, bit rate). In this paper, we present the results of our investigation of the impacts of these communication parameters on energy consumption. First we build a simple analytic model to estimate the energy consumption due to receiving and transmitting data packets, and then we validate our model by conducting experiments. Results show that the analytical model is effective and gives accurate results. By varying data packet lengths, a communication device consumes different levels of energy to achieve the same data rate. When the packet size is very small compared to the maximum transmission unit (MTU), the device consumes more energy. However, large packets do not necessarily save energy. They rather add some other types of overheads, such as segmentation, recombination, and packet drop. Thus, for a given set of network parameters, an application can choose a suitable data packet length to minimize energy consumption. We also present the impact of data rate and packet delays on energy consumption. These results help us in understanding the energy consumption behavior of a communication device. They also facilitate us in optimizing the energy cost while designing a wireless application.
{"title":"Estimating the energy cost of communication on portable wireless devices","authors":"Rajesh Palit, S. Naik, Ajit Singh","doi":"10.1109/WD.2008.4812890","DOIUrl":"https://doi.org/10.1109/WD.2008.4812890","url":null,"abstract":"Software applications running on portable wireless devices communicate with the rest of the network over a wireless link. In these portable devices, the communication cost is a large fraction of the total energy consumption. The amount of energy consumed by the communication component of a portable device mostly depends on different parameters such as packet size and packet rate (or, bit rate). In this paper, we present the results of our investigation of the impacts of these communication parameters on energy consumption. First we build a simple analytic model to estimate the energy consumption due to receiving and transmitting data packets, and then we validate our model by conducting experiments. Results show that the analytical model is effective and gives accurate results. By varying data packet lengths, a communication device consumes different levels of energy to achieve the same data rate. When the packet size is very small compared to the maximum transmission unit (MTU), the device consumes more energy. However, large packets do not necessarily save energy. They rather add some other types of overheads, such as segmentation, recombination, and packet drop. Thus, for a given set of network parameters, an application can choose a suitable data packet length to minimize energy consumption. We also present the impact of data rate and packet delays on energy consumption. These results help us in understanding the energy consumption behavior of a communication device. They also facilitate us in optimizing the energy cost while designing a wireless application.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132222312","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}
This article proposes a new Mac layer scheme (WSC-MAC) for Wireless Sensor Network (WSN) improving the overall the network reliability by using cooperative communication. We focus our work on a way to define a relay node among the neighborhood of a node, efficiently and with only few signaling messages. We developed a solution based on an automatic forwarder selection and a link state evaluation in order to define the relay node. This automatic selection uses a group identifier uniformly spread in the network and ensures that only few nodes at the time will be chosen as relay. As the sensor nodes switch from active mode to sleep mode, we based our solution on the Long Preamble Emulation (LPE) Mac layer Algorithm which emulates the asynchronous MAC protocol proposed in Polastre et al. (2004). Our Simulations results show that WSC-MAC increases the overall reliability of the sensor network and adjusts to large variety of node density.
{"title":"Cooperative communication for Wireless Sensors Network : A Mac protocol solution","authors":"Bastien Mainaud, Vincent Gauthier, H. Afifi","doi":"10.1109/WD.2008.4812841","DOIUrl":"https://doi.org/10.1109/WD.2008.4812841","url":null,"abstract":"This article proposes a new Mac layer scheme (WSC-MAC) for Wireless Sensor Network (WSN) improving the overall the network reliability by using cooperative communication. We focus our work on a way to define a relay node among the neighborhood of a node, efficiently and with only few signaling messages. We developed a solution based on an automatic forwarder selection and a link state evaluation in order to define the relay node. This automatic selection uses a group identifier uniformly spread in the network and ensures that only few nodes at the time will be chosen as relay. As the sensor nodes switch from active mode to sleep mode, we based our solution on the Long Preamble Emulation (LPE) Mac layer Algorithm which emulates the asynchronous MAC protocol proposed in Polastre et al. (2004). Our Simulations results show that WSC-MAC increases the overall reliability of the sensor network and adjusts to large variety of node density.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131252448","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}
We propose in this work a new state-dependent admission control scheme where the degree of acceptance of flows depends on the density of the users in a given location. The latter refers to different areas in a single OFDMA-based WiMAX cell wherein users are allowed to move internally between those areas as well as externally to other cells. We develop an analytical model which allows us to derive some performance measures such as blocking and dropping probabilities. Our results quantify how these metrics vary with the load as well as the admission strategies. Our density-based admission control algorithm is shown to lower the dropping probability of on-going calls without increasing too much the blocking probability of new ones.
{"title":"Density-based admission control in IEEE802.16e Mobile WiMAX","authors":"C. Tarhini, T. Chahed","doi":"10.1109/WD.2008.4812878","DOIUrl":"https://doi.org/10.1109/WD.2008.4812878","url":null,"abstract":"We propose in this work a new state-dependent admission control scheme where the degree of acceptance of flows depends on the density of the users in a given location. The latter refers to different areas in a single OFDMA-based WiMAX cell wherein users are allowed to move internally between those areas as well as externally to other cells. We develop an analytical model which allows us to derive some performance measures such as blocking and dropping probabilities. Our results quantify how these metrics vary with the load as well as the admission strategies. Our density-based admission control algorithm is shown to lower the dropping probability of on-going calls without increasing too much the blocking probability of new ones.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133937360","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 well known that Information and Communication Technologies (ICT) improve productivity when they are combined to complementary inputs such as work process changes. However, it is not so well known, how these improvements are created and applied in a health care sector, because the performance of communication processes inside knowledge work has not been studied much. It has been said that a patient-focused government agenda and the external world of technology should engage with both the emotional as well as the rationale role in people's lives. In this paper we analyze a typical productivity improvement case, when mobile messaging is deployed to reach a customer just at a convenient time for her. Both process performance and activity based cost analysis are integrated in the models. The productivity improvements are created as a result of customer process changes enabled by the service processes. The formal model has been tested in a practical example case, where the modeled improvements have been verified and the key personnel have been observed and interviewed. The three research questions are: (i) What are those tangible factors/bottlenecks of the work process which may have negative effects on the services' outcomes, (ii) how do they affect on productivity and quality and (iii) what role would ICT play in providing these services in the future.
{"title":"Mobile messaging in floating appointments: Cutting queues and personalising patient care","authors":"K. Juntunen","doi":"10.1109/WD.2008.4812833","DOIUrl":"https://doi.org/10.1109/WD.2008.4812833","url":null,"abstract":"It is well known that Information and Communication Technologies (ICT) improve productivity when they are combined to complementary inputs such as work process changes. However, it is not so well known, how these improvements are created and applied in a health care sector, because the performance of communication processes inside knowledge work has not been studied much. It has been said that a patient-focused government agenda and the external world of technology should engage with both the emotional as well as the rationale role in people's lives. In this paper we analyze a typical productivity improvement case, when mobile messaging is deployed to reach a customer just at a convenient time for her. Both process performance and activity based cost analysis are integrated in the models. The productivity improvements are created as a result of customer process changes enabled by the service processes. The formal model has been tested in a practical example case, where the modeled improvements have been verified and the key personnel have been observed and interviewed. The three research questions are: (i) What are those tangible factors/bottlenecks of the work process which may have negative effects on the services' outcomes, (ii) how do they affect on productivity and quality and (iii) what role would ICT play in providing these services in the future.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115438962","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}
QoS support entails fair arbitration, efficient assignment, and firm admission schemes guaranteeing specified parameters for transfer of QoS-sensitive traffic. Even if deployed in ad hoc WLANs, such schemes need not be adhered to by noncooperative stations. Using a game-theoretic approach we outline QoS support for lower-bounded elastic traffic in an anonymous and noncooperative ad hoc WLAN setting, with a surrogate admission scheme relying on the Nash equilibrium property of a small number of concurrent transfers, and fairness ensured by the symmetric nature of a proposed MAC-layer contention. We study the efficiency of QoS support at a symmetric Markov perfect Nash equilibrium of a QoS-driven contention game and find it dependent on the relationship between a station's power budget and the deadline for starting a transfer of QoS-sensitive traffic.
QoS支持需要公平的仲裁、高效的分配和可靠的准入方案，保证对QoS敏感的流量传输的指定参数。即使部署在特别无线局域网中，这种方案也不需要非合作电台遵守。使用博弈论方法，我们概述了在匿名和非合作ad hoc WLAN设置中对下限弹性流量的QoS支持，采用依赖于少量并发传输的纳什均衡特性的代理接纳方案，以及由所提议的mac层争用的对称性质确保的公平性。本文研究了QoS驱动竞争博弈的对称马尔可夫完美纳什均衡下的QoS支持效率，发现QoS支持效率依赖于站点的电力预算与QoS敏感流量开始传输的截止时间之间的关系。
{"title":"Noncooperative QoS support in an Ad Hoc WLAN","authors":"J. Konorski","doi":"10.1109/WD.2008.4812857","DOIUrl":"https://doi.org/10.1109/WD.2008.4812857","url":null,"abstract":"QoS support entails fair arbitration, efficient assignment, and firm admission schemes guaranteeing specified parameters for transfer of QoS-sensitive traffic. Even if deployed in ad hoc WLANs, such schemes need not be adhered to by noncooperative stations. Using a game-theoretic approach we outline QoS support for lower-bounded elastic traffic in an anonymous and noncooperative ad hoc WLAN setting, with a surrogate admission scheme relying on the Nash equilibrium property of a small number of concurrent transfers, and fairness ensured by the symmetric nature of a proposed MAC-layer contention. We study the efficiency of QoS support at a symmetric Markov perfect Nash equilibrium of a QoS-driven contention game and find it dependent on the relationship between a station's power budget and the deadline for starting a transfer of QoS-sensitive traffic.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122053705","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}
Marc-Henry Bertin, A. Bossche, G. Chalhoub, Tuan Dang, S. Mahfoudh, J. Rahmé, Jean-Baptiste Viollet
OCARI is a wireless communication technology targeting applications in harsh environments such as power plants and warships. It supports mesh topology and provides a deterministic MAC access for time-constrained communications as well as energy efficient communications for an increased network lifetime. Based on the PHY layer of IEEE 802.15.4, it supports the ZigBee APS and APL primitives and profiles, ensuring compatibility with existing applications.
{"title":"OCARI for industrial wireless sensor networks","authors":"Marc-Henry Bertin, A. Bossche, G. Chalhoub, Tuan Dang, S. Mahfoudh, J. Rahmé, Jean-Baptiste Viollet","doi":"10.1109/WD.2008.4812928","DOIUrl":"https://doi.org/10.1109/WD.2008.4812928","url":null,"abstract":"OCARI is a wireless communication technology targeting applications in harsh environments such as power plants and warships. It supports mesh topology and provides a deterministic MAC access for time-constrained communications as well as energy efficient communications for an increased network lifetime. Based on the PHY layer of IEEE 802.15.4, it supports the ZigBee APS and APL primitives and profiles, ensuring compatibility with existing applications.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126715501","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}
The large deployment of ad hoc networks is already throttled by the slow advancement of battery technology. In fact, wireless devices usually rely on portable power sources such as batteries to provide the necessary power. The use of low-power mode was adopted by many approaches in the literature to conserve energy. However, most of these approaches do not take account of the impact of such mode on network capacity and performances. In this paper, we present a synchronous power saving approach which relies on a virtual infrastructure formed by elected clusterheads and gateways to conserve network capacity. The main contribution lies on the differentiation between processed packets based on the amount of resources so far consumed. The good performance of our algorithm in terms of more energy saving and better network throughput is witnessed by extensive simulations under various traffic loads.
{"title":"Cluster based prioritized power conservation mechanism","authors":"I. Jemili, A. Belghith, M. Mosbah","doi":"10.1109/WD.2008.4812869","DOIUrl":"https://doi.org/10.1109/WD.2008.4812869","url":null,"abstract":"The large deployment of ad hoc networks is already throttled by the slow advancement of battery technology. In fact, wireless devices usually rely on portable power sources such as batteries to provide the necessary power. The use of low-power mode was adopted by many approaches in the literature to conserve energy. However, most of these approaches do not take account of the impact of such mode on network capacity and performances. In this paper, we present a synchronous power saving approach which relies on a virtual infrastructure formed by elected clusterheads and gateways to conserve network capacity. The main contribution lies on the differentiation between processed packets based on the amount of resources so far consumed. The good performance of our algorithm in terms of more energy saving and better network throughput is witnessed by extensive simulations under various traffic loads.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115000153","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
扫码关注我们
求助内容：
应助结果提醒方式：