The subject of acquiring sensed data with the aid of a mobile collector from a wireless sensor network (WSN) that possesses partitioned/islanded WSNs is investigated. The battery depletion of sensor nodes can lead to partitioned/islanded WSNs; as a result, the base station collects merely somewhat sensed data while data routing difficulty arisen. To ease the effect of partitioned or islanded WSNs, a mobile collector is employed to assist collecting data in partitioned/islanded WSNs and bring those collected data stored locally back to the base station. To carry out this work, two key tasks are of concerns, identifying the locations of partitioned/islanded WSNs and navigating the mobile collector to the desired location. To identify the locations of partitioned/islanded WSNs, two control approaches, global-based approach and local-based approach, are proposed. Accordingly, the navigating strategy of the mobile collector can be scheduled based on the time and location. Three scheduling strategies are introduced, time-based scheduling, location-based scheduling, and dynamic-moving-based scheduling. Upon these strategies, the mobile collector is about to collect the sensed data back from partitioned/islanded WSNs. Therefore, the efficiency of sensed data collected by the base station in partitioned/islanded WSNs is improved. Through simulation under the environment of ns-2 simulator, the results show that the collecting strategies proposed can dramatically improve sensed data collecting performance in partitioned or islanded WSNs.
{"title":"Data collection in wireless sensor networks assisted by mobile collector","authors":"Tzung-Cheng Chen, Tzung-Shi Chen, Ping-Wen Wu","doi":"10.1109/WD.2008.4812895","DOIUrl":"https://doi.org/10.1109/WD.2008.4812895","url":null,"abstract":"The subject of acquiring sensed data with the aid of a mobile collector from a wireless sensor network (WSN) that possesses partitioned/islanded WSNs is investigated. The battery depletion of sensor nodes can lead to partitioned/islanded WSNs; as a result, the base station collects merely somewhat sensed data while data routing difficulty arisen. To ease the effect of partitioned or islanded WSNs, a mobile collector is employed to assist collecting data in partitioned/islanded WSNs and bring those collected data stored locally back to the base station. To carry out this work, two key tasks are of concerns, identifying the locations of partitioned/islanded WSNs and navigating the mobile collector to the desired location. To identify the locations of partitioned/islanded WSNs, two control approaches, global-based approach and local-based approach, are proposed. Accordingly, the navigating strategy of the mobile collector can be scheduled based on the time and location. Three scheduling strategies are introduced, time-based scheduling, location-based scheduling, and dynamic-moving-based scheduling. Upon these strategies, the mobile collector is about to collect the sensed data back from partitioned/islanded WSNs. Therefore, the efficiency of sensed data collected by the base station in partitioned/islanded WSNs is improved. Through simulation under the environment of ns-2 simulator, the results show that the collecting strategies proposed can dramatically improve sensed data collecting performance in partitioned or islanded WSNs.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"101 9 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":"132225759","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}
IEEE 802.11 wireless mesh networks emerge as an alternative to provide an infrastructure for last mile access networks in remote areas. The meshed topology provides good reliability, low cost, market coverage and scalability. However due to the shared nature of wireless medium, which limits the available network bandwidth, it is necessary to implement an effective load control scheme that enable the use of wireless mesh networks for real-time applications. This work proposes a centralized admission control scheme to provide acceptable QoS for real-time applications. We demonstrate the usability of our admission control scheme to provide VoIP access for existing remotes areas connected via satellite link.
{"title":"VoIP call admission control for last mile Wireless Mesh Networks","authors":"Edgar Piacentini, M. Fonseca, Anelise Munaretto","doi":"10.1109/WD.2008.4812897","DOIUrl":"https://doi.org/10.1109/WD.2008.4812897","url":null,"abstract":"IEEE 802.11 wireless mesh networks emerge as an alternative to provide an infrastructure for last mile access networks in remote areas. The meshed topology provides good reliability, low cost, market coverage and scalability. However due to the shared nature of wireless medium, which limits the available network bandwidth, it is necessary to implement an effective load control scheme that enable the use of wireless mesh networks for real-time applications. This work proposes a centralized admission control scheme to provide acceptable QoS for real-time applications. We demonstrate the usability of our admission control scheme to provide VoIP access for existing remotes areas connected via satellite link.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"60 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":"134101187","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}
Due to lack of mass deployment of wireless ad hoc networks, simulation is the main tool to evaluate and compare different routing protocol proposals. Previous studies have shown that a certain routing protocol behaves differently under different presumed mobility patterns. Bypass-AODV is a new optimization of the AODV routing protocol for mobile ad-hoc networks. It is proposed as a local recovery mechanism to enhance the performance of AODV routing protocol. It shows outstanding performance under random waypoint mobility model compared with AODV. However, random waypoint is a simple model that may be applicable to some scenarios but it is not sufficient to capture some important mobility characteristics of scenarios where MANETs deployed. In this work, we would like to investigate the performance of Bypass-AODV under wide range of mobility models including other random mobility models, group mobility models and vehicular mobility models. Ns-2 simulation results show that bypass-AODV is insensitive to the selected random mobility model and it has a clear performance improvement compared to AODV. It shows a comparable performance under group mobility model compared to AODV. But, for vehicular mobility models, bypass-AODV is suffering from performance degradation at high speed conditions.
{"title":"Random and realistic mobility models impact on the performance of bypass-AODV routing protocol","authors":"Ahed Alshanyour, U. Baroudi","doi":"10.1109/WD.2008.4812840","DOIUrl":"https://doi.org/10.1109/WD.2008.4812840","url":null,"abstract":"Due to lack of mass deployment of wireless ad hoc networks, simulation is the main tool to evaluate and compare different routing protocol proposals. Previous studies have shown that a certain routing protocol behaves differently under different presumed mobility patterns. Bypass-AODV is a new optimization of the AODV routing protocol for mobile ad-hoc networks. It is proposed as a local recovery mechanism to enhance the performance of AODV routing protocol. It shows outstanding performance under random waypoint mobility model compared with AODV. However, random waypoint is a simple model that may be applicable to some scenarios but it is not sufficient to capture some important mobility characteristics of scenarios where MANETs deployed. In this work, we would like to investigate the performance of Bypass-AODV under wide range of mobility models including other random mobility models, group mobility models and vehicular mobility models. Ns-2 simulation results show that bypass-AODV is insensitive to the selected random mobility model and it has a clear performance improvement compared to AODV. It shows a comparable performance under group mobility model compared to AODV. But, for vehicular mobility models, bypass-AODV is suffering from performance degradation at high speed conditions.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"21 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":"134275598","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}
A. Krendzel, J. Mangues‐Bafalluy, M. Requena-Esteso, José Núñez-Martínez
Position-based routing schemes (e.g. geographic routing) are expected to improve scalability of wireless networks, as they allow reducing the state information stored in nodes compared to topology-based routing. Moreover, geographic routing schemes need to differentiate between the identifier of a node and its location. Given the mobility of (some) nodes, their location may continuously change, and there is the need to map between both (i.e. node ID and current location of this node) as part of the mobility management tasks. Therefore, of all mobility management building blocks, we focus on location management, which is in charge of this mapping. The design of distributed location management schemes for large wireless mesh networks (WMNs) remains a challenge. In this paper, the distributed Virtual Home Region Multi-Hash Location Service (VIMLOC) is proposed as location management scheme for WMNs. It is based on the Virtual Home Region concept, but it is adapted to the requirements of large-scale WMNs. The design of VIMLOC takes into account the existence of a stable wireless backbone. It also provides mechanisms to replicate location information for robustness and packet diverting capabilities for accuracy, among other improvements. A brief description of the implementation of VIMLOC using the Click modular router is also presented as well as a preliminary evaluation. To the best of our knowledge, this is the first location service scheme specially designed and implemented for WMNs.
{"title":"VIMLOC: Virtual Home Region multi-hash Location Service in wireless mesh networks","authors":"A. Krendzel, J. Mangues‐Bafalluy, M. Requena-Esteso, José Núñez-Martínez","doi":"10.1109/WD.2008.4812852","DOIUrl":"https://doi.org/10.1109/WD.2008.4812852","url":null,"abstract":"Position-based routing schemes (e.g. geographic routing) are expected to improve scalability of wireless networks, as they allow reducing the state information stored in nodes compared to topology-based routing. Moreover, geographic routing schemes need to differentiate between the identifier of a node and its location. Given the mobility of (some) nodes, their location may continuously change, and there is the need to map between both (i.e. node ID and current location of this node) as part of the mobility management tasks. Therefore, of all mobility management building blocks, we focus on location management, which is in charge of this mapping. The design of distributed location management schemes for large wireless mesh networks (WMNs) remains a challenge. In this paper, the distributed Virtual Home Region Multi-Hash Location Service (VIMLOC) is proposed as location management scheme for WMNs. It is based on the Virtual Home Region concept, but it is adapted to the requirements of large-scale WMNs. The design of VIMLOC takes into account the existence of a stable wireless backbone. It also provides mechanisms to replicate location information for robustness and packet diverting capabilities for accuracy, among other improvements. A brief description of the implementation of VIMLOC using the Click modular router is also presented as well as a preliminary evaluation. To the best of our knowledge, this is the first location service scheme specially designed and implemented for WMNs.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"34 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":"126193435","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}
Philipp M. Glatz, Philipp Meyer, A. Janek, T. Trathnigg, C. Steger, R. Weiss
Wireless Sensor Network (WSN) nodes are resource- constrained computing devices. Adaptive behavior of autonomously working WSNs tries to maximize the cost efficiency of deployments. This includes maximizing the lifetime through power consumption optimization and recharging energy reservoirs with the use of energy harvesting. The adaptive behavior that leads to efficient resource usage needs information about the WSNs energy balance for decision making. We present a novel platform to measure the harvested, stored and dissipated energy. For being applicable to different environments it allows to attach different energy harvesting devices (EHDs). EHDs do not provide power continuously. Power availability patterns are used to determine how these sources can be used efficiently. Models from harvesting theory try to adapt to it. We implement a model that targets energy neutrality on our platform. It is used to evaluate the model and improve it. Our novel platform can be used to evaluate theories that model different sources. It can utilize and characterize thermoelectric, piezoelectric and magnetic induction generators and solar cells. The measurement platform tracks energy dissipation too. Mote software is implemented to establish communication to the platform. A sample application on top of it shows that the system can be used for software characterization. This paper contributes a novel modular and low-power design for measurement platforms for WSNs. It shows utilization of different energy sources and the ability to supply different mote types. Our work shows how theories for energy harvesting can be evaluated and improved. Our work also contributes to the field of simulation and emulation through online software characterization. The approach improves in accuracy and completeness over the capabilities of offline simulation.
{"title":"A measurement platform for energy harvesting and software characterization in WSNs","authors":"Philipp M. Glatz, Philipp Meyer, A. Janek, T. Trathnigg, C. Steger, R. Weiss","doi":"10.1109/WD.2008.4812843","DOIUrl":"https://doi.org/10.1109/WD.2008.4812843","url":null,"abstract":"Wireless Sensor Network (WSN) nodes are resource- constrained computing devices. Adaptive behavior of autonomously working WSNs tries to maximize the cost efficiency of deployments. This includes maximizing the lifetime through power consumption optimization and recharging energy reservoirs with the use of energy harvesting. The adaptive behavior that leads to efficient resource usage needs information about the WSNs energy balance for decision making. We present a novel platform to measure the harvested, stored and dissipated energy. For being applicable to different environments it allows to attach different energy harvesting devices (EHDs). EHDs do not provide power continuously. Power availability patterns are used to determine how these sources can be used efficiently. Models from harvesting theory try to adapt to it. We implement a model that targets energy neutrality on our platform. It is used to evaluate the model and improve it. Our novel platform can be used to evaluate theories that model different sources. It can utilize and characterize thermoelectric, piezoelectric and magnetic induction generators and solar cells. The measurement platform tracks energy dissipation too. Mote software is implemented to establish communication to the platform. A sample application on top of it shows that the system can be used for software characterization. This paper contributes a novel modular and low-power design for measurement platforms for WSNs. It shows utilization of different energy sources and the ability to supply different mote types. Our work shows how theories for energy harvesting can be evaluated and improved. Our work also contributes to the field of simulation and emulation through online software characterization. The approach improves in accuracy and completeness over the capabilities of offline simulation.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"147 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":"127261572","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 antenna arrays have shown real promise for substantial capacity enhancement of increasing the coverage range and capacity of base stations by directing beam patterns towards the desired signals and null-patterns towards the interferers in third generation (3G) mobile systems. This paper investigates a simple method to evaluate the probability of error in DS-CDMA receivers using a beamformer. This model can be employed to evaluate the average performance for 2D-Rake receivers over frequency selective Rayleigh fading channels.
{"title":"BER performance of smart antenna systems operating over Rayleigh fading channels","authors":"R. Haddad, R. Bouallègue","doi":"10.1109/WD.2008.4812887","DOIUrl":"https://doi.org/10.1109/WD.2008.4812887","url":null,"abstract":"Adaptive antenna arrays have shown real promise for substantial capacity enhancement of increasing the coverage range and capacity of base stations by directing beam patterns towards the desired signals and null-patterns towards the interferers in third generation (3G) mobile systems. This paper investigates a simple method to evaluate the probability of error in DS-CDMA receivers using a beamformer. This model can be employed to evaluate the average performance for 2D-Rake receivers over frequency selective Rayleigh fading channels.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"49 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":"130295046","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}
Both network lifetime and reliability are of major concern in wireless sensor networks. In this paper, we propose to optimize the wireless sensor network lifetime under a reliability constraint. First, we define the reliability with regards to the accuracy of observations made through sensor nodes. Then, we introduce a function that links reliability to the average amount of energy consumed by the network when reporting an event to the data collector. Based on this function, we bring out the required number of successive readings to be performed in order to optimize both network lifetime and reliability. Subsequently, we give a different definition to the reliability in order to maximize the network lifetime by relaxing the reliability constraint. In this case, the reliability is defined with regards to the number of non-reported events. We show that the network lifetime does not increase indefinitely when relaxing the reliability constraint. Finally, we conclude that new node placement strategies should be designed for wireless sensor applications that tolerate losing events (i.e. events that are not reported to the data collector), in order to maximize their network lifetime.
{"title":"Optimizing the wireless sensor network lifetime under reliability constraint","authors":"M. Esseghir, H. Perros","doi":"10.1109/WD.2008.4812881","DOIUrl":"https://doi.org/10.1109/WD.2008.4812881","url":null,"abstract":"Both network lifetime and reliability are of major concern in wireless sensor networks. In this paper, we propose to optimize the wireless sensor network lifetime under a reliability constraint. First, we define the reliability with regards to the accuracy of observations made through sensor nodes. Then, we introduce a function that links reliability to the average amount of energy consumed by the network when reporting an event to the data collector. Based on this function, we bring out the required number of successive readings to be performed in order to optimize both network lifetime and reliability. Subsequently, we give a different definition to the reliability in order to maximize the network lifetime by relaxing the reliability constraint. In this case, the reliability is defined with regards to the number of non-reported events. We show that the network lifetime does not increase indefinitely when relaxing the reliability constraint. Finally, we conclude that new node placement strategies should be designed for wireless sensor applications that tolerate losing events (i.e. events that are not reported to the data collector), in order to maximize their network lifetime.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"129 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":"130479547","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}
S. Manjula, B. Reddy, K. Shaila, L. Nalini, K. Venugopal, L. Patnaik
Wireless Sensor Networks (WSNs) are highly distributed networks of small, light weighted, wireless nodes deployed in large numbers. These sensor nodes are immobile, non rechargeable with limited energy. The cluster-based protocols make judicious use of this limited energy. LEACH-C (Low Energy Adaptive Clustering Hierarchy-Centralized) has a drawback, a lot of energy is consumed by the nodes to send status messages to the base station every round for cluster head selection, LEACH-CE (LEACH Cluster Estimate) protocol overcome this problem. We use this property of LEACH-CE, and improve over it. We propose LEACH-CCB (LEACH- Completely Controlled by Base-station) which presents two techniques through which energy of the nodes is conserved. First, by avoiding frequent communications of the nodes with the base station. Second, by making certain percent of nodes sleep every round. From simulation, we obtain a greater network lifetime than in LEACH-CE.
无线传感器网络(wsn)是由大量部署的小型、轻量级无线节点组成的高度分布式网络。这些传感器节点是固定的，不能充电，能量有限。基于集群的协议明智地利用了这种有限的能量。LEACH- c (Low Energy Adaptive Clustering Hierarchy-Centralized)协议的缺点是节点每轮向基站发送状态消息进行簇头选择需要消耗大量能量，LEACH- ce (LEACH cluster Estimate)协议克服了这一问题。我们利用了LEACH-CE的这一特性，并对其进行了改进。我们提出了LEACH- ccb (LEACH-完全由基站控制)，它提供了两种技术，通过这种技术可以节约节点的能量。首先，避免节点与基站的频繁通信。第二，让每一轮都有一定比例的节点处于休眠状态。通过仿真，我们获得了比LEACH-CE更长的网络寿命。
{"title":"Base-station controlled clustering scheme in wireless sensor networks","authors":"S. Manjula, B. Reddy, K. Shaila, L. Nalini, K. Venugopal, L. Patnaik","doi":"10.1109/WD.2008.4812856","DOIUrl":"https://doi.org/10.1109/WD.2008.4812856","url":null,"abstract":"Wireless Sensor Networks (WSNs) are highly distributed networks of small, light weighted, wireless nodes deployed in large numbers. These sensor nodes are immobile, non rechargeable with limited energy. The cluster-based protocols make judicious use of this limited energy. LEACH-C (Low Energy Adaptive Clustering Hierarchy-Centralized) has a drawback, a lot of energy is consumed by the nodes to send status messages to the base station every round for cluster head selection, LEACH-CE (LEACH Cluster Estimate) protocol overcome this problem. We use this property of LEACH-CE, and improve over it. We propose LEACH-CCB (LEACH- Completely Controlled by Base-station) which presents two techniques through which energy of the nodes is conserved. First, by avoiding frequent communications of the nodes with the base station. Second, by making certain percent of nodes sleep every round. From simulation, we obtain a greater network lifetime than in LEACH-CE.","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":"129504263","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}
One of the key elements of the High Speed Downlink Packet Access (HSDPA) is the fast scheduler located at the base station. For the scheduler to operate efficiently, sufficient amount of traffic needs to be buffered at the base station. However, the users' buffers at the base station are managed by a flow control protocol in order to minimize data loss during handover. We evaluate the necessity of such protocol under reliable higher layer protocols such as RLC and TCP especially at low traffic load and less frequent handover conditions. The impact of this flow control on the Proportional Fair scheduler (PF) is analyzed by comparing two flow control algorithms to the hypothetical case when flow control is eliminated from the system. The results indicate that eliminating the flow control greatly improves the scheduler performance and increases the overall system throughput at low traffic load. However, at high traffic load, eliminating the flow control increases handover data loss to a point that negates the positive improvement of the scheduler performance and reduces the effective system throughput.
{"title":"Impact of Iub flow control on the proportional fair scheduler in HSDPA","authors":"Abdulmohsen Mutairi, U. Baroudi","doi":"10.1109/WD.2008.4812854","DOIUrl":"https://doi.org/10.1109/WD.2008.4812854","url":null,"abstract":"One of the key elements of the High Speed Downlink Packet Access (HSDPA) is the fast scheduler located at the base station. For the scheduler to operate efficiently, sufficient amount of traffic needs to be buffered at the base station. However, the users' buffers at the base station are managed by a flow control protocol in order to minimize data loss during handover. We evaluate the necessity of such protocol under reliable higher layer protocols such as RLC and TCP especially at low traffic load and less frequent handover conditions. The impact of this flow control on the Proportional Fair scheduler (PF) is analyzed by comparing two flow control algorithms to the hypothetical case when flow control is eliminated from the system. The results indicate that eliminating the flow control greatly improves the scheduler performance and increases the overall system throughput at low traffic load. However, at high traffic load, eliminating the flow control increases handover data loss to a point that negates the positive improvement of the scheduler performance and reduces the effective system throughput.","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":"129574800","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}
F. Sottile, Roberta Giannantonio, M. Spirito, F. Bellifemine
This paper proposes a complete system for nodes localization in a Wireless Sensor Network (WSN) based on the ZigBee standard. The system includes a real-time location engine, which adopts a Received Signal Strength Indicator (RSSI)-based localization algorithm, and three tools, namely an Environment Description Tool (EDT), a Channel Modeling Tool (CMT) and a Network Planning Tool (NPT), which enable efficient deployment and accurate operation. Experimental evaluations show how the system performs in a real environment and how the proposed approach improves localization accuracy.
{"title":"Design, deployment and performance of a complete real-time ZigBee localization system","authors":"F. Sottile, Roberta Giannantonio, M. Spirito, F. Bellifemine","doi":"10.1109/WD.2008.4812912","DOIUrl":"https://doi.org/10.1109/WD.2008.4812912","url":null,"abstract":"This paper proposes a complete system for nodes localization in a Wireless Sensor Network (WSN) based on the ZigBee standard. The system includes a real-time location engine, which adopts a Received Signal Strength Indicator (RSSI)-based localization algorithm, and three tools, namely an Environment Description Tool (EDT), a Channel Modeling Tool (CMT) and a Network Planning Tool (NPT), which enable efficient deployment and accurate operation. Experimental evaluations show how the system performs in a real environment and how the proposed approach improves localization accuracy.","PeriodicalId":247938,"journal":{"name":"2008 1st IFIP Wireless Days","volume":"57 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":"123895944","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
扫码关注我们
求助内容：
应助结果提醒方式：