Pub Date : 2008-12-30DOI: 10.1109/ISWCS.2008.4726126
Ricardo M. Silva, J. Silva, Milan Simek, F. Boavida
Wireless sensor networks present a great potential in monitoring systems. A vast scope of applications can take advantage of WSNs and, mainly because of their own nature, the aggregation of WSN nodes into groups provides more potential solutions when compared with traditional monitoring systems. This paper introduces the issue of multicast messages and their impact on battery resources of WSNs. It presents a study based on a real implementation to evaluate the energy consumed by each node when a multicast or unicast is used. A study of the multicast impact in the neighbourhood is also presented in this paper.
{"title":"Why should multicast be used in WSNs","authors":"Ricardo M. Silva, J. Silva, Milan Simek, F. Boavida","doi":"10.1109/ISWCS.2008.4726126","DOIUrl":"https://doi.org/10.1109/ISWCS.2008.4726126","url":null,"abstract":"Wireless sensor networks present a great potential in monitoring systems. A vast scope of applications can take advantage of WSNs and, mainly because of their own nature, the aggregation of WSN nodes into groups provides more potential solutions when compared with traditional monitoring systems. This paper introduces the issue of multicast messages and their impact on battery resources of WSNs. It presents a study based on a real implementation to evaluate the energy consumed by each node when a multicast or unicast is used. A study of the multicast impact in the neighbourhood is also presented in this paper.","PeriodicalId":158650,"journal":{"name":"2008 IEEE International Symposium on Wireless Communication Systems","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127539446","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-30DOI: 10.1109/ISWCS.2008.4726122
D. Bielefeld, R. Mathar
To extend the lifetime of wireless sensor networks a power-aware design of the communication units is required. This can be accomplished by employing power-controllable impulse radio ultra-wideband (IR-UWB) transceivers. In this paper, two distributed power control algorithms are suggested that are based on a variation of IR-UWB specific parameters. The iterative algorithms converge to the optimal transmit power levels for all nodes of a given network topology. The global transmission power can be further reduced by the construction of a network hierarchy. For this purpose a topology control algorithm is proposed that can be combined with the power control procedures. This combination realises an efficient application specific multiple access scheme for IR-UWB sensor networks.
{"title":"Distributed power and topology control for ir-uwb sensor networks","authors":"D. Bielefeld, R. Mathar","doi":"10.1109/ISWCS.2008.4726122","DOIUrl":"https://doi.org/10.1109/ISWCS.2008.4726122","url":null,"abstract":"To extend the lifetime of wireless sensor networks a power-aware design of the communication units is required. This can be accomplished by employing power-controllable impulse radio ultra-wideband (IR-UWB) transceivers. In this paper, two distributed power control algorithms are suggested that are based on a variation of IR-UWB specific parameters. The iterative algorithms converge to the optimal transmit power levels for all nodes of a given network topology. The global transmission power can be further reduced by the construction of a network hierarchy. For this purpose a topology control algorithm is proposed that can be combined with the power control procedures. This combination realises an efficient application specific multiple access scheme for IR-UWB sensor networks.","PeriodicalId":158650,"journal":{"name":"2008 IEEE International Symposium on Wireless Communication Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132963261","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-30DOI: 10.1109/ISWCS.2008.4726136
T. Chahed, C. Tarhini
OFDMA-based IEEE802.16 implements among other features adaptive modulation and coding (AMC) which results in a different bit rate for each user depending on its position in the cell as well as the radio condition it experiences; users away from the base station experience lower throughput. In case of (intra-cell) mobility, the download time for the data user will thus depend on the different locations she or he visits. This in turn impacts the overall (Erlang) capacity of the system defined as the maximum number of users that can be handled simultaneously by the system for a given target blocking probability. This is the focus of the present work where we model the cross-layer capacity of the system under a general user mobility pattern.
{"title":"Impact of mobility on the performance of data flows in OFDMA-based IEEE802.16e systems","authors":"T. Chahed, C. Tarhini","doi":"10.1109/ISWCS.2008.4726136","DOIUrl":"https://doi.org/10.1109/ISWCS.2008.4726136","url":null,"abstract":"OFDMA-based IEEE802.16 implements among other features adaptive modulation and coding (AMC) which results in a different bit rate for each user depending on its position in the cell as well as the radio condition it experiences; users away from the base station experience lower throughput. In case of (intra-cell) mobility, the download time for the data user will thus depend on the different locations she or he visits. This in turn impacts the overall (Erlang) capacity of the system defined as the maximum number of users that can be handled simultaneously by the system for a given target blocking probability. This is the focus of the present work where we model the cross-layer capacity of the system under a general user mobility pattern.","PeriodicalId":158650,"journal":{"name":"2008 IEEE International Symposium on Wireless Communication Systems","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126282588","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-30DOI: 10.1109/ISWCS.2008.4726102
Amitava Ghosh, W. Xiao, R. Ratasuk, Alan Rottinghaus, B. Classon
Standardization work is nearly complete on long term evolution (LTE) of the UMTS Terrestrial Radio Access and Radio Access Network which is aimed for commercial deployment in 2010. Goals for the evolved system include support for improved system capacity and coverage, high peak data rates, low latency, reduced operating costs, multi-antenna support, flexible bandwidth operations and seamless integration with existing systems. To reach these goals, a new design for the air interface including state-of-art multi-antenna technology needs to be deployed. This paper provides a look at different multi-antenna schemes for LTE downlink and uplink. The paper also discusses various Node-B antenna configurations and summarizes the performance of different multi-antenna schemes under various scenarios.
{"title":"Multi-antenna system design for 3GPP LTE","authors":"Amitava Ghosh, W. Xiao, R. Ratasuk, Alan Rottinghaus, B. Classon","doi":"10.1109/ISWCS.2008.4726102","DOIUrl":"https://doi.org/10.1109/ISWCS.2008.4726102","url":null,"abstract":"Standardization work is nearly complete on long term evolution (LTE) of the UMTS Terrestrial Radio Access and Radio Access Network which is aimed for commercial deployment in 2010. Goals for the evolved system include support for improved system capacity and coverage, high peak data rates, low latency, reduced operating costs, multi-antenna support, flexible bandwidth operations and seamless integration with existing systems. To reach these goals, a new design for the air interface including state-of-art multi-antenna technology needs to be deployed. This paper provides a look at different multi-antenna schemes for LTE downlink and uplink. The paper also discusses various Node-B antenna configurations and summarizes the performance of different multi-antenna schemes under various scenarios.","PeriodicalId":158650,"journal":{"name":"2008 IEEE International Symposium on Wireless Communication Systems","volume":"57 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121009507","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-30DOI: 10.1109/ISWCS.2008.4726120
L. Nguyen, X. Défago, R. Beuran, Y. Shinoda
Research on wireless sensor networks has recently received much attention as they offer an advantage of monitoring various kinds of environment by sensing physical phenomenon. Among various issues, energy consumption is one of the most important criteria for routing protocol in wireless sensor networks (WSNs). This paper introduces an energy efficient clustering algorithm for mobile sensor network based on the LEACH protocol. The proposed protocol adds feature to LEACH to support for mobile nodes and also reduces the consumption of the network resource in each round. The proposed protocol is simulated and the results show a significant reduction in network energy consumption compared to LEACH.
{"title":"An energy efficient routing scheme for mobile wireless sensor networks","authors":"L. Nguyen, X. Défago, R. Beuran, Y. Shinoda","doi":"10.1109/ISWCS.2008.4726120","DOIUrl":"https://doi.org/10.1109/ISWCS.2008.4726120","url":null,"abstract":"Research on wireless sensor networks has recently received much attention as they offer an advantage of monitoring various kinds of environment by sensing physical phenomenon. Among various issues, energy consumption is one of the most important criteria for routing protocol in wireless sensor networks (WSNs). This paper introduces an energy efficient clustering algorithm for mobile sensor network based on the LEACH protocol. The proposed protocol adds feature to LEACH to support for mobile nodes and also reduces the consumption of the network resource in each round. The proposed protocol is simulated and the results show a significant reduction in network energy consumption compared to LEACH.","PeriodicalId":158650,"journal":{"name":"2008 IEEE International Symposium on Wireless Communication Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121501098","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-30DOI: 10.1109/ISWCS.2008.4726093
A. Ibing, K. Manolakis
We propose a method for concurrent OFDM fine time synchronization to different stations with propagation delay differences, and a receiver based delay difference compensation method for MMSE channel estimation, which are needed to enable cooperative MIMO-OFDM transmission. Cyclic prefix removal is done dynamically with respect to the closest station, which allows for intersymbol interference free reception from all cooperating stations (if cyclic prefix length is adequately chosen). Pilot phase rotations caused by delay differences are compensated to allow for practical MMSE channel estimation with precomputed interpolation matrices. Simulative evaluation is done using 3GPP LTE parameters. Channel estimation mean square error and bit error rate curves show the method able to support cooperative MIMO-OFDM.
{"title":"MMSE channel estimation and time synchronization tracking for cooperative MIMO-OFDM with propagation delay differences","authors":"A. Ibing, K. Manolakis","doi":"10.1109/ISWCS.2008.4726093","DOIUrl":"https://doi.org/10.1109/ISWCS.2008.4726093","url":null,"abstract":"We propose a method for concurrent OFDM fine time synchronization to different stations with propagation delay differences, and a receiver based delay difference compensation method for MMSE channel estimation, which are needed to enable cooperative MIMO-OFDM transmission. Cyclic prefix removal is done dynamically with respect to the closest station, which allows for intersymbol interference free reception from all cooperating stations (if cyclic prefix length is adequately chosen). Pilot phase rotations caused by delay differences are compensated to allow for practical MMSE channel estimation with precomputed interpolation matrices. Simulative evaluation is done using 3GPP LTE parameters. Channel estimation mean square error and bit error rate curves show the method able to support cooperative MIMO-OFDM.","PeriodicalId":158650,"journal":{"name":"2008 IEEE International Symposium on Wireless Communication Systems","volume":"137 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116557125","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-30DOI: 10.1109/ISWCS.2008.4726134
Damian Kelly, S. McLoone, T. Dishongh
Indoor location tracking is a function best suited to wireless LAN devices. This generally precludes it from home use in isolated rural areas, where WLAN is a rare commodity. We propose an affordable localisation system which can be implemented using a variety of Bluetooth enabled mobile phones. This permits the incorporation of cellular network signal measurements as well as Bluetooth link measurements into the localisation framework. This paper presents a Hidden Markov Model localisation method, utilising the Viterbi algorithm, which enables single Bluetooth access point localisation. The improvement of accuracy this presents over a Naive Bayes classifier is illustrated, along with the optimal method of obtaining training data.
{"title":"A Bluetooth-based minimum infrastructure home localisation system","authors":"Damian Kelly, S. McLoone, T. Dishongh","doi":"10.1109/ISWCS.2008.4726134","DOIUrl":"https://doi.org/10.1109/ISWCS.2008.4726134","url":null,"abstract":"Indoor location tracking is a function best suited to wireless LAN devices. This generally precludes it from home use in isolated rural areas, where WLAN is a rare commodity. We propose an affordable localisation system which can be implemented using a variety of Bluetooth enabled mobile phones. This permits the incorporation of cellular network signal measurements as well as Bluetooth link measurements into the localisation framework. This paper presents a Hidden Markov Model localisation method, utilising the Viterbi algorithm, which enables single Bluetooth access point localisation. The improvement of accuracy this presents over a Naive Bayes classifier is illustrated, along with the optimal method of obtaining training data.","PeriodicalId":158650,"journal":{"name":"2008 IEEE International Symposium on Wireless Communication Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131763943","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-30DOI: 10.1109/ISWCS.2008.4726014
C. Ribeiro, A. Gameiro
In this paper we revisit the carrier frequency offset (CFO) estimation and removal for broadband orthogonal frequency division multiplexing (OFDM) systems. We propose an algorithm that explores the time-domain (TD) properties of transmitted symbols carrying pilots and data. A careful examination of the components that constitute the TD received symbols leads to the definition of a simple, yet effective, cost function. In a real scenario, the cost function presents a bowl shape with a single global minimum easily identifiable (no local minima). The proposed method is independent of the channel estimation and decision, presenting a very low computational load. The feasibility of the investigated method is substantiated by system simulation using BRAN-A broadband wireless channel model. Simulation results show that the impact of the residual CFO in the system¿s performance is minimal.
{"title":"Mitigating CFO in OFDM systems by exploring the symbol structure","authors":"C. Ribeiro, A. Gameiro","doi":"10.1109/ISWCS.2008.4726014","DOIUrl":"https://doi.org/10.1109/ISWCS.2008.4726014","url":null,"abstract":"In this paper we revisit the carrier frequency offset (CFO) estimation and removal for broadband orthogonal frequency division multiplexing (OFDM) systems. We propose an algorithm that explores the time-domain (TD) properties of transmitted symbols carrying pilots and data. A careful examination of the components that constitute the TD received symbols leads to the definition of a simple, yet effective, cost function. In a real scenario, the cost function presents a bowl shape with a single global minimum easily identifiable (no local minima). The proposed method is independent of the channel estimation and decision, presenting a very low computational load. The feasibility of the investigated method is substantiated by system simulation using BRAN-A broadband wireless channel model. Simulation results show that the impact of the residual CFO in the system¿s performance is minimal.","PeriodicalId":158650,"journal":{"name":"2008 IEEE International Symposium on Wireless Communication Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127739460","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-30DOI: 10.1109/ISWCS.2008.4726144
G. Kambourakis, Elisavet Konstantinou, S. Gritzalis
The establishment of a public key infrastructure (PKI) in mobile ad hoc networks (MANETs) is considered a difficult task because of the intrinsic characteristics of these networks. The absence of centralized services and the possible network partitions make traditional security solutions not straightforwardly applicable in MANETs. In this paper, we propose a public key management scheme based on a binary tree formation of the network¿s nodes. Using the binary tree structure, certificate chains are easily built between communicating nodes that are multi-hops away and the cumbersome problem of certificate chain discovery is avoided. We argue that our mechanism has several advantages over similar solutions, especially when a fair balancing between security and performance is terminus.
{"title":"Binary tree based public-key management for Mobile Ad Hoc Networks","authors":"G. Kambourakis, Elisavet Konstantinou, S. Gritzalis","doi":"10.1109/ISWCS.2008.4726144","DOIUrl":"https://doi.org/10.1109/ISWCS.2008.4726144","url":null,"abstract":"The establishment of a public key infrastructure (PKI) in mobile ad hoc networks (MANETs) is considered a difficult task because of the intrinsic characteristics of these networks. The absence of centralized services and the possible network partitions make traditional security solutions not straightforwardly applicable in MANETs. In this paper, we propose a public key management scheme based on a binary tree formation of the network¿s nodes. Using the binary tree structure, certificate chains are easily built between communicating nodes that are multi-hops away and the cumbersome problem of certificate chain discovery is avoided. We argue that our mechanism has several advantages over similar solutions, especially when a fair balancing between security and performance is terminus.","PeriodicalId":158650,"journal":{"name":"2008 IEEE International Symposium on Wireless Communication Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132627897","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-30DOI: 10.1109/ISWCS.2008.4726118
K. Faez, Mohammad Khanjary
Recent advancements in wireless communications and electronics have caused the emergence of a new type of networks called Wireless Sensor Networks (WSNs). WSNs have some unique features such as autonomy, low cost, tiny size, simple and fast deployment and high scalability, and many applications have been forecasted for them. In recent years, many WSN-based applications were proposed for Intelligent Transportation Systems (ITS). In this paper, UTOSPF-Urban Traffic Open Shortest Path First-a novel distributed system based on WSNs and Open Shortest Path First (OSPF) protocol is proposed that collects the real-time traffic information from roads, and based on this information, the optimal routes for every destination will be found and drivers will be informed via Variable Message Signs (VMS) or special transceivers. Fast and low cost deployment, high scalability, autonomy and distributed processing are main features of this system that make it suitable for using in urban environments. Simulation results showed that UTOSPF improve the average speed of vehicles up to 40% as compared to random routes in the simulated scenario.
最近无线通信和电子技术的进步导致了一种新型网络的出现，这种网络被称为无线传感器网络(wsn)。无线传感器网络具有自主性强、成本低、体积小、部署简单快速、可扩展性强等特点，具有广阔的应用前景。近年来，人们提出了许多基于无线网络的智能交通系统应用。本文提出了一种基于无线传感器网络(WSNs)和开放最短路径优先(OSPF)协议的新型分布式系统utospf -城市交通开放最短路径优先(urban Traffic Open Shortest Path First)，它收集道路上的实时交通信息，并根据这些信息找到每个目的地的最优路线，并通过可变消息标志(VMS)或专用收发器通知驾驶员。该系统具有快速、低成本部署、高可扩展性、自治和分布式处理等特点，适合在城市环境中使用。仿真结果表明，在模拟场景下，与随机路径相比，UTOSPF将车辆的平均速度提高了40%。
{"title":"UTOSPF: A distributed dynamic route guidance system based on Wireless Sensor Networks and Open Shortest Path First protocol","authors":"K. Faez, Mohammad Khanjary","doi":"10.1109/ISWCS.2008.4726118","DOIUrl":"https://doi.org/10.1109/ISWCS.2008.4726118","url":null,"abstract":"Recent advancements in wireless communications and electronics have caused the emergence of a new type of networks called Wireless Sensor Networks (WSNs). WSNs have some unique features such as autonomy, low cost, tiny size, simple and fast deployment and high scalability, and many applications have been forecasted for them. In recent years, many WSN-based applications were proposed for Intelligent Transportation Systems (ITS). In this paper, UTOSPF-Urban Traffic Open Shortest Path First-a novel distributed system based on WSNs and Open Shortest Path First (OSPF) protocol is proposed that collects the real-time traffic information from roads, and based on this information, the optimal routes for every destination will be found and drivers will be informed via Variable Message Signs (VMS) or special transceivers. Fast and low cost deployment, high scalability, autonomy and distributed processing are main features of this system that make it suitable for using in urban environments. Simulation results showed that UTOSPF improve the average speed of vehicles up to 40% as compared to random routes in the simulated scenario.","PeriodicalId":158650,"journal":{"name":"2008 IEEE International Symposium on Wireless Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132239795","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
扫码关注我们
求助内容：
应助结果提醒方式：