Pub Date : 2005-03-13DOI: 10.1109/INFCOM.2005.1498441
Chun-Ting Chou, S. Shankar, K. Shin
To support the transmission of (high-rate and oftenbursty) multimedia data with performance guarantees in an IEEE 802.11e wireless local area network (LAN), it is crucial to design judicious algorithms for admission control and resource allocation. The traffic specification element (TSPEC) of the new IEEE 802.11e standard is used to facilitate the design of the admission control. Based on the traffic profile given in the TSPEC and the dual-token bucket regulation, a guaranteed rate is derived for our airtime-based admission control. The admission control is integrated with the contention-based enhanced distributed channel access (EDCA), which together can provide so-called "parameterized QoS" - as in the polling-based HCF controlled channel access (HCCA) - via a new distributed, quantitative control of stations' airtime usage. We also extend the current QoS signaling of HCCA defined in IEEE 802.11e to perform admission control for this enhanced EDCA. Furthermore, we extend the integrated scheme for QoS provisioning in ad hoc wireless LANs and design appropriate signaling procedures. We evaluate via simulation the effectiveness of this parameterized QoS-capable EDCA scheme, and demonstrate its advantages over the centralized, polling-based HCCA scheme.
{"title":"Achieving per-stream QoS with distributed airtime allocation and admission control in IEEE 802.11e wireless LANs","authors":"Chun-Ting Chou, S. Shankar, K. Shin","doi":"10.1109/INFCOM.2005.1498441","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498441","url":null,"abstract":"To support the transmission of (high-rate and oftenbursty) multimedia data with performance guarantees in an IEEE 802.11e wireless local area network (LAN), it is crucial to design judicious algorithms for admission control and resource allocation. The traffic specification element (TSPEC) of the new IEEE 802.11e standard is used to facilitate the design of the admission control. Based on the traffic profile given in the TSPEC and the dual-token bucket regulation, a guaranteed rate is derived for our airtime-based admission control. The admission control is integrated with the contention-based enhanced distributed channel access (EDCA), which together can provide so-called \"parameterized QoS\" - as in the polling-based HCF controlled channel access (HCCA) - via a new distributed, quantitative control of stations' airtime usage. We also extend the current QoS signaling of HCCA defined in IEEE 802.11e to perform admission control for this enhanced EDCA. Furthermore, we extend the integrated scheme for QoS provisioning in ad hoc wireless LANs and design appropriate signaling procedures. We evaluate via simulation the effectiveness of this parameterized QoS-capable EDCA scheme, and demonstrate its advantages over the centralized, polling-based HCCA scheme.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"19 1","pages":"1584-1595 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90176769","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498529
Abhimanyu Das, Debojyoti Dutta, A. Helmy, Ashish Goel, J. Heidemann
Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the space complexity of fairness algorithms, and the communication complexity of distributed global fairness algorithms. We show that in order to enforce max-min fairness with bounded errors, a router must maintain per-flow state. Then we present a practical edge-marking based architecture to demonstrate the enforcement of approximate global max-min fairness for representative scenarios with multiple bottlenecks and non-responsive traffic. We validate our architecture using packet level simulations.
{"title":"Low-state fairness: lower bounds and practical enforcement","authors":"Abhimanyu Das, Debojyoti Dutta, A. Helmy, Ashish Goel, J. Heidemann","doi":"10.1109/INFCOM.2005.1498529","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498529","url":null,"abstract":"Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the space complexity of fairness algorithms, and the communication complexity of distributed global fairness algorithms. We show that in order to enforce max-min fairness with bounded errors, a router must maintain per-flow state. Then we present a practical edge-marking based architecture to demonstrate the enforcement of approximate global max-min fairness for representative scenarios with multiple bottlenecks and non-responsive traffic. We validate our architecture using packet level simulations.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"75 1","pages":"2436-2446 vol. 4"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88932387","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498469
Yingqun Yu, G. Giannakis
Contention tree algorithms have provable stability properties, and are known to achieve stable throughput as high as 0.487 for the infinite population Poisson model. A common feature in all these random access protocols is that collided packets at the receive-node are always discarded. In this paper, we derive a novel tree algorithm (TA) that we naturally term SICTA because it relies on successive interference cancellation to resolve collided packets. Performance metrics including throughput and delay are analyzed to establish that SICTA outperforms existing contention tree algorithms reaching 0.693 in stable throughput.
{"title":"SICTA: a 0.693 contention tree algorithm using successive interference cancellation","authors":"Yingqun Yu, G. Giannakis","doi":"10.1109/INFCOM.2005.1498469","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498469","url":null,"abstract":"Contention tree algorithms have provable stability properties, and are known to achieve stable throughput as high as 0.487 for the infinite population Poisson model. A common feature in all these random access protocols is that collided packets at the receive-node are always discarded. In this paper, we derive a novel tree algorithm (TA) that we naturally term SICTA because it relies on successive interference cancellation to resolve collided packets. Performance metrics including throughput and delay are analyzed to establish that SICTA outperforms existing contention tree algorithms reaching 0.693 in stable throughput.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"1 1","pages":"1908-1916 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83097438","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498555
M. Sharif, B. Hassibi
We consider a single-antenna broadcast block fading channel (downlink scheduling) with n users where the transmission is packet-based and all users are backlogged. We define the delay as the minimum number of channel uses that guarantees all n users successfully receive m packets. This is a more stringent notion of delay than average delay and is the worst case delay among the users. A delay optimal scheduling scheme, such as round-robin, achieves the delay of mn. In a heterogeneous network and for the optimal throughput strategy where the transmitter sends the packet to the user with the best channel conditions, we derive the moment generating-function of the delay for any m and n. For large n and in a homogeneous network, the expected delay in receiving one packet by all the receivers scales as n logn, as opposed to n for the round-robin scheduling. We also show that when m grows faster than (logn)/sup r/, for some r>1, then the expected value of delay scales like mn. This roughly determines the time-scale required for the system to behave fairly in a homogeneous network. We then propose a scheme to significantly reduce the delay at the expense of a small throughput hit. We further look into two generalizations of our work: i) the effect of temporal channel correlation and ii) the advantage of multiple transmit antennas on the delay. For a channel with memory of two, we prove that the delay scales again like n logn no matter how severe the correlation is. For a system with M transmit antennas, we prove that the expected delay in receiving one packet by all the users scales like n log n/(M+O(M/sup 2//n)) for large n when M is not growing faster than logn. Thus, when the temporal channel correlation is zero, multiple transmit antenna systems do not reduce the delay significantly. However, when channel correlation is present, they can lead to significant gains by "decorrelating" the effective channel through means such as random beamforming.
{"title":"A delay analysis for opportunistic transmission in fading broadcast channels","authors":"M. Sharif, B. Hassibi","doi":"10.1109/INFCOM.2005.1498555","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498555","url":null,"abstract":"We consider a single-antenna broadcast block fading channel (downlink scheduling) with n users where the transmission is packet-based and all users are backlogged. We define the delay as the minimum number of channel uses that guarantees all n users successfully receive m packets. This is a more stringent notion of delay than average delay and is the worst case delay among the users. A delay optimal scheduling scheme, such as round-robin, achieves the delay of mn. In a heterogeneous network and for the optimal throughput strategy where the transmitter sends the packet to the user with the best channel conditions, we derive the moment generating-function of the delay for any m and n. For large n and in a homogeneous network, the expected delay in receiving one packet by all the receivers scales as n logn, as opposed to n for the round-robin scheduling. We also show that when m grows faster than (logn)/sup r/, for some r>1, then the expected value of delay scales like mn. This roughly determines the time-scale required for the system to behave fairly in a homogeneous network. We then propose a scheme to significantly reduce the delay at the expense of a small throughput hit. We further look into two generalizations of our work: i) the effect of temporal channel correlation and ii) the advantage of multiple transmit antennas on the delay. For a channel with memory of two, we prove that the delay scales again like n logn no matter how severe the correlation is. For a system with M transmit antennas, we prove that the expected delay in receiving one packet by all the users scales like n log n/(M+O(M/sup 2//n)) for large n when M is not growing faster than logn. Thus, when the temporal channel correlation is zero, multiple transmit antenna systems do not reduce the delay significantly. However, when channel correlation is present, they can lead to significant gains by \"decorrelating\" the effective channel through means such as random beamforming.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"126 1","pages":"2720-2730 vol. 4"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84767310","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498437
M. Adler, Rakesh Kumar, K. Ross, D. Rubenstein, Torsten Suel, D. Yao
In a P2P system, a client peer may select one or more server peers to download a specific file. In a P2P resource economy, the server peers charge the client for the downloading. A server peer's price would naturally depend on the specific object being downloaded, the duration of the download, and the rate at which the download is to occur. The optimal peer selection problem is to select, from the set of peers that have the desired object, the subset of peers and download rates that minimizes cost. In this paper we examine a number of natural peer selection problems for both P2P downloading and P2P streaming. For downloading, we obtain the optimal solution for minimizing the download delay subject to a budget constraint, as well as the corresponding Nash equilibrium. For the streaming problem, we obtain a solution that minimizes cost subject to continuous playback while allowing for one or more server peers to fail during the streaming process. The methodologies developed in this paper are applicable to a variety of P2P resource economy problems.
{"title":"Optimal peer selection for P2P downloading and streaming","authors":"M. Adler, Rakesh Kumar, K. Ross, D. Rubenstein, Torsten Suel, D. Yao","doi":"10.1109/INFCOM.2005.1498437","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498437","url":null,"abstract":"In a P2P system, a client peer may select one or more server peers to download a specific file. In a P2P resource economy, the server peers charge the client for the downloading. A server peer's price would naturally depend on the specific object being downloaded, the duration of the download, and the rate at which the download is to occur. The optimal peer selection problem is to select, from the set of peers that have the desired object, the subset of peers and download rates that minimizes cost. In this paper we examine a number of natural peer selection problems for both P2P downloading and P2P streaming. For downloading, we obtain the optimal solution for minimizing the download delay subject to a budget constraint, as well as the corresponding Nash equilibrium. For the streaming problem, we obtain a solution that minimizes cost subject to continuous playback while allowing for one or more server peers to fail during the streaming process. The methodologies developed in this paper are applicable to a variety of P2P resource economy problems.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"13 1","pages":"1538-1549 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87343387","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498465
R. Oliveira, T. Braun
Multihop wireless networks based on the IEEE 802.11 MAC protocol are promising for ad hoc networks in small scale today. The 802.11 protocol minimizes the well-known hidden node problem but does not eliminate it completely. Consequently, the end-to-end bandwidth utilization may be quite poor if the involved protocols do not interact smoothly. In particular, the TCP protocol does not manage to obtain efficient bandwidth utilization because its congestion control mechanism is not tailored to such a complex environment. The main problems with TCP in such networks are the excessive amount of both spurious retransmissions and contention between data and acknowledgment (ACK) packets for the transmission medium. In this paper, we propose a dynamic adaptive strategy for minimizing the number of ACK packets in transit and mitigating spurious retransmissions. Using this strategy, the receiver adjusts itself to the wireless channel condition by delaying more ACK packets when the channel is in good condition and less otherwise. Our technique not only improves bandwidth utilization but also reduces power consumption by retransmitting much less than a regular TCP does. Extensive simulation evaluations show that our scheme provides very good enhancements in a variety of scenarios.
{"title":"A dynamic adaptive acknowledgment strategy for TCP over multihop wireless networks","authors":"R. Oliveira, T. Braun","doi":"10.1109/INFCOM.2005.1498465","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498465","url":null,"abstract":"Multihop wireless networks based on the IEEE 802.11 MAC protocol are promising for ad hoc networks in small scale today. The 802.11 protocol minimizes the well-known hidden node problem but does not eliminate it completely. Consequently, the end-to-end bandwidth utilization may be quite poor if the involved protocols do not interact smoothly. In particular, the TCP protocol does not manage to obtain efficient bandwidth utilization because its congestion control mechanism is not tailored to such a complex environment. The main problems with TCP in such networks are the excessive amount of both spurious retransmissions and contention between data and acknowledgment (ACK) packets for the transmission medium. In this paper, we propose a dynamic adaptive strategy for minimizing the number of ACK packets in transit and mitigating spurious retransmissions. Using this strategy, the receiver adjusts itself to the wireless channel condition by delaying more ACK packets when the channel is in good condition and less otherwise. Our technique not only improves bandwidth utilization but also reduces power consumption by retransmitting much less than a regular TCP does. Extensive simulation evaluations show that our scheme provides very good enhancements in a variety of scenarios.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"16 1","pages":"1863-1874 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90632399","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498317
Fred Stann, J. Heidemann
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the most costly aspect if meta-data does not exist to guide the search. Geographic routing can minimize search cost when resources are defined by location, and hash-based techniques like data-centric storage can make searching more efficient, subject to increased storage cost. In general, however, flooding is required to locate all resources matching a specification. In this paper, we propose BARD, Bayesian-assisted resource discovery, an approach that optimizes resource discovery in sensor networks by modeling search and routing as a stochastic process. BARD exploits the attribute structure of diffusion and prior routing history to avoid flooding for similar queries. BARD models attributes as random variables and finds routes to arbitrary value sets via Bayesian estimation. Results of occasional flooded queries establish a baseline probability distribution, which is used to focus additional queries. Since this process is probabilistic and approximate, even partial matches from prior searches can still reduce the scope of search. We evaluate the benefits of BARD by extending directed diffusion and examining control overhead with and without our Bayesian filter. These simulations demonstrate a 28% to 73% reduction in control traffic, depending on the number and locations of sources and sinks.
{"title":"BARD: Bayesian-assisted resource discovery in sensor networks","authors":"Fred Stann, J. Heidemann","doi":"10.1109/INFCOM.2005.1498317","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498317","url":null,"abstract":"Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the most costly aspect if meta-data does not exist to guide the search. Geographic routing can minimize search cost when resources are defined by location, and hash-based techniques like data-centric storage can make searching more efficient, subject to increased storage cost. In general, however, flooding is required to locate all resources matching a specification. In this paper, we propose BARD, Bayesian-assisted resource discovery, an approach that optimizes resource discovery in sensor networks by modeling search and routing as a stochastic process. BARD exploits the attribute structure of diffusion and prior routing history to avoid flooding for similar queries. BARD models attributes as random variables and finds routes to arbitrary value sets via Bayesian estimation. Results of occasional flooded queries establish a baseline probability distribution, which is used to focus additional queries. Since this process is probabilistic and approximate, even partial matches from prior searches can still reduce the scope of search. We evaluate the benefits of BARD by extending directed diffusion and examining control overhead with and without our Bayesian filter. These simulations demonstrate a 28% to 73% reduction in control traffic, depending on the number and locations of sources and sinks.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"15 1","pages":"866-877 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90687501","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 : 2005-03-13DOI: 10.1109/infcom.2005.1497916
Aravind Velayutham, K. Sundaresan, Raghupathy Sivakumar
The communication model typically assumed in wireless ad-hoc networks is based on a traditional "pipelined relay" (PR} strategy. In PR, an end-to-end flow has multiple outstanding packets (or data units) along the path from the source to the destination. In this paper, we argue that due to several unique properties of wireless ad-hoc networks, PR can be fundamentally improved upon. We present a new non-pipelined relay (nPR) strategy, where end-to-end flows have exactly one outstanding packet (or data unit) along the end-to-end path. We show that nPR has the following properties: (i) under idealized network conditions, it provides performance improvement, in terms of end-to-end throughput capacity and network transport capacity over PR, and achieves proportional fairness; and (ii) under practical network conditions, it further increases the above performance improvements, both in terms of the throughput achieved, and in terms of the fairness between flows. Finally, we present a forwarding protocol that practically realizes nPR. Through analysis and ns2 based packet level simulations, we evaluate the performance of the proposed strategy, and that of the forwarding protocol.
{"title":"Non-pipelined relay improves throughput performance of wireless ad-hoc networks","authors":"Aravind Velayutham, K. Sundaresan, Raghupathy Sivakumar","doi":"10.1109/infcom.2005.1497916","DOIUrl":"https://doi.org/10.1109/infcom.2005.1497916","url":null,"abstract":"The communication model typically assumed in wireless ad-hoc networks is based on a traditional \"pipelined relay\" (PR} strategy. In PR, an end-to-end flow has multiple outstanding packets (or data units) along the path from the source to the destination. In this paper, we argue that due to several unique properties of wireless ad-hoc networks, PR can be fundamentally improved upon. We present a new non-pipelined relay (nPR) strategy, where end-to-end flows have exactly one outstanding packet (or data unit) along the end-to-end path. We show that nPR has the following properties: (i) under idealized network conditions, it provides performance improvement, in terms of end-to-end throughput capacity and network transport capacity over PR, and achieves proportional fairness; and (ii) under practical network conditions, it further increases the above performance improvements, both in terms of the throughput achieved, and in terms of the fairness between flows. Finally, we present a forwarding protocol that practically realizes nPR. Through analysis and ns2 based packet level simulations, we evaluate the performance of the proposed strategy, and that of the forwarding protocol.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"89 2 1","pages":"477-490 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90976786","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497918
Wensheng Zhang, G. Cao
When a sensor network is deployed in hostile environments, the adversary may compromise some sensor nodes, and use the compromised nodes to inject false sensing reports or modify the reports sent by other nodes. In order to defend against the attacks with low cost, researchers have proposed symmetric group key-based en-route filtering schemes, such as SEF [F. Ye et al., March 2004] and I-LHAP [S. Zhu et al., 2004]. However, if the adversary has compromised a large number of nodes, many group keys can be captured, and the filtering schemes may become ineffective or even useless. To deal with node compromise, the compromised nodes should be identified and the innocent nodes should update their group keys. Some existing intruder identification schemes can be used to identify the compromised nodes, but most existing group rekeying schemes are not suitable for sensor networks since they have large overhead and are not scalable. To address the problem, we propose a family of predistribution and local collaboration-based group rekeying (PCGR) schemes. These schemes are designed based on the ideas that future group keys can be preloaded to the sensor nodes before deployment, and neighbors can collaborate to protect and appropriately use the preloaded keys. Extensive analyses and simulations are conducted to evaluate the proposed schemes, and the results show that the proposed schemes can achieve a good level of security, outperform most previous group rekeying schemes, and significantly improve the effectiveness of filtering false data.
当传感器网络部署在敌对环境中时，攻击者可能会入侵某些传感器节点，并利用这些节点注入虚假的感知报告或修改其他节点发送的报告。为了以低成本防御攻击，研究人员提出了基于对称组密钥的路由过滤方案，如SEF [F]。Ye et al.， March 2004]和I-LHAP [S。Zhu等，2004]。但是，如果攻击者已经破坏了大量节点，则可以捕获许多组密钥，并且过滤方案可能变得无效甚至无用。为了处理节点泄露，应该识别被泄露的节点，而无辜的节点应该更新它们的组密钥。现有的一些入侵者识别方案可用于识别被入侵的节点，但大多数现有的组密钥更新方案由于开销大且不可扩展而不适合传感器网络。为了解决这个问题，我们提出了一系列基于预分发和本地协作的组密钥更新(PCGR)方案。这些方案的设计思想是，未来的组密钥可以在部署前预加载到传感器节点，并且邻居可以协作保护和适当使用预加载的密钥。通过大量的分析和仿真对所提出的方案进行了评价，结果表明所提出的方案具有良好的安全性，优于大多数先前的组密钥更新方案，并显著提高了过滤虚假数据的有效性。
{"title":"Group rekeying for filtering false data in sensor networks: a predistribution and local collaboration-based approach","authors":"Wensheng Zhang, G. Cao","doi":"10.1109/INFCOM.2005.1497918","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497918","url":null,"abstract":"When a sensor network is deployed in hostile environments, the adversary may compromise some sensor nodes, and use the compromised nodes to inject false sensing reports or modify the reports sent by other nodes. In order to defend against the attacks with low cost, researchers have proposed symmetric group key-based en-route filtering schemes, such as SEF [F. Ye et al., March 2004] and I-LHAP [S. Zhu et al., 2004]. However, if the adversary has compromised a large number of nodes, many group keys can be captured, and the filtering schemes may become ineffective or even useless. To deal with node compromise, the compromised nodes should be identified and the innocent nodes should update their group keys. Some existing intruder identification schemes can be used to identify the compromised nodes, but most existing group rekeying schemes are not suitable for sensor networks since they have large overhead and are not scalable. To address the problem, we propose a family of predistribution and local collaboration-based group rekeying (PCGR) schemes. These schemes are designed based on the ideas that future group keys can be preloaded to the sensor nodes before deployment, and neighbors can collaborate to protect and appropriately use the preloaded keys. Extensive analyses and simulations are conducted to evaluate the proposed schemes, and the results show that the proposed schemes can achieve a good level of security, outperform most previous group rekeying schemes, and significantly improve the effectiveness of filtering false data.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"23 1","pages":"503-514 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91365459","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498480
Patrick Hosein
In traditional CDMA wireless networks, real-time services, such as circuit-switched voice, are transported over the air via synchronous channels because of their stringent delay requirements. In the third generation networks (3G), IxEV-DV [A.Soong et al., 2003] and HSDPA [E. Dahlman et al., 1998], an additional time shared channel was introduced on the forward link to support data services for which delay requirements are less stringent. The IxEV-DO [P. Bender et al., 2000] standard provides a single time-shared forward link channel and no synchronous channels since it was designed primarily for data services. It has recently been suggested that certain voice services (e.g.. Voice over IP (VoIP) and push-to-talk (PTT)), can be efficiently transported over such time-shared channels since they have less stringent delay requirements compared to circuit-switched voice. In this paper we investigate the capacity of VoIP users over these time-shared channels and investigate the sensitivity to various base station (BS) and mobile station (MS) design parameters, algorithms and features. Note that detailed simulations of each standard is not provided but rather a comparative approach is used whereby we investigate specific features of each standard. Our focus is on the forward channel since code division multiplexing is performed in the reverse link and hence comparable user capacities are achieved.
在传统的CDMA无线网络中，实时业务，如电路交换语音，由于其严格的延迟要求，通过同步信道在空中传输。在第三代网络(3G)中，IxEV-DV [A]。[j]。Dahlman et al.， 1998]，在转发链路上引入了一个额外的时间共享通道，以支持延迟要求不那么严格的数据服务。IxEV-DO [P]Bender等人，2000]标准提供了一个单一的分时转发链路通道，没有同步通道，因为它主要是为数据服务设计的。最近有人建议某些语音服务(例如……IP语音(VoIP)和一键通(PTT)可以在这种分时信道上有效地传输，因为与电路交换语音相比，它们对延迟的要求不那么严格。在本文中，我们研究了VoIP用户在这些分时信道上的容量，并研究了对各种基站(BS)和移动站(MS)设计参数、算法和特征的敏感性。请注意，没有提供每个标准的详细模拟，而是使用比较方法来研究每个标准的具体特征。我们的重点是前向信道，因为在反向链路上执行码分复用，因此实现了相当的用户容量。
{"title":"Capacity of packetized voice services over time-shared wireless packet data channels","authors":"Patrick Hosein","doi":"10.1109/INFCOM.2005.1498480","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498480","url":null,"abstract":"In traditional CDMA wireless networks, real-time services, such as circuit-switched voice, are transported over the air via synchronous channels because of their stringent delay requirements. In the third generation networks (3G), IxEV-DV [A.Soong et al., 2003] and HSDPA [E. Dahlman et al., 1998], an additional time shared channel was introduced on the forward link to support data services for which delay requirements are less stringent. The IxEV-DO [P. Bender et al., 2000] standard provides a single time-shared forward link channel and no synchronous channels since it was designed primarily for data services. It has recently been suggested that certain voice services (e.g.. Voice over IP (VoIP) and push-to-talk (PTT)), can be efficiently transported over such time-shared channels since they have less stringent delay requirements compared to circuit-switched voice. In this paper we investigate the capacity of VoIP users over these time-shared channels and investigate the sensitivity to various base station (BS) and mobile station (MS) design parameters, algorithms and features. Note that detailed simulations of each standard is not provided but rather a comparative approach is used whereby we investigate specific features of each standard. Our focus is on the forward channel since code division multiplexing is performed in the reverse link and hence comparable user capacities are achieved.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"9 1","pages":"2032-2043 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80527983","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
扫码关注我们
求助内容：
应助结果提醒方式：