Intercarrier interference (ICI) self-cancellation schemes were often employed in many OFDM systems as a simple and effective approach to suppress ICI caused by carrier frequency error. In this paper, we propose a space time frequency block coding technique MIMO-OFDM system with ICI self-cancellation of data conjugate method, which is capable of both error correction and ICI reduction produced by the frequency offsets. Then, the system performance of the data-conjugate method with diversity techniques is compared with those of the conventional data-conversion method. As results, it can be seen that the STFB codes MIMO-OFDM system with data-conjugate method can make remarkable improvement of the BER performance and it is better than data-conversion method and the conventional OFDM system.
{"title":"Performance evaluation of intercarrier interference self-cancellation schemes for space time frequency block codes MIMO-OFDM system","authors":"A. Idris, K. Dimyati, S. Yusof","doi":"10.1109/WD.2008.4812834","DOIUrl":"https://doi.org/10.1109/WD.2008.4812834","url":null,"abstract":"Intercarrier interference (ICI) self-cancellation schemes were often employed in many OFDM systems as a simple and effective approach to suppress ICI caused by carrier frequency error. In this paper, we propose a space time frequency block coding technique MIMO-OFDM system with ICI self-cancellation of data conjugate method, which is capable of both error correction and ICI reduction produced by the frequency offsets. Then, the system performance of the data-conjugate method with diversity techniques is compared with those of the conventional data-conversion method. As results, it can be seen that the STFB codes MIMO-OFDM system with data-conjugate method can make remarkable improvement of the BER performance and it is better than data-conversion method and the conventional OFDM system.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130730957","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}
G. Chalhoub, A. Guitton, F. Jacquet, A. Freitas, M. Misson
Energy efficiency is a primordial issue in the wireless sensor networks. This is achieved by deactivating nodes when possible. In this paper we describe the MAC protocol MaCARI that synchronizes nodes in order to schedule active and inactive periods. MaCARI divides time into three periods: a synchronization period, a scheduled activities period where communications are constrained by a tree and an unscheduled activities period where nodes can communicate whenever in range. With this synchronization, nodes are able to save energy during specific time intervals. Therefore, we focus on the synchronization period and apply an optimization to reduce its duration. We validate this approach by simulations under different tree topologies.
{"title":"Medium access control for a tree-based wireless sensor network: Synchronization management","authors":"G. Chalhoub, A. Guitton, F. Jacquet, A. Freitas, M. Misson","doi":"10.1109/WD.2008.4812836","DOIUrl":"https://doi.org/10.1109/WD.2008.4812836","url":null,"abstract":"Energy efficiency is a primordial issue in the wireless sensor networks. This is achieved by deactivating nodes when possible. In this paper we describe the MAC protocol MaCARI that synchronizes nodes in order to schedule active and inactive periods. MaCARI divides time into three periods: a synchronization period, a scheduled activities period where communications are constrained by a tree and an unscheduled activities period where nodes can communicate whenever in range. With this synchronization, nodes are able to save energy during specific time intervals. Therefore, we focus on the synchronization period and apply an optimization to reduce its duration. We validate this approach by simulations under different tree topologies.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116094414","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}
Ultra wideband technology (UWB) is an emerging technology that has proven to be quite suitable for short range applications. This paper is part of an ongoing research for using UWB technology for positioning and remote sensing biometric information for team-sport players on a pitch, Simulation is conducted for a number of ldquoplayersrdquo who are carrying RFIDs transmitting signals with biometric information data about each player to a number of receiving antennas positioned around the field. We investigate the effect of multiple access interference (MAI) on the performance of UWB wireless systems using a novel MISO diversity combining scheme. The main goal is to determine the number of interferers that the system can handle before producing an unacceptable quality of service (QoS). The results show that, due to UWB low power spectral density characteristics, the system can handle a relatively large number of interferers.
{"title":"Performance of UWB telecommunication system in the presence of multiple access interference","authors":"O. Abdul-Latif, P. Shepherd, S. Pennock","doi":"10.1109/WD.2008.4812832","DOIUrl":"https://doi.org/10.1109/WD.2008.4812832","url":null,"abstract":"Ultra wideband technology (UWB) is an emerging technology that has proven to be quite suitable for short range applications. This paper is part of an ongoing research for using UWB technology for positioning and remote sensing biometric information for team-sport players on a pitch, Simulation is conducted for a number of ldquoplayersrdquo who are carrying RFIDs transmitting signals with biometric information data about each player to a number of receiving antennas positioned around the field. We investigate the effect of multiple access interference (MAI) on the performance of UWB wireless systems using a novel MISO diversity combining scheme. The main goal is to determine the number of interferers that the system can handle before producing an unacceptable quality of service (QoS). The results show that, due to UWB low power spectral density characteristics, the system can handle a relatively large number of interferers.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"125 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":"126150828","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 paper proposes an adaptive 2 level active period length control method based on traffic load in each cluster for cluster-based wireless sensor networks (WSNs) employing IEEE 802.15.4 medium access control (MAC) protocol. The proposed method consists of two active period length controls: cluster level control and network level control. In the cluster level control, cluster heads autonomously control its active period length in the superframe defined by a personal area network (PAN) coordinator. In the network level control, the PAN coordinator manages the superframe structure for the whole network. The results evaluated by computer simulation show that the proposed method can improve the energy efficiency for the WSNs without degradation of the transmission performance.
{"title":"Traffic adaptive active period length control for cluster-based IEEE 802.15.4 sensor networks","authors":"K. Mori, K. Naito, Hideo Kobayashi","doi":"10.1109/WD.2008.4812870","DOIUrl":"https://doi.org/10.1109/WD.2008.4812870","url":null,"abstract":"This paper proposes an adaptive 2 level active period length control method based on traffic load in each cluster for cluster-based wireless sensor networks (WSNs) employing IEEE 802.15.4 medium access control (MAC) protocol. The proposed method consists of two active period length controls: cluster level control and network level control. In the cluster level control, cluster heads autonomously control its active period length in the superframe defined by a personal area network (PAN) coordinator. In the network level control, the PAN coordinator manages the superframe structure for the whole network. The results evaluated by computer simulation show that the proposed method can improve the energy efficiency for the WSNs without degradation of the transmission performance.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"7 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":"123787412","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 work, we present an analysis of the gain achieved in terms of efficiency with PUSH-based epidemic diffusion of messages, when maintaining and exchanging information about the infection status. Different policies for the exchange of partial status information are compared, with the aim of optimizing bandwidth usage. We analyze the effects of adding a copy-count mechanism to the maintenance of status with respect to the capability of efficiently stopping the diffusion once full coverage is achieved; to this purpose, we adopted an analytical model proposed in the literature to determine the copy-count threshold. We perform initial measures to highlight how the mobility model affects the algorithm performance.
{"title":"Impact of history on epidemic broadcast in DTNs","authors":"G. Gamberini, F. Giudici, E. Pagani, G. P. Rossi","doi":"10.1109/WD.2008.4812838","DOIUrl":"https://doi.org/10.1109/WD.2008.4812838","url":null,"abstract":"In this work, we present an analysis of the gain achieved in terms of efficiency with PUSH-based epidemic diffusion of messages, when maintaining and exchanging information about the infection status. Different policies for the exchange of partial status information are compared, with the aim of optimizing bandwidth usage. We analyze the effects of adding a copy-count mechanism to the maintenance of status with respect to the capability of efficiently stopping the diffusion once full coverage is achieved; to this purpose, we adopted an analytical model proposed in the literature to determine the copy-count threshold. We perform initial measures to highlight how the mobility model affects the algorithm performance.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"222 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":"122403168","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 paper presents a novel Virtual Circle Combined Straight Routing (VCCSR) algorithm for a mobile sink to collect data in wireless sensor networks. Tree-based routing is a common scheme to collect data from sensors to a sink. Most of the previous proposed tree-like aggregation approaches are not suitable for mobile sink, because the routes between sink and sensors have to be reconstructed when a mobile sink moved. This causes a lot of link reconstruction to waste a lot of energy. The VCCSR algorithm is a structure-based routing with a virtual backbone. A set of cluster heads is located at the virtual backbone. When a mobile sink needs to collect data from sensors, a dynamic tree routing is constructed on the virtual backbone. Each cluster head is able to adjust tree routes when the mobile sink location is updated. This algorithm only needs to update the location information of mobile sink to a part of cluster heads to change their routing. This paper proposes a set of regular updating rules for the virtual structure to adjust routes effectively. The VCCSR algorithm is compared with tree-based algorithms in simulation. This paper demonstrates that a mobile sink can collect data and save energy effectively in a wireless sensor network. The VCCSR algorithm reduces the reconstructing cost so that it can prolong the network lifetime.
{"title":"Geographic convergecast in wireless sensor networks","authors":"Tzung-Shi Chen, Hua-Wen Tsai, Yu-Hsin Chang","doi":"10.1109/WD.2008.4812896","DOIUrl":"https://doi.org/10.1109/WD.2008.4812896","url":null,"abstract":"This paper presents a novel Virtual Circle Combined Straight Routing (VCCSR) algorithm for a mobile sink to collect data in wireless sensor networks. Tree-based routing is a common scheme to collect data from sensors to a sink. Most of the previous proposed tree-like aggregation approaches are not suitable for mobile sink, because the routes between sink and sensors have to be reconstructed when a mobile sink moved. This causes a lot of link reconstruction to waste a lot of energy. The VCCSR algorithm is a structure-based routing with a virtual backbone. A set of cluster heads is located at the virtual backbone. When a mobile sink needs to collect data from sensors, a dynamic tree routing is constructed on the virtual backbone. Each cluster head is able to adjust tree routes when the mobile sink location is updated. This algorithm only needs to update the location information of mobile sink to a part of cluster heads to change their routing. This paper proposes a set of regular updating rules for the virtual structure to adjust routes effectively. The VCCSR algorithm is compared with tree-based algorithms in simulation. This paper demonstrates that a mobile sink can collect data and save energy effectively in a wireless sensor network. The VCCSR algorithm reduces the reconstructing cost so that it can prolong the network lifetime.","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":"114445688","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}
Wireless ad-hoc networks consist of devices communicating with each other without the need for a management infrastructure. As such, the very basic operation of ad-hoc networks is dependent on the cooperation of their nodes to provide connectivity and communication routes. In practice though, such cooperation may not always be achieved. Cases where some nodes behave in a selfish manner or maliciously are of particular interest and consequence. Such cases normally result in degradation of the performance of the network or even disruption of its operation altogether. To mitigate the effect of such nodes and to achieve higher levels of reliability, the communication rout should be based on utilization of reliable and trustworthy nodes. This clearly depends on evaluation of trust and trustworthiness of the nodes. This paper proposes an approach that is based on soft computing to establish quantifiable trust levels between the nodes of an ad-hoc network. The information on trust levels are then used in the routing decision making process. Extensive simulator studies that utilize the proposed approach are carried out, analyzed, and reported in this paper. The resulting relatively significant improvements in the performance of typical ad-hoc networks are also reported.
{"title":"Trust assessment in wireless ad-hoc networks","authors":"H. Hallani, S. Shahrestani","doi":"10.1109/WD.2008.4812909","DOIUrl":"https://doi.org/10.1109/WD.2008.4812909","url":null,"abstract":"Wireless ad-hoc networks consist of devices communicating with each other without the need for a management infrastructure. As such, the very basic operation of ad-hoc networks is dependent on the cooperation of their nodes to provide connectivity and communication routes. In practice though, such cooperation may not always be achieved. Cases where some nodes behave in a selfish manner or maliciously are of particular interest and consequence. Such cases normally result in degradation of the performance of the network or even disruption of its operation altogether. To mitigate the effect of such nodes and to achieve higher levels of reliability, the communication rout should be based on utilization of reliable and trustworthy nodes. This clearly depends on evaluation of trust and trustworthiness of the nodes. This paper proposes an approach that is based on soft computing to establish quantifiable trust levels between the nodes of an ad-hoc network. The information on trust levels are then used in the routing decision making process. Extensive simulator studies that utilize the proposed approach are carried out, analyzed, and reported in this paper. The resulting relatively significant improvements in the performance of typical ad-hoc networks are also reported.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"75 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":"114477027","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, we propose a new sensor deployment strategy by considering both a probabilistic sensor detection model and a monitored area with geographical irregularity requirement of the sensed events. In this case, each point in the deployment field needs a specific minimum guarantee in event detection probability. The main objective is to find the minimum number of senors and their positions, in order to guarantee the requirement event detection threshold. Thus, we propose a new scalable deployment strategy based on virtual forces. The fundamental idea of our proposal is to adjust the number and the position of sensors according to virtual forces that must be computed for each sensor. The performance evaluation shows that our proposal obtained the best results compared to several other sensor deployment strategies founded in the literature.
{"title":"A gradient approach for differentiated wireless sensor network deployment","authors":"N. Aitsaadi, N. Achir, K. Boussetta, B. Gavish","doi":"10.1109/WD.2008.4812925","DOIUrl":"https://doi.org/10.1109/WD.2008.4812925","url":null,"abstract":"In this paper, we propose a new sensor deployment strategy by considering both a probabilistic sensor detection model and a monitored area with geographical irregularity requirement of the sensed events. In this case, each point in the deployment field needs a specific minimum guarantee in event detection probability. The main objective is to find the minimum number of senors and their positions, in order to guarantee the requirement event detection threshold. Thus, we propose a new scalable deployment strategy based on virtual forces. The fundamental idea of our proposal is to adjust the number and the position of sensors according to virtual forces that must be computed for each sensor. The performance evaluation shows that our proposal obtained the best results compared to several other sensor deployment strategies founded in the literature.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":" 40","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113948415","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}
Wireless Mesh Networks (WMNs) provide a cost-effective way of deploying a network and providing broadband Internet access. In WMNs a subset of nodes called gateways provide connectivity to the wired infrastructure (typically the Internet). Because traffic volume of WMNs is expected to be high, and due to limited wireless link capacity, gateways are likely to become a potential bottleneck. In this paper, we propose a distributed load-balancing protocol where gateways coordinate to reroute flows from congested gateways to under-utilized gateways. Unlike other approaches, our scheme takes into account the effects of interference. This makes it suitable for implementation in practical scenarios, achieving good results, and improving on shortest path routing. Also, it is load-sensitive and can improve network utilization in both balanced and skewed topologies. Simulation results prove the effectiveness of our approach, which outperforms all schemes tested. We have observed throughput gains of up to 80% over the shortest path algorithm.
{"title":"A distributed algorithm for gateway load-balancing in Wireless Mesh Networks","authors":"J. J. Galvez, P. M. Ruiz, A. Gómez-Skarmeta","doi":"10.1109/WD.2008.4812861","DOIUrl":"https://doi.org/10.1109/WD.2008.4812861","url":null,"abstract":"Wireless Mesh Networks (WMNs) provide a cost-effective way of deploying a network and providing broadband Internet access. In WMNs a subset of nodes called gateways provide connectivity to the wired infrastructure (typically the Internet). Because traffic volume of WMNs is expected to be high, and due to limited wireless link capacity, gateways are likely to become a potential bottleneck. In this paper, we propose a distributed load-balancing protocol where gateways coordinate to reroute flows from congested gateways to under-utilized gateways. Unlike other approaches, our scheme takes into account the effects of interference. This makes it suitable for implementation in practical scenarios, achieving good results, and improving on shortest path routing. Also, it is load-sensitive and can improve network utilization in both balanced and skewed topologies. Simulation results prove the effectiveness of our approach, which outperforms all schemes tested. We have observed throughput gains of up to 80% over the shortest path algorithm.","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":"128113982","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}
Event detection techniques are crucial for environmental monitoring and object tracking applications in wireless sensor networks. Event detection requires sensor readings to be collected from multiple sensors, and as sensors have limited resources, their readings should be retrieved efficiently. Existing aggregation-based event detection methods, however, require all sensors in the network to transmit their readings, which results in high energy consumption for the network. We propose an energy-efficient event detection technique for estimating the state of the whole environment based on only some of the sensor readings and use a contour map to represent the outline of the environment. To detect events in 3D environments, we modify an existing 2D contour mapping algorithm, extending it for 3D environments. By simulation, we show how our event detection technique is more energy-efficient than existing solutions that take readings from all sensors. We evaluated our method from the point of energy efficiency and found that it improves the energy efficiency of event detection in 3D wireless sensor networks.
{"title":"Energy-efficient event detection in 3D wireless sensor networks","authors":"Susumu Toriumi, Y. Sei, S. Honiden","doi":"10.1109/WD.2008.4812898","DOIUrl":"https://doi.org/10.1109/WD.2008.4812898","url":null,"abstract":"Event detection techniques are crucial for environmental monitoring and object tracking applications in wireless sensor networks. Event detection requires sensor readings to be collected from multiple sensors, and as sensors have limited resources, their readings should be retrieved efficiently. Existing aggregation-based event detection methods, however, require all sensors in the network to transmit their readings, which results in high energy consumption for the network. We propose an energy-efficient event detection technique for estimating the state of the whole environment based on only some of the sensor readings and use a contour map to represent the outline of the environment. To detect events in 3D environments, we modify an existing 2D contour mapping algorithm, extending it for 3D environments. By simulation, we show how our event detection technique is more energy-efficient than existing solutions that take readings from all sensors. We evaluated our method from the point of energy efficiency and found that it improves the energy efficiency of event detection in 3D wireless sensor networks.","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":"125751390","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
扫码关注我们
求助内容：
应助结果提醒方式：