Pub Date : 2021-03-09DOI: 10.1016/J.DCAN.2021.03.002
Gautam Srivastava, Jerry Chun‐wei Lin, Y. Djenouri, Unil Yun, Chien-Fu Cheng, Guo Lin
{"title":"Security protocol of sensitive high utility itemset hiding in shared IoT environments","authors":"Gautam Srivastava, Jerry Chun‐wei Lin, Y. Djenouri, Unil Yun, Chien-Fu Cheng, Guo Lin","doi":"10.1016/J.DCAN.2021.03.002","DOIUrl":"https://doi.org/10.1016/J.DCAN.2021.03.002","url":null,"abstract":"","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/J.DCAN.2021.03.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48940615","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 : 2019-01-14DOI: 10.1016/J.DCAN.2019.01.001
F. Farhadian, Mohammad Mansour Riahi Kashani, J. Rezazadeh, R. Farahbakhsh, K. Sandrasegaran
{"title":"WITHDRAWN: An efficient IoT cloud energy consumption based on genetic algorithm","authors":"F. Farhadian, Mohammad Mansour Riahi Kashani, J. Rezazadeh, R. Farahbakhsh, K. Sandrasegaran","doi":"10.1016/J.DCAN.2019.01.001","DOIUrl":"https://doi.org/10.1016/J.DCAN.2019.01.001","url":null,"abstract":"","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/J.DCAN.2019.01.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43142157","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 : 2018-01-01DOI: 10.1016/J.DCAN.2018.04.001
Cheng-Jie Tsai, Tsern-Huei Lee
{"title":"Quality-of-service support in LTE-A systems with the DRX mechanism","authors":"Cheng-Jie Tsai, Tsern-Huei Lee","doi":"10.1016/J.DCAN.2018.04.001","DOIUrl":"https://doi.org/10.1016/J.DCAN.2018.04.001","url":null,"abstract":"","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/J.DCAN.2018.04.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54170699","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 : 2006-09-28DOI: 10.1109/SAHCN.2006.288431
A. Ruzzelli, Gregory M. P. O'Hare, M. O'Grady, R. Tynan
Notoriously, energy-efficient MAC protocols cause high latency of packets. Such delays may well increase when a routing protocol is applied. Therefore, quantifying the end-to-end delay and energy consumption when low duty cycle MAC and routing protocols are jointly used, is of particular interest. In this paper, we present a comprehensive evaluation of the MERLIN (MAC and efficient routing integrated with support for localization) protocol. MERLIN integrates MAC and routing features into a single architecture. In contrast to many sensor network protocols, it employs a multicast upstream and multicast downstream approach to relaying packets to and from the gateway. Simultaneous reception and transmission errors are notified by using asynchronous burst ACK and negative burst ACK. A division of the network into timezones, together with an appropriate scheduling policy, enables the routing of packets to the closest gateway. An evaluation of MERLIN has been conducted through simulation, against both the SMAC and the ESR routing protocols,which is an improved version of the DSR algorithm. The results illustrate how both SMAC and ESR, jointly used in low duty cycle scenarios, can cause an impractical and very high end-to-end delays. MERLIN, as an integrated approach, notably reduces the latency, resulting in nodes that can operate in a very low duty cycle. Consequently, an extension of the operative lifetime of the sensor network is achieved.
{"title":"MERLIN: A Synergetic Integration of MAC and Routing Protocol for Distributed Sensor Networks","authors":"A. Ruzzelli, Gregory M. P. O'Hare, M. O'Grady, R. Tynan","doi":"10.1109/SAHCN.2006.288431","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288431","url":null,"abstract":"Notoriously, energy-efficient MAC protocols cause high latency of packets. Such delays may well increase when a routing protocol is applied. Therefore, quantifying the end-to-end delay and energy consumption when low duty cycle MAC and routing protocols are jointly used, is of particular interest. In this paper, we present a comprehensive evaluation of the MERLIN (MAC and efficient routing integrated with support for localization) protocol. MERLIN integrates MAC and routing features into a single architecture. In contrast to many sensor network protocols, it employs a multicast upstream and multicast downstream approach to relaying packets to and from the gateway. Simultaneous reception and transmission errors are notified by using asynchronous burst ACK and negative burst ACK. A division of the network into timezones, together with an appropriate scheduling policy, enables the routing of packets to the closest gateway. An evaluation of MERLIN has been conducted through simulation, against both the SMAC and the ESR routing protocols,which is an improved version of the DSR algorithm. The results illustrate how both SMAC and ESR, jointly used in low duty cycle scenarios, can cause an impractical and very high end-to-end delays. MERLIN, as an integrated approach, notably reduces the latency, resulting in nodes that can operate in a very low duty cycle. Consequently, an extension of the operative lifetime of the sensor network is achieved.","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"41 1","pages":"266-275"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77886817","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 : 2006-09-25DOI: 10.1109/SAHCN.2006.288440
Jessica Feng, M. Potkonjak
We have developed a new error modeling and optimization-based localization approach for sensor networks in presence of distance measurement noise. The approach is solely based on the concept of consistency. The error models are constructed using non-parametric statistical techniques; they do not only indicate the most likely error, but also provide the likelihood distribution of particular errors occurring. The models are evaluated using the learn-and-test techniques and serve as the objective functions for the task of localization. The localization problem is formulated as task of maximizing consistency between measurements and calculated distances. We evaluated the approach in (i) both GPS-based and GPS-less scenarios; (ii) 1-D, 2-D and 3-D spaces, on sets of acoustic ranging-based distance measurements recorded by deployed sensor networks. The experimental evaluation indicates that localization of only a few centimeters is consistently achieved when the average and median distance measurement errors are more than a meter, even when the nodes have only a few distance measurements. The relative performance in terms of location accuracy compare favorably with respect to several state-of-the-art localization approaches. Finally, several insightful observations about the required conditions for accurate localization are deduced by analyzing the experimental results
{"title":"Consistency Error Modeling-based Localization in Sensor Networks","authors":"Jessica Feng, M. Potkonjak","doi":"10.1109/SAHCN.2006.288440","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288440","url":null,"abstract":"We have developed a new error modeling and optimization-based localization approach for sensor networks in presence of distance measurement noise. The approach is solely based on the concept of consistency. The error models are constructed using non-parametric statistical techniques; they do not only indicate the most likely error, but also provide the likelihood distribution of particular errors occurring. The models are evaluated using the learn-and-test techniques and serve as the objective functions for the task of localization. The localization problem is formulated as task of maximizing consistency between measurements and calculated distances. We evaluated the approach in (i) both GPS-based and GPS-less scenarios; (ii) 1-D, 2-D and 3-D spaces, on sets of acoustic ranging-based distance measurements recorded by deployed sensor networks. The experimental evaluation indicates that localization of only a few centimeters is consistently achieved when the average and median distance measurement errors are more than a meter, even when the nodes have only a few distance measurements. The relative performance in terms of location accuracy compare favorably with respect to several state-of-the-art localization approaches. Finally, several insightful observations about the required conditions for accurate localization are deduced by analyzing the experimental results","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"50 1","pages":"356-364"},"PeriodicalIF":0.0,"publicationDate":"2006-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76630221","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 : 2006-09-01DOI: 10.1109/SAHCN.2006.288519
A. Tsertou, D. Laurenson
The last couple of years were characterised by the revival of interest in the performance evaluation of wireless multihop networks. An issue of great significance in carrier-sense based multihop networks is the hidden node problem. In our recent work we showed that previous techniques are suitable for limited node configurations and we proposed a novel time model that relaxes most assumptions in the literature and exhibits high accuracy of performance evaluation. The present paper extends our recent work, which was based on a constant contention window assumption, to the binary exponential backoff (BEB) mechanism of IEEE 802.11, with an equally high degree of agreement to simulation results. Key points of our analysis are the consideration of different collision probabilities, dependent on the backoff stage, and the use of a discrete time Markov chain embedded in the channel state evolution that allows us to compute the 'backoff-dwelling' distribution of each transmitter
{"title":"Modeling the Effect of BEB for a Hidden Terminal Topology from a New Perspective","authors":"A. Tsertou, D. Laurenson","doi":"10.1109/SAHCN.2006.288519","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288519","url":null,"abstract":"The last couple of years were characterised by the revival of interest in the performance evaluation of wireless multihop networks. An issue of great significance in carrier-sense based multihop networks is the hidden node problem. In our recent work we showed that previous techniques are suitable for limited node configurations and we proposed a novel time model that relaxes most assumptions in the literature and exhibits high accuracy of performance evaluation. The present paper extends our recent work, which was based on a constant contention window assumption, to the binary exponential backoff (BEB) mechanism of IEEE 802.11, with an equally high degree of agreement to simulation results. Key points of our analysis are the consideration of different collision probabilities, dependent on the backoff stage, and the use of a discrete time Markov chain embedded in the channel state evolution that allows us to compute the 'backoff-dwelling' distribution of each transmitter","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"2 1","pages":"607-614"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81918464","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 : 2006-06-28DOI: 10.1109/SAHCN.2006.288560
H. Rivano, Fabrice Théoleyre, F. Valois
Assuming a given network topology and a routing protocol, this work is focused on the capacity evaluation of routing protocols based on either a self-organization scheme or a flat approach. To reach this goal, we propose to use linear-programming formulation to model radio resource sharing as linear constraints. Four models are detailed to evaluate the capacity of any routing scheme in wireless multihops networks. First, two models of fairness are proposed: either each node has a fair access to the channel, or the fairness is among the radio links. Besides, a pessimistic and an optimistic scenarios of spatial re-utilization of the medium are proposed, yielding a lower bound and an upper bound on the network capacity for each fairness case. Finally, using this model, we provide a comparative analysis of some flat and self-organized routing protocols
{"title":"Capacity Evaluation Framework and Validation of Self-Organized Routing Schemes","authors":"H. Rivano, Fabrice Théoleyre, F. Valois","doi":"10.1109/SAHCN.2006.288560","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288560","url":null,"abstract":"Assuming a given network topology and a routing protocol, this work is focused on the capacity evaluation of routing protocols based on either a self-organization scheme or a flat approach. To reach this goal, we propose to use linear-programming formulation to model radio resource sharing as linear constraints. Four models are detailed to evaluate the capacity of any routing scheme in wireless multihops networks. First, two models of fairness are proposed: either each node has a fair access to the channel, or the fairness is among the radio links. Besides, a pessimistic and an optimistic scenarios of spatial re-utilization of the medium are proposed, yielding a lower bound and an upper bound on the network capacity for each fairness case. Finally, using this model, we provide a comparative analysis of some flat and self-organized routing protocols","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"12 1","pages":"779-785"},"PeriodicalIF":0.0,"publicationDate":"2006-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78657899","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 : 2006-05-01DOI: 10.1109/SAHCN.2006.288524
T. Watteyne, A. Bachir, M. Dohler, D. Barthel, I. Augé-Blum
Wireless sensor networks (WSNs) have witnessed a tremendous upsurge in recent years, both in academia and industry; this is mainly attributed to their unprecedented operating conditions and a variety of commercially viable applications. Because of their dependence on scarce battery power, communication protocols need to be energy efficient. However, finding the optimal solution is challenging as it needs to consider the whole communication stack at once. In this paper, we propose an approach that aims at optimizing jointly L2 (link) and L3 (routing) protocols. We design 1-hopMAC, a communication architecture grouping MAC and routing layers which avoids 1-hop neighborhood knowledge. 1-hopMAC can be combined, among others, with a geographic or gradient based routing protocols. We present an analytical study of energy consumption to point out the optimal configuration of 1-hopMAC
{"title":"1-hopMAC: An Energy-Efficient MAC Protocol for Avoiding 1 -hop Neighborhood Knowledge","authors":"T. Watteyne, A. Bachir, M. Dohler, D. Barthel, I. Augé-Blum","doi":"10.1109/SAHCN.2006.288524","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288524","url":null,"abstract":"Wireless sensor networks (WSNs) have witnessed a tremendous upsurge in recent years, both in academia and industry; this is mainly attributed to their unprecedented operating conditions and a variety of commercially viable applications. Because of their dependence on scarce battery power, communication protocols need to be energy efficient. However, finding the optimal solution is challenging as it needs to consider the whole communication stack at once. In this paper, we propose an approach that aims at optimizing jointly L2 (link) and L3 (routing) protocols. We design 1-hopMAC, a communication architecture grouping MAC and routing layers which avoids 1-hop neighborhood knowledge. 1-hopMAC can be combined, among others, with a geographic or gradient based routing protocols. We present an analytical study of energy consumption to point out the optimal configuration of 1-hopMAC","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"233 1","pages":"639-644"},"PeriodicalIF":0.0,"publicationDate":"2006-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75768192","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 : 2006-01-01DOI: 10.1109/SAHCN.2006.288411
Bo Zhu, S. Jajodia, M. Kankanhalli, F. Bao, R. Deng
In this paper, we first define the requirements on anonymity and security properties of the routing protocol in mobile ad hoc networks, and then propose a new anonymous routing protocol with the local-repair mechanism. Detailed analysis shows that our protocol achieves both anonymity and security properties defined. A major challenge in designing anonymous routing protocols is to reduce computation and communication costs. To overcome this challenge, our protocol is design to require neither asymmetric nor symmetric encryption/decryption while updating the flooding route requests; more importantly, once a route is broken, instead of re-launching a new costly flooding route discovery process like previous work, our protocol provides a local-repair mechanism to fix broken parts of a route without compromising anonymity
{"title":"An Anonymous Routing Protocol with The Local-repair Mechanism for Mobile Ad Hoc Networks","authors":"Bo Zhu, S. Jajodia, M. Kankanhalli, F. Bao, R. Deng","doi":"10.1109/SAHCN.2006.288411","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288411","url":null,"abstract":"In this paper, we first define the requirements on anonymity and security properties of the routing protocol in mobile ad hoc networks, and then propose a new anonymous routing protocol with the local-repair mechanism. Detailed analysis shows that our protocol achieves both anonymity and security properties defined. A major challenge in designing anonymous routing protocols is to reduce computation and communication costs. To overcome this challenge, our protocol is design to require neither asymmetric nor symmetric encryption/decryption while updating the flooding route requests; more importantly, once a route is broken, instead of re-launching a new costly flooding route discovery process like previous work, our protocol provides a local-repair mechanism to fix broken parts of a route without compromising anonymity","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"8 1","pages":"70-79"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73441082","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
扫码关注我们
求助内容：
应助结果提醒方式：