Cross-layering is a novel paradigm in wireless local area networks (WLAN) proposed to improve the support of QoS (Quality of Service) traffic. Many cross-layer solutions have already been developed. They diverge in the way the cross-layer concept is implemented and the type of performance gain they recommend. In parallel to cross-layering, a new network paradigm is growing: the autonomic paradigm appearing as the size and complexity of networks grow. There is a growing consensus among the research community that combining cross-layering and autonomic paradigms is, until now, the best alternative for better QoS support in WLANs. We combine cross-layering and autonomic concepts in the design of a new architecture called XLEngine (Cross-Layer Engine) having the ability to make optimizations based on local and network wide knowledge. XLEngine is implemented and simulated under the J-Sim simulator for different wireless scenarios. Simulation results show that XLEngine outperforms the classic layered architecture.
{"title":"A cross-layer autonomic architecture for QoS support in wireless networks","authors":"W. Berrayana, H. Youssef, S. Lohier, G. Pujolle","doi":"10.1109/WD.2008.4812862","DOIUrl":"https://doi.org/10.1109/WD.2008.4812862","url":null,"abstract":"Cross-layering is a novel paradigm in wireless local area networks (WLAN) proposed to improve the support of QoS (Quality of Service) traffic. Many cross-layer solutions have already been developed. They diverge in the way the cross-layer concept is implemented and the type of performance gain they recommend. In parallel to cross-layering, a new network paradigm is growing: the autonomic paradigm appearing as the size and complexity of networks grow. There is a growing consensus among the research community that combining cross-layering and autonomic paradigms is, until now, the best alternative for better QoS support in WLANs. We combine cross-layering and autonomic concepts in the design of a new architecture called XLEngine (Cross-Layer Engine) having the ability to make optimizations based on local and network wide knowledge. XLEngine is implemented and simulated under the J-Sim simulator for different wireless scenarios. Simulation results show that XLEngine outperforms the classic layered architecture.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"20 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":"125295047","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 main goal of wireless sensor networks is to gather information from the region of interest through a large number of micro sensor nodes. This gathering is based on a communication architecture such as client/server which consumes a lot of power and doesn't take in consideration the information properties. In this paper, we propose a new communication architecture for wireless sensor networks based on agents' cooperation. This architecture uses techniques from multi-agent systems and networks in order to ensure an optimal information gathering. It benefits from AODV not only for route discovery but also to define the basic list of cooperating agents, using the RREP control message. These agents create cooperatively a simple message summarizing the important information of multiple nodes, where it is widely known that sending a one big message consumes less energy than sending several small messages of the same quantity of information. In order to appreciate our contribution, we discuss its advantages and its limitations by comparing it to client/server and mobile agent architectures.
{"title":"Agent-cooperation based communication architecture for wireless sensor networks","authors":"A. Sardouk, L. Merghem, D. Gaïti","doi":"10.1109/WD.2008.4812863","DOIUrl":"https://doi.org/10.1109/WD.2008.4812863","url":null,"abstract":"The main goal of wireless sensor networks is to gather information from the region of interest through a large number of micro sensor nodes. This gathering is based on a communication architecture such as client/server which consumes a lot of power and doesn't take in consideration the information properties. In this paper, we propose a new communication architecture for wireless sensor networks based on agents' cooperation. This architecture uses techniques from multi-agent systems and networks in order to ensure an optimal information gathering. It benefits from AODV not only for route discovery but also to define the basic list of cooperating agents, using the RREP control message. These agents create cooperatively a simple message summarizing the important information of multiple nodes, where it is widely known that sending a one big message consumes less energy than sending several small messages of the same quantity of information. In order to appreciate our contribution, we discuss its advantages and its limitations by comparing it to client/server and mobile agent architectures.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"32 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":"122791741","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 integration of wired and wireless networks is gaining popularity due to its usefulness and practical use. Internet connectivity would benefit users from mobility offered by mobile ad hoc networks and connectivity provided by the Internet. This integration however faces problem due to architectural differences in terms of infrastructure, topology, and mobility mechanisms. A number of integration strategies have been proposed so far. Few strategies use fixed gateways, others use mobile gateways. Some strategies are based on mobile IPv4 while others are based on mobile IPv6. The ad hoc routing protocols deployed in the framework are also different. In this paper, we propose a framework for integrating mobile ad hoc network and the Internet using both fixed and mobile gateways. The ad hoc mobile nodes can access the Internet using either fixed or mobile gateway, based on criteria of distance, load on the gateway. We use an extended version of AODV routing protocol in the framework. The objective behind using both fixed and mobile gateways is to increase the reliability of the Internet access, scalability, providing transparent Internet access to the ad hoc hosts and in general improve the performance of the integrated framework. The proposed framework is a hybrid approach involving two-layer and three layer approaches of integration.
{"title":"A hybrid architecture for integrating Mobile ad hoc network and the internet using Fixed and Mobile Gateways","authors":"K. Khan, M. A. Ahmed, A. V. Reddy, R. Zaman","doi":"10.1109/WD.2008.4812876","DOIUrl":"https://doi.org/10.1109/WD.2008.4812876","url":null,"abstract":"The integration of wired and wireless networks is gaining popularity due to its usefulness and practical use. Internet connectivity would benefit users from mobility offered by mobile ad hoc networks and connectivity provided by the Internet. This integration however faces problem due to architectural differences in terms of infrastructure, topology, and mobility mechanisms. A number of integration strategies have been proposed so far. Few strategies use fixed gateways, others use mobile gateways. Some strategies are based on mobile IPv4 while others are based on mobile IPv6. The ad hoc routing protocols deployed in the framework are also different. In this paper, we propose a framework for integrating mobile ad hoc network and the Internet using both fixed and mobile gateways. The ad hoc mobile nodes can access the Internet using either fixed or mobile gateway, based on criteria of distance, load on the gateway. We use an extended version of AODV routing protocol in the framework. The objective behind using both fixed and mobile gateways is to increase the reliability of the Internet access, scalability, providing transparent Internet access to the ad hoc hosts and in general improve the performance of the integrated framework. The proposed framework is a hybrid approach involving two-layer and three layer approaches of integration.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"63 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":"122895152","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}
Although IMS (IP multimedia subsystem) brings a large set of new services and offers service convergence, it introduces complexity on network procedures and architecture. This paper focuses on IMS session establishment procedure and highlights the long delay introduced by this procedure. It also raises failure problems encountered when only partial radio resources are available for the requested service. To solve these issues, we propose a new architecture, called UFA (ultra flat architecture) which is an IMS distributed and flat architecture composed of only base stations. We define session establishment procedure for UFA and describe the way it handles access network resource information to adapt the service accordingly. We compare UFA and IMS classical architectures in terms of session establishment delay. Evaluation uses queuing theory and shows that UFA enables a considerable gain.
{"title":"One-node-based mobile architecture for a better QoS control","authors":"K. Daoud, Philippe Herbelin, N. Crespi","doi":"10.1109/WD.2008.4812874","DOIUrl":"https://doi.org/10.1109/WD.2008.4812874","url":null,"abstract":"Although IMS (IP multimedia subsystem) brings a large set of new services and offers service convergence, it introduces complexity on network procedures and architecture. This paper focuses on IMS session establishment procedure and highlights the long delay introduced by this procedure. It also raises failure problems encountered when only partial radio resources are available for the requested service. To solve these issues, we propose a new architecture, called UFA (ultra flat architecture) which is an IMS distributed and flat architecture composed of only base stations. We define session establishment procedure for UFA and describe the way it handles access network resource information to adapt the service accordingly. We compare UFA and IMS classical architectures in terms of session establishment delay. Evaluation uses queuing theory and shows that UFA enables a considerable gain.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"64 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":"133166204","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 to maximize achievable rate in OFDM systems via the adaptation of the cyclic prefix (CP) length jointly with tone and bit loading. We show that significant gains are obtained compared to the case of using a fixed CP with duration equal to the channel. Several metrics for the CP design are described. They tradeoff between performance and complexity. Both single user and multiuser OFDM are considered. Numerical results are reported for typical power line communication indoor channels.
{"title":"Bit, tone and cyclic prefix allocation in OFDM with application to In-Home PLC","authors":"A. Tonello, S. D'Alessandro, L. Lampe","doi":"10.1109/WD.2008.4812844","DOIUrl":"https://doi.org/10.1109/WD.2008.4812844","url":null,"abstract":"We propose to maximize achievable rate in OFDM systems via the adaptation of the cyclic prefix (CP) length jointly with tone and bit loading. We show that significant gains are obtained compared to the case of using a fixed CP with duration equal to the channel. Several metrics for the CP design are described. They tradeoff between performance and complexity. Both single user and multiuser OFDM are considered. Numerical results are reported for typical power line communication indoor channels.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"5 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":"121793867","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}
Mohammed I. Asseri, B. Sharif, S. L. Goff, C. Tsimenidis
Directed Selected Mapping (dSLM) is a well known Peak-to-Average Power Ratio (PAPR) reduction scheme in Multiple-Input Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems. This paper presents a modification to dSLM for a Zero-Forcing (ZF) receiver. The contribution in this paper is twofold; firstly, the transmitted phase vector is recovered without side information whist maintaining bit error performance, and secondly, receiver complexity is reduced.
{"title":"Reduced complexity dSLM recovery in MIMO-OFDM without side information","authors":"Mohammed I. Asseri, B. Sharif, S. L. Goff, C. Tsimenidis","doi":"10.1109/WD.2008.4812835","DOIUrl":"https://doi.org/10.1109/WD.2008.4812835","url":null,"abstract":"Directed Selected Mapping (dSLM) is a well known Peak-to-Average Power Ratio (PAPR) reduction scheme in Multiple-Input Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems. This paper presents a modification to dSLM for a Zero-Forcing (ZF) receiver. The contribution in this paper is twofold; firstly, the transmitted phase vector is recovered without side information whist maintaining bit error performance, and secondly, receiver complexity is reduced.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"11 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":"124258213","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 basic objective of congestion control is to best exploit the available network resources while preventing sustained overloads of network nodes and links. Appropriate congestion control mechanisms are essential to maintain the efficient operation of a network. Ensuring congestion control within vehicular ad hoc networks address special challenges, due to the characteristic and specificities of such environment (High dynamic and mobility of nodes, high rate of topology changes, high variability in nodes density and neighborhood, broadcast/geocast communication nature ...). In this context, we present in this paper a congestion control approach, based on the concept of dynamic priorities-based scheduling, to ensure a reliable and safe communications architecture within VANET. Messages priorities are dynamically evaluated according to their types, the network context and the neighborhood.
{"title":"On the congestion control within VANET","authors":"M. Bouassida, M. Shawky","doi":"10.1109/WD.2008.4812915","DOIUrl":"https://doi.org/10.1109/WD.2008.4812915","url":null,"abstract":"The basic objective of congestion control is to best exploit the available network resources while preventing sustained overloads of network nodes and links. Appropriate congestion control mechanisms are essential to maintain the efficient operation of a network. Ensuring congestion control within vehicular ad hoc networks address special challenges, due to the characteristic and specificities of such environment (High dynamic and mobility of nodes, high rate of topology changes, high variability in nodes density and neighborhood, broadcast/geocast communication nature ...). In this context, we present in this paper a congestion control approach, based on the concept of dynamic priorities-based scheduling, to ensure a reliable and safe communications architecture within VANET. Messages priorities are dynamically evaluated according to their types, the network context and the neighborhood.","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":"129490556","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 this paper an instantaneous, high performance, large-scale video surveillance system is presented. Available and future network technologies are analyzed for the dynamical and flexible use of mobile devices in video surveillance. Based on this analysis, video quality levels are proposed followed by wireless ad hoc video surveillance performance levels (WAD levels). Then the systems' structure as well as the underlying technologies are presented. The system is further analyzed to measure its performance and to expose potential security threats and discuss the corresponding counter meas.ures on real-world attack scenarios.
{"title":"Instantaneous mobile video surveillance: A security & quality challenge","authors":"S. Sutor, G. Pujolle, R. Reda","doi":"10.1109/WD.2008.4812864","DOIUrl":"https://doi.org/10.1109/WD.2008.4812864","url":null,"abstract":"In this paper an instantaneous, high performance, large-scale video surveillance system is presented. Available and future network technologies are analyzed for the dynamical and flexible use of mobile devices in video surveillance. Based on this analysis, video quality levels are proposed followed by wireless ad hoc video surveillance performance levels (WAD levels). Then the systems' structure as well as the underlying technologies are presented. The system is further analyzed to measure its performance and to expose potential security threats and discuss the corresponding counter meas.ures on real-world attack scenarios.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"30 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":"125725399","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}
H. Meshgi, Mohammad Erfan Khazaee, B. Kasiri, H. Shahhoseini
Power analysis is a dominant method that reveals side channel information by tracing power signal. In elliptic curve cryptosystem (ECC), they have received considerable attention. The main operation of ECC is scalar multiplication which is vulnerable to power analysis attacks. In this paper we present an algorithm for securing elliptic curve scalar multiplication against Power Analysis. However some algorithms, which are resistant against some kinds of power analysis attacks like Simple Power Analysis (SPA) or Differential Power Analysis (DPA), were developed, we contribute an algorithm that is resistant against the most recent kinds of power analysis attacks. Also, our algorithm can be successful for a large class of elliptic curves, including most of the elliptic curves recommended by standard bodies such as ANSI, IEEE, ISO, NIST, SECG or WTLS.
{"title":"An efficient algorithm resistant to SPA and DPA variants in ECC","authors":"H. Meshgi, Mohammad Erfan Khazaee, B. Kasiri, H. Shahhoseini","doi":"10.1109/WD.2008.4812882","DOIUrl":"https://doi.org/10.1109/WD.2008.4812882","url":null,"abstract":"Power analysis is a dominant method that reveals side channel information by tracing power signal. In elliptic curve cryptosystem (ECC), they have received considerable attention. The main operation of ECC is scalar multiplication which is vulnerable to power analysis attacks. In this paper we present an algorithm for securing elliptic curve scalar multiplication against Power Analysis. However some algorithms, which are resistant against some kinds of power analysis attacks like Simple Power Analysis (SPA) or Differential Power Analysis (DPA), were developed, we contribute an algorithm that is resistant against the most recent kinds of power analysis attacks. Also, our algorithm can be successful for a large class of elliptic curves, including most of the elliptic curves recommended by standard bodies such as ANSI, IEEE, ISO, NIST, SECG or WTLS.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"36 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":"124412305","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}
Adaptive filtering algorithms have been widely applied to solve the problem of channel equalization in digital communication systems. So far, the LMS and the NLMS adaptive algorithms have been the most commonly adopted approaches owing to the clarity of the mean-square-error cost function in terms of statistical concept and the simplicity for computation. However, a critical issue associated with both algorithms is the choice of the step-size parameter that is the trade-off between the steady-state misadjustment and the speed of adaptation. The aim of this paper is to investigate the performance, in terms of MSE, of random step-size NLMS algorithm in adaptive channel equalization. The proposed idea of this paper is that the adaptive filter will change its coefficients according to the NLMS algorithm in which its step size is multiplied by PN (pseudo random number generator) to pseudo randomize the step size.
{"title":"Performance evaluation of random step-size NLMS in adaptive channel equalization","authors":"S. Jimaa, N. A. Saeedi, S. Al-Araji, R. Shubair","doi":"10.1109/WD.2008.4812828","DOIUrl":"https://doi.org/10.1109/WD.2008.4812828","url":null,"abstract":"Adaptive filtering algorithms have been widely applied to solve the problem of channel equalization in digital communication systems. So far, the LMS and the NLMS adaptive algorithms have been the most commonly adopted approaches owing to the clarity of the mean-square-error cost function in terms of statistical concept and the simplicity for computation. However, a critical issue associated with both algorithms is the choice of the step-size parameter that is the trade-off between the steady-state misadjustment and the speed of adaptation. The aim of this paper is to investigate the performance, in terms of MSE, of random step-size NLMS algorithm in adaptive channel equalization. The proposed idea of this paper is that the adaptive filter will change its coefficients according to the NLMS algorithm in which its step size is multiplied by PN (pseudo random number generator) to pseudo randomize the step size.","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":"130327612","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
扫码关注我们
求助内容：
应助结果提醒方式：