Pub Date : 2012-02-16DOI: 10.1109/WONS.2012.6152238
Thomas Demoor, S. Andreev, K. D. Turck, H. Bruneel, D. Fiems
Cooperation is crucial in (next-generation) wireless networks as it can greatly attribute to ensuring connectivity, reliability, performance, ... Relaying looks promising in a wide variety of network types (cellular, ad-hoc on-demand), each using a certain protocol. Energy efficiency constitutes another key aspect of such networks, as battery power is often limited, and is typically achieved by sleep mode operation. As the range of applications is very broad, rather than modelling one of the protocols in detail, we construct a high-level model capturing the two essential characteristics of cooperation and energy efficiency: relaying and sleep mode, and study their interaction. The used analytical approach allows for accurate performance evaluation and enables us to unveil less trivial trade-offs and to formulate rules-of-thumb applicable across all potential scenarios.
{"title":"On the effect of combining cooperative communication with sleep mode","authors":"Thomas Demoor, S. Andreev, K. D. Turck, H. Bruneel, D. Fiems","doi":"10.1109/WONS.2012.6152238","DOIUrl":"https://doi.org/10.1109/WONS.2012.6152238","url":null,"abstract":"Cooperation is crucial in (next-generation) wireless networks as it can greatly attribute to ensuring connectivity, reliability, performance, ... Relaying looks promising in a wide variety of network types (cellular, ad-hoc on-demand), each using a certain protocol. Energy efficiency constitutes another key aspect of such networks, as battery power is often limited, and is typically achieved by sleep mode operation. As the range of applications is very broad, rather than modelling one of the protocols in detail, we construct a high-level model capturing the two essential characteristics of cooperation and energy efficiency: relaying and sleep mode, and study their interaction. The used analytical approach allows for accurate performance evaluation and enables us to unveil less trivial trade-offs and to formulate rules-of-thumb applicable across all potential scenarios.","PeriodicalId":309036,"journal":{"name":"2012 9th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127662114","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 : 2012-02-16DOI: 10.1109/WONS.2012.6152228
Bjorn Muntwyler, Vincent Lenders, F. Legendre, B. Plattner
The IEEE 802.15.4 standard specifies an M-ary spread spectrum system with public and fixed spreading sequences. We propose instead to use secret and dynamic, random spreading sequences to obfuscate communications. Through theory and experiments with a prototype IEEE 802.15.4 transmitter and receiver that have been adapted to use random and dynamic codes, we quantify the benefits and performance implications of our approach. We first give a theoretical approximation of the performance loss when secret random codes are used instead of the IEEE 802.15.4 codes. We identify then three transitional regions for IEEE 802.15.4 communication above thermal noise i.e., when the incoming power level at the attacker is above thermal noise. We derive the obfuscation gain for signal detection and signal interception attacks respectively in these regions. Our implementation shows the feasibility of our approach. It is also used to evaluate the performance loss and time requirements to perform attacks on the system under realistic wireless conditions.
{"title":"Obfuscating IEEE 802.15.4 communication using secret spreading codes","authors":"Bjorn Muntwyler, Vincent Lenders, F. Legendre, B. Plattner","doi":"10.1109/WONS.2012.6152228","DOIUrl":"https://doi.org/10.1109/WONS.2012.6152228","url":null,"abstract":"The IEEE 802.15.4 standard specifies an M-ary spread spectrum system with public and fixed spreading sequences. We propose instead to use secret and dynamic, random spreading sequences to obfuscate communications. Through theory and experiments with a prototype IEEE 802.15.4 transmitter and receiver that have been adapted to use random and dynamic codes, we quantify the benefits and performance implications of our approach. We first give a theoretical approximation of the performance loss when secret random codes are used instead of the IEEE 802.15.4 codes. We identify then three transitional regions for IEEE 802.15.4 communication above thermal noise i.e., when the incoming power level at the attacker is above thermal noise. We derive the obfuscation gain for signal detection and signal interception attacks respectively in these regions. Our implementation shows the feasibility of our approach. It is also used to evaluate the performance loss and time requirements to perform attacks on the system under realistic wireless conditions.","PeriodicalId":309036,"journal":{"name":"2012 9th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)","volume":"919 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131825629","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 : 2012-02-16DOI: 10.1109/WONS.2012.6152218
Marcel Bosling, Torsten Redmann, Jean Tekam, Elias Weingärtner, Klaus Wehrle
The recent arrival of 6LoWPAN, an IPv6 variant for low-power wireless devices, allows for the development of IP-based applications for low-power wireless networks like sensor networks. As these networks often suffer from unreliable radio channels or frequent node failure, the question arises how 6LoWPAN-based applications can be hardened against such issues. In this paper, we examine if well-known concepts from the research domain of P2P networks can be applied for increasing the robustness of 6LoWPAN networks. For this purpose, we design and implement a straightforward P2P system for data sharing that is adapted to the low system capabilities of a typical 6LoWPAN device. Our preliminary evaluation shows that P2P mechanisms like swarm loading are able to improve the robustness of a 6LoWPAN application.
{"title":"Can P2P swarm loading improve the robustness of 6LoWPAN data transfer?","authors":"Marcel Bosling, Torsten Redmann, Jean Tekam, Elias Weingärtner, Klaus Wehrle","doi":"10.1109/WONS.2012.6152218","DOIUrl":"https://doi.org/10.1109/WONS.2012.6152218","url":null,"abstract":"The recent arrival of 6LoWPAN, an IPv6 variant for low-power wireless devices, allows for the development of IP-based applications for low-power wireless networks like sensor networks. As these networks often suffer from unreliable radio channels or frequent node failure, the question arises how 6LoWPAN-based applications can be hardened against such issues. In this paper, we examine if well-known concepts from the research domain of P2P networks can be applied for increasing the robustness of 6LoWPAN networks. For this purpose, we design and implement a straightforward P2P system for data sharing that is adapted to the low system capabilities of a typical 6LoWPAN device. Our preliminary evaluation shows that P2P mechanisms like swarm loading are able to improve the robustness of a 6LoWPAN application.","PeriodicalId":309036,"journal":{"name":"2012 9th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123978254","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 : 2012-02-16DOI: 10.1109/WONS.2012.6152237
D. Leith, B. Zarikoff
In this paper we consider a wireless link subject to on-off interference. We show that by using different size packets and by measuring the packet error rate as a function of packet transmit duration on the air, the distribution of the off times between interference bursts can be accurately estimated. In the context of white space usage, this directly corresponds to estimation of the time duration of the spectrum hole usable by a secondary station. By being able to carry out sensing without requiring the transmitter to remain silent, this creates the potential for significant throughput gains.
{"title":"Non-parametric maximum likelihood estimation of pulsed interference on wireless links","authors":"D. Leith, B. Zarikoff","doi":"10.1109/WONS.2012.6152237","DOIUrl":"https://doi.org/10.1109/WONS.2012.6152237","url":null,"abstract":"In this paper we consider a wireless link subject to on-off interference. We show that by using different size packets and by measuring the packet error rate as a function of packet transmit duration on the air, the distribution of the off times between interference bursts can be accurately estimated. In the context of white space usage, this directly corresponds to estimation of the time duration of the spectrum hole usable by a secondary station. By being able to carry out sensing without requiring the transmitter to remain silent, this creates the potential for significant throughput gains.","PeriodicalId":309036,"journal":{"name":"2012 9th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126416224","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 : 2012-02-16DOI: 10.1109/WONS.2012.6152219
S. Petridou, Stylianos Basagiannis
Secure Sockets Layer (SSL) protocol is the most popular security protocol, which provides confidentiality, authentication and integrity protection in Internet transactions. Nowadays, a large portion of them are executed by battery-powered handheld devices, such as personal digital assistants (PDAs), which are severely constrained by their resources, e.g. battery. This work launches an energy-aware study of the SSL Handshake protocol, the most complex part of SSL, considering a number of mobile SSL clients trying to simultaneously establish a secure connection with an SSL server. The proposed analysis is based upon the development of a Continuous Time Markov Chain (CTMC) model augmented with energy rewards, derived by the SSL execution on an iPAQ PDA. The novelty of our approach is that it constructs a model, tunable to communication-related parameters, such as the Bit Error Rate (BER), and verification errors, which overhead client-side energy consumption. In turn, both probabilistic and quantitative verification results are derived. The first ones validate the successful completion of handshakes and the later exhibit the impact of various parameters, such as cipher suites and verification error, on the energy requirements of SSL handshake in mobile communications.
{"title":"Towards energy consumption evaluation of the SSL handshake protocol in mobile communications","authors":"S. Petridou, Stylianos Basagiannis","doi":"10.1109/WONS.2012.6152219","DOIUrl":"https://doi.org/10.1109/WONS.2012.6152219","url":null,"abstract":"Secure Sockets Layer (SSL) protocol is the most popular security protocol, which provides confidentiality, authentication and integrity protection in Internet transactions. Nowadays, a large portion of them are executed by battery-powered handheld devices, such as personal digital assistants (PDAs), which are severely constrained by their resources, e.g. battery. This work launches an energy-aware study of the SSL Handshake protocol, the most complex part of SSL, considering a number of mobile SSL clients trying to simultaneously establish a secure connection with an SSL server. The proposed analysis is based upon the development of a Continuous Time Markov Chain (CTMC) model augmented with energy rewards, derived by the SSL execution on an iPAQ PDA. The novelty of our approach is that it constructs a model, tunable to communication-related parameters, such as the Bit Error Rate (BER), and verification errors, which overhead client-side energy consumption. In turn, both probabilistic and quantitative verification results are derived. The first ones validate the successful completion of handshakes and the later exhibit the impact of various parameters, such as cipher suites and verification error, on the energy requirements of SSL handshake in mobile communications.","PeriodicalId":309036,"journal":{"name":"2012 9th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117093709","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 : 2012-02-16DOI: 10.1109/WONS.2012.6152220
Giuseppe Corrente, R. Gaeta, Marco Grangetto, M. Sereno
In this paper we consider mobile nodes (pedestrian and vehicles) and fixed terminals in a urban area that are interested in collecting the information originated from several sources. In particular, each terminal aims at retrieving the data items in a limited region of interest centered around the node position. Furthermore, for mobile terminals the region of interest is a time varying concept due to the dynamic behavior of nodes. The goal of the paper is to evaluate the amount of information each node is able to gather resorting to simple distributed data collection and sharing through local broadcast communications among neighboring nodes.
{"title":"Collaborative data retrieval using opportunistic networking","authors":"Giuseppe Corrente, R. Gaeta, Marco Grangetto, M. Sereno","doi":"10.1109/WONS.2012.6152220","DOIUrl":"https://doi.org/10.1109/WONS.2012.6152220","url":null,"abstract":"In this paper we consider mobile nodes (pedestrian and vehicles) and fixed terminals in a urban area that are interested in collecting the information originated from several sources. In particular, each terminal aims at retrieving the data items in a limited region of interest centered around the node position. Furthermore, for mobile terminals the region of interest is a time varying concept due to the dynamic behavior of nodes. The goal of the paper is to evaluate the amount of information each node is able to gather resorting to simple distributed data collection and sharing through local broadcast communications among neighboring nodes.","PeriodicalId":309036,"journal":{"name":"2012 9th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115305903","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 : 2012-02-16DOI: 10.1109/WONS.2012.6152234
A. Ghittino, N. D. Maio, D. D. Tommaso
Evaluating the available bandwidth in a wireless LAN is a challenging task because the throughput depends on several factors such as RSSI (Received Signal Strength Indication), interferers and packet size. Moreover, in a real scenario it is not sufficient to evaluate periodically the throughput of the network, but a continuous monitoring is required in order to detect as soon as possible network problems and saturation phenomena. When wireless LAN is used to transmit high priority traffic (e.g. voice and video flows), an admission control procedure based on residual bandwidth evaluation is necessary to verify that required resources are available. We propose a mechanism based on active traffic probing with low priority packets: this approach enables us to simulate a real data flow and, on the other hand, does not interfere with existing flows. Our method relies on IEEE 802.11e (WMM - Wireless MultiMedia) support and does not require any customization of network devices. Through this approach the residual bandwidth can be continuously monitored. This measurement accounts for both the characteristics of active flows (different packet sizes and rates) and external interferences, offering accurate bandwidth estimation.
{"title":"WiFi network residual bandwidth estimation: A prototype implementation","authors":"A. Ghittino, N. D. Maio, D. D. Tommaso","doi":"10.1109/WONS.2012.6152234","DOIUrl":"https://doi.org/10.1109/WONS.2012.6152234","url":null,"abstract":"Evaluating the available bandwidth in a wireless LAN is a challenging task because the throughput depends on several factors such as RSSI (Received Signal Strength Indication), interferers and packet size. Moreover, in a real scenario it is not sufficient to evaluate periodically the throughput of the network, but a continuous monitoring is required in order to detect as soon as possible network problems and saturation phenomena. When wireless LAN is used to transmit high priority traffic (e.g. voice and video flows), an admission control procedure based on residual bandwidth evaluation is necessary to verify that required resources are available. We propose a mechanism based on active traffic probing with low priority packets: this approach enables us to simulate a real data flow and, on the other hand, does not interfere with existing flows. Our method relies on IEEE 802.11e (WMM - Wireless MultiMedia) support and does not require any customization of network devices. Through this approach the residual bandwidth can be continuously monitored. This measurement accounts for both the characteristics of active flows (different packet sizes and rates) and external interferences, offering accurate bandwidth estimation.","PeriodicalId":309036,"journal":{"name":"2012 9th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)","volume":"33 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120987018","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 : 2012-02-16DOI: 10.1109/WONS.2012.6152244
P. Szczytowski, Abdelmajid Khelil, N. Suri
The reliability of Wireless Sensor Networks (WSN) is detrimentally impacted by unreliable wireless communication and the finite energy of sensor nodes. An advocated approach for assuring fault tolerant WSN is providing global k-connectivity. This property guarantees that the failure of up to k - 1 sensor nodes does not cause network partitioning. k-connectivity is a well studied property of WSN including the aspects of topology control, k-connected dominating set construction, controlled deployment, relay nodes placement, and detection of level of k-connectivity. In this work, we target the repair/maintenance aspect of k-connectivity. Our goal is to allow the network to provide localized, sustainable maintenance, which is capable of efficiently restoring/main-taining the WSN desired k-connect-ivity. We present a fully distributed technique that is competitively resource efficient to state-of-the-art approaches. Unlike existing techniques, our approach also provides the necessary efficient mechanisms to avoid network partitioning and the longer routing paths caused by node failures. We present both analysis and simulations to show the effectiveness and efficiency of our solution to maintain high responsiveness.
{"title":"DKM: Distributed k-connectivity maintenance in Wireless Sensor Networks","authors":"P. Szczytowski, Abdelmajid Khelil, N. Suri","doi":"10.1109/WONS.2012.6152244","DOIUrl":"https://doi.org/10.1109/WONS.2012.6152244","url":null,"abstract":"The reliability of Wireless Sensor Networks (WSN) is detrimentally impacted by unreliable wireless communication and the finite energy of sensor nodes. An advocated approach for assuring fault tolerant WSN is providing global k-connectivity. This property guarantees that the failure of up to k - 1 sensor nodes does not cause network partitioning. k-connectivity is a well studied property of WSN including the aspects of topology control, k-connected dominating set construction, controlled deployment, relay nodes placement, and detection of level of k-connectivity. In this work, we target the repair/maintenance aspect of k-connectivity. Our goal is to allow the network to provide localized, sustainable maintenance, which is capable of efficiently restoring/main-taining the WSN desired k-connect-ivity. We present a fully distributed technique that is competitively resource efficient to state-of-the-art approaches. Unlike existing techniques, our approach also provides the necessary efficient mechanisms to avoid network partitioning and the longer routing paths caused by node failures. We present both analysis and simulations to show the effectiveness and efficiency of our solution to maintain high responsiveness.","PeriodicalId":309036,"journal":{"name":"2012 9th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121389858","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 : 2012-02-16DOI: 10.1109/WONS.2012.6152229
L. Maccari, R. Cigno
Pervasive computing and communications are (slowly) enabling local ad-hoc services. Preserving privacy in a pervasive environment is one of the key challenges ahead: How can users define their “communication boundaries”? how can the network avoid wasting resources and eventually collapse under the burden of undesired traffic that will be discarded at the receiver machine? In this paper we propose the adoption of distributed filtering techniques implementing a network-wide firewall whose goal is defining precisely, and under the user control, the boundaries in space, time, information content, and logical addressing of a user communication scope. Initial results based on an implementation integrated with OLSR are presented.
{"title":"Privacy in the pervasive era: A distributed firewall approach","authors":"L. Maccari, R. Cigno","doi":"10.1109/WONS.2012.6152229","DOIUrl":"https://doi.org/10.1109/WONS.2012.6152229","url":null,"abstract":"Pervasive computing and communications are (slowly) enabling local ad-hoc services. Preserving privacy in a pervasive environment is one of the key challenges ahead: How can users define their “communication boundaries”? how can the network avoid wasting resources and eventually collapse under the burden of undesired traffic that will be discarded at the receiver machine? In this paper we propose the adoption of distributed filtering techniques implementing a network-wide firewall whose goal is defining precisely, and under the user control, the boundaries in space, time, information content, and logical addressing of a user communication scope. Initial results based on an implementation integrated with OLSR are presented.","PeriodicalId":309036,"journal":{"name":"2012 9th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114942467","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 : 2012-02-16DOI: 10.1109/WONS.2012.6152242
G. Wagenknecht, M. Anwander, T. Braun
Using multicast communication in Wireless Sensor Networks (WSNs) is an efficient way to disseminate the same data (from one sender) to multiple receivers, e.g., transmitting code updates to a group of sensor nodes. Due to the nature of code update traffic a multicast protocol has to support bulky traffic and end-to-end reliability. We are interested in an energy-efficient multicast protocol due to the limited resources of wireless sensor nodes. Current data dissemination schemes do not fulfill the above requirements. In order to close the gap, we designed and implemented the SNOMC (Sensor Node Overlay Multicast) protocol. It is an overlay multicast protocol, which supports reliable, time-efficient, and energy-efficient data dissemination of bulky data from one sender to many receivers. To ensure end-to-end reliability, SNOMC uses a NACK-based reliability mechanism with different caching strategies.
{"title":"SNOMC: An overlay multicast protocol for Wireless Sensor Networks","authors":"G. Wagenknecht, M. Anwander, T. Braun","doi":"10.1109/WONS.2012.6152242","DOIUrl":"https://doi.org/10.1109/WONS.2012.6152242","url":null,"abstract":"Using multicast communication in Wireless Sensor Networks (WSNs) is an efficient way to disseminate the same data (from one sender) to multiple receivers, e.g., transmitting code updates to a group of sensor nodes. Due to the nature of code update traffic a multicast protocol has to support bulky traffic and end-to-end reliability. We are interested in an energy-efficient multicast protocol due to the limited resources of wireless sensor nodes. Current data dissemination schemes do not fulfill the above requirements. In order to close the gap, we designed and implemented the SNOMC (Sensor Node Overlay Multicast) protocol. It is an overlay multicast protocol, which supports reliable, time-efficient, and energy-efficient data dissemination of bulky data from one sender to many receivers. To ensure end-to-end reliability, SNOMC uses a NACK-based reliability mechanism with different caching strategies.","PeriodicalId":309036,"journal":{"name":"2012 9th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130375514","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
扫码关注我们
求助内容：
应助结果提醒方式：