{"title":"A Trust Based Framework for Secure Data Aggregation in Wireless Sensor Networks","authors":"W. Zhang, Sajal K. Das, Yonghe Liu","doi":"10.1109/SAHCN.2006.288409","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288409","url":null,"abstract":"In unattended and hostile environments, node compromise can become a disastrous threat to wireless sensor networks and introduce uncertainty in the aggregation results. A compromised node often tends to completely reveal its secrets to the adversary which in turn renders purely cryptography-based approaches vulnerable. How to secure the information aggregation process against compromised-node attacks and quantify the uncertainty existing in the aggregation results has become an important research issue. In this paper, we address this problem by proposing a trust based framework, which is rooted in sound statistics and some other distinct and yet closely coupled techniques. The trustworthiness (reputation) of each individual sensor node is evaluated by using an information theoretic concept, Kullback-Leibler (KL) distance, to identify the compromised nodes through an unsupervised learning algorithm. Upon aggregating, an opinion, a metric of the degree of belief, is generated to represent the uncertainty in the aggregation result. As the result is being disseminated and assembled through the routes to the sink, this opinion will be propagated and regulated by Josang's belief model. Following this model, the uncertainty within the data and aggregation results can be effectively quantified throughout the network. Simulation results demonstrate that our trust based framework provides a powerful mechanism for detecting compromised nodes and reasoning about the uncertainty in the network. It further can purge false data to accomplish robust aggregation in the presence of multiple compromised nodes","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"19 1","pages":"60-69"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73366011","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}
{"title":"Relationship -based Detection of Spoofing -related Anomalous Traffic in Ad Hoc Networks","authors":"Qing Li, W. Trappe","doi":"10.1109/SAHCN.2006.288408","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288408","url":null,"abstract":"Spoofing is a serious threat for both ad hoc and sensor networks, that can cause adverse effects on a network's operations. Although cryptographic authentication can assure the identity of a transmitter, authentication is not always desirable or possible as it requires key management and more extensive computations. In this paper we argue that it is desirable to have a functionality complementary to traditional authentication that can detect device spoofing with no dependency on cryptographic material. Towards this objective, we propose using forge-resistant relationships associated with transmitted packets to detect anomalous activity. Our strategy is generic, operates in a 1-hop neighborhood, and thus can locally provide protection in order to defend ad hoc or sensor networks from anomalous intrusions. As two specific constructions, we explore the use of monotonic relationships in the sequence number fields, and the enforcement of statistical characteristics of legitimate traffic. We then provide an example of how these relationships can be used to construct a classifier that provides a multi-level threat assessment. We validate the usefulness of these methods for anomalous traffic scenarios involving multiple sources sharing the same MAC address through experiments conducted on the ORBIT wireless testbed","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"40 1","pages":"50-59"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79299168","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}
{"title":"Power Efficient and Low Latency MAC for Wireless Sensor Networks","authors":"Sumeet N. Parmar, Sukumar Nandi, A. Chowdhury","doi":"10.1109/SAHCN.2006.288586","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288586","url":null,"abstract":"Existing protocols for medium access in wireless sensor networks opt for staggered wakeup scheduling among clusters of nodes. However intra-cluster contention and interference has remained an unaddressed issue. In this work we propose PELLMAC: power efficient and low latency MAC for wireless sensor networks, a schema that addresses node scheduling for channel access. By limiting contention between adjacent branches of the data gathering tree, we are able to reduce the latency of the network, as well as optimize energy utilization. Simulation results, in accordance with our claims, show that PELLMAC enhances performance in energy savings, latency and delivery ratio","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"25 1","pages":"940-944"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80152539","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}
{"title":"Analysis of Co-existence between IEEE 802.11 and IEEE 802.16 Systems","authors":"N. J. Thomas, M. Willis, K. Craig","doi":"10.1109/SAHCN.2006.288520","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288520","url":null,"abstract":"Both IEEE 802.11 and IEEE 802.16 standards have become widespread throughout the world in license-exempt spectrum specifically in the 5 GHz band. However there is a problem in that the two standards are not designed to co-exist in close proximity together on the same or overlapping channels. In this paper an initial analysis of the performance degradation for co-existing IEEE 802.11 and IEEE 802.16 systems is presented. Analysis is carried out at the medium access control (MAC) layer by means of an event model based simulation tool. The results show that in co-existence scenarios the performance of both systems will degrade severely and as a result spectrum efficiency can drop to close to zero","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"51 1","pages":"615-620"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85923387","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}
{"title":"A NEW SOLUTION BASED ON MONTE CARLO TO WIRELESS SENSOR NETWORK DENSITY CONTROL PROBLEM","authors":"Jia Yufii, D. Tianlin","doi":"10.1109/SAHCN.2006.288577","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288577","url":null,"abstract":"An effective approach for energy conservation in wireless sensor networks is to schedule sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. In this paper, we proposed a new scheme based on Monte Carlo algorithm to test whether the nodes deployed in interested region are redundant or not. The computational complexity is only O (n). It also established the coverage collision detection and back-off mechanism applied in the wireless sensor network. The simulation results show that the system can cover all the interested area with least nodes and the coverage void will not appear during the course of state-transition. The coverage collision detection and back-off mechanism proposed in this article can be applied when the nodes both have synchronous and asynchronous mechanism. It also provides a stable stage with the length of the time can be adjusted","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"14 1","pages":"886-891"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90730333","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}
{"title":"Performance of Cooperative and Single Relay Sensor Networks Under Same Energy Constraints","authors":"Lichuan Liu, Zhigang Wang","doi":"10.1109/SAHCN.2006.288559","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288559","url":null,"abstract":"This work studies the impact of the network resource constraints on the performance of wireless multi-hop relay sensor networks. The cooperative relay method based on the differential space-time block code (DSTBC) in sensor network is introduced. The energy consumption is also investigated for different kinds of relay method. Based on the same total energy consumption requirement, we analyze the system performance using M/G/1 queueing system. The performance evaluation show that the cooperative relay scheme can significantly increase the system performance in terms of throughput and end-to-end delay in high SNR environment","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"21 1","pages":"767-772"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88968876","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}
{"title":"SECON 2006 - Additional Reviewers","authors":"","doi":"10.1109/sahcn.2006.288397","DOIUrl":"https://doi.org/10.1109/sahcn.2006.288397","url":null,"abstract":"The conference offers a note of thanks and lists its reviewers.","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"22 1","pages":"x-x"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83355326","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}
{"title":"Energy Efficiency in OLSR Protocol","authors":"C. Taddia, A. Giovanardi, G. Mazzini","doi":"10.1109/SAHCN.2006.288562","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288562","url":null,"abstract":"In this paper we study in details the optimized link state routing (OLSR) protocol for ad hoc networks. In particular, we investigate its performance by focusing the attention on its energy efficiency. To have some terms of comparison the performance are compared with those of other routing schemes. Furthermore, to improve the energy efficiency by increasing the network life time, we propose and discuss a power controlled version of OLSR. OLSR power controlled provides the optimal paths in terms of minimum power needed to reach the destination, and not in terms of number of hops as in the classic version. By means of extensive simulations, we show that, in many system conditions, OLSR power controlled is able to achieve good energy savings","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"70 1","pages":"792-796"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75142388","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}
{"title":"When Does Cooperation Have Better Performance in Sensor Networks?","authors":"A. Sadek, Wei Yu, K. Liu","doi":"10.1109/SAHCN.2006.288423","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288423","url":null,"abstract":"The gains of cooperative communications in wireless networks have been explored recently under the ideal assumption of negligible receiving and processing power. In sensor networks, the power spent for listening and computing can constitute a significant portion of the total consumed power, and such an overhead can reduce the gains promised by cooperation. In this paper, cooperation gains are investigated by taking into consideration such overheads in the analytical framework. The performance metric considered is the energy efficiency of the system measured by the total power required to achieve a certain quality of service requirement. The analytical and numerical results reveal very interesting threshold behavior below which direct transmission is more energy efficient, and above which cooperation provides more gains. Such a tradeoff is shown to depend on many parameters such as the relative locations of the source and destination, the values of the receive and processing powers, the application, and many other factors. Moreover, there are experimental results conducted to verify the channel model assumed in the paper","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"56 1","pages":"188-197"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76113215","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}
{"title":"Doughnut Effect in Wireless Sensor Network and its Solution","authors":"K. Padmanabh, R. Roy","doi":"10.1109/SAHCN.2006.288589","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288589","url":null,"abstract":"The sensor nodes in a network are connected to the outer world via a base station. Base stations (BS) have some back up power and it is not suppose to fail due to shortage of battery power. The nodes which are away from the base station communicate to it via the nodes which are in proximity of BS. Thus the nodes which are nearer to BS have additional communication responsibilities of forwarding data of distant nodes. Thus the nodes which are in proximity of BS will run out of battery very soon and create bottleneck for communication. In this paper we have proposed that if the density of sensor nodes increases as we move towards base station this effect can be minimized. We found the exact density of the sensor nodes at a particular distance from BS to avoid bottleneck phenomenon around it. We have considered the real life scenario (i) sensor nodes are dropped from the aeroplane with possible error in its position from predetermined coordinates and (ii) nodes generates data only when there is an event of interest with a given probability of occurrence. The main contribution of this paper with our proposed strategy is lifetime offered per unit cost of deployment is almost double","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"242 1","pages":"957-963"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73362558","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}