Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.127
A. Srinivasan, Jie Wu
The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK - a novel sink mobility model exploiting the connected dominating set (CDS) property of a network graph. TRACK, to the best of our knowledge, is the first contemporary sink mobility model to exploit the CDS property for WSN lifetime longevity and secure data aggregation. In TRACK, the CDS of the given network is computed and then the minimum spanning tree (MST) of the CDS is constructed. Using the CDS-MST as the underlying framework, a Hamiltonian circuit (HC) is constructed, along which the sink is mobilized to traverse the network. Since TRACK, by the very definition of CDS, passes through the transmission range of every node in the network, data can be relayed directly from the source node to the sink, eliminating the need for multi-hop routing. By virtue of this property, nodes in the WSN are discharged from their routing obligations and data aggregation becomes more secure. Additionally, we propose an extended version of TRACK called M-TRACK in this paper. The extended model trades higher fractions of sensor energy with the objective of minimizing the length of sink trajectory. This consequently minimizes the delay between consecutive sink visits, mitigating buffer-overflow of sensors. M-TRACK does necessitate multi-hop routing, but keeps it within a bounded number of hops. We confirm the efficiency and robustness of our models via simulation and analysis, and show that our model can extend the WSN lifetime up to seven times that which can be achieved using a static sink.
{"title":"TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs","authors":"A. Srinivasan, Jie Wu","doi":"10.1109/ICCCN.2008.ECP.127","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.127","url":null,"abstract":"The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK - a novel sink mobility model exploiting the connected dominating set (CDS) property of a network graph. TRACK, to the best of our knowledge, is the first contemporary sink mobility model to exploit the CDS property for WSN lifetime longevity and secure data aggregation. In TRACK, the CDS of the given network is computed and then the minimum spanning tree (MST) of the CDS is constructed. Using the CDS-MST as the underlying framework, a Hamiltonian circuit (HC) is constructed, along which the sink is mobilized to traverse the network. Since TRACK, by the very definition of CDS, passes through the transmission range of every node in the network, data can be relayed directly from the source node to the sink, eliminating the need for multi-hop routing. By virtue of this property, nodes in the WSN are discharged from their routing obligations and data aggregation becomes more secure. Additionally, we propose an extended version of TRACK called M-TRACK in this paper. The extended model trades higher fractions of sensor energy with the objective of minimizing the length of sink trajectory. This consequently minimizes the delay between consecutive sink visits, mitigating buffer-overflow of sensors. M-TRACK does necessitate multi-hop routing, but keeps it within a bounded number of hops. We confirm the efficiency and robustness of our models via simulation and analysis, and show that our model can extend the WSN lifetime up to seven times that which can be achieved using a static sink.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130609178","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-11-17DOI: 10.1109/ICCCN.2008.ECP.51
T. Nguyen, Duc H. M. Nguyen, B.N. Tran, H. Vu, N. Mittal
In this paper we investigate a special type of denial of service (DoS) attack on 802.11-based networks, namely deauthentication/disassociation attack. In the current IEEE 802.11 standards, whenever a wireless station wants to leave the network, it sends a deauthentication or disassociation frame to the access point. These two frames, however, are sent unencrypted and are not authenticated by the access point. Therefore, an attacker can launch a DoS attack by spoofing these messages and thus disabling the communication between a wireless device and its access point. We propose an efficient solution based on a one way hard function to verify that a deauthentication/disassociation frame is from a legitimate station. We implement our solution on some 802.11 devices and the experimental results show that our protocol is highly effective against this DoS attack.
{"title":"A Lightweight Solution for Defending Against Deauthentication/Disassociation Attacks on 802.11 Networks","authors":"T. Nguyen, Duc H. M. Nguyen, B.N. Tran, H. Vu, N. Mittal","doi":"10.1109/ICCCN.2008.ECP.51","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.51","url":null,"abstract":"In this paper we investigate a special type of denial of service (DoS) attack on 802.11-based networks, namely deauthentication/disassociation attack. In the current IEEE 802.11 standards, whenever a wireless station wants to leave the network, it sends a deauthentication or disassociation frame to the access point. These two frames, however, are sent unencrypted and are not authenticated by the access point. Therefore, an attacker can launch a DoS attack by spoofing these messages and thus disabling the communication between a wireless device and its access point. We propose an efficient solution based on a one way hard function to verify that a deauthentication/disassociation frame is from a legitimate station. We implement our solution on some 802.11 devices and the experimental results show that our protocol is highly effective against this DoS attack.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132634098","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-11-17DOI: 10.1109/ICCCN.2008.ECP.66
Deepak Padmanabhan, Rajesh R. C. Bikram, V. Vokkarane
TCP-based applications account for a majority of data traffic in the Internet; thus understanding and improving the performance of TCP over OBS network is critical. In this paper, we identify the ill-effects of implementing TCP over a hybrid network (IP-access and OBS-core). We purpose a Split- TCP approach for a hybrid IP-OBS network to improve TCP performance. We propose two Split-TCP approaches, namely, 1:1:1 and N:1:N. We evaluate the performance of the proposed approaches over an IP-OBS hybrid network. Based on the simulation results, N:1:N Split-TCP approach outperforms all other approaches.
{"title":"TCP Over Optical Burst Switching (OBS): To Split or Not To Split?","authors":"Deepak Padmanabhan, Rajesh R. C. Bikram, V. Vokkarane","doi":"10.1109/ICCCN.2008.ECP.66","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.66","url":null,"abstract":"TCP-based applications account for a majority of data traffic in the Internet; thus understanding and improving the performance of TCP over OBS network is critical. In this paper, we identify the ill-effects of implementing TCP over a hybrid network (IP-access and OBS-core). We purpose a Split- TCP approach for a hybrid IP-OBS network to improve TCP performance. We propose two Split-TCP approaches, namely, 1:1:1 and N:1:N. We evaluate the performance of the proposed approaches over an IP-OBS hybrid network. Based on the simulation results, N:1:N Split-TCP approach outperforms all other approaches.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132544648","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-11-17DOI: 10.1109/ICCCN.2008.ECP.102
T. Ikuma, M. Naraghi-Pour
Cognitive radio is an enabling technology for opportunistic spectrum access. Spectrum sensing is a key feature of a cognitive radio whereby a secondary user can identify and utilize the spectrum that remains unused by the licensed (primary) users. Among the recently proposed algorithms the covariance-based method of [1] is a constant false alarm rate (CFAR) detector with a fairly low computational complexity. The low computational complexity reduces the detection time and improves the radio agility. In this paper, we present a framework to analyze the performance of this covariance-based method. We also propose a new spectrum sensing technique based on the sample autocorrelation of the received signal. The performance of this algorithm is also evaluated through analysis and simulation. The results obtained from simulation and analysis are very close and verify the accuracy of the approximation assumptions in our analysis. Furthermore, our results show that our proposed algorithm outperforms the algorithm in [1].
{"title":"Autocorrelation-Based Spectrum Sensing Algorithms for Cognitive Radios","authors":"T. Ikuma, M. Naraghi-Pour","doi":"10.1109/ICCCN.2008.ECP.102","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.102","url":null,"abstract":"Cognitive radio is an enabling technology for opportunistic spectrum access. Spectrum sensing is a key feature of a cognitive radio whereby a secondary user can identify and utilize the spectrum that remains unused by the licensed (primary) users. Among the recently proposed algorithms the covariance-based method of [1] is a constant false alarm rate (CFAR) detector with a fairly low computational complexity. The low computational complexity reduces the detection time and improves the radio agility. In this paper, we present a framework to analyze the performance of this covariance-based method. We also propose a new spectrum sensing technique based on the sample autocorrelation of the received signal. The performance of this algorithm is also evaluated through analysis and simulation. The results obtained from simulation and analysis are very close and verify the accuracy of the approximation assumptions in our analysis. Furthermore, our results show that our proposed algorithm outperforms the algorithm in [1].","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123776786","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-11-17DOI: 10.1109/ICCCN.2008.ECP.120
A. Yoshioka, Shariful Hasan Shaikot, Min Sik Kim
A rule-based intrusion detection system compares the incoming packets against rule set in order to detect intrusion. Unfortunately, it spends the majority of CPU time in packet classification to search for rules that match each packet. A common approach is to build a graph such as rule trees or finite automata for a given rule set, and traverse it using a packet as an input string. Because of the increasing number of security threats and vulnerabilities, the number of rules often exceeds thousands requiring more than hundreds of megabytes of memory. Exploring such a huge graph becomes a major bottleneck in high-speed networks since each packet incurs many memory accesses with little locality. In this paper, we propose rule hashing for fast packet classification in intrusion detection systems. The rule hashing, combined with hierarchical rule trees, saves memory and reduce the number of memory accesses by allowing the whole working set to be accommodated in a cache in most of the time, and thus improves response times in finding matching rules. We implement our algorithm in Snort, a popular open-source intrusion detection system. Experimental results show that our implementation is faster than original Snort to deal with the same real packet traces while consuming an order of magnitude less memory.
基于规则的入侵检测系统将收到的数据包与规则集进行比较，以检测入侵。遗憾的是，在数据包分类过程中，系统需要花费大部分 CPU 时间来搜索与每个数据包相匹配的规则。一种常见的方法是为给定的规则集构建规则树或有限自动机等图形，并将数据包作为输入字符串进行遍历。由于安全威胁和漏洞的数量不断增加，规则的数量往往超过数千条，需要超过数百兆字节的内存。在高速网络中，由于每个数据包都会产生大量内存访问，且几乎没有定位，因此探索这样一个庞大的图成为一个主要瓶颈。在本文中，我们提出了在入侵检测系统中进行快速数据包分类的哈希规则。规则散列与分层规则树相结合，可以节省内存并减少内存访问次数，因为在大多数情况下，整个工作集都可以容纳在缓存中，从而提高了查找匹配规则的响应速度。我们在 Snort（一种流行的开源入侵检测系统）中实现了我们的算法。实验结果表明，在处理相同的真实数据包轨迹时，我们的实现比原始 Snort 更快，同时内存消耗也少了一个数量级。
{"title":"Rule Hashing for Efficient Packet Classification in Network Intrusion Detection","authors":"A. Yoshioka, Shariful Hasan Shaikot, Min Sik Kim","doi":"10.1109/ICCCN.2008.ECP.120","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.120","url":null,"abstract":"A rule-based intrusion detection system compares the incoming packets against rule set in order to detect intrusion. Unfortunately, it spends the majority of CPU time in packet classification to search for rules that match each packet. A common approach is to build a graph such as rule trees or finite automata for a given rule set, and traverse it using a packet as an input string. Because of the increasing number of security threats and vulnerabilities, the number of rules often exceeds thousands requiring more than hundreds of megabytes of memory. Exploring such a huge graph becomes a major bottleneck in high-speed networks since each packet incurs many memory accesses with little locality. In this paper, we propose rule hashing for fast packet classification in intrusion detection systems. The rule hashing, combined with hierarchical rule trees, saves memory and reduce the number of memory accesses by allowing the whole working set to be accommodated in a cache in most of the time, and thus improves response times in finding matching rules. We implement our algorithm in Snort, a popular open-source intrusion detection system. Experimental results show that our implementation is faster than original Snort to deal with the same real packet traces while consuming an order of magnitude less memory.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128135608","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-11-17DOI: 10.1109/ICCCN.2008.ECP.164
M. Moghaddam, D. Adjeroh
Different network applications need different Quality of Service (QoS) requirements such as packet delay, packet loss, bandwidth and availability. It is important to develop a network architecture which is able to guaranty quality of service requirements for high priority traffic. In Wireless Multimedia Sensor Networks (WMSNs), a sensor node may have different kinds of sensor which gather different types of data, with differing levels of importance. We argue that the sensor networks should be willing to spend more resources in disseminating packets that carry more important information. Some applications of WMSNs need to send real time traffic toward the sink node. This real time traffic requires low latency and high reliability so that immediate remedial and defensive actions can be taken, where necessary. Similar to wired networks, service differentiation in wireless sensor networks is also very important. In this paper we propose a differentiated service model for WMSNs. The proposed model can provide requested quality of service for high priority real time classes. In the proposed model, we distinguish high priority real time traffic from the low priority non-real time traffic, and input traffic streams are then serviced based on their priorities. Simulation results confirm the efficiency of the proposed model.
{"title":"A Model for Differentiated Service Support in Wireless Multimedia Sensor Networks","authors":"M. Moghaddam, D. Adjeroh","doi":"10.1109/ICCCN.2008.ECP.164","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.164","url":null,"abstract":"Different network applications need different Quality of Service (QoS) requirements such as packet delay, packet loss, bandwidth and availability. It is important to develop a network architecture which is able to guaranty quality of service requirements for high priority traffic. In Wireless Multimedia Sensor Networks (WMSNs), a sensor node may have different kinds of sensor which gather different types of data, with differing levels of importance. We argue that the sensor networks should be willing to spend more resources in disseminating packets that carry more important information. Some applications of WMSNs need to send real time traffic toward the sink node. This real time traffic requires low latency and high reliability so that immediate remedial and defensive actions can be taken, where necessary. Similar to wired networks, service differentiation in wireless sensor networks is also very important. In this paper we propose a differentiated service model for WMSNs. The proposed model can provide requested quality of service for high priority real time classes. In the proposed model, we distinguish high priority real time traffic from the low priority non-real time traffic, and input traffic streams are then serviced based on their priorities. Simulation results confirm the efficiency of the proposed model.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126188118","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-11-17DOI: 10.1109/ICCCN.2008.ECP.44
A. Keller, T. Hossmann, M. May, Ghazi Bouabene, Christophe Jelger, C. Tschudin
A majority of network architectures aim at solving specific shortcomings of the original Internet architecture. While providing solutions for the particular problems, they often lack in flexibility and do not provide general concepts for future networking requirements. In contrast, we introduce a network architecture that aims to be versatile enough to serve as a foundation for the future Internet. The main pillars of our architecture are communication pivots called information dispatch points (IDPs) which embed the concept of modularity at all levels of the architecture. IDPs completely decouple functional entities by means of indirection thus enabling evolving protocol stacks. Our architecture also provides a consistent application programming interface (API) to access node-local or network-wide functionality. In addition to the description of this architecture, we report about a working prototype of the architecture and we give examples of its application.
{"title":"A System Architecture for Evolving Protocol Stacks (Invited Paper)","authors":"A. Keller, T. Hossmann, M. May, Ghazi Bouabene, Christophe Jelger, C. Tschudin","doi":"10.1109/ICCCN.2008.ECP.44","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.44","url":null,"abstract":"A majority of network architectures aim at solving specific shortcomings of the original Internet architecture. While providing solutions for the particular problems, they often lack in flexibility and do not provide general concepts for future networking requirements. In contrast, we introduce a network architecture that aims to be versatile enough to serve as a foundation for the future Internet. The main pillars of our architecture are communication pivots called information dispatch points (IDPs) which embed the concept of modularity at all levels of the architecture. IDPs completely decouple functional entities by means of indirection thus enabling evolving protocol stacks. Our architecture also provides a consistent application programming interface (API) to access node-local or network-wide functionality. In addition to the description of this architecture, we report about a working prototype of the architecture and we give examples of its application.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126980369","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-11-17DOI: 10.1109/ICCCN.2008.ECP.82
S. K. Wahba, S. Dandamudi, Andrew R. Dalton, J. Hallstrom
We present the NePTune approach and supporting system architecture for sensor network optimization. NePTune relies on a control loop strategy with performance monitoring, dynamic source code generation, and network reprogramming. We present an application of the system architecture and explore its efficacy in the context of a resource utilization problem - specifically, to minimize the memory consumption of a neighborhood management service. All experiments are conducted using a physical network testbed consisting of 80 Tmote Sky nodes.
{"title":"NePTune: Optimizing Sensor Networks","authors":"S. K. Wahba, S. Dandamudi, Andrew R. Dalton, J. Hallstrom","doi":"10.1109/ICCCN.2008.ECP.82","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.82","url":null,"abstract":"We present the NePTune approach and supporting system architecture for sensor network optimization. NePTune relies on a control loop strategy with performance monitoring, dynamic source code generation, and network reprogramming. We present an application of the system architecture and explore its efficacy in the context of a resource utilization problem - specifically, to minimize the memory consumption of a neighborhood management service. All experiments are conducted using a physical network testbed consisting of 80 Tmote Sky nodes.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116330298","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-11-17DOI: 10.1109/ICCCN.2008.ECP.132
C. R. Storck, A. Ribeiro, Fátima Duarte-Figueiredo
This work proposes CAC-RD: a call admission control for UMTS (universal mobile terrestrial system) networks. Its main challenge is to guaranty the maximum access/network availability while maintaining satisfactory performance levels. It is based on two schemes: channel reservation and network diagnosis. It reserves dynamically some channels to handovers, based on the network behavior. The diagnosis monitors the network utilization giving information to the CAC-RD decisions. There are some utilization thresholds that drive the blockings, telling CAC-RD when to accept or not a new call. Handovers and the conversational class are the CAC-RD priorities. Simulation results show that CAC-RD can guarantee network availability, reducing priority classes blocking and guarantying some network QoS requirements. Simulations had shown an average reduction of 40% and 11% in handovers and new classes blockings, respectively. Thus, results indicate that CAC-RD can guarantee access and QoS, keeping levels of agreement between performance and availability.
{"title":"CAC-RD: A Call Admission Control for UMTS Networks","authors":"C. R. Storck, A. Ribeiro, Fátima Duarte-Figueiredo","doi":"10.1109/ICCCN.2008.ECP.132","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.132","url":null,"abstract":"This work proposes CAC-RD: a call admission control for UMTS (universal mobile terrestrial system) networks. Its main challenge is to guaranty the maximum access/network availability while maintaining satisfactory performance levels. It is based on two schemes: channel reservation and network diagnosis. It reserves dynamically some channels to handovers, based on the network behavior. The diagnosis monitors the network utilization giving information to the CAC-RD decisions. There are some utilization thresholds that drive the blockings, telling CAC-RD when to accept or not a new call. Handovers and the conversational class are the CAC-RD priorities. Simulation results show that CAC-RD can guarantee network availability, reducing priority classes blocking and guarantying some network QoS requirements. Simulations had shown an average reduction of 40% and 11% in handovers and new classes blockings, respectively. Thus, results indicate that CAC-RD can guarantee access and QoS, keeping levels of agreement between performance and availability.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129431326","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-11-17DOI: 10.1109/ICCCN.2008.ECP.166
S. Tennina, M. Renzo
In recent contributions [Tennina, S., et al., 2008], [Tennina, S., 2008], we have provided a comparative analysis of various optimization algorithms, which can be used for atomic location estimation, and suggested an enhanced version of the steepest descent (ESD) algorithm, which we have shown to be competitive with well-known distributed localization algorithms in terms of estimation accuracy and numerical complexity. Moreover, in [Tennina, S., 2008] we have conducted a statistical characterization of the positioning error distribution of the ESD algorithm, and shown that the latter error can be well approximated by the family of Pearson distributions. However, the analysis in [Tennina, S., et al., 2008; Tennina, S., 2008; Tennina, S., 2008] is mainly based on numerical (i.e., computer-based) simulations, which only in part allows to predict the system performance in a realistic environment where sensor nodes are expected to operate. As a consequence, the aim of this contribution is twofold: i) to analyze the error performance of the ESD algorithm in a real testbed platform working in a typical indoor environment, and ii) to compare experimental and simulated results to substantiate via real measurements our previous findings useful for network setup and analysis. In particular, we will first report on the implementation issues related on mapping the ESD algorithm on the CrossBow's MICAz sensor node platform [http://www.xbow.com/Products/wproductsoverview.aspx.], and, then, we will investigate, via real experiments, on the effect of network topology and ranging errors in estimating the final position of an unknown sensor node.
{"title":"ESD: A Novel Optimization Algorithm for Positioning Estimation in Wireless Sensor Networks - Analysis and Experimental Validation via a Testbed Platform","authors":"S. Tennina, M. Renzo","doi":"10.1109/ICCCN.2008.ECP.166","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.166","url":null,"abstract":"In recent contributions [Tennina, S., et al., 2008], [Tennina, S., 2008], we have provided a comparative analysis of various optimization algorithms, which can be used for atomic location estimation, and suggested an enhanced version of the steepest descent (ESD) algorithm, which we have shown to be competitive with well-known distributed localization algorithms in terms of estimation accuracy and numerical complexity. Moreover, in [Tennina, S., 2008] we have conducted a statistical characterization of the positioning error distribution of the ESD algorithm, and shown that the latter error can be well approximated by the family of Pearson distributions. However, the analysis in [Tennina, S., et al., 2008; Tennina, S., 2008; Tennina, S., 2008] is mainly based on numerical (i.e., computer-based) simulations, which only in part allows to predict the system performance in a realistic environment where sensor nodes are expected to operate. As a consequence, the aim of this contribution is twofold: i) to analyze the error performance of the ESD algorithm in a real testbed platform working in a typical indoor environment, and ii) to compare experimental and simulated results to substantiate via real measurements our previous findings useful for network setup and analysis. In particular, we will first report on the implementation issues related on mapping the ESD algorithm on the CrossBow's MICAz sensor node platform [http://www.xbow.com/Products/wproductsoverview.aspx.], and, then, we will investigate, via real experiments, on the effect of network topology and ranging errors in estimating the final position of an unknown sensor node.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129949480","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
扫码关注我们
求助内容：
应助结果提醒方式：