Pub Date : 2009-09-18DOI: 10.1109/atnac.2008.4783317
X. Liu, A. Al-Anbuky
The paper discusses the development of a Bluetooth based information exchange network (BIEN). The network is based on the Bluetooth scatternet idea and governed by set of additional rules that helps regulating the information traffic. The architecture has been prototyped and tested on a typical network. Early investigation to the throughput on different piconet and scatternet size has yielded good results. The work presented here is an attempt at implementation of a distributed multi-hop scatternet with an integrated routing protocol. While the literature focuses on covering the modeling, this work focuses on the implementation.
{"title":"Bluetooth Information Exchange Network","authors":"X. Liu, A. Al-Anbuky","doi":"10.1109/atnac.2008.4783317","DOIUrl":"https://doi.org/10.1109/atnac.2008.4783317","url":null,"abstract":"The paper discusses the development of a Bluetooth based information exchange network (BIEN). The network is based on the Bluetooth scatternet idea and governed by set of additional rules that helps regulating the information traffic. The architecture has been prototyped and tested on a typical network. Early investigation to the throughput on different piconet and scatternet size has yielded good results. The work presented here is an attempt at implementation of a distributed multi-hop scatternet with an integrated routing protocol. While the literature focuses on covering the modeling, this work focuses on the implementation.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131228865","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}
Pub Date : 2008-12-07DOI: 10.1109/ATNAC.2008.4783302
C. Seifert, Ian Welch, P. Komisarczuk
Malicious web pages that launch client-side attacks on web browsers have become an increasing problem in recent years. High-interaction client honeypots are security devices that can detect these malicious web pages on a network. However, high-interaction client honeypots are both resource-intensive and known to miss attacks. This paper presents a novel classification method for detecting malicious web pages that involves inspecting the underlying static attributes of the initial HTTP response and HTML code. Because malicious web pages import exploits from remote resources and hide exploit code, static attributes characterizing these actions can be used to identify a majority of malicious web pages. Combining high-interaction client honeypots and this new classification method into a hybrid system leads to significant performance improvements.
{"title":"Identification of Malicious Web Pages with Static Heuristics","authors":"C. Seifert, Ian Welch, P. Komisarczuk","doi":"10.1109/ATNAC.2008.4783302","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783302","url":null,"abstract":"Malicious web pages that launch client-side attacks on web browsers have become an increasing problem in recent years. High-interaction client honeypots are security devices that can detect these malicious web pages on a network. However, high-interaction client honeypots are both resource-intensive and known to miss attacks. This paper presents a novel classification method for detecting malicious web pages that involves inspecting the underlying static attributes of the initial HTTP response and HTML code. Because malicious web pages import exploits from remote resources and hide exploit code, static attributes characterizing these actions can be used to identify a majority of malicious web pages. Combining high-interaction client honeypots and this new classification method into a hybrid system leads to significant performance improvements.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129576442","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}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783323
A. Gurung, F. Al-Qahtani, A. Sadik, Z. M. Hussain
The clipping and filtering method is analyzed in terms of power savings. The analysis takes account of the gain in the amplifier efficiency due to peak-to-average-power-ratio (PAPR) reduction. Assuming a linear amplifier and a typical digital signal processor, the power savings is shown to be in the order of Watts.
{"title":"Power Savings Analysis of Clipping and Filtering Method in OFDM Systems","authors":"A. Gurung, F. Al-Qahtani, A. Sadik, Z. M. Hussain","doi":"10.1109/ATNAC.2008.4783323","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783323","url":null,"abstract":"The clipping and filtering method is analyzed in terms of power savings. The analysis takes account of the gain in the amplifier efficiency due to peak-to-average-power-ratio (PAPR) reduction. Assuming a linear amplifier and a typical digital signal processor, the power savings is shown to be in the order of Watts.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121249184","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}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783334
F. Al-Qahtani, S. Zummo, A. Gurung, Z. M. Hussain
In this paper we derive closed-form expressions for the single-user capacity of selection combining diversity (SCD) system, taking into account the effect of imperfect channel estimation at the receiver. The channel considered is a slowly varying spatially independent flat Rayleigh fading channel. The complex channel estimate and the actual channel are modelled as jointly Gaussian random variables with a correlation that depends on the estimation quality. Two adaptive transmission schemes are analyzed: 1) optimal power and rate adaptation; and 2) constant power with optimal rate adaptation. Our numerical results show the effect of Gaussian channel estimation error on the achievable spectral efficiency.
{"title":"On the Spectral Efficiency for Selection Combiner Diversity (SCD) over Slow Fading","authors":"F. Al-Qahtani, S. Zummo, A. Gurung, Z. M. Hussain","doi":"10.1109/ATNAC.2008.4783334","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783334","url":null,"abstract":"In this paper we derive closed-form expressions for the single-user capacity of selection combining diversity (SCD) system, taking into account the effect of imperfect channel estimation at the receiver. The channel considered is a slowly varying spatially independent flat Rayleigh fading channel. The complex channel estimate and the actual channel are modelled as jointly Gaussian random variables with a correlation that depends on the estimation quality. Two adaptive transmission schemes are analyzed: 1) optimal power and rate adaptation; and 2) constant power with optimal rate adaptation. Our numerical results show the effect of Gaussian channel estimation error on the achievable spectral efficiency.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125676689","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}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783314
D. Catrein, R. Mathar
Slow fading or shadowing on a wireless channel is commonly modeled by stochastically independent, log-normally distributed random variables. However, as slow fading is caused by buildings and large size obstacles, spatial correlations occur. In this paper, Gaussian random fields are used as a model for correlated slow fading in urban environments. An exponential correlation function is employed. The according parameters are estimated from path gain predictions by an accurate ray-optical propagation algorithm, named CORLA. Furthermore, a multidimensional model is suggested to describe correlated shadowing of the path gains from different base stations to a single receiver.
{"title":"Gaussian Random Fields as a Model for Spatially Correlated Log-Normal Fading","authors":"D. Catrein, R. Mathar","doi":"10.1109/ATNAC.2008.4783314","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783314","url":null,"abstract":"Slow fading or shadowing on a wireless channel is commonly modeled by stochastically independent, log-normally distributed random variables. However, as slow fading is caused by buildings and large size obstacles, spatial correlations occur. In this paper, Gaussian random fields are used as a model for correlated slow fading in urban environments. An exponential correlation function is employed. The according parameters are estimated from path gain predictions by an accurate ray-optical propagation algorithm, named CORLA. Furthermore, a multidimensional model is suggested to describe correlated shadowing of the path gains from different base stations to a single receiver.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127409382","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}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783286
J. Mizusawa
This paper discusses the key design issues in applying both CWDM (coarse wavelength division multiplexing) and optical hub technology to an access network. The purpose is to reconsider characteristics of both optical circuits (such as a splitter, a coupler, a laser diode, a photo diode) and CWDM technology, and to try to find improved optical components deployment in access areas. The core of the network is composed of optical components, i.e., optical hub and fibers. CWDM functionality (such as LD and PD) is provided by newly designed ONICs (optical network interface card) located at a station site. The proposed access network structure has advantages in simplicity and scalability. Test bed implementation is included.
{"title":"Optical Hub Network Design for CWDM Access Network","authors":"J. Mizusawa","doi":"10.1109/ATNAC.2008.4783286","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783286","url":null,"abstract":"This paper discusses the key design issues in applying both CWDM (coarse wavelength division multiplexing) and optical hub technology to an access network. The purpose is to reconsider characteristics of both optical circuits (such as a splitter, a coupler, a laser diode, a photo diode) and CWDM technology, and to try to find improved optical components deployment in access areas. The core of the network is composed of optical components, i.e., optical hub and fibers. CWDM functionality (such as LD and PD) is provided by newly designed ONICs (optical network interface card) located at a station site. The proposed access network structure has advantages in simplicity and scalability. Test bed implementation is included.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123557327","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}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783346
W. Liu, H. Sirisena, K. Pawlikowski
This paper proposes a novel framework to solve the survivable routing problem with shared path protection in a distributed control environment. The work mainly concerns how to dynamically determine a protection cycle (i.e., two link-disjoint paths between a source-destination node pair) and allocate spare capacity for a connection establishment request so as to minimize total bandwidth consumption in the network. This is known as the spare capacity allocation (SCA) problem and its resulting integer linear programming (ILP) formulation is known to be NP-hard. This paper tackles the SCA problem using a new matrix-based model and a heuristic algorithm, termed friend or foe-resilient (FoF-R) ant-based routing algorithm. First, a new concept of resilience matrix (RM) is introduced to capture the local bandwidth usage information and investigate the relationship between a failed link and other links with protection capacity allocated. Next, based on the special link cost derived from the RM, the novel FoF-R ant-based routing algorithm, which is inspired by the principle of ant colony optimization, is developed to find the optimal protection cycles and explore the sharing ability among protection paths using a headroom-dependent attraction/repulsion function. By keeping a suitable number of mobile agents (i.e., FoF-R ants) in a network to continually and proactively update the RMs, the survivable routing solution for a connection request can be obtained within a reasonable computation time.
{"title":"FoF-R Ant: Ant-Based Survivable Routing Scheme for Shared Path Protection","authors":"W. Liu, H. Sirisena, K. Pawlikowski","doi":"10.1109/ATNAC.2008.4783346","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783346","url":null,"abstract":"This paper proposes a novel framework to solve the survivable routing problem with shared path protection in a distributed control environment. The work mainly concerns how to dynamically determine a protection cycle (i.e., two link-disjoint paths between a source-destination node pair) and allocate spare capacity for a connection establishment request so as to minimize total bandwidth consumption in the network. This is known as the spare capacity allocation (SCA) problem and its resulting integer linear programming (ILP) formulation is known to be NP-hard. This paper tackles the SCA problem using a new matrix-based model and a heuristic algorithm, termed friend or foe-resilient (FoF-R) ant-based routing algorithm. First, a new concept of resilience matrix (RM) is introduced to capture the local bandwidth usage information and investigate the relationship between a failed link and other links with protection capacity allocated. Next, based on the special link cost derived from the RM, the novel FoF-R ant-based routing algorithm, which is inspired by the principle of ant colony optimization, is developed to find the optimal protection cycles and explore the sharing ability among protection paths using a headroom-dependent attraction/repulsion function. By keeping a suitable number of mobile agents (i.e., FoF-R ants) in a network to continually and proactively update the RMs, the survivable routing solution for a connection request can be obtained within a reasonable computation time.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129748435","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}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783353
Liang Hu, Lars Dittmann, J. Boudec
The user-generated podcasting service over mobile opportunistic networks can facilitate the user generated content dissemination while humans are on the move. However, in such a distributed and dynamic network environment, the design of efficient content forwarding and cache management schemes are challenging due to the lack of global podcast channel popularity information at each individual node. We design a distributed reputation system at each node for estimating the global channel popularity information which is significant for forwarding and cache management decision. Our simulation result shows that, compare to history-based rank scheme, our reputation system can significantly improve system performance under community-based random way-point (C-RWP) mobility model and localized channel popularity distribution.
{"title":"Reputation system for User Generated wireless podcasting","authors":"Liang Hu, Lars Dittmann, J. Boudec","doi":"10.1109/ATNAC.2008.4783353","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783353","url":null,"abstract":"The user-generated podcasting service over mobile opportunistic networks can facilitate the user generated content dissemination while humans are on the move. However, in such a distributed and dynamic network environment, the design of efficient content forwarding and cache management schemes are challenging due to the lack of global podcast channel popularity information at each individual node. We design a distributed reputation system at each node for estimating the global channel popularity information which is significant for forwarding and cache management decision. Our simulation result shows that, compare to history-based rank scheme, our reputation system can significantly improve system performance under community-based random way-point (C-RWP) mobility model and localized channel popularity distribution.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127516692","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}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783360
Eva Cheng, B. Cheng, C. Ritz, I. Burnett
Teleconferencing systems are becoming increasing realistic and pleasant for users to interact with geographically distant meeting participants. Video screens display a complete view of the remote participants, using technology such as wraparound or multiple video screens. However, the corresponding audio does not offer the same sophistication: often only a mono or stereo track is presented. This paper proposes a teleconferencing audio recording and playback paradigm that captures the spatial location of the geographically distributed participants for rendering of the remote soundfields at the users' end. Utilizing standard 5.1 surround sound playback, this paper proposes a surround rendering approach that `squeezes' the multiple recorded soundfields from remote teleconferencing sites to assist the user to disambiguate multiple speakers from different participating sites.
{"title":"Spatialized Teleconferencing: Recording and `Squeezed' Rendering of Multiple Distributed Sites","authors":"Eva Cheng, B. Cheng, C. Ritz, I. Burnett","doi":"10.1109/ATNAC.2008.4783360","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783360","url":null,"abstract":"Teleconferencing systems are becoming increasing realistic and pleasant for users to interact with geographically distant meeting participants. Video screens display a complete view of the remote participants, using technology such as wraparound or multiple video screens. However, the corresponding audio does not offer the same sophistication: often only a mono or stereo track is presented. This paper proposes a teleconferencing audio recording and playback paradigm that captures the spatial location of the geographically distributed participants for rendering of the remote soundfields at the users' end. Utilizing standard 5.1 surround sound playback, this paper proposes a surround rendering approach that `squeezes' the multiple recorded soundfields from remote teleconferencing sites to assist the user to disambiguate multiple speakers from different participating sites.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132409406","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}
Pub Date : 2008-12-01DOI: 10.1109/ATNAC.2008.4783294
S. Suthaharan
A sensor node in a wireless sensor network has a limited machine word size. This limitation restricts the use of cryptographic algorithms developed for computer networks in a wireless sensor node. Most of the modern cryptographic algorithms use the multiplicative inverse of a Galois field and therefore it is important to develop storage- and energy-efficient approaches for sensors to calculate multiplicative inverses. This paper presents two techniques to compute multiplicative inverses of a Galois field of order prime p for a wireless sensor network. The performance of the proposed algorithm is compared with that of the extended Euclid algorithm. The results show that the proposed approaches are storage-and energy-efficient, and are computationally better than the extended Euclid algorithm.
{"title":"Calculating a Cryptographic Primitive: Suitable for Wireless Sensor Networks","authors":"S. Suthaharan","doi":"10.1109/ATNAC.2008.4783294","DOIUrl":"https://doi.org/10.1109/ATNAC.2008.4783294","url":null,"abstract":"A sensor node in a wireless sensor network has a limited machine word size. This limitation restricts the use of cryptographic algorithms developed for computer networks in a wireless sensor node. Most of the modern cryptographic algorithms use the multiplicative inverse of a Galois field and therefore it is important to develop storage- and energy-efficient approaches for sensors to calculate multiplicative inverses. This paper presents two techniques to compute multiplicative inverses of a Galois field of order prime p for a wireless sensor network. The performance of the proposed algorithm is compared with that of the extended Euclid algorithm. The results show that the proposed approaches are storage-and energy-efficient, and are computationally better than the extended Euclid algorithm.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130996511","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
扫码关注我们
求助内容：
应助结果提醒方式：